void chmin(T& a, const T& b) noexcept {\n if (b < a)\n a = b;\n }\n template <class T> void chmax(T& a, const T& b) noexcept {\n if (a < b)\n a = b;\n }\n template <class F> class rec_lambda {\n F f;\n\n public:\n rec_lambda(F&& f) : f(std::move(f)) {}\n template <class... Args> auto operator()(Args&&... args) const {\n return f(*this, std::forward<Args>(args)...);\n }\n };\n template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }\n template <class T> T scan() {\n T ret;\n std::cin >> ret;\n return ret;\n }\n\n} // namespace n91\n#include <numeric>\nnamespace n91 {\n\n void main_() {\n /*\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n //*/\n const usize n = scan<usize>();\n const u64 m = scan<u64>();\n u64 k = scan<u64>();\n std::vector<u64> a(n);\n for (auto& e : a) {\n std::cin >> e;\n }\n if (std::accumulate(a.begin(), a.end(), static_cast<u64>(0)) <= m+k) {\n std::cout << \"0\\n\";\n return;\n }\n std::sort(a.begin(), a.end());\n usize s = n - 1;\n u64 rem = m;\n while (true) {\n if (a[s] <= rem) {\n rem -= a[s];\n s -= 1;\n }\n else {\n break;\n }\n }\n const auto get = [](const u64 a, const u64 b) {\n return (b * (b + 1) - a * (a + 1)) / 2;\n };\n u64 ups = 0;\n for (const usize i : rep(0, s + 1)) {\n if (a[i] >= rem) {\n ups += a[i] - rem;\n }\n }\n if (ups < k) {\n k -= a[s] - rem;\n rem = 0;\n s -= 1;\n }\n u64 gt = rem, le = a[s] + 1;\n while (le - gt != 1) {\n const u64 mid = (le + gt) / 2;\n u64 sum = 0;\n for (const usize i : rep(0, s + 1)) {\n if (a[i] >= mid) {\n sum += a[i] - mid;\n }\n }\n if (sum <= k) {\n le = mid;\n }\n else {\n gt = mid;\n }\n }\n u64 ans = 0;\n for (const usize i : rep(0, s)) {\n ans += get(0, std::min(a[i], le));\n }\n ans += get(rem, le);\n u64 sum = 0;\n for (const usize i : rep(0, s + 1)) {\n if (a[i] >= le) {\n sum += a[i] - le;\n }\n }\n ans -= le * (k - sum);\n std::cout << ans << std::endl;\n }\n\n} // namespace n91\n\nint main() {\n n91::main_();\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3628,"score_of_the_acc":-0.5437,"final_rank":8},{"submission_id":"aoj_3144_4279158","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N;\n int64_t M, K;\n cin >> N >> M >> K;\n vector<int> A(N);\n for(int i=0; i<N; i++) cin >> A[i];\n sort(A.begin(), A.end());\n int64_t S = accumulate(A.begin(), A.end(), 0LL);\n int64_t need = S-M;\n if(need <= 0){\n cout << 0 << endl;\n return 0;\n }\n\n vector<int64_t> num(M+1);\n for(int a : A){\n if(need > a){\n need -= a;\n num[a]++;\n }else{\n num[a]++;\n num[a-need]--;\n break;\n }\n }\n for(int i=M; i>0; i--) num[i-1] += num[i];\n int64_t ans = 0;\n for(int i=M; i>0; i--){\n int64_t dec = min(num[i], K);\n K -= dec;\n num[i] -= dec;\n ans += num[i]*i;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":10900,"score_of_the_acc":-1.4165,"final_rank":15},{"submission_id":"aoj_3144_4279087","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<cassert>\n#include<cmath>\n#include<vector>\n#include<map>\n#include<set>\n#include<string>\n#include<queue>\n#include<stack>\nusing namespace std;\n#define MOD 1000000007\n#define MOD2 998244353\n#define INF ((1<<30)-1)\n#define LINF (1LL<<60)\n#define EPS (1e-10)\ntypedef long long Int;\ntypedef pair<Int, Int> P;\nInt rest;\n\nInt cnt(vector<Int> &a, Int m){\n Int ans = 0;\n for(int i = 0;i < a.size() - 1;i++){\n ans += max(0ll, a[i] - m + 1);\n }\n ans += a.back() - max(rest, m-1);\n return ans;\n}\n\nint main(){\n Int n, m, k;\n cin >> n >> m >> k;\n vector<Int> a(n);\n for(int i = 0;i < n;i++){\n cin >> a[i];\n }\n sort(a.begin(), a.end());\n\n rest = m;\n while(!a.empty() && a.back() <=rest){\n rest -= a.back();\n a.pop_back();\n }\n \n Int sum = 0;\n for(auto x:a)sum += x;\n if(sum - k - rest <= 0){\n cout << 0 << endl;\n return 0; \n }\n \n Int bottom = 0, top = a.back() + 1;\n while(top - bottom > 1){\n Int mid = (top + bottom) / 2;\n if(cnt(a, mid) <= k)top = mid;\n else bottom = mid;\n }\n for(int i = 0;i < a.size();i++){\n Int goal = top-1;\n if(i+1 == a.size())goal = max(goal, rest);\n if(a[i] >= goal){\n k -= a[i] - goal;\n a[i] = goal;\n }\n }\n if(a.back() == rest){\n rest = 0;\n a.pop_back();\n }\n for(int i = (int)a.size()-1;i >= 0 && k > 0;i--){\n a[i]--;\n k--;\n }\n Int ans = 0;\n for(auto x:a)ans += (x+1) * x / 2;\n ans -= (rest + 1) * rest / 2;\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3640,"score_of_the_acc":-0.5451,"final_rank":9},{"submission_id":"aoj_3144_4279022","code_snippet":"#include <bits/stdc++.h>\n#define FOR(i,k,n) for(int i = (k);i < (n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(x) begin(x),end(x)\n\nusing namespace std;\nusing namespace std::string_literals;\nusing ll = int64_t;\nusing vecint = vector<int>;\nusing vecll = vector<ll>;\n\nint main() {\n ll n,m,k;\n cin>>n>>m>>k;\n vecll a(n);\n for(auto&& e:a) cin>>e;\n sort(ALL(a));\n ll sum = 0;\n ll i;\n for(i = n-1; i >= 0; --i) {\n if (sum + a[i] > m) break;\n sum += a[i];\n }\n if (i < 0) {\n cout<<0<<endl;\n return 0;\n }\n ll rem = m - sum;\n ll lo = -1;\n ll hi = m;\n while (hi-lo > 1) {\n ll mid = (hi + lo) / 2;\n ll cnt_punch = 0;\n ll num = 0;\n REP(j,i) {\n if (a[j] > mid) ++num;\n cnt_punch += max(a[j] - mid, 0l);\n }\n ll fin = max(mid, rem);\n if (a[i] > fin && fin == mid) ++num;\n cnt_punch += max(a[i] - fin, 0l);\n if (cnt_punch - k > num) {\n lo = mid;\n } else {\n hi = mid;\n }\n }\n ll cost = 0;\n //ll num = 0;\n ll cnt_punch = 0;\n REP(j,i) {\n ll mx = min(a[j], hi); \n cost += mx * (mx+1) / 2;\n //if (a[j] > hi) ++num;\n cnt_punch += max(a[j] - hi, 0l);\n }\n ll fin = max(hi, rem);\n ll mx = min(a[i], fin);\n cost += mx * (mx+1) / 2;\n cost -= rem * (rem+1) / 2;\n //if (a[i] > fin) ++num;\n cnt_punch += max(a[i] - fin, 0l);\n if (cnt_punch > k) {\n cost += (hi+1) * (cnt_punch - k);\n }\n cout<<cost<<endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3640,"score_of_the_acc":-0.5451,"final_rank":9},{"submission_id":"aoj_3144_4278850","code_snippet":"#include <bits/stdc++.h>\n#include <iomanip>\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\n#define Rrep(i,n) Rreps(i,n,0)\n#define ALL(a) a.begin(), a.end()\n#define fi first\n#define se second\ntypedef long long ll;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nll N,M,H,W,K,Q,A,B;\nstring S;\nconst ll MOD = 998244353;\n//const ll MOD = (1e+9) + 7;\nconst ll INF = 1LL<<60;\ntypedef pair<ll, ll> P;\n\nint main() {\n cin>>N>>M>>K;\n vec a(N);\n rep(i,N) cin>>a[i];\n ll SUM = 0;\n rep(i,N) SUM += a[i];\n if(SUM - K <= M){\n cout<<0<<endl;\n return 0;\n }\n sort(ALL(a));\n reverse(ALL(a));\n ll ans = 0;\n rep(i,N) ans += a[i] * (a[i] + 1) / 2;\n int id = 0, last_sum = 0; //最後に回すやつ（これ含む）\n while(a[id] + last_sum <= M){\n last_sum += a[id];\n ans -= a[id] * (a[id] + 1)/2;\n ++id;\n }\n ll border = M - last_sum;\n ll judge = 0;\n Rreps(i, N, id) if(a[i] > border) judge += a[i] - border;\n if(judge <= K){\n K -= a[id] - border;\n ans -= a[id] * (a[id] + 1) / 2;\n ++id;\n }else{\n ans -= border * (border + 1) / 2;\n }\n a.push_back(-1);\n ll num = 1;\n ll now = a[id];\n //cout<<border<<endl;\n //cout<<ans<<endl;\n Rrep(i, now){\n while(a[id + 1] > i) {\n ++id;\n ++num;\n }\n ans -= min(num, K) * (i + 1);\n K -= num;\n if(K <= 0) break;\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":20,"memory_kb":4468,"score_of_the_acc":-0.6445,"final_rank":12},{"submission_id":"aoj_3144_4278817","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <cassert>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <string>\n#include <algorithm>\n#define llint long long\n#define inf 1e18\n#define mod 998244353\n#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)\n#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\n\nusing namespace std;\ntypedef pair<llint, llint> P;\n\nllint n, m, k;\nllint a[100005];\nvector<P> vec;\n\nllint get(llint l, llint r)\n{\n\treturn r*(r+1)/2 - l*(l+1)/2;\n}\n\nint main(void)\n{\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\t\n\tcin >> n >> m >> k;\n\tfor(int i = 1; i <= n; i++) cin >> a[i];\n\t\n\tllint rem = 0;\n\tfor(int i = 1; i <= n; i++) rem += a[i];\n\trem -= m;\n\t\n\tif(rem <= 0){\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\t\n\tsort(a+1, a+n+1);\n\tllint ans = 0;\n\tfor(int i = 1; i <= n; i++){\n\t\tif(rem <= 0) break;\n\t\tllint x = a[i]*(a[i]+1)/2;\n\t\tif(a[i] <= rem){\n\t\t\tvec.push_back(P(0, 0));\n\t\t\tvec.push_back(P(a[i], 1));\n\t\t\trem -= a[i];\n\t\t\tans += x;\n\t\t}\n\t\telse{\n\t\t\tllint lb = a[i]-rem+1;\n\t\t\tvec.push_back(P(lb-1, 0));\n\t\t\tvec.push_back(P(a[i], 1));\n\t\t\trem = 0;\n\t\t\tans += x-lb*(lb-1)/2;\n\t\t}\n\t}\n\tsort(vec.rbegin(), vec.rend());\n\t\n\trem = k;\n\tllint sum = 0;\n\tfor(int i = 0; i < vec.size(); i++){\n\t\tif(rem <= 0) break;\n\t\t\n\t\tif(vec[i].second == 1) sum++;\n\t\telse sum--;\n\t\t\n\t\tif(i < (int)vec.size()-1){\n\t\t\tllint dist = vec[i].first - vec[i+1].first;\n\t\t\tif(sum * dist <= rem){\n\t\t\t\trem -= sum * dist;\n\t\t\t\tans -= sum * get(vec[i+1].first, vec[i].first);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tllint pos = vec[i].first - rem/sum;\n\t\t\t\trem %= sum;\n\t\t\t\tans -= sum * get(pos, vec[i].first);\n\t\t\t\tans -= pos * rem;\n\t\t\t\trem = 0;\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":7860,"score_of_the_acc":-0.5516,"final_rank":11},{"submission_id":"aoj_3144_4278651","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long int;\nusing pint = pair<int, int>;\nusing plint = pair<lint, lint>;\nstruct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;\n#define ALL(x) (x).begin(), (x).end()\n#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)\n#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)\n#define REP(i, n) FOR(i,0,n)\n#define IREP(i, n) IFOR(i,0,n)\ntemplate<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }\ntemplate<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }\ntemplate<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }\ntemplate<typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }\ntemplate<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }\ntemplate<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }\ntemplate<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }\ntemplate<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << \"[\"; for (auto v : vec) os << v << \",\"; os << \"]\"; return os; }\ntemplate<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << \"deq[\"; for (auto v : vec) os << v << \",\"; os << \"]\"; return os; }\ntemplate<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << \"{\"; for (auto v : vec) os << v << \",\"; os << \"}\"; return os; }\ntemplate<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << \"{\"; for (auto v : vec) os << v << \",\"; os << \"}\"; return os; }\ntemplate<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << \"{\"; for (auto v : vec) os << v << \",\"; os << \"}\"; return os; }\ntemplate<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << \"{\"; for (auto v : vec) os << v << \",\"; os << \"}\"; return os; }\ntemplate<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << \"(\" << pa.first << \",\" << pa.second << \")\"; return os; }\ntemplate<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << \"{\"; for (auto v : mp) os << v.first << \"=>\" << v.second << \",\"; os << \"}\"; return os; }\ntemplate<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << \"{\"; for (auto v : mp) os << v.first << \"=>\" << v.second << \",\"; os << \"}\"; return os; }\n#define dbg(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \") \" << __FILE__ << endl;\n\n\nlint calccost(lint x) {\n return x * (x + 1) / 2;\n}\n\nint main()\n{\n lint N, M, K;\n cin >> N >> M >> K;\n vector<lint> A(N);\n cin >> A;\n sort(ALL(A));\n\n vector<plint> ranges;\n IREP(i, N) {\n lint pre = min(A[i], M);\n M -= pre;\n if (pre < A[i]) ranges.emplace_back(pre, A[i]);\n }\n lint no = -10, ok = 1e12;\n while (abs(ok - no) > 1) {\n lint c = (ok + no) / 2;\n lint cnt = 0;\n for (auto p : ranges) {\n if (p.second < c) continue;\n if (p.first < c) cnt += p.second - c + 1;\n else cnt += p.second - p.first;\n }\n if (cnt > K) no = c;\n else ok = c;\n }\n for (auto &p : ranges) if (p.second >= ok) {\n if (ok > p.first) {\n lint dec = p.second - ok + 1;\n K -= dec;\n p.second -= dec;\n }\n else {\n K -= p.second - p.first;\n p.second = p.first;\n }\n }\n lint ret = 0;\n for (auto p : ranges)\n {\n if (p.second == ok - 1 and p.first < p.second and K) p.second--, K--;\n if (p.first < p.second) ret = ret + calccost(p.second) - calccost(p.first);\n }\n cout << ret << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":5780,"score_of_the_acc":-0.302,"final_rank":6},{"submission_id":"aoj_3144_4278578","code_snippet":"#include <bits/stdc++.h> // clang-format off\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se second\n#define each(x,v) for(auto& x : v)\n#define all(v) (v).begin(),(v).end()\n#define sz(v) ((int)(v).size())\n#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)\n#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)\n#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)\n#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)\n#define in2(s,t) rep(i,sz(s)){in(s[i] , t[i]);}\n#define in3(s,t,u) rep(i,sz(s)){in(s[i] , t[i] , u[i]);}\n#define in4(s,t,u,v) rep(i,sz(s)){in(s[i] , t[i] , u[i] , v[i]);}\n#ifdef ONLINE_JUDGE\n #define rep(i,N) for(int i = 0; i < (int)(N); i++)\n #define repr(i,N) for(int i = (int)(N) - 1; i >= 0; i--)\n #define rep1(i,N) for(int i = 1; i <= (int)(N) ; i++)\n #define repr1(i,N) for(int i = (N) ; (int)(i) > 0 ; i--)\n#else\n #define rep(i,N) for(long long i = 0; i < (long long)(N); i++)\n #define repr(i,N) for(long long i = (long long)(N) - 1; i >= 0; i--)\n #define rep1(i,N) for(long long i = 1; i <= (long long)(N) ; i++)\n #define repr1(i,N) for(long long i = (N) ; (long long)(i) > 0 ; i--)\n#endif\nusing namespace std; void solve();\nusing ll = long long; template<class T = ll> using V = vector<T>;\nusing vi = V<int>; using vl = V<>; using vvi = V< V<int> >;\nusing vd = V<double>; using vs = V<string>; using vvl = V< V<> >;\nconstexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1;\ntemplate<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\ntemplate<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\ntemplate<typename T,typename U>ll ceil(T a,U b){return (a + b - 1) / b;}\ntemplate<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << \" \" << p.second; return os; }\ntemplate<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }\ntemplate<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); for(int i=0;i<s;i++) os << (i ? \" \" : \"\") << v[i]; return os; }\ntemplate<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }\nvoid in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}\nvoid out(){cout << \"\\n\";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << \" \"; out(u...);}\ntemplate<typename T>void die(T x){out(x); exit(0);}\n\n#ifdef NyaanDebug\n #include \"NyaanDebug.h\"\n #define trc(...) do { cerr << #__VA_ARGS__ << \" = \"; dbg_out(__VA_ARGS__);} while(0)\n #define trca(v,N) do { cerr << #v << \" = \"; array_out(v , N);} while(0)\n #define trcc(v) do { cerr << \"name : \" << #v << \"\\n\"; int cnt = 0; each(x , v){cerr << (cnt++) << \" : \"; trc(x); } } while(0)\n#else\n #define trc(...)\n #define trca(...)\n #define trcc(...)\n int main(){solve();}\n#endif\n\nconstexpr ll TEN(int n){ll ret=1,x=10;while(n){if(n&1)ret*=x;x*=x;n>>=1;}return ret;}\n#define mem(a, val) memset(a, val, sizeof(a))\n\nstruct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;\nusing P = pair<ll,ll>; using vp = V<P>;\nconstexpr int MOD = /** 1000000007; //*/ 998244353;\n// clang-format on\n////////////////////////////////////////////////////\n\nvoid solve(){\n inl(N , M , K);\n vl a(N); in(a);\n sort(all(a));\n ll ss = accumulate(all(a),0LL);\n if(ss <= M + K) die(0);\n\n int r = N;\n ll s = 0;\n while(r != 0 && s + a[r - 1] <= M){\n s += a[r - 1];\n r--;\n }\n // \n // r - 1番目の特殊条件\n ll rmin = M - s;\n\n // [ 0 , r )\n trc(s , r , rmin);\n // 実装が難しい\n \n // maxをxに出来ますか？\n ll ng = -1 , ok = M;\n while(ng + 1 < ok){\n ll med = (ng + ok) / 2;\n ll cur = 0;\n rep(i , r){\n if(i != r - 1) cur += max(0LL , a[i] - med);\n else cur += max(0LL , a[i] - max(med,rmin) );\n }\n (cur <= K ? ok : ng) = med;\n }\n\n trc(ok);\n \n rep(i , r){\n if(i != r - 1){\n if(a[i] > ok){\n K -= a[i] - ok;\n a[i] = ok;\n }\n }\n else{\n if(a[i] > max(rmin,ok) ){\n K -= a[i] - max(rmin,ok);\n a[i] = max(rmin,ok);\n }\n }\n }\n\n repr(i , r){\n if(i == r - 1 && a[i] == rmin) continue;\n if(K == 0) break;\n a[i]--; K--;\n }\n\n ll ans = -(rmin) * (rmin + 1) / 2;\n\n rep(i , r){\n ans += a[i] * (a[i] + 1) / 2;\n }\n out(ans);\n\n\n\n \n \n\n\n\n}","accuracy":1,"time_ms":10,"memory_kb":3640,"score_of_the_acc":-0.0451,"final_rank":2},{"submission_id":"aoj_3144_4278559","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstring>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iomanip>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n#include <cstdint>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\n#define MP make_pair\n#define PB push_back\n#define inf 1000000007\n#define rep(i,n) for(int i = 0; i < (int)(n); ++i)\n#define all(x) (x).begin(),(x).end()\n\ntemplate<typename A, size_t N, typename T>\nvoid Fill(A (&array)[N], const T &val){\n std::fill( (T*)array, (T*)(array+N), val );\n}\n \ntemplate<class T> inline bool chmax(T &a, T b){\n if(a<b){\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T> inline bool chmin(T &a, T b){\n if(a>b){\n a = b;\n return true;\n }\n return false;\n}\n\nll dp[1000010];\nint main(){\n int n;\n cin >> n;\n ll m,k;\n cin >> m >> k;\n vector<ll>a(n);\n rep(i,n)cin >> a[i];\n sort(a.rbegin(),a.rend());\n bool flag = 1;\n ll sm = 0;\n \n for(int i=0;i<n;i++){\n if(flag){\n if(sm + a[i]<=m){\n sm += a[i];\n }else{\n flag = 0;\n dp[a[i]]++;\n dp[m-sm]--;\n }\n }else{\n dp[a[i]]++;\n dp[0]--;\n }\n }\n ll cnt = 0;\n ll res = 0;\n for(ll i=1000001;i>=0;i--){\n cnt += dp[i];\n if(cnt==0)continue;\n if(k>0){\n if(k>cnt){\n k-=cnt;\n }else{\n res += (cnt-k)*i;\n k = 0;\n }\n }else{\n res += cnt*i;\n }\n }\n cout << res << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":11468,"score_of_the_acc":-1.4846,"final_rank":16},{"submission_id":"aoj_3144_4277894","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> l_l;\ntypedef pair<int, int> i_i;\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nconst long double EPS = 1e-10;\nconst long long INF = 1e18;\nconst long double PI = acos(-1.0L);\n//const ll mod = 1000000007;\nll N, M, K;\n\nll imos[1005000];\n\nint main() {\n cin >> N >> M >> K;\n vector<ll> A(N);\n for(int i = 0; i < N; i++) cin >> A[i];\n sort(A.begin(), A.end());\n ll sum = 0;\n for(int i = N - 1; i >= 0; i--) {\n ll rest = M - sum;\n if(rest < A[i]) {\n imos[A[i]]++;\n ll tmp = A[i] - rest;\n imos[A[i]-tmp]--;\n //cerr << i << \" \" << A[i] << \" \" << A[i]- tmp - 1 << endl;\n }\n sum += A[i];\n chmin(sum, M);\n }\n for(int i = 1e6; i >= 0; i--) {\n imos[i] += imos[i+1];\n }\n /*\n for(int i = 0; i <= 10; i++) {\n cerr << i << \" \"<< imos[i] << endl;\n }\n */\n ll ans = 0;\n for(int i = 1e6; i >= 1; i--) {\n ll tmp = min(imos[i], K);\n imos[i] -= tmp;\n K -= tmp;\n //if(i <= 10) cerr << i << \" \" << imos[i] << endl;\n ans += i * imos[i];\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":11596,"score_of_the_acc":-2,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_3144_9198724\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\nint main(){\\n int n;\\n ll M,k;\\n cin >> n >> M >> k;\\n\\n vector<ll> a(n+1);\\n vector<ll> as(n+1,0);\\n ll asum=0;\\n \\n for(int i=1;i<=n;i++){\\n cin >> a[i];\\n asum+=a[i];\\n }\\n if((n==1)||(M>=asum-k)){\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n sort(a.begin(),a.end());\\n for(int i=1;i<=n;i++) as[i]=as[i-1]+a[i];\\n \\n ll as1=0,asd;\\n int cc=n;\\n while(as1+a[cc]<=M){\\n as1+=a[cc];\\n a.pop_back();\\n cc--;\\n }\\n asd=M-as1;\\n //cout << asd <<\\\" \\\" << cc << endl;\\n \\n int im2;\\n\\n if(k>0){\\n ll lw=0,hi=M+1;\\n int im;\\n ll sum1,sum2;\\n while(hi-lw>1){\\n ll mid=(lw+hi)/2;\\n im=distance(a.begin(),lower_bound(a.begin(),a.end(),mid));\\n //cout << mid << \\\" \\\" << im << endl;\\n if(im==cc+1){\\n hi=mid;\\n continue;\\n }\\n sum1=(as[cc]-as[im-1])-(mid-1)*(cc-im+1)-((mid-1)>=asd ? 0 :asd-(mid-1));\\n if(k>=sum1) hi=mid;\\n else lw=mid;\\n //cout << mid << \\\" \\\" << im << \\\" \\\" << sum1 << endl;\\n }\\n im2=distance(a.begin(),lower_bound(a.begin(),a.end(),hi));\\n sum2=(as[cc]-as[im2-1])-(hi-1)*(cc-im2+1)-((hi-1)>=asd ? 0 :asd-(hi-1));\\n //cout << hi << \\\" \\\" << im2 << \\\" \\\" << k-sum2 << endl;\\n \\n for(int i=im2;i<cc;i++) a[i]=hi-1;\\n (hi-1)>asd ? a[cc]=hi-1 : a[cc]=asd;\\n \\n ll dd=k-sum2;\\n int ci=cc;\\n while(dd>0){\\n if(ci==cc){\\n if(a[ci]>asd){\\n dd--;\\n a[ci]--;\\n }\\n }else{\\n dd--;\\n a[ci]--;\\n }\\n ci--;\\n }\\n \\n }\\n \\n ll ans=0;\\n for(int i=1;i<=cc;i++){\\n ans+=(a[i]+1)*a[i]/2;\\n }\\n ans-=(asd+1)*asd/2;\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4688,\n \"score_of_the_acc\": -0.6709,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3144_9198703\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\nint main(){\\n int n;\\n ll M,k;\\n cin >> n >> M >> k;\\n\\n vector<int> a(n+1);\\n vector<ll> as(n+1,0);\\n ll asum=0;\\n \\n for(int i=1;i<=n;i++){\\n cin >> a[i];\\n asum+=a[i];\\n }\\n if((n==1)||(M>=asum-k)){\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n sort(a.begin(),a.end());\\n for(int i=1;i<=n;i++) as[i]=as[i-1]+a[i];\\n \\n ll as1=0,asd;\\n int cc=n;\\n while(as1+a[cc]<=M){\\n as1+=a[cc];\\n a.pop_back();\\n cc--;\\n }\\n asd=M-as1;\\n //cout << asd <<\\\" \\\" << cc << endl;\\n \\n int im2;\\n ll ans=0,d;\\n\\n if(k>0){\\n int lw=0,hi=M+1,im;\\n ll sum1,sum2;\\n while(hi-lw>1){\\n int mid=(lw+hi)/2;\\n im=distance(a.begin(),lower_bound(a.begin(),a.end(),mid));\\n //cout << mid << \\\" \\\" << im << endl;\\n if(im==cc+1){\\n hi=mid;\\n continue;\\n }\\n sum1=(as[cc]-as[im-1])-(mid-1)*(cc-im+1)-((mid-1)>=asd ? 0 :asd-(mid-1));\\n if(k>=sum1) hi=mid;\\n else lw=mid;\\n //cout << mid << \\\" \\\" << im << \\\" \\\" << sum1 << endl;\\n }\\n im2=distance(a.begin(),lower_bound(a.begin(),a.end(),hi));\\n sum2=(as[cc]-as[im2-1])-(hi-1)*(cc-im2+1)-((hi-1)>=asd ? 0 :asd-(hi-1));\\n //cout << hi << \\\" \\\" << im2 << \\\" \\\" << k-sum2 << endl;\\n \\n for(int i=im2;i<cc;i++) a[i]=hi-1;\\n (hi-1)>asd ? a[cc]=hi-1 : a[cc]=asd;\\n \\n ll dd=k-sum2;\\n int ci=cc;\\n while(dd>0){\\n if(ci==cc){\\n if(a[ci]>asd){\\n dd--;\\n a[ci]--;\\n }\\n }else{\\n dd--;\\n a[ci]--;\\n }\\n ci--;\\n }\\n \\n }\\n for(int i=1;i<=cc;i++){\\n ans+=((ll)a[i]+1)*a[i]/2;\\n }\\n ans-=(asd+1)*asd/2;\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.6818181818181818,\n \"time_ms\": 10,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.0326,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3144_9195490\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\nint main(){\\n int n;\\n ll M,k;\\n cin >> n >> M >> k;\\n\\n vector<int> a(n+1);\\n vector<ll> as(n+1,0);\\n ll asum=0;\\n \\n for(int i=1;i<=n;i++){\\n cin >> a[i];\\n asum+=a[i];\\n }\\n if((n==1)||(M>=asum-k)){\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n sort(a.begin(),a.end());\\n for(int i=1;i<=n;i++) as[i]=as[i-1]+a[i];\\n \\n ll as1=0,asd;\\n int cc=n;\\n while(as1+a[cc]<=M){\\n as1+=a[cc];\\n a.pop_back();\\n cc--;\\n }\\n asd=M-as1;\\n //cout << asd <<\\\" \\\" << cc << endl;\\n \\n int abb,im2;\\n ll ans=0,d;\\n\\n if(k==0){\\n abb=a[cc];\\n im2=cc;\\n \\n }else{\\n \\n int lw=0,hi=M+1,im;\\n ll sum1,sum2;\\n while(hi-lw>1){\\n int mid=(lw+hi)/2;\\n im=distance(a.begin(),lower_bound(a.begin(),a.end(),mid));\\n //cout << mid << \\\" \\\" << im << endl;\\n if(im==cc+1){\\n hi=mid;\\n continue;\\n }\\n sum1=(as[cc]-as[im-1])-a[im-1]*(cc-im+1)-(a[im-1]>=asd ? 0 :asd-a[im-1]);\\n if(k>sum1) hi=mid;\\n else lw=mid;\\n //cout << mid << \\\" \\\" << im << \\\" \\\" << sum1 << endl;\\n }\\n im2=distance(a.begin(),lower_bound(a.begin(),a.end(),lw));\\n sum2=(as[cc]-as[im2-1])-a[im2-1]*(cc-im2+1)-(a[im2-1]>=asd ? 0 :asd-a[im2-1]);\\n //cout << (as[cc]-as[im2-1]) << \\\" \\\" << a[im2-1]*(cc-im2+1) << \\\" \\\" << (a[im2-1]>=asd ? 0 :asd-a[im2-1]) << endl;\\n //cout << lw << \\\" \\\" << im2 << \\\" \\\" << sum2 << endl;\\n \\n ll dd=sum2-k;\\n int cd=cc-im2+1,df=int(dd/cd),ccd;\\n //cout << dd << \\\" \\\" << df << \\\" \\\" << cd << endl;\\n int dfc1,dfc2;\\n if(cd==1){\\n abb=max((int)asd,a[im2-1])+df;\\n dfc1=0;\\n dfc2=0;\\n }else if(asd<=a[im2-1]){\\n ccd=int(dd-cd*df);\\n abb=(ccd==0 ? a[im2-1]+df : a[im2-1]+df+1);\\n if(ccd==0){\\n dfc1=0;\\n dfc2=cd-1;\\n }else{\\n dfc1=ccd-1;\\n dfc2=cd-ccd;\\n }\\n }else if(dd==0){\\n abb=max((int)asd,a[im2-1]);\\n dfc1=0;\\n dfc2=cd-1;\\n }else{\\n if((dd/(cd-1))+a[im2-1]<=asd){\\n df=dd/(cd-1);\\n ccd=int(dd-df*(cd-1));\\n dfc1=ccd;\\n dfc2=cd-1-ccd;\\n abb=asd;\\n }else{\\n int df1=asd-a[im2-1];\\n df=df1+(dd-df1*(cd-1))/cd;\\n ccd=int(dd-df1*(cd-1))%cd;\\n abb=(ccd==0 ? a[im2-1]+df : a[im2-1]+df+1);\\n if(ccd==0){\\n dfc1=0;\\n dfc2=cd-1;\\n }else{\\n dfc1=ccd-1;\\n dfc2=cd-ccd;\\n }\\n\\n }\\n }\\n //cout << a[im2-1] << \\\" \\\" << dd << \\\" \\\" << df << \\\" \\\" << cd << \\\" \\\" << ccd << \\\" \\\" << abb << endl;\\n \\n if(im2<cc){\\n d=a[im2-1]+df+1;\\n if(d%2){\\n ans+=(d+d*((d-1)/2))*dfc1;\\n }else{\\n ans+=(d+1)*(d/2)*dfc1;\\n }\\n d=a[im2-1]+df;\\n if(d%2){\\n ans+=(d+d*((d-1)/2))*dfc2;\\n }else{\\n ans+=(d+1)*(d/2)*dfc2;\\n }\\n }\\n }\\n //cout << abb << \\\" \\\" << asd << \\\" \\\" << im2 << endl;\\n d=abb;\\n if(d%2){\\n ans+=d+d*((d-1)/2);\\n }else{\\n ans+=(d+1)*(d/2);\\n }\\n d=asd;\\n if(d%2){\\n ans-=d+d*((d-1)/2);\\n }else{\\n ans-=(d+1)*(d/2);\\n }\\n \\n\\n\\n for(int i=1;i<im2;i++){\\n d=a[i];\\n //cout << ans << \\\" \\\" << d << endl;\\n if(d%2){\\n ans+=d+d*((d-1)/2);\\n }else{\\n ans+=(d+1)*(d/2);\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.6818181818181818,\n \"time_ms\": 20,\n \"memory_kb\": 4132,\n \"score_of_the_acc\": -0.6042,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3144_5702496\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T> using PQ = priority_queue<T>;\\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \\ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\\\" \\\"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(const T &v,ll n,string sv=\\\" \\\"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop_front();}cout<<endl;}\\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\\\"[\\\"<<z.first<<\\\"]=\\\"<<z.second<<\\\",\\\";cout<<endl;}\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\\n auto tmp = v;\\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\\n}\\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\\n rearrange(ord, head);\\n rearrange(ord, tail...);\\n}\\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\\n return ord;\\n}\\ntemplate<typename T> vector<int> descend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\\n return ord;\\n}\\nll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}\\nll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}\\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\nint popcount(ll x){return __builtin_popcountll(x);};\\nint poplow(ll x){return __builtin_ctzll(x);};\\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\\ntemplate< typename T = int >\\nstruct edge {\\n int to;\\n T cost;\\n int id;\\n edge():id(-1){};\\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\\n operator int() const { return to; }\\n};\\n\\ntemplate<typename T>\\nusing Graph = vector<vector<edge<T>>>;\\ntemplate<typename T>\\nGraph<T>revgraph(const Graph<T> &g){\\n Graph<T>ret(g.size());\\n for(int i=0;i<g.size();i++){\\n for(auto e:g[i]){\\n int to = e.to;\\n e.to = i;\\n ret[to].push_back(e);\\n }\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\\n Graph<T> ret(n);\\n for(int es = 0; es < m; es++){\\n int u,v;\\n T w=1;\\n cin>>u>>v;u-=indexed,v-=indexed;\\n if(weighted)cin>>w;\\n ret[u].emplace_back(v,w,es);\\n if(!directed)ret[v].emplace_back(u,w,es);\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\\n Graph<T>ret(n);\\n for(int i=1;i<n;i++){\\n int p;cin>>p;\\n p-=indexed;\\n ret[p].emplace_back(i);\\n if(!directed)ret[i].emplace_back(p);\\n }\\n return ret;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n ll n,m,k;cin>>n>>m>>k;\\n vector<ll>a(n);\\n rep(i,0,n)cin>>a[i];\\n res=0;\\n rep(i,0,n)res+=a[i]*(a[i]+1)/2;\\n sort(ALLR(a));\\n vector<ll>l(n),r(n);\\n rep(i,0,n){\\n l[i]=0,r[i]=a[i];\\n ll mi=min(a[i],m);\\n res-=mi*(mi+1)/2;\\n l[i]+=mi;\\n m-=mi;\\n }\\n //cout<<res spa m<<endl;\\n //debug(l);debug(r);\\n ll cost=0,rk;\\n auto f=[&](ll lower){\\n rk=k,cost=0;\\n rrep(i,0,n){\\n ll mi=min(rk,max(0LL,r[i]-max(lower,l[i])));\\n rk-=mi;\\n cost+=r[i]*(r[i]+1)/2-(r[i]-mi)*(r[i]-mi+1)/2;\\n }\\n //cout<<lower spa cost spa rk<<endl;\\n };\\n ll ng=-1,ok=10000000;\\n while(abs(ok-ng)>=2){\\n ll mid=(ok+ng)/2;\\n f(mid);\\n if(rk>0)ok=mid;\\n else ng=mid;\\n }\\n f(ok);\\n cout<<res-cost-ok*rk<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5428,\n \"score_of_the_acc\": -0.2597,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3144_4806043\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll=long long;\\n#define int ll\\n\\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\\n#define rep(i,b) rng(i,0,b)\\n#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)\\n#define per(i,b) gnr(i,0,b)\\n#define pb push_back\\n#define eb emplace_back\\n#define a first\\n#define b second\\n#define bg begin()\\n#define ed end()\\n#define all(x) x.bg,x.ed\\n#define si(x) int(x.size())\\n#ifdef LOCAL\\n#define dmp(x) cerr<<__LINE__<<\\\" \\\"<<#x<<\\\" \\\"<<x<<endl\\n#else\\n#define dmp(x) void(0)\\n#endif\\n\\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\\n\\ntemplate<class t> using vc=vector<t>;\\ntemplate<class t> using vvc=vc<vc<t>>;\\n\\nusing pi=pair<int,int>;\\nusing vi=vc<int>;\\n\\ntemplate<class t,class u>\\nostream& operator<<(ostream& os,const pair<t,u>& p){\\n\\treturn os<<\\\"{\\\"<<p.a<<\\\",\\\"<<p.b<<\\\"}\\\";\\n}\\n\\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\\n\\tos<<\\\"{\\\";\\n\\tfor(auto e:v)os<<e<<\\\",\\\";\\n\\treturn os<<\\\"}\\\";\\n}\\n\\n#define mp make_pair\\n#define mt make_tuple\\n#define one(x) memset(x,-1,sizeof(x))\\n#define zero(x) memset(x,0,sizeof(x))\\n#ifdef LOCAL\\nvoid dmpr(ostream&os){os<<endl;}\\ntemplate<class T,class... Args>\\nvoid dmpr(ostream&os,const T&t,const Args&... args){\\n\\tos<<t<<\\\" \\\";\\n\\tdmpr(os,args...);\\n}\\n#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)\\n#else\\n#define dmp2(...) void(0)\\n#endif\\n\\nusing uint=unsigned;\\nusing ull=unsigned long long;\\n\\ntemplate<class t,size_t n>\\nostream& operator<<(ostream&os,const array<t,n>&a){\\n\\treturn os<<vc<t>(all(a));\\n}\\n\\ntemplate<int i,class T>\\nvoid print_tuple(ostream&,const T&){\\n}\\n\\ntemplate<int i,class T,class H,class ...Args>\\nvoid print_tuple(ostream&os,const T&t){\\n\\tif(i)os<<\\\",\\\";\\n\\tos<<get<i>(t);\\n\\tprint_tuple<i+1,T,Args...>(os,t);\\n}\\n\\ntemplate<class ...Args>\\nostream& operator<<(ostream&os,const tuple<Args...>&t){\\n\\tos<<\\\"{\\\";\\n\\tprint_tuple<0,tuple<Args...>,Args...>(os,t);\\n\\treturn os<<\\\"}\\\";\\n}\\n\\ntemplate<class t>\\nvoid print(t x,int suc=1){\\n\\tcout<<x;\\n\\tif(suc==1)\\n\\t\\tcout<<\\\"\\\\n\\\";\\n\\tif(suc==2)\\n\\t\\tcout<<\\\" \\\";\\n}\\n\\nll read(){\\n\\tll i;\\n\\tcin>>i;\\n\\treturn i;\\n}\\n\\nvi readvi(int n,int off=0){\\n\\tvi v(n);\\n\\trep(i,n)v[i]=read()+off;\\n\\treturn v;\\n}\\n\\npi readpi(int off=0){\\n\\tint a,b;cin>>a>>b;\\n\\treturn pi(a+off,b+off);\\n}\\n\\ntemplate<class T>\\nvoid print(const vector<T>&v,int suc=1){\\n\\trep(i,v.size())\\n\\t\\tprint(v[i],i==int(v.size())-1?suc:2);\\n}\\n\\nstring readString(){\\n\\tstring s;\\n\\tcin>>s;\\n\\treturn s;\\n}\\n\\ntemplate<class T>\\nT sq(const T& t){\\n\\treturn t*t;\\n}\\n\\n//#define CAPITAL\\nvoid yes(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"YES\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Yes\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid no(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"NO\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"No\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid possible(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"POSSIBLE\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Possible\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid impossible(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"IMPOSSIBLE\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Impossible\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\n\\nconstexpr ll ten(int n){\\n\\treturn n==0?1:ten(n-1)*10;\\n}\\n\\nconst ll infLL=LLONG_MAX/3;\\n\\n#ifdef int\\nconst int inf=infLL;\\n#else\\nconst int inf=INT_MAX/2-100;\\n#endif\\n\\nint topbit(signed t){\\n\\treturn t==0?-1:31-__builtin_clz(t);\\n}\\nint topbit(ll t){\\n\\treturn t==0?-1:63-__builtin_clzll(t);\\n}\\nint botbit(signed a){\\n\\treturn a==0?32:__builtin_ctz(a);\\n}\\nint botbit(ll a){\\n\\treturn a==0?64:__builtin_ctzll(a);\\n}\\nint popcount(signed t){\\n\\treturn __builtin_popcount(t);\\n}\\nint popcount(ll t){\\n\\treturn __builtin_popcountll(t);\\n}\\nbool ispow2(int i){\\n\\treturn i&&(i&-i)==i;\\n}\\nll mask(int i){\\n\\treturn (ll(1)<<i)-1;\\n}\\n\\nbool inc(int a,int b,int c){\\n\\treturn a<=b&&b<=c;\\n}\\n\\ntemplate<class t> void mkuni(vc<t>&v){\\n\\tsort(all(v));\\n\\tv.erase(unique(all(v)),v.ed);\\n}\\n\\nll rand_int(ll l, ll r) { //[l, r]\\n\\t#ifdef LOCAL\\n\\tstatic mt19937_64 gen;\\n\\t#else\\n\\tstatic mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n\\t#endif\\n\\treturn uniform_int_distribution<ll>(l, r)(gen);\\n}\\n\\ntemplate<class t>\\nvoid myshuffle(vc<t>&a){\\n\\trep(i,si(a))swap(a[i],a[rand_int(0,i)]);\\n}\\n\\ntemplate<class t>\\nint lwb(const vc<t>&v,const t&a){\\n\\treturn lower_bound(all(v),a)-v.bg;\\n}\\n\\nvvc<int> readGraph(int n,int m){\\n\\tvvc<int> g(n);\\n\\trep(i,m){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\t//sc.read(a,b);\\n\\t\\ta--;b--;\\n\\t\\tg[a].pb(b);\\n\\t\\tg[b].pb(a);\\n\\t}\\n\\treturn g;\\n}\\n\\nvvc<int> readTree(int n){\\n\\treturn readGraph(n,n-1);\\n}\\n\\nsigned main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(0);\\n\\tcout<<fixed<<setprecision(20);\\n\\t\\n\\tint n,m,k;cin>>n>>m>>k;\\n\\tvi a=readvi(n);\\n\\tsort(all(a),greater<int>());\\n\\tint cur=0;\\n\\tvi sum(m+1);\\n\\tfor(auto v:a){\\n\\t\\tif(cur+v<=m){\\n\\t\\t\\tcur+=v;\\n\\t\\t}else{\\n\\t\\t\\tsum[cur]--;\\n\\t\\t\\tcur=m-v;\\n\\t\\t\\tsum[cur]++;\\n\\t\\t\\tcur+=v;\\n\\t\\t}\\n\\t}\\n\\tint ans=0;\\n\\trep(i,m)sum[i+1]+=sum[i];\\n\\trep(i,m){\\n\\t\\tint u=min(k,sum[i]);\\n\\t\\tk-=u;\\n\\t\\tsum[i]-=u;\\n\\t\\tans+=(m-i)*sum[i];\\n\\t}\\n\\tprint(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 11416,\n \"score_of_the_acc\": -0.9784,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3144_4562353\",\n \"code_snippet\": \"#include <iostream>\\n#include <utility>\\n#include <tuple>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <algorithm>\\n#include <functional>\\n#include <climits>\\n#include <numeric>\\n#include <queue>\\n#include <cmath>\\n#include <iomanip>\\n#include <array>\\n#include <string>\\n#include <stack>\\n#include <cassert>\\n#include <memory>\\nlong long int recover_all(int a) {\\n\\treturn a * (a + 1LL) / 2;\\n}\\nint main() {\\n\\tint n, m; long long int k; std::cin >> n >> m >> k;\\n\\tstd::vector<int> magic(n); for (auto& a : magic) std::cin >> a;\\n\\tstd::sort(magic.begin(), magic.end());\\n\\tconst auto need_to_recover = std::accumulate(magic.begin(), magic.end(), 0LL) - m;\\n\\tif (need_to_recover <= 0) {\\n\\t\\tstd::cout << 0 << '\\\\n'; return 0;\\n\\t}\\n\\tint min{ 0 }, max{ m };\\n\\twhile (min < max) {\\n\\t\\tconst auto mid = (min + max) >> 1;\\n\\t\\tauto cookie = k;\\n\\t\\tauto recover = need_to_recover;\\n\\t\\tfor (auto a : magic) {\\n\\t\\t\\tif (cookie < 0) break;\\n\\t\\t\\tif (mid < a) {\\n\\t\\t\\t\\tconst auto minus = std::min<long long int>(a - mid, recover);\\n\\t\\t\\t\\tcookie -= minus;\\n\\t\\t\\t\\trecover -= minus;\\n\\t\\t\\t\\ta -= minus;\\n\\t\\t\\t}\\n\\t\\t\\trecover -= std::min<long long int>(recover, a);\\n\\t\\t}\\n\\t\\tif (cookie < 0) {\\n\\t\\t\\tmin = mid + 1;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tmax = mid;\\n\\t\\t}\\n\\t}\\n\\tauto cookie = k;\\n\\tauto recover = need_to_recover;\\n\\tlong long int time{ 0 };\\n\\tint just{ 0 };\\n\\tfor (auto a : magic) {\\n\\t\\tif (max < a) {\\n\\t\\t\\tconst auto minus = std::min<long long int>(a - max, recover);\\n\\t\\t\\tcookie -= minus;\\n\\t\\t\\trecover -= minus;\\n\\t\\t\\ta -= minus;\\n\\t\\t}\\n\\t\\tconst auto r = std::min<long long int>(recover, a);\\n\\t\\ttime += recover_all(a) - recover_all(a - r);\\n\\t\\trecover -= r;\\n\\t\\tif (a == max) ++just;\\n\\t}\\n\\tconst auto additional = std::min<long long int>(just, cookie);\\n\\ttime -= max * additional;\\n\\tstd::cout << time << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3264,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3144_4562343\",\n \"code_snippet\": \"#include <iostream>\\n#include <utility>\\n#include <tuple>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <algorithm>\\n#include <functional>\\n#include <climits>\\n#include <numeric>\\n#include <queue>\\n#include <cmath>\\n#include <iomanip>\\n#include <array>\\n#include <string>\\n#include <stack>\\n#include <cassert>\\n#include <memory>\\nlong long int recover_all(int a) {\\n\\treturn a * (a + 1LL) / 2;\\n}\\nint main() {\\n\\tint n, m, k; std::cin >> n >> m >> k;\\n\\tstd::vector<int> magic(n); for (auto& a : magic) std::cin >> a;\\n\\tstd::sort(magic.begin(), magic.end());\\n\\tconst auto need_to_recover = std::accumulate(magic.begin(), magic.end(), 0LL) - m;\\n\\tif (need_to_recover <= 0) {\\n\\t\\tstd::cout << 0 << '\\\\n'; return 0;\\n\\t}\\n\\tint min{ 0 }, max{ m };\\n\\twhile (min < max) {\\n\\t\\tconst auto mid = (min + max) >> 1;\\n\\t\\tauto cookie = k;\\n\\t\\tauto recover = need_to_recover;\\n\\t\\tfor (auto a : magic) {\\n\\t\\t\\tif (cookie < 0) break;\\n\\t\\t\\tif (mid < a) {\\n\\t\\t\\t\\tconst auto minus = std::min<long long int>(a - mid, recover);\\n\\t\\t\\t\\tcookie -= minus;\\n\\t\\t\\t\\trecover -= minus;\\n\\t\\t\\t\\ta -= minus;\\n\\t\\t\\t}\\n\\t\\t\\trecover -= std::min<long long int>(recover, a);\\n\\t\\t}\\n\\t\\tif (cookie < 0) {\\n\\t\\t\\tmin = mid + 1;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tmax = mid;\\n\\t\\t}\\n\\t}\\n\\tauto cookie = k;\\n\\tauto recover = need_to_recover;\\n\\tlong long int time{ 0 };\\n\\tint just{ 0 };\\n\\tfor (auto a : magic) {\\n\\t\\tif (max < a) {\\n\\t\\t\\tconst auto minus = std::min<long long int>(a - max, recover);\\n\\t\\t\\tcookie -= minus;\\n\\t\\t\\trecover -= minus;\\n\\t\\t\\ta -= minus;\\n\\t\\t}\\n\\t\\tconst auto r = std::min<long long int>(recover, a);\\n\\t\\ttime += recover_all(a) - recover_all(a - r);\\n\\t\\trecover -= r;\\n\\t\\tif (a == max) ++just;\\n\\t}\\n\\tconst auto additional = std::min(just, cookie);\\n\\ttime -= (long long int)max * additional;\\n\\tstd::cout << time << '\\\\n';\\n}\",\n \"accuracy\": 0.6931818181818182,\n \"time_ms\": 20,\n \"memory_kb\": 3264,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3144_4357196\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,a,n) for (int i=a;i<n;i++)\\n#define per(i,a,n) for (int i=n-1;i>=a;i--)\\n#define pb push_back\\n#define mp make_pair\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define SZ(x) ((int)(x).size())\\ntypedef vector<int> VI;\\ntypedef long long ll;\\ntypedef pair<int,int> PII;\\ntypedef double db;\\nmt19937 mrand(1); \\nconst ll mod=998244353;\\nint rnd(int x) { return mrand() % x;}\\nll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\\nll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}\\n// head\\n\\nconst int N=101000;\\n#define kill assss\\nint n,m,a[N],kill[N];\\nll k,rm,ans;\\nint main() {\\n\\tscanf(\\\"%d%d%lld\\\",&n,&m,&k);\\n\\trep(i,0,n) scanf(\\\"%d\\\",a+i);\\n\\tsort(a,a+n);\\n\\trep(i,0,n) rm+=a[i];\\n\\trep(i,0,n) {\\n\\t\\tif (rm<=m) break;\\n\\t\\tif (rm-a[i]>m) kill[i]=a[i];\\n\\t\\telse {\\n\\t\\t\\tint l=a[i],r=m-(rm-a[i]);\\n\\t\\t\\tkill[i]=l-r;\\n\\t\\t}\\n\\t\\trm-=a[i];\\n\\t}\\n\\n\\tint l=-1,r=m;\\n\\twhile (l+1<r) {\\n\\t\\tint md=(l+r)>>1;\\n\\t\\tll s=0;\\n\\t\\trep(i,0,n) s+=min(max(a[i]-md,0),kill[i]);\\n\\t\\tif (s<=k) r=md; else l=md;\\n\\t}\\n\\trep(i,0,n) {\\n\\t\\tint d=min(max(a[i]-r,0),kill[i]);\\n\\t\\tk-=d;\\n\\t\\ta[i]-=d;\\n\\t\\tkill[i]-=d;\\n\\t}\\n\\trep(i,0,n) if (k&&a[i]==r&&kill[i]) --k,--a[i],--kill[i];\\n\\t/*rep(i,0,n) printf(\\\"%d \\\",a[i]); \\n\\tputs(\\\"\\\");*/\\n\\tsort(a,a+n);\\n\\trm=0;\\n\\trep(i,0,n) rm+=a[i];\\n\\trep(i,0,n) {\\n\\t\\tif (rm<=m) break;\\n\\t\\tif (rm-a[i]>m) ans+=(ll)a[i]*(a[i]+1)/2;\\n\\t\\telse {\\n\\t\\t\\tint l=a[i],r=m-(rm-a[i])+1;\\n\\t\\t//\\tprintf(\\\"%d %d\\\\n\\\",l,r);\\n\\t\\t\\tans+=(ll)(l+r)*(l-r+1)/2;\\n\\t\\t}\\n\\t\\trm-=a[i];\\n\\t}\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4040,\n \"score_of_the_acc\": -0.0931,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3144_4279772\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n/*#include <ext/pb_ds/assoc_container.hpp>\\n#include <ext/pb_ds/tree_policy.hpp>\\nusing namespace __gnu_pbds;\\ntemplate<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\\ntemplate<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\\ntemplate<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/\\nstruct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;\\n#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)\\n#define REP(i, n) FOR(i,0,n)\\n#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)\\n#define IREP(i, n) IFOR(i,0,n)\\n#define Sort(v) sort(v.begin(), v.end())\\n#define Reverse(v) reverse(v.begin(), v.end())\\n#define all(v) v.begin(),v.end()\\n#define SZ(v) ((int)v.size())\\n#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))\\n#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))\\n#define Max(a, b) a = max(a, b)\\n#define Min(a, b) a = min(a, b)\\n#define bit(n) (1LL<<(n))\\n#define bit_exist(x, n) ((x >> n) & 1)\\n#define debug(x) cout << #x << \\\"=\\\" << x << endl;\\n#define vdebug(v) { cout << #v << \\\"=\\\" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << \\\",\\\"; } cout << endl; }\\n#define mdebug(m) { cout << #m << \\\"=\\\" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << \\\",\\\"; } cout << endl;} }\\n#define Return(ans) { cout << (ans) << endl; return 0; }\\n#define pb push_back\\n#define f first\\n#define s second\\n#define int long long\\n#define INF 1000000000000000000\\ntemplate<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }\\ntemplate<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }\\ntemplate<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }\\ntemplate<typename T> void Out(T x) { cout << x << endl; }\\ntemplate<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }\\n\\nusing vec = vector<int>;\\nusing mat = vector<vec>;\\nusing Pii = pair<int, int>;\\nusing PiP = pair<int, Pii>;\\nusing PPi = pair<Pii, int>;\\nusing bools = vector<bool>;\\nusing pairs = vector<Pii>;\\n\\n//int dx[4] = {1,0,-1,0};\\n//int dy[4] = {0,1,0,-1};\\n//char d[4] = {'D','R','U','L'};\\n\\nconst int mod = 1000000007;\\n//const int mod = 998244353;\\n//#define Add(x, y) x = (x + (y)) % mod\\n//#define Mult(x, y) x = (x * (y)) % mod\\n\\nint solve(vec A, int N, int M, int K, int r){\\n\\n int x0 = 0, x1 = M;\\n while(x1 - x0 > 1){\\n int x = (x0 + x1) / 2;\\n int cnt = 0;\\n REP(i, N) if(A[i] > x) cnt += A[i] - x;\\n\\n if(cnt <= K) x1 = x;\\n else x0 = x;\\n }\\n\\n int cnt = 0;\\n REP(i, N) if(A[i] > x1){\\n cnt += A[i] - x1;\\n A[i] = x1;\\n }\\n REP(i, N) if(A[i] == A[N - 1] && cnt < K){\\n cnt++;\\n A[i]--;\\n }\\n\\n if(A[N - 1] < r) return INF;\\n\\n int t = 0;\\n REP(i, N) t += A[i] * (A[i] + 1) / 2;\\n t -= r * (r + 1) / 2;\\n\\n return t;\\n}\\n\\nsigned main(){\\n\\n int N, M, K; cin >> N >> M >> K;\\n vec A(N); cin >> A;\\n Sort(A);\\n\\n int s = 0; REP(i, N) s += A[i];\\n if(s - K <= M){\\n Out(0);\\n return 0;\\n }\\n\\n int n = 0, r = M;\\n while(A[N - 1 - n] <= r){\\n r -= A[N - 1 - n];\\n n++;\\n }\\n\\n int ans = INF;\\n Min(ans, solve(A, N - n, M, K, r));\\n\\n if(A[N - 1 - n] - r <= K){\\n Min(ans, solve(A, N - n - 1, M, K - (A[N - 1 - n] - r), 0));\\n }\\n Out(ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4572,\n \"score_of_the_acc\": -0.157,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3144_4279707\",\n \"code_snippet\": \"#include <string>\\n#include <vector>\\n#include<iostream>\\n#include<cstdio>\\n#include<cstdlib>\\n#include<stack>\\n#include<queue>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<list>\\n#include<deque>\\n#include<bitset>\\n#include<set>\\n#include<map>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<cstring>\\n#include<sstream>\\n#include<complex>\\n#include<iomanip>\\n#include<numeric>\\n#include<cassert>\\n#define X first\\n#define Y second\\n#define pb push_back\\n#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))\\n#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))\\n#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))\\n#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))\\n#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))\\n#define peat(X,Y) for (;(X) < (Y);++(X))\\n#define all(X) (X).begin(),(X).end()\\n#define rall(X) (X).rbegin(),(X).rend()\\n#define eb emplace_back\\n#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())\\n#define Endl endl\\n#define NL <<\\\"\\\\n\\\"\\n\\nusing namespace std;\\nusing ll=long long;\\nusing pii=pair<int,int>;\\nusing pll=pair<ll,ll>;\\ntemplate<class T> using vv=vector<vector<T>>;\\ntemplate<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}\\ntemplate<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}\\n//#undef NUIP\\n#ifdef NUIP\\n#include \\\"benri.h\\\"\\n#else\\n#define out(args...)\\n#endif\\n#ifdef __cpp_init_captures\\ntemplate<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}\\ntemplate <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}\\n#endif\\nconst ll MOD=1e9+7; //998244353\\n\\nll sumf(const vector<ll> &a,ll lb){\\n\\tll re=0;\\n\\tfor(auto x:a) re+=max(0ll,x-lb);\\n\\treturn re;\\n}\\n\\nint main(){\\n ios_base::sync_with_stdio(false); cin.tie(0);\\n cout<<fixed<<setprecision(0);\\n\\tint n,m;\\n\\tll t;\\n\\tcin>>n>>m>>t;\\n\\tvector<ll> a(n);\\n\\tfor(auto &x:a) cin>>x;\\n\\tsort(all(a));\\n\\tint rem=m;\\n\\twhile(a.size() && rem>=a.back()){\\n\\t\\trem-=a.back();\\n\\t\\ta.pop_back();\\n\\t}\\n\\tif(a.empty()){\\n\\t\\tcout<<0 NL;\\n\\t\\treturn 0;\\n\\t}\\n\\tout(a,1);\\n\\t//keep x==rem if pos\\n\\tif(t>sumf(a,rem+1)){\\n\\t\\tassert(a.back()>=rem);\\n\\t\\tt-=a.back()-rem;\\n\\t\\trem=0;\\n\\t\\ta.pop_back();\\n\\t}\\n\\tif(a.empty()){\\n\\t\\tcout<<0 NL;\\n\\t\\treturn 0;\\n\\t}\\n\\tout(a,1);\\n\\n\\tif(t>=sumf(a,0)){\\n\\t\\tcout<<0 NL;\\n\\t\\treturn 0;\\n\\t}\\n\\tint l=0,r=MOD;\\n\\twhile(r-l>1){\\n\\t\\tint m=(l+r)/2;\\n\\t\\t(sumf(a,m)<=t?r:l)=m;\\n\\t}\\n\\tout(a,r,1);\\n\\tt-=sumf(a,r);\\n\\tfor(auto &x:a) MN<ll>(x,r);\\n\\trep(i,t) --a[a.size()-1-i];\\n\\tsort(rall(a));\\n\\tll re=0;\\n\\tfor(ll x:a){\\n\\t\\tll t=min<ll>(x,rem);\\n\\t\\trem-=t;\\n\\t\\tre+=x*(x+1)/2-t*(t+1)/2;\\n\\t}\\n\\tcout<<re NL;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.0437,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3144_4279501\",\n \"code_snippet\": \"//#define NDEBUG\\n#include <algorithm>\\n#include <cstddef>\\n#include <cstdint>\\n#include <iostream>\\n#include <utility>\\n#include <vector>\\n\\nnamespace n91 {\\n\\n using i8 = std::int_fast8_t;\\n using i32 = std::int_fast32_t;\\n using i64 = std::int_fast64_t;\\n using u8 = std::uint_fast8_t;\\n using u32 = std::uint_fast32_t;\\n using u64 = std::uint_fast64_t;\\n using isize = std::ptrdiff_t;\\n using usize = std::size_t;\\n\\n struct rep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept : i(i) {}\\n void operator++() noexcept { ++i; }\\n constexpr usize operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\\n };\\n const itr f, l;\\n constexpr rep(const usize f, const usize l) noexcept\\n : f(std::min(f, l)), l(l) {}\\n constexpr auto begin() const noexcept { return f; }\\n constexpr auto end() const noexcept { return l; }\\n };\\n struct revrep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept : i(i) {}\\n void operator++() noexcept { --i; }\\n constexpr usize operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\\n };\\n const itr f, l;\\n constexpr revrep(const usize f, const usize l) noexcept\\n : f(l - 1), l(std::min(f, l) - 1) {}\\n constexpr auto begin() const noexcept { return f; }\\n constexpr auto end() const noexcept { return l; }\\n };\\n template <class T> auto md_vec(const usize n, const T& value) {\\n return std::vector<T>(n, value);\\n }\\n template <class... Args> auto md_vec(const usize n, Args... args) {\\n return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));\\n }\\n template <class T> constexpr T difference(const T& a, const T& b) noexcept {\\n return a < b ? b - a : a - b;\\n }\\n template <class T> void chmin(T& a, const T& b) noexcept {\\n if (b < a)\\n a = b;\\n }\\n template <class T> void chmax(T& a, const T& b) noexcept {\\n if (a < b)\\n a = b;\\n }\\n template <class F> class rec_lambda {\\n F f;\\n\\n public:\\n rec_lambda(F&& f) : f(std::move(f)) {}\\n template <class... Args> auto operator()(Args&&... args) const {\\n return f(*this, std::forward<Args>(args)...);\\n }\\n };\\n template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }\\n template <class T> T scan() {\\n T ret;\\n std::cin >> ret;\\n return ret;\\n }\\n\\n} // namespace n91\\n#include <numeric>\\nnamespace n91 {\\n\\n void main_() {\\n /*\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n //*/\\n const usize n = scan<usize>();\\n const u64 m = scan<u64>();\\n u64 k = scan<u64>();\\n std::vector<u64> a(n);\\n for (auto& e : a) {\\n std::cin >> e;\\n }\\n if (std::accumulate(a.begin(), a.end(), static_cast<u64>(0)) <= m+k) {\\n std::cout << \\\"0\\\\n\\\";\\n return;\\n }\\n std::sort(a.begin(), a.end());\\n usize s = n - 1;\\n u64 rem = m;\\n while (true) {\\n if (a[s] <= rem) {\\n rem -= a[s];\\n s -= 1;\\n }\\n else {\\n break;\\n }\\n }\\n const auto get = [](const u64 a, const u64 b) {\\n return (b * (b + 1) - a * (a + 1)) / 2;\\n };\\n u64 ups = 0;\\n for (const usize i : rep(0, s + 1)) {\\n if (a[i] >= rem) {\\n ups += a[i] - rem;\\n }\\n }\\n if (ups < k) {\\n k -= a[s] - rem;\\n rem = 0;\\n s -= 1;\\n }\\n u64 gt = rem, le = a[s] + 1;\\n while (le - gt != 1) {\\n const u64 mid = (le + gt) / 2;\\n u64 sum = 0;\\n for (const usize i : rep(0, s + 1)) {\\n if (a[i] >= mid) {\\n sum += a[i] - mid;\\n }\\n }\\n if (sum <= k) {\\n le = mid;\\n }\\n else {\\n gt = mid;\\n }\\n }\\n u64 ans = 0;\\n for (const usize i : rep(0, s)) {\\n ans += get(0, std::min(a[i], le));\\n }\\n ans += get(rem, le);\\n u64 sum = 0;\\n for (const usize i : rep(0, s + 1)) {\\n if (a[i] >= le) {\\n sum += a[i] - le;\\n }\\n }\\n ans -= le * (k - sum);\\n std::cout << ans << std::endl;\\n }\\n\\n} // namespace n91\\n\\nint main() {\\n n91::main_();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.5437,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3144_4279158\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n int N;\\n int64_t M, K;\\n cin >> N >> M >> K;\\n vector<int> A(N);\\n for(int i=0; i<N; i++) cin >> A[i];\\n sort(A.begin(), A.end());\\n int64_t S = accumulate(A.begin(), A.end(), 0LL);\\n int64_t need = S-M;\\n if(need <= 0){\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n vector<int64_t> num(M+1);\\n for(int a : A){\\n if(need > a){\\n need -= a;\\n num[a]++;\\n }else{\\n num[a]++;\\n num[a-need]--;\\n break;\\n }\\n }\\n for(int i=M; i>0; i--) num[i-1] += num[i];\\n int64_t ans = 0;\\n for(int i=M; i>0; i--){\\n int64_t dec = min(num[i], K);\\n K -= dec;\\n num[i] -= dec;\\n ans += num[i]*i;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 10900,\n \"score_of_the_acc\": -1.4165,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3144_4279087\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<algorithm>\\n#include<cassert>\\n#include<cmath>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<string>\\n#include<queue>\\n#include<stack>\\nusing namespace std;\\n#define MOD 1000000007\\n#define MOD2 998244353\\n#define INF ((1<<30)-1)\\n#define LINF (1LL<<60)\\n#define EPS (1e-10)\\ntypedef long long Int;\\ntypedef pair<Int, Int> P;\\nInt rest;\\n\\nInt cnt(vector<Int> &a, Int m){\\n Int ans = 0;\\n for(int i = 0;i < a.size() - 1;i++){\\n ans += max(0ll, a[i] - m + 1);\\n }\\n ans += a.back() - max(rest, m-1);\\n return ans;\\n}\\n\\nint main(){\\n Int n, m, k;\\n cin >> n >> m >> k;\\n vector<Int> a(n);\\n for(int i = 0;i < n;i++){\\n cin >> a[i];\\n }\\n sort(a.begin(), a.end());\\n\\n rest = m;\\n while(!a.empty() && a.back() <=rest){\\n rest -= a.back();\\n a.pop_back();\\n }\\n \\n Int sum = 0;\\n for(auto x:a)sum += x;\\n if(sum - k - rest <= 0){\\n cout << 0 << endl;\\n return 0; \\n }\\n \\n Int bottom = 0, top = a.back() + 1;\\n while(top - bottom > 1){\\n Int mid = (top + bottom) / 2;\\n if(cnt(a, mid) <= k)top = mid;\\n else bottom = mid;\\n }\\n for(int i = 0;i < a.size();i++){\\n Int goal = top-1;\\n if(i+1 == a.size())goal = max(goal, rest);\\n if(a[i] >= goal){\\n k -= a[i] - goal;\\n a[i] = goal;\\n }\\n }\\n if(a.back() == rest){\\n rest = 0;\\n a.pop_back();\\n }\\n for(int i = (int)a.size()-1;i >= 0 && k > 0;i--){\\n a[i]--;\\n k--;\\n }\\n Int ans = 0;\\n for(auto x:a)ans += (x+1) * x / 2;\\n ans -= (rest + 1) * rest / 2;\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -0.5451,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3144_4279022\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define FOR(i,k,n) for(int i = (k);i < (n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(x) begin(x),end(x)\\n\\nusing namespace std;\\nusing namespace std::string_literals;\\nusing ll = int64_t;\\nusing vecint = vector<int>;\\nusing vecll = vector<ll>;\\n\\nint main() {\\n ll n,m,k;\\n cin>>n>>m>>k;\\n vecll a(n);\\n for(auto&& e:a) cin>>e;\\n sort(ALL(a));\\n ll sum = 0;\\n ll i;\\n for(i = n-1; i >= 0; --i) {\\n if (sum + a[i] > m) break;\\n sum += a[i];\\n }\\n if (i < 0) {\\n cout<<0<<endl;\\n return 0;\\n }\\n ll rem = m - sum;\\n ll lo = -1;\\n ll hi = m;\\n while (hi-lo > 1) {\\n ll mid = (hi + lo) / 2;\\n ll cnt_punch = 0;\\n ll num = 0;\\n REP(j,i) {\\n if (a[j] > mid) ++num;\\n cnt_punch += max(a[j] - mid, 0l);\\n }\\n ll fin = max(mid, rem);\\n if (a[i] > fin && fin == mid) ++num;\\n cnt_punch += max(a[i] - fin, 0l);\\n if (cnt_punch - k > num) {\\n lo = mid;\\n } else {\\n hi = mid;\\n }\\n }\\n ll cost = 0;\\n //ll num = 0;\\n ll cnt_punch = 0;\\n REP(j,i) {\\n ll mx = min(a[j], hi); \\n cost += mx * (mx+1) / 2;\\n //if (a[j] > hi) ++num;\\n cnt_punch += max(a[j] - hi, 0l);\\n }\\n ll fin = max(hi, rem);\\n ll mx = min(a[i], fin);\\n cost += mx * (mx+1) / 2;\\n cost -= rem * (rem+1) / 2;\\n //if (a[i] > fin) ++num;\\n cnt_punch += max(a[i] - fin, 0l);\\n if (cnt_punch > k) {\\n cost += (hi+1) * (cnt_punch - k);\\n }\\n cout<<cost<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -0.5451,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3144_4278850\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <iomanip>\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\\n#define Rrep(i,n) Rreps(i,n,0)\\n#define ALL(a) a.begin(), a.end()\\n#define fi first\\n#define se second\\ntypedef long long ll;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n\\nll N,M,H,W,K,Q,A,B;\\nstring S;\\nconst ll MOD = 998244353;\\n//const ll MOD = (1e+9) + 7;\\nconst ll INF = 1LL<<60;\\ntypedef pair<ll, ll> P;\\n\\nint main() {\\n cin>>N>>M>>K;\\n vec a(N);\\n rep(i,N) cin>>a[i];\\n ll SUM = 0;\\n rep(i,N) SUM += a[i];\\n if(SUM - K <= M){\\n cout<<0<<endl;\\n return 0;\\n }\\n sort(ALL(a));\\n reverse(ALL(a));\\n ll ans = 0;\\n rep(i,N) ans += a[i] * (a[i] + 1) / 2;\\n int id = 0, last_sum = 0; //最後に回すやつ（これ含む）\\n while(a[id] + last_sum <= M){\\n last_sum += a[id];\\n ans -= a[id] * (a[id] + 1)/2;\\n ++id;\\n }\\n ll border = M - last_sum;\\n ll judge = 0;\\n Rreps(i, N, id) if(a[i] > border) judge += a[i] - border;\\n if(judge <= K){\\n K -= a[id] - border;\\n ans -= a[id] * (a[id] + 1) / 2;\\n ++id;\\n }else{\\n ans -= border * (border + 1) / 2;\\n }\\n a.push_back(-1);\\n ll num = 1;\\n ll now = a[id];\\n //cout<<border<<endl;\\n //cout<<ans<<endl;\\n Rrep(i, now){\\n while(a[id + 1] > i) {\\n ++id;\\n ++num;\\n }\\n ans -= min(num, K) * (i + 1);\\n K -= num;\\n if(K <= 0) break;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4468,\n \"score_of_the_acc\": -0.6445,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3144_4278817\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <ctime>\\n#include <cstdlib>\\n#include <cassert>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <string>\\n#include <algorithm>\\n#define llint long long\\n#define inf 1e18\\n#define mod 998244353\\n#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)\\n#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\\n\\nusing namespace std;\\ntypedef pair<llint, llint> P;\\n\\nllint n, m, k;\\nllint a[100005];\\nvector<P> vec;\\n\\nllint get(llint l, llint r)\\n{\\n\\treturn r*(r+1)/2 - l*(l+1)/2;\\n}\\n\\nint main(void)\\n{\\n\\tios::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\t\\n\\tcin >> n >> m >> k;\\n\\tfor(int i = 1; i <= n; i++) cin >> a[i];\\n\\t\\n\\tllint rem = 0;\\n\\tfor(int i = 1; i <= n; i++) rem += a[i];\\n\\trem -= m;\\n\\t\\n\\tif(rem <= 0){\\n\\t\\tcout << 0 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\tsort(a+1, a+n+1);\\n\\tllint ans = 0;\\n\\tfor(int i = 1; i <= n; i++){\\n\\t\\tif(rem <= 0) break;\\n\\t\\tllint x = a[i]*(a[i]+1)/2;\\n\\t\\tif(a[i] <= rem){\\n\\t\\t\\tvec.push_back(P(0, 0));\\n\\t\\t\\tvec.push_back(P(a[i], 1));\\n\\t\\t\\trem -= a[i];\\n\\t\\t\\tans += x;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tllint lb = a[i]-rem+1;\\n\\t\\t\\tvec.push_back(P(lb-1, 0));\\n\\t\\t\\tvec.push_back(P(a[i], 1));\\n\\t\\t\\trem = 0;\\n\\t\\t\\tans += x-lb*(lb-1)/2;\\n\\t\\t}\\n\\t}\\n\\tsort(vec.rbegin(), vec.rend());\\n\\t\\n\\trem = k;\\n\\tllint sum = 0;\\n\\tfor(int i = 0; i < vec.size(); i++){\\n\\t\\tif(rem <= 0) break;\\n\\t\\t\\n\\t\\tif(vec[i].second == 1) sum++;\\n\\t\\telse sum--;\\n\\t\\t\\n\\t\\tif(i < (int)vec.size()-1){\\n\\t\\t\\tllint dist = vec[i].first - vec[i+1].first;\\n\\t\\t\\tif(sum * dist <= rem){\\n\\t\\t\\t\\trem -= sum * dist;\\n\\t\\t\\t\\tans -= sum * get(vec[i+1].first, vec[i].first);\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tllint pos = vec[i].first - rem/sum;\\n\\t\\t\\t\\trem %= sum;\\n\\t\\t\\t\\tans -= sum * get(pos, vec[i].first);\\n\\t\\t\\t\\tans -= pos * rem;\\n\\t\\t\\t\\trem = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7860,\n \"score_of_the_acc\": -0.5516,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3144_4278651\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing lint = long long int;\\nusing pint = pair<int, int>;\\nusing plint = pair<lint, lint>;\\nstruct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;\\n#define ALL(x) (x).begin(), (x).end()\\n#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)\\n#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)\\n#define REP(i, n) FOR(i,0,n)\\n#define IREP(i, n) IFOR(i,0,n)\\ntemplate<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }\\ntemplate<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }\\ntemplate<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }\\ntemplate<typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }\\ntemplate<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }\\ntemplate<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }\\ntemplate<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }\\ntemplate<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << \\\"[\\\"; for (auto v : vec) os << v << \\\",\\\"; os << \\\"]\\\"; return os; }\\ntemplate<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << \\\"deq[\\\"; for (auto v : vec) os << v << \\\",\\\"; os << \\\"]\\\"; return os; }\\ntemplate<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << \\\"{\\\"; for (auto v : vec) os << v << \\\",\\\"; os << \\\"}\\\"; return os; }\\ntemplate<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << \\\"{\\\"; for (auto v : vec) os << v << \\\",\\\"; os << \\\"}\\\"; return os; }\\ntemplate<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << \\\"{\\\"; for (auto v : vec) os << v << \\\",\\\"; os << \\\"}\\\"; return os; }\\ntemplate<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << \\\"{\\\"; for (auto v : vec) os << v << \\\",\\\"; os << \\\"}\\\"; return os; }\\ntemplate<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << \\\"(\\\" << pa.first << \\\",\\\" << pa.second << \\\")\\\"; return os; }\\ntemplate<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << \\\"{\\\"; for (auto v : mp) os << v.first << \\\"=>\\\" << v.second << \\\",\\\"; os << \\\"}\\\"; return os; }\\ntemplate<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << \\\"{\\\"; for (auto v : mp) os << v.first << \\\"=>\\\" << v.second << \\\",\\\"; os << \\\"}\\\"; return os; }\\n#define dbg(x) cerr << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << endl;\\n\\n\\nlint calccost(lint x) {\\n return x * (x + 1) / 2;\\n}\\n\\nint main()\\n{\\n lint N, M, K;\\n cin >> N >> M >> K;\\n vector<lint> A(N);\\n cin >> A;\\n sort(ALL(A));\\n\\n vector<plint> ranges;\\n IREP(i, N) {\\n lint pre = min(A[i], M);\\n M -= pre;\\n if (pre < A[i]) ranges.emplace_back(pre, A[i]);\\n }\\n lint no = -10, ok = 1e12;\\n while (abs(ok - no) > 1) {\\n lint c = (ok + no) / 2;\\n lint cnt = 0;\\n for (auto p : ranges) {\\n if (p.second < c) continue;\\n if (p.first < c) cnt += p.second - c + 1;\\n else cnt += p.second - p.first;\\n }\\n if (cnt > K) no = c;\\n else ok = c;\\n }\\n for (auto &p : ranges) if (p.second >= ok) {\\n if (ok > p.first) {\\n lint dec = p.second - ok + 1;\\n K -= dec;\\n p.second -= dec;\\n }\\n else {\\n K -= p.second - p.first;\\n p.second = p.first;\\n }\\n }\\n lint ret = 0;\\n for (auto p : ranges)\\n {\\n if (p.second == ok - 1 and p.first < p.second and K) p.second--, K--;\\n if (p.first < p.second) ret = ret + calccost(p.second) - calccost(p.first);\\n }\\n cout << ret << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5780,\n \"score_of_the_acc\": -0.302,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3144_4278578\",\n \"code_snippet\": \"#include <bits/stdc++.h> // clang-format off\\n#define pb push_back\\n#define eb emplace_back\\n#define fi first\\n#define se second\\n#define each(x,v) for(auto& x : v)\\n#define all(v) (v).begin(),(v).end()\\n#define sz(v) ((int)(v).size())\\n#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)\\n#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)\\n#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)\\n#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)\\n#define in2(s,t) rep(i,sz(s)){in(s[i] , t[i]);}\\n#define in3(s,t,u) rep(i,sz(s)){in(s[i] , t[i] , u[i]);}\\n#define in4(s,t,u,v) rep(i,sz(s)){in(s[i] , t[i] , u[i] , v[i]);}\\n#ifdef ONLINE_JUDGE\\n #define rep(i,N) for(int i = 0; i < (int)(N); i++)\\n #define repr(i,N) for(int i = (int)(N) - 1; i >= 0; i--)\\n #define rep1(i,N) for(int i = 1; i <= (int)(N) ; i++)\\n #define repr1(i,N) for(int i = (N) ; (int)(i) > 0 ; i--)\\n#else\\n #define rep(i,N) for(long long i = 0; i < (long long)(N); i++)\\n #define repr(i,N) for(long long i = (long long)(N) - 1; i >= 0; i--)\\n #define rep1(i,N) for(long long i = 1; i <= (long long)(N) ; i++)\\n #define repr1(i,N) for(long long i = (N) ; (long long)(i) > 0 ; i--)\\n#endif\\nusing namespace std; void solve();\\nusing ll = long long; template<class T = ll> using V = vector<T>;\\nusing vi = V<int>; using vl = V<>; using vvi = V< V<int> >;\\nusing vd = V<double>; using vs = V<string>; using vvl = V< V<> >;\\nconstexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1;\\ntemplate<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\ntemplate<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\ntemplate<typename T,typename U>ll ceil(T a,U b){return (a + b - 1) / b;}\\ntemplate<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << \\\" \\\" << p.second; return os; }\\ntemplate<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }\\ntemplate<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); for(int i=0;i<s;i++) os << (i ? \\\" \\\" : \\\"\\\") << v[i]; return os; }\\ntemplate<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }\\nvoid in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}\\nvoid out(){cout << \\\"\\\\n\\\";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << \\\" \\\"; out(u...);}\\ntemplate<typename T>void die(T x){out(x); exit(0);}\\n\\n#ifdef NyaanDebug\\n #include \\\"NyaanDebug.h\\\"\\n #define trc(...) do { cerr << #__VA_ARGS__ << \\\" = \\\"; dbg_out(__VA_ARGS__);} while(0)\\n #define trca(v,N) do { cerr << #v << \\\" = \\\"; array_out(v , N);} while(0)\\n #define trcc(v) do { cerr << \\\"name : \\\" << #v << \\\"\\\\n\\\"; int cnt = 0; each(x , v){cerr << (cnt++) << \\\" : \\\"; trc(x); } } while(0)\\n#else\\n #define trc(...)\\n #define trca(...)\\n #define trcc(...)\\n int main(){solve();}\\n#endif\\n\\nconstexpr ll TEN(int n){ll ret=1,x=10;while(n){if(n&1)ret*=x;x*=x;n>>=1;}return ret;}\\n#define mem(a, val) memset(a, val, sizeof(a))\\n\\nstruct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;\\nusing P = pair<ll,ll>; using vp = V<P>;\\nconstexpr int MOD = /** 1000000007; //*/ 998244353;\\n// clang-format on\\n////////////////////////////////////////////////////\\n\\nvoid solve(){\\n inl(N , M , K);\\n vl a(N); in(a);\\n sort(all(a));\\n ll ss = accumulate(all(a),0LL);\\n if(ss <= M + K) die(0);\\n\\n int r = N;\\n ll s = 0;\\n while(r != 0 && s + a[r - 1] <= M){\\n s += a[r - 1];\\n r--;\\n }\\n // \\n // r - 1番目の特殊条件\\n ll rmin = M - s;\\n\\n // [ 0 , r )\\n trc(s , r , rmin);\\n // 実装が難しい\\n \\n // maxをxに出来ますか？\\n ll ng = -1 , ok = M;\\n while(ng + 1 < ok){\\n ll med = (ng + ok) / 2;\\n ll cur = 0;\\n rep(i , r){\\n if(i != r - 1) cur += max(0LL , a[i] - med);\\n else cur += max(0LL , a[i] - max(med,rmin) );\\n }\\n (cur <= K ? ok : ng) = med;\\n }\\n\\n trc(ok);\\n \\n rep(i , r){\\n if(i != r - 1){\\n if(a[i] > ok){\\n K -= a[i] - ok;\\n a[i] = ok;\\n }\\n }\\n else{\\n if(a[i] > max(rmin,ok) ){\\n K -= a[i] - max(rmin,ok);\\n a[i] = max(rmin,ok);\\n }\\n }\\n }\\n\\n repr(i , r){\\n if(i == r - 1 && a[i] == rmin) continue;\\n if(K == 0) break;\\n a[i]--; K--;\\n }\\n\\n ll ans = -(rmin) * (rmin + 1) / 2;\\n\\n rep(i , r){\\n ans += a[i] * (a[i] + 1) / 2;\\n }\\n out(ans);\\n\\n\\n\\n \\n \\n\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -0.0451,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3144_4278559\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <climits>\\n#include <cmath>\\n#include <complex>\\n#include <cstring>\\n#include <deque>\\n#include <functional>\\n#include <iostream>\\n#include <iomanip>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <vector>\\n#include <cstdint>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pii;\\n#define MP make_pair\\n#define PB push_back\\n#define inf 1000000007\\n#define rep(i,n) for(int i = 0; i < (int)(n); ++i)\\n#define all(x) (x).begin(),(x).end()\\n\\ntemplate<typename A, size_t N, typename T>\\nvoid Fill(A (&array)[N], const T &val){\\n std::fill( (T*)array, (T*)(array+N), val );\\n}\\n \\ntemplate<class T> inline bool chmax(T &a, T b){\\n if(a<b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T> inline bool chmin(T &a, T b){\\n if(a>b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nll dp[1000010];\\nint main(){\\n int n;\\n cin >> n;\\n ll m,k;\\n cin >> m >> k;\\n vector<ll>a(n);\\n rep(i,n)cin >> a[i];\\n sort(a.rbegin(),a.rend());\\n bool flag = 1;\\n ll sm = 0;\\n \\n for(int i=0;i<n;i++){\\n if(flag){\\n if(sm + a[i]<=m){\\n sm += a[i];\\n }else{\\n flag = 0;\\n dp[a[i]]++;\\n dp[m-sm]--;\\n }\\n }else{\\n dp[a[i]]++;\\n dp[0]--;\\n }\\n }\\n ll cnt = 0;\\n ll res = 0;\\n for(ll i=1000001;i>=0;i--){\\n cnt += dp[i];\\n if(cnt==0)continue;\\n if(k>0){\\n if(k>cnt){\\n k-=cnt;\\n }else{\\n res += (cnt-k)*i;\\n k = 0;\\n }\\n }else{\\n res += cnt*i;\\n }\\n }\\n cout << res << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 11468,\n \"score_of_the_acc\": -1.4846,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3144_4277894\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> l_l;\\ntypedef pair<int, int> i_i;\\ntemplate<class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nconst long double EPS = 1e-10;\\nconst long long INF = 1e18;\\nconst long double PI = acos(-1.0L);\\n//const ll mod = 1000000007;\\nll N, M, K;\\n\\nll imos[1005000];\\n\\nint main() {\\n cin >> N >> M >> K;\\n vector<ll> A(N);\\n for(int i = 0; i < N; i++) cin >> A[i];\\n sort(A.begin(), A.end());\\n ll sum = 0;\\n for(int i = N - 1; i >= 0; i--) {\\n ll rest = M - sum;\\n if(rest < A[i]) {\\n imos[A[i]]++;\\n ll tmp = A[i] - rest;\\n imos[A[i]-tmp]--;\\n //cerr << i << \\\" \\\" << A[i] << \\\" \\\" << A[i]- tmp - 1 << endl;\\n }\\n sum += A[i];\\n chmin(sum, M);\\n }\\n for(int i = 1e6; i >= 0; i--) {\\n imos[i] += imos[i+1];\\n }\\n /*\\n for(int i = 0; i <= 10; i++) {\\n cerr << i << \\\" \\\"<< imos[i] << endl;\\n }\\n */\\n ll ans = 0;\\n for(int i = 1e6; i >= 1; i--) {\\n ll tmp = min(imos[i], K);\\n imos[i] -= tmp;\\n K -= tmp;\\n //if(i <= 10) cerr << i << \\\" \\\" << imos[i] << endl;\\n ans += i * imos[i];\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 11596,\n \"score_of_the_acc\": -2,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1965,"cells":{"group_id":{"kind":"string","value":"aoj_3142_cpp"},"problem_description":{"kind":"string","value":"F: ボタンの木\n問題文\n$N$ 頂点 $N-1$ 辺からなる木があり、$i$ 番目の辺は $u_i$ 番目の頂点と $v_i$ 番目の頂点を接続しています。\n各頂点にはボタンが咲いており、$i$ 番目の頂点に咲いているボタンをボタン $i$ と呼ぶことにします。\nはじめ、ボタン $i$ の美しさは $a_i$ です。\nボタン $i$ を押すたびに、ボタン $i$ の美しさを隣接するボタンに $1$ ずつ分け与えます。\nすなわち、$i$ 番目の頂点に $c_1, ..., c_k$ 番目の頂点が隣接している場合、ボタン $i$ の美しさが $k$ 減少し、ボタン $c_1, ..., c_k$ の美しさがそれぞれ $1$ ずつ増加します。\nこのとき、負の美しさのボタンを押しても良いし、ボタンを押した結果あるボタンの美しさが負になっても良いです。\nあなたの目的はボタン $1, 2, ..., N$ の美しさをそれぞれ $b_1, ..., b_N$ にすることです。\n最小で合計何回ボタンを押せば目的を達成できるでしょうか。\n制約\n入力はすべて整数である\n$1 \\leq N \\leq 10^5$\n$1 \\leq u_i, v_i \\leq N$\n$-1000 \\leq a_i, b_i \\leq 1000$\n$\\sum_i a_i = \\sum_i b_i$\n与えられるグラフは木である\n与えられる入力において目的は必ず達成できる\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$\n$u_1$ $v_1$\n$\\vdots$\n$u_{N-1}$ $v_{N-1}$\n$a_1$ $a_2$ $...$ $a_N$\n$b_1$ $b_2$ $...$ $b_N$\n出力\n目的を達成するためにボタンを押す合計回数の最小値を出力せよ。\n入力例1\n4\n1 2\n1 3\n3 4\n0 3 2 0\n-3 4 5 -1\n出力例1\n4\n次のように合計 $4$ 回ボタンを押すことで目的を達成でき、このときが最小です。\nボタン $1$ を $2$ 回押します。ボタン $1, 2, 3, 4$ の美しさがそれぞれ $-4, 5, 4, 0$ に変化します。\nボタン $2$ を $1$ 回押します。美しさがそれぞれ $-3, 4, 4, 0$ に変化します。\nボタン $4$ を $1$ 回押します。美しさがそれぞれ $-3, 4, 5, -1$ に変化します。\n入力例2\n5\n1 2\n1 3\n3 4\n3 5\n-9 5 7 1 8\n-7 4 5 1 9\n出力例2\n3"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3142_10412835","code_snippet":"// AOJ #3142 Tree of Peony\n// 2025.4.23\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nint main(){\n int N = Cin();\n\n vector<vector<int>> adj(N+1);\n for(int i = 0; i < N-1; i++){\n int u = Cin(), v = Cin();\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n\n vector<ll> a(N+1), b(N+1), d(N+1), D(N+1), P(N+1);\n for(int i = 1; i <= N; i++) a[i] = Cin();\n for(int i = 1; i <= N; i++){\n b[i] = Cin();\n d[i] = b[i] - a[i];\n D[i] = d[i];\n }\n\n vector<int> parent(N+1), order;\n order.reserve(N);\n stack<int> st;\n st.push(1);\n parent[1] = 0;\n while(!st.empty()){\n int u = st.top(); st.pop();\n order.push_back(u);\n for(int v: adj[u]){\n if(v == parent[u]) continue;\n parent[v] = u;\n st.push(v);\n }\n }\n\n for(int i = N-1; i >= 0; --i){\n int u = order[i];\n if(u != 1) D[parent[u]] += D[u];\n }\n\n ll C = LLONG_MIN;\n for(int u: order){\n if(u == 1) P[u] = 0;\n else P[u] = P[parent[u]] + D[u];\n C = max(C, P[u]);\n }\n\n ll ans = 0;\n for(int i = 1; i <= N; i++) ans += (C - P[i]);\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":13844,"score_of_the_acc":-0.2517,"final_rank":1},{"submission_id":"aoj_3142_9142281","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=int64_t;\n\nint n;\nll ans=0;\nvector<vector<int>> g(100000);\nvector<ll> a(100000),c(100000),d(100000,0);\n\nvoid dfs(int t,int p){ \n c[t]=1;\n for(int i:g[t]){\n if(i==p) continue;\n dfs(i,t);\n c[t]+=c[i];\n d[t]=max(d[t],-a[i]);\n }\n ans+=d[t];\n for(int i:g[t]){\n if(i==p) continue;\n ans+=(c[i]*(d[t]+a[i]));\n a[t]+=a[i];\n a[i]=0;\n }\n if(p>=0){\n a[t]-=d[t];\n a[p]+=d[t];\n if(a[t]>0){\n ans+=c[t]*a[t];\n a[p]+=a[t];\n a[t]=0;\n }\n }\n return;\n}\n\n\nint main() {\n\n int n;\n cin >> n;\n int u,v;\n for(int i=0;i<n-1;i++){\n cin >> u >> v;\n u--;v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n for(int i=0;i<n;i++) cin >> a[i];\n ll b;\n for(int i=0;i<n;i++){\n cin >> b;\n a[i]-=b;\n }\n\n dfs(0,-1);\n cout << ans << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":18076,"score_of_the_acc":-0.6402,"final_rank":5},{"submission_id":"aoj_3142_9138691","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=int64_t;\n\nint n;\nll ans=0;\nvector<vector<int>> g(100000);\nvector<ll> a(100000);\n\ntuple<ll,ll,int> dfs(int t,int p){ //pairは、親への＋/自身/子、孫の合計数\n if(g[t].size()==1){ \n if(a[t]>0){\n ll at=a[t];\n a[t]=0;\n ans+=at;\n return make_tuple(at,0,1);\n }\n return make_tuple(0,a[t],1);\n }\n vector<pair<ll,int>> ch;\n ll chmin=0;\n int mini=-1,nums=0;\n for(int i=0;i<(int)g[t].size();i++){\n if(g[t][i]==p) continue;\n auto [at,ca,num]=dfs(g[t][i],t);\n \n if(at>0) a[t]+=at;\n if(chmin>ca){\n chmin=ca;\n mini=i;\n }\n ch.emplace_back(ca,num);\n nums+=num;\n }\n int chn=(int)ch.size();\n ll at=0;\n if(mini!=-1){\n ans+=(-chmin);\n if(t!=0){\n at+=(-chmin);\n a[t]+=chmin*(chn+1);\n }else{\n a[t]+=chmin*chn;\n }\n for(int i=0;i<chn;i++){\n if(i==mini) continue;\n auto [ca,num]=ch[i];\n ans+=((ca-chmin)*num);\n a[t]+=(ca-chmin);\n }\n }\n \n if(a[t]>0){\n at+=a[t];\n ans+=a[t];\n ans+=(a[t]*nums);\n a[t]=0;\n }\n return make_tuple(at,a[t],nums+1);\n}\n\n\nint main() {\n\n int n;\n cin >> n;\n int u,v;\n for(int i=0;i<n-1;i++){\n cin >> u >> v;\n u--;v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n for(int i=0;i<n;i++) cin >> a[i];\n ll b;\n for(int i=0;i<n;i++){\n cin >> b;\n a[i]-=b;\n }\n\n auto [at,ca,num]=dfs(0,-1);\n cout << ans << endl;\n //cout << at << \" \" << ca << \" \" << num << endl;\n}","accuracy":0.08695652173913043,"time_ms":30,"memory_kb":7884,"score_of_the_acc":-0.0778,"final_rank":16},{"submission_id":"aoj_3142_9138671","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=int64_t;\n\nint n,ans=0;\nvector<vector<int>> g(100000);\nvector<int> a(100000);\n\ntuple<int,int,int> dfs(int t,int p){ //pairは、親への＋/自身/子、孫の合計数\n if(g[t].size()==1){ \n if(a[t]>0){\n int at=a[t];\n a[t]=0;\n ans+=at;\n return make_tuple(at,0,1);\n }\n return make_tuple(0,a[t],1);\n }\n vector<pair<int,int>> ch;\n int chmin=0,mini=-1,nums=0;\n for(int i=0;i<(int)g[t].size();i++){\n if(g[t][i]==p) continue;\n auto [at,ca,num]=dfs(g[t][i],t);\n \n if(at>0) a[t]+=at;\n if(chmin>ca){\n chmin=ca;\n mini=i;\n }\n ch.emplace_back(ca,num);\n nums+=num;\n }\n int chn=(int)ch.size();\n int at=0;\n if(mini!=-1){\n ans+=(-chmin);\n if(t!=0){\n at+=(-chmin);\n a[t]+=chmin*(chn+1);\n }else{\n a[t]+=chmin*chn;\n }\n for(int i=0;i<chn;i++){\n if(i==mini) continue;\n auto [ca,num]=ch[i];\n ans+=((ca-chmin)*num);\n a[t]+=(ca-chmin);\n }\n }\n \n if(a[t]>0){\n at+=a[t];\n ans+=a[t];\n ans+=(a[t]*nums);\n a[t]=0;\n }\n return make_tuple(at,a[t],nums+1);\n}\n\n\nint main() {\n\n int n;\n cin >> n;\n int u,v;\n for(int i=0;i<n-1;i++){\n cin >> u >> v;\n u--;v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n for(int i=0;i<n;i++) cin >> a[i];\n for(int i=0;i<n;i++){\n cin >> u;\n a[i]-=u;\n }\n\n auto [at,ca,num]=dfs(0,-1);\n cout << ans << endl;\n //cout << at << \" \" << ca << \" \" << num << endl;\n}","accuracy":0.08695652173913043,"time_ms":30,"memory_kb":7728,"score_of_the_acc":-0.0714,"final_rank":15},{"submission_id":"aoj_3142_4885527","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)\n#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)\n#define REP(i, n) rep(i, 0, n)\n#define REP2(i, n) rep2(i, 0, n)\n#define all(hoge) (hoge).begin(), (hoge).end()\n#define en '\\n'\nusing ll = long long;\nusing ull = unsigned long long;\ntemplate <class T>\nusing vec = vector<T>;\ntemplate <class T>\nusing vvec = vector<vec<T>>;\ntypedef pair<ll, ll> P;\nusing tp = tuple<ll, ll, ll>;\nconstexpr long long INF = 1LL << 60;\nconstexpr int INF_INT = 1 << 25;\n//constexpr long long MOD = (ll)1e9 + 7;\nconstexpr long long MOD = 998244353LL;\nusing ld = long double;\nstatic const ld pi = 3.141592653589793L;\ntypedef vector<ll> Array;\ntypedef vector<Array> Matrix;\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//グラフ関連\nstruct Edge {\n ll to, cap, rev;\n Edge(ll _to, ll _cap, ll _rev) {\n to = _to;\n cap = _cap;\n rev = _rev;\n }\n};\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {\n G[from].push_back(Edge(to, cap, (ll)G[to].size()));\n if(revFlag)\n G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\n}\n\nint sz[101010];\nint cost[101010];\nint diff[101010];\nvoid solve() {\n ll n;\n cin >> n;\n Graph g(n);\n REP(i, n - 1) {\n ll u, v;\n cin >> u >> v;\n u--;\n v--;\n add_edge(g, u, v, 1, true, 1);\n }\n\n vec<ll> a(n), b(n);\n REP(i, n) {\n cin >> a[i];\n }\n REP(i, n) {\n cin >> b[i];\n }\n\n auto dfs = [&](auto &&self, int v, int p) -> void {\n sz[v] = 1;\n int ma = -INF_INT;\n for(auto e : g[v]) {\n if(e.to == p)\n continue;\n self(self, e.to, v);\n sz[v] += sz[e.to];\n chmax(ma, diff[e.to]);\n }\n\n diff[v] = b[v] - a[v];\n if(ma != -INF_INT)\n cost[v] = max(ma, 0);\n else\n cost[v] += max(a[v] - b[v], 0LL);\n\n for(auto e : g[v]) {\n if(e.to == p)\n continue;\n if(ma >= 0 and diff[e.to] <= ma) {\n cost[v] += max(0, ma - diff[e.to]) * sz[e.to]; //余計に渡したぶんを回収\n }\n diff[v] += diff[e.to]; //不足分を引かれる\n cost[v] += cost[e.to];\n }\n //cout << v << \" \" << cost[v] << \" \" << diff[v] << \" \" << sz[v] << en;\n };\n\n dfs(dfs, 0, -1);\n cout << cost[0] << en;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n /*\n ll t;\n cin >> t;\n while(t--)*/\n solve();\n\n return 0;\n}","accuracy":0.08695652173913043,"time_ms":20,"memory_kb":10096,"score_of_the_acc":-0.1332,"final_rank":18},{"submission_id":"aoj_3142_4885525","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)\n#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)\n#define REP(i, n) rep(i, 0, n)\n#define REP2(i, n) rep2(i, 0, n)\n#define all(hoge) (hoge).begin(), (hoge).end()\n#define en '\\n'\nusing ll = long long;\nusing ull = unsigned long long;\ntemplate <class T>\nusing vec = vector<T>;\ntemplate <class T>\nusing vvec = vector<vec<T>>;\ntypedef pair<ll, ll> P;\nusing tp = tuple<ll, ll, ll>;\nconstexpr long long INF = 1LL << 60;\nconstexpr int INF_INT = 1 << 25;\n//constexpr long long MOD = (ll)1e9 + 7;\nconstexpr long long MOD = 998244353LL;\nusing ld = long double;\nstatic const ld pi = 3.141592653589793L;\ntypedef vector<ll> Array;\ntypedef vector<Array> Matrix;\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//グラフ関連\nstruct Edge {\n ll to, cap, rev;\n Edge(ll _to, ll _cap, ll _rev) {\n to = _to;\n cap = _cap;\n rev = _rev;\n }\n};\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {\n G[from].push_back(Edge(to, cap, (ll)G[to].size()));\n if(revFlag)\n G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\n}\n\nint sz[101010];\nint cost[101010];\nint diff[101010];\nvoid solve() {\n ll n;\n cin >> n;\n Graph g(n);\n REP(i, n - 1) {\n ll u, v;\n cin >> u >> v;\n u--;\n v--;\n add_edge(g, u, v, 1, true, 1);\n }\n\n vec<ll> a(n), b(n);\n REP(i, n) {\n cin >> a[i];\n }\n REP(i, n) {\n cin >> b[i];\n }\n\n auto dfs = [&](auto &&self, int v, int p) -> void {\n sz[v] = 1;\n int ma = -INF_INT;\n for(auto e : g[v]) {\n if(e.to == p)\n continue;\n self(self, e.to, v);\n sz[v] += sz[e.to];\n chmax(ma, diff[e.to]);\n }\n\n diff[v] = b[v] - a[v];\n if(ma != -INF_INT)\n cost[v] = max(ma, 0);\n else\n cost[v] += max(a[v] - b[v], 0LL);\n\n for(auto e : g[v]) {\n if(e.to == p)\n continue;\n if(diff[e.to] <= ma) {\n cost[v] += max(0, ma - diff[e.to]) * sz[e.to]; //余計に渡したぶんを回収\n }\n diff[v] += diff[e.to]; //不足分を引かれる\n cost[v] += cost[e.to];\n }\n //cout << v << \" \" << cost[v] << \" \" << diff[v] << \" \" << sz[v] << en;\n };\n\n dfs(dfs, 0, -1);\n cout << cost[0] << en;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n /*\n ll t;\n cin >> t;\n while(t--)*/\n solve();\n\n return 0;\n}","accuracy":0.08695652173913043,"time_ms":10,"memory_kb":10052,"score_of_the_acc":-0.0957,"final_rank":17},{"submission_id":"aoj_3142_4875881","code_snippet":"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3142\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename F>\nstruct FixPoint : F{\n FixPoint(F&& f):F(forward<F>(f)){}\n template<typename... Args>\n decltype(auto) operator()(Args&&... args) const{\n return F::operator()(*this,forward<Args>(args)...);\n }\n};\ntemplate<typename F>\ninline decltype(auto) MFP(F&& f){\n return FixPoint<F>{forward<F>(f)};\n}\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\nstruct Centroid{\n vector<int> sz,dead;\n vector< vector<int> > G;\n Centroid(){}\n Centroid(int n):sz(n,1),dead(n,0),G(n){}\n\n void add_edge(int u,int v){\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n }\n\n int dfs(int v,int p){\n sz[v]=1;\n for(int u:G[v])\n if(u!=p&&!dead[u]) sz[v]+=dfs(u,v);\n return sz[v];\n }\n\n void find(int v,int p,int tmp,vector<int> &cs) {\n int ok=1;\n for (int u:G[v]){\n if(u==p||dead[u]) continue;\n find(u,v,tmp,cs);\n ok&=(sz[u]<=tmp/2);\n }\n ok&=(tmp-sz[v]<=tmp/2);\n if(ok) cs.emplace_back(v);\n }\n\n vector<int> build(int r) {\n int tmp=dfs(r,-1);\n vector<int> cs;\n find(r,-1,tmp,cs);\n return cs;\n }\n\n const vector<int>& operator[](int k)const{return G[k];}\n void disable(int v){dead[v]=1;}\n void enable(int v){dead[v]=0;}\n int alive(int v){return !dead[v];}\n};\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n using ll = long long;\n\n int n;\n cin>>n;\n Centroid G(n);\n for(int i=1;i<n;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G.add_edge(u,v);\n }\n\n vector<ll> as(n),bs(n);\n for(int i=0;i<n;i++) cin>>as[i];\n for(int i=0;i<n;i++) cin>>bs[i];\n\n using P = pair<int, ll>;\n vector<vector<P>> H(n);\n MFP([&](auto dfs,int v,int p)->ll{\n ll res=as[v]-bs[v];\n for(int u:G[v]){\n if(u==p) continue;\n ll tmp=dfs(u,v);\n H[u].emplace_back(v,-tmp);\n H[v].emplace_back(u,+tmp);\n res+=tmp;\n }\n return res;\n })(0,-1);\n\n vector<ll> dp(n,0);\n queue<int> que;\n que.emplace(G.build(0)[0]);\n\n vector<ll> tmp(n);\n while(!que.empty()){\n int r=que.front();que.pop();\n\n for(int t=0;t<2;t++){\n ll res=0;\n for(auto ch:H[r]){\n int c=ch.first;\n if(!G.alive(c)) continue;\n\n // calc cost\n MFP([&](auto dfs,int v,int p,ll d)->void{\n chmin(dp[v],-d+res);\n for(auto[u,w]:H[v]){\n if(u==p) continue;\n if(!G.alive(u)) continue;\n dfs(u,v,d+w);\n }\n })(c,r,ch.second);\n\n // update cost\n MFP([&](auto dfs,int v,int p,ll d)->void{\n chmin(res,d);\n for(auto[u,w]:H[v]){\n if(u==p) continue;\n if(!G.alive(u)) continue;\n dfs(u,v,d+w);\n }\n })(c,r,ch.second);\n }\n chmin(dp[r],res);\n reverse(H[r].begin(),H[r].end());\n }\n\n G.disable(r);\n for(int c:G.G[r])\n if(G.alive(c))\n que.emplace(G.build(c)[0]);\n }\n\n ll ans=0;\n for(ll x:dp) ans+=x;\n cout<<-ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":31264,"score_of_the_acc":-1.7544,"final_rank":10},{"submission_id":"aoj_3142_4875879","code_snippet":"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3142\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename F>\nstruct FixPoint : F{\n FixPoint(F&& f):F(forward<F>(f)){}\n template<typename... Args>\n decltype(auto) operator()(Args&&... args) const{\n return F::operator()(*this,forward<Args>(args)...);\n }\n};\ntemplate<typename F>\ninline decltype(auto) MFP(F&& f){\n return FixPoint<F>{forward<F>(f)};\n}\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\nstruct Centroid{\n vector<int> sz,dead;\n vector< vector<int> > G;\n Centroid(){}\n Centroid(int n):sz(n,1),dead(n,0),G(n){}\n\n void add_edge(int u,int v){\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n }\n\n int dfs(int v,int p){\n sz[v]=1;\n for(int u:G[v])\n if(u!=p&&!dead[u]) sz[v]+=dfs(u,v);\n return sz[v];\n }\n\n void find(int v,int p,int tmp,vector<int> &cs) {\n int ok=1;\n for (int u:G[v]){\n if(u==p||dead[u]) continue;\n find(u,v,tmp,cs);\n ok&=(sz[u]<=tmp/2);\n }\n ok&=(tmp-sz[v]<=tmp/2);\n if(ok) cs.emplace_back(v);\n }\n\n vector<int> build(int r) {\n int tmp=dfs(r,-1);\n vector<int> cs;\n find(r,-1,tmp,cs);\n return cs;\n }\n\n const vector<int>& operator[](int k)const{return G[k];}\n void disable(int v){dead[v]=1;}\n void enable(int v){dead[v]=0;}\n int alive(int v){return !dead[v];}\n};\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n using ll = long long;\n\n int n;\n cin>>n;\n Centroid G(n);\n for(int i=1;i<n;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G.add_edge(u,v);\n }\n\n vector<ll> as(n),bs(n);\n for(int i=0;i<n;i++) cin>>as[i];\n for(int i=0;i<n;i++) cin>>bs[i];\n\n using P = pair<int, ll>;\n vector<vector<P>> H(n);\n MFP([&](auto dfs,int v,int p)->ll{\n ll res=as[v]-bs[v];\n for(int u:G.G[v]){\n if(u==p) continue;\n ll tmp=dfs(u,v);\n H[u].emplace_back(v,-tmp);\n H[v].emplace_back(u,+tmp);\n res+=tmp;\n }\n return res;\n })(0,-1);\n\n vector<ll> dp(n,0);\n queue<int> que;\n que.emplace(G.build(0)[0]);\n\n vector<ll> tmp(n);\n while(!que.empty()){\n int r=que.front();que.pop();\n\n for(int t=0;t<2;t++){\n ll res=0;\n for(auto ch:H[r]){\n int c=ch.first;\n if(!G.alive(c)) continue;\n\n // calc cost\n MFP([&](auto dfs,int v,int p,ll d)->void{\n chmin(dp[v],-d+res);\n for(auto[u,w]:H[v]){\n if(u==p) continue;\n if(!G.alive(u)) continue;\n dfs(u,v,d+w);\n }\n })(c,r,ch.second);\n\n // update cost\n MFP([&](auto dfs,int v,int p,ll d)->void{\n chmin(res,d);\n for(auto[u,w]:H[v]){\n if(u==p) continue;\n if(!G.alive(u)) continue;\n dfs(u,v,d+w);\n }\n })(c,r,ch.second);\n }\n chmin(dp[r],res);\n reverse(H[r].begin(),H[r].end());\n }\n\n G.disable(r);\n for(int c:G.G[r])\n if(G.alive(c))\n que.emplace(G.build(c)[0]);\n }\n\n ll ans=0;\n for(int x:dp) ans+=x;\n cout<<-ans<<endl;\n return 0;\n}","accuracy":0.2608695652173913,"time_ms":240,"memory_kb":26180,"score_of_the_acc":-1.5809,"final_rank":12},{"submission_id":"aoj_3142_4875794","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\nusing Int = long long;\nconst char newl = '\\n';\n\n\ntemplate<typename F>\nstruct FixPoint : F{\n FixPoint(F&& f):F(forward<F>(f)){}\n template<typename... Args>\n decltype(auto) operator()(Args&&... args) const{\n return F::operator()(*this,forward<Args>(args)...);\n }\n};\ntemplate<typename F>\ninline decltype(auto) MFP(F&& f){\n return FixPoint<F>{forward<F>(f)};\n}\n\n\nstruct Centroid{\n vector<Int> sz,dead;\n vector< vector<Int> > G;\n Centroid(){}\n Centroid(Int n):sz(n,1),dead(n,0),G(n){}\n\n void add_edge(Int u,Int v){\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n }\n\n Int dfs(Int v,Int p){\n sz[v]=1;\n for(Int u:G[v])\n if(u!=p&&!dead[u]) sz[v]+=dfs(u,v);\n return sz[v];\n }\n\n void find(Int v,Int p,Int tmp,vector<Int> &cs) {\n Int ok=1;\n for (Int u:G[v]){\n if(u==p||dead[u]) continue;\n find(u,v,tmp,cs);\n ok&=(sz[u]<=tmp/2);\n }\n ok&=(tmp-sz[v]<=tmp/2);\n if(ok) cs.emplace_back(v);\n }\n\n vector<Int> build(Int r) {\n Int tmp=dfs(r,-1);\n vector<Int> cs;\n find(r,-1,tmp,cs);\n return cs;\n }\n\n void disable(Int v){dead[v]=1;}\n void enable(Int v){dead[v]=0;}\n Int alive(Int v){return !dead[v];}\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n Int n;\n cin>>n;\n Centroid G(n);\n for(Int i=1;i<n;i++){\n Int u,v;\n cin>>u>>v;\n u--;v--;\n G.add_edge(u,v);\n }\n\n vector<Int> as(n),bs(n);\n for(Int i=0;i<n;i++) cin>>as[i];\n for(Int i=0;i<n;i++) cin>>bs[i];\n\n using P = pair<Int, Int>;\n vector<vector<P>> H(n);\n MFP([&](auto dfs,Int v,Int p)->Int{\n Int res=as[v]-bs[v];\n for(Int u:G.G[v]){\n if(u==p) continue;\n Int tmp=dfs(u,v);\n //cout<<u+1<<\" \"<<v+1<<\":\"<<-tmp<<endl;\n //cout<<v+1<<\" \"<<u+1<<\":\"<<+tmp<<endl;\n H[u].emplace_back(v,-tmp);\n H[v].emplace_back(u,+tmp);\n res+=tmp;\n }\n return res;\n })(0,-1);\n\n vector<Int> dp(n,0);\n queue<Int> que;\n que.emplace(G.build(0)[0]);\n\n vector<Int> tmp(n);\n while(!que.empty()){\n Int r=que.front();que.pop();\n\n for(Int t=0;t<2;t++){\n Int res=0;\n for(auto ch:H[r]){\n Int c=ch.first;\n if(!G.alive(c)) continue;\n\n // calc cost\n MFP([&](auto dfs,Int v,Int p,Int d)->void{\n // cout<<r+1<<\":\"<<v+1<<\" \"<<d<<endl;\n chmin(dp[v],-d+res);\n for(auto e:H[v]){\n Int u=e.first,w=e.second;\n if(u==p) continue;\n if(!G.alive(u)) continue;\n dfs(u,v,d+w);\n }\n })(c,r,ch.second);\n\n // update cost\n MFP([&](auto dfs,Int v,Int p,Int d)->void{\n chmin(res,d);\n for(auto e:H[v]){\n Int u=e.first,w=e.second;\n if(u==p) continue;\n if(!G.alive(u)) continue;\n dfs(u,v,d+w);\n }\n })(c,r,ch.second);\n }\n chmin(dp[r],res);\n reverse(H[r].begin(),H[r].end());\n }\n\n G.disable(r);\n for(Int c:G.G[r])\n if(G.alive(c))\n que.emplace(G.build(c)[0]);\n }\n // for(Int x:dp) cout<<x<<endl;\n\n Int ans=0;\n for(Int x:dp) ans+=x;\n cout<<-ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":32024,"score_of_the_acc":-2,"final_rank":11},{"submission_id":"aoj_3142_4746489","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\n\nll V;\nvector<int> G[SIZE];\nll A[SIZE],B[SIZE],diff[SIZE];\nll COUNT[SIZE];\n\nvoid dfs(int node_id,int pre){\n\n\tdiff[node_id] = A[node_id]-B[node_id];\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs(child,node_id);\n\t\tdiff[node_id] += diff[child];\n\t}\n}\n\nvoid dfs2(int node_id,int pre){\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\n\t\tif(child == pre){\n\t\t\tCOUNT[node_id] = COUNT[pre]+diff[node_id];\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs2(child,node_id);\n\t}\n}\n\n\nint main(){\n\n\tscanf(\"%lld\",&V);\n\n\tint from,to;\n\tfor(ll i = 0; i < V-1; i++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\tfor(ll i = 0; i < V; i++){\n\n\t\tscanf(\"%lld\",&A[i]);\n\t}\n\tfor(ll i = 0; i < V; i++){\n\n\t\tscanf(\"%lld\",&B[i]);\n\t}\n\n\tdfs(0,-1);\n\n\tCOUNT[0] = 0;\n\tdfs2(0,-1);\n\n\tll ans = 0;\n\tll minimum = HUGE_NUM;\n\n\tfor(int i = 0; i < V; i++){\n\n\t\tans += COUNT[i];\n\t\tminimum = min(minimum,COUNT[i]);\n\t}\n\n\tans -= V*minimum;\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":17664,"score_of_the_acc":-0.5518,"final_rank":2},{"submission_id":"aoj_3142_4746370","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\n\nint V;\nll ans;\nvector<int> G[SIZE];\nll A[SIZE],B[SIZE],diff[SIZE];\n\nvoid dfs(int node_id,int pre){\n\n\tll sum = 0;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs(child,node_id);\n\t\tsum += diff[child];\n\t}\n\n\tll tmp = A[node_id]+sum-B[node_id];\n\tans += abs(tmp);\n}\n\n\nint main(){\n\n\tscanf(\"%d\",&V);\n\n\tint from,to;\n\tfor(int i = 0; i < V-1; i++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\tfor(int i = 0; i < V; i++){\n\n\t\tscanf(\"%lld\",&A[i]);\n\t}\n\tfor(int i = 0; i < V; i++){\n\n\t\tscanf(\"%lld\",&B[i]);\n\t}\n\n\tans = 0;\n\n\tdfs(0,-1);\n\n\tprintf(\"%lld\\n\",ans/2);\n\n\treturn 0;\n}","accuracy":0.08695652173913043,"time_ms":20,"memory_kb":8520,"score_of_the_acc":-0.0683,"final_rank":14},{"submission_id":"aoj_3142_4746359","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\n\nint V;\nint ans;\nvector<int> G[SIZE];\nint A[SIZE],B[SIZE],diff[SIZE];\n\nvoid dfs(int node_id,int pre){\n\n\tint sum = 0;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs(child,node_id);\n\t\tsum += diff[child];\n\t}\n\n\tint tmp = A[node_id]+sum-B[node_id];\n\tans += abs(tmp);\n}\n\n\nint main(){\n\n\tscanf(\"%d\",&V);\n\n\tint from,to;\n\tfor(int i = 0; i < V-1; i++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\tfor(int i = 0; i < V; i++){\n\n\t\tscanf(\"%d\",&A[i]);\n\t}\n\tfor(int i = 0; i < V; i++){\n\n\t\tscanf(\"%d\",&B[i]);\n\t}\n\n\tans = 0;\n\n\tdfs(0,-1);\n\n\tprintf(\"%d\\n\",ans/2);\n\n\treturn 0;\n}","accuracy":0.08695652173913043,"time_ms":20,"memory_kb":8048,"score_of_the_acc":-0.0489,"final_rank":13},{"submission_id":"aoj_3142_4356978","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,n) for (int i=a;i<n;i++)\n#define per(i,a,n) for (int i=n-1;i>=a;i--)\n#define pb push_back\n#define mp make_pair\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define SZ(x) ((int)(x).size())\ntypedef vector<int> VI;\ntypedef long long ll;\ntypedef pair<int,int> PII;\ntypedef double db;\nmt19937 mrand(random_device{}()); \nconst ll mod=998244353;\nint rnd(int x) { return mrand() % x;}\nll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\nll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}\n// head\n\nconst int N=201000;\nint n,a[N],b[N],u,v;\nVI e[N];\nll ret[N];\n\nvoid dfs(int u,int f) {\n\tfor (auto v:e[u]) {\n\t\tif (v==f) continue;\n\t\tdfs(v,u);\n\t\ta[u]+=a[v];\n\t\tb[u]+=b[v];\n\t}\n}\n\nvoid dfs2(int u,int f) {\n\tfor (auto v:e[u]) {\n\t\tif (v==f) continue;\n\t\tret[v]=ret[u]+a[v]-b[v];\n\t\tdfs2(v,u);\n\t}\n}\n\nint main() {\n\tscanf(\"%d\",&n);\n\trep(i,1,n) {\n\t\tscanf(\"%d%d\",&u,&v);\n\t\te[u].pb(v);\n\t\te[v].pb(u);\n\t}\n\trep(i,1,n+1) scanf(\"%d\",a+i);\n\trep(i,1,n+1) scanf(\"%d\",b+i);\n\tdfs(1,0);\n\tdfs2(1,0);\n\tll x=*min_element(ret+1,ret+n+1);\n\tll ans=0;\n\trep(i,1,n+1) ans+=ret[i]-x;\n\tprintf(\"%lld\\n\",ans);\n}","accuracy":1,"time_ms":50,"memory_kb":18448,"score_of_the_acc":-0.5841,"final_rank":3},{"submission_id":"aoj_3142_4285704","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#ifndef ONLINE_JUDGE\n#define dbg(x...) do { cout << \"\\033[32;1m \" << #x << \" -> \"; err(x); } while (0)\nvoid err() { cout << \"\\033[39;0m\" << endl; }\ntemplate<template<typename...> class T, typename t, typename... A>\nvoid err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }\ntemplate<typename T, typename... A>\nvoid err(T a, A... x) { cout << a << ' '; err(x...); }\n#else\n#define dbg(...)\n#endif\ntypedef long long ll;\ntypedef pair<int,int> pi;\ntypedef vector<int> vi;\ntemplate<class T> using vc=vector<T>;\ntemplate<class T> using vvc=vc<vc<T>>;\ntemplate<class T> void mkuni(vector<T>&v)\n{\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\nll rand_int(ll l, ll r) //[l, r]\n{\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n return uniform_int_distribution<ll>(l, r)(gen);\n}\ntemplate<class T>\nvoid print(T x,int suc=1)\n{\n cout<<x;\n if(suc==1) cout<<'\\n';\n else cout<<' ';\n}\ntemplate<class T>\nvoid print(const vector<T>&v,int suc=1)\n{\n for(int i=0;i<v.size();i++)\n print(v[i],i==(int)(v.size())-1?suc:2);\n}\nconst int maxn=1e5+7;\nvi G[maxn];\nint a[maxn],b[maxn];\nint sum[maxn];\nll ans=0;\nvoid dfs(int u,int fa=-1)\n{\n sum[u]=b[u]-a[u];\n for(auto v:G[u])if(v!=fa)\n {\n dfs(v,u);\n sum[u]+=sum[v];\n }\n}\nll k[maxn];\nvoid dfs2(int u,int fa=-1,ll cur=0)\n{\n k[u]=cur;\n ans=min(ans,k[u]);\n for(auto v:G[u])if(v!=fa)\n dfs2(v,u,cur-sum[v]);\n}\nint main()\n{\n int n;\n cin>>n;\n for(int i=1,u,v;i<n;i++)\n {\n cin>>u>>v;\n G[u].push_back(v);\n G[v].push_back(u);\n }\n for(int i=0;i<n;i++) cin>>a[i+1];\n for(int i=0;i<n;i++) cin>>b[i+1];\n dfs(1);\n dfs2(1);\n //dbg(ans);\n ll op=0;\n for(int i=1;i<=n;i++)\n {\n //dbg(k[i]);\n op+=k[i];\n }\n op+=-n*ans;\n print(op);\n}","accuracy":1,"time_ms":100,"memory_kb":16268,"score_of_the_acc":-0.6729,"final_rank":7},{"submission_id":"aoj_3142_4285700","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#ifndef ONLINE_JUDGE\n#define dbg(x...) do { cout << \"\\033[32;1m \" << #x << \" -> \"; err(x); } while (0)\nvoid err() { cout << \"\\033[39;0m\" << endl; }\ntemplate<template<typename...> class T, typename t, typename... A>\nvoid err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }\ntemplate<typename T, typename... A>\nvoid err(T a, A... x) { cout << a << ' '; err(x...); }\n#else\n#define dbg(...)\n#endif\ntypedef long long ll;\ntypedef pair<int,int> pi;\ntypedef vector<int> vi;\ntemplate<class T> using vc=vector<T>;\ntemplate<class T> using vvc=vc<vc<T>>;\ntemplate<class T> void mkuni(vector<T>&v)\n{\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\nll rand_int(ll l, ll r) //[l, r]\n{\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n return uniform_int_distribution<ll>(l, r)(gen);\n}\ntemplate<class T>\nvoid print(T x,int suc=1)\n{\n cout<<x;\n if(suc==1) cout<<'\\n';\n else cout<<' ';\n}\ntemplate<class T>\nvoid print(const vector<T>&v,int suc=1)\n{\n for(int i=0;i<v.size();i++)\n print(v[i],i==(int)(v.size())-1?suc:2);\n}\nconst int maxn=1e5+7;\nvi G[maxn];\nint a[maxn],b[maxn];\nint sum[maxn];\nint ans=0x3f3f3f3f;\nvoid dfs(int u,int fa=-1)\n{\n sum[u]=b[u]-a[u];\n for(auto v:G[u])if(v!=fa)\n {\n dfs(v,u);\n sum[u]+=sum[v];\n }\n}\nint k[maxn];\nvoid dfs2(int u,int fa=-1,int cur=0)\n{\n k[u]=cur;\n ans=min(ans,k[u]);\n for(auto v:G[u])if(v!=fa)\n dfs2(v,u,cur-sum[v]);\n}\nint main()\n{\n int n;\n cin>>n;\n for(int i=1,u,v;i<n;i++)\n {\n cin>>u>>v;\n G[u].push_back(v);\n G[v].push_back(u);\n }\n for(int i=0;i<n;i++) cin>>a[i+1];\n for(int i=0;i<n;i++) cin>>b[i+1];\n dfs(1);\n dfs2(1);\n //dbg(ans);\n int op=0;\n for(int i=1;i<=n;i++)\n {\n //dbg(k[i]);\n op+=k[i];\n }\n op+=-n*ans;\n print(op);\n}","accuracy":0.08695652173913043,"time_ms":50,"memory_kb":8324,"score_of_the_acc":-0.1674,"final_rank":19},{"submission_id":"aoj_3142_4284031","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <set>\n#include <tuple>\n#define mkp make_pair\n#define mkt make_tuple\n#define rep(i,n) for(int i = 0; i < (n); ++i)\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=1e9+7;\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\n\nvector<vector<int>> g;\nvector<ll> A,B;\n\nll ans;\nvector<int> size;\nvector<ll> dp;\n\nvoid sizedfs(int now,int par){\n size[now]=1;\n for(auto nex:g[now]) if(nex!=par){\n sizedfs(nex,now);\n size[now]+=size[nex];\n }\n}\n\nvoid dfs(int now,int par){\n ll ma=0;\n for(auto nex:g[now]) if(nex!=par){\n dfs(nex,now);\n chmax(ma,-dp[nex]);\n }\n ans+=ma;\n dp[now]-=g[now].size()*ma;\n if(par!=-1) dp[par]+=ma;\n for(auto nex:g[now]) if(nex!=par){\n dp[nex]+=ma;\n ans+=dp[nex]*size[nex];\n dp[now]+=dp[nex];\n dp[nex]=0;\n }\n\n if(dp[now]>0){\n ans+=dp[now]*size[now];\n if(par!=-1) dp[par]+=dp[now];\n dp[now]=0;\n }\n}\n\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int N;\n cin>>N;\n g.resize(N);\n rep(i,N-1){\n int a,b;\n cin>>a>>b;\n a--;b--;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n A.resize(N);\n rep(i,N) cin>>A[i];\n B.resize(N);\n rep(i,N) cin>>B[i];\n\n int root=0;\n rep(i,N) if(g[i].size()==1) root=i;\n size.resize(N);\n sizedfs(root,-1);\n\n dp.resize(N);\n rep(i,N) dp[i]=A[i]-B[i];\n dfs(root,-1);\n\n cout<<ans<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":18912,"score_of_the_acc":-0.6032,"final_rank":4},{"submission_id":"aoj_3142_4282266","code_snippet":"#include <bits/stdc++.h>\n// created [2020/03/20] 14:42:56\n#pragma GCC diagnostic ignored \"-Wsign-compare\"\n#pragma GCC diagnostic ignored \"-Wsign-conversion\"\n\nusing i32 = int32_t;\nusing i64 = int64_t;\nusing u32 = uint32_t;\nusing u64 = uint64_t;\nusing uint = unsigned int;\nusing usize = std::size_t;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\ntemplate<typename T, usize n>\nusing arr = T (&)[n];\ntemplate<typename T, usize n>\nusing c_arr = const T (&)[n];\ntemplate<typename T>\nusing max_heap = std::priority_queue<T>;\ntemplate<typename T>\nusing min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }\ntemplate<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }\ntemplate<typename T> constexpr T msbp1(const T u) { return log2p1(u); }\ntemplate<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }\ntemplate<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }\ntemplate<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }\ntemplate<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }\ntemplate<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }\ntemplate<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }\ntemplate<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }\ntemplate<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }\ntemplate<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }\ntemplate<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }\ntemplate<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }\ntemplate<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }\ntemplate<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }\nconstexpr unsigned int mod = 1000000007;\ntemplate<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;\ntemplate<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\n\ntemplate<typename T>\nT in()\n{\n T v;\n return std::cin >> v, v;\n}\ntemplate<typename T, typename Uint, usize n, usize i>\nT in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }\ntemplate<typename T, typename Uint, usize n, usize i>\nauto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)\n{\n const usize s = (usize)szs[i];\n std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);\n for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }\n return ans;\n}\ntemplate<typename T, typename Uint, usize n>\nauto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }\ntemplate<typename... Types>\nauto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }\nstruct io_init\n{\n io_init()\n {\n std::cin.tie(nullptr), std::ios::sync_with_stdio(false);\n std::cout << std::fixed << std::setprecision(20);\n }\n void clear()\n {\n std::cin.tie(), std::ios::sync_with_stdio(true);\n }\n} io_setting;\n\nint out() { return 0; }\ntemplate<typename T>\nint out(const T& v) { return std::cout << v, 0; }\ntemplate<typename T>\nint out(const std::vector<T>& v)\n{\n for (usize i = 0; i < v.size(); i++) {\n if (i > 0) { std::cout << ' '; }\n out(v[i]);\n }\n return 0;\n}\ntemplate<typename T1, typename T2>\nint out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }\ntemplate<typename T, typename... Args>\nint out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }\ntemplate<typename... Args>\nint outln(const Args... args) { return out(args...), std::cout << '\\n', 0; }\ntemplate<typename... Args>\nint outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\n# define SHOW(...) static_cast<void>(0)\nconstexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }\n\ntemplate<typename T, typename Uint, usize n, usize i>\nauto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }\ntemplate<typename T, typename Uint, usize n, usize i>\nauto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})\n{\n const usize s = (usize)szs[i];\n return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));\n}\ntemplate<typename T, typename Uint, usize n>\nauto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }\n\ntemplate<typename Cost = usize>\nstruct edge\n{\n using cost_type = Cost;\n usize u, v;\n Cost c;\n edge(const usize u, const usize v) : u{u}, v{v}, c{1} {}\n edge(const usize u, const usize v, const Cost& c) : u{u}, v{v}, c{c} {}\n operator usize() const { return v; }\n usize from() const { return u; }\n usize to() const { return v; }\n Cost cost() const { return c; }\n friend std::ostream& operator<<(std::ostream& os, const edge& e) { return os << e.u << \"->\" << e.v << \":\" << e.c; }\n};\ntemplate<typename Edge>\nclass base_graph\n{\npublic:\n base_graph(const usize n) : v{n}, es(n), res(n) {}\n void add_edge(const usize u, const usize v, const bool bi = false)\n {\n es[u].emplace_back(u, v), res[v].emplace_back(v, u);\n if (bi) { es[v].emplace_back(v, u), res[u].emplace_back(u, v); }\n }\n template<typename Cost>\n void add_edge(const usize u, const usize v, const Cost& c, const bool bi = false)\n {\n es[u].emplace_back(u, v, c), res[v].emplace_back(v, u, c);\n if (bi) { es[v].emplace_back(v, u, c), res[u].emplace_back(u, v, c); }\n }\n std::vector<Edge>& operator[](const usize u) { return es[u]; }\n const std::vector<Edge>& operator[](const usize u) const { return es[u]; }\n std::vector<Edge>& from(const usize u) { return es[u]; }\n const std::vector<Edge>& from(const usize u) const { return es[u]; }\n std::vector<Edge>& to(const usize v) { return res[v]; }\n const std::vector<Edge>& to(const usize v) const { return res[v]; }\n usize size() const { return v; }\n friend std::ostream& operator<<(std::ostream& os, const base_graph& g)\n {\n for (usize i = 0; i < g.v; i++) {\n for (const auto& e : g.es[i]) { os << e << '\\n'; }\n }\n return os;\n }\n\nprivate:\n usize v;\n std::vector<std::vector<Edge>> es, res;\n};\ntemplate<typename Edge>\nusing base_tree = base_graph<Edge>;\nusing graph = base_graph<edge<>>;\nusing tree = base_graph<edge<>>;\ntemplate<typename Cost>\nusing cost_graph = base_graph<edge<Cost>>;\ntemplate<typename Cost>\nusing cost_tree = base_graph<edge<Cost>>;\nint main()\n{\n auto N = in<int>();\n graph g(N);\n for (int i = 0; i < N - 1; i++) {\n const auto u = in<int>() - 1, v = in<int>() - 1;\n g.add_edge(u, v, true);\n }\n const auto as = in_v<ll>({N});\n const auto bs = in_v<ll>({N});\n std::vector<ll> cs(N);\n for (int i = 0; i < N; i++) { cs[i] = bs[i] - as[i]; }\n using pll = std::pair<ll, ll>;\n std::vector<ll> push(N); // push[i]=b ：頂点iをした回数はx+b\n std::vector<ll> need(N); // need[i]=b ：頂点par[i]を押す回数はx+b\n std::vector<pll> total(N); // total[i]=<a,b>：頂点i以下を押した回数はax+b\n mfp([&](auto&& self, const int s, const int p) -> void {\n ll max = 0;\n for (const int to : g[s]) {\n if (to == p) { continue; }\n self(self, to, s);\n chmax(max, need[to]);\n }\n push[s] = max;\n need[s] = cs[s] + push[s] * g[s].size();\n ll ta = 1, tb = push[s];\n for (const int to : g[s]) {\n if (to == p) { continue; }\n const ll alpha = max - need[to];\n need[s] -= push[to] + alpha;\n ta += total[to].first, tb += total[to].second + total[to].first * alpha;\n }\n total[s] = {ta, tb};\n })(0, -1);\n outln(total[0].second);\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":30720,"score_of_the_acc":-1.1963,"final_rank":9},{"submission_id":"aoj_3142_4282259","code_snippet":"#include <bits/stdc++.h>\n// created [2020/03/20] 14:42:56\n#pragma GCC diagnostic ignored \"-Wsign-compare\"\n#pragma GCC diagnostic ignored \"-Wsign-conversion\"\n\nusing i32 = int32_t;\nusing i64 = int64_t;\nusing u32 = uint32_t;\nusing u64 = uint64_t;\nusing uint = unsigned int;\nusing usize = std::size_t;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\ntemplate<typename T, usize n>\nusing arr = T (&)[n];\ntemplate<typename T, usize n>\nusing c_arr = const T (&)[n];\ntemplate<typename T>\nusing max_heap = std::priority_queue<T>;\ntemplate<typename T>\nusing min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }\ntemplate<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }\ntemplate<typename T> constexpr T msbp1(const T u) { return log2p1(u); }\ntemplate<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }\ntemplate<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }\ntemplate<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }\ntemplate<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }\ntemplate<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }\ntemplate<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }\ntemplate<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }\ntemplate<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }\ntemplate<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }\ntemplate<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }\ntemplate<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }\ntemplate<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }\ntemplate<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }\nconstexpr unsigned int mod = 1000000007;\ntemplate<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;\ntemplate<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\n\ntemplate<typename T>\nT in()\n{\n T v;\n return std::cin >> v, v;\n}\ntemplate<typename T, typename Uint, usize n, usize i>\nT in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }\ntemplate<typename T, typename Uint, usize n, usize i>\nauto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)\n{\n const usize s = (usize)szs[i];\n std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);\n for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }\n return ans;\n}\ntemplate<typename T, typename Uint, usize n>\nauto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }\ntemplate<typename... Types>\nauto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }\nstruct io_init\n{\n io_init()\n {\n std::cin.tie(nullptr), std::ios::sync_with_stdio(false);\n std::cout << std::fixed << std::setprecision(20);\n }\n void clear()\n {\n std::cin.tie(), std::ios::sync_with_stdio(true);\n }\n} io_setting;\n\nint out() { return 0; }\ntemplate<typename T>\nint out(const T& v) { return std::cout << v, 0; }\ntemplate<typename T>\nint out(const std::vector<T>& v)\n{\n for (usize i = 0; i < v.size(); i++) {\n if (i > 0) { std::cout << ' '; }\n out(v[i]);\n }\n return 0;\n}\ntemplate<typename T1, typename T2>\nint out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }\ntemplate<typename T, typename... Args>\nint out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }\ntemplate<typename... Args>\nint outln(const Args... args) { return out(args...), std::cout << '\\n', 0; }\ntemplate<typename... Args>\nint outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\n# define SHOW(...) static_cast<void>(0)\nconstexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }\n\ntemplate<typename T, typename Uint, usize n, usize i>\nauto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }\ntemplate<typename T, typename Uint, usize n, usize i>\nauto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})\n{\n const usize s = (usize)szs[i];\n return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));\n}\ntemplate<typename T, typename Uint, usize n>\nauto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }\n\ntemplate<typename Cost = usize>\nstruct edge\n{\n using cost_type = Cost;\n usize u, v;\n Cost c;\n edge(const usize u, const usize v) : u{u}, v{v}, c{1} {}\n edge(const usize u, const usize v, const Cost& c) : u{u}, v{v}, c{c} {}\n operator usize() const { return v; }\n usize from() const { return u; }\n usize to() const { return v; }\n Cost cost() const { return c; }\n friend std::ostream& operator<<(std::ostream& os, const edge& e) { return os << e.u << \"->\" << e.v << \":\" << e.c; }\n};\ntemplate<typename Edge>\nclass base_graph\n{\npublic:\n base_graph(const usize n) : v{n}, es(n), res(n) {}\n void add_edge(const usize u, const usize v, const bool bi = false)\n {\n es[u].emplace_back(u, v), res[v].emplace_back(v, u);\n if (bi) { es[v].emplace_back(v, u), res[u].emplace_back(u, v); }\n }\n template<typename Cost>\n void add_edge(const usize u, const usize v, const Cost& c, const bool bi = false)\n {\n es[u].emplace_back(u, v, c), res[v].emplace_back(v, u, c);\n if (bi) { es[v].emplace_back(v, u, c), res[u].emplace_back(u, v, c); }\n }\n std::vector<Edge>& operator[](const usize u) { return es[u]; }\n const std::vector<Edge>& operator[](const usize u) const { return es[u]; }\n std::vector<Edge>& from(const usize u) { return es[u]; }\n const std::vector<Edge>& from(const usize u) const { return es[u]; }\n std::vector<Edge>& to(const usize v) { return res[v]; }\n const std::vector<Edge>& to(const usize v) const { return res[v]; }\n usize size() const { return v; }\n friend std::ostream& operator<<(std::ostream& os, const base_graph& g)\n {\n for (usize i = 0; i < g.v; i++) {\n for (const auto& e : g.es[i]) { os << e << '\\n'; }\n }\n return os;\n }\n\nprivate:\n usize v;\n std::vector<std::vector<Edge>> es, res;\n};\ntemplate<typename Edge>\nusing base_tree = base_graph<Edge>;\nusing graph = base_graph<edge<>>;\nusing tree = base_graph<edge<>>;\ntemplate<typename Cost>\nusing cost_graph = base_graph<edge<Cost>>;\ntemplate<typename Cost>\nusing cost_tree = base_graph<edge<Cost>>;\nint main()\n{\n auto N = in<int>();\n graph g(N);\n for (int i = 0; i < N - 1; i++) {\n const auto u = in<int>() - 1, v = in<int>() - 1;\n g.add_edge(u, v, true);\n }\n const auto as = in_v<ll>({N});\n const auto bs = in_v<ll>({N});\n std::vector<ll> cs(N);\n for (int i = 0; i < N; i++) { cs[i] = bs[i] - as[i]; }\n using pll = std::pair<ll, ll>;\n std::vector<ll> push(N); // push[i]=b ：頂点iをした回数はx+b\n std::vector<ll> need(N); // need[i]=b ：頂点par[i]を押す回数はx+b\n std::vector<pll> total(N); // total[i]=<a,b>：頂点i以下を押した回数はax+b\n SHOW(cs);\n mfp([&](auto&& self, const int s, const int p) -> void {\n ll max = 0;\n for (const int to : g[s]) {\n if (to == p) { continue; }\n self(self, to, s);\n chmax(max, need[to]);\n }\n push[s] = max;\n need[s] = cs[s] + push[s] * g[s].size();\n ll ta = 1, tb = push[s];\n for (const int to : g[s]) {\n if (to == p) { continue; }\n const ll alpha = max - need[to];\n need[s] -= push[to] + alpha;\n push[s] += push[to] + alpha;\n ta += total[to].first, tb += total[to].second + total[to].first * alpha;\n }\n total[s] = {ta, tb};\n })(0, -1);\n outln(total[0].second);\n return 0;\n}","accuracy":0.08695652173913043,"time_ms":30,"memory_kb":16664,"score_of_the_acc":-0.4392,"final_rank":20},{"submission_id":"aoj_3142_4281488","code_snippet":"#include <iostream>\n#include <cmath>\n#include <numeric>\n#include <algorithm>\n#include <deque>\n#include <vector>\n#include <unordered_map>\n#include <unordered_set>\n#include <iomanip>\n#include <map>\n#include <stack>\n#include <queue>\n#include <functional>\n#include <climits>\n#include <bitset>\n#include <random>\n#include <tuple>\n#include <initializer_list>\n#include <fstream>\n\nstruct SubTree {\n\tlong long int min_step, back_for_minstep, need_to_push;\n\tlong long int push_back_multiplier, sum_initial, sum_target;\n};\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<std::vector<int>> nodes(n);\n\tfor (auto i = 1; i < n; ++i) {\n\t\tint u, v; std::cin >> u >> v;\n\t\tnodes[--u].push_back(--v);\n\t\tnodes[v].push_back(u);\n\t}\n\tstd::vector<int> initial_size(n), target_size(n);\n\tfor (auto& a : initial_size) std::cin >> a;\n\tfor (auto& b : target_size) std::cin >> b;\n\tstd::vector<int> depth(n, -1), parent(n, -1), child_count(n, 0); depth[0] = 0;\n\tstd::stack<int> stack; stack.push(0);\n\twhile (!stack.empty()) {\n\t\tconst auto top = stack.top(); stack.pop();\n\t\tfor (const auto next : nodes[top]) if (depth[next] == -1) {\n\t\t\tdepth[next] = depth[top] + 1;\n\t\t\tparent[next] = top;\n\t\t\tstack.push(next);\n\t\t\t++child_count[top];\n\t\t}\n\t}\n\tstd::vector<SubTree> sub_trees(n);\n\tfor (auto i = 0; i < n; ++i) if (child_count[i] == 0) {\n\t\tstack.push(i);\n\t}\n\twhile (!stack.empty()) {\n\t\tconst auto top = stack.top(); stack.pop();\n\t\tlong long int sum_min_step{ 0 }, sum_back{ 0 }, sum_multiplier{ 0 }, max_need{ 0 }, sum_need{ 0 }, sum_initial_size{ initial_size[top] }, sum_target_size{ target_size[top] };\n\t\tfor (const auto next: nodes[top]) if (depth[next] > depth[top]) {\n\t\t\tsum_min_step += sub_trees[next].min_step;\n\t\t\tsum_back += sub_trees[next].back_for_minstep;\n\t\t\tsum_multiplier += sub_trees[next].push_back_multiplier;\n\t\t\tmax_need = std::max(max_need, sub_trees[next].need_to_push);\n\t\t\tsum_need += sub_trees[next].need_to_push;\n\t\t\tsum_initial_size += sub_trees[next].sum_initial;\n\t\t\tsum_target_size += sub_trees[next].sum_target;\n\t\t}\n\t\tconst auto need_to_push{ std::max(max_need, sum_initial_size - sum_target_size) };\n\t\tsum_min_step += need_to_push;\n\t\tfor (const auto next : nodes[top]) if (depth[next] > depth[top]) {\n\t\t\tsum_min_step += (need_to_push - sub_trees[next].need_to_push) * sub_trees[next].push_back_multiplier;\n\t\t}\n\t\tsub_trees[top] = SubTree{ sum_min_step, need_to_push, std::max(sum_target_size - sum_initial_size + need_to_push, 0LL),\n\t\t\tsum_multiplier + 1, sum_initial_size, sum_target_size };\n\t\tif (parent[top] != -1 && --child_count[parent[top]] == 0) {\n\t\t\tstack.push(parent[top]);\n\t\t}\n\t}\n\tstd::cout << sub_trees[0].min_step << '\\n';\n}","accuracy":1,"time_ms":100,"memory_kb":15744,"score_of_the_acc":-0.6514,"final_rank":6},{"submission_id":"aoj_3142_4281158","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing i64 = long long;\n#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)\n#define all(x) x.begin(),x.end()\n\ntemplate<class T>\nstatic inline std::vector<T> ndvec(size_t&& n, T val) noexcept {\n return std::vector<T>(n, std::forward<T>(val));\n}\n\ntemplate<class... Tail>\nstatic inline auto ndvec(size_t&& n, Tail&&... tail) noexcept {\n return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));\n}\n\ntemplate<class T, class Cond>\nstruct chain {\n Cond cond; chain(Cond cond) : cond(cond) {}\n bool operator()(T& a, const T& b) const {\n if(cond(a, b)) { a = b; return true; }\n return false;\n }\n};\ntemplate<class T, class Cond>\nchain<T, Cond> make_chain(Cond cond) { return chain<T, Cond>(cond); }\n\ni64 N;\nvector<vector<i64>> G;\n\nvector<i64> A, B;\nvector<i64> D;\n\nvoid dfs(i64 v, i64 f) {\n for(auto t: G[v]) {\n if(t == f) continue;\n dfs(t, v);\n D[v] += D[t];\n }\n}\n\nvector<i64> X;\n\nvoid dfs2(i64 v, i64 f) {\n for(auto t: G[v]) {\n if(t == f) continue;\n X[t] = X[v] - D[t];\n dfs2(t, v);\n }\n}\n\nint main() {\n cin >> N;\n G.resize(N);\n rep(i,0,N - 1) {\n i64 a, b;\n cin >> a >> b;\n a--;\n b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n\n A.resize(N);\n B.resize(N);\n D.resize(N);\n rep(i,0,N) {\n cin >> A[i];\n }\n rep(i,0,N) {\n cin >> B[i];\n }\n rep(i,0,N) {\n D[i] = B[i] - A[i];\n }\n\n dfs(0, -1);\n X.resize(N);\n dfs2(0, -1);\n\n i64 MIN = *min_element(all(X));\n i64 ans = 0;\n rep(i,0,N) {\n ans += X[i] - MIN;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":100,"memory_kb":17304,"score_of_the_acc":-0.7156,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_3142_10412835\",\n \"code_snippet\": \"// AOJ #3142 Tree of Peony\\n// 2025.4.23\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n#define gc() getchar_unlocked()\\n\\nint Cin() {\\n\\tint n = 0; int c = gc();\\n\\tif (c == '-') {\\tc = gc();\\n\\t\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\t\\treturn -n;\\n\\t}\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nint main(){\\n int N = Cin();\\n\\n vector<vector<int>> adj(N+1);\\n for(int i = 0; i < N-1; i++){\\n int u = Cin(), v = Cin();\\n adj[u].push_back(v);\\n adj[v].push_back(u);\\n }\\n\\n vector<ll> a(N+1), b(N+1), d(N+1), D(N+1), P(N+1);\\n for(int i = 1; i <= N; i++) a[i] = Cin();\\n for(int i = 1; i <= N; i++){\\n b[i] = Cin();\\n d[i] = b[i] - a[i];\\n D[i] = d[i];\\n }\\n\\n vector<int> parent(N+1), order;\\n order.reserve(N);\\n stack<int> st;\\n st.push(1);\\n parent[1] = 0;\\n while(!st.empty()){\\n int u = st.top(); st.pop();\\n order.push_back(u);\\n for(int v: adj[u]){\\n if(v == parent[u]) continue;\\n parent[v] = u;\\n st.push(v);\\n }\\n }\\n\\n for(int i = N-1; i >= 0; --i){\\n int u = order[i];\\n if(u != 1) D[parent[u]] += D[u];\\n }\\n\\n ll C = LLONG_MIN;\\n for(int u: order){\\n if(u == 1) P[u] = 0;\\n else P[u] = P[parent[u]] + D[u];\\n C = max(C, P[u]);\\n }\\n\\n ll ans = 0;\\n for(int i = 1; i <= N; i++) ans += (C - P[i]);\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 13844,\n \"score_of_the_acc\": -0.2517,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3142_9142281\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\nint n;\\nll ans=0;\\nvector<vector<int>> g(100000);\\nvector<ll> a(100000),c(100000),d(100000,0);\\n\\nvoid dfs(int t,int p){ \\n c[t]=1;\\n for(int i:g[t]){\\n if(i==p) continue;\\n dfs(i,t);\\n c[t]+=c[i];\\n d[t]=max(d[t],-a[i]);\\n }\\n ans+=d[t];\\n for(int i:g[t]){\\n if(i==p) continue;\\n ans+=(c[i]*(d[t]+a[i]));\\n a[t]+=a[i];\\n a[i]=0;\\n }\\n if(p>=0){\\n a[t]-=d[t];\\n a[p]+=d[t];\\n if(a[t]>0){\\n ans+=c[t]*a[t];\\n a[p]+=a[t];\\n a[t]=0;\\n }\\n }\\n return;\\n}\\n\\n\\nint main() {\\n\\n int n;\\n cin >> n;\\n int u,v;\\n for(int i=0;i<n-1;i++){\\n cin >> u >> v;\\n u--;v--;\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n for(int i=0;i<n;i++) cin >> a[i];\\n ll b;\\n for(int i=0;i<n;i++){\\n cin >> b;\\n a[i]-=b;\\n }\\n\\n dfs(0,-1);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 18076,\n \"score_of_the_acc\": -0.6402,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3142_9138691\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\nint n;\\nll ans=0;\\nvector<vector<int>> g(100000);\\nvector<ll> a(100000);\\n\\ntuple<ll,ll,int> dfs(int t,int p){ //pairは、親への＋/自身/子、孫の合計数\\n if(g[t].size()==1){ \\n if(a[t]>0){\\n ll at=a[t];\\n a[t]=0;\\n ans+=at;\\n return make_tuple(at,0,1);\\n }\\n return make_tuple(0,a[t],1);\\n }\\n vector<pair<ll,int>> ch;\\n ll chmin=0;\\n int mini=-1,nums=0;\\n for(int i=0;i<(int)g[t].size();i++){\\n if(g[t][i]==p) continue;\\n auto [at,ca,num]=dfs(g[t][i],t);\\n \\n if(at>0) a[t]+=at;\\n if(chmin>ca){\\n chmin=ca;\\n mini=i;\\n }\\n ch.emplace_back(ca,num);\\n nums+=num;\\n }\\n int chn=(int)ch.size();\\n ll at=0;\\n if(mini!=-1){\\n ans+=(-chmin);\\n if(t!=0){\\n at+=(-chmin);\\n a[t]+=chmin*(chn+1);\\n }else{\\n a[t]+=chmin*chn;\\n }\\n for(int i=0;i<chn;i++){\\n if(i==mini) continue;\\n auto [ca,num]=ch[i];\\n ans+=((ca-chmin)*num);\\n a[t]+=(ca-chmin);\\n }\\n }\\n \\n if(a[t]>0){\\n at+=a[t];\\n ans+=a[t];\\n ans+=(a[t]*nums);\\n a[t]=0;\\n }\\n return make_tuple(at,a[t],nums+1);\\n}\\n\\n\\nint main() {\\n\\n int n;\\n cin >> n;\\n int u,v;\\n for(int i=0;i<n-1;i++){\\n cin >> u >> v;\\n u--;v--;\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n for(int i=0;i<n;i++) cin >> a[i];\\n ll b;\\n for(int i=0;i<n;i++){\\n cin >> b;\\n a[i]-=b;\\n }\\n\\n auto [at,ca,num]=dfs(0,-1);\\n cout << ans << endl;\\n //cout << at << \\\" \\\" << ca << \\\" \\\" << num << endl;\\n}\",\n \"accuracy\": 0.08695652173913043,\n \"time_ms\": 30,\n \"memory_kb\": 7884,\n \"score_of_the_acc\": -0.0778,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3142_9138671\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\nint n,ans=0;\\nvector<vector<int>> g(100000);\\nvector<int> a(100000);\\n\\ntuple<int,int,int> dfs(int t,int p){ //pairは、親への＋/自身/子、孫の合計数\\n if(g[t].size()==1){ \\n if(a[t]>0){\\n int at=a[t];\\n a[t]=0;\\n ans+=at;\\n return make_tuple(at,0,1);\\n }\\n return make_tuple(0,a[t],1);\\n }\\n vector<pair<int,int>> ch;\\n int chmin=0,mini=-1,nums=0;\\n for(int i=0;i<(int)g[t].size();i++){\\n if(g[t][i]==p) continue;\\n auto [at,ca,num]=dfs(g[t][i],t);\\n \\n if(at>0) a[t]+=at;\\n if(chmin>ca){\\n chmin=ca;\\n mini=i;\\n }\\n ch.emplace_back(ca,num);\\n nums+=num;\\n }\\n int chn=(int)ch.size();\\n int at=0;\\n if(mini!=-1){\\n ans+=(-chmin);\\n if(t!=0){\\n at+=(-chmin);\\n a[t]+=chmin*(chn+1);\\n }else{\\n a[t]+=chmin*chn;\\n }\\n for(int i=0;i<chn;i++){\\n if(i==mini) continue;\\n auto [ca,num]=ch[i];\\n ans+=((ca-chmin)*num);\\n a[t]+=(ca-chmin);\\n }\\n }\\n \\n if(a[t]>0){\\n at+=a[t];\\n ans+=a[t];\\n ans+=(a[t]*nums);\\n a[t]=0;\\n }\\n return make_tuple(at,a[t],nums+1);\\n}\\n\\n\\nint main() {\\n\\n int n;\\n cin >> n;\\n int u,v;\\n for(int i=0;i<n-1;i++){\\n cin >> u >> v;\\n u--;v--;\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n for(int i=0;i<n;i++) cin >> a[i];\\n for(int i=0;i<n;i++){\\n cin >> u;\\n a[i]-=u;\\n }\\n\\n auto [at,ca,num]=dfs(0,-1);\\n cout << ans << endl;\\n //cout << at << \\\" \\\" << ca << \\\" \\\" << num << endl;\\n}\",\n \"accuracy\": 0.08695652173913043,\n \"time_ms\": 30,\n \"memory_kb\": 7728,\n \"score_of_the_acc\": -0.0714,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3142_4885527\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)\\n#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)\\n#define REP(i, n) rep(i, 0, n)\\n#define REP2(i, n) rep2(i, 0, n)\\n#define all(hoge) (hoge).begin(), (hoge).end()\\n#define en '\\\\n'\\nusing ll = long long;\\nusing ull = unsigned long long;\\ntemplate <class T>\\nusing vec = vector<T>;\\ntemplate <class T>\\nusing vvec = vector<vec<T>>;\\ntypedef pair<ll, ll> P;\\nusing tp = tuple<ll, ll, ll>;\\nconstexpr long long INF = 1LL << 60;\\nconstexpr int INF_INT = 1 << 25;\\n//constexpr long long MOD = (ll)1e9 + 7;\\nconstexpr long long MOD = 998244353LL;\\nusing ld = long double;\\nstatic const ld pi = 3.141592653589793L;\\ntypedef vector<ll> Array;\\ntypedef vector<Array> Matrix;\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n//グラフ関連\\nstruct Edge {\\n ll to, cap, rev;\\n Edge(ll _to, ll _cap, ll _rev) {\\n to = _to;\\n cap = _cap;\\n rev = _rev;\\n }\\n};\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {\\n G[from].push_back(Edge(to, cap, (ll)G[to].size()));\\n if(revFlag)\\n G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\\n}\\n\\nint sz[101010];\\nint cost[101010];\\nint diff[101010];\\nvoid solve() {\\n ll n;\\n cin >> n;\\n Graph g(n);\\n REP(i, n - 1) {\\n ll u, v;\\n cin >> u >> v;\\n u--;\\n v--;\\n add_edge(g, u, v, 1, true, 1);\\n }\\n\\n vec<ll> a(n), b(n);\\n REP(i, n) {\\n cin >> a[i];\\n }\\n REP(i, n) {\\n cin >> b[i];\\n }\\n\\n auto dfs = [&](auto &&self, int v, int p) -> void {\\n sz[v] = 1;\\n int ma = -INF_INT;\\n for(auto e : g[v]) {\\n if(e.to == p)\\n continue;\\n self(self, e.to, v);\\n sz[v] += sz[e.to];\\n chmax(ma, diff[e.to]);\\n }\\n\\n diff[v] = b[v] - a[v];\\n if(ma != -INF_INT)\\n cost[v] = max(ma, 0);\\n else\\n cost[v] += max(a[v] - b[v], 0LL);\\n\\n for(auto e : g[v]) {\\n if(e.to == p)\\n continue;\\n if(ma >= 0 and diff[e.to] <= ma) {\\n cost[v] += max(0, ma - diff[e.to]) * sz[e.to]; //余計に渡したぶんを回収\\n }\\n diff[v] += diff[e.to]; //不足分を引かれる\\n cost[v] += cost[e.to];\\n }\\n //cout << v << \\\" \\\" << cost[v] << \\\" \\\" << diff[v] << \\\" \\\" << sz[v] << en;\\n };\\n\\n dfs(dfs, 0, -1);\\n cout << cost[0] << en;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout.tie(0);\\n /*\\n ll t;\\n cin >> t;\\n while(t--)*/\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 0.08695652173913043,\n \"time_ms\": 20,\n \"memory_kb\": 10096,\n \"score_of_the_acc\": -0.1332,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3142_4885525\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)\\n#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)\\n#define REP(i, n) rep(i, 0, n)\\n#define REP2(i, n) rep2(i, 0, n)\\n#define all(hoge) (hoge).begin(), (hoge).end()\\n#define en '\\\\n'\\nusing ll = long long;\\nusing ull = unsigned long long;\\ntemplate <class T>\\nusing vec = vector<T>;\\ntemplate <class T>\\nusing vvec = vector<vec<T>>;\\ntypedef pair<ll, ll> P;\\nusing tp = tuple<ll, ll, ll>;\\nconstexpr long long INF = 1LL << 60;\\nconstexpr int INF_INT = 1 << 25;\\n//constexpr long long MOD = (ll)1e9 + 7;\\nconstexpr long long MOD = 998244353LL;\\nusing ld = long double;\\nstatic const ld pi = 3.141592653589793L;\\ntypedef vector<ll> Array;\\ntypedef vector<Array> Matrix;\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n//グラフ関連\\nstruct Edge {\\n ll to, cap, rev;\\n Edge(ll _to, ll _cap, ll _rev) {\\n to = _to;\\n cap = _cap;\\n rev = _rev;\\n }\\n};\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {\\n G[from].push_back(Edge(to, cap, (ll)G[to].size()));\\n if(revFlag)\\n G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\\n}\\n\\nint sz[101010];\\nint cost[101010];\\nint diff[101010];\\nvoid solve() {\\n ll n;\\n cin >> n;\\n Graph g(n);\\n REP(i, n - 1) {\\n ll u, v;\\n cin >> u >> v;\\n u--;\\n v--;\\n add_edge(g, u, v, 1, true, 1);\\n }\\n\\n vec<ll> a(n), b(n);\\n REP(i, n) {\\n cin >> a[i];\\n }\\n REP(i, n) {\\n cin >> b[i];\\n }\\n\\n auto dfs = [&](auto &&self, int v, int p) -> void {\\n sz[v] = 1;\\n int ma = -INF_INT;\\n for(auto e : g[v]) {\\n if(e.to == p)\\n continue;\\n self(self, e.to, v);\\n sz[v] += sz[e.to];\\n chmax(ma, diff[e.to]);\\n }\\n\\n diff[v] = b[v] - a[v];\\n if(ma != -INF_INT)\\n cost[v] = max(ma, 0);\\n else\\n cost[v] += max(a[v] - b[v], 0LL);\\n\\n for(auto e : g[v]) {\\n if(e.to == p)\\n continue;\\n if(diff[e.to] <= ma) {\\n cost[v] += max(0, ma - diff[e.to]) * sz[e.to]; //余計に渡したぶんを回収\\n }\\n diff[v] += diff[e.to]; //不足分を引かれる\\n cost[v] += cost[e.to];\\n }\\n //cout << v << \\\" \\\" << cost[v] << \\\" \\\" << diff[v] << \\\" \\\" << sz[v] << en;\\n };\\n\\n dfs(dfs, 0, -1);\\n cout << cost[0] << en;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout.tie(0);\\n /*\\n ll t;\\n cin >> t;\\n while(t--)*/\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 0.08695652173913043,\n \"time_ms\": 10,\n \"memory_kb\": 10052,\n \"score_of_the_acc\": -0.0957,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3142_4875881\",\n \"code_snippet\": \"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3142\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename F>\\nstruct FixPoint : F{\\n FixPoint(F&& f):F(forward<F>(f)){}\\n template<typename... Args>\\n decltype(auto) operator()(Args&&... args) const{\\n return F::operator()(*this,forward<Args>(args)...);\\n }\\n};\\ntemplate<typename F>\\ninline decltype(auto) MFP(F&& f){\\n return FixPoint<F>{forward<F>(f)};\\n}\\n//END CUT HERE\\n#ifndef call_from_test\\n//INSERT ABOVE HERE\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\nstruct Centroid{\\n vector<int> sz,dead;\\n vector< vector<int> > G;\\n Centroid(){}\\n Centroid(int n):sz(n,1),dead(n,0),G(n){}\\n\\n void add_edge(int u,int v){\\n G[u].emplace_back(v);\\n G[v].emplace_back(u);\\n }\\n\\n int dfs(int v,int p){\\n sz[v]=1;\\n for(int u:G[v])\\n if(u!=p&&!dead[u]) sz[v]+=dfs(u,v);\\n return sz[v];\\n }\\n\\n void find(int v,int p,int tmp,vector<int> &cs) {\\n int ok=1;\\n for (int u:G[v]){\\n if(u==p||dead[u]) continue;\\n find(u,v,tmp,cs);\\n ok&=(sz[u]<=tmp/2);\\n }\\n ok&=(tmp-sz[v]<=tmp/2);\\n if(ok) cs.emplace_back(v);\\n }\\n\\n vector<int> build(int r) {\\n int tmp=dfs(r,-1);\\n vector<int> cs;\\n find(r,-1,tmp,cs);\\n return cs;\\n }\\n\\n const vector<int>& operator[](int k)const{return G[k];}\\n void disable(int v){dead[v]=1;}\\n void enable(int v){dead[v]=0;}\\n int alive(int v){return !dead[v];}\\n};\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#undef call_from_test\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n using ll = long long;\\n\\n int n;\\n cin>>n;\\n Centroid G(n);\\n for(int i=1;i<n;i++){\\n int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.add_edge(u,v);\\n }\\n\\n vector<ll> as(n),bs(n);\\n for(int i=0;i<n;i++) cin>>as[i];\\n for(int i=0;i<n;i++) cin>>bs[i];\\n\\n using P = pair<int, ll>;\\n vector<vector<P>> H(n);\\n MFP([&](auto dfs,int v,int p)->ll{\\n ll res=as[v]-bs[v];\\n for(int u:G[v]){\\n if(u==p) continue;\\n ll tmp=dfs(u,v);\\n H[u].emplace_back(v,-tmp);\\n H[v].emplace_back(u,+tmp);\\n res+=tmp;\\n }\\n return res;\\n })(0,-1);\\n\\n vector<ll> dp(n,0);\\n queue<int> que;\\n que.emplace(G.build(0)[0]);\\n\\n vector<ll> tmp(n);\\n while(!que.empty()){\\n int r=que.front();que.pop();\\n\\n for(int t=0;t<2;t++){\\n ll res=0;\\n for(auto ch:H[r]){\\n int c=ch.first;\\n if(!G.alive(c)) continue;\\n\\n // calc cost\\n MFP([&](auto dfs,int v,int p,ll d)->void{\\n chmin(dp[v],-d+res);\\n for(auto[u,w]:H[v]){\\n if(u==p) continue;\\n if(!G.alive(u)) continue;\\n dfs(u,v,d+w);\\n }\\n })(c,r,ch.second);\\n\\n // update cost\\n MFP([&](auto dfs,int v,int p,ll d)->void{\\n chmin(res,d);\\n for(auto[u,w]:H[v]){\\n if(u==p) continue;\\n if(!G.alive(u)) continue;\\n dfs(u,v,d+w);\\n }\\n })(c,r,ch.second);\\n }\\n chmin(dp[r],res);\\n reverse(H[r].begin(),H[r].end());\\n }\\n\\n G.disable(r);\\n for(int c:G.G[r])\\n if(G.alive(c))\\n que.emplace(G.build(c)[0]);\\n }\\n\\n ll ans=0;\\n for(ll x:dp) ans+=x;\\n cout<<-ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 31264,\n \"score_of_the_acc\": -1.7544,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3142_4875879\",\n \"code_snippet\": \"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3142\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename F>\\nstruct FixPoint : F{\\n FixPoint(F&& f):F(forward<F>(f)){}\\n template<typename... Args>\\n decltype(auto) operator()(Args&&... args) const{\\n return F::operator()(*this,forward<Args>(args)...);\\n }\\n};\\ntemplate<typename F>\\ninline decltype(auto) MFP(F&& f){\\n return FixPoint<F>{forward<F>(f)};\\n}\\n//END CUT HERE\\n#ifndef call_from_test\\n//INSERT ABOVE HERE\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\nstruct Centroid{\\n vector<int> sz,dead;\\n vector< vector<int> > G;\\n Centroid(){}\\n Centroid(int n):sz(n,1),dead(n,0),G(n){}\\n\\n void add_edge(int u,int v){\\n G[u].emplace_back(v);\\n G[v].emplace_back(u);\\n }\\n\\n int dfs(int v,int p){\\n sz[v]=1;\\n for(int u:G[v])\\n if(u!=p&&!dead[u]) sz[v]+=dfs(u,v);\\n return sz[v];\\n }\\n\\n void find(int v,int p,int tmp,vector<int> &cs) {\\n int ok=1;\\n for (int u:G[v]){\\n if(u==p||dead[u]) continue;\\n find(u,v,tmp,cs);\\n ok&=(sz[u]<=tmp/2);\\n }\\n ok&=(tmp-sz[v]<=tmp/2);\\n if(ok) cs.emplace_back(v);\\n }\\n\\n vector<int> build(int r) {\\n int tmp=dfs(r,-1);\\n vector<int> cs;\\n find(r,-1,tmp,cs);\\n return cs;\\n }\\n\\n const vector<int>& operator[](int k)const{return G[k];}\\n void disable(int v){dead[v]=1;}\\n void enable(int v){dead[v]=0;}\\n int alive(int v){return !dead[v];}\\n};\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#undef call_from_test\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n using ll = long long;\\n\\n int n;\\n cin>>n;\\n Centroid G(n);\\n for(int i=1;i<n;i++){\\n int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.add_edge(u,v);\\n }\\n\\n vector<ll> as(n),bs(n);\\n for(int i=0;i<n;i++) cin>>as[i];\\n for(int i=0;i<n;i++) cin>>bs[i];\\n\\n using P = pair<int, ll>;\\n vector<vector<P>> H(n);\\n MFP([&](auto dfs,int v,int p)->ll{\\n ll res=as[v]-bs[v];\\n for(int u:G.G[v]){\\n if(u==p) continue;\\n ll tmp=dfs(u,v);\\n H[u].emplace_back(v,-tmp);\\n H[v].emplace_back(u,+tmp);\\n res+=tmp;\\n }\\n return res;\\n })(0,-1);\\n\\n vector<ll> dp(n,0);\\n queue<int> que;\\n que.emplace(G.build(0)[0]);\\n\\n vector<ll> tmp(n);\\n while(!que.empty()){\\n int r=que.front();que.pop();\\n\\n for(int t=0;t<2;t++){\\n ll res=0;\\n for(auto ch:H[r]){\\n int c=ch.first;\\n if(!G.alive(c)) continue;\\n\\n // calc cost\\n MFP([&](auto dfs,int v,int p,ll d)->void{\\n chmin(dp[v],-d+res);\\n for(auto[u,w]:H[v]){\\n if(u==p) continue;\\n if(!G.alive(u)) continue;\\n dfs(u,v,d+w);\\n }\\n })(c,r,ch.second);\\n\\n // update cost\\n MFP([&](auto dfs,int v,int p,ll d)->void{\\n chmin(res,d);\\n for(auto[u,w]:H[v]){\\n if(u==p) continue;\\n if(!G.alive(u)) continue;\\n dfs(u,v,d+w);\\n }\\n })(c,r,ch.second);\\n }\\n chmin(dp[r],res);\\n reverse(H[r].begin(),H[r].end());\\n }\\n\\n G.disable(r);\\n for(int c:G.G[r])\\n if(G.alive(c))\\n que.emplace(G.build(c)[0]);\\n }\\n\\n ll ans=0;\\n for(int x:dp) ans+=x;\\n cout<<-ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.2608695652173913,\n \"time_ms\": 240,\n \"memory_kb\": 26180,\n \"score_of_the_acc\": -1.5809,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3142_4875794\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\n\\ntemplate<typename F>\\nstruct FixPoint : F{\\n FixPoint(F&& f):F(forward<F>(f)){}\\n template<typename... Args>\\n decltype(auto) operator()(Args&&... args) const{\\n return F::operator()(*this,forward<Args>(args)...);\\n }\\n};\\ntemplate<typename F>\\ninline decltype(auto) MFP(F&& f){\\n return FixPoint<F>{forward<F>(f)};\\n}\\n\\n\\nstruct Centroid{\\n vector<Int> sz,dead;\\n vector< vector<Int> > G;\\n Centroid(){}\\n Centroid(Int n):sz(n,1),dead(n,0),G(n){}\\n\\n void add_edge(Int u,Int v){\\n G[u].emplace_back(v);\\n G[v].emplace_back(u);\\n }\\n\\n Int dfs(Int v,Int p){\\n sz[v]=1;\\n for(Int u:G[v])\\n if(u!=p&&!dead[u]) sz[v]+=dfs(u,v);\\n return sz[v];\\n }\\n\\n void find(Int v,Int p,Int tmp,vector<Int> &cs) {\\n Int ok=1;\\n for (Int u:G[v]){\\n if(u==p||dead[u]) continue;\\n find(u,v,tmp,cs);\\n ok&=(sz[u]<=tmp/2);\\n }\\n ok&=(tmp-sz[v]<=tmp/2);\\n if(ok) cs.emplace_back(v);\\n }\\n\\n vector<Int> build(Int r) {\\n Int tmp=dfs(r,-1);\\n vector<Int> cs;\\n find(r,-1,tmp,cs);\\n return cs;\\n }\\n\\n void disable(Int v){dead[v]=1;}\\n void enable(Int v){dead[v]=0;}\\n Int alive(Int v){return !dead[v];}\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n Int n;\\n cin>>n;\\n Centroid G(n);\\n for(Int i=1;i<n;i++){\\n Int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.add_edge(u,v);\\n }\\n\\n vector<Int> as(n),bs(n);\\n for(Int i=0;i<n;i++) cin>>as[i];\\n for(Int i=0;i<n;i++) cin>>bs[i];\\n\\n using P = pair<Int, Int>;\\n vector<vector<P>> H(n);\\n MFP([&](auto dfs,Int v,Int p)->Int{\\n Int res=as[v]-bs[v];\\n for(Int u:G.G[v]){\\n if(u==p) continue;\\n Int tmp=dfs(u,v);\\n //cout<<u+1<<\\\" \\\"<<v+1<<\\\":\\\"<<-tmp<<endl;\\n //cout<<v+1<<\\\" \\\"<<u+1<<\\\":\\\"<<+tmp<<endl;\\n H[u].emplace_back(v,-tmp);\\n H[v].emplace_back(u,+tmp);\\n res+=tmp;\\n }\\n return res;\\n })(0,-1);\\n\\n vector<Int> dp(n,0);\\n queue<Int> que;\\n que.emplace(G.build(0)[0]);\\n\\n vector<Int> tmp(n);\\n while(!que.empty()){\\n Int r=que.front();que.pop();\\n\\n for(Int t=0;t<2;t++){\\n Int res=0;\\n for(auto ch:H[r]){\\n Int c=ch.first;\\n if(!G.alive(c)) continue;\\n\\n // calc cost\\n MFP([&](auto dfs,Int v,Int p,Int d)->void{\\n // cout<<r+1<<\\\":\\\"<<v+1<<\\\" \\\"<<d<<endl;\\n chmin(dp[v],-d+res);\\n for(auto e:H[v]){\\n Int u=e.first,w=e.second;\\n if(u==p) continue;\\n if(!G.alive(u)) continue;\\n dfs(u,v,d+w);\\n }\\n })(c,r,ch.second);\\n\\n // update cost\\n MFP([&](auto dfs,Int v,Int p,Int d)->void{\\n chmin(res,d);\\n for(auto e:H[v]){\\n Int u=e.first,w=e.second;\\n if(u==p) continue;\\n if(!G.alive(u)) continue;\\n dfs(u,v,d+w);\\n }\\n })(c,r,ch.second);\\n }\\n chmin(dp[r],res);\\n reverse(H[r].begin(),H[r].end());\\n }\\n\\n G.disable(r);\\n for(Int c:G.G[r])\\n if(G.alive(c))\\n que.emplace(G.build(c)[0]);\\n }\\n // for(Int x:dp) cout<<x<<endl;\\n\\n Int ans=0;\\n for(Int x:dp) ans+=x;\\n cout<<-ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 32024,\n \"score_of_the_acc\": -2,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3142_4746489\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 100005\\n\\n\\nll V;\\nvector<int> G[SIZE];\\nll A[SIZE],B[SIZE],diff[SIZE];\\nll COUNT[SIZE];\\n\\nvoid dfs(int node_id,int pre){\\n\\n\\tdiff[node_id] = A[node_id]-B[node_id];\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs(child,node_id);\\n\\t\\tdiff[node_id] += diff[child];\\n\\t}\\n}\\n\\nvoid dfs2(int node_id,int pre){\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\n\\t\\tif(child == pre){\\n\\t\\t\\tCOUNT[node_id] = COUNT[pre]+diff[node_id];\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs2(child,node_id);\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%lld\\\",&V);\\n\\n\\tint from,to;\\n\\tfor(ll i = 0; i < V-1; i++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\tfor(ll i = 0; i < V; i++){\\n\\n\\t\\tscanf(\\\"%lld\\\",&A[i]);\\n\\t}\\n\\tfor(ll i = 0; i < V; i++){\\n\\n\\t\\tscanf(\\\"%lld\\\",&B[i]);\\n\\t}\\n\\n\\tdfs(0,-1);\\n\\n\\tCOUNT[0] = 0;\\n\\tdfs2(0,-1);\\n\\n\\tll ans = 0;\\n\\tll minimum = HUGE_NUM;\\n\\n\\tfor(int i = 0; i < V; i++){\\n\\n\\t\\tans += COUNT[i];\\n\\t\\tminimum = min(minimum,COUNT[i]);\\n\\t}\\n\\n\\tans -= V*minimum;\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 17664,\n \"score_of_the_acc\": -0.5518,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3142_4746370\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 100005\\n\\n\\nint V;\\nll ans;\\nvector<int> G[SIZE];\\nll A[SIZE],B[SIZE],diff[SIZE];\\n\\nvoid dfs(int node_id,int pre){\\n\\n\\tll sum = 0;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs(child,node_id);\\n\\t\\tsum += diff[child];\\n\\t}\\n\\n\\tll tmp = A[node_id]+sum-B[node_id];\\n\\tans += abs(tmp);\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&V);\\n\\n\\tint from,to;\\n\\tfor(int i = 0; i < V-1; i++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\tfor(int i = 0; i < V; i++){\\n\\n\\t\\tscanf(\\\"%lld\\\",&A[i]);\\n\\t}\\n\\tfor(int i = 0; i < V; i++){\\n\\n\\t\\tscanf(\\\"%lld\\\",&B[i]);\\n\\t}\\n\\n\\tans = 0;\\n\\n\\tdfs(0,-1);\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans/2);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.08695652173913043,\n \"time_ms\": 20,\n \"memory_kb\": 8520,\n \"score_of_the_acc\": -0.0683,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3142_4746359\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 100005\\n\\n\\nint V;\\nint ans;\\nvector<int> G[SIZE];\\nint A[SIZE],B[SIZE],diff[SIZE];\\n\\nvoid dfs(int node_id,int pre){\\n\\n\\tint sum = 0;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs(child,node_id);\\n\\t\\tsum += diff[child];\\n\\t}\\n\\n\\tint tmp = A[node_id]+sum-B[node_id];\\n\\tans += abs(tmp);\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&V);\\n\\n\\tint from,to;\\n\\tfor(int i = 0; i < V-1; i++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\tfor(int i = 0; i < V; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&A[i]);\\n\\t}\\n\\tfor(int i = 0; i < V; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&B[i]);\\n\\t}\\n\\n\\tans = 0;\\n\\n\\tdfs(0,-1);\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans/2);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.08695652173913043,\n \"time_ms\": 20,\n \"memory_kb\": 8048,\n \"score_of_the_acc\": -0.0489,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3142_4356978\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,a,n) for (int i=a;i<n;i++)\\n#define per(i,a,n) for (int i=n-1;i>=a;i--)\\n#define pb push_back\\n#define mp make_pair\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define SZ(x) ((int)(x).size())\\ntypedef vector<int> VI;\\ntypedef long long ll;\\ntypedef pair<int,int> PII;\\ntypedef double db;\\nmt19937 mrand(random_device{}()); \\nconst ll mod=998244353;\\nint rnd(int x) { return mrand() % x;}\\nll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\\nll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}\\n// head\\n\\nconst int N=201000;\\nint n,a[N],b[N],u,v;\\nVI e[N];\\nll ret[N];\\n\\nvoid dfs(int u,int f) {\\n\\tfor (auto v:e[u]) {\\n\\t\\tif (v==f) continue;\\n\\t\\tdfs(v,u);\\n\\t\\ta[u]+=a[v];\\n\\t\\tb[u]+=b[v];\\n\\t}\\n}\\n\\nvoid dfs2(int u,int f) {\\n\\tfor (auto v:e[u]) {\\n\\t\\tif (v==f) continue;\\n\\t\\tret[v]=ret[u]+a[v]-b[v];\\n\\t\\tdfs2(v,u);\\n\\t}\\n}\\n\\nint main() {\\n\\tscanf(\\\"%d\\\",&n);\\n\\trep(i,1,n) {\\n\\t\\tscanf(\\\"%d%d\\\",&u,&v);\\n\\t\\te[u].pb(v);\\n\\t\\te[v].pb(u);\\n\\t}\\n\\trep(i,1,n+1) scanf(\\\"%d\\\",a+i);\\n\\trep(i,1,n+1) scanf(\\\"%d\\\",b+i);\\n\\tdfs(1,0);\\n\\tdfs2(1,0);\\n\\tll x=*min_element(ret+1,ret+n+1);\\n\\tll ans=0;\\n\\trep(i,1,n+1) ans+=ret[i]-x;\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 18448,\n \"score_of_the_acc\": -0.5841,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3142_4285704\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#ifndef ONLINE_JUDGE\\n#define dbg(x...) do { cout << \\\"\\\\033[32;1m \\\" << #x << \\\" -> \\\"; err(x); } while (0)\\nvoid err() { cout << \\\"\\\\033[39;0m\\\" << endl; }\\ntemplate<template<typename...> class T, typename t, typename... A>\\nvoid err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }\\ntemplate<typename T, typename... A>\\nvoid err(T a, A... x) { cout << a << ' '; err(x...); }\\n#else\\n#define dbg(...)\\n#endif\\ntypedef long long ll;\\ntypedef pair<int,int> pi;\\ntypedef vector<int> vi;\\ntemplate<class T> using vc=vector<T>;\\ntemplate<class T> using vvc=vc<vc<T>>;\\ntemplate<class T> void mkuni(vector<T>&v)\\n{\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\nll rand_int(ll l, ll r) //[l, r]\\n{\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n return uniform_int_distribution<ll>(l, r)(gen);\\n}\\ntemplate<class T>\\nvoid print(T x,int suc=1)\\n{\\n cout<<x;\\n if(suc==1) cout<<'\\\\n';\\n else cout<<' ';\\n}\\ntemplate<class T>\\nvoid print(const vector<T>&v,int suc=1)\\n{\\n for(int i=0;i<v.size();i++)\\n print(v[i],i==(int)(v.size())-1?suc:2);\\n}\\nconst int maxn=1e5+7;\\nvi G[maxn];\\nint a[maxn],b[maxn];\\nint sum[maxn];\\nll ans=0;\\nvoid dfs(int u,int fa=-1)\\n{\\n sum[u]=b[u]-a[u];\\n for(auto v:G[u])if(v!=fa)\\n {\\n dfs(v,u);\\n sum[u]+=sum[v];\\n }\\n}\\nll k[maxn];\\nvoid dfs2(int u,int fa=-1,ll cur=0)\\n{\\n k[u]=cur;\\n ans=min(ans,k[u]);\\n for(auto v:G[u])if(v!=fa)\\n dfs2(v,u,cur-sum[v]);\\n}\\nint main()\\n{\\n int n;\\n cin>>n;\\n for(int i=1,u,v;i<n;i++)\\n {\\n cin>>u>>v;\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n for(int i=0;i<n;i++) cin>>a[i+1];\\n for(int i=0;i<n;i++) cin>>b[i+1];\\n dfs(1);\\n dfs2(1);\\n //dbg(ans);\\n ll op=0;\\n for(int i=1;i<=n;i++)\\n {\\n //dbg(k[i]);\\n op+=k[i];\\n }\\n op+=-n*ans;\\n print(op);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 16268,\n \"score_of_the_acc\": -0.6729,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3142_4285700\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#ifndef ONLINE_JUDGE\\n#define dbg(x...) do { cout << \\\"\\\\033[32;1m \\\" << #x << \\\" -> \\\"; err(x); } while (0)\\nvoid err() { cout << \\\"\\\\033[39;0m\\\" << endl; }\\ntemplate<template<typename...> class T, typename t, typename... A>\\nvoid err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }\\ntemplate<typename T, typename... A>\\nvoid err(T a, A... x) { cout << a << ' '; err(x...); }\\n#else\\n#define dbg(...)\\n#endif\\ntypedef long long ll;\\ntypedef pair<int,int> pi;\\ntypedef vector<int> vi;\\ntemplate<class T> using vc=vector<T>;\\ntemplate<class T> using vvc=vc<vc<T>>;\\ntemplate<class T> void mkuni(vector<T>&v)\\n{\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\nll rand_int(ll l, ll r) //[l, r]\\n{\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n return uniform_int_distribution<ll>(l, r)(gen);\\n}\\ntemplate<class T>\\nvoid print(T x,int suc=1)\\n{\\n cout<<x;\\n if(suc==1) cout<<'\\\\n';\\n else cout<<' ';\\n}\\ntemplate<class T>\\nvoid print(const vector<T>&v,int suc=1)\\n{\\n for(int i=0;i<v.size();i++)\\n print(v[i],i==(int)(v.size())-1?suc:2);\\n}\\nconst int maxn=1e5+7;\\nvi G[maxn];\\nint a[maxn],b[maxn];\\nint sum[maxn];\\nint ans=0x3f3f3f3f;\\nvoid dfs(int u,int fa=-1)\\n{\\n sum[u]=b[u]-a[u];\\n for(auto v:G[u])if(v!=fa)\\n {\\n dfs(v,u);\\n sum[u]+=sum[v];\\n }\\n}\\nint k[maxn];\\nvoid dfs2(int u,int fa=-1,int cur=0)\\n{\\n k[u]=cur;\\n ans=min(ans,k[u]);\\n for(auto v:G[u])if(v!=fa)\\n dfs2(v,u,cur-sum[v]);\\n}\\nint main()\\n{\\n int n;\\n cin>>n;\\n for(int i=1,u,v;i<n;i++)\\n {\\n cin>>u>>v;\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n for(int i=0;i<n;i++) cin>>a[i+1];\\n for(int i=0;i<n;i++) cin>>b[i+1];\\n dfs(1);\\n dfs2(1);\\n //dbg(ans);\\n int op=0;\\n for(int i=1;i<=n;i++)\\n {\\n //dbg(k[i]);\\n op+=k[i];\\n }\\n op+=-n*ans;\\n print(op);\\n}\",\n \"accuracy\": 0.08695652173913043,\n \"time_ms\": 50,\n \"memory_kb\": 8324,\n \"score_of_the_acc\": -0.1674,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3142_4284031\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <iomanip>\\n#include <set>\\n#include <tuple>\\n#define mkp make_pair\\n#define mkt make_tuple\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD=1e9+7;\\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\\n\\nvector<vector<int>> g;\\nvector<ll> A,B;\\n\\nll ans;\\nvector<int> size;\\nvector<ll> dp;\\n\\nvoid sizedfs(int now,int par){\\n size[now]=1;\\n for(auto nex:g[now]) if(nex!=par){\\n sizedfs(nex,now);\\n size[now]+=size[nex];\\n }\\n}\\n\\nvoid dfs(int now,int par){\\n ll ma=0;\\n for(auto nex:g[now]) if(nex!=par){\\n dfs(nex,now);\\n chmax(ma,-dp[nex]);\\n }\\n ans+=ma;\\n dp[now]-=g[now].size()*ma;\\n if(par!=-1) dp[par]+=ma;\\n for(auto nex:g[now]) if(nex!=par){\\n dp[nex]+=ma;\\n ans+=dp[nex]*size[nex];\\n dp[now]+=dp[nex];\\n dp[nex]=0;\\n }\\n\\n if(dp[now]>0){\\n ans+=dp[now]*size[now];\\n if(par!=-1) dp[par]+=dp[now];\\n dp[now]=0;\\n }\\n}\\n\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int N;\\n cin>>N;\\n g.resize(N);\\n rep(i,N-1){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n A.resize(N);\\n rep(i,N) cin>>A[i];\\n B.resize(N);\\n rep(i,N) cin>>B[i];\\n\\n int root=0;\\n rep(i,N) if(g[i].size()==1) root=i;\\n size.resize(N);\\n sizedfs(root,-1);\\n\\n dp.resize(N);\\n rep(i,N) dp[i]=A[i]-B[i];\\n dfs(root,-1);\\n\\n cout<<ans<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 18912,\n \"score_of_the_acc\": -0.6032,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3142_4282266\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// created [2020/03/20] 14:42:56\\n#pragma GCC diagnostic ignored \\\"-Wsign-compare\\\"\\n#pragma GCC diagnostic ignored \\\"-Wsign-conversion\\\"\\n\\nusing i32 = int32_t;\\nusing i64 = int64_t;\\nusing u32 = uint32_t;\\nusing u64 = uint64_t;\\nusing uint = unsigned int;\\nusing usize = std::size_t;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\ntemplate<typename T, usize n>\\nusing arr = T (&)[n];\\ntemplate<typename T, usize n>\\nusing c_arr = const T (&)[n];\\ntemplate<typename T>\\nusing max_heap = std::priority_queue<T>;\\ntemplate<typename T>\\nusing min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }\\ntemplate<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }\\ntemplate<typename T> constexpr T msbp1(const T u) { return log2p1(u); }\\ntemplate<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }\\ntemplate<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }\\ntemplate<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }\\ntemplate<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }\\ntemplate<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }\\ntemplate<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }\\ntemplate<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }\\ntemplate<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }\\ntemplate<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }\\ntemplate<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }\\ntemplate<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }\\ntemplate<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }\\ntemplate<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }\\nconstexpr unsigned int mod = 1000000007;\\ntemplate<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;\\ntemplate<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};\\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\\n\\ntemplate<typename T>\\nT in()\\n{\\n T v;\\n return std::cin >> v, v;\\n}\\ntemplate<typename T, typename Uint, usize n, usize i>\\nT in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }\\ntemplate<typename T, typename Uint, usize n, usize i>\\nauto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)\\n{\\n const usize s = (usize)szs[i];\\n std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);\\n for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }\\n return ans;\\n}\\ntemplate<typename T, typename Uint, usize n>\\nauto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }\\ntemplate<typename... Types>\\nauto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }\\nstruct io_init\\n{\\n io_init()\\n {\\n std::cin.tie(nullptr), std::ios::sync_with_stdio(false);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n void clear()\\n {\\n std::cin.tie(), std::ios::sync_with_stdio(true);\\n }\\n} io_setting;\\n\\nint out() { return 0; }\\ntemplate<typename T>\\nint out(const T& v) { return std::cout << v, 0; }\\ntemplate<typename T>\\nint out(const std::vector<T>& v)\\n{\\n for (usize i = 0; i < v.size(); i++) {\\n if (i > 0) { std::cout << ' '; }\\n out(v[i]);\\n }\\n return 0;\\n}\\ntemplate<typename T1, typename T2>\\nint out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }\\ntemplate<typename T, typename... Args>\\nint out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }\\ntemplate<typename... Args>\\nint outln(const Args... args) { return out(args...), std::cout << '\\\\n', 0; }\\ntemplate<typename... Args>\\nint outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\\n# define SHOW(...) static_cast<void>(0)\\nconstexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }\\n\\ntemplate<typename T, typename Uint, usize n, usize i>\\nauto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }\\ntemplate<typename T, typename Uint, usize n, usize i>\\nauto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})\\n{\\n const usize s = (usize)szs[i];\\n return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));\\n}\\ntemplate<typename T, typename Uint, usize n>\\nauto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }\\n\\ntemplate<typename Cost = usize>\\nstruct edge\\n{\\n using cost_type = Cost;\\n usize u, v;\\n Cost c;\\n edge(const usize u, const usize v) : u{u}, v{v}, c{1} {}\\n edge(const usize u, const usize v, const Cost& c) : u{u}, v{v}, c{c} {}\\n operator usize() const { return v; }\\n usize from() const { return u; }\\n usize to() const { return v; }\\n Cost cost() const { return c; }\\n friend std::ostream& operator<<(std::ostream& os, const edge& e) { return os << e.u << \\\"->\\\" << e.v << \\\":\\\" << e.c; }\\n};\\ntemplate<typename Edge>\\nclass base_graph\\n{\\npublic:\\n base_graph(const usize n) : v{n}, es(n), res(n) {}\\n void add_edge(const usize u, const usize v, const bool bi = false)\\n {\\n es[u].emplace_back(u, v), res[v].emplace_back(v, u);\\n if (bi) { es[v].emplace_back(v, u), res[u].emplace_back(u, v); }\\n }\\n template<typename Cost>\\n void add_edge(const usize u, const usize v, const Cost& c, const bool bi = false)\\n {\\n es[u].emplace_back(u, v, c), res[v].emplace_back(v, u, c);\\n if (bi) { es[v].emplace_back(v, u, c), res[u].emplace_back(u, v, c); }\\n }\\n std::vector<Edge>& operator[](const usize u) { return es[u]; }\\n const std::vector<Edge>& operator[](const usize u) const { return es[u]; }\\n std::vector<Edge>& from(const usize u) { return es[u]; }\\n const std::vector<Edge>& from(const usize u) const { return es[u]; }\\n std::vector<Edge>& to(const usize v) { return res[v]; }\\n const std::vector<Edge>& to(const usize v) const { return res[v]; }\\n usize size() const { return v; }\\n friend std::ostream& operator<<(std::ostream& os, const base_graph& g)\\n {\\n for (usize i = 0; i < g.v; i++) {\\n for (const auto& e : g.es[i]) { os << e << '\\\\n'; }\\n }\\n return os;\\n }\\n\\nprivate:\\n usize v;\\n std::vector<std::vector<Edge>> es, res;\\n};\\ntemplate<typename Edge>\\nusing base_tree = base_graph<Edge>;\\nusing graph = base_graph<edge<>>;\\nusing tree = base_graph<edge<>>;\\ntemplate<typename Cost>\\nusing cost_graph = base_graph<edge<Cost>>;\\ntemplate<typename Cost>\\nusing cost_tree = base_graph<edge<Cost>>;\\nint main()\\n{\\n auto N = in<int>();\\n graph g(N);\\n for (int i = 0; i < N - 1; i++) {\\n const auto u = in<int>() - 1, v = in<int>() - 1;\\n g.add_edge(u, v, true);\\n }\\n const auto as = in_v<ll>({N});\\n const auto bs = in_v<ll>({N});\\n std::vector<ll> cs(N);\\n for (int i = 0; i < N; i++) { cs[i] = bs[i] - as[i]; }\\n using pll = std::pair<ll, ll>;\\n std::vector<ll> push(N); // push[i]=b ：頂点iをした回数はx+b\\n std::vector<ll> need(N); // need[i]=b ：頂点par[i]を押す回数はx+b\\n std::vector<pll> total(N); // total[i]=<a,b>：頂点i以下を押した回数はax+b\\n mfp([&](auto&& self, const int s, const int p) -> void {\\n ll max = 0;\\n for (const int to : g[s]) {\\n if (to == p) { continue; }\\n self(self, to, s);\\n chmax(max, need[to]);\\n }\\n push[s] = max;\\n need[s] = cs[s] + push[s] * g[s].size();\\n ll ta = 1, tb = push[s];\\n for (const int to : g[s]) {\\n if (to == p) { continue; }\\n const ll alpha = max - need[to];\\n need[s] -= push[to] + alpha;\\n ta += total[to].first, tb += total[to].second + total[to].first * alpha;\\n }\\n total[s] = {ta, tb};\\n })(0, -1);\\n outln(total[0].second);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 30720,\n \"score_of_the_acc\": -1.1963,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3142_4282259\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// created [2020/03/20] 14:42:56\\n#pragma GCC diagnostic ignored \\\"-Wsign-compare\\\"\\n#pragma GCC diagnostic ignored \\\"-Wsign-conversion\\\"\\n\\nusing i32 = int32_t;\\nusing i64 = int64_t;\\nusing u32 = uint32_t;\\nusing u64 = uint64_t;\\nusing uint = unsigned int;\\nusing usize = std::size_t;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\ntemplate<typename T, usize n>\\nusing arr = T (&)[n];\\ntemplate<typename T, usize n>\\nusing c_arr = const T (&)[n];\\ntemplate<typename T>\\nusing max_heap = std::priority_queue<T>;\\ntemplate<typename T>\\nusing min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }\\ntemplate<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }\\ntemplate<typename T> constexpr T msbp1(const T u) { return log2p1(u); }\\ntemplate<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }\\ntemplate<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }\\ntemplate<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }\\ntemplate<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }\\ntemplate<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }\\ntemplate<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }\\ntemplate<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }\\ntemplate<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }\\ntemplate<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }\\ntemplate<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }\\ntemplate<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }\\ntemplate<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }\\ntemplate<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }\\nconstexpr unsigned int mod = 1000000007;\\ntemplate<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;\\ntemplate<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};\\nauto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };\\n\\ntemplate<typename T>\\nT in()\\n{\\n T v;\\n return std::cin >> v, v;\\n}\\ntemplate<typename T, typename Uint, usize n, usize i>\\nT in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }\\ntemplate<typename T, typename Uint, usize n, usize i>\\nauto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)\\n{\\n const usize s = (usize)szs[i];\\n std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);\\n for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }\\n return ans;\\n}\\ntemplate<typename T, typename Uint, usize n>\\nauto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }\\ntemplate<typename... Types>\\nauto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }\\nstruct io_init\\n{\\n io_init()\\n {\\n std::cin.tie(nullptr), std::ios::sync_with_stdio(false);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n void clear()\\n {\\n std::cin.tie(), std::ios::sync_with_stdio(true);\\n }\\n} io_setting;\\n\\nint out() { return 0; }\\ntemplate<typename T>\\nint out(const T& v) { return std::cout << v, 0; }\\ntemplate<typename T>\\nint out(const std::vector<T>& v)\\n{\\n for (usize i = 0; i < v.size(); i++) {\\n if (i > 0) { std::cout << ' '; }\\n out(v[i]);\\n }\\n return 0;\\n}\\ntemplate<typename T1, typename T2>\\nint out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }\\ntemplate<typename T, typename... Args>\\nint out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }\\ntemplate<typename... Args>\\nint outln(const Args... args) { return out(args...), std::cout << '\\\\n', 0; }\\ntemplate<typename... Args>\\nint outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }\\n# define SHOW(...) static_cast<void>(0)\\nconstexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }\\n\\ntemplate<typename T, typename Uint, usize n, usize i>\\nauto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }\\ntemplate<typename T, typename Uint, usize n, usize i>\\nauto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})\\n{\\n const usize s = (usize)szs[i];\\n return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));\\n}\\ntemplate<typename T, typename Uint, usize n>\\nauto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }\\n\\ntemplate<typename Cost = usize>\\nstruct edge\\n{\\n using cost_type = Cost;\\n usize u, v;\\n Cost c;\\n edge(const usize u, const usize v) : u{u}, v{v}, c{1} {}\\n edge(const usize u, const usize v, const Cost& c) : u{u}, v{v}, c{c} {}\\n operator usize() const { return v; }\\n usize from() const { return u; }\\n usize to() const { return v; }\\n Cost cost() const { return c; }\\n friend std::ostream& operator<<(std::ostream& os, const edge& e) { return os << e.u << \\\"->\\\" << e.v << \\\":\\\" << e.c; }\\n};\\ntemplate<typename Edge>\\nclass base_graph\\n{\\npublic:\\n base_graph(const usize n) : v{n}, es(n), res(n) {}\\n void add_edge(const usize u, const usize v, const bool bi = false)\\n {\\n es[u].emplace_back(u, v), res[v].emplace_back(v, u);\\n if (bi) { es[v].emplace_back(v, u), res[u].emplace_back(u, v); }\\n }\\n template<typename Cost>\\n void add_edge(const usize u, const usize v, const Cost& c, const bool bi = false)\\n {\\n es[u].emplace_back(u, v, c), res[v].emplace_back(v, u, c);\\n if (bi) { es[v].emplace_back(v, u, c), res[u].emplace_back(u, v, c); }\\n }\\n std::vector<Edge>& operator[](const usize u) { return es[u]; }\\n const std::vector<Edge>& operator[](const usize u) const { return es[u]; }\\n std::vector<Edge>& from(const usize u) { return es[u]; }\\n const std::vector<Edge>& from(const usize u) const { return es[u]; }\\n std::vector<Edge>& to(const usize v) { return res[v]; }\\n const std::vector<Edge>& to(const usize v) const { return res[v]; }\\n usize size() const { return v; }\\n friend std::ostream& operator<<(std::ostream& os, const base_graph& g)\\n {\\n for (usize i = 0; i < g.v; i++) {\\n for (const auto& e : g.es[i]) { os << e << '\\\\n'; }\\n }\\n return os;\\n }\\n\\nprivate:\\n usize v;\\n std::vector<std::vector<Edge>> es, res;\\n};\\ntemplate<typename Edge>\\nusing base_tree = base_graph<Edge>;\\nusing graph = base_graph<edge<>>;\\nusing tree = base_graph<edge<>>;\\ntemplate<typename Cost>\\nusing cost_graph = base_graph<edge<Cost>>;\\ntemplate<typename Cost>\\nusing cost_tree = base_graph<edge<Cost>>;\\nint main()\\n{\\n auto N = in<int>();\\n graph g(N);\\n for (int i = 0; i < N - 1; i++) {\\n const auto u = in<int>() - 1, v = in<int>() - 1;\\n g.add_edge(u, v, true);\\n }\\n const auto as = in_v<ll>({N});\\n const auto bs = in_v<ll>({N});\\n std::vector<ll> cs(N);\\n for (int i = 0; i < N; i++) { cs[i] = bs[i] - as[i]; }\\n using pll = std::pair<ll, ll>;\\n std::vector<ll> push(N); // push[i]=b ：頂点iをした回数はx+b\\n std::vector<ll> need(N); // need[i]=b ：頂点par[i]を押す回数はx+b\\n std::vector<pll> total(N); // total[i]=<a,b>：頂点i以下を押した回数はax+b\\n SHOW(cs);\\n mfp([&](auto&& self, const int s, const int p) -> void {\\n ll max = 0;\\n for (const int to : g[s]) {\\n if (to == p) { continue; }\\n self(self, to, s);\\n chmax(max, need[to]);\\n }\\n push[s] = max;\\n need[s] = cs[s] + push[s] * g[s].size();\\n ll ta = 1, tb = push[s];\\n for (const int to : g[s]) {\\n if (to == p) { continue; }\\n const ll alpha = max - need[to];\\n need[s] -= push[to] + alpha;\\n push[s] += push[to] + alpha;\\n ta += total[to].first, tb += total[to].second + total[to].first * alpha;\\n }\\n total[s] = {ta, tb};\\n })(0, -1);\\n outln(total[0].second);\\n return 0;\\n}\",\n \"accuracy\": 0.08695652173913043,\n \"time_ms\": 30,\n \"memory_kb\": 16664,\n \"score_of_the_acc\": -0.4392,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3142_4281488\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <numeric>\\n#include <algorithm>\\n#include <deque>\\n#include <vector>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <iomanip>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <functional>\\n#include <climits>\\n#include <bitset>\\n#include <random>\\n#include <tuple>\\n#include <initializer_list>\\n#include <fstream>\\n\\nstruct SubTree {\\n\\tlong long int min_step, back_for_minstep, need_to_push;\\n\\tlong long int push_back_multiplier, sum_initial, sum_target;\\n};\\nint main() {\\n\\tint n; std::cin >> n;\\n\\tstd::vector<std::vector<int>> nodes(n);\\n\\tfor (auto i = 1; i < n; ++i) {\\n\\t\\tint u, v; std::cin >> u >> v;\\n\\t\\tnodes[--u].push_back(--v);\\n\\t\\tnodes[v].push_back(u);\\n\\t}\\n\\tstd::vector<int> initial_size(n), target_size(n);\\n\\tfor (auto& a : initial_size) std::cin >> a;\\n\\tfor (auto& b : target_size) std::cin >> b;\\n\\tstd::vector<int> depth(n, -1), parent(n, -1), child_count(n, 0); depth[0] = 0;\\n\\tstd::stack<int> stack; stack.push(0);\\n\\twhile (!stack.empty()) {\\n\\t\\tconst auto top = stack.top(); stack.pop();\\n\\t\\tfor (const auto next : nodes[top]) if (depth[next] == -1) {\\n\\t\\t\\tdepth[next] = depth[top] + 1;\\n\\t\\t\\tparent[next] = top;\\n\\t\\t\\tstack.push(next);\\n\\t\\t\\t++child_count[top];\\n\\t\\t}\\n\\t}\\n\\tstd::vector<SubTree> sub_trees(n);\\n\\tfor (auto i = 0; i < n; ++i) if (child_count[i] == 0) {\\n\\t\\tstack.push(i);\\n\\t}\\n\\twhile (!stack.empty()) {\\n\\t\\tconst auto top = stack.top(); stack.pop();\\n\\t\\tlong long int sum_min_step{ 0 }, sum_back{ 0 }, sum_multiplier{ 0 }, max_need{ 0 }, sum_need{ 0 }, sum_initial_size{ initial_size[top] }, sum_target_size{ target_size[top] };\\n\\t\\tfor (const auto next: nodes[top]) if (depth[next] > depth[top]) {\\n\\t\\t\\tsum_min_step += sub_trees[next].min_step;\\n\\t\\t\\tsum_back += sub_trees[next].back_for_minstep;\\n\\t\\t\\tsum_multiplier += sub_trees[next].push_back_multiplier;\\n\\t\\t\\tmax_need = std::max(max_need, sub_trees[next].need_to_push);\\n\\t\\t\\tsum_need += sub_trees[next].need_to_push;\\n\\t\\t\\tsum_initial_size += sub_trees[next].sum_initial;\\n\\t\\t\\tsum_target_size += sub_trees[next].sum_target;\\n\\t\\t}\\n\\t\\tconst auto need_to_push{ std::max(max_need, sum_initial_size - sum_target_size) };\\n\\t\\tsum_min_step += need_to_push;\\n\\t\\tfor (const auto next : nodes[top]) if (depth[next] > depth[top]) {\\n\\t\\t\\tsum_min_step += (need_to_push - sub_trees[next].need_to_push) * sub_trees[next].push_back_multiplier;\\n\\t\\t}\\n\\t\\tsub_trees[top] = SubTree{ sum_min_step, need_to_push, std::max(sum_target_size - sum_initial_size + need_to_push, 0LL),\\n\\t\\t\\tsum_multiplier + 1, sum_initial_size, sum_target_size };\\n\\t\\tif (parent[top] != -1 && --child_count[parent[top]] == 0) {\\n\\t\\t\\tstack.push(parent[top]);\\n\\t\\t}\\n\\t}\\n\\tstd::cout << sub_trees[0].min_step << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 15744,\n \"score_of_the_acc\": -0.6514,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3142_4281158\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing i64 = long long;\\n#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)\\n#define all(x) x.begin(),x.end()\\n\\ntemplate<class T>\\nstatic inline std::vector<T> ndvec(size_t&& n, T val) noexcept {\\n return std::vector<T>(n, std::forward<T>(val));\\n}\\n\\ntemplate<class... Tail>\\nstatic inline auto ndvec(size_t&& n, Tail&&... tail) noexcept {\\n return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));\\n}\\n\\ntemplate<class T, class Cond>\\nstruct chain {\\n Cond cond; chain(Cond cond) : cond(cond) {}\\n bool operator()(T& a, const T& b) const {\\n if(cond(a, b)) { a = b; return true; }\\n return false;\\n }\\n};\\ntemplate<class T, class Cond>\\nchain<T, Cond> make_chain(Cond cond) { return chain<T, Cond>(cond); }\\n\\ni64 N;\\nvector<vector<i64>> G;\\n\\nvector<i64> A, B;\\nvector<i64> D;\\n\\nvoid dfs(i64 v, i64 f) {\\n for(auto t: G[v]) {\\n if(t == f) continue;\\n dfs(t, v);\\n D[v] += D[t];\\n }\\n}\\n\\nvector<i64> X;\\n\\nvoid dfs2(i64 v, i64 f) {\\n for(auto t: G[v]) {\\n if(t == f) continue;\\n X[t] = X[v] - D[t];\\n dfs2(t, v);\\n }\\n}\\n\\nint main() {\\n cin >> N;\\n G.resize(N);\\n rep(i,0,N - 1) {\\n i64 a, b;\\n cin >> a >> b;\\n a--;\\n b--;\\n G[a].push_back(b);\\n G[b].push_back(a);\\n }\\n\\n A.resize(N);\\n B.resize(N);\\n D.resize(N);\\n rep(i,0,N) {\\n cin >> A[i];\\n }\\n rep(i,0,N) {\\n cin >> B[i];\\n }\\n rep(i,0,N) {\\n D[i] = B[i] - A[i];\\n }\\n\\n dfs(0, -1);\\n X.resize(N);\\n dfs2(0, -1);\\n\\n i64 MIN = *min_element(all(X));\\n i64 ans = 0;\\n rep(i,0,N) {\\n ans += X[i] - MIN;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 17304,\n \"score_of_the_acc\": -0.7156,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1966,"cells":{"group_id":{"kind":"string","value":"aoj_3150_cpp"},"problem_description":{"kind":"string","value":"N: 3人協力ゲーム\nリアクティブ問題です。\n問題文\n$1000$ ビットの非負整数が $200$ 個あり、$a_1, \\ldots, a_{100}, b_1, \\ldots, b_{100}$ とします。\nアリスは $a_1, \\ldots, a_{100}$ を確認し、$3000$ ビットのメモ $X$ をチャーリーのために残します。\nボブは $b_1, \\ldots, b_{100}$ を確認し、$3000$ ビットのメモ $Y$ をチャーリーのために残します。\nチャーリーはメモ $X, Y$ の情報をもとに、$100$ 個の質問に答えます。\n$i$ 番目の質問は $1000$ ビットの非負整数 $c_i$ で表され、チャーリーは $a_{x_i}$ と $b_{y_i}$ のビットごとの排他的論理和が $c_i$ に等しくなるような $x_i, y_i$ を答えます。\n$100$ 個の質問のうち、$95$ 個以上の質問に正答できる戦略を考えてください。\n制約\n$a_1, \\ldots, a_{100}, b_1, \\ldots, b_{100}, c_1, \\ldots, c_{100}$ は $2$ 進数表記で与えられ、\n0\n，\n1\nからなる長さ $1000$ の文字列である。\n$a_1, \\ldots, a_{100}$ は互いに異なる。\n$b_1, \\ldots, b_{100}$ は互いに異なる。\n$c_1, \\ldots, c_{100}$ は互いに異なる。\n$i = 1, 2, \\ldots, 100$ について、$a_j$ と $b_k$ のビットごとの排他的論理和が $c_i$ になるような $j, k$ が存在する。\n入出力とジャッジ\nあなたのプログラムは $1$ つのテストケースに対して $3$ 回実行される。\n$1$ 回目の実行では次の入力形式でアリスへの情報が与えられる。\nAlice\n$a_1$\n$a_2$\n$\\vdots$\n$a_{100}$\n$1$ 行目に必ず\nAlice\nの文字列が与えられる。\nこの場合、入力を全て受け取った後\n0\n，\n1\nからなる長さ $3000$ の文字列 $X$ を出力し、プログラムを即座に終了させなければならない。\n$2$ 回目の実行では次の入力形式でボブへの情報が与えられる。\nBob\n$b_1$\n$b_2$\n$\\vdots$\n$b_{100}$\n$1$ 行目に必ず\nBob\nの文字列が与えられる。\nこの場合、入力を全て受け取った後\n0\n，\n1\nからなる長さ $3000$ の文字列 $Y$ を出力し、プログラムを即座に終了させなければならない。\n$3$ 回目の実行では次の入力形式でチャーリーへの質問およびメモの情報が与えられる。\nCharlie\n$X$\n$Y$\n$c_1$\n$c_2$\n$\\vdots$\n$c_{100}$\n$1$ 行目に必ず\nCharlie\nの文字列が与えられる。\n入力を全て受け取った後 $1$ 以上 $100$ 以下の整数 $x_1, x_2, \\ldots, x_{100}$ と $1$ 以上 $100$ 以下の整数 $y_1, y_2, \\ldots, y_{100}$ を以下の形式で出力し、プログラムを即座に終了させなければならない。\n$x_1$ $y_1$\n$x_2$ $y_2$\n$\\vdots$\n$x_{100}$ $y_{100}$\nジャッジは、$i = 1, 2, \\ldots, 100$ について $a_{x_i}$ と $b_{y_i}$ のビットごとの排他的論理和が $c_i$ に一致するか調べ、一致数が $95$ 個以上であれば正答、そうでなければ誤答と判定する。\n不正な値や不正な形式での出力があった場合にも誤答とする。\n注意\n出力の度に標準出力を flush せよ。そうしない場合、TLE となる可能性がある。\nどの種類の入力の末尾にも EOF が与えられる。\nプロセスは、上記によって規定された以外のいかなる通信も行ってはならない。\n入出力例1\n以下はビット数や非負整数の数、質問の数が異なるが、$a = (000, 011), b = (110, 111), c = (101, 100)$ としたときの対話例である。\n解答プログラムの出力\n解答プログラムへの入力\n説明\n解答プログラム（アリス）が実行される\nAlice\n$000$\n$011$\nアリスは $a = (000, 011)$ の情報を得る\n$0000110\\ldots 0$\nアリスはメモ $X = 0000110\\ldots 0$ を残す\n解答プログラム（アリス）の実行が終了し、新たな解答プログラム（ボブ）が実行される\nBob\n$110$\n$111$\nボブは $b = (110, 111)$ の情報を得る\n$1101110\\ldots 0$\nボブはメモ $Y = 1101110\\ldots 0$ を残す\n解答プログラム（ボブ）の実行が終了し、新たな解答プログラム（チャーリー）が実行される\nCharlie\n$0000110\\ldots 0$\n$1101110\\ldots 0$\n$101$\n$100$\nチャーリーは $X, Y$ の情報を得たあと、質問の情報 $c = (101, 100)$ を得る\n$2$ $1$\n$2$ $2$\nチャーリーは $1$ つ目の質問に対して $(x_1, y_1) = (2, 1)$、$2$ つ目の質問に対して $(x_2, y_2) = (2, 2)$ と回答する"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3150_10466106","code_snippet":"/*\n * _|_|_|_|_| _|_|_|_| _|_|_| _|_|_|_|_| _|_|_| _|_|\n * _| _| _| _| _| _| _|\n * _| _|_|_| _|_| _| _|_| _|\n * _| _| _| _| _| _|\n * _|_|_|_|_| _| _|_|_| _| _|_|_| _|_|_|_|\n */\n\n#include <bits/stdc++.h>\n\nconstexpr int L = 30;\n\nstd::string Encode(std::string S) {\n std::mt19937 engine(114514);\n std::reverse(S.begin(), S.end());\n std::string res(L, '0');\n int val = 0;\n for (int i = 0; i < (int) S.length(); i++) {\n int w = std::uniform_int_distribution<>(0, (1 << L) - 1)(engine);\n if (S[i] == '1') { val ^= w; }\n }\n for (int i = 0; i < L; i++) { res[i] = '0' + (val >> i & 1); }\n return res;\n}\n\nstd::string operator^(const std::string &A, const std::string &B) {\n assert(A.size() == B.size());\n std::string S(A.size(), '0');\n for (int i = 0; i < (int) A.size(); i++) {\n if (A[i] != B[i]) { S[i] = '1'; }\n }\n return S;\n}\n\nstd::string Alice(std::vector<std::string> A) {\n std::string ret;\n for (const auto &v: A) { ret += Encode(v); }\n return ret;\n}\n\nstd::string Bob(std::vector<std::string> B) {\n std::string ret;\n for (const auto &v: B) { ret += Encode(v); }\n return ret;\n}\n\nstd::vector<std::pair<int, int>> Catherine(std::string a, std::string b,\n std::vector<std::string> C) {\n int N = (int) a.length() / L;\n std::map<std::string, int> sA, sB;\n std::vector<std::string> A(N), B(N);\n for (int i = 0; i < N; i++) {\n A[i] = a.substr(i * L, L);\n B[i] = b.substr(i * L, L);\n sA[A[i]] = 1, sB[B[i]] = 1;\n }\n\n std::mt19937 engine(133446);\n std::vector<std::pair<int, int>> ans;\n for (const auto &v: C) {\n auto S = Encode(v);\n std::vector<std::pair<int, int>> tmp;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if ((A[i] ^ B[j]) == S) { tmp.emplace_back(i, j); }\n }\n }\n assert(!tmp.empty());\n int p = std::uniform_int_distribution<>(0, (int) tmp.size() - 1)(engine);\n ans.emplace_back(tmp[p]);\n }\n\n return ans;\n}\n\nint main() {\n std::string type;\n std::cin >> type;\n if (type == \"Alice\" || type == \"Bob\") {\n std::vector<std::string> A(100);\n for (auto &v: A) { std::cin >> v; }\n std::cout << Alice(A) << '\\n';\n } else {\n std::string a, b;\n std::vector<std::string> C(100);\n std::cin >> a >> b;\n for (auto &v: C) { std::cin >> v; }\n auto ans = Catherine(a, b, C);\n for (auto v: ans) {\n std::cout << v.first + 1 << ' ' << v.second + 1 << '\\n';\n }\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":4352,"score_of_the_acc":-2,"final_rank":7},{"submission_id":"aoj_3150_10466088","code_snippet":"/*\n * _|_|_|_|_| _|_|_|_| _|_|_| _|_|_|_|_| _|_|_| _|_|\n * _| _| _| _| _| _| _|\n * _| _|_|_| _|_| _| _|_| _|\n * _| _| _| _| _| _|\n * _|_|_|_|_| _| _|_|_| _| _|_|_| _|_|_|_|\n */\n\n#include <bits/stdc++.h>\n\nconstexpr int L = 30;\n\nstd::string Encode(std::string S) {\n constexpr int pMod = 998244853;\n std::reverse(S.begin(), S.end());\n std::string res(L, '0');\n int val = 0;\n for (int i = 0, pw = 1; i < (int) S.length(); i++, pw = pw * 2 % pMod) {\n if (S[i] == '1') { val ^= pw; }\n }\n for (int i = 0; i < L; i++) { res[i] = '0' + (val >> i & 1); }\n return res;\n}\n\nstd::string operator^(const std::string &A, const std::string &B) {\n assert(A.size() == B.size());\n std::string S(A.size(), '0');\n for (int i = 0; i < (int) A.size(); i++) {\n if (A[i] != B[i]) { S[i] = '1'; }\n }\n return S;\n}\n\nstd::string Alice(std::vector<std::string> A) {\n std::string ret;\n for (const auto &v: A) { ret += Encode(v); }\n return ret;\n}\n\nstd::string Bob(std::vector<std::string> B) {\n std::string ret;\n for (const auto &v: B) { ret += Encode(v); }\n return ret;\n}\n\nstd::vector<std::pair<int, int>> Catherine(std::string a, std::string b,\n std::vector<std::string> C) {\n int N = (int) a.length() / L;\n std::map<std::string, int> sA, sB;\n std::vector<std::string> A(N), B(N);\n for (int i = 0; i < N; i++) {\n A[i] = a.substr(i * L, L);\n B[i] = b.substr(i * L, L);\n sA[A[i]] = 1, sB[B[i]] = 1;\n }\n\n std::mt19937 engine(133447);\n std::vector<std::pair<int, int>> ans;\n for (const auto &v: C) {\n auto S = Encode(v);\n std::vector<std::pair<int, int>> tmp;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if ((A[i] ^ B[j]) == S) { tmp.emplace_back(i, j); }\n }\n }\n assert(!tmp.empty());\n int p = std::uniform_int_distribution<>(0, (int) tmp.size() - 1)(engine);\n ans.emplace_back(tmp[p]);\n }\n\n return ans;\n}\n\nint main() {\n std::string type;\n std::cin >> type;\n if (type == \"Alice\" || type == \"Bob\") {\n std::vector<std::string> A(100);\n for (auto &v: A) { std::cin >> v; }\n std::cout << Alice(A) << '\\n';\n } else {\n std::string a, b;\n std::vector<std::string> C(100);\n std::cin >> a >> b;\n for (auto &v: C) { std::cin >> v; }\n auto ans = Catherine(a, b, C);\n for (auto v: ans) {\n std::cout << v.first + 1 << ' ' << v.second + 1 << '\\n';\n }\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":4352,"score_of_the_acc":-2,"final_rank":7},{"submission_id":"aoj_3150_10466059","code_snippet":"/*\n * _|_|_|_|_| _|_|_|_| _|_|_| _|_|_|_|_| _|_|_| _|_|\n * _| _| _| _| _| _| _|\n * _| _|_|_| _|_| _| _|_| _|\n * _| _| _| _| _| _|\n * _|_|_|_|_| _| _|_|_| _| _|_|_| _|_|_|_|\n */\n\n#include <bits/stdc++.h>\n\nconstexpr int L = 30;\n\nstd::string Encode(std::string S) {\n std::mt19937 engine(114515);\n std::reverse(S.begin(), S.end());\n std::string res(L, '0');\n for (int i = 0; i < (int) S.length(); i++) {\n int p = i < L ? i : std::uniform_int_distribution<>(0, L - 1)(engine);\n if (S[i] == '1') { res[p] ^= 1; }\n }\n return res;\n}\n\nstd::string operator^(const std::string &A, const std::string &B) {\n assert(A.size() == B.size());\n std::string S(A.size(), '0');\n for (int i = 0; i < (int) A.size(); i++) {\n if (A[i] != B[i]) { S[i] = '1'; }\n }\n return S;\n}\n\nstd::string Alice(std::vector<std::string> A) {\n std::string ret;\n for (const auto &v: A) { ret += Encode(v); }\n return ret;\n}\n\nstd::string Bob(std::vector<std::string> B) {\n std::string ret;\n for (const auto &v: B) { ret += Encode(v); }\n return ret;\n}\n\nstd::vector<std::pair<int, int>> Catherine(std::string a, std::string b,\n std::vector<std::string> C) {\n int N = (int) a.length() / L;\n std::map<std::string, int> sA, sB;\n std::vector<std::string> A(N), B(N);\n for (int i = 0; i < N; i++) {\n A[i] = a.substr(i * L, L);\n B[i] = b.substr(i * L, L);\n sA[A[i]] = 1, sB[B[i]] = 1;\n }\n\n std::mt19937 engine(133448);\n std::vector<std::pair<int, int>> ans;\n for (const auto &v: C) {\n auto S = Encode(v);\n std::vector<std::pair<int, int>> tmp;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if ((A[i] ^ B[j]) == S) { tmp.emplace_back(i, j); }\n }\n }\n assert(!tmp.empty());\n int p = std::uniform_int_distribution<>(0, (int) tmp.size() - 1)(engine);\n ans.emplace_back(tmp[p]);\n }\n\n return ans;\n}\n\nint main() {\n std::string type;\n std::cin >> type;\n if (type == \"Alice\" || type == \"Bob\") {\n std::vector<std::string> A(100);\n for (auto &v: A) { std::cin >> v; }\n std::cout << Alice(A) << '\\n';\n } else {\n std::string a, b;\n std::vector<std::string> C(100);\n std::cin >> a >> b;\n for (auto &v: C) { std::cin >> v; }\n auto ans = Catherine(a, b, C);\n for (auto v: ans) {\n std::cout << v.first + 1 << ' ' << v.second + 1 << '\\n';\n }\n }\n return 0;\n}","accuracy":0.3939393939393939,"time_ms":140,"memory_kb":4352,"score_of_the_acc":-2,"final_rank":18},{"submission_id":"aoj_3150_10466058","code_snippet":"/*\n * _|_|_|_|_| _|_|_|_| _|_|_| _|_|_|_|_| _|_|_| _|_|\n * _| _| _| _| _| _| _|\n * _| _|_|_| _|_| _| _|_| _|\n * _| _| _| _| _| _|\n * _|_|_|_|_| _| _|_|_| _| _|_|_| _|_|_|_|\n */\n\n#include <bits/stdc++.h>\n\nconstexpr int L = 30;\n\nstd::string Encode(std::string S) {\n std::mt19937 engine(114515);\n std::reverse(S.begin(), S.end());\n std::string res(L, '0');\n for (int i = 0; i < (int) S.length(); i++) {\n int p = i < L ? i : std::uniform_int_distribution<>(0, L - 1)(engine);\n if (S[i] == '1') { res[p] ^= 1; }\n }\n return res;\n}\n\nstd::string operator^(const std::string &A, const std::string &B) {\n assert(A.size() == B.size());\n std::string S(A.size(), '0');\n for (int i = 0; i < (int) A.size(); i++) {\n if (A[i] != B[i]) { S[i] = '1'; }\n }\n return S;\n}\n\nstd::string Alice(std::vector<std::string> A) {\n std::string ret;\n for (const auto &v: A) { ret += Encode(v); }\n return ret;\n}\n\nstd::string Bob(std::vector<std::string> B) {\n std::string ret;\n for (const auto &v: B) { ret += Encode(v); }\n return ret;\n}\n\nstd::vector<std::pair<int, int>> Catherine(std::string a, std::string b,\n std::vector<std::string> C) {\n int N = (int) a.length() / L;\n std::map<std::string, int> sA, sB;\n std::vector<std::string> A(N), B(N);\n for (int i = 0; i < N; i++) {\n A[i] = a.substr(i * L, L);\n B[i] = b.substr(i * L, L);\n sA[A[i]] = 1, sB[B[i]] = 1;\n }\n\n std::mt19937 engine(133447);\n std::vector<std::pair<int, int>> ans;\n for (const auto &v: C) {\n auto S = Encode(v);\n std::vector<std::pair<int, int>> tmp;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if ((A[i] ^ B[j]) == S) { tmp.emplace_back(i, j); }\n }\n }\n assert(!tmp.empty());\n int p = std::uniform_int_distribution<>(0, (int) tmp.size() - 1)(engine);\n ans.emplace_back(tmp[p]);\n }\n\n return ans;\n}\n\nint main() {\n std::string type;\n std::cin >> type;\n if (type == \"Alice\" || type == \"Bob\") {\n std::vector<std::string> A(100);\n for (auto &v: A) { std::cin >> v; }\n std::cout << Alice(A) << '\\n';\n } else {\n std::string a, b;\n std::vector<std::string> C(100);\n std::cin >> a >> b;\n for (auto &v: C) { std::cin >> v; }\n auto ans = Catherine(a, b, C);\n for (auto v: ans) {\n std::cout << v.first + 1 << ' ' << v.second + 1 << '\\n';\n }\n }\n return 0;\n}","accuracy":0.3939393939393939,"time_ms":140,"memory_kb":4352,"score_of_the_acc":-2,"final_rank":18},{"submission_id":"aoj_3150_4356971","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,n) for (int i=a;i<n;i++)\n#define per(i,a,n) for (int i=n-1;i>=a;i--)\n#define pb push_back\n#define mp make_pair\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define SZ(x) ((int)(x).size())\ntypedef vector<int> VI;\ntypedef long long ll;\ntypedef pair<int,int> PII;\ntypedef double db;\nmt19937 mrand(1); \nconst ll mod=998244353;\nint rnd(int x) { return mrand() % x;}\nll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\nll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}\n// head\n\nconst int N=1010;\nint n,p[N];\nint f[50][1010];\nchar s[3010];\nstring info;\n\nint a[110],b[110];\n\nvoid gao(int *a) {\n\trep(j,0,100) {\n\t\tint x=0;\n\t\trep(c,0,30) x|=(s[j*30+c]-'0')<<c;\n\t\ta[j]=x;\n\t}\n}\n\nint main() {\n\tscanf(\"%s\",s);\n\trep(c,0,30) rep(j,0,1000) f[c][j]=rnd(2);\n\tif (s[0]=='A'||s[0]=='B') {\n\t\trep(i,0,100) {\n\t\t\tscanf(\"%s\",s);\n\t\t\trep(j,0,1000) p[j]=s[j]-'0';\n\t\t\trep(c,0,30) {\n\t\t\t\tint x=0;\n\t\t\t\trep(j,0,1000) if (f[c][j]) x^=p[j];\n\t\t\t\tinfo.pb('0'+x);\n\t\t\t}\n\t\t}\n\t\tprintf(\"%s\\n\",info.c_str());\n\t\tfflush(stdout);\n\t} else {\n\t\tscanf(\"%s\",s);\n\t\tgao(a);\n\t\tscanf(\"%s\",s);\n\t\tgao(b);\n\t\trep(i,0,100) {\n\t\t\tscanf(\"%s\",s);\n\t\t\tint msk=0;\n\t\t\trep(j,0,1000) p[j]=s[j]-'0';\n\t\t\trep(c,0,30) {\n\t\t\t\tint x=0;\n\t\t\t\trep(j,0,1000) if (f[c][j]) x^=p[j];\n\t\t\t\tmsk|=x<<c;\n\t\t\t}\n\t\t\trep(x,0,100) rep(y,0,100) if ((a[x]^b[y])==msk) {\n\t\t\t\tprintf(\"%d %d\\n\",x+1,y+1);\n\t\t\t\tgoto end;\n\t\t\t}\n\t\t\tend:;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":3728,"score_of_the_acc":-0.2308,"final_rank":6},{"submission_id":"aoj_3150_4280407","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)\n#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)\n#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)\n#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)\n\nstruct XorShift128 {\n using u32 = uint32_t;\n u32 x = 123456789, y = 362436069, z = 521288629, w = 88675123;\n XorShift128 (u32 seed = 0) { z ^= seed; }\n u32 operator()() {\n u32 t = x ^ (x << 11);\n x = y; y = z; z = w;\n return w = (w ^ ( w >> 19)) ^ (t ^ (t >> 8));\n }\n};\n\nstring ll_to_string(ll num, ll digit = 30){\n string s(digit, '0');\n rrep(i, digit){\n if(num % 2)s[i] = '1';\n num /= 2;\n }\n return s;\n}\nll string_to_ll(string s, ll digit = 30){\n ll num = 0;\n rep(i, digit){\n num *= 2;\n if(s[i] == '1')num += 1;\n }\n return num;\n}\n\nll rnd[100];\n\nvoid Alice(){\n rep(i, 100){\n string s(1000, '0');\n cin >> s;\n cout << ll_to_string(string_to_ll(s.substr(0, 30)) ^ rnd[i]);\n }\n cout << flush;\n}\n\nvoid Charlie(){\n ll A[100] = {}, B[100] = {};\n string s;\n cin >> s;\n for(ll i = 0; i < 3000; i += 30){\n A[i / 30] = (string_to_ll(s.substr(i, i + 30)) ^ rnd[i / 30]);\n }\n cin >> s;\n for(ll i = 0; i < 3000; i += 30){\n B[i / 30] = (string_to_ll(s.substr(i, i + 30)) ^ rnd[i / 30]);\n }\n rep(i, 100){\n string s;\n cin >> s;\n ll c = string_to_ll(s.substr(0, 30));\n ll X = 0, Y = 0;\n rep(x, 100)rep(y, 100)if((A[x] ^ B[y]) == c){\n X = x;\n Y = y;\n }\n cout << X + 1 << \" \" << Y + 1 << endl;\n }\n cout << flush;\n}\n\nint main(){\n \n XorShift128 xs;\n rep(i, 100)rnd[i] = (xs() & ((1 << 30) - 1));\n\n string s;\n cin >> s;\n if(s == \"Charlie\")Charlie();\n else Alice();\n\n return 0;\n}","accuracy":0.3939393939393939,"time_ms":20,"memory_kb":3752,"score_of_the_acc":-0.1154,"final_rank":10},{"submission_id":"aoj_3150_4280399","code_snippet":"#include <bits/stdc++.h>\n#include <sys/types.h>\n#include <unistd.h>\n\n#define _overload(_1,_2,_3,name,...) name\n#define _rep(i,n) _range(i,0,n)\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\n\n#define _rrep(i,n) _rrange(i,n,0)\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\n\n#define _all(arg) begin(arg),end(arg)\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\n#define clr(a,b) memset((a),(b),sizeof(a))\n#define bit(n) (1LL<<(n))\n#define popcount(n) (__builtin_popcountll(n))\n\nusing namespace std;\n\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\n\nusing ll=long long;\nusing R=long double;\nconst R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\ninline int sgn(const R& r){return(r > EPS)-(r < -EPS);}\ninline R sq(R x){return sqrt(max(x,0.0L));}\n\ntemplate<typename T> vector<T> make_vector(size_t sz){\n\treturn vector<T>(sz);\n}\n\ntemplate<typename T,typename... Ts> \nauto make_vector(size_t sz, Ts... ts){\n\treturn vector<decltype(make_vector<T>(ts...))>(sz, make_vector<T>(ts...));\n}\n\ntemplate<typename T,typename U,typename... V> \ntypename enable_if<is_same<T, U>::value!=0>::type \nfill_value(U &u, const V... v){\n\tu=U(v...);\n}\n\ntemplate<typename T,typename U,typename... V>\ntypename enable_if<is_same<T, U>::value==0>::type\nfill_value(U &u, const V... v){\n\tfor(auto &e:u){\n\t\tfill_value<T>(e,v...);\n\t}\n}\n\n\nmt19937 engine(0);\nuniform_int_distribution<> dist(0, 1); \n\n\nconst int len = 1000;\nconst int hash_len = 30;\nusing BO = bitset<len>;\nusing BH = bitset<hash_len>;\n\nvector<BO> base_vec;\n\nvoid init(int m){\n\trep(i, m) {\n\t\tBO tmp;\n\t\trep(j, len) tmp[j] = dist(engine);\n\t\tbase_vec.push_back(tmp);\n\t}\n}\n\n\nBH get_hash(BO bst) {\n\tBH ret;\n\trep(i, hash_len) {\n\t\tBO tmp = bst & base_vec[i]; \n\t\tret[i] = tmp.count() & 1;\n\t}\n\treturn ret;\n}\n\n\n\nvoid alice_bob_process(int n) {\n\tinit(hash_len);\n\n\tstring ret = \"\";\n\n\trep(i, n){\n\t\tstring tmp;\n\t\tcin >> tmp;\n\t\tBO bit_orignal = BO(tmp);\n\t\tBH bit_hash = get_hash(bit_orignal);\n\t\tret += bit_hash.to_string();\n\t}\n\n\tcout << ret << endl << flush;\n}\n\nvoid charlie_process(int n) {\n\tinit(hash_len);\n\tstring x, y;\n\tcin >> x >> y;\n\n\tvector<BH> xary, yary;\n\trep(i, n) {\n\t\txary.push_back(BH(x.substr(hash_len * i, hash_len)));\n\t\tyary.push_back(BH(y.substr(hash_len * i, hash_len)));\t\t\n\t}\n\n\trep(i, n) {\n\t\tstring c;\n\t\tcin >> c;\n\t\tBO bit_orignal = BO(c);\n\t\tBH bit_hash = get_hash(bit_orignal);\n\n\t\trep(j, n) rep(k, n) {\n\t\t\tBH tmp = xary[j] ^ yary[k];\n\t\t\tif(tmp == bit_hash) {\n\t\t\t\tcout << j + 1 << \" \" << k + 1 << endl;\n\t\t\t\tj = n, k = n;\n\t\t\t}\n\t\t}\n\t}\n\n\tcout << flush;\n}\n\nint main(void){\n\tstring who;\n\tcin >> who;\n\tif(who == \"Alice\" or who == \"Bob\") {\n\t\talice_bob_process(100);\n\t} else {\n\t\tcharlie_process(100);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3752,"score_of_the_acc":-0.1154,"final_rank":5},{"submission_id":"aoj_3150_4280393","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)\n#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)\n#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)\n#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)\n\nstruct XorShift128 {\n using u32 = uint32_t;\n u32 x = 123456789, y = 362436069, z = 521288629, w = 88675123;\n XorShift128 (u32 seed = 0) { z ^= seed; }\n u32 operator()() {\n u32 t = x ^ (x << 11);\n x = y; y = z; z = w;\n return w = (w ^ ( w >> 19)) ^ (t ^ (t >> 8));\n }\n};\n\nstring ll_to_string(ll num, ll digit = 30){\n string s(digit, '0');\n rrep(i, digit){\n if(num % 2)s[i] = '1';\n num /= 2;\n }\n return s;\n}\nll string_to_ll(string s, ll digit = 30){\n ll num = 0;\n rep(i, digit){\n num *= 2;\n if(s[i] == '1')num += 1;\n }\n return num;\n}\n\nll rnd[100];\n\nvoid Alice(){\n rep(i, 100){\n string s(1000, '0');\n cin >> s;\n cout << ll_to_string(string_to_ll(s.substr(0, 30)) ^ rnd[i]);\n }\n cout << flush;\n}\n\nvoid Charlie(){\n ll A[100] = {}, B[100] = {};\n string s;\n cin >> s;\n for(ll i = 0; i < 3000; i += 30){\n A[i / 30] = string_to_ll(s.substr(i, i + 30));\n }\n cin >> s;\n for(ll i = 0; i < 3000; i += 30){\n B[i / 30] = string_to_ll(s.substr(i, i + 30));\n }\n rep(i, 100){\n string s;\n cin >> s;\n ll c = string_to_ll(s.substr(0, 30));\n ll X = 0, Y = 0;\n rep(x, 100)rep(y, 100)if((A[x] ^ B[y]) == c){\n X = x;\n Y = y;\n }\n cout << X + 1 << \" \" << Y + 1 << endl;\n }\n cout << flush;\n}\n\nint main(){\n \n XorShift128 xs;\n // rep(i, 100)rnd[i] = (xs() & ((1 << 30) - 1));\n\n string s;\n cin >> s;\n if(s == \"Charlie\")Charlie();\n else Alice();\n\n return 0;\n}","accuracy":0.3939393939393939,"time_ms":20,"memory_kb":3752,"score_of_the_acc":-0.1154,"final_rank":10},{"submission_id":"aoj_3150_4280348","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> V;\n#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)\nstruct XorShift128 {\n using u32 = uint32_t;\n u32 x = 123456789, y = 362436069, z = 521288629, w = 88675123;\n XorShift128 (u32 seed = 0) { z ^= seed; }\n u32 operator()() {\n u32 t = x ^ (x << 11);\n x = y; y = z; z = w;\n return w = (w ^ ( w >> 19)) ^ (t ^ (t >> 8));\n }\n};\n\nll mp[100][30];\n\nvoid Alice(){\n rep(i, 100){\n string s(1000, '0');\n cin >> s;\n rep(j, 30)cout << (ll)(mp[i][j] ^ (s[j] - '0'));\n }\n cout << flush;\n}\nvoid Charlie(){\n ll A[100] = {}, B[100] = {};\n rep(i, 100){\n rep(j, 30){\n char c = '0';\n cin >> c;\n if(c == '1')A[i] |= (1 << j);\n }\n }\n rep(i, 100){\n rep(j, 30){\n char c;\n cin >> c;\n if(c == '1')B[i] |= (1 << j);\n }\n }\n rep(i, 100){\n string s;\n cin >> s;\n ll c = 0;\n rep(j, 30)if(s[j] == '1')c |= (1 << j);\n ll X = 0, Y = 0;\n rep(x, 100)rep(y, 100)if((A[x] ^ B[y]) == c){\n X = x;\n Y = y;\n }\n cout << X + 1 << \" \" << Y + 1 << endl;\n }\n cout << flush;\n}\n\nint main(){\n XorShift128 xs;\n // rep(i, 100)rep(j, 30)mp[i][j] = xs() % 2;\n string s;\n cin >> s;\n if(s == \"Charlie\")Charlie();\n else Alice();\n\n return 0;\n}","accuracy":0.3939393939393939,"time_ms":20,"memory_kb":3752,"score_of_the_acc":-0.1154,"final_rank":10},{"submission_id":"aoj_3150_4279824","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T>\nbool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T>\nbool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>\nvoid ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T>\nvoid debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)\n{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)\n{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\ntemplate<typename T>\nvoid debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];\nfor(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\ntemplate<typename T>\nvector<vector<T>>vec(ll x, ll y, T w){\n vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,0,-1,0,1,1,-1,-1};\nvector<ll>dy={0,1,0,-1,1,-1,1,-1};\ntemplate<typename T>\nvector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>\nauto make_v(size_t a,Ts... ts){\n return vector<decltype(make_v(ts...))>(a,make_v(ts...));\n}\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &os, pair<T1, T2>&p){\n return os << p.first << \" \" << p.second;\n} \n\nstring convert(ll n,ll bit){\n string ret(bit,'0');\n for(ll i=0;i<bit;i++)if(n&1LL<<bit-1-i)ret[i]='1';\n return ret;\n}\nll convert(string s){\n ll ret=0;\n ll n=s.size();\n for(ll i=0;i<n;i++)if(s[i]=='1')ret|=1<<n-i-1;\n return ret;\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n vector<ll>hash;\n const ll mod=998244353;\n ll k=100000;\n //const ll num=2,len=3;\n const ll num=100,len=1000;\n vector<ll>v(len,k);\n rep(i,0,len-1)v[i+1]=v[i]*k%mod;\n string s;cin>>s;\n if(s==\"Alice\"||s==\"Bob\"){\n vector<string>a(num);\n rep(i,0,num)cin>>a[i];\n vector<ll>h(num);\n string ret;\n rep(i,0,num){\n rep(j,0,len)if(a[i][j]=='1')h[i]^=v[j];\n ret+=convert(h[i],30);\n }\n cout<<ret<<endl;\n }\n else{\n string s,t;cin>>s>>t;\n vector<ll>a(num),b(num);\n rep(i,0,num)a[i]=convert(s.substr(i*30,30));\n rep(i,0,num)b[i]=convert(t.substr(i*30,30));\n rep(i,0,num){\n string input;cin>>input;\n ll c=0;\n rep(j,0,len)if(input[j]=='1')c^=v[j];\n rep(j,0,num){\n bool sw=false;\n rep(o,0,num){\n if((a[j]^b[o]^c)==0){\n cout<<j+1 spa o+1<<endl;\n sw=true;\n break;\n }\n }\n if(sw)break;\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3752,"score_of_the_acc":-0.0385,"final_rank":3},{"submission_id":"aoj_3150_4279742","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T>\nbool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T>\nbool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>\nvoid ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T>\nvoid debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)\n{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)\n{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\ntemplate<typename T>\nvoid debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];\nfor(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\ntemplate<typename T>\nvector<vector<T>>vec(ll x, ll y, T w){\n vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,0,-1,0,1,1,-1,-1};\nvector<ll>dy={0,1,0,-1,1,-1,1,-1};\ntemplate<typename T>\nvector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>\nauto make_v(size_t a,Ts... ts){\n return vector<decltype(make_v(ts...))>(a,make_v(ts...));\n}\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &os, pair<T1, T2>&p){\n return os << p.first << \" \" << p.second;\n} \nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n vector<ll>hash;\n const ll mod=998244353;\n ll k=100000;\n const ll num=100,len=1000;\n //const ll num=100,len=1000;\n vector<ll>v(len,k);\n rep(i,0,len-1)v[i+1]=v[i]*k%mod;\n string s;cin>>s;\n if(s==\"Alice\"||s==\"Bob\"){\n vector<string>a(num);\n rep(i,0,num)cin>>a[i];\n vector<ll>h(num);\n string ret;\n rep(i,0,num){\n rep(j,0,len)if(a[i][j]=='1')h[i]^=v[j];\n string s(30,'0');\n rep(j,0,30){\n s[j]=(h[i]&1)+'0';\n h[i]>>=1;\n }\n ret+=s;\n }\n cout<<ret<<endl;\n }\n else{\n string s,t;cin>>s>>t;\n vector<ll>a(num),b(num);\n rep(i,0,num){\n bitset<30>k;\n rep(j,0,30)if(s[i*30+j]=='1')k[j]=1;\n a[i]=k.to_ullong();\n }\n rep(i,0,num){\n bitset<30>k;\n rep(j,0,30)if(t[i*30+j]=='1')k[j]=1;\n b[i]=k.to_ullong();\n }\n //cout<<s spa t<<endl;\n //debug(a,num);debug(b,num);\n rep(i,0,num){\n string input;cin>>input;\n ll c=0;\n rep(j,0,len)if(input[j]=='1')c^=v[j];\n //cout<<c<<endl;\n rep(j,0,num){\n bool sw=false;\n rep(o,0,num){\n if((a[j]^b[o]^c)==0){\n cout<<j+1 spa o+1<<endl;\n sw=true;\n break;\n }\n }\n if(sw)break;\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3740,"score_of_the_acc":-0.0192,"final_rank":2},{"submission_id":"aoj_3150_4279639","code_snippet":"//\n#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> V;\n#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)\n#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)\n\nV prime;\nvoid init(){\n V v;\n for(ll i = 2; i <= 1000; i++){\n ll f = 1;\n for(ll j = 2; j * j <= i; j++)if(i % j == 0)f = 0;\n if(f)v.push_back(i);\n }\n rep(i, 30)prime.push_back(34 * i + 5);\n}\n\nll A[110];\nll B[110];\nvoid Alice(){\n rep1(i, 100){\n string s;\n cin >> s;\n rep(j, 30){\n if(s[prime[j]] == '1')cout << 1;\n else cout << 0;\n } \n }\n cout << flush;\n}\nvoid Bob(){\n rep1(i, 100){\n string s;\n cin >> s;\n rep(j, 30){\n if(s[prime[j]] == '1')cout << 1;\n else cout << 0;\n } \n }\n cout << flush;\n}\n\nvoid solve(ll c, ll &x, ll &y){\n x = 1;\n y = 1;\n rep1(i, 100)rep1(j, 100)if((A[i] ^ B[j]) == c){\n x = i;\n y = j;\n }\n}\n\nvoid Charlie(){\n rep1(i, 100){\n for(ll j = 0, k = 1; j < 30; j++, k += k){\n char c;\n cin >> c;\n if(c == '1')A[i] |= k;\n }\n }\n rep1(i, 100){\n for(ll j = 0, k = 1; j < 30; j++, k += k){\n char c;\n cin >> c;\n if(c == '1')B[i] |= k;\n }\n }\n rep1(i, 100){\n string s;\n cin >> s;\n ll c = 0;\n for(ll j = 0, k = 1; j < 30; j++, k += k){\n if(s[prime[j]] == '1')c |= k;\n }\n ll x, y;\n solve(c, x, y);\n cout << x << \" \" << y << endl;\n }\n cout << flush;\n}\n\nint main(){\n init();\n string s;\n cin >> s;\n if(s == \"Alice\")Alice();\n if(s == \"Bob\")Bob();\n if(s == \"Charlie\")Charlie();\n\n return 0;\n}","accuracy":0.3939393939393939,"time_ms":20,"memory_kb":3752,"score_of_the_acc":-0.1154,"final_rank":10},{"submission_id":"aoj_3150_4279550","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing uint = unsigned int;\nusing pcc = pair<char, char>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<double, double>;\nusing tuplis = array<ll, 3>;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nconst ll LINF=0x1fffffffffffffff;\nconst ll MINF=0x7fffffffffff;\nconst int INF=0x3fffffff;\nconst int MOD=1000000007;\nconst int MODD=998244353;\nconst ld DINF=numeric_limits<ld>::infinity();\nconst ld EPS=1e-9;\nconst ld PI=3.1415926535897932;\nconst ll dx[] = {0, 1, 0, -1, 1, 1, -1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, -1, 1, -1};\n#define overload4(_1,_2,_3,_4,name,...) name\n#define overload3(_1,_2,_3,name,...) name\n#define rep1(n) for(ll i=0;i<n;++i)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(n) for(ll i=(n)-1;i>=0;i--)\n#define rrep2(i,n) for(ll i=(n)-1;i>=0;i--)\n#define rrep3(i,a,b) for(ll i=(b)-1;i>=(a);i--)\n#define rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\n#define each(i,...) for(auto&& i:__VA_ARGS__)\n#define all1(i) begin(i),end(i)\n#define all2(i,a) begin(i),begin(i)+a\n#define all3(i,a,b) begin(i)+a,begin(i)+b\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\n#define rall1(i) (i).rbegin(),(i).rend()\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\n#define elif else if\n#define unless(a) if(!(a))\n#define mp make_pair\n#define mt make_tuple\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define vec(type,name,...) vector<type> name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type> name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\nll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }\nll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }\nvector<pll> factor(ull x){ vector<pll> ans; for(ll i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\nvector<ll> divisor(ull x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\ntemplate<class T> unordered_map<T, ll> press(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); unordered_map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }\ntemplate<class T> map<T, ll> press_map(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }\nint scan(){ return getchar(); }\nvoid scan(int& a){ scanf(\"%d\", &a); }\nvoid scan(unsigned& a){ scanf(\"%u\", &a); }\nvoid scan(long& a){ scanf(\"%ld\", &a); }\nvoid scan(long long& a){ scanf(\"%lld\", &a); }\nvoid scan(unsigned long long& a){ scanf(\"%llu\", &a); }\nvoid scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\\n'); }\nvoid scan(float& a){ scanf(\"%f\", &a); }\nvoid scan(double& a){ scanf(\"%lf\", &a); }\nvoid scan(long double& a){ scanf(\"%Lf\", &a); }\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\nvoid scan(char a[]){ scanf(\"%s\", a); }\nvoid scan(string& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>&);\ntemplate<class T, size_t size> void scan(array<T, size>&);\ntemplate<class T, class L> void scan(pair<T, L>&);\ntemplate<class T, size_t size> void scan(T(&)[size]);\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(T& a){ cin >> a; }\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(unsigned a){ printf(\"%u\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(unsigned long long a){ printf(\"%llu\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(float a){ printf(\"%.15f\", a); }\nvoid print(double a){ printf(\"%.15f\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\ntemplate<class T> void print(const vector<T>&);\ntemplate<class T, size_t size> void print(const array<T, size>&);\ntemplate<class T, class L> void print(const pair<T, L>& p);\ntemplate<class T, size_t size> void print(const T (&)[size]);\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const T& a){ cout << a; }\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\n#ifdef DEBUG\nvoid err(){ putchar('\\n'); }\ntemplate<class T> void err(const T& t){ print(t); putchar('\\n'); }\ntemplate<class Head, class... Tail> void err(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); }\n#else\ntemplate<class... T> void err(const T&...){}\n#endif\nint first(bool i = true){ return out(i?\"first\":\"second\"); }\nint yes(bool i = true){ return out(i?\"yes\":\"no\"); }\nint Yes(bool i = true){ return out(i?\"Yes\":\"No\"); }\nint No(){ return out(\"No\"); }\nint YES(bool i = true){ return out(i?\"YES\":\"NO\"); }\nint NO(){ return out(\"NO\"); }\nint Yay(bool i = true){ return out(i?\"Yay!\":\":(\"); }\nint possible(bool i = true){ return out(i?\"possible\":\"impossible\"); }\nint Possible(bool i = true){ return out(i?\"Possible\":\"Impossible\"); }\nint POSSIBLE(bool i = true){ return out(i?\"POSSIBLE\":\"IMPOSSIBLE\"); }\nvoid Case(ll i){ printf(\"Case #%lld: \", i); }\n\n\nmt19937 RD(58);\nuint32_t xor128() {\n static uint32_t x = RD();\n static uint32_t y = RD();\n static uint32_t z = RD();\n static uint32_t w = RD();\n uint32_t t;\n t = x ^ (x << 11);\n x = y; y = z; z = w;\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n}\nstruct Xorshift64{\n using result_type = uint32_t;\n static constexpr result_type min(){ return 0; }\n static constexpr result_type max(){ return -1; }\n uint64_t x = RD();\n result_type operator()(){\n x = x ^ (x << 13);\n x = x ^ (x >> 7);\n x = x ^ (x << 17);\n return static_cast<uint32_t>(x);\n }\n}rnd;\nsigned main(){\n bitset<1000>bit[30];\n each(i,bit)rep(_,32){\n i<<=32;\n i^=xor128();\n }\n STR(s);\n if(s==\"Charlie\"){\n STR(x);\n STR(y);\n bitset<30>a[100],b[100];\n rep(100)a[i]=bitset<30>(x.substr(i*30,30));\n rep(100)b[i]=bitset<30>(y.substr(i*30,30));\n vector<ll>sa(100),sb(100);\n iota(all(sa),0);\n iota(all(sb),0);\n rep(100){\n shuffle(all(sa),rnd);\n shuffle(all(sb),rnd);\n STR(s);\n bitset<1000>_c(s);\n bitset<30>c;\n each(i,bit){\n c<<=1;\n c|=(i&_c).count()&1;\n }\n each(i,sa)each(j,sb)if((a[i]^b[j])==c){\n out(i+1,j+1);\n goto br;\n }\n br:;\n }\n }\n else{\n rep(100){\n STR(s);\n bitset<1000>a(s);\n each(i,bit)print((i&a).count()&1);\n }\n out();\n }\n fflush(stdout);\n}","accuracy":1,"time_ms":20,"memory_kb":3748,"score_of_the_acc":-0.109,"final_rank":4},{"submission_id":"aoj_3150_4279528","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <cassert>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <string>\n#include <algorithm>\n#define llint long long\n#define inf 1e18\n#define mod 998244353\n#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)\n#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\n\nusing namespace std;\ntypedef pair<llint, llint> P;\n\nstring s, t;\nstring a[105];\nllint beki[1005];\nstring ans;\n\nstring x, y;\nvector<llint> vec, vec2;\n\nllint gethash(string &s)\n{\n\tllint hash = 0;\n\tfor(int j = 0; j < 1000; j++){\n\t\tif(s[j] == '1') hash ^= beki[j];\n\t}\n\treturn hash;\n}\n\nvoid get(string &s, vector<llint> &vec)\n{\n\tfor(int i = 0; i < 100; i++){\n\t\tllint h = 0;\n\t\tfor(int j = 0; j < 30; j++){\n\t\t\tllint c = s[i*30+j]-'0';\n\t\t\th |= c<<j;\n\t\t}\n\t\tvec.push_back(h);\n\t}\n}\n\nint main(void)\n{\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\t\n\tbeki[0] = 1;\n\tfor(int i = 1; i < 1005; i++) beki[i] = beki[i-1] * 2 % mod;\n\t\n\tcin >> s;\n\tif(s == \"Alice\" || s == \"Bob\"){\n\t\tfor(int i = 1; i <= 100; i++) cin >> a[i];\n\t\t\n\t\tfor(int i = 1; i <= 100; i++){\n\t\t\tllint hash = gethash(a[i]);\n\t\t\tfor(int j = 0; j < 30; j++){\n\t\t\t\tans += (char)(((hash >> j)&1) + '0');\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t\treturn 0;\n\t}\n\telse{\n\t\tcin >> x >> y;\n\t\tget(x, vec), get(y, vec2);\n\t\t\n\t\tfor(int i = 1; i <= 100; i++){\n\t\tcin >> t;\n\t\t\t\n\t\t\tllint hash = gethash(t);\n\t\t\tfor(int j = 0; j < vec.size(); j++){\n\t\t\t\tfor(int k = 0; k < vec2.size(); k++){\n\t\t\t\t\tif((vec[j]^vec2[k]^hash) == 0){\n\t\t\t\t\t\tcout << j+1 << \" \" << k+1 << endl;\n\t\t\t\t\t\tgoto end;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tend:;\n\t\t}\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3728,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_3150_4279455","code_snippet":"#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <cmath>\n#include <tuple>\n#include <cstring>\n#include <map>\n#include <iomanip>\n#include <ctime>\n#include <complex>\n#include <cassert>\n#include <climits>\n#include <bitset>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\n#define _ << \" \" <<\n#define all(X) (X).begin(), (X).end()\n#define len(X) (X).size()\n#define Pii pair<int, int>\n#define Pll pair<ll, ll>\n#define Tiii tuple<int, int, int>\n#define Tlll tuple<ll, ll, ll>\n#define PI 3.14159265358979324\n\nint main() {\n \n string s;\n cin >> s;\n vector<int> pic = {20,54,57,73,84,85,105,107,111,121,132,143,148,174,188,189,234,246,389,465,506,562,593,605,624,727,758,764,923,973};\n if (s[0] == 'C') {\n string x, y;\n cin >> x >> y;\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\n\n int t = 100;\n while (t--) {\n string c; cin >> c;\n for (int i = 0; i < 100; i++) {\n bool ok = 0;\n string a = x.substr(30*i, 30);\n string b;\n for (int j = 0; j < 30; j++) {\n b += char((c[pic[j]] ^ a[j]) + '0');\n }\n for (int j = 0; j < 100; j++) {\n if (b == y.substr(30*j, 30)) {\n cout << i + 1 _ j + 1 << endl;\n ok = 1;\n break;\n }\n }\n if (ok) break;\n }\n }\n\n }\n else {\n string a[100];\n for (int i = 0; i < 100; i++) cin >> a[i];\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\n string x;\n for (int j = 0; j < 100; j++) {\n for (int i = 0; i < 30; i++) {\n x += a[j][pic[i]];\n }\n }\n cout << x << endl;\n }\n \n //cerr << char(('0' ^ '1') + '0');\n}","accuracy":0.3939393939393939,"time_ms":40,"memory_kb":3752,"score_of_the_acc":-0.2692,"final_rank":15},{"submission_id":"aoj_3150_4279443","code_snippet":"#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <cmath>\n#include <tuple>\n#include <cstring>\n#include <map>\n#include <iomanip>\n#include <ctime>\n#include <complex>\n#include <cassert>\n#include <climits>\n#include <bitset>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\n#define _ << \" \" <<\n#define all(X) (X).begin(), (X).end()\n#define len(X) (X).size()\n#define Pii pair<int, int>\n#define Pll pair<ll, ll>\n#define Tiii tuple<int, int, int>\n#define Tlll tuple<ll, ll, ll>\n#define PI 3.14159265358979324\n\nint main() {\n \n string s;\n cin >> s;\n vector<int> pic = {1,72,137,141,143,151,167,168,209,231,233,317,326,398,418,434,524,530,569,570,578,582,608,776,807,844,859,865,916,937};\n if (s[0] == 'C') {\n string x, y;\n cin >> x >> y;\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\n\n int t = 100;\n while (t--) {\n string c; cin >> c;\n for (int i = 0; i < 100; i++) {\n bool ok = 0;\n string a = x.substr(30*i, 30);\n string b;\n for (int j = 0; j < 30; j++) {\n b += char((c[pic[j]] ^ a[j]) + '0');\n }\n for (int j = 0; j < 100; j++) {\n if (b == y.substr(30*j, 30)) {\n cout << i + 1 _ j + 1 << endl;\n ok = 1;\n break;\n }\n }\n if (ok) break;\n }\n }\n\n }\n else {\n string a[100];\n for (int i = 0; i < 100; i++) cin >> a[i];\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\n string x;\n for (int j = 0; j < 100; j++) {\n for (int i = 0; i < 30; i++) {\n x += a[j][pic[i]];\n }\n }\n cout << x << endl;\n }\n \n //cerr << char(('0' ^ '1') + '0');\n}","accuracy":0.2727272727272727,"time_ms":40,"memory_kb":3740,"score_of_the_acc":-0.25,"final_rank":20},{"submission_id":"aoj_3150_4279440","code_snippet":"#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <cmath>\n#include <tuple>\n#include <cstring>\n#include <map>\n#include <iomanip>\n#include <ctime>\n#include <complex>\n#include <cassert>\n#include <climits>\n#include <bitset>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\n#define _ << \" \" <<\n#define all(X) (X).begin(), (X).end()\n#define len(X) (X).size()\n#define Pii pair<int, int>\n#define Pll pair<ll, ll>\n#define Tiii tuple<int, int, int>\n#define Tlll tuple<ll, ll, ll>\n#define PI 3.14159265358979324\n\nint main() {\n \n string s;\n cin >> s;\n vector<int> pic = {88,124,180,188,219,251,252,268,320,480,544,548,566,568,571,605,614,621,703,709,711,738,805,884,903,939,959,996,997,999};\n if (s[0] == 'C') {\n string x, y;\n cin >> x >> y;\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\n\n int t = 100;\n while (t--) {\n string c; cin >> c;\n for (int i = 0; i < 100; i++) {\n bool ok = 0;\n string a = x.substr(30*i, 30);\n string b;\n for (int j = 0; j < 30; j++) {\n b += char((c[pic[j]] ^ a[j]) + '0');\n }\n for (int j = 0; j < 100; j++) {\n if (b == y.substr(30*j, 30)) {\n cout << i + 1 _ j + 1 << endl;\n ok = 1;\n break;\n }\n }\n if (ok) break;\n }\n }\n\n }\n else {\n string a[100];\n for (int i = 0; i < 100; i++) cin >> a[i];\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\n string x;\n for (int j = 0; j < 100; j++) {\n for (int i = 0; i < 30; i++) {\n x += a[j][pic[i]];\n }\n }\n cout << x << endl;\n }\n \n //cerr << char(('0' ^ '1') + '0');\n}","accuracy":0.3939393939393939,"time_ms":40,"memory_kb":3748,"score_of_the_acc":-0.2628,"final_rank":14},{"submission_id":"aoj_3150_4279437","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\nusing Int = long long;\nconst char newl = '\\n';\n\nconst Int seed = 114514;\nconst Int B = 1000;\nconst Int N = 100;\nauto make_vec(){\n vector<Int> vs(B,0);\n for(Int i=0;i<30;i++) vs[i]=1;\n mt19937 mt(seed);\n shuffle(vs.begin(),vs.end(),mt);\n return vs;\n}\n\nvoid Alice(){\n auto vs=make_vec();\n string X;\n for(Int i=0;i<N;i++){\n string a;\n cin>>a;\n for(Int j=0;j<B;j++)\n if(vs[j]) X+=a[j];\n }\n cout<<X<<endl;\n}\n\nvoid Bob(){\n auto vs=make_vec();\n string Y;\n for(Int i=0;i<N;i++){\n string b;\n cin>>b;\n for(Int j=0;j<B;j++)\n if(vs[j]) Y+=b[j];\n }\n cout<<Y<<endl;\n}\n\nvector<Int> decode(string s){\n vector<Int> vs;\n for(Int i=0;i<(Int)s.size();i+=30){\n Int res=0;\n for(Int j=0;j<30;j++)\n res=res*2+(s[i+j]-'0');\n vs.emplace_back(res);\n }\n return vs;\n}\n\nvoid Charlie(){\n string X,Y;\n cin>>X>>Y;\n\n auto vs=make_vec();\n string Z;\n for(Int i=0;i<N;i++){\n string c;\n cin>>c;\n for(Int j=0;j<B;j++)\n if(vs[j]) Z+=c[j];\n }\n auto as=decode(X);\n auto bs=decode(Y);\n auto cs=decode(Z);\n for(Int i=0;i<N;i++){\n for(Int a=0;a<N;a++){\n for(Int b=0;b<N;b++){\n if((as[a]^bs[b])==cs[i]){\n cout<<a+1<<\" \"<<b+1<<endl;\n goto END;\n }\n }\n }\n cout<<1<<\" \"<<1<<endl;\n END:\n ;\n }\n}\n//INSERT ABOVE HERE\nsigned main(){\n string s;\n cin>>s;\n if(s==\"Alice\") Alice();\n if(s==\"Bob\") Bob();\n if(s==\"Charlie\") Charlie();\n return 0;\n}","accuracy":0.3939393939393939,"time_ms":10,"memory_kb":3752,"score_of_the_acc":-0.0385,"final_rank":9},{"submission_id":"aoj_3150_4279429","code_snippet":"#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <cmath>\n#include <tuple>\n#include <cstring>\n#include <map>\n#include <iomanip>\n#include <ctime>\n#include <complex>\n#include <cassert>\n#include <climits>\n#include <bitset>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\n#define _ << \" \" <<\n#define all(X) (X).begin(), (X).end()\n#define len(X) (X).size()\n#define Pii pair<int, int>\n#define Pll pair<ll, ll>\n#define Tiii tuple<int, int, int>\n#define Tlll tuple<ll, ll, ll>\n#define PI 3.14159265358979324\n\nint main() {\n \n string s;\n cin >> s;\n vector<int> pic = {26,58,59,122,123,155,158,179,217,234,286,306,322,329,357,364,380,523,589,602,604,624,632,665,672,758,840,862,934,965};\n if (s[0] == 'C') {\n string x, y;\n cin >> x >> y;\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\n\n int t = 100;\n while (t--) {\n string c; cin >> c;\n for (int i = 0; i < 100; i++) {\n bool ok = 0;\n string a = x.substr(30*i, 30);\n string b;\n for (int j = 0; j < 30; j++) {\n b += char((c[pic[j]] ^ a[j]) + '0');\n }\n for (int j = 0; j < 100; j++) {\n if (b == y.substr(30*j, 30)) {\n cout << i + 1 _ j + 1 << endl;\n ok = 1;\n break;\n }\n }\n if (ok) break;\n }\n }\n\n }\n else {\n string a[100];\n for (int i = 0; i < 100; i++) cin >> a[i];\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\n string x;\n for (int j = 0; j < 100; j++) {\n for (int i = 0; i < 30; i++) {\n x += a[j][pic[i]];\n }\n }\n cout << x << endl;\n }\n \n //cerr << char(('0' ^ '1') + '0');\n}","accuracy":0.3939393939393939,"time_ms":40,"memory_kb":3764,"score_of_the_acc":-0.2885,"final_rank":17},{"submission_id":"aoj_3150_4279421","code_snippet":"#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <cmath>\n#include <tuple>\n#include <cstring>\n#include <map>\n#include <iomanip>\n#include <ctime>\n#include <complex>\n#include <cassert>\n#include <climits>\n#include <bitset>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\n#define _ << \" \" <<\n#define all(X) (X).begin(), (X).end()\n#define len(X) (X).size()\n#define Pii pair<int, int>\n#define Pll pair<ll, ll>\n#define Tiii tuple<int, int, int>\n#define Tlll tuple<ll, ll, ll>\n#define PI 3.14159265358979324\n\nint main() {\n \n string s;\n cin >> s;\n vector<int> pic = {65,116,165,216,218,239,259,294,319,328,330,379,407,442,449,453,539,585,663,677,709,718,812,823,840,907,909,937,941,945};\n if (s[0] == 'C') {\n string x, y;\n cin >> x >> y;\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\n\n int t = 100;\n while (t--) {\n string c; cin >> c;\n for (int i = 0; i < 100; i++) {\n bool ok = 0;\n string a = x.substr(30*i, 30);\n string b;\n for (int j = 0; j < 30; j++) {\n b += char((c[pic[j]] ^ a[j]) + '0');\n }\n for (int j = 0; j < 100; j++) {\n if (b == y.substr(30*j, 30)) {\n cout << i + 1 _ j + 1 << endl;\n ok = 1;\n break;\n }\n }\n if (ok) break;\n }\n }\n\n }\n else {\n string a[100];\n for (int i = 0; i < 100; i++) cin >> a[i];\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\n string x;\n for (int j = 0; j < 100; j++) {\n for (int i = 0; i < 30; i++) {\n x += a[j][pic[i]];\n }\n }\n cout << x << endl;\n }\n \n //cerr << char(('0' ^ '1') + '0');\n}","accuracy":0.3939393939393939,"time_ms":40,"memory_kb":3752,"score_of_the_acc":-0.2692,"final_rank":15}],"string":"[\n {\n \"submission_id\": \"aoj_3150_10466106\",\n \"code_snippet\": \"/*\\n * _|_|_|_|_| _|_|_|_| _|_|_| _|_|_|_|_| _|_|_| _|_|\\n * _| _| _| _| _| _| _|\\n * _| _|_|_| _|_| _| _|_| _|\\n * _| _| _| _| _| _|\\n * _|_|_|_|_| _| _|_|_| _| _|_|_| _|_|_|_|\\n */\\n\\n#include <bits/stdc++.h>\\n\\nconstexpr int L = 30;\\n\\nstd::string Encode(std::string S) {\\n std::mt19937 engine(114514);\\n std::reverse(S.begin(), S.end());\\n std::string res(L, '0');\\n int val = 0;\\n for (int i = 0; i < (int) S.length(); i++) {\\n int w = std::uniform_int_distribution<>(0, (1 << L) - 1)(engine);\\n if (S[i] == '1') { val ^= w; }\\n }\\n for (int i = 0; i < L; i++) { res[i] = '0' + (val >> i & 1); }\\n return res;\\n}\\n\\nstd::string operator^(const std::string &A, const std::string &B) {\\n assert(A.size() == B.size());\\n std::string S(A.size(), '0');\\n for (int i = 0; i < (int) A.size(); i++) {\\n if (A[i] != B[i]) { S[i] = '1'; }\\n }\\n return S;\\n}\\n\\nstd::string Alice(std::vector<std::string> A) {\\n std::string ret;\\n for (const auto &v: A) { ret += Encode(v); }\\n return ret;\\n}\\n\\nstd::string Bob(std::vector<std::string> B) {\\n std::string ret;\\n for (const auto &v: B) { ret += Encode(v); }\\n return ret;\\n}\\n\\nstd::vector<std::pair<int, int>> Catherine(std::string a, std::string b,\\n std::vector<std::string> C) {\\n int N = (int) a.length() / L;\\n std::map<std::string, int> sA, sB;\\n std::vector<std::string> A(N), B(N);\\n for (int i = 0; i < N; i++) {\\n A[i] = a.substr(i * L, L);\\n B[i] = b.substr(i * L, L);\\n sA[A[i]] = 1, sB[B[i]] = 1;\\n }\\n\\n std::mt19937 engine(133446);\\n std::vector<std::pair<int, int>> ans;\\n for (const auto &v: C) {\\n auto S = Encode(v);\\n std::vector<std::pair<int, int>> tmp;\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if ((A[i] ^ B[j]) == S) { tmp.emplace_back(i, j); }\\n }\\n }\\n assert(!tmp.empty());\\n int p = std::uniform_int_distribution<>(0, (int) tmp.size() - 1)(engine);\\n ans.emplace_back(tmp[p]);\\n }\\n\\n return ans;\\n}\\n\\nint main() {\\n std::string type;\\n std::cin >> type;\\n if (type == \\\"Alice\\\" || type == \\\"Bob\\\") {\\n std::vector<std::string> A(100);\\n for (auto &v: A) { std::cin >> v; }\\n std::cout << Alice(A) << '\\\\n';\\n } else {\\n std::string a, b;\\n std::vector<std::string> C(100);\\n std::cin >> a >> b;\\n for (auto &v: C) { std::cin >> v; }\\n auto ans = Catherine(a, b, C);\\n for (auto v: ans) {\\n std::cout << v.first + 1 << ' ' << v.second + 1 << '\\\\n';\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 4352,\n \"score_of_the_acc\": -2,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3150_10466088\",\n \"code_snippet\": \"/*\\n * _|_|_|_|_| _|_|_|_| _|_|_| _|_|_|_|_| _|_|_| _|_|\\n * _| _| _| _| _| _| _|\\n * _| _|_|_| _|_| _| _|_| _|\\n * _| _| _| _| _| _|\\n * _|_|_|_|_| _| _|_|_| _| _|_|_| _|_|_|_|\\n */\\n\\n#include <bits/stdc++.h>\\n\\nconstexpr int L = 30;\\n\\nstd::string Encode(std::string S) {\\n constexpr int pMod = 998244853;\\n std::reverse(S.begin(), S.end());\\n std::string res(L, '0');\\n int val = 0;\\n for (int i = 0, pw = 1; i < (int) S.length(); i++, pw = pw * 2 % pMod) {\\n if (S[i] == '1') { val ^= pw; }\\n }\\n for (int i = 0; i < L; i++) { res[i] = '0' + (val >> i & 1); }\\n return res;\\n}\\n\\nstd::string operator^(const std::string &A, const std::string &B) {\\n assert(A.size() == B.size());\\n std::string S(A.size(), '0');\\n for (int i = 0; i < (int) A.size(); i++) {\\n if (A[i] != B[i]) { S[i] = '1'; }\\n }\\n return S;\\n}\\n\\nstd::string Alice(std::vector<std::string> A) {\\n std::string ret;\\n for (const auto &v: A) { ret += Encode(v); }\\n return ret;\\n}\\n\\nstd::string Bob(std::vector<std::string> B) {\\n std::string ret;\\n for (const auto &v: B) { ret += Encode(v); }\\n return ret;\\n}\\n\\nstd::vector<std::pair<int, int>> Catherine(std::string a, std::string b,\\n std::vector<std::string> C) {\\n int N = (int) a.length() / L;\\n std::map<std::string, int> sA, sB;\\n std::vector<std::string> A(N), B(N);\\n for (int i = 0; i < N; i++) {\\n A[i] = a.substr(i * L, L);\\n B[i] = b.substr(i * L, L);\\n sA[A[i]] = 1, sB[B[i]] = 1;\\n }\\n\\n std::mt19937 engine(133447);\\n std::vector<std::pair<int, int>> ans;\\n for (const auto &v: C) {\\n auto S = Encode(v);\\n std::vector<std::pair<int, int>> tmp;\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if ((A[i] ^ B[j]) == S) { tmp.emplace_back(i, j); }\\n }\\n }\\n assert(!tmp.empty());\\n int p = std::uniform_int_distribution<>(0, (int) tmp.size() - 1)(engine);\\n ans.emplace_back(tmp[p]);\\n }\\n\\n return ans;\\n}\\n\\nint main() {\\n std::string type;\\n std::cin >> type;\\n if (type == \\\"Alice\\\" || type == \\\"Bob\\\") {\\n std::vector<std::string> A(100);\\n for (auto &v: A) { std::cin >> v; }\\n std::cout << Alice(A) << '\\\\n';\\n } else {\\n std::string a, b;\\n std::vector<std::string> C(100);\\n std::cin >> a >> b;\\n for (auto &v: C) { std::cin >> v; }\\n auto ans = Catherine(a, b, C);\\n for (auto v: ans) {\\n std::cout << v.first + 1 << ' ' << v.second + 1 << '\\\\n';\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 4352,\n \"score_of_the_acc\": -2,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3150_10466059\",\n \"code_snippet\": \"/*\\n * _|_|_|_|_| _|_|_|_| _|_|_| _|_|_|_|_| _|_|_| _|_|\\n * _| _| _| _| _| _| _|\\n * _| _|_|_| _|_| _| _|_| _|\\n * _| _| _| _| _| _|\\n * _|_|_|_|_| _| _|_|_| _| _|_|_| _|_|_|_|\\n */\\n\\n#include <bits/stdc++.h>\\n\\nconstexpr int L = 30;\\n\\nstd::string Encode(std::string S) {\\n std::mt19937 engine(114515);\\n std::reverse(S.begin(), S.end());\\n std::string res(L, '0');\\n for (int i = 0; i < (int) S.length(); i++) {\\n int p = i < L ? i : std::uniform_int_distribution<>(0, L - 1)(engine);\\n if (S[i] == '1') { res[p] ^= 1; }\\n }\\n return res;\\n}\\n\\nstd::string operator^(const std::string &A, const std::string &B) {\\n assert(A.size() == B.size());\\n std::string S(A.size(), '0');\\n for (int i = 0; i < (int) A.size(); i++) {\\n if (A[i] != B[i]) { S[i] = '1'; }\\n }\\n return S;\\n}\\n\\nstd::string Alice(std::vector<std::string> A) {\\n std::string ret;\\n for (const auto &v: A) { ret += Encode(v); }\\n return ret;\\n}\\n\\nstd::string Bob(std::vector<std::string> B) {\\n std::string ret;\\n for (const auto &v: B) { ret += Encode(v); }\\n return ret;\\n}\\n\\nstd::vector<std::pair<int, int>> Catherine(std::string a, std::string b,\\n std::vector<std::string> C) {\\n int N = (int) a.length() / L;\\n std::map<std::string, int> sA, sB;\\n std::vector<std::string> A(N), B(N);\\n for (int i = 0; i < N; i++) {\\n A[i] = a.substr(i * L, L);\\n B[i] = b.substr(i * L, L);\\n sA[A[i]] = 1, sB[B[i]] = 1;\\n }\\n\\n std::mt19937 engine(133448);\\n std::vector<std::pair<int, int>> ans;\\n for (const auto &v: C) {\\n auto S = Encode(v);\\n std::vector<std::pair<int, int>> tmp;\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if ((A[i] ^ B[j]) == S) { tmp.emplace_back(i, j); }\\n }\\n }\\n assert(!tmp.empty());\\n int p = std::uniform_int_distribution<>(0, (int) tmp.size() - 1)(engine);\\n ans.emplace_back(tmp[p]);\\n }\\n\\n return ans;\\n}\\n\\nint main() {\\n std::string type;\\n std::cin >> type;\\n if (type == \\\"Alice\\\" || type == \\\"Bob\\\") {\\n std::vector<std::string> A(100);\\n for (auto &v: A) { std::cin >> v; }\\n std::cout << Alice(A) << '\\\\n';\\n } else {\\n std::string a, b;\\n std::vector<std::string> C(100);\\n std::cin >> a >> b;\\n for (auto &v: C) { std::cin >> v; }\\n auto ans = Catherine(a, b, C);\\n for (auto v: ans) {\\n std::cout << v.first + 1 << ' ' << v.second + 1 << '\\\\n';\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 140,\n \"memory_kb\": 4352,\n \"score_of_the_acc\": -2,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3150_10466058\",\n \"code_snippet\": \"/*\\n * _|_|_|_|_| _|_|_|_| _|_|_| _|_|_|_|_| _|_|_| _|_|\\n * _| _| _| _| _| _| _|\\n * _| _|_|_| _|_| _| _|_| _|\\n * _| _| _| _| _| _|\\n * _|_|_|_|_| _| _|_|_| _| _|_|_| _|_|_|_|\\n */\\n\\n#include <bits/stdc++.h>\\n\\nconstexpr int L = 30;\\n\\nstd::string Encode(std::string S) {\\n std::mt19937 engine(114515);\\n std::reverse(S.begin(), S.end());\\n std::string res(L, '0');\\n for (int i = 0; i < (int) S.length(); i++) {\\n int p = i < L ? i : std::uniform_int_distribution<>(0, L - 1)(engine);\\n if (S[i] == '1') { res[p] ^= 1; }\\n }\\n return res;\\n}\\n\\nstd::string operator^(const std::string &A, const std::string &B) {\\n assert(A.size() == B.size());\\n std::string S(A.size(), '0');\\n for (int i = 0; i < (int) A.size(); i++) {\\n if (A[i] != B[i]) { S[i] = '1'; }\\n }\\n return S;\\n}\\n\\nstd::string Alice(std::vector<std::string> A) {\\n std::string ret;\\n for (const auto &v: A) { ret += Encode(v); }\\n return ret;\\n}\\n\\nstd::string Bob(std::vector<std::string> B) {\\n std::string ret;\\n for (const auto &v: B) { ret += Encode(v); }\\n return ret;\\n}\\n\\nstd::vector<std::pair<int, int>> Catherine(std::string a, std::string b,\\n std::vector<std::string> C) {\\n int N = (int) a.length() / L;\\n std::map<std::string, int> sA, sB;\\n std::vector<std::string> A(N), B(N);\\n for (int i = 0; i < N; i++) {\\n A[i] = a.substr(i * L, L);\\n B[i] = b.substr(i * L, L);\\n sA[A[i]] = 1, sB[B[i]] = 1;\\n }\\n\\n std::mt19937 engine(133447);\\n std::vector<std::pair<int, int>> ans;\\n for (const auto &v: C) {\\n auto S = Encode(v);\\n std::vector<std::pair<int, int>> tmp;\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if ((A[i] ^ B[j]) == S) { tmp.emplace_back(i, j); }\\n }\\n }\\n assert(!tmp.empty());\\n int p = std::uniform_int_distribution<>(0, (int) tmp.size() - 1)(engine);\\n ans.emplace_back(tmp[p]);\\n }\\n\\n return ans;\\n}\\n\\nint main() {\\n std::string type;\\n std::cin >> type;\\n if (type == \\\"Alice\\\" || type == \\\"Bob\\\") {\\n std::vector<std::string> A(100);\\n for (auto &v: A) { std::cin >> v; }\\n std::cout << Alice(A) << '\\\\n';\\n } else {\\n std::string a, b;\\n std::vector<std::string> C(100);\\n std::cin >> a >> b;\\n for (auto &v: C) { std::cin >> v; }\\n auto ans = Catherine(a, b, C);\\n for (auto v: ans) {\\n std::cout << v.first + 1 << ' ' << v.second + 1 << '\\\\n';\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 140,\n \"memory_kb\": 4352,\n \"score_of_the_acc\": -2,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3150_4356971\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,a,n) for (int i=a;i<n;i++)\\n#define per(i,a,n) for (int i=n-1;i>=a;i--)\\n#define pb push_back\\n#define mp make_pair\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define SZ(x) ((int)(x).size())\\ntypedef vector<int> VI;\\ntypedef long long ll;\\ntypedef pair<int,int> PII;\\ntypedef double db;\\nmt19937 mrand(1); \\nconst ll mod=998244353;\\nint rnd(int x) { return mrand() % x;}\\nll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\\nll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}\\n// head\\n\\nconst int N=1010;\\nint n,p[N];\\nint f[50][1010];\\nchar s[3010];\\nstring info;\\n\\nint a[110],b[110];\\n\\nvoid gao(int *a) {\\n\\trep(j,0,100) {\\n\\t\\tint x=0;\\n\\t\\trep(c,0,30) x|=(s[j*30+c]-'0')<<c;\\n\\t\\ta[j]=x;\\n\\t}\\n}\\n\\nint main() {\\n\\tscanf(\\\"%s\\\",s);\\n\\trep(c,0,30) rep(j,0,1000) f[c][j]=rnd(2);\\n\\tif (s[0]=='A'||s[0]=='B') {\\n\\t\\trep(i,0,100) {\\n\\t\\t\\tscanf(\\\"%s\\\",s);\\n\\t\\t\\trep(j,0,1000) p[j]=s[j]-'0';\\n\\t\\t\\trep(c,0,30) {\\n\\t\\t\\t\\tint x=0;\\n\\t\\t\\t\\trep(j,0,1000) if (f[c][j]) x^=p[j];\\n\\t\\t\\t\\tinfo.pb('0'+x);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%s\\\\n\\\",info.c_str());\\n\\t\\tfflush(stdout);\\n\\t} else {\\n\\t\\tscanf(\\\"%s\\\",s);\\n\\t\\tgao(a);\\n\\t\\tscanf(\\\"%s\\\",s);\\n\\t\\tgao(b);\\n\\t\\trep(i,0,100) {\\n\\t\\t\\tscanf(\\\"%s\\\",s);\\n\\t\\t\\tint msk=0;\\n\\t\\t\\trep(j,0,1000) p[j]=s[j]-'0';\\n\\t\\t\\trep(c,0,30) {\\n\\t\\t\\t\\tint x=0;\\n\\t\\t\\t\\trep(j,0,1000) if (f[c][j]) x^=p[j];\\n\\t\\t\\t\\tmsk|=x<<c;\\n\\t\\t\\t}\\n\\t\\t\\trep(x,0,100) rep(y,0,100) if ((a[x]^b[y])==msk) {\\n\\t\\t\\t\\tprintf(\\\"%d %d\\\\n\\\",x+1,y+1);\\n\\t\\t\\t\\tgoto end;\\n\\t\\t\\t}\\n\\t\\t\\tend:;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3728,\n \"score_of_the_acc\": -0.2308,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3150_4280407\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)\\n#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)\\n#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)\\n#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)\\n\\nstruct XorShift128 {\\n using u32 = uint32_t;\\n u32 x = 123456789, y = 362436069, z = 521288629, w = 88675123;\\n XorShift128 (u32 seed = 0) { z ^= seed; }\\n u32 operator()() {\\n u32 t = x ^ (x << 11);\\n x = y; y = z; z = w;\\n return w = (w ^ ( w >> 19)) ^ (t ^ (t >> 8));\\n }\\n};\\n\\nstring ll_to_string(ll num, ll digit = 30){\\n string s(digit, '0');\\n rrep(i, digit){\\n if(num % 2)s[i] = '1';\\n num /= 2;\\n }\\n return s;\\n}\\nll string_to_ll(string s, ll digit = 30){\\n ll num = 0;\\n rep(i, digit){\\n num *= 2;\\n if(s[i] == '1')num += 1;\\n }\\n return num;\\n}\\n\\nll rnd[100];\\n\\nvoid Alice(){\\n rep(i, 100){\\n string s(1000, '0');\\n cin >> s;\\n cout << ll_to_string(string_to_ll(s.substr(0, 30)) ^ rnd[i]);\\n }\\n cout << flush;\\n}\\n\\nvoid Charlie(){\\n ll A[100] = {}, B[100] = {};\\n string s;\\n cin >> s;\\n for(ll i = 0; i < 3000; i += 30){\\n A[i / 30] = (string_to_ll(s.substr(i, i + 30)) ^ rnd[i / 30]);\\n }\\n cin >> s;\\n for(ll i = 0; i < 3000; i += 30){\\n B[i / 30] = (string_to_ll(s.substr(i, i + 30)) ^ rnd[i / 30]);\\n }\\n rep(i, 100){\\n string s;\\n cin >> s;\\n ll c = string_to_ll(s.substr(0, 30));\\n ll X = 0, Y = 0;\\n rep(x, 100)rep(y, 100)if((A[x] ^ B[y]) == c){\\n X = x;\\n Y = y;\\n }\\n cout << X + 1 << \\\" \\\" << Y + 1 << endl;\\n }\\n cout << flush;\\n}\\n\\nint main(){\\n \\n XorShift128 xs;\\n rep(i, 100)rnd[i] = (xs() & ((1 << 30) - 1));\\n\\n string s;\\n cin >> s;\\n if(s == \\\"Charlie\\\")Charlie();\\n else Alice();\\n\\n return 0;\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 20,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.1154,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3150_4280399\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <sys/types.h>\\n#include <unistd.h>\\n\\n#define _overload(_1,_2,_3,name,...) name\\n#define _rep(i,n) _range(i,0,n)\\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\\n\\n#define _rrep(i,n) _rrange(i,n,0)\\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\\n\\n#define _all(arg) begin(arg),end(arg)\\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\\n#define clr(a,b) memset((a),(b),sizeof(a))\\n#define bit(n) (1LL<<(n))\\n#define popcount(n) (__builtin_popcountll(n))\\n\\nusing namespace std;\\n\\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\\n\\nusing ll=long long;\\nusing R=long double;\\nconst R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\\ninline int sgn(const R& r){return(r > EPS)-(r < -EPS);}\\ninline R sq(R x){return sqrt(max(x,0.0L));}\\n\\ntemplate<typename T> vector<T> make_vector(size_t sz){\\n\\treturn vector<T>(sz);\\n}\\n\\ntemplate<typename T,typename... Ts> \\nauto make_vector(size_t sz, Ts... ts){\\n\\treturn vector<decltype(make_vector<T>(ts...))>(sz, make_vector<T>(ts...));\\n}\\n\\ntemplate<typename T,typename U,typename... V> \\ntypename enable_if<is_same<T, U>::value!=0>::type \\nfill_value(U &u, const V... v){\\n\\tu=U(v...);\\n}\\n\\ntemplate<typename T,typename U,typename... V>\\ntypename enable_if<is_same<T, U>::value==0>::type\\nfill_value(U &u, const V... v){\\n\\tfor(auto &e:u){\\n\\t\\tfill_value<T>(e,v...);\\n\\t}\\n}\\n\\n\\nmt19937 engine(0);\\nuniform_int_distribution<> dist(0, 1); \\n\\n\\nconst int len = 1000;\\nconst int hash_len = 30;\\nusing BO = bitset<len>;\\nusing BH = bitset<hash_len>;\\n\\nvector<BO> base_vec;\\n\\nvoid init(int m){\\n\\trep(i, m) {\\n\\t\\tBO tmp;\\n\\t\\trep(j, len) tmp[j] = dist(engine);\\n\\t\\tbase_vec.push_back(tmp);\\n\\t}\\n}\\n\\n\\nBH get_hash(BO bst) {\\n\\tBH ret;\\n\\trep(i, hash_len) {\\n\\t\\tBO tmp = bst & base_vec[i]; \\n\\t\\tret[i] = tmp.count() & 1;\\n\\t}\\n\\treturn ret;\\n}\\n\\n\\n\\nvoid alice_bob_process(int n) {\\n\\tinit(hash_len);\\n\\n\\tstring ret = \\\"\\\";\\n\\n\\trep(i, n){\\n\\t\\tstring tmp;\\n\\t\\tcin >> tmp;\\n\\t\\tBO bit_orignal = BO(tmp);\\n\\t\\tBH bit_hash = get_hash(bit_orignal);\\n\\t\\tret += bit_hash.to_string();\\n\\t}\\n\\n\\tcout << ret << endl << flush;\\n}\\n\\nvoid charlie_process(int n) {\\n\\tinit(hash_len);\\n\\tstring x, y;\\n\\tcin >> x >> y;\\n\\n\\tvector<BH> xary, yary;\\n\\trep(i, n) {\\n\\t\\txary.push_back(BH(x.substr(hash_len * i, hash_len)));\\n\\t\\tyary.push_back(BH(y.substr(hash_len * i, hash_len)));\\t\\t\\n\\t}\\n\\n\\trep(i, n) {\\n\\t\\tstring c;\\n\\t\\tcin >> c;\\n\\t\\tBO bit_orignal = BO(c);\\n\\t\\tBH bit_hash = get_hash(bit_orignal);\\n\\n\\t\\trep(j, n) rep(k, n) {\\n\\t\\t\\tBH tmp = xary[j] ^ yary[k];\\n\\t\\t\\tif(tmp == bit_hash) {\\n\\t\\t\\t\\tcout << j + 1 << \\\" \\\" << k + 1 << endl;\\n\\t\\t\\t\\tj = n, k = n;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tcout << flush;\\n}\\n\\nint main(void){\\n\\tstring who;\\n\\tcin >> who;\\n\\tif(who == \\\"Alice\\\" or who == \\\"Bob\\\") {\\n\\t\\talice_bob_process(100);\\n\\t} else {\\n\\t\\tcharlie_process(100);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.1154,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3150_4280393\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)\\n#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)\\n#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)\\n#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)\\n\\nstruct XorShift128 {\\n using u32 = uint32_t;\\n u32 x = 123456789, y = 362436069, z = 521288629, w = 88675123;\\n XorShift128 (u32 seed = 0) { z ^= seed; }\\n u32 operator()() {\\n u32 t = x ^ (x << 11);\\n x = y; y = z; z = w;\\n return w = (w ^ ( w >> 19)) ^ (t ^ (t >> 8));\\n }\\n};\\n\\nstring ll_to_string(ll num, ll digit = 30){\\n string s(digit, '0');\\n rrep(i, digit){\\n if(num % 2)s[i] = '1';\\n num /= 2;\\n }\\n return s;\\n}\\nll string_to_ll(string s, ll digit = 30){\\n ll num = 0;\\n rep(i, digit){\\n num *= 2;\\n if(s[i] == '1')num += 1;\\n }\\n return num;\\n}\\n\\nll rnd[100];\\n\\nvoid Alice(){\\n rep(i, 100){\\n string s(1000, '0');\\n cin >> s;\\n cout << ll_to_string(string_to_ll(s.substr(0, 30)) ^ rnd[i]);\\n }\\n cout << flush;\\n}\\n\\nvoid Charlie(){\\n ll A[100] = {}, B[100] = {};\\n string s;\\n cin >> s;\\n for(ll i = 0; i < 3000; i += 30){\\n A[i / 30] = string_to_ll(s.substr(i, i + 30));\\n }\\n cin >> s;\\n for(ll i = 0; i < 3000; i += 30){\\n B[i / 30] = string_to_ll(s.substr(i, i + 30));\\n }\\n rep(i, 100){\\n string s;\\n cin >> s;\\n ll c = string_to_ll(s.substr(0, 30));\\n ll X = 0, Y = 0;\\n rep(x, 100)rep(y, 100)if((A[x] ^ B[y]) == c){\\n X = x;\\n Y = y;\\n }\\n cout << X + 1 << \\\" \\\" << Y + 1 << endl;\\n }\\n cout << flush;\\n}\\n\\nint main(){\\n \\n XorShift128 xs;\\n // rep(i, 100)rnd[i] = (xs() & ((1 << 30) - 1));\\n\\n string s;\\n cin >> s;\\n if(s == \\\"Charlie\\\")Charlie();\\n else Alice();\\n\\n return 0;\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 20,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.1154,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3150_4280348\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> V;\\n#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)\\nstruct XorShift128 {\\n using u32 = uint32_t;\\n u32 x = 123456789, y = 362436069, z = 521288629, w = 88675123;\\n XorShift128 (u32 seed = 0) { z ^= seed; }\\n u32 operator()() {\\n u32 t = x ^ (x << 11);\\n x = y; y = z; z = w;\\n return w = (w ^ ( w >> 19)) ^ (t ^ (t >> 8));\\n }\\n};\\n\\nll mp[100][30];\\n\\nvoid Alice(){\\n rep(i, 100){\\n string s(1000, '0');\\n cin >> s;\\n rep(j, 30)cout << (ll)(mp[i][j] ^ (s[j] - '0'));\\n }\\n cout << flush;\\n}\\nvoid Charlie(){\\n ll A[100] = {}, B[100] = {};\\n rep(i, 100){\\n rep(j, 30){\\n char c = '0';\\n cin >> c;\\n if(c == '1')A[i] |= (1 << j);\\n }\\n }\\n rep(i, 100){\\n rep(j, 30){\\n char c;\\n cin >> c;\\n if(c == '1')B[i] |= (1 << j);\\n }\\n }\\n rep(i, 100){\\n string s;\\n cin >> s;\\n ll c = 0;\\n rep(j, 30)if(s[j] == '1')c |= (1 << j);\\n ll X = 0, Y = 0;\\n rep(x, 100)rep(y, 100)if((A[x] ^ B[y]) == c){\\n X = x;\\n Y = y;\\n }\\n cout << X + 1 << \\\" \\\" << Y + 1 << endl;\\n }\\n cout << flush;\\n}\\n\\nint main(){\\n XorShift128 xs;\\n // rep(i, 100)rep(j, 30)mp[i][j] = xs() % 2;\\n string s;\\n cin >> s;\\n if(s == \\\"Charlie\\\")Charlie();\\n else Alice();\\n\\n return 0;\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 20,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.1154,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3150_4279824\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T>\\nbool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T>\\nbool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>\\nvoid ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T>\\nvoid debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)\\n{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)\\n{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\\ntemplate<typename T>\\nvoid debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];\\nfor(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\\ntemplate<typename T>\\nvector<vector<T>>vec(ll x, ll y, T w){\\n vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,0,-1,0,1,1,-1,-1};\\nvector<ll>dy={0,1,0,-1,1,-1,1,-1};\\ntemplate<typename T>\\nvector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>\\nauto make_v(size_t a,Ts... ts){\\n return vector<decltype(make_v(ts...))>(a,make_v(ts...));\\n}\\ntemplate<typename T1, typename T2>\\nostream &operator<<(ostream &os, pair<T1, T2>&p){\\n return os << p.first << \\\" \\\" << p.second;\\n} \\n\\nstring convert(ll n,ll bit){\\n string ret(bit,'0');\\n for(ll i=0;i<bit;i++)if(n&1LL<<bit-1-i)ret[i]='1';\\n return ret;\\n}\\nll convert(string s){\\n ll ret=0;\\n ll n=s.size();\\n for(ll i=0;i<n;i++)if(s[i]=='1')ret|=1<<n-i-1;\\n return ret;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n vector<ll>hash;\\n const ll mod=998244353;\\n ll k=100000;\\n //const ll num=2,len=3;\\n const ll num=100,len=1000;\\n vector<ll>v(len,k);\\n rep(i,0,len-1)v[i+1]=v[i]*k%mod;\\n string s;cin>>s;\\n if(s==\\\"Alice\\\"||s==\\\"Bob\\\"){\\n vector<string>a(num);\\n rep(i,0,num)cin>>a[i];\\n vector<ll>h(num);\\n string ret;\\n rep(i,0,num){\\n rep(j,0,len)if(a[i][j]=='1')h[i]^=v[j];\\n ret+=convert(h[i],30);\\n }\\n cout<<ret<<endl;\\n }\\n else{\\n string s,t;cin>>s>>t;\\n vector<ll>a(num),b(num);\\n rep(i,0,num)a[i]=convert(s.substr(i*30,30));\\n rep(i,0,num)b[i]=convert(t.substr(i*30,30));\\n rep(i,0,num){\\n string input;cin>>input;\\n ll c=0;\\n rep(j,0,len)if(input[j]=='1')c^=v[j];\\n rep(j,0,num){\\n bool sw=false;\\n rep(o,0,num){\\n if((a[j]^b[o]^c)==0){\\n cout<<j+1 spa o+1<<endl;\\n sw=true;\\n break;\\n }\\n }\\n if(sw)break;\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.0385,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3150_4279742\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T>\\nbool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T>\\nbool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>\\nvoid ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T>\\nvoid debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)\\n{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)\\n{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\\ntemplate<typename T>\\nvoid debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];\\nfor(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\\ntemplate<typename T>\\nvector<vector<T>>vec(ll x, ll y, T w){\\n vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,0,-1,0,1,1,-1,-1};\\nvector<ll>dy={0,1,0,-1,1,-1,1,-1};\\ntemplate<typename T>\\nvector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>\\nauto make_v(size_t a,Ts... ts){\\n return vector<decltype(make_v(ts...))>(a,make_v(ts...));\\n}\\ntemplate<typename T1, typename T2>\\nostream &operator<<(ostream &os, pair<T1, T2>&p){\\n return os << p.first << \\\" \\\" << p.second;\\n} \\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n vector<ll>hash;\\n const ll mod=998244353;\\n ll k=100000;\\n const ll num=100,len=1000;\\n //const ll num=100,len=1000;\\n vector<ll>v(len,k);\\n rep(i,0,len-1)v[i+1]=v[i]*k%mod;\\n string s;cin>>s;\\n if(s==\\\"Alice\\\"||s==\\\"Bob\\\"){\\n vector<string>a(num);\\n rep(i,0,num)cin>>a[i];\\n vector<ll>h(num);\\n string ret;\\n rep(i,0,num){\\n rep(j,0,len)if(a[i][j]=='1')h[i]^=v[j];\\n string s(30,'0');\\n rep(j,0,30){\\n s[j]=(h[i]&1)+'0';\\n h[i]>>=1;\\n }\\n ret+=s;\\n }\\n cout<<ret<<endl;\\n }\\n else{\\n string s,t;cin>>s>>t;\\n vector<ll>a(num),b(num);\\n rep(i,0,num){\\n bitset<30>k;\\n rep(j,0,30)if(s[i*30+j]=='1')k[j]=1;\\n a[i]=k.to_ullong();\\n }\\n rep(i,0,num){\\n bitset<30>k;\\n rep(j,0,30)if(t[i*30+j]=='1')k[j]=1;\\n b[i]=k.to_ullong();\\n }\\n //cout<<s spa t<<endl;\\n //debug(a,num);debug(b,num);\\n rep(i,0,num){\\n string input;cin>>input;\\n ll c=0;\\n rep(j,0,len)if(input[j]=='1')c^=v[j];\\n //cout<<c<<endl;\\n rep(j,0,num){\\n bool sw=false;\\n rep(o,0,num){\\n if((a[j]^b[o]^c)==0){\\n cout<<j+1 spa o+1<<endl;\\n sw=true;\\n break;\\n }\\n }\\n if(sw)break;\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3740,\n \"score_of_the_acc\": -0.0192,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3150_4279639\",\n \"code_snippet\": \"//\\n#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> V;\\n#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)\\n#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)\\n\\nV prime;\\nvoid init(){\\n V v;\\n for(ll i = 2; i <= 1000; i++){\\n ll f = 1;\\n for(ll j = 2; j * j <= i; j++)if(i % j == 0)f = 0;\\n if(f)v.push_back(i);\\n }\\n rep(i, 30)prime.push_back(34 * i + 5);\\n}\\n\\nll A[110];\\nll B[110];\\nvoid Alice(){\\n rep1(i, 100){\\n string s;\\n cin >> s;\\n rep(j, 30){\\n if(s[prime[j]] == '1')cout << 1;\\n else cout << 0;\\n } \\n }\\n cout << flush;\\n}\\nvoid Bob(){\\n rep1(i, 100){\\n string s;\\n cin >> s;\\n rep(j, 30){\\n if(s[prime[j]] == '1')cout << 1;\\n else cout << 0;\\n } \\n }\\n cout << flush;\\n}\\n\\nvoid solve(ll c, ll &x, ll &y){\\n x = 1;\\n y = 1;\\n rep1(i, 100)rep1(j, 100)if((A[i] ^ B[j]) == c){\\n x = i;\\n y = j;\\n }\\n}\\n\\nvoid Charlie(){\\n rep1(i, 100){\\n for(ll j = 0, k = 1; j < 30; j++, k += k){\\n char c;\\n cin >> c;\\n if(c == '1')A[i] |= k;\\n }\\n }\\n rep1(i, 100){\\n for(ll j = 0, k = 1; j < 30; j++, k += k){\\n char c;\\n cin >> c;\\n if(c == '1')B[i] |= k;\\n }\\n }\\n rep1(i, 100){\\n string s;\\n cin >> s;\\n ll c = 0;\\n for(ll j = 0, k = 1; j < 30; j++, k += k){\\n if(s[prime[j]] == '1')c |= k;\\n }\\n ll x, y;\\n solve(c, x, y);\\n cout << x << \\\" \\\" << y << endl;\\n }\\n cout << flush;\\n}\\n\\nint main(){\\n init();\\n string s;\\n cin >> s;\\n if(s == \\\"Alice\\\")Alice();\\n if(s == \\\"Bob\\\")Bob();\\n if(s == \\\"Charlie\\\")Charlie();\\n\\n return 0;\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 20,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.1154,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3150_4279550\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing uint = unsigned int;\\nusing pcc = pair<char, char>;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pdd = pair<double, double>;\\nusing tuplis = array<ll, 3>;\\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\\nconst ll LINF=0x1fffffffffffffff;\\nconst ll MINF=0x7fffffffffff;\\nconst int INF=0x3fffffff;\\nconst int MOD=1000000007;\\nconst int MODD=998244353;\\nconst ld DINF=numeric_limits<ld>::infinity();\\nconst ld EPS=1e-9;\\nconst ld PI=3.1415926535897932;\\nconst ll dx[] = {0, 1, 0, -1, 1, 1, -1, -1};\\nconst ll dy[] = {1, 0, -1, 0, 1, -1, 1, -1};\\n#define overload4(_1,_2,_3,_4,name,...) name\\n#define overload3(_1,_2,_3,name,...) name\\n#define rep1(n) for(ll i=0;i<n;++i)\\n#define rep2(i,n) for(ll i=0;i<n;++i)\\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\\n#define rrep1(n) for(ll i=(n)-1;i>=0;i--)\\n#define rrep2(i,n) for(ll i=(n)-1;i>=0;i--)\\n#define rrep3(i,a,b) for(ll i=(b)-1;i>=(a);i--)\\n#define rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)\\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\\n#define each(i,...) for(auto&& i:__VA_ARGS__)\\n#define all1(i) begin(i),end(i)\\n#define all2(i,a) begin(i),begin(i)+a\\n#define all3(i,a,b) begin(i)+a,begin(i)+b\\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\\n#define rall1(i) (i).rbegin(),(i).rend()\\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\\n#define elif else if\\n#define unless(a) if(!(a))\\n#define mp make_pair\\n#define mt make_tuple\\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\\n#define Sort(a) sort(all(a))\\n#define Rev(a) reverse(all(a))\\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define vec(type,name,...) vector<type> name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type> name(size);in(name)\\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\\nll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }\\nll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }\\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }\\nvector<pll> factor(ull x){ vector<pll> ans; for(ll i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\\nvector<ll> divisor(ull x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\\ntemplate<class T> unordered_map<T, ll> press(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); unordered_map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }\\ntemplate<class T> map<T, ll> press_map(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }\\nint scan(){ return getchar(); }\\nvoid scan(int& a){ scanf(\\\"%d\\\", &a); }\\nvoid scan(unsigned& a){ scanf(\\\"%u\\\", &a); }\\nvoid scan(long& a){ scanf(\\\"%ld\\\", &a); }\\nvoid scan(long long& a){ scanf(\\\"%lld\\\", &a); }\\nvoid scan(unsigned long long& a){ scanf(\\\"%llu\\\", &a); }\\nvoid scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\\\\n'); }\\nvoid scan(float& a){ scanf(\\\"%f\\\", &a); }\\nvoid scan(double& a){ scanf(\\\"%lf\\\", &a); }\\nvoid scan(long double& a){ scanf(\\\"%Lf\\\", &a); }\\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\\nvoid scan(char a[]){ scanf(\\\"%s\\\", a); }\\nvoid scan(string& a){ cin >> a; }\\ntemplate<class T> void scan(vector<T>&);\\ntemplate<class T, size_t size> void scan(array<T, size>&);\\ntemplate<class T, class L> void scan(pair<T, L>&);\\ntemplate<class T, size_t size> void scan(T(&)[size]);\\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\\ntemplate<class T> void scan(T& a){ cin >> a; }\\nvoid in(){}\\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\\nvoid print(){ putchar(' '); }\\nvoid print(bool a){ printf(\\\"%d\\\", a); }\\nvoid print(int a){ printf(\\\"%d\\\", a); }\\nvoid print(unsigned a){ printf(\\\"%u\\\", a); }\\nvoid print(long a){ printf(\\\"%ld\\\", a); }\\nvoid print(long long a){ printf(\\\"%lld\\\", a); }\\nvoid print(unsigned long long a){ printf(\\\"%llu\\\", a); }\\nvoid print(char a){ printf(\\\"%c\\\", a); }\\nvoid print(char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(const char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(float a){ printf(\\\"%.15f\\\", a); }\\nvoid print(double a){ printf(\\\"%.15f\\\", a); }\\nvoid print(long double a){ printf(\\\"%.15Lf\\\", a); }\\nvoid print(const string& a){ for(auto&& i : a) print(i); }\\ntemplate<class T> void print(const vector<T>&);\\ntemplate<class T, size_t size> void print(const array<T, size>&);\\ntemplate<class T, class L> void print(const pair<T, L>& p);\\ntemplate<class T, size_t size> void print(const T (&)[size]);\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\\ntemplate<class T> void print(const T& a){ cout << a; }\\nint out(){ putchar('\\\\n'); return 0; }\\ntemplate<class T> int out(const T& t){ print(t); putchar('\\\\n'); return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\\n#ifdef DEBUG\\nvoid err(){ putchar('\\\\n'); }\\ntemplate<class T> void err(const T& t){ print(t); putchar('\\\\n'); }\\ntemplate<class Head, class... Tail> void err(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); }\\n#else\\ntemplate<class... T> void err(const T&...){}\\n#endif\\nint first(bool i = true){ return out(i?\\\"first\\\":\\\"second\\\"); }\\nint yes(bool i = true){ return out(i?\\\"yes\\\":\\\"no\\\"); }\\nint Yes(bool i = true){ return out(i?\\\"Yes\\\":\\\"No\\\"); }\\nint No(){ return out(\\\"No\\\"); }\\nint YES(bool i = true){ return out(i?\\\"YES\\\":\\\"NO\\\"); }\\nint NO(){ return out(\\\"NO\\\"); }\\nint Yay(bool i = true){ return out(i?\\\"Yay!\\\":\\\":(\\\"); }\\nint possible(bool i = true){ return out(i?\\\"possible\\\":\\\"impossible\\\"); }\\nint Possible(bool i = true){ return out(i?\\\"Possible\\\":\\\"Impossible\\\"); }\\nint POSSIBLE(bool i = true){ return out(i?\\\"POSSIBLE\\\":\\\"IMPOSSIBLE\\\"); }\\nvoid Case(ll i){ printf(\\\"Case #%lld: \\\", i); }\\n\\n\\nmt19937 RD(58);\\nuint32_t xor128() {\\n static uint32_t x = RD();\\n static uint32_t y = RD();\\n static uint32_t z = RD();\\n static uint32_t w = RD();\\n uint32_t t;\\n t = x ^ (x << 11);\\n x = y; y = z; z = w;\\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n}\\nstruct Xorshift64{\\n using result_type = uint32_t;\\n static constexpr result_type min(){ return 0; }\\n static constexpr result_type max(){ return -1; }\\n uint64_t x = RD();\\n result_type operator()(){\\n x = x ^ (x << 13);\\n x = x ^ (x >> 7);\\n x = x ^ (x << 17);\\n return static_cast<uint32_t>(x);\\n }\\n}rnd;\\nsigned main(){\\n bitset<1000>bit[30];\\n each(i,bit)rep(_,32){\\n i<<=32;\\n i^=xor128();\\n }\\n STR(s);\\n if(s==\\\"Charlie\\\"){\\n STR(x);\\n STR(y);\\n bitset<30>a[100],b[100];\\n rep(100)a[i]=bitset<30>(x.substr(i*30,30));\\n rep(100)b[i]=bitset<30>(y.substr(i*30,30));\\n vector<ll>sa(100),sb(100);\\n iota(all(sa),0);\\n iota(all(sb),0);\\n rep(100){\\n shuffle(all(sa),rnd);\\n shuffle(all(sb),rnd);\\n STR(s);\\n bitset<1000>_c(s);\\n bitset<30>c;\\n each(i,bit){\\n c<<=1;\\n c|=(i&_c).count()&1;\\n }\\n each(i,sa)each(j,sb)if((a[i]^b[j])==c){\\n out(i+1,j+1);\\n goto br;\\n }\\n br:;\\n }\\n }\\n else{\\n rep(100){\\n STR(s);\\n bitset<1000>a(s);\\n each(i,bit)print((i&a).count()&1);\\n }\\n out();\\n }\\n fflush(stdout);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3748,\n \"score_of_the_acc\": -0.109,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3150_4279528\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <ctime>\\n#include <cstdlib>\\n#include <cassert>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <string>\\n#include <algorithm>\\n#define llint long long\\n#define inf 1e18\\n#define mod 998244353\\n#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)\\n#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\\n\\nusing namespace std;\\ntypedef pair<llint, llint> P;\\n\\nstring s, t;\\nstring a[105];\\nllint beki[1005];\\nstring ans;\\n\\nstring x, y;\\nvector<llint> vec, vec2;\\n\\nllint gethash(string &s)\\n{\\n\\tllint hash = 0;\\n\\tfor(int j = 0; j < 1000; j++){\\n\\t\\tif(s[j] == '1') hash ^= beki[j];\\n\\t}\\n\\treturn hash;\\n}\\n\\nvoid get(string &s, vector<llint> &vec)\\n{\\n\\tfor(int i = 0; i < 100; i++){\\n\\t\\tllint h = 0;\\n\\t\\tfor(int j = 0; j < 30; j++){\\n\\t\\t\\tllint c = s[i*30+j]-'0';\\n\\t\\t\\th |= c<<j;\\n\\t\\t}\\n\\t\\tvec.push_back(h);\\n\\t}\\n}\\n\\nint main(void)\\n{\\n\\tios::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\t\\n\\tbeki[0] = 1;\\n\\tfor(int i = 1; i < 1005; i++) beki[i] = beki[i-1] * 2 % mod;\\n\\t\\n\\tcin >> s;\\n\\tif(s == \\\"Alice\\\" || s == \\\"Bob\\\"){\\n\\t\\tfor(int i = 1; i <= 100; i++) cin >> a[i];\\n\\t\\t\\n\\t\\tfor(int i = 1; i <= 100; i++){\\n\\t\\t\\tllint hash = gethash(a[i]);\\n\\t\\t\\tfor(int j = 0; j < 30; j++){\\n\\t\\t\\t\\tans += (char)(((hash >> j)&1) + '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\telse{\\n\\t\\tcin >> x >> y;\\n\\t\\tget(x, vec), get(y, vec2);\\n\\t\\t\\n\\t\\tfor(int i = 1; i <= 100; i++){\\n\\t\\tcin >> t;\\n\\t\\t\\t\\n\\t\\t\\tllint hash = gethash(t);\\n\\t\\t\\tfor(int j = 0; j < vec.size(); j++){\\n\\t\\t\\t\\tfor(int k = 0; k < vec2.size(); k++){\\n\\t\\t\\t\\t\\tif((vec[j]^vec2[k]^hash) == 0){\\n\\t\\t\\t\\t\\t\\tcout << j+1 << \\\" \\\" << k+1 << endl;\\n\\t\\t\\t\\t\\t\\tgoto end;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tend:;\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3728,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3150_4279455\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\n#include <set>\\n#include <cmath>\\n#include <tuple>\\n#include <cstring>\\n#include <map>\\n#include <iomanip>\\n#include <ctime>\\n#include <complex>\\n#include <cassert>\\n#include <climits>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\n#define _ << \\\" \\\" <<\\n#define all(X) (X).begin(), (X).end()\\n#define len(X) (X).size()\\n#define Pii pair<int, int>\\n#define Pll pair<ll, ll>\\n#define Tiii tuple<int, int, int>\\n#define Tlll tuple<ll, ll, ll>\\n#define PI 3.14159265358979324\\n\\nint main() {\\n \\n string s;\\n cin >> s;\\n vector<int> pic = {20,54,57,73,84,85,105,107,111,121,132,143,148,174,188,189,234,246,389,465,506,562,593,605,624,727,758,764,923,973};\\n if (s[0] == 'C') {\\n string x, y;\\n cin >> x >> y;\\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\\n\\n int t = 100;\\n while (t--) {\\n string c; cin >> c;\\n for (int i = 0; i < 100; i++) {\\n bool ok = 0;\\n string a = x.substr(30*i, 30);\\n string b;\\n for (int j = 0; j < 30; j++) {\\n b += char((c[pic[j]] ^ a[j]) + '0');\\n }\\n for (int j = 0; j < 100; j++) {\\n if (b == y.substr(30*j, 30)) {\\n cout << i + 1 _ j + 1 << endl;\\n ok = 1;\\n break;\\n }\\n }\\n if (ok) break;\\n }\\n }\\n\\n }\\n else {\\n string a[100];\\n for (int i = 0; i < 100; i++) cin >> a[i];\\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\\n string x;\\n for (int j = 0; j < 100; j++) {\\n for (int i = 0; i < 30; i++) {\\n x += a[j][pic[i]];\\n }\\n }\\n cout << x << endl;\\n }\\n \\n //cerr << char(('0' ^ '1') + '0');\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 40,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.2692,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3150_4279443\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\n#include <set>\\n#include <cmath>\\n#include <tuple>\\n#include <cstring>\\n#include <map>\\n#include <iomanip>\\n#include <ctime>\\n#include <complex>\\n#include <cassert>\\n#include <climits>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\n#define _ << \\\" \\\" <<\\n#define all(X) (X).begin(), (X).end()\\n#define len(X) (X).size()\\n#define Pii pair<int, int>\\n#define Pll pair<ll, ll>\\n#define Tiii tuple<int, int, int>\\n#define Tlll tuple<ll, ll, ll>\\n#define PI 3.14159265358979324\\n\\nint main() {\\n \\n string s;\\n cin >> s;\\n vector<int> pic = {1,72,137,141,143,151,167,168,209,231,233,317,326,398,418,434,524,530,569,570,578,582,608,776,807,844,859,865,916,937};\\n if (s[0] == 'C') {\\n string x, y;\\n cin >> x >> y;\\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\\n\\n int t = 100;\\n while (t--) {\\n string c; cin >> c;\\n for (int i = 0; i < 100; i++) {\\n bool ok = 0;\\n string a = x.substr(30*i, 30);\\n string b;\\n for (int j = 0; j < 30; j++) {\\n b += char((c[pic[j]] ^ a[j]) + '0');\\n }\\n for (int j = 0; j < 100; j++) {\\n if (b == y.substr(30*j, 30)) {\\n cout << i + 1 _ j + 1 << endl;\\n ok = 1;\\n break;\\n }\\n }\\n if (ok) break;\\n }\\n }\\n\\n }\\n else {\\n string a[100];\\n for (int i = 0; i < 100; i++) cin >> a[i];\\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\\n string x;\\n for (int j = 0; j < 100; j++) {\\n for (int i = 0; i < 30; i++) {\\n x += a[j][pic[i]];\\n }\\n }\\n cout << x << endl;\\n }\\n \\n //cerr << char(('0' ^ '1') + '0');\\n}\",\n \"accuracy\": 0.2727272727272727,\n \"time_ms\": 40,\n \"memory_kb\": 3740,\n \"score_of_the_acc\": -0.25,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3150_4279440\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\n#include <set>\\n#include <cmath>\\n#include <tuple>\\n#include <cstring>\\n#include <map>\\n#include <iomanip>\\n#include <ctime>\\n#include <complex>\\n#include <cassert>\\n#include <climits>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\n#define _ << \\\" \\\" <<\\n#define all(X) (X).begin(), (X).end()\\n#define len(X) (X).size()\\n#define Pii pair<int, int>\\n#define Pll pair<ll, ll>\\n#define Tiii tuple<int, int, int>\\n#define Tlll tuple<ll, ll, ll>\\n#define PI 3.14159265358979324\\n\\nint main() {\\n \\n string s;\\n cin >> s;\\n vector<int> pic = {88,124,180,188,219,251,252,268,320,480,544,548,566,568,571,605,614,621,703,709,711,738,805,884,903,939,959,996,997,999};\\n if (s[0] == 'C') {\\n string x, y;\\n cin >> x >> y;\\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\\n\\n int t = 100;\\n while (t--) {\\n string c; cin >> c;\\n for (int i = 0; i < 100; i++) {\\n bool ok = 0;\\n string a = x.substr(30*i, 30);\\n string b;\\n for (int j = 0; j < 30; j++) {\\n b += char((c[pic[j]] ^ a[j]) + '0');\\n }\\n for (int j = 0; j < 100; j++) {\\n if (b == y.substr(30*j, 30)) {\\n cout << i + 1 _ j + 1 << endl;\\n ok = 1;\\n break;\\n }\\n }\\n if (ok) break;\\n }\\n }\\n\\n }\\n else {\\n string a[100];\\n for (int i = 0; i < 100; i++) cin >> a[i];\\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\\n string x;\\n for (int j = 0; j < 100; j++) {\\n for (int i = 0; i < 30; i++) {\\n x += a[j][pic[i]];\\n }\\n }\\n cout << x << endl;\\n }\\n \\n //cerr << char(('0' ^ '1') + '0');\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 40,\n \"memory_kb\": 3748,\n \"score_of_the_acc\": -0.2628,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3150_4279437\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\nconst Int seed = 114514;\\nconst Int B = 1000;\\nconst Int N = 100;\\nauto make_vec(){\\n vector<Int> vs(B,0);\\n for(Int i=0;i<30;i++) vs[i]=1;\\n mt19937 mt(seed);\\n shuffle(vs.begin(),vs.end(),mt);\\n return vs;\\n}\\n\\nvoid Alice(){\\n auto vs=make_vec();\\n string X;\\n for(Int i=0;i<N;i++){\\n string a;\\n cin>>a;\\n for(Int j=0;j<B;j++)\\n if(vs[j]) X+=a[j];\\n }\\n cout<<X<<endl;\\n}\\n\\nvoid Bob(){\\n auto vs=make_vec();\\n string Y;\\n for(Int i=0;i<N;i++){\\n string b;\\n cin>>b;\\n for(Int j=0;j<B;j++)\\n if(vs[j]) Y+=b[j];\\n }\\n cout<<Y<<endl;\\n}\\n\\nvector<Int> decode(string s){\\n vector<Int> vs;\\n for(Int i=0;i<(Int)s.size();i+=30){\\n Int res=0;\\n for(Int j=0;j<30;j++)\\n res=res*2+(s[i+j]-'0');\\n vs.emplace_back(res);\\n }\\n return vs;\\n}\\n\\nvoid Charlie(){\\n string X,Y;\\n cin>>X>>Y;\\n\\n auto vs=make_vec();\\n string Z;\\n for(Int i=0;i<N;i++){\\n string c;\\n cin>>c;\\n for(Int j=0;j<B;j++)\\n if(vs[j]) Z+=c[j];\\n }\\n auto as=decode(X);\\n auto bs=decode(Y);\\n auto cs=decode(Z);\\n for(Int i=0;i<N;i++){\\n for(Int a=0;a<N;a++){\\n for(Int b=0;b<N;b++){\\n if((as[a]^bs[b])==cs[i]){\\n cout<<a+1<<\\\" \\\"<<b+1<<endl;\\n goto END;\\n }\\n }\\n }\\n cout<<1<<\\\" \\\"<<1<<endl;\\n END:\\n ;\\n }\\n}\\n//INSERT ABOVE HERE\\nsigned main(){\\n string s;\\n cin>>s;\\n if(s==\\\"Alice\\\") Alice();\\n if(s==\\\"Bob\\\") Bob();\\n if(s==\\\"Charlie\\\") Charlie();\\n return 0;\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 10,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.0385,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3150_4279429\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\n#include <set>\\n#include <cmath>\\n#include <tuple>\\n#include <cstring>\\n#include <map>\\n#include <iomanip>\\n#include <ctime>\\n#include <complex>\\n#include <cassert>\\n#include <climits>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\n#define _ << \\\" \\\" <<\\n#define all(X) (X).begin(), (X).end()\\n#define len(X) (X).size()\\n#define Pii pair<int, int>\\n#define Pll pair<ll, ll>\\n#define Tiii tuple<int, int, int>\\n#define Tlll tuple<ll, ll, ll>\\n#define PI 3.14159265358979324\\n\\nint main() {\\n \\n string s;\\n cin >> s;\\n vector<int> pic = {26,58,59,122,123,155,158,179,217,234,286,306,322,329,357,364,380,523,589,602,604,624,632,665,672,758,840,862,934,965};\\n if (s[0] == 'C') {\\n string x, y;\\n cin >> x >> y;\\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\\n\\n int t = 100;\\n while (t--) {\\n string c; cin >> c;\\n for (int i = 0; i < 100; i++) {\\n bool ok = 0;\\n string a = x.substr(30*i, 30);\\n string b;\\n for (int j = 0; j < 30; j++) {\\n b += char((c[pic[j]] ^ a[j]) + '0');\\n }\\n for (int j = 0; j < 100; j++) {\\n if (b == y.substr(30*j, 30)) {\\n cout << i + 1 _ j + 1 << endl;\\n ok = 1;\\n break;\\n }\\n }\\n if (ok) break;\\n }\\n }\\n\\n }\\n else {\\n string a[100];\\n for (int i = 0; i < 100; i++) cin >> a[i];\\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\\n string x;\\n for (int j = 0; j < 100; j++) {\\n for (int i = 0; i < 30; i++) {\\n x += a[j][pic[i]];\\n }\\n }\\n cout << x << endl;\\n }\\n \\n //cerr << char(('0' ^ '1') + '0');\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 40,\n \"memory_kb\": 3764,\n \"score_of_the_acc\": -0.2885,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3150_4279421\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\n#include <set>\\n#include <cmath>\\n#include <tuple>\\n#include <cstring>\\n#include <map>\\n#include <iomanip>\\n#include <ctime>\\n#include <complex>\\n#include <cassert>\\n#include <climits>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\n#define _ << \\\" \\\" <<\\n#define all(X) (X).begin(), (X).end()\\n#define len(X) (X).size()\\n#define Pii pair<int, int>\\n#define Pll pair<ll, ll>\\n#define Tiii tuple<int, int, int>\\n#define Tlll tuple<ll, ll, ll>\\n#define PI 3.14159265358979324\\n\\nint main() {\\n \\n string s;\\n cin >> s;\\n vector<int> pic = {65,116,165,216,218,239,259,294,319,328,330,379,407,442,449,453,539,585,663,677,709,718,812,823,840,907,909,937,941,945};\\n if (s[0] == 'C') {\\n string x, y;\\n cin >> x >> y;\\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\\n\\n int t = 100;\\n while (t--) {\\n string c; cin >> c;\\n for (int i = 0; i < 100; i++) {\\n bool ok = 0;\\n string a = x.substr(30*i, 30);\\n string b;\\n for (int j = 0; j < 30; j++) {\\n b += char((c[pic[j]] ^ a[j]) + '0');\\n }\\n for (int j = 0; j < 100; j++) {\\n if (b == y.substr(30*j, 30)) {\\n cout << i + 1 _ j + 1 << endl;\\n ok = 1;\\n break;\\n }\\n }\\n if (ok) break;\\n }\\n }\\n\\n }\\n else {\\n string a[100];\\n for (int i = 0; i < 100; i++) cin >> a[i];\\n //vector<int> pic = {28,80,95,112,118,169,185,206,252,255,264,303,307,346,347,369,390,393,473,506,524,558,603,608,616,621,623,678,748,909};\\n string x;\\n for (int j = 0; j < 100; j++) {\\n for (int i = 0; i < 30; i++) {\\n x += a[j][pic[i]];\\n }\\n }\\n cout << x << endl;\\n }\\n \\n //cerr << char(('0' ^ '1') + '0');\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 40,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.2692,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":1967,"cells":{"group_id":{"kind":"string","value":"aoj_3147_cpp"},"problem_description":{"kind":"string","value":"K: トーナメント\n問題文\n京都大学クスノキ前にて、$2$ 人用対戦ゲームのトーナメントが行われようとしています。\nこのトーナメントの参加者は $2^N$ 人いて、 $1$ から $2^N$ までの番号がついています。\n参加者のうちの $2$ 人が戦った時の勝敗は、$0$ と $1$ からなる長さ $2^N-1$ の文字列 $S$ によって表されます。\n人 $x$ と人 $y$ $(1 \\le x < y \\le 2^N)$ が戦ったとき、\n$S_{y-x} = 0$ のとき、人 $x$ が勝ち、\n$S_{y-x} = 1$ のとき、人 $y$ が勝つ\nことが分かっています。\nトーナメントは参加者が一列に並ぶことで始まり、以下の通りに進行します。\n列の先頭から $2$ 人ずつペアを作る。すべてのペアについて、ペア内の $2$ 人が戦う。\n1 の対戦で勝った人は列に残り、負けた人は列から抜ける。\n残っている人が $2$ 人以上いるときは、列を詰めて 1 に戻る。\n残っている人が $1$ 人となったら、その人が優勝者となる。\nいま、参加者は初期状態として、先頭から $i$ 番目 $(1 \\le i \\le 2^N)$ が人 $P_i$ となるように並んでいます。\n$0 \\le k \\le 2^N-1$ を満たすすべての整数 $k$ について、以下の問題を解いてください。\n初期状態から先頭 $k$ 人が、その順番を変えずに列の末尾に移動する。\nつまり、移動後の列における参加者の番号を先頭から挙げていくと、 $P_{k+1}, P_{k+2}, ..., P_{2^N}, P_1, P_2, ..., P_k$ となる。\n移動後の列からトーナメントを始めたときの、優勝者の番号を求めよ。\n制約\n$1 \\leq N \\leq 18$\n$N$ は整数である。\n$S$ は $0$ と $1$ からなる長さ $2^N-1$ の文字列である。\n$P$ は $1$ から $2^N$ までの整数を並べ替えた順列である。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$\n$S_1S_2 \\ldots S_{2^N-1}$\n$P_1$ $P_2$ $\\ldots$ $P_{2^N}$\n出力\n$2^N$ 行出力せよ。\n$i$ 行目 $(1 \\le i \\le 2^N)$ には、$k = i-1$ としたときの上記の問題の答えを出力せよ。\n入力例1\n2\n100\n1 4 2 3\n出力例1\n1\n2\n1\n2\n例えば $k = 2$ としたとき、移動後の列における参加者の番号を先頭から挙げていくと、 $2, 3, 1, 4$ となります。\n人 $2$ と 人 $3$ が戦うと、 $S_1 = 1$ より人 $3$ が勝ちます。\n人 $1$ と 人 $4$ が戦うと、 $S_3 = 0$ より人 $1$ が勝ちます。\n人 $3$ と 人 $1$ が戦うと、 $S_2 = 0$ より人 $1$ が勝ちます。\nしたがって、 $k = 2$ の場合の優勝者は、人 $1$ となります。\n入力例2\n4\n101011100101000\n8 15 2 9 12 5 1 7 14 10 11 3 4 6 16 13\n出力例2\n16\n1\n16\n2\n16\n12\n10\n14\n16\n1\n16\n2\n16\n12\n10\n14\n入力例3\n1\n0\n1 2\n出力例3\n1\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3147_10215807","code_snippet":"// AOJ #3147\n// Tournament 2025.2.13\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nchar temp[263000];\nstring Cins() { // 文字列の入力 スペース以下の文字で入力終了\n char *s = temp;\n\tdo *s = gc();\n\twhile (*s++ > ' ');\n\t*(s-1) = 0;\n string input(temp); // 文字配列からstringを作成\n return input;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nstring S;\n \ninline int match(int a, int b) {\n if(a > b) swap(a, b);\n int diff = b - a;\n return (S[diff - 1] == '0') ? a : b;\n}\n \nint main(){\n int N = Cin(), L = 1 << N;\n S = Cins();\n \n vector<int> P(L);\n for (int i = 0; i < L; i++) P[i] = Cin();\n \n vector<int> B(2 * L);\n for (int i = 0; i < L; i++){\n B[i] = P[i];\n B[i+L] = P[i];\n }\n \n vector<vector<int>> dp;\n dp.push_back(B);\n for (int m = 1; m <= N; m++){\n int segLen = 1 << m;\n int half = 1 << (m-1);\n int prevSize = dp[m-1].size();\n int newSize = prevSize - half;\n vector<int> cur(newSize);\n for (int i = 0; i < newSize; i++){\n cur[i] = match(dp[m-1][i], dp[m-1][i + half]);\n }\n dp.push_back(move(cur));\n }\n for (int k = 0; k < L; k++) Cout(dp[N][k]);\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":43592,"score_of_the_acc":-0.1938,"final_rank":9},{"submission_id":"aoj_3147_10215797","code_snippet":"// AOJ #3147\n// Tournament 2025.2.13\n\n#include <bits/stdc++.h>\nusing namespace std;\n \nstring S;\n \ninline int match(int a, int b) {\n if(a > b) swap(a, b);\n int diff = b - a;\n return (S[diff - 1] == '0') ? a : b;\n}\n \nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N;\n cin >> N;\n int L = 1 << N;\n cin >> S;\n \n vector<int> P(L);\n for (int i = 0; i < L; i++) cin >> P[i];\n \n vector<int> B(2 * L);\n for (int i = 0; i < L; i++){\n B[i] = P[i];\n B[i+L] = P[i];\n }\n \n vector<vector<int>> dp;\n dp.push_back(B);\n for (int m = 1; m <= N; m++){\n int segLen = 1 << m;\n int half = 1 << (m-1);\n int prevSize = dp[m-1].size();\n int newSize = prevSize - half;\n vector<int> cur(newSize);\n for (int i = 0; i < newSize; i++){\n cur[i] = match(dp[m-1][i], dp[m-1][i + half]);\n }\n dp.push_back(move(cur));\n }\n \n for (int k = 0; k < L; k++)\n cout << dp[N][k] << endl;\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":43448,"score_of_the_acc":-0.3055,"final_rank":15},{"submission_id":"aoj_3147_9496069","code_snippet":"// competitive-verifier: PROBLEM\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\nint main(void) {\n int n;\n cin >> n;\n int k = 1 << n;\n string s;\n cin >> s;\n vector<int> a(k);\n cin >> a;\n vector dp(n, vector(k, -1));\n auto dfs = [&](auto self, int l, int p) -> int {\n int li = l % k;\n if (p == -1) {\n return a[li];\n }\n if (dp[p][li] != -1)\n return dp[p][li];\n int m = (l + (1 << p)) % k;\n int le = self(self, l, p - 1);\n int re = self(self, m, p - 1);\n if (le > re)\n swap(le, re);\n int d = re - le - 1;\n if (s[d] == '0')\n return dp[p][li] = le;\n else\n return dp[p][li] = re;\n };\n rep (i, k) co(dfs(dfs, i, n - 1));\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":23944,"score_of_the_acc":-0.1686,"final_rank":4},{"submission_id":"aoj_3147_9496067","code_snippet":"// competitive-verifier: PROBLEM\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\nint main(void) {\n int n;\n cin >> n;\n int k = 1 << n;\n string s;\n cin >> s;\n vector<int> a(k);\n cin >> a;\n vector dp(k, vector(n, -1));\n auto dfs = [&](auto self, int l, int p) -> int {\n int li = l % k;\n if (p == -1) {\n return a[li];\n }\n if (dp[li][p] != -1)\n return dp[li][p];\n int m = (l + (1 << p)) % k;\n int le = self(self, l, p - 1);\n int re = self(self, m, p - 1);\n if (le > re)\n swap(le, re);\n int d = re - le - 1;\n if (s[d] == '0')\n return dp[li][p] = le;\n else\n return dp[li][p] = re;\n };\n rep (i, k) co(dfs(dfs, i, n - 1));\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":31316,"score_of_the_acc":-0.2069,"final_rank":10},{"submission_id":"aoj_3147_9496065","code_snippet":"// competitive-verifier: PROBLEM\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\nint main(void) {\n int n;\n cin >> n;\n int k = 1 << n;\n string s;\n cin >> s;\n vector<int> a(k);\n cin >> a;\n vector dp(k, vector(n + 1, -1));\n auto dfs = [&](auto self, int l, int p) -> int {\n int li = l % k;\n if (p == 0) {\n return a[li];\n }\n if (dp[li][p] != -1)\n return dp[li][p];\n int m = (l + (1 << (p - 1))) % k;\n int le = self(self, l, p - 1);\n int re = self(self, m, p - 1);\n if (le > re)\n swap(le, re);\n int d = re - le - 1;\n if (s[d] == '0')\n return dp[li][p] = le;\n else\n return dp[li][p] = re;\n };\n rep (i, k) co(dfs(dfs, i, n));\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":35348,"score_of_the_acc":-0.2338,"final_rank":11},{"submission_id":"aoj_3147_9496049","code_snippet":"// competitive-verifier: PROBLEM\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\nint main(void) {\n int n;\n cin >> n;\n n = 1 << n;\n string s;\n cin >> s;\n vector<int> a(n);\n cin >> a;\n Dec >> a;\n unordered_map<ll, int> mp;\n auto dfs = [&](auto self, int l, int r) -> int {\n ll li = l % n;\n if (r - l == 1) {\n return a[li];\n }\n int ri = r % n;\n if (mp.count(li * n + ri))\n return mp[li * n + ri];\n int m = (l + r) / 2;\n int p = self(self, l, m);\n int q = self(self, m, r);\n if (p > q)\n swap(p, q);\n int d = abs(p - q) - 1;\n if (s[d] == '0')\n return mp[li * n + ri] = p;\n else\n return mp[li * n + ri] = q;\n };\n rep (i, n) co(dfs(dfs, i, n + i) + 1);\n return 0;\n}","accuracy":1,"time_ms":1120,"memory_kb":198728,"score_of_the_acc":-1.6391,"final_rank":17},{"submission_id":"aoj_3147_9496048","code_snippet":"// competitive-verifier: PROBLEM\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\nint main(void) {\n int n;\n cin >> n;\n n = 1 << n;\n string s;\n cin >> s;\n vector<int> a(n);\n cin >> a;\n Dec >> a;\n unordered_map<ll, int> mp;\n auto dfs = [&](auto self, int l, int r) -> int {\n int ll = l % n;\n if (r - l == 1) {\n return a[ll];\n }\n int rr = r % n;\n if (mp.count(ll * n + rr))\n return mp[ll * n + rr];\n int m = (l + r) / 2;\n int p = self(self, l, m);\n int q = self(self, m, r);\n if (p > q)\n swap(p, q);\n int d = abs(p - q) - 1;\n if (s[d] == '0')\n return mp[ll * n + rr] = p;\n else\n return mp[ll * n + rr] = q;\n };\n rep (i, n) co(dfs(dfs, i, n + i) + 1);\n return 0;\n}","accuracy":0.6511627906976745,"time_ms":1050,"memory_kb":166008,"score_of_the_acc":-1.4276,"final_rank":18},{"submission_id":"aoj_3147_9154291","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=int64_t;\n\nint main(){\n int N;\n cin >> N;\n int n=pow(2,N);\n string s;\n cin >> s;\n vector<bool> r(n);\n for(int i=0;i<n-1;i++){\n r[i+1]=(s[i]=='1');\n }\n vector<int> p(n);\n for(int &x:p) cin >> x;\n \n vector w(N,vector<int>(n));\n for(int i=0;i<n/2;i++){\n int i1=i*2,i2=i1+1;\n if(r[abs(p[i1]-p[i2])]){\n w[0][i]=(p[i1]>p[i2] ? p[i1] : p[i2]);\n }else{\n w[0][i]=(p[i1]<p[i2] ? p[i1] : p[i2]);\n }\n i1=((i2+1)%n);\n if(r[abs(p[i1]-p[i2])]){\n w[0][i+n/2]=(p[i1]>p[i2] ? p[i1] : p[i2]);\n }else{\n w[0][i+n/2]=(p[i1]<p[i2] ? p[i1] : p[i2]);\n }\n \n }\n if(N==1){\n cout << w[0][0] << endl;\n cout << w[0][1] << endl;\n return 0;\n }\n \n/* for(int i=0;i<n;i++){\n cout << w[0][i] << \" \";\n }\n cout << endl;\n*/\n int n1=n,n2,nn=1;\n for(int j=1;j<N;j++){\n n1/=2;n2=n1/2;nn*=2;\n for(int k=0;k<2;k++){\n int k1=k*n/2;\n for(int ii=0;ii<nn;ii++){\n int ii1=n1*ii,ii2=n2*ii+k1;\n for(int i=0;i<n2;i++){\n int i1=i*2+k,i2=(i1+1)%n1;\n i1+=ii1;i2+=ii1;\n if(r[abs(w[j-1][i1]-w[j-1][i2])]){\n w[j][i+ii2]=(w[j-1][i1]>w[j-1][i2] ? w[j-1][i1] : w[j-1][i2]);\n }else{\n w[j][i+ii2]=(w[j-1][i1]<w[j-1][i2] ? w[j-1][i1] : w[j-1][i2]);\n }\n //cout << j << \" \" << i+ii2 << \" \" << ii1 << \" \" << i1 << \" \" << i2 << endl;\n }\n }\n }\n }\n for(int i=0;i<n;i++) cout << w[N-1][i] << endl;\n\n}","accuracy":1,"time_ms":280,"memory_kb":24316,"score_of_the_acc":-0.2356,"final_rank":12},{"submission_id":"aoj_3147_4885512","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)\n#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)\n#define REP(i, n) rep(i, 0, n)\n#define REP2(i, n) rep2(i, 0, n)\n#define all(hoge) (hoge).begin(), (hoge).end()\n#define en '\\n'\nusing ll = long long;\nusing ull = unsigned long long;\ntemplate <class T>\nusing vec = vector<T>;\ntemplate <class T>\nusing vvec = vector<vec<T>>;\ntypedef pair<ll, ll> P;\nusing tp = tuple<ll, ll, ll>;\nconstexpr long long INF = 1LL << 60;\nconstexpr int INF_INT = 1 << 25;\n//constexpr long long MOD = (ll)1e9 + 7;\nconstexpr long long MOD = 998244353LL;\nusing ld = long double;\nstatic const ld pi = 3.141592653589793L;\ntypedef vector<ll> Array;\ntypedef vector<Array> Matrix;\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//グラフ関連\nstruct Edge {\n ll to, cap, rev;\n Edge(ll _to, ll _cap, ll _rev) {\n to = _to;\n cap = _cap;\n rev = _rev;\n }\n};\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {\n G[from].push_back(Edge(to, cap, (ll)G[to].size()));\n if(revFlag)\n G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\n}\n\nint dp[1LL << 18][20];\n\nvoid solve() {\n ll n;\n cin >> n;\n ll m = 1LL << n;\n string s;\n cin >> s;\n vec<int> p(m);\n REP(i, m) {\n cin >> p[i];\n }\n\n auto check = [&](auto &&self, int i, int x) -> int {\n if(dp[i][x] != 0)\n return dp[i][x];\n if(x == 0)\n return dp[i][x] = p[i];\n int L = self(self, i, x - 1);\n int R = self(self, (i + (1 << (x - 1))) % m, x - 1);\n return dp[i][x] = s[abs(R - L) - 1] == '1' ? max(R, L) : min(R, L);\n };\n REP(i, m) {\n cout << check(check, i, n) << en;\n }\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n /*\n ll t;\n cin >> t;\n while(t--)*/\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":25088,"score_of_the_acc":-0.1805,"final_rank":8},{"submission_id":"aoj_3147_4518342","code_snippet":"#include <iostream>\n#include <utility>\n#include <tuple>\n#include <vector>\n#include <string>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <algorithm>\n#include <functional>\n#include <climits>\n#include <numeric>\n#include <queue>\n#include <cmath>\n#include <iomanip>\n#include <array>\n#include <string>\nint winner(const int depth, int from, int until, const std::vector<std::vector<int>>& calculated, const std::string& state) {\n\tconst auto length = 1 << depth;\n\tif (from + length == until && (calculated.front().size() <= from || until <= calculated.front().size())) \n\t\treturn calculated.front().size() <= from ? calculated[depth][from - calculated.front().size()] : calculated[depth][from];\n\tconst auto a = winner(depth - 1, from, from + (length >> 1), calculated, state);\n\tconst auto b = winner(depth - 1, from + (length >> 1), until, calculated, state);\n\tconst auto x = std::min(a, b);\n\tconst auto y = std::max(a, b);\n\treturn state[y - x - 1] == '0' ? x : y;\n}\nint main() {\n\tint n; std::cin >> n;\n\tstd::string str; std::cin >> str;\n\tstd::vector<int> permutation(1 << n);\n\tfor (auto& p : permutation) std::cin >> p;\n\tstd::vector<std::vector<int>> calculated;\n\tcalculated.push_back(permutation);\n\tfor (auto d = 0; d < n; ++d) {\n\t\tstd::vector<int> winner; winner.reserve(calculated.back().size() >> 1);\n\t\tconst auto length = 1 << calculated.size();\n\t\tfor (auto i = 0; i + length <= permutation.size(); ++i) {\n\t\t\tconst auto x = std::min(calculated.back()[i], calculated.back()[i + (length >> 1)]);\n\t\t\tconst auto y = std::max(calculated.back()[i], calculated.back()[i + (length >> 1)]);\n\t\t\tif (str[y - x - 1] == '0') \n\t\t\t\twinner.push_back(x);\n\t\t\telse \n\t\t\t\twinner.push_back(y);\n\t\t}\n\t\tcalculated.push_back(winner);\n\t}\n\tfor (auto i = 0; i < permutation.size(); ++i) {\n\t\tstd::cout << winner(calculated.size() - 1, i, i + permutation.size(), calculated, str) << '\\n';\n\t}\n}\n\n//https://onlinejudge.u-aizu.ac.jp/challenges/sources/VPC/KUPC/3147","accuracy":1,"time_ms":180,"memory_kb":23176,"score_of_the_acc":-0.1705,"final_rank":6},{"submission_id":"aoj_3147_4413011","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nint N;\nint POW[22],dp[20][1 << 20];\nint P[1 << 20];\nstring line;\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < 21; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tcin >> line;\n\n\tfor(int i = 0; i < POW[N]; i++){\n\n\t\tscanf(\"%d\",&P[i]);\n\t\tP[i+POW[N]] = P[i];\n\t}\n\n\tfor(int i = 0; i < 2*POW[N]; i++){\n\n\t\tdp[0][i] = P[i];\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k+POW[i] < 2*POW[N]; k++){\n\n\t\t\tint loc = max(dp[i][k],dp[i][k+POW[i]])-min(dp[i][k],dp[i][k+POW[i]]);\n\n\t\t\tif(line[loc-1] == '1'){\n\n\t\t\t\tdp[i+1][k] = max(dp[i][k],dp[i][k+POW[i]]);\n\n\t\t\t}else{\n\n\t\t\t\tdp[i+1][k] = min(dp[i][k],dp[i][k+POW[i]]);\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < POW[N]; i++){\n\n\t\tprintf(\"%d\\n\",dp[N][i]);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":130,"memory_kb":43476,"score_of_the_acc":-0.2464,"final_rank":13},{"submission_id":"aoj_3147_4361750","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define all(x) (x).begin(),(x).end()\nconst int mod=998244353,MAX=1<<18,INF=1<<30;\nint ans[MAX];\nint N;\nstring win;\n\nvoid DFS(vector<int> &S,int bit,int turn){\n if(turn==N){\n ans[bit]=S[0];\n return;\n }\n \n vector<int> T;\n for(int i=0;i<S.size();i+=2){\n int a=S[i],b=S[i+1];\n if(a>b) swap(a,b);\n if(win[b-a-1]=='1'){\n T.push_back(b);\n }else{\n T.push_back(a);\n }\n }\n \n DFS(T,bit,turn+1);\n \n T.clear();\n \n for(int i=1;i<S.size();i+=2){\n int a=S[i],b=S[(i+1)%int(S.size())];\n if(a>b) swap(a,b);\n if(win[b-a-1]=='1'){\n T.push_back(b);\n }else{\n T.push_back(a);\n }\n }\n \n DFS(T,(bit|(1<<turn)),turn+1);\n}\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n cin>>N;\n cin>>win;\n \n vector<int> S((1<<N));\n for(int i=0;i<(1<<N);i++){\n cin>>S[i];\n S[i]--;\n }\n \n DFS(S,0,0);\n \n for(int i=0;i<(1<<N);i++){\n cout<<ans[i]+1<<endl;\n }\n}","accuracy":1,"time_ms":310,"memory_kb":6300,"score_of_the_acc":-0.1598,"final_rank":3},{"submission_id":"aoj_3147_4356984","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,n) for (int i=a;i<n;i++)\n#define per(i,a,n) for (int i=n-1;i>=a;i--)\n#define pb push_back\n#define mp make_pair\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define SZ(x) ((int)(x).size())\ntypedef vector<int> VI;\ntypedef long long ll;\ntypedef pair<int,int> PII;\ntypedef double db;\nmt19937 mrand(1); \nconst ll mod=998244353;\nint rnd(int x) { return mrand() % x;}\nll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\nll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}\n// head\n\nconst int N=(1<<18)+10;\nchar s[N];\nint p[N],n;\nint win[N][20];\n\nbool gao(int a,int b) {\n\tif (b>a) return s[b-a]=='0';\n\telse return s[a-b]=='1';\n}\nint main() {\n\tscanf(\"%d\",&n);\n\tscanf(\"%s\",s+1);\n\trep(i,0,(1<<n)) {\n\t\tscanf(\"%d\",p+i);\n\t\twin[i][0]=p[i];\n\t}\n\trep(k,0,n) {\n\t\trep(i,0,(1<<n)) {\n\t\t\tint u=win[i][k],v=win[(i+(1<<k))%(1<<n)][k];\n\t\t\tif (gao(u,v)) win[i][k+1]=u; else win[i][k+1]=v;\n\t\t}\n\t}\n\trep(i,0,(1<<n)) printf(\"%d\\n\",win[i][n]);\n}","accuracy":1,"time_ms":100,"memory_kb":24944,"score_of_the_acc":-0.1324,"final_rank":1},{"submission_id":"aoj_3147_4285245","code_snippet":"#pragma GCC optimize (\"O3\")\n#include <iostream>\n#include <iomanip>\n#include <istream>\n#include <ostream>\n#include <sstream>\n#include <iterator>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <deque>\n#include <list>\n#include <stack>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <bitset>\n#include <utility>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <string>\n#include <ctime>\n#include <cctype>\n#include <cstdlib>\n#define IINF 10e8\n#define INF 1<<30\n#define MOD 1000000007\n#define mod 998244353\n#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)\n#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)\n#define Endl endl\n#define fi first\n#define se second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define mmax(x,y)(x>y?x:y)\n#define mmin(x,y)(x<y?x:y)\n#define chmax(x,y) x=mmax(x,y)\n#define chmin(x,y) x=mmin(x,y)\n#define all(x) (x).begin(),(x).end()\n#define siz(x) (ll)(x).size()\n#define PI acos(-1.0)\nusing namespace std;\ntypedef long long int ll;\ntypedef long double ld;\ntypedef pair<int,int>Pin;\ntypedef pair<ll,ll>Pll;\ntemplate<class T> using V=vector<T>;\nlong long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}\nlong long LCM(long long a, long long b) {return a/GCD(a,b)*b;}\nint dx[4]={-1,0,1,0};\nint dy[4]={0,-1,0,1};\nint ddx[8]={-1,0,1,0,1,1,-1,-1};\nint ddy[8]={0,-1,0,1,1,-1,1,-1};\nll cmp(pair<ll,ll>a,pair<ll,ll> b){\n if(a.se!=b.se)\n return a.se<b.se;\n else\n return a.fi<b.fi;\n}\n//----------------------------------------------------------------------\nint n; string s; int p[1 << 19];\nint dp[19][1 << 19];\n//----------------------------------------------------------------------\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n //------------------------------- \n //ll begin_time=clock();\n //-------------------------------\n cin>>n>>s;\n for(ll i=0;i<pow(2,n);i++)cin>>p[i];\n for(ll i=0;i<pow(2,n);i++)p[i+(1<<n)]=p[i];\n //double link\n for(ll i=0;i<pow(2,n+1);i++){\n dp[0][i]=p[i];\n }\n for(ll p=0;p<n;p++){\n for(ll left=0;left<pow(2,n+1);left++){\n int right=left+(1<<p);\n if(right>=pow(2,n+1))continue;\n\n int x=dp[p][left];\n int y=dp[p][right];\n if(x>y)swap(x,y);\n if(s[y-x-1]=='0')dp[p+1][left]=x;\n else dp[p+1][left]=y;\n }\n }\n for(int i=0;i<pow(2,n);i++){\n cout<<dp[n][i]<<endl;\n }\n //------------------------------- \n //ll end_time=clock();cout<<\"time=\"<<end_time-begin_time<<\"ms\"<<endl;\n //-------------------------------\n return 0;\n}\n//----------------------------------------------------------------------","accuracy":1,"time_ms":1240,"memory_kb":43584,"score_of_the_acc":-0.9038,"final_rank":16},{"submission_id":"aoj_3147_4282116","code_snippet":"#include <iostream> // cin, cout, cerr\n#include <algorithm> // minmax, sort, swap\n#include <numeric> // iota\n#include <cstdio> // printf, scanf\n#include <string> // string, stoi, to_string\n#include <vector> // vector\n#include <queue> // queue, priority_queue\n#include <deque> // deque\n#include <map> // key-value pairs sorted by keys\n#include <set> // set\n#include <iomanip> // cout<<setprecision(n)\n#include <functional> // function<void(int)>\n#include <cmath>\n#include <cassert>\n#include <bitset>\n\n#ifdef DEBUG\n#include \"debug.hpp\"\n#else\n#define debug(...)\n#endif\n\n#define int long long // at least int64 > 9*10^18\n#define EL '\\n'\n#define rep(i,n) for(int i = 0; i < (n); i++)\n#define print(i) std::cout << (i) << '\\n'\n#define all(v) (v).begin(), (v).end()\n/* libraries */\n\nsigned main() {\n\tint n;\n\tstd::cin >> n;\n\tstd::string s;\n\tstd::cin >> s;\n\tstd::vector<int> p(1<<n);\n\trep(i,1<<n) std::cin >> p[i];\n\tauto f = [&] (int a, int b) -> int {\n\t\tif(a>b) std::swap(a,b);\n\t\tif(s[b-a-1]=='0') return a;\n\t\treturn b;\n\t};\n\tstd::vector<std::vector<int> > dp(n+1,std::vector<int>(1<<n));\n\tdp[0]=p;\n\trep(i,n) {\n\t\tint dx=1<<i;\n\t\trep(j,1<<n) {\n\t\t\tdp[i+1][j]=f(dp[i][j],dp[i][(j+dx)%(1<<n)]);\n\t\t}\n\t}\n\tdebug(dp);\n\trep(i,1<<n) print(dp[n][i]);\n\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":46492,"score_of_the_acc":-0.274,"final_rank":14},{"submission_id":"aoj_3147_4281618","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define ALL(A) A.begin(),A.end()\n#define RALL(A) A.rbegin(),A.rend()\ntypedef long long LL;\ntypedef pair<int,int> P;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\nconst LL mod=998244353;\nconst LL LINF=1LL<<62;\nconst int INF=1<<30;\nint dx[]={1,0,-1,0,1,-1,1,-1};\nint dy[]={0,1,0,-1,1,-1,-1,1};\n\nvector<int> a;\nstring s;\nvector<vector<int>> dp(18,vector<int> (1<<18,-1));\nint n;\n\nint dfs(int k,int l,int r){\n if(k == n) return a[l];\n if(~dp[k][l]) return dp[k][l];\n int N = 1 << n;\n int p = 1 << (n - k - 1);\n int L = dfs(k + 1, l, (r - p + N)%N), R = dfs(k + 1, (l + p)%N, r);\n if(R < L) swap(L, R);\n int ret;\n if(s[R - L - 1] == '1'){\n ret = R;\n }\n else{\n ret = L;\n }\n return dp[k][l] = ret;\n}\n\n\n\n\nint main(){\n cin >> n;\n int N = 1 << n;\n cin >> s;\n a.resize(N);\n for (int i = 0; i < N; i++) {\n cin >> a[i];\n }\n for (int i = 0; i < N; i++) {\n printf(\"%d\\n\",dfs(0, i, i));\n }\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":23096,"score_of_the_acc":-0.1701,"final_rank":5},{"submission_id":"aoj_3147_4281562","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define ALL(A) A.begin(),A.end()\n#define RALL(A) A.rbegin(),A.rend()\ntypedef long long LL;\ntypedef pair<int,int> P;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\nconst LL mod=998244353;\nconst LL LINF=1LL<<62;\nconst int INF=1<<30;\nint dx[]={1,0,-1,0,1,-1,1,-1};\nint dy[]={0,1,0,-1,1,-1,-1,1};\n\nvector<int> a;\nstring s;\nvector<vector<int>> dp(18,vector<int> (1<<18,-1));\nint n;\n\nLL get_hash(LL l, LL r){\n return l * (1 << n) + r;\n}\n\nint dfs(int k,int l,int r){\n if(k == n) return a[l];\n int ll = l % (1 << n);\n if(~dp[k][ll]) return dp[k][ll];\n int p = 1 << (n - k - 1);\n int L = dfs(k + 1, l, r - p), R = dfs(k + 1, l + p, r);\n if(R < L) swap(L, R);\n int ret;\n if(s[R - L - 1] == '1'){\n ret = R;\n }\n else{\n ret = L;\n }\n return dp[k][ll] = ret;\n}\n\n\n\n\nint main(){\n cin >> n;\n cin >> s;\n a.resize(2 * (1<<n));\n for (int i = 0; i < 1<<n; i++) {\n cin >> a[i];\n a[i+(1<<n)] = a[i];\n }\n for (int i = 0; i < (1<<n); i++) {\n printf(\"%d\\n\",dfs(0, i, i + (1<<n)));\n }\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":24204,"score_of_the_acc":-0.1759,"final_rank":7},{"submission_id":"aoj_3147_4280877","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define ALL(A) A.begin(),A.end()\n#define RALL(A) A.rbegin(),A.rend()\ntypedef long long LL;\ntypedef pair<int,int> P;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\nconst LL mod=998244353;\nconst LL LINF=1LL<<62;\nconst int INF=1<<30;\nint dx[]={1,0,-1,0,1,-1,1,-1};\nint dy[]={0,1,0,-1,1,-1,-1,1};\n\nvector<int> a;\nstring s;\nunordered_map<int, int> dp;\nint n;\n\nLL get_hash(LL l, LL r){\n return l * (1 << n) + r;\n}\n\nint dfs(int k,int l,int r){\n if(k == n) return a[l];\n LL H = get_hash(l % (1 << n), r % (1 << n));\n if(dp.find(H) != dp.end()) return dp[H];\n int p = 1 << (n - k - 1);\n int L = dfs(k + 1, l, r - p), R = dfs(k + 1, l + p, r);\n if(R < L) swap(L, R);\n int ret;\n if(s[R - L - 1] == '1'){\n ret = R;\n }\n else{\n ret = L;\n }\n return dp[H] = ret;\n}\n\n\n\n\nint main(){\n cin >> n;\n cin >> s;\n a.resize(2 * (1<<n));\n for (int i = 0; i < 1<<n; i++) {\n cin >> a[i];\n a[i+(1<<n)] = a[i];\n }\n for (int i = 0; i < (1<<n); i++) {\n printf(\"%d\\n\",dfs(0, i, i + (1<<n)));\n }\n return 0;\n}","accuracy":0.6511627906976745,"time_ms":1730,"memory_kb":153948,"score_of_the_acc":-1.7673,"final_rank":20},{"submission_id":"aoj_3147_4280876","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define ALL(A) A.begin(),A.end()\n#define RALL(A) A.rbegin(),A.rend()\ntypedef long long LL;\ntypedef pair<int,int> P;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\nconst LL mod=998244353;\nconst LL LINF=1LL<<62;\nconst int INF=1<<30;\nint dx[]={1,0,-1,0,1,-1,1,-1};\nint dy[]={0,1,0,-1,1,-1,-1,1};\n\nvector<int> a;\nstring s;\nunordered_map<int, int> dp;\nint n;\n\nint get_hash(int l, int r){\n return l * (1 << n) + r;\n}\n\nint dfs(int k,int l,int r){\n if(k == n) return a[l];\n int H = get_hash(l % (1 << n), r % (1 << n));\n if(dp.find(H) != dp.end()) return dp[H];\n int p = 1 << (n - k - 1);\n int L = dfs(k + 1, l, r - p), R = dfs(k + 1, l + p, r);\n if(R < L) swap(L, R);\n int ret;\n if(s[R - L - 1] == '1'){\n ret = R;\n }\n else{\n ret = L;\n }\n return dp[H] = ret;\n}\n\n\n\n\nint main(){\n cin >> n;\n cin >> s;\n a.resize(2 * (1<<n));\n for (int i = 0; i < 1<<n; i++) {\n cin >> a[i];\n a[i+(1<<n)] = a[i];\n }\n for (int i = 0; i < (1<<n); i++) {\n printf(\"%d\\n\",dfs(0, i, i + (1<<n)));\n }\n return 0;\n}","accuracy":0.6511627906976745,"time_ms":1700,"memory_kb":153952,"score_of_the_acc":-1.7496,"final_rank":19},{"submission_id":"aoj_3147_4280759","code_snippet":"/* Aa^~ kokoro ga pyonpyon suru n jaa^~\n// ZZZXXkXkkkZ!``` ``` ``` ``` ``` ``` ``` ``` ``` ``` ``` ```?Wfpppbpbbpbbpbbbkbkk\n// ppbbbpbbpVr`` `` ` ` ` ` ```` `` ` ` `` ` ` ` ` ` ` ` ` ` dppbbkkkkkkkkkkqkqkk\n// HkqqqqqkkWr`` ` ` ``` ``` `?G, ` ` ``.JC!```` ` ` `` `` ````(Wpbkkkkkkkkqkkkkkqk\n// mmmmmqqqqpr` `` `` ```````.+zT=`` `` 7TO-.```````` `` `` ```(yppbkkkkkkkkkkkkkkk\n// ggmgmmqqqH$ ``````````....````` ` ````````.`````` `` ``````.yfpppbbbbkkkkqqqqqH\n// gmmmmmqqqkW<```` `````...````` .,.` ````....````` ``````` (Wbqqmgmmgmggggggggg\n// qmmmqqqqkkWk.``````````````````` ;:<`` `````.`````````````-_<-?WHHqmmmmmmgmmgggg\n// @@@@@@@gggHH6- ``````````````` `` _ `` ```````````````` ._~~_.`-?Wkqmmmmmmmggg@g\n// @@@@g@gggHY~.-<_- `````````````````````````````````` ._~~(<-``.`.(WHqqqmmggggmmm\n// @@g@gggHH=.`..._<-___..```````````````````````. .-_~~~_(!``-.``.`` OHHWUWHmqHWXW\n// gggggmqK1.``..~.. _<<+-(____.. ```````` ..__~~_((<<!.`.``` .``.`` j0C1XUHmHIdW\n// ggmmqH0!,_``.>`````` _<<;<v<<<++((((((((((<<<<<<~_. (-.``~``.>..``` jOuWHHqHIdH\n// gmmqkW!`(_ J>` `` ` _~<`_~~~~<<<<<<<~~__````````` ?1. ._`(__``` zXWHg@HkXH\n// gHHWS{``(lJ<!``.``.```(:+>`._`````.` <..`` - ``. ` _ ?&._.I`_`````` .XyVfppppW\n// HHHSv``.(X:_..... _..(;+<!.(<..-.....-.-_..+_`..<.`.`..`_IJd} .`..````jqg@@@@@@\n// XHWZ{..<Jk~!.`.. (<.-(+>(_.(1.(_..`.`.`.<_.+<_..<<-..._..-zy>.`_`...```.WH@HHHHH\n// bkWt~.-jCz(_..`.(+<.(;< ._-<=_(<_..-....(_.<1<..(<<.`._..-JUS-._.`...```dHmH9VUH\n// WUUO..(f.(c...__+z<-(+~` _-+<_(><..__.`.(<._.z_.(1;_..__.(C(zT-(..`...``(WHR<+Xk\n// kkkk._(_.->..._(z;:_><.._>_+_<(1>_._<...(v<<.(<.(+z<..-_(Z~_<_j+_..`...`(WHKz1ZW\n// @@gR._+_..~..-<+z<<?<>```_.<_.(+1><_;_..(1_:`.<<??1z--(+Z!..<_.j<....`..(bgHAAQX\n// @@mR.(j:..~.._<z!`.(>~``` ~(_.(+<1><><_.(((_`.<__`.<_.(X>...<_.(<.....`.JUWWWyWW\n// @gmH_(zl..(.._+>```<+_````.~>``(+.<?>>_._(<```(<<``(__<>....<.._<.......dXkkkHHH\n// mmqHl(dk_.(_.-=~`.`.1-..._~-1.``_:`(??<_~(`.--.&_.`.<(;<...._.._<..`..._Xg@@@@@@\n// qHkpk(dX<.(;..j_```.(((JJ&a&-~``````.1<_```-(((e+.-(/`(>...._..(<......(Wmggg@@g\n// HVHbWcz><__+_.(_.(dWWHHH@HHc~````````.+~`` (jHMMMHHHm&.?..._<..(<_..._.(WqqHHmHg\n// 0>vWWkzZwl~<o.__`__~X@@HM@Hb ```.`.``. ```` d@@HHH@@K?76...(<..(<_...(_(ppWWWWHq\n// X0XWHKXXw$<(z<.( `` WHHMHHHH_``````````````.WHHMNMHHH_`(...(<_.(z_..._<(fWVC174W\n// XuXWHHWWz>__+z+.!`..??CZYCOX_`````````````.`~.OvTUZUS_`~.._+?_.(_~_.._zjO=1+~+jy\n// kkkkkkkkX:._<z=1(_`` << ``->``.``.``.``.```` ?<`` (v!`._..(??_.(1._.._=dUOOzzzwX\n// @@@@@@@@H<...1O=v<_...__ -_````````````````.`` `` ~.`` :.~+=?~.(;_(...jdQQQQQkkk\n// H@@@@@@@H~...(==>.~~~~~....`.`````````.`````.`........->.(===~~<<.(...(dg@@@@@@@\n// @@@H@@HHH_.__(=l>~.~~~~~....``.``.``.```..`......~~~~~(<_+=l=~_<.->..~_dqggggg@g\n// @H@@@@MHH_._<(=l>...........```````````````.`...~~~~~~+<(=lz=~((j=z_..~jWqmmgggm\n// @@H@@HHWH_._<(lll-.......```.````.``.`..`````........_z<+llZz~(lOO=<...(VYUUUW9Y\n// @@HMMHWZf>~_=:=llw+.`````````.`.```__~~_``.`````.....(z+llOOz_zllOlz~..~<<1+dW>_\n// MMM#MHHWXl~_=>1ltwOl&.`.``.`````.``````````````.````.(llttwtz(OltwOz<..__zwOwwOz\n// HM#HMHUUI<._1z+ttOZttlt&....``.``.`.````.``...``...(zZtttOktzjttttwlz_._<(Xkkkkk\n// HHHmHSZu:(_~+OztttXtttOZZttO+-..............-(+ztOttwttttd0tOZttttwOl<~.(_dMMHHH\n// rvuuXuuI~~<~(uttttwvOwwwkQQHMMHHHHHHHHHMMMNmgey?OwwwrtttwXOtwttttttXtO-~.((wZyyy\n// HHHHHHK>(~(-(dOrtrrl(QgMHMMMHHHHHHHHHHHHHHHH##HMNkX0rrrrXXrd%`` (Ctwwtz_~.<(Wg@H\n// NNNNNHD(~(zo~zXrrrQdHHMMNMHHHHHHHHHHHHHHHHHHHHHH##HNmyrdKkwZ ` _``-zwrt1~~_<(MNM\n// MMMMM#<<_jwr:(Z4QHHMMHMHHHHHHHHHHHHHHHHHHHHHHHHHHHH###NHSXZ>` ~````.OXtt>~._<?MM\n*/\n#include<bits/stdc++.h>\nusing namespace std;\n#ifndef ONLINE_JUDGE\n#define dbg(x...) do { cout << \"\\033[32;1m \" << #x << \" -> \"; err(x); } while (0)\nvoid err() { cout << \"\\033[39;0m\" << endl; }\ntemplate<template<typename...> class T, typename t, typename... A>\nvoid err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }\ntemplate<typename T, typename... A>\nvoid err(T a, A... x) { cout << a << ' '; err(x...); }\n#else\n#define dbg(...)\n#endif\ntypedef long long ll;\ntypedef pair<int,int> pi;\ntypedef vector<int> vi;\ntemplate<class T> using vc=vector<T>;\ntemplate<class T> using vvc=vc<vc<T>>;\ntemplate<class T> void mkuni(vector<T>&v)\n{\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\nll rand_int(ll l, ll r) //[l, r]\n{\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n return uniform_int_distribution<ll>(l, r)(gen);\n}\ntemplate<class T>\nvoid print(T x,int suc=1)\n{\n cout<<x;\n if(suc==1) cout<<'\\n';\n else cout<<' ';\n}\ntemplate<class T>\nvoid print(const vector<T>&v,int suc=1)\n{\n for(int i=0;i<v.size();i++)\n print(v[i],i==(int)(v.size())-1?suc:2);\n}\nint dp[1<<18][19];\nint main()\n{\n int n;\n cin>>n;\n string s;\n cin>>s;\n int n2=1<<n;\n vi p(n2);\n auto f=[&](int x,int y)\n {\n if(x>y) swap(x,y);\n return s[y-x-1]=='1'?y:x;\n };\n for(int i=0;i<n2;i++) cin>>p[i];\n for(int i=0;i<n2;i++)\n dp[i][0]=p[i];\n for(int j=1;j<=n;j++)\n {\n int len=1<<(j-1);\n for(int i=0;i<n2;i++)\n {\n int r=(i+len)%n2;\n dp[i][j]=f(dp[i][j-1],dp[r][j-1]);\n //dbg(i,j,dp[i][j]);\n }\n }\n for(int i=0;i<n2;i++) cout<<dp[i][n]<<'\\n';\n}","accuracy":1,"time_ms":140,"memory_kb":23792,"score_of_the_acc":-0.1501,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_3147_10215807\",\n \"code_snippet\": \"// AOJ #3147\\n// Tournament 2025.2.13\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() { // 整数の入力\\n\\tint n = 0, c = gc();\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nchar temp[263000];\\nstring Cins() { // 文字列の入力 スペース以下の文字で入力終了\\n char *s = temp;\\n\\tdo *s = gc();\\n\\twhile (*s++ > ' ');\\n\\t*(s-1) = 0;\\n string input(temp); // 文字配列からstringを作成\\n return input;\\n}\\n\\nvoid Cout(int n) { // 整数の表示（出力）\\n\\tchar b[30];\\n\\tif (!n) pc('0');\\n\\telse {\\n\\t\\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\\n\\t\\twhile (i--) pc(b[i]);\\n\\t}\\n\\tpc('\\\\n');\\n}\\n\\nstring S;\\n \\ninline int match(int a, int b) {\\n if(a > b) swap(a, b);\\n int diff = b - a;\\n return (S[diff - 1] == '0') ? a : b;\\n}\\n \\nint main(){\\n int N = Cin(), L = 1 << N;\\n S = Cins();\\n \\n vector<int> P(L);\\n for (int i = 0; i < L; i++) P[i] = Cin();\\n \\n vector<int> B(2 * L);\\n for (int i = 0; i < L; i++){\\n B[i] = P[i];\\n B[i+L] = P[i];\\n }\\n \\n vector<vector<int>> dp;\\n dp.push_back(B);\\n for (int m = 1; m <= N; m++){\\n int segLen = 1 << m;\\n int half = 1 << (m-1);\\n int prevSize = dp[m-1].size();\\n int newSize = prevSize - half;\\n vector<int> cur(newSize);\\n for (int i = 0; i < newSize; i++){\\n cur[i] = match(dp[m-1][i], dp[m-1][i + half]);\\n }\\n dp.push_back(move(cur));\\n }\\n for (int k = 0; k < L; k++) Cout(dp[N][k]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 43592,\n \"score_of_the_acc\": -0.1938,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3147_10215797\",\n \"code_snippet\": \"// AOJ #3147\\n// Tournament 2025.2.13\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n \\nstring S;\\n \\ninline int match(int a, int b) {\\n if(a > b) swap(a, b);\\n int diff = b - a;\\n return (S[diff - 1] == '0') ? a : b;\\n}\\n \\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n \\n int N;\\n cin >> N;\\n int L = 1 << N;\\n cin >> S;\\n \\n vector<int> P(L);\\n for (int i = 0; i < L; i++) cin >> P[i];\\n \\n vector<int> B(2 * L);\\n for (int i = 0; i < L; i++){\\n B[i] = P[i];\\n B[i+L] = P[i];\\n }\\n \\n vector<vector<int>> dp;\\n dp.push_back(B);\\n for (int m = 1; m <= N; m++){\\n int segLen = 1 << m;\\n int half = 1 << (m-1);\\n int prevSize = dp[m-1].size();\\n int newSize = prevSize - half;\\n vector<int> cur(newSize);\\n for (int i = 0; i < newSize; i++){\\n cur[i] = match(dp[m-1][i], dp[m-1][i + half]);\\n }\\n dp.push_back(move(cur));\\n }\\n \\n for (int k = 0; k < L; k++)\\n cout << dp[N][k] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 43448,\n \"score_of_the_acc\": -0.3055,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3147_9496069\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nstruct increment_impl {\\n template <class T>\\n const increment_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) ++x;\\n return *this;\\n }\\n} Inc;\\nstruct decrement_impl {\\n template <class T>\\n const decrement_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) --x;\\n return *this;\\n }\\n} Dec;\\nstruct sort_impl {\\n template <class T>\\n const sort_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n return *this;\\n }\\n} Sort;\\nstruct unique_impl {\\n template <class T>\\n const unique_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n v.erase(std::unique(v.begin(), v.end()), v.end());\\n return *this;\\n }\\n} Uniq;\\nint main(void) {\\n int n;\\n cin >> n;\\n int k = 1 << n;\\n string s;\\n cin >> s;\\n vector<int> a(k);\\n cin >> a;\\n vector dp(n, vector(k, -1));\\n auto dfs = [&](auto self, int l, int p) -> int {\\n int li = l % k;\\n if (p == -1) {\\n return a[li];\\n }\\n if (dp[p][li] != -1)\\n return dp[p][li];\\n int m = (l + (1 << p)) % k;\\n int le = self(self, l, p - 1);\\n int re = self(self, m, p - 1);\\n if (le > re)\\n swap(le, re);\\n int d = re - le - 1;\\n if (s[d] == '0')\\n return dp[p][li] = le;\\n else\\n return dp[p][li] = re;\\n };\\n rep (i, k) co(dfs(dfs, i, n - 1));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 23944,\n \"score_of_the_acc\": -0.1686,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3147_9496067\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nstruct increment_impl {\\n template <class T>\\n const increment_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) ++x;\\n return *this;\\n }\\n} Inc;\\nstruct decrement_impl {\\n template <class T>\\n const decrement_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) --x;\\n return *this;\\n }\\n} Dec;\\nstruct sort_impl {\\n template <class T>\\n const sort_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n return *this;\\n }\\n} Sort;\\nstruct unique_impl {\\n template <class T>\\n const unique_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n v.erase(std::unique(v.begin(), v.end()), v.end());\\n return *this;\\n }\\n} Uniq;\\nint main(void) {\\n int n;\\n cin >> n;\\n int k = 1 << n;\\n string s;\\n cin >> s;\\n vector<int> a(k);\\n cin >> a;\\n vector dp(k, vector(n, -1));\\n auto dfs = [&](auto self, int l, int p) -> int {\\n int li = l % k;\\n if (p == -1) {\\n return a[li];\\n }\\n if (dp[li][p] != -1)\\n return dp[li][p];\\n int m = (l + (1 << p)) % k;\\n int le = self(self, l, p - 1);\\n int re = self(self, m, p - 1);\\n if (le > re)\\n swap(le, re);\\n int d = re - le - 1;\\n if (s[d] == '0')\\n return dp[li][p] = le;\\n else\\n return dp[li][p] = re;\\n };\\n rep (i, k) co(dfs(dfs, i, n - 1));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 31316,\n \"score_of_the_acc\": -0.2069,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3147_9496065\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nstruct increment_impl {\\n template <class T>\\n const increment_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) ++x;\\n return *this;\\n }\\n} Inc;\\nstruct decrement_impl {\\n template <class T>\\n const decrement_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) --x;\\n return *this;\\n }\\n} Dec;\\nstruct sort_impl {\\n template <class T>\\n const sort_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n return *this;\\n }\\n} Sort;\\nstruct unique_impl {\\n template <class T>\\n const unique_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n v.erase(std::unique(v.begin(), v.end()), v.end());\\n return *this;\\n }\\n} Uniq;\\nint main(void) {\\n int n;\\n cin >> n;\\n int k = 1 << n;\\n string s;\\n cin >> s;\\n vector<int> a(k);\\n cin >> a;\\n vector dp(k, vector(n + 1, -1));\\n auto dfs = [&](auto self, int l, int p) -> int {\\n int li = l % k;\\n if (p == 0) {\\n return a[li];\\n }\\n if (dp[li][p] != -1)\\n return dp[li][p];\\n int m = (l + (1 << (p - 1))) % k;\\n int le = self(self, l, p - 1);\\n int re = self(self, m, p - 1);\\n if (le > re)\\n swap(le, re);\\n int d = re - le - 1;\\n if (s[d] == '0')\\n return dp[li][p] = le;\\n else\\n return dp[li][p] = re;\\n };\\n rep (i, k) co(dfs(dfs, i, n));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 35348,\n \"score_of_the_acc\": -0.2338,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3147_9496049\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nstruct increment_impl {\\n template <class T>\\n const increment_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) ++x;\\n return *this;\\n }\\n} Inc;\\nstruct decrement_impl {\\n template <class T>\\n const decrement_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) --x;\\n return *this;\\n }\\n} Dec;\\nstruct sort_impl {\\n template <class T>\\n const sort_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n return *this;\\n }\\n} Sort;\\nstruct unique_impl {\\n template <class T>\\n const unique_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n v.erase(std::unique(v.begin(), v.end()), v.end());\\n return *this;\\n }\\n} Uniq;\\nint main(void) {\\n int n;\\n cin >> n;\\n n = 1 << n;\\n string s;\\n cin >> s;\\n vector<int> a(n);\\n cin >> a;\\n Dec >> a;\\n unordered_map<ll, int> mp;\\n auto dfs = [&](auto self, int l, int r) -> int {\\n ll li = l % n;\\n if (r - l == 1) {\\n return a[li];\\n }\\n int ri = r % n;\\n if (mp.count(li * n + ri))\\n return mp[li * n + ri];\\n int m = (l + r) / 2;\\n int p = self(self, l, m);\\n int q = self(self, m, r);\\n if (p > q)\\n swap(p, q);\\n int d = abs(p - q) - 1;\\n if (s[d] == '0')\\n return mp[li * n + ri] = p;\\n else\\n return mp[li * n + ri] = q;\\n };\\n rep (i, n) co(dfs(dfs, i, n + i) + 1);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1120,\n \"memory_kb\": 198728,\n \"score_of_the_acc\": -1.6391,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3147_9496048\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nstruct increment_impl {\\n template <class T>\\n const increment_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) ++x;\\n return *this;\\n }\\n} Inc;\\nstruct decrement_impl {\\n template <class T>\\n const decrement_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) --x;\\n return *this;\\n }\\n} Dec;\\nstruct sort_impl {\\n template <class T>\\n const sort_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n return *this;\\n }\\n} Sort;\\nstruct unique_impl {\\n template <class T>\\n const unique_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n v.erase(std::unique(v.begin(), v.end()), v.end());\\n return *this;\\n }\\n} Uniq;\\nint main(void) {\\n int n;\\n cin >> n;\\n n = 1 << n;\\n string s;\\n cin >> s;\\n vector<int> a(n);\\n cin >> a;\\n Dec >> a;\\n unordered_map<ll, int> mp;\\n auto dfs = [&](auto self, int l, int r) -> int {\\n int ll = l % n;\\n if (r - l == 1) {\\n return a[ll];\\n }\\n int rr = r % n;\\n if (mp.count(ll * n + rr))\\n return mp[ll * n + rr];\\n int m = (l + r) / 2;\\n int p = self(self, l, m);\\n int q = self(self, m, r);\\n if (p > q)\\n swap(p, q);\\n int d = abs(p - q) - 1;\\n if (s[d] == '0')\\n return mp[ll * n + rr] = p;\\n else\\n return mp[ll * n + rr] = q;\\n };\\n rep (i, n) co(dfs(dfs, i, n + i) + 1);\\n return 0;\\n}\",\n \"accuracy\": 0.6511627906976745,\n \"time_ms\": 1050,\n \"memory_kb\": 166008,\n \"score_of_the_acc\": -1.4276,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3147_9154291\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\nint main(){\\n int N;\\n cin >> N;\\n int n=pow(2,N);\\n string s;\\n cin >> s;\\n vector<bool> r(n);\\n for(int i=0;i<n-1;i++){\\n r[i+1]=(s[i]=='1');\\n }\\n vector<int> p(n);\\n for(int &x:p) cin >> x;\\n \\n vector w(N,vector<int>(n));\\n for(int i=0;i<n/2;i++){\\n int i1=i*2,i2=i1+1;\\n if(r[abs(p[i1]-p[i2])]){\\n w[0][i]=(p[i1]>p[i2] ? p[i1] : p[i2]);\\n }else{\\n w[0][i]=(p[i1]<p[i2] ? p[i1] : p[i2]);\\n }\\n i1=((i2+1)%n);\\n if(r[abs(p[i1]-p[i2])]){\\n w[0][i+n/2]=(p[i1]>p[i2] ? p[i1] : p[i2]);\\n }else{\\n w[0][i+n/2]=(p[i1]<p[i2] ? p[i1] : p[i2]);\\n }\\n \\n }\\n if(N==1){\\n cout << w[0][0] << endl;\\n cout << w[0][1] << endl;\\n return 0;\\n }\\n \\n/* for(int i=0;i<n;i++){\\n cout << w[0][i] << \\\" \\\";\\n }\\n cout << endl;\\n*/\\n int n1=n,n2,nn=1;\\n for(int j=1;j<N;j++){\\n n1/=2;n2=n1/2;nn*=2;\\n for(int k=0;k<2;k++){\\n int k1=k*n/2;\\n for(int ii=0;ii<nn;ii++){\\n int ii1=n1*ii,ii2=n2*ii+k1;\\n for(int i=0;i<n2;i++){\\n int i1=i*2+k,i2=(i1+1)%n1;\\n i1+=ii1;i2+=ii1;\\n if(r[abs(w[j-1][i1]-w[j-1][i2])]){\\n w[j][i+ii2]=(w[j-1][i1]>w[j-1][i2] ? w[j-1][i1] : w[j-1][i2]);\\n }else{\\n w[j][i+ii2]=(w[j-1][i1]<w[j-1][i2] ? w[j-1][i1] : w[j-1][i2]);\\n }\\n //cout << j << \\\" \\\" << i+ii2 << \\\" \\\" << ii1 << \\\" \\\" << i1 << \\\" \\\" << i2 << endl;\\n }\\n }\\n }\\n }\\n for(int i=0;i<n;i++) cout << w[N-1][i] << endl;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 24316,\n \"score_of_the_acc\": -0.2356,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3147_4885512\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)\\n#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)\\n#define REP(i, n) rep(i, 0, n)\\n#define REP2(i, n) rep2(i, 0, n)\\n#define all(hoge) (hoge).begin(), (hoge).end()\\n#define en '\\\\n'\\nusing ll = long long;\\nusing ull = unsigned long long;\\ntemplate <class T>\\nusing vec = vector<T>;\\ntemplate <class T>\\nusing vvec = vector<vec<T>>;\\ntypedef pair<ll, ll> P;\\nusing tp = tuple<ll, ll, ll>;\\nconstexpr long long INF = 1LL << 60;\\nconstexpr int INF_INT = 1 << 25;\\n//constexpr long long MOD = (ll)1e9 + 7;\\nconstexpr long long MOD = 998244353LL;\\nusing ld = long double;\\nstatic const ld pi = 3.141592653589793L;\\ntypedef vector<ll> Array;\\ntypedef vector<Array> Matrix;\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n//グラフ関連\\nstruct Edge {\\n ll to, cap, rev;\\n Edge(ll _to, ll _cap, ll _rev) {\\n to = _to;\\n cap = _cap;\\n rev = _rev;\\n }\\n};\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {\\n G[from].push_back(Edge(to, cap, (ll)G[to].size()));\\n if(revFlag)\\n G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\\n}\\n\\nint dp[1LL << 18][20];\\n\\nvoid solve() {\\n ll n;\\n cin >> n;\\n ll m = 1LL << n;\\n string s;\\n cin >> s;\\n vec<int> p(m);\\n REP(i, m) {\\n cin >> p[i];\\n }\\n\\n auto check = [&](auto &&self, int i, int x) -> int {\\n if(dp[i][x] != 0)\\n return dp[i][x];\\n if(x == 0)\\n return dp[i][x] = p[i];\\n int L = self(self, i, x - 1);\\n int R = self(self, (i + (1 << (x - 1))) % m, x - 1);\\n return dp[i][x] = s[abs(R - L) - 1] == '1' ? max(R, L) : min(R, L);\\n };\\n REP(i, m) {\\n cout << check(check, i, n) << en;\\n }\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout.tie(0);\\n /*\\n ll t;\\n cin >> t;\\n while(t--)*/\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 25088,\n \"score_of_the_acc\": -0.1805,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3147_4518342\",\n \"code_snippet\": \"#include <iostream>\\n#include <utility>\\n#include <tuple>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <algorithm>\\n#include <functional>\\n#include <climits>\\n#include <numeric>\\n#include <queue>\\n#include <cmath>\\n#include <iomanip>\\n#include <array>\\n#include <string>\\nint winner(const int depth, int from, int until, const std::vector<std::vector<int>>& calculated, const std::string& state) {\\n\\tconst auto length = 1 << depth;\\n\\tif (from + length == until && (calculated.front().size() <= from || until <= calculated.front().size())) \\n\\t\\treturn calculated.front().size() <= from ? calculated[depth][from - calculated.front().size()] : calculated[depth][from];\\n\\tconst auto a = winner(depth - 1, from, from + (length >> 1), calculated, state);\\n\\tconst auto b = winner(depth - 1, from + (length >> 1), until, calculated, state);\\n\\tconst auto x = std::min(a, b);\\n\\tconst auto y = std::max(a, b);\\n\\treturn state[y - x - 1] == '0' ? x : y;\\n}\\nint main() {\\n\\tint n; std::cin >> n;\\n\\tstd::string str; std::cin >> str;\\n\\tstd::vector<int> permutation(1 << n);\\n\\tfor (auto& p : permutation) std::cin >> p;\\n\\tstd::vector<std::vector<int>> calculated;\\n\\tcalculated.push_back(permutation);\\n\\tfor (auto d = 0; d < n; ++d) {\\n\\t\\tstd::vector<int> winner; winner.reserve(calculated.back().size() >> 1);\\n\\t\\tconst auto length = 1 << calculated.size();\\n\\t\\tfor (auto i = 0; i + length <= permutation.size(); ++i) {\\n\\t\\t\\tconst auto x = std::min(calculated.back()[i], calculated.back()[i + (length >> 1)]);\\n\\t\\t\\tconst auto y = std::max(calculated.back()[i], calculated.back()[i + (length >> 1)]);\\n\\t\\t\\tif (str[y - x - 1] == '0') \\n\\t\\t\\t\\twinner.push_back(x);\\n\\t\\t\\telse \\n\\t\\t\\t\\twinner.push_back(y);\\n\\t\\t}\\n\\t\\tcalculated.push_back(winner);\\n\\t}\\n\\tfor (auto i = 0; i < permutation.size(); ++i) {\\n\\t\\tstd::cout << winner(calculated.size() - 1, i, i + permutation.size(), calculated, str) << '\\\\n';\\n\\t}\\n}\\n\\n//https://onlinejudge.u-aizu.ac.jp/challenges/sources/VPC/KUPC/3147\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 23176,\n \"score_of_the_acc\": -0.1705,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3147_4413011\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nint N;\\nint POW[22],dp[20][1 << 20];\\nint P[1 << 20];\\nstring line;\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i < 21; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tcin >> line;\\n\\n\\tfor(int i = 0; i < POW[N]; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&P[i]);\\n\\t\\tP[i+POW[N]] = P[i];\\n\\t}\\n\\n\\tfor(int i = 0; i < 2*POW[N]; i++){\\n\\n\\t\\tdp[0][i] = P[i];\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k+POW[i] < 2*POW[N]; k++){\\n\\n\\t\\t\\tint loc = max(dp[i][k],dp[i][k+POW[i]])-min(dp[i][k],dp[i][k+POW[i]]);\\n\\n\\t\\t\\tif(line[loc-1] == '1'){\\n\\n\\t\\t\\t\\tdp[i+1][k] = max(dp[i][k],dp[i][k+POW[i]]);\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tdp[i+1][k] = min(dp[i][k],dp[i][k+POW[i]]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < POW[N]; i++){\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\",dp[N][i]);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 43476,\n \"score_of_the_acc\": -0.2464,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3147_4361750\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define all(x) (x).begin(),(x).end()\\nconst int mod=998244353,MAX=1<<18,INF=1<<30;\\nint ans[MAX];\\nint N;\\nstring win;\\n\\nvoid DFS(vector<int> &S,int bit,int turn){\\n if(turn==N){\\n ans[bit]=S[0];\\n return;\\n }\\n \\n vector<int> T;\\n for(int i=0;i<S.size();i+=2){\\n int a=S[i],b=S[i+1];\\n if(a>b) swap(a,b);\\n if(win[b-a-1]=='1'){\\n T.push_back(b);\\n }else{\\n T.push_back(a);\\n }\\n }\\n \\n DFS(T,bit,turn+1);\\n \\n T.clear();\\n \\n for(int i=1;i<S.size();i+=2){\\n int a=S[i],b=S[(i+1)%int(S.size())];\\n if(a>b) swap(a,b);\\n if(win[b-a-1]=='1'){\\n T.push_back(b);\\n }else{\\n T.push_back(a);\\n }\\n }\\n \\n DFS(T,(bit|(1<<turn)),turn+1);\\n}\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n cin>>N;\\n cin>>win;\\n \\n vector<int> S((1<<N));\\n for(int i=0;i<(1<<N);i++){\\n cin>>S[i];\\n S[i]--;\\n }\\n \\n DFS(S,0,0);\\n \\n for(int i=0;i<(1<<N);i++){\\n cout<<ans[i]+1<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 6300,\n \"score_of_the_acc\": -0.1598,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3147_4356984\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,a,n) for (int i=a;i<n;i++)\\n#define per(i,a,n) for (int i=n-1;i>=a;i--)\\n#define pb push_back\\n#define mp make_pair\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define SZ(x) ((int)(x).size())\\ntypedef vector<int> VI;\\ntypedef long long ll;\\ntypedef pair<int,int> PII;\\ntypedef double db;\\nmt19937 mrand(1); \\nconst ll mod=998244353;\\nint rnd(int x) { return mrand() % x;}\\nll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\\nll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}\\n// head\\n\\nconst int N=(1<<18)+10;\\nchar s[N];\\nint p[N],n;\\nint win[N][20];\\n\\nbool gao(int a,int b) {\\n\\tif (b>a) return s[b-a]=='0';\\n\\telse return s[a-b]=='1';\\n}\\nint main() {\\n\\tscanf(\\\"%d\\\",&n);\\n\\tscanf(\\\"%s\\\",s+1);\\n\\trep(i,0,(1<<n)) {\\n\\t\\tscanf(\\\"%d\\\",p+i);\\n\\t\\twin[i][0]=p[i];\\n\\t}\\n\\trep(k,0,n) {\\n\\t\\trep(i,0,(1<<n)) {\\n\\t\\t\\tint u=win[i][k],v=win[(i+(1<<k))%(1<<n)][k];\\n\\t\\t\\tif (gao(u,v)) win[i][k+1]=u; else win[i][k+1]=v;\\n\\t\\t}\\n\\t}\\n\\trep(i,0,(1<<n)) printf(\\\"%d\\\\n\\\",win[i][n]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 24944,\n \"score_of_the_acc\": -0.1324,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3147_4285245\",\n \"code_snippet\": \"#pragma GCC optimize (\\\"O3\\\")\\n#include <iostream>\\n#include <iomanip>\\n#include <istream>\\n#include <ostream>\\n#include <sstream>\\n#include <iterator>\\n#include <vector>\\n#include <algorithm>\\n#include <queue>\\n#include <deque>\\n#include <list>\\n#include <stack>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <bitset>\\n#include <utility>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <string>\\n#include <ctime>\\n#include <cctype>\\n#include <cstdlib>\\n#define IINF 10e8\\n#define INF 1<<30\\n#define MOD 1000000007\\n#define mod 998244353\\n#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)\\n#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)\\n#define Endl endl\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define mp make_pair\\n#define eb emplace_back\\n#define mmax(x,y)(x>y?x:y)\\n#define mmin(x,y)(x<y?x:y)\\n#define chmax(x,y) x=mmax(x,y)\\n#define chmin(x,y) x=mmin(x,y)\\n#define all(x) (x).begin(),(x).end()\\n#define siz(x) (ll)(x).size()\\n#define PI acos(-1.0)\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef long double ld;\\ntypedef pair<int,int>Pin;\\ntypedef pair<ll,ll>Pll;\\ntemplate<class T> using V=vector<T>;\\nlong long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}\\nlong long LCM(long long a, long long b) {return a/GCD(a,b)*b;}\\nint dx[4]={-1,0,1,0};\\nint dy[4]={0,-1,0,1};\\nint ddx[8]={-1,0,1,0,1,1,-1,-1};\\nint ddy[8]={0,-1,0,1,1,-1,1,-1};\\nll cmp(pair<ll,ll>a,pair<ll,ll> b){\\n if(a.se!=b.se)\\n return a.se<b.se;\\n else\\n return a.fi<b.fi;\\n}\\n//----------------------------------------------------------------------\\nint n; string s; int p[1 << 19];\\nint dp[19][1 << 19];\\n//----------------------------------------------------------------------\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n //------------------------------- \\n //ll begin_time=clock();\\n //-------------------------------\\n cin>>n>>s;\\n for(ll i=0;i<pow(2,n);i++)cin>>p[i];\\n for(ll i=0;i<pow(2,n);i++)p[i+(1<<n)]=p[i];\\n //double link\\n for(ll i=0;i<pow(2,n+1);i++){\\n dp[0][i]=p[i];\\n }\\n for(ll p=0;p<n;p++){\\n for(ll left=0;left<pow(2,n+1);left++){\\n int right=left+(1<<p);\\n if(right>=pow(2,n+1))continue;\\n\\n int x=dp[p][left];\\n int y=dp[p][right];\\n if(x>y)swap(x,y);\\n if(s[y-x-1]=='0')dp[p+1][left]=x;\\n else dp[p+1][left]=y;\\n }\\n }\\n for(int i=0;i<pow(2,n);i++){\\n cout<<dp[n][i]<<endl;\\n }\\n //------------------------------- \\n //ll end_time=clock();cout<<\\\"time=\\\"<<end_time-begin_time<<\\\"ms\\\"<<endl;\\n //-------------------------------\\n return 0;\\n}\\n//----------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 1240,\n \"memory_kb\": 43584,\n \"score_of_the_acc\": -0.9038,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3147_4282116\",\n \"code_snippet\": \"#include <iostream> // cin, cout, cerr\\n#include <algorithm> // minmax, sort, swap\\n#include <numeric> // iota\\n#include <cstdio> // printf, scanf\\n#include <string> // string, stoi, to_string\\n#include <vector> // vector\\n#include <queue> // queue, priority_queue\\n#include <deque> // deque\\n#include <map> // key-value pairs sorted by keys\\n#include <set> // set\\n#include <iomanip> // cout<<setprecision(n)\\n#include <functional> // function<void(int)>\\n#include <cmath>\\n#include <cassert>\\n#include <bitset>\\n\\n#ifdef DEBUG\\n#include \\\"debug.hpp\\\"\\n#else\\n#define debug(...)\\n#endif\\n\\n#define int long long // at least int64 > 9*10^18\\n#define EL '\\\\n'\\n#define rep(i,n) for(int i = 0; i < (n); i++)\\n#define print(i) std::cout << (i) << '\\\\n'\\n#define all(v) (v).begin(), (v).end()\\n/* libraries */\\n\\nsigned main() {\\n\\tint n;\\n\\tstd::cin >> n;\\n\\tstd::string s;\\n\\tstd::cin >> s;\\n\\tstd::vector<int> p(1<<n);\\n\\trep(i,1<<n) std::cin >> p[i];\\n\\tauto f = [&] (int a, int b) -> int {\\n\\t\\tif(a>b) std::swap(a,b);\\n\\t\\tif(s[b-a-1]=='0') return a;\\n\\t\\treturn b;\\n\\t};\\n\\tstd::vector<std::vector<int> > dp(n+1,std::vector<int>(1<<n));\\n\\tdp[0]=p;\\n\\trep(i,n) {\\n\\t\\tint dx=1<<i;\\n\\t\\trep(j,1<<n) {\\n\\t\\t\\tdp[i+1][j]=f(dp[i][j],dp[i][(j+dx)%(1<<n)]);\\n\\t\\t}\\n\\t}\\n\\tdebug(dp);\\n\\trep(i,1<<n) print(dp[n][i]);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 46492,\n \"score_of_the_acc\": -0.274,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3147_4281618\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define mp make_pair\\n#define eb emplace_back\\n#define ALL(A) A.begin(),A.end()\\n#define RALL(A) A.rbegin(),A.rend()\\ntypedef long long LL;\\ntypedef pair<int,int> P;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\\nconst LL mod=998244353;\\nconst LL LINF=1LL<<62;\\nconst int INF=1<<30;\\nint dx[]={1,0,-1,0,1,-1,1,-1};\\nint dy[]={0,1,0,-1,1,-1,-1,1};\\n\\nvector<int> a;\\nstring s;\\nvector<vector<int>> dp(18,vector<int> (1<<18,-1));\\nint n;\\n\\nint dfs(int k,int l,int r){\\n if(k == n) return a[l];\\n if(~dp[k][l]) return dp[k][l];\\n int N = 1 << n;\\n int p = 1 << (n - k - 1);\\n int L = dfs(k + 1, l, (r - p + N)%N), R = dfs(k + 1, (l + p)%N, r);\\n if(R < L) swap(L, R);\\n int ret;\\n if(s[R - L - 1] == '1'){\\n ret = R;\\n }\\n else{\\n ret = L;\\n }\\n return dp[k][l] = ret;\\n}\\n\\n\\n\\n\\nint main(){\\n cin >> n;\\n int N = 1 << n;\\n cin >> s;\\n a.resize(N);\\n for (int i = 0; i < N; i++) {\\n cin >> a[i];\\n }\\n for (int i = 0; i < N; i++) {\\n printf(\\\"%d\\\\n\\\",dfs(0, i, i));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 23096,\n \"score_of_the_acc\": -0.1701,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3147_4281562\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define mp make_pair\\n#define eb emplace_back\\n#define ALL(A) A.begin(),A.end()\\n#define RALL(A) A.rbegin(),A.rend()\\ntypedef long long LL;\\ntypedef pair<int,int> P;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\\nconst LL mod=998244353;\\nconst LL LINF=1LL<<62;\\nconst int INF=1<<30;\\nint dx[]={1,0,-1,0,1,-1,1,-1};\\nint dy[]={0,1,0,-1,1,-1,-1,1};\\n\\nvector<int> a;\\nstring s;\\nvector<vector<int>> dp(18,vector<int> (1<<18,-1));\\nint n;\\n\\nLL get_hash(LL l, LL r){\\n return l * (1 << n) + r;\\n}\\n\\nint dfs(int k,int l,int r){\\n if(k == n) return a[l];\\n int ll = l % (1 << n);\\n if(~dp[k][ll]) return dp[k][ll];\\n int p = 1 << (n - k - 1);\\n int L = dfs(k + 1, l, r - p), R = dfs(k + 1, l + p, r);\\n if(R < L) swap(L, R);\\n int ret;\\n if(s[R - L - 1] == '1'){\\n ret = R;\\n }\\n else{\\n ret = L;\\n }\\n return dp[k][ll] = ret;\\n}\\n\\n\\n\\n\\nint main(){\\n cin >> n;\\n cin >> s;\\n a.resize(2 * (1<<n));\\n for (int i = 0; i < 1<<n; i++) {\\n cin >> a[i];\\n a[i+(1<<n)] = a[i];\\n }\\n for (int i = 0; i < (1<<n); i++) {\\n printf(\\\"%d\\\\n\\\",dfs(0, i, i + (1<<n)));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 24204,\n \"score_of_the_acc\": -0.1759,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3147_4280877\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define mp make_pair\\n#define eb emplace_back\\n#define ALL(A) A.begin(),A.end()\\n#define RALL(A) A.rbegin(),A.rend()\\ntypedef long long LL;\\ntypedef pair<int,int> P;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\\nconst LL mod=998244353;\\nconst LL LINF=1LL<<62;\\nconst int INF=1<<30;\\nint dx[]={1,0,-1,0,1,-1,1,-1};\\nint dy[]={0,1,0,-1,1,-1,-1,1};\\n\\nvector<int> a;\\nstring s;\\nunordered_map<int, int> dp;\\nint n;\\n\\nLL get_hash(LL l, LL r){\\n return l * (1 << n) + r;\\n}\\n\\nint dfs(int k,int l,int r){\\n if(k == n) return a[l];\\n LL H = get_hash(l % (1 << n), r % (1 << n));\\n if(dp.find(H) != dp.end()) return dp[H];\\n int p = 1 << (n - k - 1);\\n int L = dfs(k + 1, l, r - p), R = dfs(k + 1, l + p, r);\\n if(R < L) swap(L, R);\\n int ret;\\n if(s[R - L - 1] == '1'){\\n ret = R;\\n }\\n else{\\n ret = L;\\n }\\n return dp[H] = ret;\\n}\\n\\n\\n\\n\\nint main(){\\n cin >> n;\\n cin >> s;\\n a.resize(2 * (1<<n));\\n for (int i = 0; i < 1<<n; i++) {\\n cin >> a[i];\\n a[i+(1<<n)] = a[i];\\n }\\n for (int i = 0; i < (1<<n); i++) {\\n printf(\\\"%d\\\\n\\\",dfs(0, i, i + (1<<n)));\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.6511627906976745,\n \"time_ms\": 1730,\n \"memory_kb\": 153948,\n \"score_of_the_acc\": -1.7673,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3147_4280876\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define mp make_pair\\n#define eb emplace_back\\n#define ALL(A) A.begin(),A.end()\\n#define RALL(A) A.rbegin(),A.rend()\\ntypedef long long LL;\\ntypedef pair<int,int> P;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\\nconst LL mod=998244353;\\nconst LL LINF=1LL<<62;\\nconst int INF=1<<30;\\nint dx[]={1,0,-1,0,1,-1,1,-1};\\nint dy[]={0,1,0,-1,1,-1,-1,1};\\n\\nvector<int> a;\\nstring s;\\nunordered_map<int, int> dp;\\nint n;\\n\\nint get_hash(int l, int r){\\n return l * (1 << n) + r;\\n}\\n\\nint dfs(int k,int l,int r){\\n if(k == n) return a[l];\\n int H = get_hash(l % (1 << n), r % (1 << n));\\n if(dp.find(H) != dp.end()) return dp[H];\\n int p = 1 << (n - k - 1);\\n int L = dfs(k + 1, l, r - p), R = dfs(k + 1, l + p, r);\\n if(R < L) swap(L, R);\\n int ret;\\n if(s[R - L - 1] == '1'){\\n ret = R;\\n }\\n else{\\n ret = L;\\n }\\n return dp[H] = ret;\\n}\\n\\n\\n\\n\\nint main(){\\n cin >> n;\\n cin >> s;\\n a.resize(2 * (1<<n));\\n for (int i = 0; i < 1<<n; i++) {\\n cin >> a[i];\\n a[i+(1<<n)] = a[i];\\n }\\n for (int i = 0; i < (1<<n); i++) {\\n printf(\\\"%d\\\\n\\\",dfs(0, i, i + (1<<n)));\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.6511627906976745,\n \"time_ms\": 1700,\n \"memory_kb\": 153952,\n \"score_of_the_acc\": -1.7496,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3147_4280759\",\n \"code_snippet\": \"/* Aa^~ kokoro ga pyonpyon suru n jaa^~\\n// ZZZXXkXkkkZ!``` ``` ``` ``` ``` ``` ``` ``` ``` ``` ``` ```?Wfpppbpbbpbbpbbbkbkk\\n// ppbbbpbbpVr`` `` ` ` ` ` ```` `` ` ` `` ` ` ` ` ` ` ` ` ` dppbbkkkkkkkkkkqkqkk\\n// HkqqqqqkkWr`` ` ` ``` ``` `?G, ` ` ``.JC!```` ` ` `` `` ````(Wpbkkkkkkkkqkkkkkqk\\n// mmmmmqqqqpr` `` `` ```````.+zT=`` `` 7TO-.```````` `` `` ```(yppbkkkkkkkkkkkkkkk\\n// ggmgmmqqqH$ ``````````....````` ` ````````.`````` `` ``````.yfpppbbbbkkkkqqqqqH\\n// gmmmmmqqqkW<```` `````...````` .,.` ````....````` ``````` (Wbqqmgmmgmggggggggg\\n// qmmmqqqqkkWk.``````````````````` ;:<`` `````.`````````````-_<-?WHHqmmmmmmgmmgggg\\n// @@@@@@@gggHH6- ``````````````` `` _ `` ```````````````` ._~~_.`-?Wkqmmmmmmmggg@g\\n// @@@@g@gggHY~.-<_- `````````````````````````````````` ._~~(<-``.`.(WHqqqmmggggmmm\\n// @@g@gggHH=.`..._<-___..```````````````````````. .-_~~~_(!``-.``.`` OHHWUWHmqHWXW\\n// gggggmqK1.``..~.. _<<+-(____.. ```````` ..__~~_((<<!.`.``` .``.`` j0C1XUHmHIdW\\n// ggmmqH0!,_``.>`````` _<<;<v<<<++((((((((((<<<<<<~_. (-.``~``.>..``` jOuWHHqHIdH\\n// gmmqkW!`(_ J>` `` ` _~<`_~~~~<<<<<<<~~__````````` ?1. ._`(__``` zXWHg@HkXH\\n// gHHWS{``(lJ<!``.``.```(:+>`._`````.` <..`` - ``. ` _ ?&._.I`_`````` .XyVfppppW\\n// HHHSv``.(X:_..... _..(;+<!.(<..-.....-.-_..+_`..<.`.`..`_IJd} .`..````jqg@@@@@@\\n// XHWZ{..<Jk~!.`.. (<.-(+>(_.(1.(_..`.`.`.<_.+<_..<<-..._..-zy>.`_`...```.WH@HHHHH\\n// bkWt~.-jCz(_..`.(+<.(;< ._-<=_(<_..-....(_.<1<..(<<.`._..-JUS-._.`...```dHmH9VUH\\n// WUUO..(f.(c...__+z<-(+~` _-+<_(><..__.`.(<._.z_.(1;_..__.(C(zT-(..`...``(WHR<+Xk\\n// kkkk._(_.->..._(z;:_><.._>_+_<(1>_._<...(v<<.(<.(+z<..-_(Z~_<_j+_..`...`(WHKz1ZW\\n// @@gR._+_..~..-<+z<<?<>```_.<_.(+1><_;_..(1_:`.<<??1z--(+Z!..<_.j<....`..(bgHAAQX\\n// @@mR.(j:..~.._<z!`.(>~``` ~(_.(+<1><><_.(((_`.<__`.<_.(X>...<_.(<.....`.JUWWWyWW\\n// @gmH_(zl..(.._+>```<+_````.~>``(+.<?>>_._(<```(<<``(__<>....<.._<.......dXkkkHHH\\n// mmqHl(dk_.(_.-=~`.`.1-..._~-1.``_:`(??<_~(`.--.&_.`.<(;<...._.._<..`..._Xg@@@@@@\\n// qHkpk(dX<.(;..j_```.(((JJ&a&-~``````.1<_```-(((e+.-(/`(>...._..(<......(Wmggg@@g\\n// HVHbWcz><__+_.(_.(dWWHHH@HHc~````````.+~`` (jHMMMHHHm&.?..._<..(<_..._.(WqqHHmHg\\n// 0>vWWkzZwl~<o.__`__~X@@HM@Hb ```.`.``. ```` d@@HHH@@K?76...(<..(<_...(_(ppWWWWHq\\n// X0XWHKXXw$<(z<.( `` WHHMHHHH_``````````````.WHHMNMHHH_`(...(<_.(z_..._<(fWVC174W\\n// XuXWHHWWz>__+z+.!`..??CZYCOX_`````````````.`~.OvTUZUS_`~.._+?_.(_~_.._zjO=1+~+jy\\n// kkkkkkkkX:._<z=1(_`` << ``->``.``.``.``.```` ?<`` (v!`._..(??_.(1._.._=dUOOzzzwX\\n// @@@@@@@@H<...1O=v<_...__ -_````````````````.`` `` ~.`` :.~+=?~.(;_(...jdQQQQQkkk\\n// H@@@@@@@H~...(==>.~~~~~....`.`````````.`````.`........->.(===~~<<.(...(dg@@@@@@@\\n// @@@H@@HHH_.__(=l>~.~~~~~....``.``.``.```..`......~~~~~(<_+=l=~_<.->..~_dqggggg@g\\n// @H@@@@MHH_._<(=l>...........```````````````.`...~~~~~~+<(=lz=~((j=z_..~jWqmmgggm\\n// @@H@@HHWH_._<(lll-.......```.````.``.`..`````........_z<+llZz~(lOO=<...(VYUUUW9Y\\n// @@HMMHWZf>~_=:=llw+.`````````.`.```__~~_``.`````.....(z+llOOz_zllOlz~..~<<1+dW>_\\n// MMM#MHHWXl~_=>1ltwOl&.`.``.`````.``````````````.````.(llttwtz(OltwOz<..__zwOwwOz\\n// HM#HMHUUI<._1z+ttOZttlt&....``.``.`.````.``...``...(zZtttOktzjttttwlz_._<(Xkkkkk\\n// HHHmHSZu:(_~+OztttXtttOZZttO+-..............-(+ztOttwttttd0tOZttttwOl<~.(_dMMHHH\\n// rvuuXuuI~~<~(uttttwvOwwwkQQHMMHHHHHHHHHMMMNmgey?OwwwrtttwXOtwttttttXtO-~.((wZyyy\\n// HHHHHHK>(~(-(dOrtrrl(QgMHMMMHHHHHHHHHHHHHHHH##HMNkX0rrrrXXrd%`` (Ctwwtz_~.<(Wg@H\\n// NNNNNHD(~(zo~zXrrrQdHHMMNMHHHHHHHHHHHHHHHHHHHHHH##HNmyrdKkwZ ` _``-zwrt1~~_<(MNM\\n// MMMMM#<<_jwr:(Z4QHHMMHMHHHHHHHHHHHHHHHHHHHHHHHHHHHH###NHSXZ>` ~````.OXtt>~._<?MM\\n*/\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#ifndef ONLINE_JUDGE\\n#define dbg(x...) do { cout << \\\"\\\\033[32;1m \\\" << #x << \\\" -> \\\"; err(x); } while (0)\\nvoid err() { cout << \\\"\\\\033[39;0m\\\" << endl; }\\ntemplate<template<typename...> class T, typename t, typename... A>\\nvoid err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }\\ntemplate<typename T, typename... A>\\nvoid err(T a, A... x) { cout << a << ' '; err(x...); }\\n#else\\n#define dbg(...)\\n#endif\\ntypedef long long ll;\\ntypedef pair<int,int> pi;\\ntypedef vector<int> vi;\\ntemplate<class T> using vc=vector<T>;\\ntemplate<class T> using vvc=vc<vc<T>>;\\ntemplate<class T> void mkuni(vector<T>&v)\\n{\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\nll rand_int(ll l, ll r) //[l, r]\\n{\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n return uniform_int_distribution<ll>(l, r)(gen);\\n}\\ntemplate<class T>\\nvoid print(T x,int suc=1)\\n{\\n cout<<x;\\n if(suc==1) cout<<'\\\\n';\\n else cout<<' ';\\n}\\ntemplate<class T>\\nvoid print(const vector<T>&v,int suc=1)\\n{\\n for(int i=0;i<v.size();i++)\\n print(v[i],i==(int)(v.size())-1?suc:2);\\n}\\nint dp[1<<18][19];\\nint main()\\n{\\n int n;\\n cin>>n;\\n string s;\\n cin>>s;\\n int n2=1<<n;\\n vi p(n2);\\n auto f=[&](int x,int y)\\n {\\n if(x>y) swap(x,y);\\n return s[y-x-1]=='1'?y:x;\\n };\\n for(int i=0;i<n2;i++) cin>>p[i];\\n for(int i=0;i<n2;i++)\\n dp[i][0]=p[i];\\n for(int j=1;j<=n;j++)\\n {\\n int len=1<<(j-1);\\n for(int i=0;i<n2;i++)\\n {\\n int r=(i+len)%n2;\\n dp[i][j]=f(dp[i][j-1],dp[r][j-1]);\\n //dbg(i,j,dp[i][j]);\\n }\\n }\\n for(int i=0;i<n2;i++) cout<<dp[i][n]<<'\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 23792,\n \"score_of_the_acc\": -0.1501,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1968,"cells":{"group_id":{"kind":"string","value":"aoj_3148_cpp"},"problem_description":{"kind":"string","value":"L: 木の彩色\n問題文\nモデューロさんは木の絵を描くのがとてもうまいです。\nモデューロさんは長い年月をかけて頂点が $N$ 個である木の絵を書きました。\nこの木の頂点には $1$ から $N$ までの番号がついており、頂点 $a_i$ と $b_i$ $(1 \\leq i \\leq N-1)$ は直接辺でつながれています。\nすべての頂点には色がまだ塗られていません。\nモデューロさんが書いたこの木の絵はたくさんの人を感動させ、有名な美術館に飾られることが決まりました。\nこの美術館には順に $N$ 人の人が来場します。モデューロさんは来場者特典として、それぞれの人に $1$ 枚ずつ木の絵のコピーを配布することにしました。\nさらに、来場者に満足してもらうため、配布する木の絵の頂点すべてに色を塗ることにしました。\n$k$ 番目 $(1 \\leq k \\leq N)$ に来場する人は、以下の 2 条件を共に満たす絵が配布されたときにのみ満足します。\n最短距離が $k$ の倍数である任意の 2 頂点は、同じ色で塗られている。\n最短距離が $k$ の倍数でない任意の 2 頂点は、異なる色で塗られている。\nモデューロさんが持っている色の数は無限にあります。また、それぞれのコピーで色の塗り方が違っても構いません。\nそれぞれの来場者に対し、その来場者を満足させるように頂点を塗ることができるかどうか判定してください。\n制約\n$1 \\leq N \\leq 10^5$\n$1 \\leq a_i, b_i \\leq N$\n入力はすべて整数である\n入力によって与えられるグラフが木であることは保証される。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$\n$a_1$ $b_1$\n$a_2$ $b_2$\n$\\vdots$\n$a_{N-1}$ $b_{N-1}$\n$1$ 行目には、木の頂点数を表す整数 $N$ が与えられる。\n$2$ 行目から $N$ 行目には、木の辺の情報が与えられる。このうち $i+1(1 \\leq i \\leq N-1)$ 行目には、頂点 $a_i$ と $b_i$ が辺でつながっていることを示す 2 つの整数 $a_i,b_i$ が与えられる。\n出力\n以下を満たす\n0\nまたは\n1\nからなる文字列 $S = s_1 s_2 \\ldots s_N$ を出力せよ。\n$s_k = 1$ : $k$ 番目の来場者が満足できるよう与えられた木の絵の頂点に彩色できる\n$s_k = 0$ : $k$ 番目の来場者が満足できるよう与えられた木の絵の頂点に彩色できない\n入力例 1\n7\n1 3\n2 3\n3 4\n4 5\n4 6\n6 7\n出力例 1\n1100111\n入力例1の木は以下の図のようになります。\n例えば、$k=2$ の時、以下のように塗れば条件を満たします。\nまた、$k=5$ の時、以下のように塗れば条件を満たします。\n入力例 2\n6\n1 2\n2 3\n3 4\n4 5\n5 6\n出力例 2\n111111\n入力例 3\n1\n出力例 3\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3148_10155594","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n ios::sync_with_stdio(false); \n cin.tie(nullptr);\n int N; cin >> N;\n vector<vector<int>> g(N);\n for(int i=0;i<N-1;i++){\n int u,v; cin >> u >> v; \n u--; v--;\n g[u].push_back(v); \n g[v].push_back(u);\n }\n vector<int> parent(N,-1), q;\n q.push_back(0);\n for(int i=0;i<(int)q.size();i++){\n int cur=q[i];\n for(auto &adj: g[cur]){\n if(adj==parent[cur]) continue;\n parent[adj]=cur;\n q.push_back(adj);\n }\n }\n vector<int> len(N,0), lenDown(N,0);\n int maxInvalid=0;\n for(int i=N-1;i>=0;i--){\n int cur=q[i];\n for(auto &adj:g[cur]){\n if(adj==parent[cur]) continue;\n len[cur]=max(len[cur], len[adj]);\n }\n len[cur]++;\n }\n for(int i=0;i<N;i++){\n int cur=q[i];\n vector<int> maxLeft(g[cur].size()+1);\n maxLeft[0]=lenDown[cur];\n for(int j=0;j<(int)g[cur].size();j++){\n int adj=g[cur][j];\n maxLeft[j+1]=max(maxLeft[j], adj==parent[cur]?0:len[adj]);\n }\n int maxRight=0;\n for(int j=(int)g[cur].size()-1;j>=0;j--){\n int adj=g[cur][j];\n if(adj==parent[cur]) continue;\n lenDown[adj]=max(maxLeft[j], maxRight)+1;\n maxRight=max(maxRight, len[adj]);\n }\n if((int)g[cur].size()>=3){\n vector<int> lens; \n lens.push_back(lenDown[cur]);\n for(auto &adj:g[cur]){\n if(adj==parent[cur]) continue;\n lens.push_back(len[adj]);\n }\n sort(lens.begin(), lens.end());\n int len0=lens.back();\n int len1=lens[lens.size()-2];\n int len2=lens[lens.size()-3];\n maxInvalid=max(maxInvalid, len0);\n if(len0==len2) maxInvalid=max(maxInvalid, len0+len2-1);\n else maxInvalid=max(maxInvalid, len0+len2);\n }\n }\n string ans(N,'1');\n for(int i=3;i<=maxInvalid && i<=N;i++){\n ans[i-1]='0';\n }\n cout<<ans<<\"\\n\";\n}","accuracy":1,"time_ms":20,"memory_kb":11992,"score_of_the_acc":-0.0234,"final_rank":1},{"submission_id":"aoj_3148_9159777","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=int64_t;\n\n\nvector<vector<int>> g(100001);\nvector<int> d(100001);\nint limit=2;\n\nvoid dfs(int c,int pa){\n d[c]=0;\n for(int nx:g[c]){\n if(nx==pa) continue;\n dfs(nx,c);\n d[c]=max(d[c],d[nx]);\n }\n d[c]++;\n return;\n}\n\nvoid dfs1(int c,int pa,int dp){\n vector<pair<int,int>> p;\n for(int nx:g[c]){\n if(nx==pa) continue;\n p.emplace_back(d[nx],nx);\n }\n p.emplace_back(dp,pa);\n sort(p.rbegin(),p.rend());\n \n if((g[c].size()>=3)&&(p[2].first>=1)){\n int d1=p[0].first;\n int d2=p[2].first;\n if(d1!=d2) limit=max(limit,d1+d2);\n else limit=max(limit,d1+d2-1);\n }\n \n for(int nx:g[c]){\n if(nx==pa) continue;\n if(nx==p[0].second) dfs1(nx,c,p[1].first+1);\n else dfs1(nx,c,p[0].first+1);\n }\n return;\n}\n\n\nint main(){\n int N;\n cin >> N;\n if(N==1){\n cout << 1 << endl;\n return 0;\n }\n \n int a,b;\n\n for(int i=0;i<N-1;i++){\n cin >> a >> b;\n a--;b--;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n \n dfs(0,-1);\n dfs1(0,-1,0);\n \n vector<int> ans(N,1);\n for(int i=2;i<limit;i++) ans[i]=0;\n //cout << limit << endl;\n //for(int i=0;i<N;i++) cout << d[i] << endl;\n \n for(int x:ans) cout << x;\n cout << endl;\n\n \n}","accuracy":1,"time_ms":50,"memory_kb":22776,"score_of_the_acc":-0.2825,"final_rank":4},{"submission_id":"aoj_3148_6593691","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\nstruct Info{\n\tInfo(int arg_node,int arg_dist){\n\t\tnode = arg_node;\n\t\tdist = arg_dist;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\n\t\treturn dist > arg.dist;\n\t}\n\tint node,dist;\n};\n\nint N;\nint max_dist[SIZE];\nint number;\nvector<int> G[SIZE];\nvector<Info> children[SIZE];\n\nvoid dfs(int node_id,int pre){\n\n\tint tmp_max = 0;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs(child,node_id);\n\n\t\tchildren[node_id].push_back(Info(child,max_dist[child]+1));\n\t\ttmp_max = max(tmp_max,max_dist[child]+1);\n\t}\n\tmax_dist[node_id] = tmp_max;\n}\n\nvoid dfs2(int node_id,int pre){\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre){\n\n\t\t\tif(node_id == children[pre][0].node){ //自分が親の最大方向\n\n\t\t\t\tif(children[pre].size() == 1){ //親の子が自分しかいない\n\n\t\t\t\t\tchildren[node_id].push_back(Info(pre,1));\n\t\t\t\t}else{\n\n\t\t\t\t\tchildren[node_id].push_back(Info(pre,children[pre][1].dist+1));\n\t\t\t\t}\n\n\t\t\t}else{\n\n\t\t\t\tchildren[node_id].push_back(Info(pre,children[pre][0].dist+1));\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tint value;\n\n\tif(children[node_id].size() > 2){\n\n\t\tsort(children[node_id].begin(),children[node_id].end());\n\n\t\tif(children[node_id][0].dist == children[node_id][2].dist){\n\n\t\t\tvalue = children[node_id][0].dist + children[node_id][2].dist;\n\t\t}else{\n\n\t\t\tvalue = children[node_id][0].dist+children[node_id][2].dist+1;\n\t\t}\n\n\t\t//printf(\"node_id:%d\\n\",node_id);\n\t\t/*for(int i = 0; i < 3; i++){\n\n\t\t\tprintf(\"child[%d]:%d dist:%d\\n\",i,children[node_id][i].node,children[node_id][i].dist);\n\t\t}*/\n\n\t\tnumber = max(number,value);\n\t}\n\n\t//親を先に処理\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs2(child,node_id);\n\t}\n}\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tint from,to;\n\tfor(int i = 0; i < N-1; i++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\n\tif(N <= 2){\n\n\t\tfor(int i = 0; i < N; i++){\n\n\t\t\tprintf(\"1\");\n\t\t}\n\t\tprintf(\"\\n\");\n\t\treturn 0;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tmax_dist[i] = 0;\n\t}\n\n\tdfs(0,-1);\n\n\tnumber = -1;\n\tdfs2(0,-1);\n\n\tif(number <= 2){\n\n\t\tfor(int i = 0; i < N; i++){\n\n\t\t\tprintf(\"1\");\n\t\t}\n\t\tprintf(\"\\n\");\n\t\treturn 0;\n\t}\n\n\tprintf(\"11\");\n\tfor(int i = 3; i <= number-1; i++){\n\n\t\tprintf(\"0\");\n\t}\n\tfor(int i = number; i <= N; i++){\n\n\t\tprintf(\"1\");\n\t}\n\tprintf(\"\\n\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":25424,"score_of_the_acc":-0.3988,"final_rank":9},{"submission_id":"aoj_3148_4875890","code_snippet":"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3142\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n\n//BEGIN CUT HERE\ntemplate<typename T, typename Edge>\nstruct ReRooting{\n struct Node{\n int to,rev;\n Edge data;\n Node(int to,Edge data):to(to),data(data){}\n bool operator<(const Node &v)const{return to<v.to;};\n };\n\n using Fold = function<T(T, T)>;\n using Lift = function<T(T, Edge)>;\n\n vector< vector<Node> > G;\n vector< vector<T> > ld,rd;\n vector<int> lp,rp;\n\n const Fold fold;\n const Lift lift;\n const T id;\n\n ReRooting(int n,const Fold fold,const Lift lift,const T id):\n G(n),ld(n),rd(n),lp(n),rp(n),fold(fold),lift(lift),id(id){}\n\n void add_edge(int u,int v,Edge d,Edge e){\n G[u].emplace_back(v,d);\n G[v].emplace_back(u,e);\n }\n\n void add_edge(int u,int v,Edge d){add_edge(u,v,d,d);}\n\n // k: idx for edge (not vertex)\n T dfs(int v,int k){\n while(lp[v]!=k and lp[v]<(int)G[v].size()){\n auto &e=G[v][lp[v]];\n ld[v][lp[v]+1]=fold(ld[v][lp[v]],lift(dfs(e.to,e.rev),e.data));\n lp[v]++;\n }\n while(rp[v]!=k and rp[v]>=0){\n auto &e=G[v][rp[v]];\n rd[v][rp[v]]=fold(rd[v][rp[v]+1],lift(dfs(e.to,e.rev),e.data));\n rp[v]--;\n }\n if(k<0) return rd[v][0];\n return fold(ld[v][k],rd[v][k+1]);\n }\n\n int search(vector<Node> &vs,int idx){\n return lower_bound(vs.begin(),vs.end(),Node(idx,vs[0].data))-vs.begin();\n }\n\n vector<T> build(){\n int n=G.size();\n for(int i=0;i<n;i++){\n sort(G[i].begin(),G[i].end());\n ld[i].assign((int)G[i].size()+1,id);\n rd[i].assign((int)G[i].size()+1,id);\n lp[i]=0;\n rp[i]=(int)G[i].size()-1;\n }\n\n for(int i=0;i<n;i++)\n for(Node &t:G[i])\n t.rev=search(G[t.to],i);\n\n vector<T> res;\n for(int i=0;i<n;i++)\n res.emplace_back(dfs(i,-1));\n\n return res;\n }\n\n // p: idx for vertex\n T subtree(int v,int p){\n int k=search(G[p],v);\n assert(k<(int)G[p].size() and G[p][k].to==v);\n return lift(dfs(v,G[p][k].rev),G[p][k].data);\n }\n};\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n using ll = long long;\n\n struct T{\n ll a,b,c;\n T(ll a,ll b,ll c):a(a),b(b),c(c){}\n };\n\n const ll INF = 1e9;\n auto fold=[&](T x,T y){\n vector<ll> vs({x.a,x.b,x.c,y.a,y.b,y.c});\n sort(vs.rbegin(),vs.rend());\n return T(vs[0],vs[1],vs[2]);\n };\n auto lift=[&](T x,ll y){\n chmax(x.a,0);\n x.a+=y;\n x.b=-INF;\n x.c=-INF;\n return x;\n };\n\n int n;\n cin>>n;\n if(n==1) drop(1);\n\n ReRooting<T, ll> G(n,fold,lift,T(-INF,-INF,-INF));\n for(int i=1;i<n;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G.add_edge(u,v,1);\n }\n auto res=G.build();\n\n string ans(n+1,'1');\n\n for(int i=0;i<n;i++){\n if(G.G[i].size()<3) continue;\n T v=res[i];\n ans[v.a+min({v.a-1,v.b,v.c})]='0';\n }\n\n for(int i=n-1;i>=0;i--)\n if(ans[i+1]=='0') ans[i]='0';\n\n ans[1]='1';\n ans[2]='1';\n cout<<ans.substr(1)<<endl;\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":88340,"score_of_the_acc":-1.5147,"final_rank":15},{"submission_id":"aoj_3148_4875801","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\n\n\ntemplate<typename Data, typename T>\nstruct ReRooting{\n struct Node{\n Int to,rev;\n Data data;\n Node(Int to,Int rev,Data data):to(to),rev(rev),data(data){}\n };\n\n using F1 = function<T(T, T)>;\n using F2 = function<T(T, Data)>;\n\n vector<vector<Node> > G;\n vector<vector<T> > ld,rd;\n vector<Int> lp,rp;\n\n const F1 f1;\n const F2 f2;\n const T id;\n\n ReRooting(Int n,const F1 f1,const F2 f2,const T &id):\n G(n),ld(n),rd(n),lp(n),rp(n),f1(f1),f2(f2),id(id){}\n\n void add_edge(Int u,Int v,Data d){\n G[u].emplace_back(v,(Int)G[v].size(),d);\n G[v].emplace_back(u,(Int)G[u].size()-1,d);\n }\n\n // p: idx for edge (not vertex)\n T dfs(Int v,Int p){\n while(lp[v]!=p&&lp[v]<(Int)G[v].size()){\n auto &e=G[v][lp[v]];\n ld[v][lp[v]+1]=f1(ld[v][lp[v]],f2(dfs(e.to,e.rev),e.data));\n lp[v]++;\n }\n while(rp[v]!=p&&rp[v]>=0){\n auto &e=G[v][rp[v]];\n rd[v][rp[v]]=f1(rd[v][rp[v]+1],f2(dfs(e.to,e.rev),e.data));\n rp[v]--;\n }\n if(p<0) return rd[v][0];\n return f1(ld[v][p],rd[v][p+1]);\n }\n\n vector<T> build(){\n for(Int i=0;i<(Int)G.size();i++){\n ld[i].assign((Int)G[i].size()+1,id);\n rd[i].assign((Int)G[i].size()+1,id);\n lp[i]=0;\n rp[i]=(Int)G[i].size()-1;\n }\n vector<T> res;\n for(Int i=0;i<(Int)G.size();i++){\n res.emplace_back(dfs(i,-1));\n }\n return res;\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n struct T{\n Int a,b,c;\n T(Int a,Int b,Int c):a(a),b(b),c(c){}\n };\n\n const Int INF = 1e9;\n auto f1=\n [&](T x,T y){\n vector<Int> vs({x.a,x.b,x.c,y.a,y.b,y.c});\n sort(vs.rbegin(),vs.rend());\n return T(vs[0],vs[1],vs[2]);\n };\n auto f2=\n [&](T x,Int y){\n chmax(x.a,0);\n x.a+=y;\n x.b=-INF;\n x.c=-INF;\n return x;\n };\n\n Int n;\n cin>>n;\n if(n==1) drop(1);\n\n ReRooting<Int, T> G(n,f1,f2,T(-INF,-INF,-INF));\n for(Int i=1;i<n;i++){\n Int u,v;\n cin>>u>>v;\n u--;v--;\n G.add_edge(u,v,1);\n }\n auto res=G.build();\n\n string ans(n+1,'1');\n\n for(Int i=0;i<n;i++){\n if(G.G[i].size()<3) continue;\n T v=res[i];\n assert(v.a>=v.b);\n assert(v.b>=v.c);\n assert(v.c>=1);\n // cout<<v.a<<\" \"<<v.b<<\" \"<<v.c<<endl;\n ans[v.a+min({v.a-1,v.b,v.c})]='0';\n }\n\n for(Int i=n-1;i>=0;i--)\n if(ans[i+1]=='0') ans[i]='0';\n\n ans[1]='1';\n ans[2]='1';\n cout<<ans.substr(1)<<endl;\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":90512,"score_of_the_acc":-1.5833,"final_rank":16},{"submission_id":"aoj_3148_4740389","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\nstruct Info{\n\tInfo(int arg_node,int arg_dist){\n\t\tnode = arg_node;\n\t\tdist = arg_dist;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\n\t\treturn dist > arg.dist;\n\t}\n\tint node,dist;\n};\n\nint N;\nint max_dist[SIZE];\nint number;\nvector<int> G[SIZE];\nvector<Info> children[SIZE];\n\nvoid dfs(int node_id,int pre){\n\n\tint tmp_max = 0;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs(child,node_id);\n\n\t\tchildren[node_id].push_back(Info(child,max_dist[child]+1));\n\t\ttmp_max = max(tmp_max,max_dist[child]+1);\n\t}\n\tmax_dist[node_id] = tmp_max;\n}\n\nvoid dfs2(int node_id,int pre){\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre){\n\n\t\t\tif(node_id == children[pre][0].node){ //自分が親の最大方向\n\n\t\t\t\tif(children[pre].size() == 1){ //親の子が自分しかいない\n\n\t\t\t\t\tchildren[node_id].push_back(Info(pre,1));\n\t\t\t\t}else{\n\n\t\t\t\t\tchildren[node_id].push_back(Info(pre,children[pre][1].dist+1));\n\t\t\t\t}\n\n\t\t\t}else{\n\n\t\t\t\tchildren[node_id].push_back(Info(pre,children[pre][0].dist+1));\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tint value;\n\n\tif(children[node_id].size() > 2){\n\n\t\tsort(children[node_id].begin(),children[node_id].end());\n\n\t\tif(children[node_id][0].dist == children[node_id][2].dist){\n\n\t\t\tvalue = children[node_id][0].dist + children[node_id][2].dist;\n\t\t}else{\n\n\t\t\tvalue = children[node_id][0].dist+children[node_id][2].dist+1;\n\t\t}\n\n\t\t//printf(\"node_id:%d\\n\",node_id);\n\t\t/*for(int i = 0; i < 3; i++){\n\n\t\t\tprintf(\"child[%d]:%d dist:%d\\n\",i,children[node_id][i].node,children[node_id][i].dist);\n\t\t}*/\n\n\t\tnumber = max(number,value);\n\t}\n\n\t//親を先に処理\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs2(child,node_id);\n\t}\n}\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tint from,to;\n\tfor(int i = 0; i < N-1; i++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\n\tif(N <= 2){\n\n\t\tfor(int i = 0; i < N; i++){\n\n\t\t\tprintf(\"1\");\n\t\t}\n\t\tprintf(\"\\n\");\n\t\treturn 0;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tmax_dist[i] = 0;\n\t}\n\n\tdfs(0,-1);\n\n\tnumber = -1;\n\tdfs2(0,-1);\n\n\tif(number <= 2){\n\n\t\tfor(int i = 0; i < N; i++){\n\n\t\t\tprintf(\"1\");\n\t\t}\n\t\tprintf(\"\\n\");\n\t\treturn 0;\n\t}\n\n\tprintf(\"11\");\n\tfor(int i = 3; i <= number-1; i++){\n\n\t\tprintf(\"0\");\n\t}\n\tfor(int i = number; i <= N; i++){\n\n\t\tprintf(\"1\");\n\t}\n\tprintf(\"\\n\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":25440,"score_of_the_acc":-0.3573,"final_rank":6},{"submission_id":"aoj_3148_4740379","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\nstruct Info{\n\tInfo(int arg_node,int arg_dist){\n\t\tnode = arg_node;\n\t\tdist = arg_dist;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\n\t\treturn dist > arg.dist;\n\t}\n\tint node,dist;\n};\n\nint N;\nint max_dist[SIZE];\nint number;\nvector<int> G[SIZE];\nvector<Info> children[SIZE];\n\nvoid dfs(int node_id,int pre){\n\n\tint tmp_max = 0;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs(child,node_id);\n\n\t\tchildren[node_id].push_back(Info(child,max_dist[child]+1));\n\t\ttmp_max = max(tmp_max,max_dist[child]+1);\n\t}\n\tmax_dist[node_id] = tmp_max;\n}\n\nvoid dfs2(int node_id,int pre){\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre){\n\n\t\t\tif(node_id == children[pre][0].node){ //自分が親の最大方向\n\n\t\t\t\tif(children[pre].size() == 1){ //親の子が自分しかいない\n\n\t\t\t\t\tchildren[node_id].push_back(Info(pre,1));\n\t\t\t\t}else{\n\n\t\t\t\t\tchildren[node_id].push_back(Info(pre,children[pre][1].dist+1));\n\t\t\t\t}\n\n\t\t\t}else{\n\n\t\t\t\tchildren[node_id].push_back(Info(pre,children[pre][0].dist+1));\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tint value;\n\n\tif(children[node_id].size() > 2){\n\n\t\tsort(children[node_id].begin(),children[node_id].end());\n\n\t\tif(children[node_id][0].dist == children[node_id][2].dist){\n\n\t\t\tvalue = children[node_id][0].dist + children[node_id][2].dist;\n\t\t}else{\n\n\t\t\tvalue = children[node_id][0].dist+children[node_id][2].dist+1;\n\t\t}\n\n\t\t//printf(\"node_id:%d\\n\",node_id);\n\t\t/*for(int i = 0; i < 3; i++){\n\n\t\t\tprintf(\"child[%d]:%d dist:%d\\n\",i,children[node_id][i].node,children[node_id][i].dist);\n\t\t}*/\n\n\t\tnumber = max(number,value);\n\t}\n\n\t//親を先に処理\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs2(child,node_id);\n\t}\n}\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tint from,to;\n\tfor(int i = 0; i < N-1; i++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\n\tif(N <= 2){\n\n\t\tfor(int i = 0; i < N; i++){\n\n\t\t\tprintf(\"1\");\n\t\t}\n\t\tprintf(\"\\n\");\n\t\treturn 0;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tmax_dist[i] = 0;\n\t}\n\n\tdfs(0,-1);\n\n\tnumber = -1;\n\tdfs2(0,-1);\n\n\tif(number == -1){\n\n\t\tfor(int i = 0; i < N; i++){\n\n\t\t\tprintf(\"1\");\n\t\t}\n\t\tprintf(\"\\n\");\n\t\treturn 0;\n\t}\n\n\tprintf(\"11\");\n\tfor(int i = 3; i <= number-1; i++){\n\n\t\tprintf(\"0\");\n\t}\n\tfor(int i = number; i <= N; i++){\n\n\t\tprintf(\"1\");\n\t}\n\tprintf(\"\\n\");\n\n\treturn 0;\n}","accuracy":0.8026315789473685,"time_ms":70,"memory_kb":25496,"score_of_the_acc":-0.3997,"final_rank":17},{"submission_id":"aoj_3148_4740365","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\nstruct Info{\n\tInfo(int arg_node,int arg_dist){\n\t\tnode = arg_node;\n\t\tdist = arg_dist;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\n\t\treturn dist > arg.dist;\n\t}\n\tint node,dist;\n};\n\nint N;\nint max_dist[SIZE];\nint number;\nvector<int> G[SIZE];\nvector<Info> children[SIZE];\n\nvoid dfs(int node_id,int pre){\n\n\tint tmp_max = 0;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs(child,node_id);\n\n\t\tchildren[node_id].push_back(Info(child,max_dist[child]+1));\n\t\ttmp_max = max(tmp_max,max_dist[child]+1);\n\t}\n\tmax_dist[node_id] = tmp_max;\n}\n\nvoid dfs2(int node_id,int pre){\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre){\n\n\t\t\tif(node_id == children[pre][0].node){ //自分が親の最大方向\n\n\t\t\t\tif(children[pre].size() == 1){ //親の子が自分しかいない\n\n\t\t\t\t\tchildren[node_id].push_back(Info(pre,1));\n\t\t\t\t}else{\n\n\t\t\t\t\tchildren[node_id].push_back(Info(pre,children[pre][1].dist+1));\n\t\t\t\t}\n\n\t\t\t}else{\n\n\t\t\t\tchildren[node_id].push_back(Info(pre,children[pre][0].dist+1));\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tint value;\n\n\tif(children[node_id].size() > 2){\n\n\t\tsort(children[node_id].begin(),children[node_id].end());\n\n\t\tif(children[node_id][0].dist == children[node_id][2].dist){\n\n\t\t\tvalue = children[node_id][0].dist + children[node_id][2].dist;\n\t\t}else{\n\n\t\t\tvalue = children[node_id][0].dist+children[node_id][2].dist+1;\n\t\t}\n\n\t\t//printf(\"node_id:%d\\n\",node_id);\n\t\t/*for(int i = 0; i < 3; i++){\n\n\t\t\tprintf(\"child[%d]:%d dist:%d\\n\",i,children[node_id][i].node,children[node_id][i].dist);\n\t\t}*/\n\n\t\tnumber = max(number,value);\n\t}\n\n\t//親を先に処理\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tdfs2(child,node_id);\n\t}\n}\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tint from,to;\n\tfor(int i = 0; i < N-1; i++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\n\tif(N <= 2){\n\n\t\tfor(int i = 0; i < N; i++){\n\n\t\t\tprintf(\"1\");\n\t\t}\n\t\tprintf(\"\\n\");\n\t\treturn 0;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tmax_dist[i] = 0;\n\t}\n\n\tdfs(0,-1);\n\n\tnumber = -1;\n\tdfs2(0,-1);\n\n\t//printf(\"number:%d\\n\",number);\n\n\tprintf(\"11\");\n\tfor(int i = 3; i <= number-1; i++){\n\n\t\tprintf(\"0\");\n\t}\n\tfor(int i = number; i <= N; i++){\n\n\t\tprintf(\"1\");\n\t}\n\tprintf(\"\\n\");\n\n\treturn 0;\n}","accuracy":0.19736842105263158,"time_ms":30,"memory_kb":25452,"score_of_the_acc":-0.2325,"final_rank":20},{"submission_id":"aoj_3148_4554477","code_snippet":"#include <iostream>\n#include <utility>\n#include <tuple>\n#include <vector>\n#include <string>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <algorithm>\n#include <functional>\n#include <climits>\n#include <numeric>\n#include <queue>\n#include <cmath>\n#include <iomanip>\n#include <array>\n#include <string>\n#include <stack>\n\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<std::vector<int>> nodes(n);\n\tfor (auto i = 1; i < n; ++i) {\n\t\tint a, b; std::cin >> a >> b;\n\t\tnodes[a - 1].push_back(b - 1);\n\t\tnodes[b - 1].push_back(a - 1);\n\t}\n\tstd::stack<int> stack; stack.push(0);\n\tstd::vector<int> depth(n, -1); depth[0] = 1;\n\twhile (!stack.empty()) {\n\t\tconst auto top = stack.top(); stack.pop();\n\t\tfor (const auto next : nodes[top]) if (depth[next] == -1) {\n\t\t\tdepth[next] = depth[top] + 1;\n\t\t\tstack.push(next);\n\t\t}\n\t}\n\tconst auto end_a = std::distance(depth.begin(), std::max_element(depth.begin(), depth.end()));\n\tstack.push(end_a);\n\tdepth.assign(n, -1); depth[end_a] = 1;\n\tstd::vector<int> height(n, -1);\n\twhile (!stack.empty()) {\n\t\tconst auto top = stack.top(); stack.pop();\n\t\tif (top >= 0) {\n\t\t\tstack.push(-1 - top);\n\t\t\tfor (const auto next : nodes[top]) if (depth[next] == -1) {\n\t\t\t\tdepth[next] = depth[top] + 1;\n\t\t\t\tstack.push(next);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tconst auto current = -1 - top;\n\t\t\theight[current] = 1;\n\t\t\tfor (const auto next : nodes[current]) {\n\t\t\t\theight[current] = std::max(height[current], height[next] + 1);\n\t\t\t}\n\t\t}\n\t}\n\tint max{ 2 };\n\tfor (auto i = 0; i < n; ++i) if (nodes[i].size() >= 3) {\n\t\tstd::vector<int> length; length.reserve(nodes[i].size() + 1);\n\t\tstd::transform(nodes[i].begin(), nodes[i].end(), std::back_inserter(length), [&depth, &height, i](const int a) {return depth[i] < depth[a] ? height[a] : depth[a]; });\n\t\tstd::sort(length.rbegin(), length.rend());\n\t\tconst auto k = length[0] + length[2];\n\t\tif (length[0] == length[2]) {\n\t\t\tmax = std::max(max, k);\n\t\t}\n\t\telse {\n\t\t\tmax = std::max(max, k + 1);\n\t\t}\n\t}\n\tfor (auto i = 1; i <= n; ++i) {\n\t\tif (3 <= i && i < max) {\n\t\t\tstd::cout << '0';\n\t\t}\n\t\telse {\n\t\t\tstd::cout << '1';\n\t\t}\n\t}\n\tstd::cout << std::endl;\n}","accuracy":1,"time_ms":60,"memory_kb":10112,"score_of_the_acc":-0.1667,"final_rank":2},{"submission_id":"aoj_3148_4380076","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <cassert>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <string>\n#include <algorithm>\n#define llint long long\n#define inf 1e18\n#define mod 998244353\n#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)\n#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\n\nusing namespace std;\ntypedef pair<llint, llint> P;\n\nint n;\nvector<llint> G[100005];\nmap<P, llint> mp;\nint dif[100005];\n\nint parent[500005];\nllint dp[500005], dp2[500005];\n\nconst llint e = 0; //\nllint ope(llint a, llint b)\n{\n\treturn max(a, b); //\n}\n\nllint get(int u, int v)\n{\n\tif(parent[u] == v) return dp2[u];\n\telse return dp[v];\n}\n\nvoid dfs(int v, int p)\n{\n\tparent[v] = p;\n\tfor(int i = 0; i < G[v].size(); i++){\n\t\tif(G[v][i] == p) continue;\n\t\tdfs(G[v][i], v);\n\t}\n\t\n\tllint sum = e;\n\tfor(int i = 0; i < G[v].size(); i++){\n\t\tint u = G[v][i];\n\t\tif(u == p) continue;\n\t\tsum = ope(sum, get(v, u)); //\n\t}\n\tdp[v] = sum+1; //\n}\n\nllint lsum[500005], rsum[500005];\nvoid dfs2(int v, int p)\n{\n\tllint m = G[v].size(), sum;\n\t\n\tsum = lsum[0] = e;\n\tfor(int i = 0; i < m; i++){\n\t\tint u = G[v][i];\n\t\tsum = ope(sum, get(v, u)); //\n\t\tlsum[i+1] = sum;\n\t}\n\tsum = rsum[m+1] = e;\n\tfor(int i = m-1; i >= 0; i--){\n\t\tint u = G[v][i];\n\t\tsum = ope(sum, get(v, u)); //\n\t\trsum[i+1] = sum;\n\t}\n\tfor(int i = 0; i < m; i++){\n\t\tif(G[v][i] == p) continue;\n\t\tdp2[G[v][i]] = ope(lsum[i], rsum[i+2])+1; //\n\t}\n\t\n\tfor(int i = 0; i < G[v].size(); i++){\n\t\tif(G[v][i] == p) continue;\n\t\tdfs2(G[v][i], v);\n\t}\n}\n\nint main(void)\n{\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\t\n\tcin >> n;\n\tint u, v;\n\tfor(int i = 0; i < n-1; i++){\n\t\tcin >> u >> v;\n\t\tG[u].push_back(v);\n\t\tG[v].push_back(u);\n\t}\n\t\n\tdfs(1, -1);\n\tdfs2(1, -1);\n\t\n\t/*for(auto it = mp.begin(); it != mp.end(); it++){\n\t\tcout << it->first.first << \" \" << it->first.second << \" \" << it->second << endl;\n\t}*/\n\t\n\tvector<llint> vec;\n\tfor(int i = 1; i <= n; i++){\n\t\tif(G[i].size() < 3) continue;\n\t\tvec.clear();\n\t\tfor(int j = 0; j < G[i].size(); j++){\n\t\t\tvec.push_back(get(i, G[i][j]));\n\t\t}\n\t\tsort(vec.rbegin(), vec.rend());\n\t\tllint x = vec[0], y = vec[2], l, r;\n\t\t//cout << i << \" \" << x << \" \" << y << endl;\n\t\tif(y == 0 || x+y < 3) continue;\n\t\t\n\t\tif(x > y) l = 3, r = x+y;\n\t\telse l = 3, r = 2*x-1;\n\t\tdif[l]++, dif[r+1]--;\n\t}\n\t\n\tllint sum = 0;\n\tfor(int i = 1; i <= n; i++){\n\t\tsum += dif[i];\n\t\tif(sum) cout << 0;\n\t\telse cout << 1;\n\t}\n\tcout << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":16868,"score_of_the_acc":-0.209,"final_rank":3},{"submission_id":"aoj_3148_4357023","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,n) for (int i=a;i<n;i++)\n#define per(i,a,n) for (int i=n-1;i>=a;i--)\n#define pb push_back\n#define mp make_pair\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define SZ(x) ((int)(x).size())\ntypedef vector<int> VI;\ntypedef long long ll;\ntypedef pair<int,int> PII;\ntypedef double db;\nmt19937 mrand(random_device{}()); \nconst ll mod=998244353;\nint rnd(int x) { return mrand() % x;}\nll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\nll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}\n// head\n\nconst int N=101000;\nint n,u,v;\nint dis[N],dis2[N];\nVI e[N],br[N];\n\nvoid dfs(int u,int f) {\n\tdis[u]=0;\n\tfor (auto v:e[u]) {\n\t\tif (v==f) continue;\n\t\tdfs(v,u);\n\t\tdis[u]=max(dis[u],dis[v]+1);\n\t\tbr[u].pb(dis[v]+1);\n\t}\n}\n\nvoid dfs2(int u,int f) {\n\tint mx=0,mx2=0;\n\tif (u!=1) br[u].pb(dis2[u]);\n\tmx=dis2[u];\n\t//printf(\"uu %d %d\\n\",u,dis2[u]);\n\tfor (auto x:br[u]) {\n\t\tif (x>mx) mx2=mx,mx=x;\n\t\telse if (x>mx2) mx2=x;\n\t}\n\tfor (auto v:e[u]) {\n\t\tif (v==f) continue;\n\t\tif (dis[v]+1==mx) dis2[v]=mx2+1;\n\t\telse dis2[v]=mx+1;\n\t\tdfs2(v,u);\n\t}\n}\nint main() {\n\tscanf(\"%d\",&n);\n\trep(i,1,n) {\n\t\tscanf(\"%d%d\",&u,&v);\n\t\te[u].pb(v);\n\t\te[v].pb(u);\n\t}\n\tdfs(1,0);\n\tdfs2(1,0);\n\t/*rep(i,1,n+1) {\n\t\tfor (auto x:br[i]) printf(\"%d \",x);\n\t\tputs(\"\");\n\t}*/\n\tint t=0;\n\trep(i,1,n+1) if (SZ(br[i])>=3) {\n\t\tsort(all(br[i]));\n\t\treverse(all(br[i]));\n\t\tt=max(t,br[i][0]+br[i][2]-(br[i][0]==br[i][2]));\n\t}\n\trep(i,1,n+1) putchar((i<=2||i>t)?'1':'0');\n\tputs(\"\");\n}","accuracy":1,"time_ms":70,"memory_kb":24372,"score_of_the_acc":-0.3857,"final_rank":7},{"submission_id":"aoj_3148_4285725","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#ifndef ONLINE_JUDGE\n#define dbg(x...) do { cout << \"\\033[32;1m \" << #x << \" -> \"; err(x); } while (0)\nvoid err() { cout << \"\\033[39;0m\" << endl; }\ntemplate<template<typename...> class T, typename t, typename... A>\nvoid err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }\ntemplate<typename T, typename... A>\nvoid err(T a, A... x) { cout << a << ' '; err(x...); }\n#else\n#define dbg(...)\n#endif\ntypedef long long ll;\ntypedef pair<int,int> pi;\ntypedef vector<int> vi;\ntemplate<class T> using vc=vector<T>;\ntemplate<class T> using vvc=vc<vc<T>>;\ntemplate<class T> void mkuni(vector<T>&v)\n{\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\nll rand_int(ll l, ll r) //[l, r]\n{\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n return uniform_int_distribution<ll>(l, r)(gen);\n}\ntemplate<class T>\nvoid print(T x,int suc=1)\n{\n cout<<x;\n if(suc==1) cout<<'\\n';\n else cout<<' ';\n}\ntemplate<class T>\nvoid print(const vector<T>&v,int suc=1)\n{\n for(int i=0;i<v.size();i++)\n print(v[i],i==(int)(v.size())-1?suc:2);\n}\nconst int maxn=1e5+7;\nvi G[maxn];\nint dp[maxn];\nint len;\nvoid dfs(int u,int fa=-1)\n{\n dp[u]=1;\n for(auto v:G[u])if(v!=fa)\n {\n dfs(v,u);\n dp[u]=max(dp[u],dp[v]+1);\n }\n}\nvoid dfs2(int u,int fa=-1)\n{\n multiset<int> son;\n for(auto v:G[u])\n son.insert(dp[v]);\n if(son.size()>2)\n {\n //dbg(u,son);\n auto it=son.rbegin();\n vi all;\n for(int i=0;i<3;i++)\n {\n all.push_back(*it);\n it++;\n }\n if(all[0]!=all[2])\n len=max(len,all[0]+all[2]+1);\n else len=max(len,all[0]+all[2]);\n }\n for(auto v:G[u])if(v!=fa)\n {\n son.erase(son.find(dp[v]));\n int tmp=dp[u];\n if(son.empty()) dp[u]=1;\n else dp[u]=(*son.rbegin())+1;\n int tmpv=dp[v];\n dp[v]=max(dp[v],dp[u]+1);\n dfs2(v,u);\n dp[u]=tmp;\n dp[v]=tmpv;\n son.insert(dp[v]);\n }\n}\nint main()\n{\n int n;\n cin>>n;\n len=2;\n string ans;\n for(int i=0;i<n;i++) ans+='1';\n bool ac=1;\n for(int i=1,u,v;i<n;i++)\n {\n cin>>u>>v;\n G[u].push_back(v);\n G[v].push_back(u);\n }\n dfs(1);\n dfs2(1);\n for(int i=2;i<len-1;i++) ans[i]='0';\n cout<<ans<<'\\n';\n}","accuracy":1,"time_ms":90,"memory_kb":30672,"score_of_the_acc":-0.5474,"final_rank":13},{"submission_id":"aoj_3148_4283964","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <set>\n#include <tuple>\n#define mkp make_pair\n#define mkt make_tuple\n#define rep(i,n) for(int i = 0; i < (n); ++i)\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=1e9+7;\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\n\nvector<vector<int>> g;\nvector<int> dp;\nvector<vector<int>> len;\n\nvoid predfs(int now,int par){\n int res=0;\n for(auto nex:g[now]) if(nex!=par){\n predfs(nex,now);\n chmax(res,dp[nex]+1);\n len[now].push_back(dp[nex]+1);\n }\n dp[now]=res;\n}\n\nvoid dfs(int now,int par,int pval){\n if(par!=-1) len[now].push_back(pval);\n sort(len[now].rbegin(),len[now].rend());\n\n for(auto nex:g[now]) if(nex!=par){\n int neco=len[now][0];\n if(neco==dp[nex]+1){\n if(len[now].size()>1) neco=len[now][1];\n else neco=0;\n }\n dfs(nex,now,neco+1);\n }\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int N;\n cin>>N;\n g.resize(N);\n rep(i,N-1){\n int a,b;\n cin>>a>>b;\n a--;b--;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n\n dp.resize(N,0);\n len.resize(N);\n predfs(0,-1);\n\n dfs(0,-1,-1);\n\n int lim=0;\n for(int i=0;i<N;i++){\n if(len[i].size()<=2) continue;\n int fir=len[i][0];\n int sec=len[i][2];\n if(fir==sec) sec--;\n chmax(lim,fir+sec);\n }\n\n string ans(N,'1');\n rep(i,lim) ans[i]='0';\n ans[0]='1';ans[1]='1';\n cout<<ans<<endl;\n\n\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":25352,"score_of_the_acc":-0.3562,"final_rank":5},{"submission_id":"aoj_3148_4280837","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define ALL(A) A.begin(),A.end()\n#define RALL(A) A.rbegin(),A.rend()\ntypedef long long LL;\ntypedef pair<int,int> P;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\nconst LL mod=998244353;\nconst LL LINF=1LL<<62;\nconst int INF=1<<30;\nint dx[]={1,0,-1,0,1,-1,1,-1};\nint dy[]={0,1,0,-1,1,-1,-1,1};\n\nvector<int> G[1<<17];\nvector<int> dp(1<<17,0);\nint r = 3;\n\nint dfs(int u,int v){\n int ret = 0;\n for(auto g:G[u]){\n if(g == v) continue;\n chmax(ret, dfs(g, u));\n }\n return dp[u] = ret + 1;\n}\n\nvoid dfs2(int u,int v,P x){\n vector<P> vv;\n vv.pb(mp(0, -1));\n for(auto g:G[u]){\n if(g == v){\n vv.pb(x);\n }\n else{\n vv.pb(mp(dp[g], g));\n }\n }\n sort(RALL(vv));\n for(auto g:G[u]){\n if(g == v) continue;\n if(g == vv[0].sc){\n dfs2(g, u, mp(vv[1].fs + 1, u));\n }\n else{\n dfs2(g, u, mp(vv[0].fs + 1, u));\n }\n }\n if(vv.size() >= 4){\n int a = vv[0].fs, b = vv[1].fs, c = vv[2].fs;\n chmax(r, a + c + (a != c));\n }\n}\n\n\nint main(){\n int n;cin >> n;\n for (int i = 0; i < n-1; i++) {\n int a,b;cin >> a >> b;\n a--,b--;\n G[a].pb(b);\n G[b].pb(a);\n }\n dfs(0,-1);\n dfs2(0,-1,mp(0,-1));\n string ans(n, '1');\n for (int i = 3; i < r; i++) {\n ans[i - 1] = '0';\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":28140,"score_of_the_acc":-0.4742,"final_rank":11},{"submission_id":"aoj_3148_4280728","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define ALL(A) A.begin(),A.end()\n#define RALL(A) A.rbegin(),A.rend()\ntypedef long long LL;\ntypedef pair<int,int> P;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\nconst LL mod=998244353;\nconst LL LINF=1LL<<62;\nconst int INF=1<<30;\nint dx[]={1,0,-1,0,1,-1,1,-1};\nint dy[]={0,1,0,-1,1,-1,-1,1};\n\nvector<int> G[1<<17];\nvector<int> dp(1<<17);\n\nint dfs(int u,int v){\n int ret = 0;\n for(auto g:G[u]){\n if(g == v) continue;\n ret = max(ret, dfs(g, u));\n }\n return dp[u] = ret + 1;\n}\n\nint n;\nint l = 3;\n\nvoid dfs2(int u, int v, P x){\n vector<P> vv;\n for(auto g:G[u]){\n if(g == v){\n vv.pb(x);\n }\n else{\n vv.pb(mp(dp[g],g));\n }\n }\n sort(RALL(vv));\n for(auto g:G[u]){\n if(g == v) continue;\n if(vv[0].sc == g){\n if(vv.size() == 1) dfs2(g, u, mp(1, u));\n else dfs2(g, u, mp(vv[1].fs + 1, u));\n }\n else{\n dfs2(g, u, mp(vv[0].fs + 1, u));\n }\n }\n if(vv.size() >= 3){\n int a = vv[0].fs, b = vv[1].fs, c = vv[2].fs;\n for (int k = l; k < n; k++) {\n if(k > a + c) break;\n else if(a + c == k && k - b == k - c && (k - c) * 2 == k) break;\n l++;\n }\n }\n return;\n}\n\n\n\nint main(){\n cin >> n;\n if(n == 1){\n cout << 1 << endl;\n return 0;\n }\n for (int i = 0; i < n-1; i++) {\n int a,b;cin >> a >> b;\n a--,b--;\n G[a].pb(b);\n G[b].pb(a);\n }\n dfs(0,0);\n dfs2(0,0,mp(0,0));\n for (int i = 1; i <= 2; i++) {\n cout << 1;\n }\n for (int i = 3; i < l; i++) {\n cout << 0;\n }\n for (int i = l; i <= n; i++) {\n cout << 1;\n }\n cout << endl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":28220,"score_of_the_acc":-0.4752,"final_rank":12},{"submission_id":"aoj_3148_4280663","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nlong long n;\nvector<vector<int>> edge;\nvector<int> dp;\nvector<bool> ch;\n\nstring solve();\nint dfs(int now);\nint reroot(int now);\n\nint main() {\n cin >> n;\n edge.resize(n);\n for(int i = 0; i < n - 1; ++i) {\n int a, b;\n cin >> a >> b;\n edge[--a].push_back(--b);\n edge[b].push_back(a);\n }\n cout << solve() << endl;\n return 0;\n}\n\nstring solve() {\n string res;\n for(int i = 0; i < n; ++i) res += \"1\";\n dp.assign(n, 0);\n ch.assign(n, 0);\n ch[0] = 1;\n dfs(0);\n ch.assign(n, 0);\n ch[0] = 1;\n int num = reroot(0);\n if(num != -1)\n for(int j = 2; j <= num; ++j) res[j] = '0';\n return res;\n}\n\nint dfs(int now) {\n int res = 0;\n for(auto to : edge[now])\n if(!ch[to]) {\n ch[to] = 1;\n res = max(res, 1 + dfs(to));\n }\n return dp[now] = res;\n}\n\nint reroot(int now) {\n int res = -1, num = 0, bf = dp[now];\n dp[now] = 0;\n vector<int> child, pre, suf;\n for(auto to : edge[now]) {\n child.push_back(dp[to]);\n pre.push_back(dp[to]);\n suf.push_back(dp[to]);\n }\n num = child.size();\n for(int i = 1; i < num; ++i) {\n pre[i] = max(pre[i - 1], pre[i]);\n suf[num - i - 1] = max(suf[num - i], suf[num - i - 1]);\n }\n for(int i = 0; i < num; ++i)\n if(!ch[edge[now][i]]) {\n dp[now] = 0;\n ch[edge[now][i]] = 1;\n if(i != 0) dp[now] = max(dp[now], pre[i - 1] + 1);\n if(i != num - 1)\n dp[now] = max(dp[now], suf[i + 1] + 1);\n res = max(res, reroot(edge[now][i]));\n }\n if(num >= 3) {\n sort(child.begin(), child.end(), greater<int>());\n if(child[0] == child[2])\n res = max(res, child[0] + child[2]);\n else\n res = max(res, child[0] + child[2] + 1);\n }\n dp[now] = bf;\n return res;\n}","accuracy":1,"time_ms":100,"memory_kb":35216,"score_of_the_acc":-0.6456,"final_rank":14},{"submission_id":"aoj_3148_4280489","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define ALL(A) A.begin(),A.end()\n#define RALL(A) A.rbegin(),A.rend()\ntypedef long long LL;\ntypedef pair<int,int> P;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\nconst LL mod=998244353;\nconst LL LINF=1LL<<62;\nconst int INF=1<<30;\nint dx[]={1,0,-1,0,1,-1,1,-1};\nint dy[]={0,1,0,-1,1,-1,-1,1};\n\nvector<int> G[1<<17];\nvector<int> dp(1<<17);\n\nint dfs(int u,int v){\n int ret = 0;\n for(auto g:G[u]){\n if(g == v) continue;\n chmax(ret, dfs(g, u));\n }\n return dp[u] = ret + 1;\n}\n\nint n;\nint l = 3;\n\nvoid dfs2(int u, int v, P x){\n vector<P> vv;\n for(auto g:G[u]){\n if(g == v){\n vv.pb(x);\n }\n else{\n vv.pb(mp(dp[g], g));\n }\n }\n sort(RALL(vv));\n for(auto g:G[u]){\n if(g == v) continue;\n if(vv[0].sc == g){\n if(vv.size() == 1) dfs2(g, u, mp(1, u));\n else dfs2(g, u, mp(vv[1].fs + 1, u));\n }\n else{\n dfs2(g, u, mp(vv[0].fs + 1, u));\n }\n }\n if(vv.size() >= 3){\n int a = vv[0].fs, b = vv[1].fs, c = vv[2].fs;\n if(a == c) chmax(l, a + c);\n else chmax(l, a + c + 1);\n }\n return;\n}\n\n\n\nint main(){\n cin >> n;\n if(n == 1){\n cout << 1 << endl;\n return 0;\n }\n for (int i = 0; i < n-1; i++) {\n int a,b;cin >> a >> b;\n a--,b--;\n G[a].pb(b);\n G[b].pb(a);\n }\n dfs(0,0);\n dfs2(0,0,mp(0,0));\n for (int i = 1; i <= 2; i++) {\n cout << 1;\n }\n for (int i = 3; i < l; i++) {\n cout << 0;\n }\n for (int i = l; i <= n; i++) {\n cout << 1;\n }\n cout << endl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":28080,"score_of_the_acc":-0.4735,"final_rank":10},{"submission_id":"aoj_3148_4280241","code_snippet":"#include <iostream>\n#include <vector>\n\nusing namespace std;\nvector<int> G[100010];\nint d[3][100010] = {};\nint dfs(int s, int p,int k){\n for(int v:G[s]){\n if(v==p) continue;\n d[k][v] = d[k][s] + 1;\n dfs(v,s,k);\n }\n}\n\nint mx[100010] = {};\nvoid dfs2(int s,int p,int dia,int par){\n for(int v:G[s]){\n if(v==p) continue;\n if(d[0][v] + d[1][v]==dia) continue;\n d[2][v] = d[2][s] + 1;\n mx[par] = max(mx[par],d[2][v]);\n dfs2(v,s,dia,par);\n }\n}\n\nint n,seg[2][200010];\nvoid init(int n,int x){\n for(int i=n - 1;i>0;i--){\n seg[x][i] = max(seg[x][i<<1],seg[x][i<<1|1]);\n }\n}\n\nvoid update(int val,int p,int x){\n for(seg[x][p += n] = val;p>1;p>>=1){\n seg[x][p>>1] = max(seg[x][p],seg[x][p^1]);\n }\n}\n\nint query(int l,int r,int x){\n int res = 0;\n for(l += n,r += n; l<r;l>>=1,r>>=1){\n if(l&1) res = max(res,seg[x][l++]);\n if(r&1) res = max(res,seg[x][--r]);\n }\n return res;\n}\n\nint ans[100010];\nint main(){\n int i;\n cin >> n;\n for(i=0;i<n - 1;i++){\n int a,b; cin >> a >> b;\n a--; b--;\n G[a].push_back(b); G[b].push_back(a);\n }\n dfs(0,-1,0);\n int j = -1,x = -1;\n for(i=0;i<n;i++){\n if(d[0][i]>x){\n j = i; x = d[0][i];\n }\n }\n for(i=0;i<n;i++){\n d[0][i] = 0;\n }\n dfs(j,-1,0);\n int jj = -1; x = -1;\n for(i=0;i<n;i++){\n if(d[0][i]>x){\n x = d[0][i];\n jj = i;\n }\n }\n int dia = x;\n dfs(jj,-1,1);\n vector<int> choku;\n ans[1] = 1; ans[2] = 1;\n for(i=dia + 1;i<=n;i++){\n ans[i] = 1;\n }\n for(i=0;i<n;i++){\n if(d[0][i] + d[1][i]==dia){\n dfs2(i,-1,dia,i);\n choku.push_back(i);\n }\n }\n for(i=0;i<choku.size();i++){\n int v = choku[i];\n if(mx[v]) update(mx[v] + d[0][v],d[0][v],0);\n if(mx[v]) update(mx[v] + d[1][v],d[1][v],1);\n }\n for(i=3;i<=dia;i++){\n if(i&1){\n if(query(0,n,0)>=i || query(0,n,1)>=i) ans[i] = 0;\n else ans[i] = 1;\n }else{\n int k = i/2;\n if(max(query(0,n,0),query(0,n,1))<i){\n ans[i] = 1;\n }else if(max(query(0,k,0),query(k + 1,n,0))>=i || max(query(0,k,1),query(k + 1,n,1))>=i){\n ans[i] = 0;\n }else if(max(query(k,k + 1,0),query(k,k + 1,1))==i){\n ans[i] = 1;\n }else{\n ans[i] = 0;\n }\n }\n }\n for(i=1;i<=n;i++){\n cout << ans[i];\n }\n cout << endl;\n}","accuracy":1,"time_ms":90,"memory_kb":18384,"score_of_the_acc":-0.3946,"final_rank":8},{"submission_id":"aoj_3148_4280129","code_snippet":"#include <iostream>\n#include <vector>\n\nusing namespace std;\nvector<int> G[100010];\nint d[3][100010] = {};\nint dfs(int s, int p,int k){\n for(int v:G[s]){\n if(v==p) continue;\n d[k][v] = d[k][s] + 1;\n dfs(v,s,k);\n }\n}\n\nint mx[100010] = {};\nvoid dfs2(int s,int p,int dia,int par){\n for(int v:G[s]){\n if(v==p) continue;\n if(d[0][v] + d[1][v]==dia) continue;\n d[2][v] = d[2][s] + 1;\n mx[par] = max(mx[par],d[2][v]);\n dfs2(v,s,dia,par);\n }\n}\n\nint n,seg[2][200010];\nvoid init(int n,int x){\n for(int i=n - 1;i>0;i--){\n seg[x][i] = max(seg[x][i<<1],seg[x][i<<1|1]);\n }\n}\n\nvoid update(int val,int p,int x){\n for(seg[x][p += n] = val;p>1;p>>=1){\n seg[x][p>>1] = max(seg[x][p],seg[x][p^1]);\n }\n}\n\nint query(int l,int r,int x){\n int res = 0;\n for(l += n,r += n; l<r;l>>=1,r>>=1){\n if(l&1) res = max(res,seg[x][l++]);\n if(r&1) res = max(res,seg[x][--r]);\n }\n return res;\n}\n\nint ans[100010];\nint main(){\n int i;\n cin >> n;\n for(i=0;i<n - 1;i++){\n int a,b; cin >> a >> b;\n a--; b--;\n G[a].push_back(b); G[b].push_back(a);\n }\n dfs(0,-1,0);\n int j = -1,x = -1;\n for(i=0;i<n;i++){\n if(d[0][i]>x){\n j = i; x = d[0][i];\n }\n }\n for(i=0;i<n;i++){\n d[0][i] = 0;\n }\n dfs(j,-1,0);\n int jj = -1; x = -1;\n for(i=0;i<n;i++){\n if(d[0][i]>x){\n x = d[0][i];\n jj = i;\n }\n }\n int dia = x;\n dfs(jj,-1,1);\n vector<int> choku;\n ans[1] = 1; ans[2] = 1;\n for(i=dia + 1;i<=n;i++){\n ans[i] = 1;\n }\n for(i=0;i<n;i++){\n if(d[0][i] + d[1][i]==dia){\n dfs2(i,-1,dia,i);\n choku.push_back(i);\n }\n }\n for(i=0;i<choku.size();i++){\n int v = choku[i];\n if(mx[v]) update(mx[v] + d[0][v],d[0][v],0);\n if(mx[v]) update(mx[v] + d[1][v],d[1][v],1);\n }\n for(i=3;i<=dia;i++){\n if(i&1){\n if(query(0,n,0)>=i || query(0,n,1)>=i) ans[i] = 0;\n else ans[i] = 1;\n }else{\n int k = i/2;\n if(max(query(0,n,0),query(0,n,1))<i){\n ans[i] = 1;\n }else if(max(query(0,k,0),query(k + 1,n,0))>=i || max(query(0,k,1),query(k + 1,n,1))>=i){\n ans[i] = 0;\n }else if(max(query(k,k + 1,0),query(k,k + 1,1))==k){\n ans[i] = 1;\n }else{\n ans[i] = 0;\n }\n }\n }\n for(i=1;i<=n;i++){\n cout << ans[i];\n }\n cout << endl;\n}","accuracy":0.75,"time_ms":90,"memory_kb":18384,"score_of_the_acc":-0.3946,"final_rank":18},{"submission_id":"aoj_3148_4280122","code_snippet":"#include <bits/stdc++.h>\n#define be(v) (v).begin(),(v).end()\n#define pb(q) push_back(q)\ntypedef long long ll;\nusing namespace std;\nconst ll mod=1000000007;\n#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;\nvector<vector<ll> > v(100001);\n\nll ans=0,num=0,niko,kotori;\nll umi=0,mid;\nbool hanayo;\nvoid dfs(ll now,ll count,ll p){\n\tif(count>=ans){\n\t\tnum=now;\n\t\tans=count;\n\t}\n\tfor(auto& i:v[now]){\n\t\tif(i==p)continue;\n\t\tdfs(i,count+1,now);\n\t}\n\treturn;\n}\nbool eri=true;\nvoid solve(ll now,ll count,ll p){\n\tif(v[now].size()==1){\n\t\tif(count!=niko){\n\t\t\teri=false;\n\t\t}\n\t}\n\tfor(auto& i:v[now]){\n\t\tif(i==p)continue;\n\t\tsolve(i,count+1,now);\n\t}\n\treturn;\n}\nvoid honoka(ll now,ll count,ll p){\n\tif(v[now].size()==1){\n\t\tif(count>=mid)umi++;\n\t}else if(v[now].size()>=3){\n\t\tif(count>=mid)hanayo=false;\n\t}\n\tfor(auto& i:v[now]){\n\t\tif(i==p)continue;\n\t\thonoka(i,count+1,now);\n\t}\n\treturn;\n}\nint main() {\n cin.tie(0);\n cout.tie(0);\n ios::sync_with_stdio(false);\n ll n;\n cin>>n;\n ll a,b;\n for(int i=0;i<n-1;i++){\n \tcin>>a>>b;\n \ta--;b--;\n \tv[a].pb(b);\n \tv[b].pb(a);\n }\n ll m3=0;\n for(int i=0;i<n;i++){\n \tif(3<=v[i].size()){m3++;a=i;}\n }\n if(m3==0){\n \tfor(int i=0;i<n;i++){\n \t\tcout << 1;\n \t}\n \tcout <<endl;\n \treturn 0;\n }\n dfs(0,0,-1);\n kotori=num;\n dfs(num,0,-1);\n \n bool maki=true;\n if(m3>=2)maki=false;\n else{\n \tniko=ans/2;\n solve(a,0,-1);\n maki=eri;\n }\n ll le=0,ri=ans+1;\n while(ri-le>1){\n \tmid=(le+ri)/2;\n \tumi=0;\n \thanayo=true;\n \thonoka(num,0,-1);\n honoka(kotori,0,-1);\n if(umi==2&&hanayo){\n \tri=mid;\n }else{\n \tle=mid;\n }\n }\n \n\n for(int i=1;i<=n;i++){\n \tif(i>ans)cout <<1;\n \telse if(i==1||i==2)cout << 1;\n \telse if(i>=ri)cout << 1;\n \telse if(i&1)cout<<0;\n \telse if(i==ans&&maki){\n \t\tcout << 1;\n \t}else{\n \t\tcout << 0;\n \t}\n }\n cout<< endl;\n\treturn 0;\n}","accuracy":0.75,"time_ms":260,"memory_kb":13176,"score_of_the_acc":-1.0381,"final_rank":19}],"string":"[\n {\n \"submission_id\": \"aoj_3148_10155594\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n ios::sync_with_stdio(false); \\n cin.tie(nullptr);\\n int N; cin >> N;\\n vector<vector<int>> g(N);\\n for(int i=0;i<N-1;i++){\\n int u,v; cin >> u >> v; \\n u--; v--;\\n g[u].push_back(v); \\n g[v].push_back(u);\\n }\\n vector<int> parent(N,-1), q;\\n q.push_back(0);\\n for(int i=0;i<(int)q.size();i++){\\n int cur=q[i];\\n for(auto &adj: g[cur]){\\n if(adj==parent[cur]) continue;\\n parent[adj]=cur;\\n q.push_back(adj);\\n }\\n }\\n vector<int> len(N,0), lenDown(N,0);\\n int maxInvalid=0;\\n for(int i=N-1;i>=0;i--){\\n int cur=q[i];\\n for(auto &adj:g[cur]){\\n if(adj==parent[cur]) continue;\\n len[cur]=max(len[cur], len[adj]);\\n }\\n len[cur]++;\\n }\\n for(int i=0;i<N;i++){\\n int cur=q[i];\\n vector<int> maxLeft(g[cur].size()+1);\\n maxLeft[0]=lenDown[cur];\\n for(int j=0;j<(int)g[cur].size();j++){\\n int adj=g[cur][j];\\n maxLeft[j+1]=max(maxLeft[j], adj==parent[cur]?0:len[adj]);\\n }\\n int maxRight=0;\\n for(int j=(int)g[cur].size()-1;j>=0;j--){\\n int adj=g[cur][j];\\n if(adj==parent[cur]) continue;\\n lenDown[adj]=max(maxLeft[j], maxRight)+1;\\n maxRight=max(maxRight, len[adj]);\\n }\\n if((int)g[cur].size()>=3){\\n vector<int> lens; \\n lens.push_back(lenDown[cur]);\\n for(auto &adj:g[cur]){\\n if(adj==parent[cur]) continue;\\n lens.push_back(len[adj]);\\n }\\n sort(lens.begin(), lens.end());\\n int len0=lens.back();\\n int len1=lens[lens.size()-2];\\n int len2=lens[lens.size()-3];\\n maxInvalid=max(maxInvalid, len0);\\n if(len0==len2) maxInvalid=max(maxInvalid, len0+len2-1);\\n else maxInvalid=max(maxInvalid, len0+len2);\\n }\\n }\\n string ans(N,'1');\\n for(int i=3;i<=maxInvalid && i<=N;i++){\\n ans[i-1]='0';\\n }\\n cout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 11992,\n \"score_of_the_acc\": -0.0234,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3148_9159777\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\n\\nvector<vector<int>> g(100001);\\nvector<int> d(100001);\\nint limit=2;\\n\\nvoid dfs(int c,int pa){\\n d[c]=0;\\n for(int nx:g[c]){\\n if(nx==pa) continue;\\n dfs(nx,c);\\n d[c]=max(d[c],d[nx]);\\n }\\n d[c]++;\\n return;\\n}\\n\\nvoid dfs1(int c,int pa,int dp){\\n vector<pair<int,int>> p;\\n for(int nx:g[c]){\\n if(nx==pa) continue;\\n p.emplace_back(d[nx],nx);\\n }\\n p.emplace_back(dp,pa);\\n sort(p.rbegin(),p.rend());\\n \\n if((g[c].size()>=3)&&(p[2].first>=1)){\\n int d1=p[0].first;\\n int d2=p[2].first;\\n if(d1!=d2) limit=max(limit,d1+d2);\\n else limit=max(limit,d1+d2-1);\\n }\\n \\n for(int nx:g[c]){\\n if(nx==pa) continue;\\n if(nx==p[0].second) dfs1(nx,c,p[1].first+1);\\n else dfs1(nx,c,p[0].first+1);\\n }\\n return;\\n}\\n\\n\\nint main(){\\n int N;\\n cin >> N;\\n if(N==1){\\n cout << 1 << endl;\\n return 0;\\n }\\n \\n int a,b;\\n\\n for(int i=0;i<N-1;i++){\\n cin >> a >> b;\\n a--;b--;\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n \\n dfs(0,-1);\\n dfs1(0,-1,0);\\n \\n vector<int> ans(N,1);\\n for(int i=2;i<limit;i++) ans[i]=0;\\n //cout << limit << endl;\\n //for(int i=0;i<N;i++) cout << d[i] << endl;\\n \\n for(int x:ans) cout << x;\\n cout << endl;\\n\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 22776,\n \"score_of_the_acc\": -0.2825,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3148_6593691\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 100005\\n\\nstruct Info{\\n\\tInfo(int arg_node,int arg_dist){\\n\\t\\tnode = arg_node;\\n\\t\\tdist = arg_dist;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\n\\t\\treturn dist > arg.dist;\\n\\t}\\n\\tint node,dist;\\n};\\n\\nint N;\\nint max_dist[SIZE];\\nint number;\\nvector<int> G[SIZE];\\nvector<Info> children[SIZE];\\n\\nvoid dfs(int node_id,int pre){\\n\\n\\tint tmp_max = 0;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs(child,node_id);\\n\\n\\t\\tchildren[node_id].push_back(Info(child,max_dist[child]+1));\\n\\t\\ttmp_max = max(tmp_max,max_dist[child]+1);\\n\\t}\\n\\tmax_dist[node_id] = tmp_max;\\n}\\n\\nvoid dfs2(int node_id,int pre){\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre){\\n\\n\\t\\t\\tif(node_id == children[pre][0].node){ //自分が親の最大方向\\n\\n\\t\\t\\t\\tif(children[pre].size() == 1){ //親の子が自分しかいない\\n\\n\\t\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,1));\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,children[pre][1].dist+1));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,children[pre][0].dist+1));\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tint value;\\n\\n\\tif(children[node_id].size() > 2){\\n\\n\\t\\tsort(children[node_id].begin(),children[node_id].end());\\n\\n\\t\\tif(children[node_id][0].dist == children[node_id][2].dist){\\n\\n\\t\\t\\tvalue = children[node_id][0].dist + children[node_id][2].dist;\\n\\t\\t}else{\\n\\n\\t\\t\\tvalue = children[node_id][0].dist+children[node_id][2].dist+1;\\n\\t\\t}\\n\\n\\t\\t//printf(\\\"node_id:%d\\\\n\\\",node_id);\\n\\t\\t/*for(int i = 0; i < 3; i++){\\n\\n\\t\\t\\tprintf(\\\"child[%d]:%d dist:%d\\\\n\\\",i,children[node_id][i].node,children[node_id][i].dist);\\n\\t\\t}*/\\n\\n\\t\\tnumber = max(number,value);\\n\\t}\\n\\n\\t//親を先に処理\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs2(child,node_id);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint from,to;\\n\\tfor(int i = 0; i < N-1; i++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\n\\tif(N <= 2){\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\t\\tprintf(\\\"1\\\");\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tmax_dist[i] = 0;\\n\\t}\\n\\n\\tdfs(0,-1);\\n\\n\\tnumber = -1;\\n\\tdfs2(0,-1);\\n\\n\\tif(number <= 2){\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\t\\tprintf(\\\"1\\\");\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tprintf(\\\"11\\\");\\n\\tfor(int i = 3; i <= number-1; i++){\\n\\n\\t\\tprintf(\\\"0\\\");\\n\\t}\\n\\tfor(int i = number; i <= N; i++){\\n\\n\\t\\tprintf(\\\"1\\\");\\n\\t}\\n\\tprintf(\\\"\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 25424,\n \"score_of_the_acc\": -0.3988,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3148_4875890\",\n \"code_snippet\": \"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3142\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\n//END CUT HERE\\n#ifndef call_from_test\\n//INSERT ABOVE HERE\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n\\n//BEGIN CUT HERE\\ntemplate<typename T, typename Edge>\\nstruct ReRooting{\\n struct Node{\\n int to,rev;\\n Edge data;\\n Node(int to,Edge data):to(to),data(data){}\\n bool operator<(const Node &v)const{return to<v.to;};\\n };\\n\\n using Fold = function<T(T, T)>;\\n using Lift = function<T(T, Edge)>;\\n\\n vector< vector<Node> > G;\\n vector< vector<T> > ld,rd;\\n vector<int> lp,rp;\\n\\n const Fold fold;\\n const Lift lift;\\n const T id;\\n\\n ReRooting(int n,const Fold fold,const Lift lift,const T id):\\n G(n),ld(n),rd(n),lp(n),rp(n),fold(fold),lift(lift),id(id){}\\n\\n void add_edge(int u,int v,Edge d,Edge e){\\n G[u].emplace_back(v,d);\\n G[v].emplace_back(u,e);\\n }\\n\\n void add_edge(int u,int v,Edge d){add_edge(u,v,d,d);}\\n\\n // k: idx for edge (not vertex)\\n T dfs(int v,int k){\\n while(lp[v]!=k and lp[v]<(int)G[v].size()){\\n auto &e=G[v][lp[v]];\\n ld[v][lp[v]+1]=fold(ld[v][lp[v]],lift(dfs(e.to,e.rev),e.data));\\n lp[v]++;\\n }\\n while(rp[v]!=k and rp[v]>=0){\\n auto &e=G[v][rp[v]];\\n rd[v][rp[v]]=fold(rd[v][rp[v]+1],lift(dfs(e.to,e.rev),e.data));\\n rp[v]--;\\n }\\n if(k<0) return rd[v][0];\\n return fold(ld[v][k],rd[v][k+1]);\\n }\\n\\n int search(vector<Node> &vs,int idx){\\n return lower_bound(vs.begin(),vs.end(),Node(idx,vs[0].data))-vs.begin();\\n }\\n\\n vector<T> build(){\\n int n=G.size();\\n for(int i=0;i<n;i++){\\n sort(G[i].begin(),G[i].end());\\n ld[i].assign((int)G[i].size()+1,id);\\n rd[i].assign((int)G[i].size()+1,id);\\n lp[i]=0;\\n rp[i]=(int)G[i].size()-1;\\n }\\n\\n for(int i=0;i<n;i++)\\n for(Node &t:G[i])\\n t.rev=search(G[t.to],i);\\n\\n vector<T> res;\\n for(int i=0;i<n;i++)\\n res.emplace_back(dfs(i,-1));\\n\\n return res;\\n }\\n\\n // p: idx for vertex\\n T subtree(int v,int p){\\n int k=search(G[p],v);\\n assert(k<(int)G[p].size() and G[p][k].to==v);\\n return lift(dfs(v,G[p][k].rev),G[p][k].data);\\n }\\n};\\n//END CUT HERE\\n#ifndef call_from_test\\n//INSERT ABOVE HERE\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#undef call_from_test\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n using ll = long long;\\n\\n struct T{\\n ll a,b,c;\\n T(ll a,ll b,ll c):a(a),b(b),c(c){}\\n };\\n\\n const ll INF = 1e9;\\n auto fold=[&](T x,T y){\\n vector<ll> vs({x.a,x.b,x.c,y.a,y.b,y.c});\\n sort(vs.rbegin(),vs.rend());\\n return T(vs[0],vs[1],vs[2]);\\n };\\n auto lift=[&](T x,ll y){\\n chmax(x.a,0);\\n x.a+=y;\\n x.b=-INF;\\n x.c=-INF;\\n return x;\\n };\\n\\n int n;\\n cin>>n;\\n if(n==1) drop(1);\\n\\n ReRooting<T, ll> G(n,fold,lift,T(-INF,-INF,-INF));\\n for(int i=1;i<n;i++){\\n int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.add_edge(u,v,1);\\n }\\n auto res=G.build();\\n\\n string ans(n+1,'1');\\n\\n for(int i=0;i<n;i++){\\n if(G.G[i].size()<3) continue;\\n T v=res[i];\\n ans[v.a+min({v.a-1,v.b,v.c})]='0';\\n }\\n\\n for(int i=n-1;i>=0;i--)\\n if(ans[i+1]=='0') ans[i]='0';\\n\\n ans[1]='1';\\n ans[2]='1';\\n cout<<ans.substr(1)<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 88340,\n \"score_of_the_acc\": -1.5147,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3148_4875801\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\n\\n\\ntemplate<typename Data, typename T>\\nstruct ReRooting{\\n struct Node{\\n Int to,rev;\\n Data data;\\n Node(Int to,Int rev,Data data):to(to),rev(rev),data(data){}\\n };\\n\\n using F1 = function<T(T, T)>;\\n using F2 = function<T(T, Data)>;\\n\\n vector<vector<Node> > G;\\n vector<vector<T> > ld,rd;\\n vector<Int> lp,rp;\\n\\n const F1 f1;\\n const F2 f2;\\n const T id;\\n\\n ReRooting(Int n,const F1 f1,const F2 f2,const T &id):\\n G(n),ld(n),rd(n),lp(n),rp(n),f1(f1),f2(f2),id(id){}\\n\\n void add_edge(Int u,Int v,Data d){\\n G[u].emplace_back(v,(Int)G[v].size(),d);\\n G[v].emplace_back(u,(Int)G[u].size()-1,d);\\n }\\n\\n // p: idx for edge (not vertex)\\n T dfs(Int v,Int p){\\n while(lp[v]!=p&&lp[v]<(Int)G[v].size()){\\n auto &e=G[v][lp[v]];\\n ld[v][lp[v]+1]=f1(ld[v][lp[v]],f2(dfs(e.to,e.rev),e.data));\\n lp[v]++;\\n }\\n while(rp[v]!=p&&rp[v]>=0){\\n auto &e=G[v][rp[v]];\\n rd[v][rp[v]]=f1(rd[v][rp[v]+1],f2(dfs(e.to,e.rev),e.data));\\n rp[v]--;\\n }\\n if(p<0) return rd[v][0];\\n return f1(ld[v][p],rd[v][p+1]);\\n }\\n\\n vector<T> build(){\\n for(Int i=0;i<(Int)G.size();i++){\\n ld[i].assign((Int)G[i].size()+1,id);\\n rd[i].assign((Int)G[i].size()+1,id);\\n lp[i]=0;\\n rp[i]=(Int)G[i].size()-1;\\n }\\n vector<T> res;\\n for(Int i=0;i<(Int)G.size();i++){\\n res.emplace_back(dfs(i,-1));\\n }\\n return res;\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n struct T{\\n Int a,b,c;\\n T(Int a,Int b,Int c):a(a),b(b),c(c){}\\n };\\n\\n const Int INF = 1e9;\\n auto f1=\\n [&](T x,T y){\\n vector<Int> vs({x.a,x.b,x.c,y.a,y.b,y.c});\\n sort(vs.rbegin(),vs.rend());\\n return T(vs[0],vs[1],vs[2]);\\n };\\n auto f2=\\n [&](T x,Int y){\\n chmax(x.a,0);\\n x.a+=y;\\n x.b=-INF;\\n x.c=-INF;\\n return x;\\n };\\n\\n Int n;\\n cin>>n;\\n if(n==1) drop(1);\\n\\n ReRooting<Int, T> G(n,f1,f2,T(-INF,-INF,-INF));\\n for(Int i=1;i<n;i++){\\n Int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.add_edge(u,v,1);\\n }\\n auto res=G.build();\\n\\n string ans(n+1,'1');\\n\\n for(Int i=0;i<n;i++){\\n if(G.G[i].size()<3) continue;\\n T v=res[i];\\n assert(v.a>=v.b);\\n assert(v.b>=v.c);\\n assert(v.c>=1);\\n // cout<<v.a<<\\\" \\\"<<v.b<<\\\" \\\"<<v.c<<endl;\\n ans[v.a+min({v.a-1,v.b,v.c})]='0';\\n }\\n\\n for(Int i=n-1;i>=0;i--)\\n if(ans[i+1]=='0') ans[i]='0';\\n\\n ans[1]='1';\\n ans[2]='1';\\n cout<<ans.substr(1)<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 90512,\n \"score_of_the_acc\": -1.5833,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3148_4740389\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 100005\\n\\nstruct Info{\\n\\tInfo(int arg_node,int arg_dist){\\n\\t\\tnode = arg_node;\\n\\t\\tdist = arg_dist;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\n\\t\\treturn dist > arg.dist;\\n\\t}\\n\\tint node,dist;\\n};\\n\\nint N;\\nint max_dist[SIZE];\\nint number;\\nvector<int> G[SIZE];\\nvector<Info> children[SIZE];\\n\\nvoid dfs(int node_id,int pre){\\n\\n\\tint tmp_max = 0;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs(child,node_id);\\n\\n\\t\\tchildren[node_id].push_back(Info(child,max_dist[child]+1));\\n\\t\\ttmp_max = max(tmp_max,max_dist[child]+1);\\n\\t}\\n\\tmax_dist[node_id] = tmp_max;\\n}\\n\\nvoid dfs2(int node_id,int pre){\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre){\\n\\n\\t\\t\\tif(node_id == children[pre][0].node){ //自分が親の最大方向\\n\\n\\t\\t\\t\\tif(children[pre].size() == 1){ //親の子が自分しかいない\\n\\n\\t\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,1));\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,children[pre][1].dist+1));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,children[pre][0].dist+1));\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tint value;\\n\\n\\tif(children[node_id].size() > 2){\\n\\n\\t\\tsort(children[node_id].begin(),children[node_id].end());\\n\\n\\t\\tif(children[node_id][0].dist == children[node_id][2].dist){\\n\\n\\t\\t\\tvalue = children[node_id][0].dist + children[node_id][2].dist;\\n\\t\\t}else{\\n\\n\\t\\t\\tvalue = children[node_id][0].dist+children[node_id][2].dist+1;\\n\\t\\t}\\n\\n\\t\\t//printf(\\\"node_id:%d\\\\n\\\",node_id);\\n\\t\\t/*for(int i = 0; i < 3; i++){\\n\\n\\t\\t\\tprintf(\\\"child[%d]:%d dist:%d\\\\n\\\",i,children[node_id][i].node,children[node_id][i].dist);\\n\\t\\t}*/\\n\\n\\t\\tnumber = max(number,value);\\n\\t}\\n\\n\\t//親を先に処理\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs2(child,node_id);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint from,to;\\n\\tfor(int i = 0; i < N-1; i++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\n\\tif(N <= 2){\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\t\\tprintf(\\\"1\\\");\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tmax_dist[i] = 0;\\n\\t}\\n\\n\\tdfs(0,-1);\\n\\n\\tnumber = -1;\\n\\tdfs2(0,-1);\\n\\n\\tif(number <= 2){\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\t\\tprintf(\\\"1\\\");\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tprintf(\\\"11\\\");\\n\\tfor(int i = 3; i <= number-1; i++){\\n\\n\\t\\tprintf(\\\"0\\\");\\n\\t}\\n\\tfor(int i = number; i <= N; i++){\\n\\n\\t\\tprintf(\\\"1\\\");\\n\\t}\\n\\tprintf(\\\"\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 25440,\n \"score_of_the_acc\": -0.3573,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3148_4740379\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 100005\\n\\nstruct Info{\\n\\tInfo(int arg_node,int arg_dist){\\n\\t\\tnode = arg_node;\\n\\t\\tdist = arg_dist;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\n\\t\\treturn dist > arg.dist;\\n\\t}\\n\\tint node,dist;\\n};\\n\\nint N;\\nint max_dist[SIZE];\\nint number;\\nvector<int> G[SIZE];\\nvector<Info> children[SIZE];\\n\\nvoid dfs(int node_id,int pre){\\n\\n\\tint tmp_max = 0;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs(child,node_id);\\n\\n\\t\\tchildren[node_id].push_back(Info(child,max_dist[child]+1));\\n\\t\\ttmp_max = max(tmp_max,max_dist[child]+1);\\n\\t}\\n\\tmax_dist[node_id] = tmp_max;\\n}\\n\\nvoid dfs2(int node_id,int pre){\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre){\\n\\n\\t\\t\\tif(node_id == children[pre][0].node){ //自分が親の最大方向\\n\\n\\t\\t\\t\\tif(children[pre].size() == 1){ //親の子が自分しかいない\\n\\n\\t\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,1));\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,children[pre][1].dist+1));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,children[pre][0].dist+1));\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tint value;\\n\\n\\tif(children[node_id].size() > 2){\\n\\n\\t\\tsort(children[node_id].begin(),children[node_id].end());\\n\\n\\t\\tif(children[node_id][0].dist == children[node_id][2].dist){\\n\\n\\t\\t\\tvalue = children[node_id][0].dist + children[node_id][2].dist;\\n\\t\\t}else{\\n\\n\\t\\t\\tvalue = children[node_id][0].dist+children[node_id][2].dist+1;\\n\\t\\t}\\n\\n\\t\\t//printf(\\\"node_id:%d\\\\n\\\",node_id);\\n\\t\\t/*for(int i = 0; i < 3; i++){\\n\\n\\t\\t\\tprintf(\\\"child[%d]:%d dist:%d\\\\n\\\",i,children[node_id][i].node,children[node_id][i].dist);\\n\\t\\t}*/\\n\\n\\t\\tnumber = max(number,value);\\n\\t}\\n\\n\\t//親を先に処理\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs2(child,node_id);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint from,to;\\n\\tfor(int i = 0; i < N-1; i++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\n\\tif(N <= 2){\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\t\\tprintf(\\\"1\\\");\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tmax_dist[i] = 0;\\n\\t}\\n\\n\\tdfs(0,-1);\\n\\n\\tnumber = -1;\\n\\tdfs2(0,-1);\\n\\n\\tif(number == -1){\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\t\\tprintf(\\\"1\\\");\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tprintf(\\\"11\\\");\\n\\tfor(int i = 3; i <= number-1; i++){\\n\\n\\t\\tprintf(\\\"0\\\");\\n\\t}\\n\\tfor(int i = number; i <= N; i++){\\n\\n\\t\\tprintf(\\\"1\\\");\\n\\t}\\n\\tprintf(\\\"\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.8026315789473685,\n \"time_ms\": 70,\n \"memory_kb\": 25496,\n \"score_of_the_acc\": -0.3997,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3148_4740365\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 100005\\n\\nstruct Info{\\n\\tInfo(int arg_node,int arg_dist){\\n\\t\\tnode = arg_node;\\n\\t\\tdist = arg_dist;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\n\\t\\treturn dist > arg.dist;\\n\\t}\\n\\tint node,dist;\\n};\\n\\nint N;\\nint max_dist[SIZE];\\nint number;\\nvector<int> G[SIZE];\\nvector<Info> children[SIZE];\\n\\nvoid dfs(int node_id,int pre){\\n\\n\\tint tmp_max = 0;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs(child,node_id);\\n\\n\\t\\tchildren[node_id].push_back(Info(child,max_dist[child]+1));\\n\\t\\ttmp_max = max(tmp_max,max_dist[child]+1);\\n\\t}\\n\\tmax_dist[node_id] = tmp_max;\\n}\\n\\nvoid dfs2(int node_id,int pre){\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre){\\n\\n\\t\\t\\tif(node_id == children[pre][0].node){ //自分が親の最大方向\\n\\n\\t\\t\\t\\tif(children[pre].size() == 1){ //親の子が自分しかいない\\n\\n\\t\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,1));\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,children[pre][1].dist+1));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tchildren[node_id].push_back(Info(pre,children[pre][0].dist+1));\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tint value;\\n\\n\\tif(children[node_id].size() > 2){\\n\\n\\t\\tsort(children[node_id].begin(),children[node_id].end());\\n\\n\\t\\tif(children[node_id][0].dist == children[node_id][2].dist){\\n\\n\\t\\t\\tvalue = children[node_id][0].dist + children[node_id][2].dist;\\n\\t\\t}else{\\n\\n\\t\\t\\tvalue = children[node_id][0].dist+children[node_id][2].dist+1;\\n\\t\\t}\\n\\n\\t\\t//printf(\\\"node_id:%d\\\\n\\\",node_id);\\n\\t\\t/*for(int i = 0; i < 3; i++){\\n\\n\\t\\t\\tprintf(\\\"child[%d]:%d dist:%d\\\\n\\\",i,children[node_id][i].node,children[node_id][i].dist);\\n\\t\\t}*/\\n\\n\\t\\tnumber = max(number,value);\\n\\t}\\n\\n\\t//親を先に処理\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint child = G[node_id][i];\\n\\t\\tif(child == pre)continue;\\n\\n\\t\\tdfs2(child,node_id);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint from,to;\\n\\tfor(int i = 0; i < N-1; i++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\n\\tif(N <= 2){\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\t\\tprintf(\\\"1\\\");\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tmax_dist[i] = 0;\\n\\t}\\n\\n\\tdfs(0,-1);\\n\\n\\tnumber = -1;\\n\\tdfs2(0,-1);\\n\\n\\t//printf(\\\"number:%d\\\\n\\\",number);\\n\\n\\tprintf(\\\"11\\\");\\n\\tfor(int i = 3; i <= number-1; i++){\\n\\n\\t\\tprintf(\\\"0\\\");\\n\\t}\\n\\tfor(int i = number; i <= N; i++){\\n\\n\\t\\tprintf(\\\"1\\\");\\n\\t}\\n\\tprintf(\\\"\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.19736842105263158,\n \"time_ms\": 30,\n \"memory_kb\": 25452,\n \"score_of_the_acc\": -0.2325,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3148_4554477\",\n \"code_snippet\": \"#include <iostream>\\n#include <utility>\\n#include <tuple>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <algorithm>\\n#include <functional>\\n#include <climits>\\n#include <numeric>\\n#include <queue>\\n#include <cmath>\\n#include <iomanip>\\n#include <array>\\n#include <string>\\n#include <stack>\\n\\nint main() {\\n\\tint n; std::cin >> n;\\n\\tstd::vector<std::vector<int>> nodes(n);\\n\\tfor (auto i = 1; i < n; ++i) {\\n\\t\\tint a, b; std::cin >> a >> b;\\n\\t\\tnodes[a - 1].push_back(b - 1);\\n\\t\\tnodes[b - 1].push_back(a - 1);\\n\\t}\\n\\tstd::stack<int> stack; stack.push(0);\\n\\tstd::vector<int> depth(n, -1); depth[0] = 1;\\n\\twhile (!stack.empty()) {\\n\\t\\tconst auto top = stack.top(); stack.pop();\\n\\t\\tfor (const auto next : nodes[top]) if (depth[next] == -1) {\\n\\t\\t\\tdepth[next] = depth[top] + 1;\\n\\t\\t\\tstack.push(next);\\n\\t\\t}\\n\\t}\\n\\tconst auto end_a = std::distance(depth.begin(), std::max_element(depth.begin(), depth.end()));\\n\\tstack.push(end_a);\\n\\tdepth.assign(n, -1); depth[end_a] = 1;\\n\\tstd::vector<int> height(n, -1);\\n\\twhile (!stack.empty()) {\\n\\t\\tconst auto top = stack.top(); stack.pop();\\n\\t\\tif (top >= 0) {\\n\\t\\t\\tstack.push(-1 - top);\\n\\t\\t\\tfor (const auto next : nodes[top]) if (depth[next] == -1) {\\n\\t\\t\\t\\tdepth[next] = depth[top] + 1;\\n\\t\\t\\t\\tstack.push(next);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tconst auto current = -1 - top;\\n\\t\\t\\theight[current] = 1;\\n\\t\\t\\tfor (const auto next : nodes[current]) {\\n\\t\\t\\t\\theight[current] = std::max(height[current], height[next] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint max{ 2 };\\n\\tfor (auto i = 0; i < n; ++i) if (nodes[i].size() >= 3) {\\n\\t\\tstd::vector<int> length; length.reserve(nodes[i].size() + 1);\\n\\t\\tstd::transform(nodes[i].begin(), nodes[i].end(), std::back_inserter(length), [&depth, &height, i](const int a) {return depth[i] < depth[a] ? height[a] : depth[a]; });\\n\\t\\tstd::sort(length.rbegin(), length.rend());\\n\\t\\tconst auto k = length[0] + length[2];\\n\\t\\tif (length[0] == length[2]) {\\n\\t\\t\\tmax = std::max(max, k);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tmax = std::max(max, k + 1);\\n\\t\\t}\\n\\t}\\n\\tfor (auto i = 1; i <= n; ++i) {\\n\\t\\tif (3 <= i && i < max) {\\n\\t\\t\\tstd::cout << '0';\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tstd::cout << '1';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 10112,\n \"score_of_the_acc\": -0.1667,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3148_4380076\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <ctime>\\n#include <cstdlib>\\n#include <cassert>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <string>\\n#include <algorithm>\\n#define llint long long\\n#define inf 1e18\\n#define mod 998244353\\n#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)\\n#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\\n\\nusing namespace std;\\ntypedef pair<llint, llint> P;\\n\\nint n;\\nvector<llint> G[100005];\\nmap<P, llint> mp;\\nint dif[100005];\\n\\nint parent[500005];\\nllint dp[500005], dp2[500005];\\n\\nconst llint e = 0; //\\nllint ope(llint a, llint b)\\n{\\n\\treturn max(a, b); //\\n}\\n\\nllint get(int u, int v)\\n{\\n\\tif(parent[u] == v) return dp2[u];\\n\\telse return dp[v];\\n}\\n\\nvoid dfs(int v, int p)\\n{\\n\\tparent[v] = p;\\n\\tfor(int i = 0; i < G[v].size(); i++){\\n\\t\\tif(G[v][i] == p) continue;\\n\\t\\tdfs(G[v][i], v);\\n\\t}\\n\\t\\n\\tllint sum = e;\\n\\tfor(int i = 0; i < G[v].size(); i++){\\n\\t\\tint u = G[v][i];\\n\\t\\tif(u == p) continue;\\n\\t\\tsum = ope(sum, get(v, u)); //\\n\\t}\\n\\tdp[v] = sum+1; //\\n}\\n\\nllint lsum[500005], rsum[500005];\\nvoid dfs2(int v, int p)\\n{\\n\\tllint m = G[v].size(), sum;\\n\\t\\n\\tsum = lsum[0] = e;\\n\\tfor(int i = 0; i < m; i++){\\n\\t\\tint u = G[v][i];\\n\\t\\tsum = ope(sum, get(v, u)); //\\n\\t\\tlsum[i+1] = sum;\\n\\t}\\n\\tsum = rsum[m+1] = e;\\n\\tfor(int i = m-1; i >= 0; i--){\\n\\t\\tint u = G[v][i];\\n\\t\\tsum = ope(sum, get(v, u)); //\\n\\t\\trsum[i+1] = sum;\\n\\t}\\n\\tfor(int i = 0; i < m; i++){\\n\\t\\tif(G[v][i] == p) continue;\\n\\t\\tdp2[G[v][i]] = ope(lsum[i], rsum[i+2])+1; //\\n\\t}\\n\\t\\n\\tfor(int i = 0; i < G[v].size(); i++){\\n\\t\\tif(G[v][i] == p) continue;\\n\\t\\tdfs2(G[v][i], v);\\n\\t}\\n}\\n\\nint main(void)\\n{\\n\\tios::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\t\\n\\tcin >> n;\\n\\tint u, v;\\n\\tfor(int i = 0; i < n-1; i++){\\n\\t\\tcin >> u >> v;\\n\\t\\tG[u].push_back(v);\\n\\t\\tG[v].push_back(u);\\n\\t}\\n\\t\\n\\tdfs(1, -1);\\n\\tdfs2(1, -1);\\n\\t\\n\\t/*for(auto it = mp.begin(); it != mp.end(); it++){\\n\\t\\tcout << it->first.first << \\\" \\\" << it->first.second << \\\" \\\" << it->second << endl;\\n\\t}*/\\n\\t\\n\\tvector<llint> vec;\\n\\tfor(int i = 1; i <= n; i++){\\n\\t\\tif(G[i].size() < 3) continue;\\n\\t\\tvec.clear();\\n\\t\\tfor(int j = 0; j < G[i].size(); j++){\\n\\t\\t\\tvec.push_back(get(i, G[i][j]));\\n\\t\\t}\\n\\t\\tsort(vec.rbegin(), vec.rend());\\n\\t\\tllint x = vec[0], y = vec[2], l, r;\\n\\t\\t//cout << i << \\\" \\\" << x << \\\" \\\" << y << endl;\\n\\t\\tif(y == 0 || x+y < 3) continue;\\n\\t\\t\\n\\t\\tif(x > y) l = 3, r = x+y;\\n\\t\\telse l = 3, r = 2*x-1;\\n\\t\\tdif[l]++, dif[r+1]--;\\n\\t}\\n\\t\\n\\tllint sum = 0;\\n\\tfor(int i = 1; i <= n; i++){\\n\\t\\tsum += dif[i];\\n\\t\\tif(sum) cout << 0;\\n\\t\\telse cout << 1;\\n\\t}\\n\\tcout << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 16868,\n \"score_of_the_acc\": -0.209,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3148_4357023\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,a,n) for (int i=a;i<n;i++)\\n#define per(i,a,n) for (int i=n-1;i>=a;i--)\\n#define pb push_back\\n#define mp make_pair\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define SZ(x) ((int)(x).size())\\ntypedef vector<int> VI;\\ntypedef long long ll;\\ntypedef pair<int,int> PII;\\ntypedef double db;\\nmt19937 mrand(random_device{}()); \\nconst ll mod=998244353;\\nint rnd(int x) { return mrand() % x;}\\nll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\\nll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}\\n// head\\n\\nconst int N=101000;\\nint n,u,v;\\nint dis[N],dis2[N];\\nVI e[N],br[N];\\n\\nvoid dfs(int u,int f) {\\n\\tdis[u]=0;\\n\\tfor (auto v:e[u]) {\\n\\t\\tif (v==f) continue;\\n\\t\\tdfs(v,u);\\n\\t\\tdis[u]=max(dis[u],dis[v]+1);\\n\\t\\tbr[u].pb(dis[v]+1);\\n\\t}\\n}\\n\\nvoid dfs2(int u,int f) {\\n\\tint mx=0,mx2=0;\\n\\tif (u!=1) br[u].pb(dis2[u]);\\n\\tmx=dis2[u];\\n\\t//printf(\\\"uu %d %d\\\\n\\\",u,dis2[u]);\\n\\tfor (auto x:br[u]) {\\n\\t\\tif (x>mx) mx2=mx,mx=x;\\n\\t\\telse if (x>mx2) mx2=x;\\n\\t}\\n\\tfor (auto v:e[u]) {\\n\\t\\tif (v==f) continue;\\n\\t\\tif (dis[v]+1==mx) dis2[v]=mx2+1;\\n\\t\\telse dis2[v]=mx+1;\\n\\t\\tdfs2(v,u);\\n\\t}\\n}\\nint main() {\\n\\tscanf(\\\"%d\\\",&n);\\n\\trep(i,1,n) {\\n\\t\\tscanf(\\\"%d%d\\\",&u,&v);\\n\\t\\te[u].pb(v);\\n\\t\\te[v].pb(u);\\n\\t}\\n\\tdfs(1,0);\\n\\tdfs2(1,0);\\n\\t/*rep(i,1,n+1) {\\n\\t\\tfor (auto x:br[i]) printf(\\\"%d \\\",x);\\n\\t\\tputs(\\\"\\\");\\n\\t}*/\\n\\tint t=0;\\n\\trep(i,1,n+1) if (SZ(br[i])>=3) {\\n\\t\\tsort(all(br[i]));\\n\\t\\treverse(all(br[i]));\\n\\t\\tt=max(t,br[i][0]+br[i][2]-(br[i][0]==br[i][2]));\\n\\t}\\n\\trep(i,1,n+1) putchar((i<=2||i>t)?'1':'0');\\n\\tputs(\\\"\\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 24372,\n \"score_of_the_acc\": -0.3857,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3148_4285725\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#ifndef ONLINE_JUDGE\\n#define dbg(x...) do { cout << \\\"\\\\033[32;1m \\\" << #x << \\\" -> \\\"; err(x); } while (0)\\nvoid err() { cout << \\\"\\\\033[39;0m\\\" << endl; }\\ntemplate<template<typename...> class T, typename t, typename... A>\\nvoid err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }\\ntemplate<typename T, typename... A>\\nvoid err(T a, A... x) { cout << a << ' '; err(x...); }\\n#else\\n#define dbg(...)\\n#endif\\ntypedef long long ll;\\ntypedef pair<int,int> pi;\\ntypedef vector<int> vi;\\ntemplate<class T> using vc=vector<T>;\\ntemplate<class T> using vvc=vc<vc<T>>;\\ntemplate<class T> void mkuni(vector<T>&v)\\n{\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\nll rand_int(ll l, ll r) //[l, r]\\n{\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n return uniform_int_distribution<ll>(l, r)(gen);\\n}\\ntemplate<class T>\\nvoid print(T x,int suc=1)\\n{\\n cout<<x;\\n if(suc==1) cout<<'\\\\n';\\n else cout<<' ';\\n}\\ntemplate<class T>\\nvoid print(const vector<T>&v,int suc=1)\\n{\\n for(int i=0;i<v.size();i++)\\n print(v[i],i==(int)(v.size())-1?suc:2);\\n}\\nconst int maxn=1e5+7;\\nvi G[maxn];\\nint dp[maxn];\\nint len;\\nvoid dfs(int u,int fa=-1)\\n{\\n dp[u]=1;\\n for(auto v:G[u])if(v!=fa)\\n {\\n dfs(v,u);\\n dp[u]=max(dp[u],dp[v]+1);\\n }\\n}\\nvoid dfs2(int u,int fa=-1)\\n{\\n multiset<int> son;\\n for(auto v:G[u])\\n son.insert(dp[v]);\\n if(son.size()>2)\\n {\\n //dbg(u,son);\\n auto it=son.rbegin();\\n vi all;\\n for(int i=0;i<3;i++)\\n {\\n all.push_back(*it);\\n it++;\\n }\\n if(all[0]!=all[2])\\n len=max(len,all[0]+all[2]+1);\\n else len=max(len,all[0]+all[2]);\\n }\\n for(auto v:G[u])if(v!=fa)\\n {\\n son.erase(son.find(dp[v]));\\n int tmp=dp[u];\\n if(son.empty()) dp[u]=1;\\n else dp[u]=(*son.rbegin())+1;\\n int tmpv=dp[v];\\n dp[v]=max(dp[v],dp[u]+1);\\n dfs2(v,u);\\n dp[u]=tmp;\\n dp[v]=tmpv;\\n son.insert(dp[v]);\\n }\\n}\\nint main()\\n{\\n int n;\\n cin>>n;\\n len=2;\\n string ans;\\n for(int i=0;i<n;i++) ans+='1';\\n bool ac=1;\\n for(int i=1,u,v;i<n;i++)\\n {\\n cin>>u>>v;\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n dfs(1);\\n dfs2(1);\\n for(int i=2;i<len-1;i++) ans[i]='0';\\n cout<<ans<<'\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 30672,\n \"score_of_the_acc\": -0.5474,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3148_4283964\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <iomanip>\\n#include <set>\\n#include <tuple>\\n#define mkp make_pair\\n#define mkt make_tuple\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD=1e9+7;\\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\\n\\nvector<vector<int>> g;\\nvector<int> dp;\\nvector<vector<int>> len;\\n\\nvoid predfs(int now,int par){\\n int res=0;\\n for(auto nex:g[now]) if(nex!=par){\\n predfs(nex,now);\\n chmax(res,dp[nex]+1);\\n len[now].push_back(dp[nex]+1);\\n }\\n dp[now]=res;\\n}\\n\\nvoid dfs(int now,int par,int pval){\\n if(par!=-1) len[now].push_back(pval);\\n sort(len[now].rbegin(),len[now].rend());\\n\\n for(auto nex:g[now]) if(nex!=par){\\n int neco=len[now][0];\\n if(neco==dp[nex]+1){\\n if(len[now].size()>1) neco=len[now][1];\\n else neco=0;\\n }\\n dfs(nex,now,neco+1);\\n }\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int N;\\n cin>>N;\\n g.resize(N);\\n rep(i,N-1){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n\\n dp.resize(N,0);\\n len.resize(N);\\n predfs(0,-1);\\n\\n dfs(0,-1,-1);\\n\\n int lim=0;\\n for(int i=0;i<N;i++){\\n if(len[i].size()<=2) continue;\\n int fir=len[i][0];\\n int sec=len[i][2];\\n if(fir==sec) sec--;\\n chmax(lim,fir+sec);\\n }\\n\\n string ans(N,'1');\\n rep(i,lim) ans[i]='0';\\n ans[0]='1';ans[1]='1';\\n cout<<ans<<endl;\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 25352,\n \"score_of_the_acc\": -0.3562,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3148_4280837\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define mp make_pair\\n#define eb emplace_back\\n#define ALL(A) A.begin(),A.end()\\n#define RALL(A) A.rbegin(),A.rend()\\ntypedef long long LL;\\ntypedef pair<int,int> P;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\\nconst LL mod=998244353;\\nconst LL LINF=1LL<<62;\\nconst int INF=1<<30;\\nint dx[]={1,0,-1,0,1,-1,1,-1};\\nint dy[]={0,1,0,-1,1,-1,-1,1};\\n\\nvector<int> G[1<<17];\\nvector<int> dp(1<<17,0);\\nint r = 3;\\n\\nint dfs(int u,int v){\\n int ret = 0;\\n for(auto g:G[u]){\\n if(g == v) continue;\\n chmax(ret, dfs(g, u));\\n }\\n return dp[u] = ret + 1;\\n}\\n\\nvoid dfs2(int u,int v,P x){\\n vector<P> vv;\\n vv.pb(mp(0, -1));\\n for(auto g:G[u]){\\n if(g == v){\\n vv.pb(x);\\n }\\n else{\\n vv.pb(mp(dp[g], g));\\n }\\n }\\n sort(RALL(vv));\\n for(auto g:G[u]){\\n if(g == v) continue;\\n if(g == vv[0].sc){\\n dfs2(g, u, mp(vv[1].fs + 1, u));\\n }\\n else{\\n dfs2(g, u, mp(vv[0].fs + 1, u));\\n }\\n }\\n if(vv.size() >= 4){\\n int a = vv[0].fs, b = vv[1].fs, c = vv[2].fs;\\n chmax(r, a + c + (a != c));\\n }\\n}\\n\\n\\nint main(){\\n int n;cin >> n;\\n for (int i = 0; i < n-1; i++) {\\n int a,b;cin >> a >> b;\\n a--,b--;\\n G[a].pb(b);\\n G[b].pb(a);\\n }\\n dfs(0,-1);\\n dfs2(0,-1,mp(0,-1));\\n string ans(n, '1');\\n for (int i = 3; i < r; i++) {\\n ans[i - 1] = '0';\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 28140,\n \"score_of_the_acc\": -0.4742,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3148_4280728\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define mp make_pair\\n#define eb emplace_back\\n#define ALL(A) A.begin(),A.end()\\n#define RALL(A) A.rbegin(),A.rend()\\ntypedef long long LL;\\ntypedef pair<int,int> P;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\\nconst LL mod=998244353;\\nconst LL LINF=1LL<<62;\\nconst int INF=1<<30;\\nint dx[]={1,0,-1,0,1,-1,1,-1};\\nint dy[]={0,1,0,-1,1,-1,-1,1};\\n\\nvector<int> G[1<<17];\\nvector<int> dp(1<<17);\\n\\nint dfs(int u,int v){\\n int ret = 0;\\n for(auto g:G[u]){\\n if(g == v) continue;\\n ret = max(ret, dfs(g, u));\\n }\\n return dp[u] = ret + 1;\\n}\\n\\nint n;\\nint l = 3;\\n\\nvoid dfs2(int u, int v, P x){\\n vector<P> vv;\\n for(auto g:G[u]){\\n if(g == v){\\n vv.pb(x);\\n }\\n else{\\n vv.pb(mp(dp[g],g));\\n }\\n }\\n sort(RALL(vv));\\n for(auto g:G[u]){\\n if(g == v) continue;\\n if(vv[0].sc == g){\\n if(vv.size() == 1) dfs2(g, u, mp(1, u));\\n else dfs2(g, u, mp(vv[1].fs + 1, u));\\n }\\n else{\\n dfs2(g, u, mp(vv[0].fs + 1, u));\\n }\\n }\\n if(vv.size() >= 3){\\n int a = vv[0].fs, b = vv[1].fs, c = vv[2].fs;\\n for (int k = l; k < n; k++) {\\n if(k > a + c) break;\\n else if(a + c == k && k - b == k - c && (k - c) * 2 == k) break;\\n l++;\\n }\\n }\\n return;\\n}\\n\\n\\n\\nint main(){\\n cin >> n;\\n if(n == 1){\\n cout << 1 << endl;\\n return 0;\\n }\\n for (int i = 0; i < n-1; i++) {\\n int a,b;cin >> a >> b;\\n a--,b--;\\n G[a].pb(b);\\n G[b].pb(a);\\n }\\n dfs(0,0);\\n dfs2(0,0,mp(0,0));\\n for (int i = 1; i <= 2; i++) {\\n cout << 1;\\n }\\n for (int i = 3; i < l; i++) {\\n cout << 0;\\n }\\n for (int i = l; i <= n; i++) {\\n cout << 1;\\n }\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 28220,\n \"score_of_the_acc\": -0.4752,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3148_4280663\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nlong long n;\\nvector<vector<int>> edge;\\nvector<int> dp;\\nvector<bool> ch;\\n\\nstring solve();\\nint dfs(int now);\\nint reroot(int now);\\n\\nint main() {\\n cin >> n;\\n edge.resize(n);\\n for(int i = 0; i < n - 1; ++i) {\\n int a, b;\\n cin >> a >> b;\\n edge[--a].push_back(--b);\\n edge[b].push_back(a);\\n }\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nstring solve() {\\n string res;\\n for(int i = 0; i < n; ++i) res += \\\"1\\\";\\n dp.assign(n, 0);\\n ch.assign(n, 0);\\n ch[0] = 1;\\n dfs(0);\\n ch.assign(n, 0);\\n ch[0] = 1;\\n int num = reroot(0);\\n if(num != -1)\\n for(int j = 2; j <= num; ++j) res[j] = '0';\\n return res;\\n}\\n\\nint dfs(int now) {\\n int res = 0;\\n for(auto to : edge[now])\\n if(!ch[to]) {\\n ch[to] = 1;\\n res = max(res, 1 + dfs(to));\\n }\\n return dp[now] = res;\\n}\\n\\nint reroot(int now) {\\n int res = -1, num = 0, bf = dp[now];\\n dp[now] = 0;\\n vector<int> child, pre, suf;\\n for(auto to : edge[now]) {\\n child.push_back(dp[to]);\\n pre.push_back(dp[to]);\\n suf.push_back(dp[to]);\\n }\\n num = child.size();\\n for(int i = 1; i < num; ++i) {\\n pre[i] = max(pre[i - 1], pre[i]);\\n suf[num - i - 1] = max(suf[num - i], suf[num - i - 1]);\\n }\\n for(int i = 0; i < num; ++i)\\n if(!ch[edge[now][i]]) {\\n dp[now] = 0;\\n ch[edge[now][i]] = 1;\\n if(i != 0) dp[now] = max(dp[now], pre[i - 1] + 1);\\n if(i != num - 1)\\n dp[now] = max(dp[now], suf[i + 1] + 1);\\n res = max(res, reroot(edge[now][i]));\\n }\\n if(num >= 3) {\\n sort(child.begin(), child.end(), greater<int>());\\n if(child[0] == child[2])\\n res = max(res, child[0] + child[2]);\\n else\\n res = max(res, child[0] + child[2] + 1);\\n }\\n dp[now] = bf;\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 35216,\n \"score_of_the_acc\": -0.6456,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3148_4280489\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define mp make_pair\\n#define eb emplace_back\\n#define ALL(A) A.begin(),A.end()\\n#define RALL(A) A.rbegin(),A.rend()\\ntypedef long long LL;\\ntypedef pair<int,int> P;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}\\nconst LL mod=998244353;\\nconst LL LINF=1LL<<62;\\nconst int INF=1<<30;\\nint dx[]={1,0,-1,0,1,-1,1,-1};\\nint dy[]={0,1,0,-1,1,-1,-1,1};\\n\\nvector<int> G[1<<17];\\nvector<int> dp(1<<17);\\n\\nint dfs(int u,int v){\\n int ret = 0;\\n for(auto g:G[u]){\\n if(g == v) continue;\\n chmax(ret, dfs(g, u));\\n }\\n return dp[u] = ret + 1;\\n}\\n\\nint n;\\nint l = 3;\\n\\nvoid dfs2(int u, int v, P x){\\n vector<P> vv;\\n for(auto g:G[u]){\\n if(g == v){\\n vv.pb(x);\\n }\\n else{\\n vv.pb(mp(dp[g], g));\\n }\\n }\\n sort(RALL(vv));\\n for(auto g:G[u]){\\n if(g == v) continue;\\n if(vv[0].sc == g){\\n if(vv.size() == 1) dfs2(g, u, mp(1, u));\\n else dfs2(g, u, mp(vv[1].fs + 1, u));\\n }\\n else{\\n dfs2(g, u, mp(vv[0].fs + 1, u));\\n }\\n }\\n if(vv.size() >= 3){\\n int a = vv[0].fs, b = vv[1].fs, c = vv[2].fs;\\n if(a == c) chmax(l, a + c);\\n else chmax(l, a + c + 1);\\n }\\n return;\\n}\\n\\n\\n\\nint main(){\\n cin >> n;\\n if(n == 1){\\n cout << 1 << endl;\\n return 0;\\n }\\n for (int i = 0; i < n-1; i++) {\\n int a,b;cin >> a >> b;\\n a--,b--;\\n G[a].pb(b);\\n G[b].pb(a);\\n }\\n dfs(0,0);\\n dfs2(0,0,mp(0,0));\\n for (int i = 1; i <= 2; i++) {\\n cout << 1;\\n }\\n for (int i = 3; i < l; i++) {\\n cout << 0;\\n }\\n for (int i = l; i <= n; i++) {\\n cout << 1;\\n }\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 28080,\n \"score_of_the_acc\": -0.4735,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3148_4280241\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n\\nusing namespace std;\\nvector<int> G[100010];\\nint d[3][100010] = {};\\nint dfs(int s, int p,int k){\\n for(int v:G[s]){\\n if(v==p) continue;\\n d[k][v] = d[k][s] + 1;\\n dfs(v,s,k);\\n }\\n}\\n\\nint mx[100010] = {};\\nvoid dfs2(int s,int p,int dia,int par){\\n for(int v:G[s]){\\n if(v==p) continue;\\n if(d[0][v] + d[1][v]==dia) continue;\\n d[2][v] = d[2][s] + 1;\\n mx[par] = max(mx[par],d[2][v]);\\n dfs2(v,s,dia,par);\\n }\\n}\\n\\nint n,seg[2][200010];\\nvoid init(int n,int x){\\n for(int i=n - 1;i>0;i--){\\n seg[x][i] = max(seg[x][i<<1],seg[x][i<<1|1]);\\n }\\n}\\n\\nvoid update(int val,int p,int x){\\n for(seg[x][p += n] = val;p>1;p>>=1){\\n seg[x][p>>1] = max(seg[x][p],seg[x][p^1]);\\n }\\n}\\n\\nint query(int l,int r,int x){\\n int res = 0;\\n for(l += n,r += n; l<r;l>>=1,r>>=1){\\n if(l&1) res = max(res,seg[x][l++]);\\n if(r&1) res = max(res,seg[x][--r]);\\n }\\n return res;\\n}\\n\\nint ans[100010];\\nint main(){\\n int i;\\n cin >> n;\\n for(i=0;i<n - 1;i++){\\n int a,b; cin >> a >> b;\\n a--; b--;\\n G[a].push_back(b); G[b].push_back(a);\\n }\\n dfs(0,-1,0);\\n int j = -1,x = -1;\\n for(i=0;i<n;i++){\\n if(d[0][i]>x){\\n j = i; x = d[0][i];\\n }\\n }\\n for(i=0;i<n;i++){\\n d[0][i] = 0;\\n }\\n dfs(j,-1,0);\\n int jj = -1; x = -1;\\n for(i=0;i<n;i++){\\n if(d[0][i]>x){\\n x = d[0][i];\\n jj = i;\\n }\\n }\\n int dia = x;\\n dfs(jj,-1,1);\\n vector<int> choku;\\n ans[1] = 1; ans[2] = 1;\\n for(i=dia + 1;i<=n;i++){\\n ans[i] = 1;\\n }\\n for(i=0;i<n;i++){\\n if(d[0][i] + d[1][i]==dia){\\n dfs2(i,-1,dia,i);\\n choku.push_back(i);\\n }\\n }\\n for(i=0;i<choku.size();i++){\\n int v = choku[i];\\n if(mx[v]) update(mx[v] + d[0][v],d[0][v],0);\\n if(mx[v]) update(mx[v] + d[1][v],d[1][v],1);\\n }\\n for(i=3;i<=dia;i++){\\n if(i&1){\\n if(query(0,n,0)>=i || query(0,n,1)>=i) ans[i] = 0;\\n else ans[i] = 1;\\n }else{\\n int k = i/2;\\n if(max(query(0,n,0),query(0,n,1))<i){\\n ans[i] = 1;\\n }else if(max(query(0,k,0),query(k + 1,n,0))>=i || max(query(0,k,1),query(k + 1,n,1))>=i){\\n ans[i] = 0;\\n }else if(max(query(k,k + 1,0),query(k,k + 1,1))==i){\\n ans[i] = 1;\\n }else{\\n ans[i] = 0;\\n }\\n }\\n }\\n for(i=1;i<=n;i++){\\n cout << ans[i];\\n }\\n cout << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 18384,\n \"score_of_the_acc\": -0.3946,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3148_4280129\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n\\nusing namespace std;\\nvector<int> G[100010];\\nint d[3][100010] = {};\\nint dfs(int s, int p,int k){\\n for(int v:G[s]){\\n if(v==p) continue;\\n d[k][v] = d[k][s] + 1;\\n dfs(v,s,k);\\n }\\n}\\n\\nint mx[100010] = {};\\nvoid dfs2(int s,int p,int dia,int par){\\n for(int v:G[s]){\\n if(v==p) continue;\\n if(d[0][v] + d[1][v]==dia) continue;\\n d[2][v] = d[2][s] + 1;\\n mx[par] = max(mx[par],d[2][v]);\\n dfs2(v,s,dia,par);\\n }\\n}\\n\\nint n,seg[2][200010];\\nvoid init(int n,int x){\\n for(int i=n - 1;i>0;i--){\\n seg[x][i] = max(seg[x][i<<1],seg[x][i<<1|1]);\\n }\\n}\\n\\nvoid update(int val,int p,int x){\\n for(seg[x][p += n] = val;p>1;p>>=1){\\n seg[x][p>>1] = max(seg[x][p],seg[x][p^1]);\\n }\\n}\\n\\nint query(int l,int r,int x){\\n int res = 0;\\n for(l += n,r += n; l<r;l>>=1,r>>=1){\\n if(l&1) res = max(res,seg[x][l++]);\\n if(r&1) res = max(res,seg[x][--r]);\\n }\\n return res;\\n}\\n\\nint ans[100010];\\nint main(){\\n int i;\\n cin >> n;\\n for(i=0;i<n - 1;i++){\\n int a,b; cin >> a >> b;\\n a--; b--;\\n G[a].push_back(b); G[b].push_back(a);\\n }\\n dfs(0,-1,0);\\n int j = -1,x = -1;\\n for(i=0;i<n;i++){\\n if(d[0][i]>x){\\n j = i; x = d[0][i];\\n }\\n }\\n for(i=0;i<n;i++){\\n d[0][i] = 0;\\n }\\n dfs(j,-1,0);\\n int jj = -1; x = -1;\\n for(i=0;i<n;i++){\\n if(d[0][i]>x){\\n x = d[0][i];\\n jj = i;\\n }\\n }\\n int dia = x;\\n dfs(jj,-1,1);\\n vector<int> choku;\\n ans[1] = 1; ans[2] = 1;\\n for(i=dia + 1;i<=n;i++){\\n ans[i] = 1;\\n }\\n for(i=0;i<n;i++){\\n if(d[0][i] + d[1][i]==dia){\\n dfs2(i,-1,dia,i);\\n choku.push_back(i);\\n }\\n }\\n for(i=0;i<choku.size();i++){\\n int v = choku[i];\\n if(mx[v]) update(mx[v] + d[0][v],d[0][v],0);\\n if(mx[v]) update(mx[v] + d[1][v],d[1][v],1);\\n }\\n for(i=3;i<=dia;i++){\\n if(i&1){\\n if(query(0,n,0)>=i || query(0,n,1)>=i) ans[i] = 0;\\n else ans[i] = 1;\\n }else{\\n int k = i/2;\\n if(max(query(0,n,0),query(0,n,1))<i){\\n ans[i] = 1;\\n }else if(max(query(0,k,0),query(k + 1,n,0))>=i || max(query(0,k,1),query(k + 1,n,1))>=i){\\n ans[i] = 0;\\n }else if(max(query(k,k + 1,0),query(k,k + 1,1))==k){\\n ans[i] = 1;\\n }else{\\n ans[i] = 0;\\n }\\n }\\n }\\n for(i=1;i<=n;i++){\\n cout << ans[i];\\n }\\n cout << endl;\\n}\",\n \"accuracy\": 0.75,\n \"time_ms\": 90,\n \"memory_kb\": 18384,\n \"score_of_the_acc\": -0.3946,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3148_4280122\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define be(v) (v).begin(),(v).end()\\n#define pb(q) push_back(q)\\ntypedef long long ll;\\nusing namespace std;\\nconst ll mod=1000000007;\\n#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;\\nvector<vector<ll> > v(100001);\\n\\nll ans=0,num=0,niko,kotori;\\nll umi=0,mid;\\nbool hanayo;\\nvoid dfs(ll now,ll count,ll p){\\n\\tif(count>=ans){\\n\\t\\tnum=now;\\n\\t\\tans=count;\\n\\t}\\n\\tfor(auto& i:v[now]){\\n\\t\\tif(i==p)continue;\\n\\t\\tdfs(i,count+1,now);\\n\\t}\\n\\treturn;\\n}\\nbool eri=true;\\nvoid solve(ll now,ll count,ll p){\\n\\tif(v[now].size()==1){\\n\\t\\tif(count!=niko){\\n\\t\\t\\teri=false;\\n\\t\\t}\\n\\t}\\n\\tfor(auto& i:v[now]){\\n\\t\\tif(i==p)continue;\\n\\t\\tsolve(i,count+1,now);\\n\\t}\\n\\treturn;\\n}\\nvoid honoka(ll now,ll count,ll p){\\n\\tif(v[now].size()==1){\\n\\t\\tif(count>=mid)umi++;\\n\\t}else if(v[now].size()>=3){\\n\\t\\tif(count>=mid)hanayo=false;\\n\\t}\\n\\tfor(auto& i:v[now]){\\n\\t\\tif(i==p)continue;\\n\\t\\thonoka(i,count+1,now);\\n\\t}\\n\\treturn;\\n}\\nint main() {\\n cin.tie(0);\\n cout.tie(0);\\n ios::sync_with_stdio(false);\\n ll n;\\n cin>>n;\\n ll a,b;\\n for(int i=0;i<n-1;i++){\\n \\tcin>>a>>b;\\n \\ta--;b--;\\n \\tv[a].pb(b);\\n \\tv[b].pb(a);\\n }\\n ll m3=0;\\n for(int i=0;i<n;i++){\\n \\tif(3<=v[i].size()){m3++;a=i;}\\n }\\n if(m3==0){\\n \\tfor(int i=0;i<n;i++){\\n \\t\\tcout << 1;\\n \\t}\\n \\tcout <<endl;\\n \\treturn 0;\\n }\\n dfs(0,0,-1);\\n kotori=num;\\n dfs(num,0,-1);\\n \\n bool maki=true;\\n if(m3>=2)maki=false;\\n else{\\n \\tniko=ans/2;\\n solve(a,0,-1);\\n maki=eri;\\n }\\n ll le=0,ri=ans+1;\\n while(ri-le>1){\\n \\tmid=(le+ri)/2;\\n \\tumi=0;\\n \\thanayo=true;\\n \\thonoka(num,0,-1);\\n honoka(kotori,0,-1);\\n if(umi==2&&hanayo){\\n \\tri=mid;\\n }else{\\n \\tle=mid;\\n }\\n }\\n \\n\\n for(int i=1;i<=n;i++){\\n \\tif(i>ans)cout <<1;\\n \\telse if(i==1||i==2)cout << 1;\\n \\telse if(i>=ri)cout << 1;\\n \\telse if(i&1)cout<<0;\\n \\telse if(i==ans&&maki){\\n \\t\\tcout << 1;\\n \\t}else{\\n \\t\\tcout << 0;\\n \\t}\\n }\\n cout<< endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.75,\n \"time_ms\": 260,\n \"memory_kb\": 13176,\n \"score_of_the_acc\": -1.0381,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":1969,"cells":{"group_id":{"kind":"string","value":"aoj_3156_cpp"},"problem_description":{"kind":"string","value":"Problem F: Abyss and Coins\n数直線上の座標 $0,1,2,\\ldots,N$ に足場があり、座標 $i$ の足場には $i$ 枚のコインがあります。\nウサギのネムは、最初座標\n\t$0$の足場にいて、好きな回数だけジャンプを繰り返すことによって、足場にあるコインを集めたいと思っています。\n$1$ 回目のジャンプでは好きな距離だけ飛ぶことが出来ますが、 $2$ 回目以降は、今いる足場の座標と $1$ つ前にいた足場の座標の丁度真ん中の座標にしか飛ぶことが出来ません。\nつまり、 $i$ 回ジャンプをした後到達する座標を $x_i$ とし、最初に飛ぶ座標を $X$ とすると、\n$x_0=0$,\n$x_1=X$,\n$x_{i+2}=\\frac{(x_{i+1}+x_i)}{2}$ ただし、 $i \\geq 0$\nとなります。\n飛んだ先に足場が存在する場合、その足場にあるコインを全て手に入れることが出来ます。\nしかし、既に $1$ 回以上来た事のある足場を再度訪れても、もう一度コインを入手することは出来ません。\nジャンプによって飛んだ先に足場が存在しない場合、ネムは奈落の底に落ちてしまい、今まで集めたコインを全て失って帰ることになります。\n逆に、いずれかの足場の上に立っている場合、ネムはいつでもジャンプを繰り返すことをやめ、その時点で持っているコインを全て持ち帰ることが出来ます(座標 $0$ に戻る必要はありません)。\nネムが持ち帰ることが出来るコインの枚数の最大値を求めてください。\nConstraints\n入力は以下の条件を満たす。\n$ 1 \\leq N \\leq 10^{12}$\n入力は整数である。\nInput\n入力は以下の形式で与えられる。\n$N$\nOutput\nネムが持ち帰ることが出来るコインの枚数の最大値を出力してください。\nまた、末尾に改行を出力するのを忘れないようにしてください。\nSample Input 1\n3\nSample Output 1\n3\n最初に飛ぶ距離として $2$ を選ぶと、 $1$ 回目のジャンプで座標 $2$ の足場に、 $2$ 回目のジャンプで座標 $1$ の足場に飛ぶことができます。\nここで帰ると、得られるコインは $2+1=3$ 枚となり、これが最大です。\nもし $3$ 回目のジャンプを行うと、移動先の座標は $\\frac{1+2}{2}=1.5$ となり、足場が存在しないため奈落の底に落ちてしまいます。\nまた、 $0→1→2→3$ や $0→2→3$ といった移動は許されていないことに注意してください。\nなお、最初に飛ぶ距離として $4,-1,1.99999$ などを選ぶこともできますが、このようにした場合 $1$ 枚もコインを得ることなく奈落の底に落ちてしまいます。\nSample Input 2\n15\nSample Output 2\n27\n$ 0 \\to 12 \\to 6 \\to 9$ と飛んでから帰るのが最適です。\nSample Input 3\n1000000000000\nSample Output 3\n24586301676657\nオーバーフローに注意してください。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3156_4837127","code_snippet":"#include <bits/stdc++.h>\n \nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n \n \n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SQ(a) ((a)*(a))\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n \n \n//repetition\n//------------------------------------------\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\n#define REP(i,n) FOR(i,0,n)\n#define MOD 1000000007\n \n \n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n \ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n \n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\n\nconst long double EPS = 1e-6, PI = acos((long double)-1);\n\n//ここから編集\n\nll GCD(ll a, ll b){\n return (b == 0)?a:GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b)*b;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(4);\n\n ll N;\n cin >> N;\n if(N == 1){\n cout << 1 << endl;\n return 0;\n }\n ll ans = 0;\n ll tmp = 1;\n while(tmp<=N){\n\n for(ll i=2; i<=100000; i++){\n ll prev = 0;\n ll pos = tmp*i;\n if(pos > N) break;\n if(pos<0) break;\n\n ll sum = 0;\n while(1){\n sum += pos;\n if((prev+pos)%2 != 0) break;\n\n \n\n ll tmp2 = pos;\n pos = (prev+pos)/2;\n\n prev = tmp2; \n }\n ans = max(ans, sum);\n }\n tmp *= 2;\n }\n\n \n \n cout << ans << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":3224,"score_of_the_acc":-0.172,"final_rank":1},{"submission_id":"aoj_3156_4832153","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <string>\n#include <queue>\n#include <stack>\n\nusing namespace std;\n\ntypedef long long int ll;\ntypedef pair<int, int> Pii;\n\nconst ll mod = 1000000007;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll n;\n cin >> n;\n\n if (n == 1) {\n cout << 1 << endl;\n return 0;\n }\n\n vector<bool> sieve(10000001, true);\n sieve[0] = false;\n sieve[1] = false;\n for (ll p = 2; p <= 10000000; p++) {\n if (sieve[p]) {\n for (ll i = p * p; i <= 10000000; i += p) sieve[i] = false;\n }\n }\n\n ll ans = 0;\n for (int i = 0; i <= min(n, 10000000LL); i++) {\n if (!sieve[i]) continue;\n ll p = i;\n ll s = i;\n while (p + s <= n) {\n p += s;\n s <<= 1;\n }\n while (true) {\n ll score = p;\n ll prev = 0;\n ll now = p;\n while (!((prev + now) & 1)) {\n ll next = (prev + now) >> 1;\n score += next;\n prev = now;\n now = next;\n }\n ans = max(ans, score);\n if (s & 1) break;\n s >>= 1;\n p += s;\n if (p > n) break;\n }\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.5135135135135135,"time_ms":60,"memory_kb":4140,"score_of_the_acc":-1.1693,"final_rank":2},{"submission_id":"aoj_3156_4832141","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <string>\n#include <queue>\n#include <stack>\n\nusing namespace std;\n\ntypedef long long int ll;\ntypedef pair<int, int> Pii;\n\nconst ll mod = 1000000007;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll n;\n cin >> n;\n\n vector<bool> sieve(10000001, true);\n sieve[0] = false;\n sieve[1] = false;\n for (ll p = 2; p <= 10000000; p++) {\n if (sieve[p]) {\n for (ll i = p * p; i <= 10000000; i += p) sieve[i] = false;\n }\n }\n\n ll ans = 0;\n for (int i = 0; i <= min(n, 10000000LL); i++) {\n if (!sieve[i]) continue;\n ll p = i;\n ll s = i;\n while (p + s <= n) {\n p += s;\n s <<= 1;\n }\n while (true) {\n ll score = p;\n ll prev = 0;\n ll now = p;\n while (!((prev + now) & 1)) {\n ll next = (prev + now) >> 1;\n score += next;\n prev = now;\n now = next;\n }\n ans = max(ans, score);\n if (s & 1) break;\n s >>= 1;\n p += s;\n if (p > n) break;\n }\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.43243243243243246,"time_ms":60,"memory_kb":4148,"score_of_the_acc":-1.1765,"final_rank":3},{"submission_id":"aoj_3156_4820306","code_snippet":"// wa\n#include <bits/stdc++.h>\nusing namespace std;\n\nlong long n;\n\nlong long calc(long long x);\n\nint main() {\n cin >> n;\n long long res = 0, now = 1;\n while ((now << 1) <= n) now <<= 1;\n // 5にすると通る(証明可能？)\n for (int i = 0; i < 4; ++i) {\n if (now & 1) break;\n res = max(res, calc(n / now * now));\n now >>= 1;\n }\n for (int i = 0; i <= 100000000; ++i) {\n if (n - i <= 0) break;\n res = max(res, calc(n - i));\n }\n cout << res << endl;\n return 0;\n}\n\nlong long calc(long long x) {\n long long flg = 1, sum = 0, now = 0;\n while (x) {\n now += x * flg;\n sum += now;\n if (x & 1) break;\n flg *= -1;\n x >>= 1;\n }\n return sum;\n}","accuracy":0.08108108108108109,"time_ms":200,"memory_kb":3032,"score_of_the_acc":-1,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_3156_4837127\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n \\n \\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SQ(a) ((a)*(a))\\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define SORT(c) sort((c).begin(),(c).end())\\n \\n \\n//repetition\\n//------------------------------------------\\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define MOD 1000000007\\n \\n \\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\\n#define trav(a, x) for(auto& a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n \\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n \\n#define chmin(x,y) x=min(x,y)\\n#define chmax(x,y) x=max(x,y)\\n\\nconst long double EPS = 1e-6, PI = acos((long double)-1);\\n\\n//ここから編集\\n\\nll GCD(ll a, ll b){\\n return (b == 0)?a:GCD(b, a%b);\\n}\\nll LCM(ll a, ll b){\\n return a/GCD(a, b)*b;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(4);\\n\\n ll N;\\n cin >> N;\\n if(N == 1){\\n cout << 1 << endl;\\n return 0;\\n }\\n ll ans = 0;\\n ll tmp = 1;\\n while(tmp<=N){\\n\\n for(ll i=2; i<=100000; i++){\\n ll prev = 0;\\n ll pos = tmp*i;\\n if(pos > N) break;\\n if(pos<0) break;\\n\\n ll sum = 0;\\n while(1){\\n sum += pos;\\n if((prev+pos)%2 != 0) break;\\n\\n \\n\\n ll tmp2 = pos;\\n pos = (prev+pos)/2;\\n\\n prev = tmp2; \\n }\\n ans = max(ans, sum);\\n }\\n tmp *= 2;\\n }\\n\\n \\n \\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -0.172,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3156_4832153\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <string>\\n#include <queue>\\n#include <stack>\\n\\nusing namespace std;\\n\\ntypedef long long int ll;\\ntypedef pair<int, int> Pii;\\n\\nconst ll mod = 1000000007;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n ll n;\\n cin >> n;\\n\\n if (n == 1) {\\n cout << 1 << endl;\\n return 0;\\n }\\n\\n vector<bool> sieve(10000001, true);\\n sieve[0] = false;\\n sieve[1] = false;\\n for (ll p = 2; p <= 10000000; p++) {\\n if (sieve[p]) {\\n for (ll i = p * p; i <= 10000000; i += p) sieve[i] = false;\\n }\\n }\\n\\n ll ans = 0;\\n for (int i = 0; i <= min(n, 10000000LL); i++) {\\n if (!sieve[i]) continue;\\n ll p = i;\\n ll s = i;\\n while (p + s <= n) {\\n p += s;\\n s <<= 1;\\n }\\n while (true) {\\n ll score = p;\\n ll prev = 0;\\n ll now = p;\\n while (!((prev + now) & 1)) {\\n ll next = (prev + now) >> 1;\\n score += next;\\n prev = now;\\n now = next;\\n }\\n ans = max(ans, score);\\n if (s & 1) break;\\n s >>= 1;\\n p += s;\\n if (p > n) break;\\n }\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.5135135135135135,\n \"time_ms\": 60,\n \"memory_kb\": 4140,\n \"score_of_the_acc\": -1.1693,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3156_4832141\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <string>\\n#include <queue>\\n#include <stack>\\n\\nusing namespace std;\\n\\ntypedef long long int ll;\\ntypedef pair<int, int> Pii;\\n\\nconst ll mod = 1000000007;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n ll n;\\n cin >> n;\\n\\n vector<bool> sieve(10000001, true);\\n sieve[0] = false;\\n sieve[1] = false;\\n for (ll p = 2; p <= 10000000; p++) {\\n if (sieve[p]) {\\n for (ll i = p * p; i <= 10000000; i += p) sieve[i] = false;\\n }\\n }\\n\\n ll ans = 0;\\n for (int i = 0; i <= min(n, 10000000LL); i++) {\\n if (!sieve[i]) continue;\\n ll p = i;\\n ll s = i;\\n while (p + s <= n) {\\n p += s;\\n s <<= 1;\\n }\\n while (true) {\\n ll score = p;\\n ll prev = 0;\\n ll now = p;\\n while (!((prev + now) & 1)) {\\n ll next = (prev + now) >> 1;\\n score += next;\\n prev = now;\\n now = next;\\n }\\n ans = max(ans, score);\\n if (s & 1) break;\\n s >>= 1;\\n p += s;\\n if (p > n) break;\\n }\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.43243243243243246,\n \"time_ms\": 60,\n \"memory_kb\": 4148,\n \"score_of_the_acc\": -1.1765,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3156_4820306\",\n \"code_snippet\": \"// wa\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nlong long n;\\n\\nlong long calc(long long x);\\n\\nint main() {\\n cin >> n;\\n long long res = 0, now = 1;\\n while ((now << 1) <= n) now <<= 1;\\n // 5にすると通る(証明可能？)\\n for (int i = 0; i < 4; ++i) {\\n if (now & 1) break;\\n res = max(res, calc(n / now * now));\\n now >>= 1;\\n }\\n for (int i = 0; i <= 100000000; ++i) {\\n if (n - i <= 0) break;\\n res = max(res, calc(n - i));\\n }\\n cout << res << endl;\\n return 0;\\n}\\n\\nlong long calc(long long x) {\\n long long flg = 1, sum = 0, now = 0;\\n while (x) {\\n now += x * flg;\\n sum += now;\\n if (x & 1) break;\\n flg *= -1;\\n x >>= 1;\\n }\\n return sum;\\n}\",\n \"accuracy\": 0.08108108108108109,\n \"time_ms\": 200,\n \"memory_kb\": 3032,\n \"score_of_the_acc\": -1,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1970,"cells":{"group_id":{"kind":"string","value":"aoj_3152_cpp"},"problem_description":{"kind":"string","value":"Problem B: Canceling Sequence\nProblem\n1以上の整数からなる、長さ $N$ の数列 $A_1, \\ldots , A_N$ が与えられます。\n以下の条件を満たす数列 $B_1, \\ldots , B_N$ を出力してください。\n$B_i$は $0$ でない整数である。\n$-10^9 ≤ B_i≤ 10^9$\n$A_1\\times B_1 + \\ldots + A_N\\times B_N = 0$\nConstraints\n入力は以下の条件を満たす。\n$2 ≤ N ≤ 2 \\times 10^5$\n$1 ≤ A_i ≤ 1000$\n入力は全て整数である。\nInput\n入力は以下の形式で標準入力から与えられる。\n$N$\n$A_1$ $A_2$ $\\ldots$ $A_N$\nOutput\n条件を満たす数列 $B_1, \\ldots , B_N$ を空白区切りで出力してください。\n条件を満たす限り、どのような数列を出力しても構いません。\nなお、制約の項で記述される条件のもとで、このような数列は必ず存在することが証明できます。\nまた、末尾に改行を出力するのを忘れないようにしてください。\nSample Input 1\n4\n1 2 4 4\nSample Output 1\n4 -2 -2 2\n他に、$\\{2,-1,-1,1\\}$ などの数列も正解となります。\nSample Input 2\n6\n5 3 4 7 3 6\nSample Output 2\n1 -1 -1 -1 1 1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3152_10371258","code_snippet":"#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\nsigned main(){\n int N;\n cin>>N;\n vector<int> A(N),B(N);\n for(int &i:A)cin>>i;\n if(N%2==0){\n for(int i=0;i<N;i+=2)B[i]=A[i+1],B[i+1]=-A[i];\n }else{\n for(int i=0;i+3<N;i+=2)B[i]=A[i+1],B[i+1]=-A[i];\n B[N-3]=-A[N-2]-A[N-1];\n B[N-2]=B[N-1]=A[N-3];\n }\n for(int i=0;i<N;i++)cout<<B[i]<<(i==N-1?'\\n':' ');\n}","accuracy":1,"time_ms":30,"memory_kb":6244,"score_of_the_acc":-1.586,"final_rank":18},{"submission_id":"aoj_3152_10371253","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int N,Z=0;\n cin>>N;\n vector<int> A(N);\n for(int i=0;i<N;i++){\n cin>>A[i];\n if(i!=N-1)Z+=A[i];\n }\n for(int i=0;i<N;i++)cout<<(i!=N-1?A[N-1]:-Z)<<(i==N-1?\"\\n\":\" \");\n}","accuracy":1,"time_ms":30,"memory_kb":3892,"score_of_the_acc":-0.6744,"final_rank":7},{"submission_id":"aoj_3152_10086215","code_snippet":"// competitive-verifier: PROBLEM\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nint main(void) {\n int n;\n cin >> n;\n vector<ll> a(n);\n cin >> a;\n ll m = *min_element(all(a));\n vector<ll> ans(n);\n bool f = true;\n rep (i, n) {\n if (a[i] == m && f) {\n f = false;\n continue;\n }\n if (a[i] % m != 0)\n ans[i] = m;\n else\n ans[i] = 1;\n }\n ll s = 0;\n rep (i, n) {\n s += a[i] * ans[i];\n }\n rep (i, n) {\n if (ans[i] == 0)\n ans[i] = -s / m;\n }\n co(ans);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6188,"score_of_the_acc":-0.8977,"final_rank":10},{"submission_id":"aoj_3152_9870130","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 1000000000;\n\nconst int MAX_N = 200000;\nstatic int vect[MAX_N];\n\n//------------------------------------------------------------------------------\nvoid solve3(int x1, int x2, int x3)\n{\n printf(\"%d %d %d\\n\", -x3, -x3, x1+x2);\n}\n\n// N >= 2\nvoid solve(int N)\n{\n //--------------------------------------------------------------------------\n // base cases:\n if (N == 2)\n {\n printf(\"%d %d\\n\", -vect[1], vect[0]);\n return;\n }\n else if (N == 3)\n {\n solve3(vect[0], vect[1], vect[2]);\n return;\n }\n //--------------------------------------------------------------------------\n // init:\n //--------------------------------------------------------------------------\n // compute:\n if (N%2 == 1)\n {\n for (int i=0; i<N-3; i+=2) printf(\"%d %d \", -vect[i+1], vect[i]);\n solve3(vect[N-3], vect[N-2], vect[N-1]);\n return;\n } \n\n for (int i=0; i<N-2; i+=2) printf(\"%d %d \", -vect[i+1], vect[i]);\n printf(\"%d %d\\n\", -vect[N-1], vect[N-2]);\n}\n\n//------------------------------------------------------------------------------\nvoid test()\n{\n\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //test(); return 0;\n //DEBUG = true;\n //--------------------------------------------------------------------------\n int N, num;\n num = scanf(\"%d \", &N);\n for (int i=0; i<N; ++i) num = scanf(\"%d \", &vect[i]);\n solve(N);\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":10,"memory_kb":4344,"score_of_the_acc":-0.1829,"final_rank":3},{"submission_id":"aoj_3152_7091717","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int N,Z=0;\n cin>>N;\n vector<int> A(N);\n for(int i=0;i<N;i++){\n cin>>A[i];\n if(i!=N-1)Z+=A[i];\n }\n for(int i=0;i<N;i++)cout<<(i!=N-1?A[N-1]:-Z)<<(i==N-1?\"\\n\":\" \");\n}","accuracy":1,"time_ms":30,"memory_kb":3872,"score_of_the_acc":-0.6667,"final_rank":6},{"submission_id":"aoj_3152_7091715","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n int N;\n cin>>N;\n vector<int> A(N);\n int Z=0;\n for(int i=0;i<N;i++){\n cin>>A[i];\n if(i!=N-1)Z+=A[i];\n }\n\n for(int i=0;i<N;i++)cout<<(i!=N-1?A[N-1]:-Z)<<(i==N-1?\"\\n\":\" \");\n}","accuracy":1,"time_ms":10,"memory_kb":3884,"score_of_the_acc":-0.0047,"final_rank":2},{"submission_id":"aoj_3152_7091712","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n int N;\n cin>>N;\n vector<int> A(N);\n for(int i=0;i<N;i++){\n cin>>A[i];\n }\n int Z=0;\n for(int i=0;i<N;i++){\n if(i==N-1){\n cout<<-Z<<endl;\n }\n else{\n cout<<A[N-1]<<\" \";\n Z+=A[i];\n }\n }\n\n}","accuracy":1,"time_ms":10,"memory_kb":3876,"score_of_the_acc":-0.0016,"final_rank":1},{"submission_id":"aoj_3152_7009024","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3152.cc: Problem B: Canceling Sequence\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 200000;\n\n/* typedef */\n\ntypedef long long ll;\n\n/* global variables */\n\nint as[MAX_N], bs[MAX_N];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++) scanf(\"%d\", as + i);\n\n if (! (n & 1))\n for (int i = 0; i < n; i += 2)\n bs[i] = as[i + 1], bs[i + 1] = -as[i];\n else {\n bs[0] = bs[1] = as[2], bs[2] = -(as[0] + as[1]);\n for (int i = 3; i < n; i += 2)\n bs[i] = as[i + 1], bs[i + 1] = -as[i];\n }\n\n for (int i = 0; i < n; i++)\n printf(\"%d%c\", bs[i], (i + 1 < n) ? ' ' : '\\n');\n\n if (false) {\n ll sum = 0;\n for (int i = 0; i < n; i++) sum += as[i] * bs[i];\n printf(\"sum=%lld\\n\", sum);\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4516,"score_of_the_acc":-0.5829,"final_rank":5},{"submission_id":"aoj_3152_5236039","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n vector<int> a(n);\n for(int i=0; i<n; i++){\n cin >> a[i];\n }\n vector<int> ans(n);\n if(n%2==0){\n for(int i=0; i<n; i+=2){\n ans[i] = a[i+1];\n ans[i+1] = -a[i];\n }\n }else{\n ans[0] = a[2];\n ans[1] = a[2];\n ans[2] = -(a[0]+a[1]);\n for(int i=3; i<n; i+=2){\n ans[i] = a[i+1];\n ans[i+1] = -a[i];\n }\n }\n for(int i=0; i<n-1; i++){\n cout << ans[i] << \" \";\n }\n cout << ans.back() << endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4664,"score_of_the_acc":-0.9736,"final_rank":12},{"submission_id":"aoj_3152_4918613","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nint table[SIZE];\n\nint main(){\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tint sum = 0;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%d\",&table[i]);\n\t\tif(i < N-1){\n\t\t\tsum += table[i];\n\t\t}\n\t}\n\n\tprintf(\"%d\",table[N-1]);\n\tfor(int i = 1; i < N-1; i++){\n\n\t\tprintf(\" %d\",table[N-1]);\n\t}\n\tprintf(\" %d\\n\",-sum);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3984,"score_of_the_acc":-0.3767,"final_rank":4},{"submission_id":"aoj_3152_4892908","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing LL = long long int;\n#define incII(i, l, r) for(LL i = (l) ; i <= (r); i++)\n#define incIX(i, l, r) for(LL i = (l) ; i < (r); i++)\n#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)\n#define incXX(i, l, r) for(LL i = (l) + 1; i < (r); i++)\n#define decII(i, l, r) for(LL i = (r) ; i >= (l); i--)\n#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)\n#define decXI(i, l, r) for(LL i = (r) ; i > (l); i--)\n#define decXX(i, l, r) for(LL i = (r) - 1; i > (l); i--)\n#define inc(i, n) incIX(i, 0, n)\n#define dec(i, n) decIX(i, 0, n)\n#define inc1(i, n) incII(i, 1, n)\n#define dec1(i, n) decII(i, 1, n)\nauto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };\nauto inIX = [](auto x, auto l, auto r) { return (l <= x && x < r); };\nauto inXI = [](auto x, auto l, auto r) { return (l < x && x <= r); };\nauto inXX = [](auto x, auto l, auto r) { return (l < x && x < r); };\nauto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };\nauto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };\nauto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };\nauto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define MT make_tuple\n#define FI first\n#define SE second\n#define FR front()\n#define BA back()\n#define ALL(c) c.begin(), c.end()\n#define RALL(c) c.rbegin(), c.rend()\n#define RV(c) reverse(ALL(c))\n#define SC static_cast\n#define SI(c) SC<int>(c.size())\n#define SL(c) SC<LL >(c.size())\n#define RF(e, c) for(auto & e: c)\n#define SF(c, ...) for(auto & [__VA_ARGS__]: c)\n#define until(e) while(! (e))\n#define if_not(e) if(! (e))\n#define ef else if\n#define UR assert(false)\nauto * IS = & cin;\nauto * OS = & cout;\narray<string, 3> SEQ = { \"\", \" \", \"\" };\n// input\ntemplate<typename T> T in() { T a; (* IS) >> a; return a; }\n// input: tuple\ntemplate<int I, typename U> void tin_(istream & is, U & t) {\n\tif constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }\n}\ntemplate<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }\ntemplate<typename ... T> auto tin() { return in<tuple<T ...>>(); }\n// input: array\ntemplate<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }\ntemplate<typename T, size_t N> auto ain() { return in<array<T, N>>(); }\n// input: multi-dimensional vector\ntemplate<typename T> T vin() { T v; (* IS) >> v; return v; }\ntemplate<typename T, typename N, typename ... M> auto vin(N n, M ... m) {\n\tvector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;\n}\n// input: multi-column (tuple<vector>)\ntemplate<typename U, int I> void colin_([[maybe_unused]] U & t) { }\ntemplate<typename U, int I, typename A, typename ... B> void colin_(U & t) {\n\tget<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);\n}\ntemplate<typename ... T> auto colin(int n) {\n\ttuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;\n}\n// output\nvoid out_([[maybe_unused]] string s) { }\ntemplate<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }\ntemplate<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }\nauto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };\nauto out = [](auto ... a) { outF(\"\", \" \" , \"\\n\", a ...); };\nauto outS = [](auto ... a) { outF(\"\", \" \" , \" \" , a ...); };\nauto outL = [](auto ... a) { outF(\"\", \"\\n\", \"\\n\", a ...); };\nauto outN = [](auto ... a) { outF(\"\", \"\" , \"\" , a ...); };\n// output: multi-dimensional vector\ntemplate<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {\n\tos << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? \"\" : SEQ[1]) << v[i]; } return (os << SEQ[2]);\n}\ntemplate<typename T> void vout_(T && v) { (* OS) << v; }\ntemplate<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {\n\tinc(i, SI(v)) { (* OS) << (i == 0 ? \"\" : a); vout_(v[i], b ...); }\n}\ntemplate<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }\ntemplate<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << flush; }\n\n// ---- ----\n\nint main() {\n\tauto n = in<int>();\n\tauto a = vin<int>(n);\n\tvector<int> ans(n);\n\tinc(i, n) {\n\t\tif(i % 2 == 0 && i + 1 < n) { ans[i] = +a[i + 1]; }\n\t\tif(i % 2 == 1 ) { ans[i] = -a[i - 1]; }\n\t}\n\tif(n % 2 == 1) {\n\t\tauto x = a[n - 3];\n\t\tauto y = a[n - 2];\n\t\tauto z = a[n - 1];\n\t\tans[n - 3] = y * z;\n\t\tans[n - 2] = x * z;\n\t\tans[n - 1] = -2 * x * y;\n\t}\n\tout(ans);\n}","accuracy":1,"time_ms":30,"memory_kb":6256,"score_of_the_acc":-1.5907,"final_rank":19},{"submission_id":"aoj_3152_4878526","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define double long double\nusing namespace std;\nconst int MOD = 1000000007;\nconst int INF = 1e11;\nusing Graph = vector<vector<int>>;\n\nint gcd(int a, int b){\n\tif(!a) return b;\n\treturn gcd(b%a,a);\n}\n\nint lcm(int x, int y){\n\tif(x == 0 || y==0) return 0;\n\treturn x/gcd(x, y) *y;\n}\n\nsigned main(){\n int N;\n cin >> N;\n\n vector<int> A(N);\n int sum = 0;\n for( int i = 0; i < N; i++ ){\n cin >> A[i];\n if( i < N-1 ) sum += A[i];\n }\n\n for( int i = 0; i < N-1; i++ ) cout << -1*A[N-1] << \" \";\n cout << sum << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":4688,"score_of_the_acc":-0.9829,"final_rank":13},{"submission_id":"aoj_3152_4874358","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\nint main() {\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i, n) cin >> a[i];\n\n vector<int> b(n, -a[n - 1]);\n b[n - 1] = 0;\n rep(i, n - 1) b[n - 1] += a[i];\n\n rep(i, n) cout << b[i] << \" \\n\"[i == n - 1];\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":4428,"score_of_the_acc":-1.2155,"final_rank":14},{"submission_id":"aoj_3152_4864958","code_snippet":"#pragma GCC optimize(\"Ofast\", \"unroll-loops\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n\nint main(void){\n int N; cin >> N;\n vector<int> A(N);\n for (auto& ai : A)\n cin >> ai;\n \n vector<int> res(N);\n if (N % 2 == 0){\n for (int i = 0; i < N; i += 2){\n res[i] = A[i + 1];\n res[i + 1] = -A[i];\n }\n }\n else{\n for (int i = 3; i < N; i += 2){\n res[i] = A[i + 1];\n res[i + 1] = -A[i];\n }\n if (A[0] != A[2]){\n res[0] = A[1];\n res[1] = -A[0] + A[2];\n res[2] = -A[1];\n }\n else{\n res[1] = -2 * A[0];\n res[0] = 1;\n res[2] = 2 * A[1] - 1;\n }\n }\n\n for (int i = 0; i < N; ++i)\n cout << res[i] << (i == N - 1 ? '\\n' : ' ');\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":4432,"score_of_the_acc":-1.2171,"final_rank":15},{"submission_id":"aoj_3152_4861041","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint n, sum = 0;\nvector<long long> a, b;\n\nint main() {\n cin >> n;\n a.resize(n);\n b.resize(n);\n for (auto &p : a) cin >> p;\n for (int i = 0; i < n - 1; ++i) {\n sum += a[i];\n b[i] = a[n - 1];\n }\n b[n - 1] = -sum;\n sum = 0;\n for (int i = 0; i < n; ++i) {\n sum += a[i] * b[i];\n assert(abs(b[i]) <= (long long)(1e9));\n }\n assert(sum == 0);\n for (int i = 0; i < n; ++i) cout << b[i] << \" \\n\"[i == n - 1];\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":6188,"score_of_the_acc":-1.5643,"final_rank":17},{"submission_id":"aoj_3152_4844236","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <array>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <cassert>\n#include <iomanip>\n#define vll vector<ll>\n#define vvvl vector<vvl>\n#define vvl vector<vector<ll>>\n#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))\n#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));\n#define re(c, b) for(ll c=0;c<b;c++)\n#define all(obj) (obj).begin(), (obj).end()\ntypedef long long int ll;\ntypedef long double ld;\nusing namespace std;\n\nll gcd(ll a, ll b){\n if(b<a) swap(a, b);\n ll r = a % b;\n if(r==0) return b;\n while(r!=0) r = a % b, a = b, b = r;\n return a;\n}\nll lcm(ll a, ll b){return (a*b)/gcd(a, b);}\n\nint main(){\n ll n;std::cin >> n;\n vll a(n);re(i, n) scanf(\"%lld\", &a[i]);\n vll ans(n);\n if(n%2==0){\n for(int i=0;i<n;i+=2){\n ll l = lcm(a[i], a[i+1]);\n ll lef = l/a[i];\n ll ri = -l/a[i+1];\n ans[i] = lef, ans[i+1] = ri;\n }\n }else{\n for(int i=0;i<n-3;i+=2){\n ll l = lcm(a[i], a[i+1]);\n ll lef = l/a[i];\n ll ri = -l/a[i+1];\n ans[i] = lef, ans[i+1] = ri;\n }\n //last 3\n ll l = lcm(a[n-3], lcm(a[n-2], a[n-1]));\n ans[n-3] = (2*l)/a[n-3];\n ans[n-2] = -l/a[n-2];\n ans[n-1] = -l/a[n-1];\n }\n for(int i=0;i<n;i++) std::cout << ans[i] << (i==n-1?\"\\n\":\" \");\n}","accuracy":1,"time_ms":20,"memory_kb":6328,"score_of_the_acc":-1.2853,"final_rank":16},{"submission_id":"aoj_3152_4840089","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\n#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];\n#define ft first\n#define sc second\n#define pb push_back\n#define lb lower_bound\n#define ub upper_bound\n#define all(v) (v).begin(),(v).end()\n#define LB(a,x) lb(all(a),x)-a.begin()\n#define UB(a,x) ub(all(a),x)-a.begin()\n#define mod 1000000007\n//#define mod 998244353\n#define FS fixed<<setprecision(15)\nusing namespace std;\ntypedef long long ll;\nconst double pi=3.141592653589793;\ntemplate<class T> using V=vector<T>;\nusing Graph = vector<vector<int>>;\nusing P=pair<ll,ll>;\ntypedef unsigned long long ull;\ntypedef long double ldouble;\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline void out(T a){ cout << a << '\\n'; }\nvoid YN(bool ok){if(ok) cout << \"Yes\" << endl; else cout << \"No\" << endl;}\n//void YN(bool ok){if(ok) cout << \"YES\" << endl; else cout << \"NO\" << endl;}\n\n\nconst ll INF=1e18;\nconst int mx=200005;\n//wupc\n\nint main(){\n cin.tie(0);ios::sync_with_stdio(false);\n ll n;\n cin>>n;\n V<ll> a(n),b(n);\n cinf(n,a);\n if(n%2==0){\n for(int i=0;i<n;i+=2){\n b[i]=a[i+1];\n b[i+1]=-a[i];\n }\n }else{\n b[2]=-(a[0]*a[1]+a[0]*a[1]);\n b[0]=a[2]*a[1];\n b[1]=a[2]*a[0];\n for(int i=3;i<n;i+=2){\n b[i]=a[i+1];\n b[i+1]=-a[i];\n }\n }\n rep(i,n) cout<<b[i]<<(i==n-1?\"\":\" \");\n cout<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":6012,"score_of_the_acc":-0.8295,"final_rank":8},{"submission_id":"aoj_3152_4837247","code_snippet":"#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <set>\n#include <iomanip>\n#include <numeric>\n#include <queue>\n#include <string>\n#include <map>\n#include <fstream>\n#include <cassert>\n#include <stack>\n#include <climits>\n#include <array>\n#include <unordered_set>\n#include <unordered_map>\n#include <memory>\n#include <functional>\n#include <cfloat>\nconstexpr long long int MOD = 1000000007LL;\n\n\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<int> array(n);\n\tfor (auto& a : array) std::cin >> a;\n\tstd::vector<int> result(n);\n\tfor (auto i = 0; i + 1< result.size(); i += 2) {\n\t\tresult[i] = array[i + 1];\n\t\tresult[i + 1] = -array[i];\n\t}\n\tif ((n & 1) == 1) {\n\t\tresult[n - 1] = array[n - 2];\n\t\tresult[n - 2] -= array[n - 1];\n\t}\n\tfor (auto i = 0; i < n; ++i) {\n\t\tif (i > 0) std::cout << ' ';\n\t\tstd::cout << result[i];\n\t}\n\tstd::cout << '\\n';\n}","accuracy":1,"time_ms":30,"memory_kb":4644,"score_of_the_acc":-0.9659,"final_rank":11},{"submission_id":"aoj_3152_4837100","code_snippet":"#include <bits/stdc++.h>\n \nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n \n \n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SQ(a) ((a)*(a))\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n \n \n//repetition\n//------------------------------------------\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\n#define REP(i,n) FOR(i,0,n)\n#define MOD 1000000007\n \n \n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n \ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n \n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\n\nconst long double EPS = 1e-6, PI = acos((long double)-1);\n\n//ここから編集\n\nll GCD(ll a, ll b){\n return (b == 0)?a:GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b)*b;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(4);\n\n int N; cin >> N;\n vector<ll> a(N);\n REP(i,N) cin >> a[i];\n\n\n if(N%2 == 0){\n\n vector<int> ans(N);\n for(int i=0; i<N; i+=2){\n ll lcm = LCM(a[i], a[i+1]);\n ans[i] = -lcm/a[i];\n ans[i+1] = lcm/a[i+1];\n }\n REP(i,N){\n if(i) cout << \" \";\n cout << ans[i];\n }\n cout << endl;\n }else{\n\n vector<int> ans(N);\n {\n ans[0] = -1;\n ll lcm = LCM(a[1]+a[0], a[2]);\n ans[0] = -lcm/(a[1]+a[0]);\n ans[1] = -lcm/(a[1]+a[0]);\n ans[2] = lcm/a[2];\n }\n for(int i=3; i<N; i+=2){\n ll lcm = LCM(a[i], a[i+1]);\n ans[i] = -lcm/a[i];\n ans[i+1] = lcm/a[i+1];\n }\n REP(i,N){\n if(i) cout << \" \";\n cout << ans[i];\n }\n cout << endl;\n\n }\n}","accuracy":1,"time_ms":20,"memory_kb":5204,"score_of_the_acc":-0.8496,"final_rank":9},{"submission_id":"aoj_3152_4836111","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<deque>\n#include<iomanip>\n#include<tuple>\n#include<cassert>\n#include<set>\nusing namespace std;\ntypedef long long int LL;\ntypedef pair<int,int> P;\ntypedef pair<LL,int> LP;\nconst int INF=1<<30;\nconst LL MAX=1e9+7;\n\nvoid array_show(int *array,int array_n,char middle=' '){\n\tfor(int i=0;i<array_n;i++)printf(\"%d%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(LL *array,int array_n,char middle=' '){\n\tfor(int i=0;i<array_n;i++)printf(\"%lld%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\n\tif(vec_n==-1)vec_n=vec_s.size();\n\tfor(int i=0;i<vec_n;i++)printf(\"%d%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\n\tif(vec_n==-1)vec_n=vec_s.size();\n\tfor(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\n\nint main(){\n\tint n,m;\n\tint i,j,k;\n\tLL a,b,c;\n\tcin>>n;\n\tvector<LL> v1,vs(n);\n\tfor(i=0;i<n;i++){\n\t\tcin>>a;\n\t\tv1.push_back(a);\n\t}\n\tif(n%2==1){\n\t\ta=v1[0]*v1[1]*v1[2];\n\t\tfor(i=0;i<3;i++){\n\t\t\tvs[i]=a/v1[i];\n\t\t}\n\t\tvs[0]*=-2;\n\t}else i=0;\n\tfor(;i<n;i+=2){\n\t\tvs[i]=v1[i+1];\n\t\tvs[i+1]=-v1[i];\n\t}\n\tarray_show(vs);\n}","accuracy":1,"time_ms":40,"memory_kb":6452,"score_of_the_acc":-2,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_3152_10371258\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define int long long\\nusing namespace std;\\nsigned main(){\\n int N;\\n cin>>N;\\n vector<int> A(N),B(N);\\n for(int &i:A)cin>>i;\\n if(N%2==0){\\n for(int i=0;i<N;i+=2)B[i]=A[i+1],B[i+1]=-A[i];\\n }else{\\n for(int i=0;i+3<N;i+=2)B[i]=A[i+1],B[i+1]=-A[i];\\n B[N-3]=-A[N-2]-A[N-1];\\n B[N-2]=B[N-1]=A[N-3];\\n }\\n for(int i=0;i<N;i++)cout<<B[i]<<(i==N-1?'\\\\n':' ');\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6244,\n \"score_of_the_acc\": -1.586,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3152_10371253\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n int N,Z=0;\\n cin>>N;\\n vector<int> A(N);\\n for(int i=0;i<N;i++){\\n cin>>A[i];\\n if(i!=N-1)Z+=A[i];\\n }\\n for(int i=0;i<N;i++)cout<<(i!=N-1?A[N-1]:-Z)<<(i==N-1?\\\"\\\\n\\\":\\\" \\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3892,\n \"score_of_the_acc\": -0.6744,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3152_10086215\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nint main(void) {\\n int n;\\n cin >> n;\\n vector<ll> a(n);\\n cin >> a;\\n ll m = *min_element(all(a));\\n vector<ll> ans(n);\\n bool f = true;\\n rep (i, n) {\\n if (a[i] == m && f) {\\n f = false;\\n continue;\\n }\\n if (a[i] % m != 0)\\n ans[i] = m;\\n else\\n ans[i] = 1;\\n }\\n ll s = 0;\\n rep (i, n) {\\n s += a[i] * ans[i];\\n }\\n rep (i, n) {\\n if (ans[i] == 0)\\n ans[i] = -s / m;\\n }\\n co(ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6188,\n \"score_of_the_acc\": -0.8977,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3152_9870130\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n/*\\n*/\\n\\n\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\nconst int INF = 1000000000;\\n\\nconst int MAX_N = 200000;\\nstatic int vect[MAX_N];\\n\\n//------------------------------------------------------------------------------\\nvoid solve3(int x1, int x2, int x3)\\n{\\n printf(\\\"%d %d %d\\\\n\\\", -x3, -x3, x1+x2);\\n}\\n\\n// N >= 2\\nvoid solve(int N)\\n{\\n //--------------------------------------------------------------------------\\n // base cases:\\n if (N == 2)\\n {\\n printf(\\\"%d %d\\\\n\\\", -vect[1], vect[0]);\\n return;\\n }\\n else if (N == 3)\\n {\\n solve3(vect[0], vect[1], vect[2]);\\n return;\\n }\\n //--------------------------------------------------------------------------\\n // init:\\n //--------------------------------------------------------------------------\\n // compute:\\n if (N%2 == 1)\\n {\\n for (int i=0; i<N-3; i+=2) printf(\\\"%d %d \\\", -vect[i+1], vect[i]);\\n solve3(vect[N-3], vect[N-2], vect[N-1]);\\n return;\\n } \\n\\n for (int i=0; i<N-2; i+=2) printf(\\\"%d %d \\\", -vect[i+1], vect[i]);\\n printf(\\\"%d %d\\\\n\\\", -vect[N-1], vect[N-2]);\\n}\\n\\n//------------------------------------------------------------------------------\\nvoid test()\\n{\\n\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //test(); return 0;\\n //DEBUG = true;\\n //--------------------------------------------------------------------------\\n int N, num;\\n num = scanf(\\\"%d \\\", &N);\\n for (int i=0; i<N; ++i) num = scanf(\\\"%d \\\", &vect[i]);\\n solve(N);\\n //--------------------------------------------------------------------------\\n return 0;\\n}\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4344,\n \"score_of_the_acc\": -0.1829,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3152_7091717\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n int N,Z=0;\\n cin>>N;\\n vector<int> A(N);\\n for(int i=0;i<N;i++){\\n cin>>A[i];\\n if(i!=N-1)Z+=A[i];\\n }\\n for(int i=0;i<N;i++)cout<<(i!=N-1?A[N-1]:-Z)<<(i==N-1?\\\"\\\\n\\\":\\\" \\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3872,\n \"score_of_the_acc\": -0.6667,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3152_7091715\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n int N;\\n cin>>N;\\n vector<int> A(N);\\n int Z=0;\\n for(int i=0;i<N;i++){\\n cin>>A[i];\\n if(i!=N-1)Z+=A[i];\\n }\\n\\n for(int i=0;i<N;i++)cout<<(i!=N-1?A[N-1]:-Z)<<(i==N-1?\\\"\\\\n\\\":\\\" \\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3884,\n \"score_of_the_acc\": -0.0047,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3152_7091712\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n int N;\\n cin>>N;\\n vector<int> A(N);\\n for(int i=0;i<N;i++){\\n cin>>A[i];\\n }\\n int Z=0;\\n for(int i=0;i<N;i++){\\n if(i==N-1){\\n cout<<-Z<<endl;\\n }\\n else{\\n cout<<A[N-1]<<\\\" \\\";\\n Z+=A[i];\\n }\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3876,\n \"score_of_the_acc\": -0.0016,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3152_7009024\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3152.cc: Problem B: Canceling Sequence\\n */\\n\\n#include<cstdio>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 200000;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\n\\n/* global variables */\\n\\nint as[MAX_N], bs[MAX_N];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n for (int i = 0; i < n; i++) scanf(\\\"%d\\\", as + i);\\n\\n if (! (n & 1))\\n for (int i = 0; i < n; i += 2)\\n bs[i] = as[i + 1], bs[i + 1] = -as[i];\\n else {\\n bs[0] = bs[1] = as[2], bs[2] = -(as[0] + as[1]);\\n for (int i = 3; i < n; i += 2)\\n bs[i] = as[i + 1], bs[i + 1] = -as[i];\\n }\\n\\n for (int i = 0; i < n; i++)\\n printf(\\\"%d%c\\\", bs[i], (i + 1 < n) ? ' ' : '\\\\n');\\n\\n if (false) {\\n ll sum = 0;\\n for (int i = 0; i < n; i++) sum += as[i] * bs[i];\\n printf(\\\"sum=%lld\\\\n\\\", sum);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4516,\n \"score_of_the_acc\": -0.5829,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3152_5236039\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n for(int i=0; i<n; i++){\\n cin >> a[i];\\n }\\n vector<int> ans(n);\\n if(n%2==0){\\n for(int i=0; i<n; i+=2){\\n ans[i] = a[i+1];\\n ans[i+1] = -a[i];\\n }\\n }else{\\n ans[0] = a[2];\\n ans[1] = a[2];\\n ans[2] = -(a[0]+a[1]);\\n for(int i=3; i<n; i+=2){\\n ans[i] = a[i+1];\\n ans[i+1] = -a[i];\\n }\\n }\\n for(int i=0; i<n-1; i++){\\n cout << ans[i] << \\\" \\\";\\n }\\n cout << ans.back() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4664,\n \"score_of_the_acc\": -0.9736,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3152_4918613\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 200005\\n\\nint table[SIZE];\\n\\nint main(){\\n\\n\\tint N;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint sum = 0;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&table[i]);\\n\\t\\tif(i < N-1){\\n\\t\\t\\tsum += table[i];\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\",table[N-1]);\\n\\tfor(int i = 1; i < N-1; i++){\\n\\n\\t\\tprintf(\\\" %d\\\",table[N-1]);\\n\\t}\\n\\tprintf(\\\" %d\\\\n\\\",-sum);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3984,\n \"score_of_the_acc\": -0.3767,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3152_4892908\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing LL = long long int;\\n#define incII(i, l, r) for(LL i = (l) ; i <= (r); i++)\\n#define incIX(i, l, r) for(LL i = (l) ; i < (r); i++)\\n#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)\\n#define incXX(i, l, r) for(LL i = (l) + 1; i < (r); i++)\\n#define decII(i, l, r) for(LL i = (r) ; i >= (l); i--)\\n#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)\\n#define decXI(i, l, r) for(LL i = (r) ; i > (l); i--)\\n#define decXX(i, l, r) for(LL i = (r) - 1; i > (l); i--)\\n#define inc(i, n) incIX(i, 0, n)\\n#define dec(i, n) decIX(i, 0, n)\\n#define inc1(i, n) incII(i, 1, n)\\n#define dec1(i, n) decII(i, 1, n)\\nauto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };\\nauto inIX = [](auto x, auto l, auto r) { return (l <= x && x < r); };\\nauto inXI = [](auto x, auto l, auto r) { return (l < x && x <= r); };\\nauto inXX = [](auto x, auto l, auto r) { return (l < x && x < r); };\\nauto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };\\nauto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };\\nauto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };\\nauto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define MT make_tuple\\n#define FI first\\n#define SE second\\n#define FR front()\\n#define BA back()\\n#define ALL(c) c.begin(), c.end()\\n#define RALL(c) c.rbegin(), c.rend()\\n#define RV(c) reverse(ALL(c))\\n#define SC static_cast\\n#define SI(c) SC<int>(c.size())\\n#define SL(c) SC<LL >(c.size())\\n#define RF(e, c) for(auto & e: c)\\n#define SF(c, ...) for(auto & [__VA_ARGS__]: c)\\n#define until(e) while(! (e))\\n#define if_not(e) if(! (e))\\n#define ef else if\\n#define UR assert(false)\\nauto * IS = & cin;\\nauto * OS = & cout;\\narray<string, 3> SEQ = { \\\"\\\", \\\" \\\", \\\"\\\" };\\n// input\\ntemplate<typename T> T in() { T a; (* IS) >> a; return a; }\\n// input: tuple\\ntemplate<int I, typename U> void tin_(istream & is, U & t) {\\n\\tif constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }\\n}\\ntemplate<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }\\ntemplate<typename ... T> auto tin() { return in<tuple<T ...>>(); }\\n// input: array\\ntemplate<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }\\ntemplate<typename T, size_t N> auto ain() { return in<array<T, N>>(); }\\n// input: multi-dimensional vector\\ntemplate<typename T> T vin() { T v; (* IS) >> v; return v; }\\ntemplate<typename T, typename N, typename ... M> auto vin(N n, M ... m) {\\n\\tvector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;\\n}\\n// input: multi-column (tuple<vector>)\\ntemplate<typename U, int I> void colin_([[maybe_unused]] U & t) { }\\ntemplate<typename U, int I, typename A, typename ... B> void colin_(U & t) {\\n\\tget<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);\\n}\\ntemplate<typename ... T> auto colin(int n) {\\n\\ttuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;\\n}\\n// output\\nvoid out_([[maybe_unused]] string s) { }\\ntemplate<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }\\ntemplate<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }\\nauto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };\\nauto out = [](auto ... a) { outF(\\\"\\\", \\\" \\\" , \\\"\\\\n\\\", a ...); };\\nauto outS = [](auto ... a) { outF(\\\"\\\", \\\" \\\" , \\\" \\\" , a ...); };\\nauto outL = [](auto ... a) { outF(\\\"\\\", \\\"\\\\n\\\", \\\"\\\\n\\\", a ...); };\\nauto outN = [](auto ... a) { outF(\\\"\\\", \\\"\\\" , \\\"\\\" , a ...); };\\n// output: multi-dimensional vector\\ntemplate<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {\\n\\tos << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? \\\"\\\" : SEQ[1]) << v[i]; } return (os << SEQ[2]);\\n}\\ntemplate<typename T> void vout_(T && v) { (* OS) << v; }\\ntemplate<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {\\n\\tinc(i, SI(v)) { (* OS) << (i == 0 ? \\\"\\\" : a); vout_(v[i], b ...); }\\n}\\ntemplate<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }\\ntemplate<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << flush; }\\n\\n// ---- ----\\n\\nint main() {\\n\\tauto n = in<int>();\\n\\tauto a = vin<int>(n);\\n\\tvector<int> ans(n);\\n\\tinc(i, n) {\\n\\t\\tif(i % 2 == 0 && i + 1 < n) { ans[i] = +a[i + 1]; }\\n\\t\\tif(i % 2 == 1 ) { ans[i] = -a[i - 1]; }\\n\\t}\\n\\tif(n % 2 == 1) {\\n\\t\\tauto x = a[n - 3];\\n\\t\\tauto y = a[n - 2];\\n\\t\\tauto z = a[n - 1];\\n\\t\\tans[n - 3] = y * z;\\n\\t\\tans[n - 2] = x * z;\\n\\t\\tans[n - 1] = -2 * x * y;\\n\\t}\\n\\tout(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6256,\n \"score_of_the_acc\": -1.5907,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3152_4878526\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define double long double\\nusing namespace std;\\nconst int MOD = 1000000007;\\nconst int INF = 1e11;\\nusing Graph = vector<vector<int>>;\\n\\nint gcd(int a, int b){\\n\\tif(!a) return b;\\n\\treturn gcd(b%a,a);\\n}\\n\\nint lcm(int x, int y){\\n\\tif(x == 0 || y==0) return 0;\\n\\treturn x/gcd(x, y) *y;\\n}\\n\\nsigned main(){\\n int N;\\n cin >> N;\\n\\n vector<int> A(N);\\n int sum = 0;\\n for( int i = 0; i < N; i++ ){\\n cin >> A[i];\\n if( i < N-1 ) sum += A[i];\\n }\\n\\n for( int i = 0; i < N-1; i++ ) cout << -1*A[N-1] << \\\" \\\";\\n cout << sum << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4688,\n \"score_of_the_acc\": -0.9829,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3152_4874358\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\nint main() {\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n rep(i, n) cin >> a[i];\\n\\n vector<int> b(n, -a[n - 1]);\\n b[n - 1] = 0;\\n rep(i, n - 1) b[n - 1] += a[i];\\n\\n rep(i, n) cout << b[i] << \\\" \\\\n\\\"[i == n - 1];\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4428,\n \"score_of_the_acc\": -1.2155,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3152_4864958\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\", \\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define ll long long\\n#define ld long double\\n\\nint main(void){\\n int N; cin >> N;\\n vector<int> A(N);\\n for (auto& ai : A)\\n cin >> ai;\\n \\n vector<int> res(N);\\n if (N % 2 == 0){\\n for (int i = 0; i < N; i += 2){\\n res[i] = A[i + 1];\\n res[i + 1] = -A[i];\\n }\\n }\\n else{\\n for (int i = 3; i < N; i += 2){\\n res[i] = A[i + 1];\\n res[i + 1] = -A[i];\\n }\\n if (A[0] != A[2]){\\n res[0] = A[1];\\n res[1] = -A[0] + A[2];\\n res[2] = -A[1];\\n }\\n else{\\n res[1] = -2 * A[0];\\n res[0] = 1;\\n res[2] = 2 * A[1] - 1;\\n }\\n }\\n\\n for (int i = 0; i < N; ++i)\\n cout << res[i] << (i == N - 1 ? '\\\\n' : ' ');\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4432,\n \"score_of_the_acc\": -1.2171,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3152_4861041\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint n, sum = 0;\\nvector<long long> a, b;\\n\\nint main() {\\n cin >> n;\\n a.resize(n);\\n b.resize(n);\\n for (auto &p : a) cin >> p;\\n for (int i = 0; i < n - 1; ++i) {\\n sum += a[i];\\n b[i] = a[n - 1];\\n }\\n b[n - 1] = -sum;\\n sum = 0;\\n for (int i = 0; i < n; ++i) {\\n sum += a[i] * b[i];\\n assert(abs(b[i]) <= (long long)(1e9));\\n }\\n assert(sum == 0);\\n for (int i = 0; i < n; ++i) cout << b[i] << \\\" \\\\n\\\"[i == n - 1];\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6188,\n \"score_of_the_acc\": -1.5643,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3152_4844236\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <array>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <cmath>\\n#include <functional>\\n#include <cassert>\\n#include <iomanip>\\n#define vll vector<ll>\\n#define vvvl vector<vvl>\\n#define vvl vector<vector<ll>>\\n#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))\\n#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));\\n#define re(c, b) for(ll c=0;c<b;c++)\\n#define all(obj) (obj).begin(), (obj).end()\\ntypedef long long int ll;\\ntypedef long double ld;\\nusing namespace std;\\n\\nll gcd(ll a, ll b){\\n if(b<a) swap(a, b);\\n ll r = a % b;\\n if(r==0) return b;\\n while(r!=0) r = a % b, a = b, b = r;\\n return a;\\n}\\nll lcm(ll a, ll b){return (a*b)/gcd(a, b);}\\n\\nint main(){\\n ll n;std::cin >> n;\\n vll a(n);re(i, n) scanf(\\\"%lld\\\", &a[i]);\\n vll ans(n);\\n if(n%2==0){\\n for(int i=0;i<n;i+=2){\\n ll l = lcm(a[i], a[i+1]);\\n ll lef = l/a[i];\\n ll ri = -l/a[i+1];\\n ans[i] = lef, ans[i+1] = ri;\\n }\\n }else{\\n for(int i=0;i<n-3;i+=2){\\n ll l = lcm(a[i], a[i+1]);\\n ll lef = l/a[i];\\n ll ri = -l/a[i+1];\\n ans[i] = lef, ans[i+1] = ri;\\n }\\n //last 3\\n ll l = lcm(a[n-3], lcm(a[n-2], a[n-1]));\\n ans[n-3] = (2*l)/a[n-3];\\n ans[n-2] = -l/a[n-2];\\n ans[n-1] = -l/a[n-1];\\n }\\n for(int i=0;i<n;i++) std::cout << ans[i] << (i==n-1?\\\"\\\\n\\\":\\\" \\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6328,\n \"score_of_the_acc\": -1.2853,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3152_4840089\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];\\n#define ft first\\n#define sc second\\n#define pb push_back\\n#define lb lower_bound\\n#define ub upper_bound\\n#define all(v) (v).begin(),(v).end()\\n#define LB(a,x) lb(all(a),x)-a.begin()\\n#define UB(a,x) ub(all(a),x)-a.begin()\\n#define mod 1000000007\\n//#define mod 998244353\\n#define FS fixed<<setprecision(15)\\nusing namespace std;\\ntypedef long long ll;\\nconst double pi=3.141592653589793;\\ntemplate<class T> using V=vector<T>;\\nusing Graph = vector<vector<int>>;\\nusing P=pair<ll,ll>;\\ntypedef unsigned long long ull;\\ntypedef long double ldouble;\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> inline void out(T a){ cout << a << '\\\\n'; }\\nvoid YN(bool ok){if(ok) cout << \\\"Yes\\\" << endl; else cout << \\\"No\\\" << endl;}\\n//void YN(bool ok){if(ok) cout << \\\"YES\\\" << endl; else cout << \\\"NO\\\" << endl;}\\n\\n\\nconst ll INF=1e18;\\nconst int mx=200005;\\n//wupc\\n\\nint main(){\\n cin.tie(0);ios::sync_with_stdio(false);\\n ll n;\\n cin>>n;\\n V<ll> a(n),b(n);\\n cinf(n,a);\\n if(n%2==0){\\n for(int i=0;i<n;i+=2){\\n b[i]=a[i+1];\\n b[i+1]=-a[i];\\n }\\n }else{\\n b[2]=-(a[0]*a[1]+a[0]*a[1]);\\n b[0]=a[2]*a[1];\\n b[1]=a[2]*a[0];\\n for(int i=3;i<n;i+=2){\\n b[i]=a[i+1];\\n b[i+1]=-a[i];\\n }\\n }\\n rep(i,n) cout<<b[i]<<(i==n-1?\\\"\\\":\\\" \\\");\\n cout<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6012,\n \"score_of_the_acc\": -0.8295,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3152_4837247\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\n#include <set>\\n#include <iomanip>\\n#include <numeric>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <fstream>\\n#include <cassert>\\n#include <stack>\\n#include <climits>\\n#include <array>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <memory>\\n#include <functional>\\n#include <cfloat>\\nconstexpr long long int MOD = 1000000007LL;\\n\\n\\nint main() {\\n\\tint n; std::cin >> n;\\n\\tstd::vector<int> array(n);\\n\\tfor (auto& a : array) std::cin >> a;\\n\\tstd::vector<int> result(n);\\n\\tfor (auto i = 0; i + 1< result.size(); i += 2) {\\n\\t\\tresult[i] = array[i + 1];\\n\\t\\tresult[i + 1] = -array[i];\\n\\t}\\n\\tif ((n & 1) == 1) {\\n\\t\\tresult[n - 1] = array[n - 2];\\n\\t\\tresult[n - 2] -= array[n - 1];\\n\\t}\\n\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\tif (i > 0) std::cout << ' ';\\n\\t\\tstd::cout << result[i];\\n\\t}\\n\\tstd::cout << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4644,\n \"score_of_the_acc\": -0.9659,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3152_4837100\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n \\n \\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SQ(a) ((a)*(a))\\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define SORT(c) sort((c).begin(),(c).end())\\n \\n \\n//repetition\\n//------------------------------------------\\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define MOD 1000000007\\n \\n \\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\\n#define trav(a, x) for(auto& a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n \\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n \\n#define chmin(x,y) x=min(x,y)\\n#define chmax(x,y) x=max(x,y)\\n\\nconst long double EPS = 1e-6, PI = acos((long double)-1);\\n\\n//ここから編集\\n\\nll GCD(ll a, ll b){\\n return (b == 0)?a:GCD(b, a%b);\\n}\\nll LCM(ll a, ll b){\\n return a/GCD(a, b)*b;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(4);\\n\\n int N; cin >> N;\\n vector<ll> a(N);\\n REP(i,N) cin >> a[i];\\n\\n\\n if(N%2 == 0){\\n\\n vector<int> ans(N);\\n for(int i=0; i<N; i+=2){\\n ll lcm = LCM(a[i], a[i+1]);\\n ans[i] = -lcm/a[i];\\n ans[i+1] = lcm/a[i+1];\\n }\\n REP(i,N){\\n if(i) cout << \\\" \\\";\\n cout << ans[i];\\n }\\n cout << endl;\\n }else{\\n\\n vector<int> ans(N);\\n {\\n ans[0] = -1;\\n ll lcm = LCM(a[1]+a[0], a[2]);\\n ans[0] = -lcm/(a[1]+a[0]);\\n ans[1] = -lcm/(a[1]+a[0]);\\n ans[2] = lcm/a[2];\\n }\\n for(int i=3; i<N; i+=2){\\n ll lcm = LCM(a[i], a[i+1]);\\n ans[i] = -lcm/a[i];\\n ans[i+1] = lcm/a[i+1];\\n }\\n REP(i,N){\\n if(i) cout << \\\" \\\";\\n cout << ans[i];\\n }\\n cout << endl;\\n\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5204,\n \"score_of_the_acc\": -0.8496,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3152_4836111\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<string>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<deque>\\n#include<iomanip>\\n#include<tuple>\\n#include<cassert>\\n#include<set>\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef pair<int,int> P;\\ntypedef pair<LL,int> LP;\\nconst int INF=1<<30;\\nconst LL MAX=1e9+7;\\n\\nvoid array_show(int *array,int array_n,char middle=' '){\\n\\tfor(int i=0;i<array_n;i++)printf(\\\"%d%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(LL *array,int array_n,char middle=' '){\\n\\tfor(int i=0;i<array_n;i++)printf(\\\"%lld%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\\n\\tif(vec_n==-1)vec_n=vec_s.size();\\n\\tfor(int i=0;i<vec_n;i++)printf(\\\"%d%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\\n\\tif(vec_n==-1)vec_n=vec_s.size();\\n\\tfor(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\n\\nint main(){\\n\\tint n,m;\\n\\tint i,j,k;\\n\\tLL a,b,c;\\n\\tcin>>n;\\n\\tvector<LL> v1,vs(n);\\n\\tfor(i=0;i<n;i++){\\n\\t\\tcin>>a;\\n\\t\\tv1.push_back(a);\\n\\t}\\n\\tif(n%2==1){\\n\\t\\ta=v1[0]*v1[1]*v1[2];\\n\\t\\tfor(i=0;i<3;i++){\\n\\t\\t\\tvs[i]=a/v1[i];\\n\\t\\t}\\n\\t\\tvs[0]*=-2;\\n\\t}else i=0;\\n\\tfor(;i<n;i+=2){\\n\\t\\tvs[i]=v1[i+1];\\n\\t\\tvs[i+1]=-v1[i];\\n\\t}\\n\\tarray_show(vs);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 6452,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1971,"cells":{"group_id":{"kind":"string","value":"aoj_3155_cpp"},"problem_description":{"kind":"string","value":"Problem E: LCM Count\nProblem\n1以上の整数 $N$ が与えられます。\n1以上 $N$ 以下の整数からなる、重複のない有限個の要素を持つ整数列 $A_0,A_1,\\ldots,A_{k-1}$ であって、 ${\\rm lcm}(A_0,A_1,\\ldots,A_{k-1})=N$\n となる数列の数を求めなさい。\n ここで、 ${\\rm lcm}(A_0,A_1,\\ldots,A_{k-1})$ は数列の全要素に対する最小公倍数を意味します。なお、答えは大きくなることがあるので、 $10^9+7$ で割った余りを求めてください。\nConstraints\n入力は以下の条件を満たす。\n$1 \\leq N \\leq 10^{12}$\n入力は整数である。\nInput\n入力は以下の形式で与えられる。\n$N$\nOutput\n問題文の条件を満たす数列の数を $10^9+7$ で割った余りを求めなさい。\n 末尾の改行を忘れないこと。\nSample Input 1\n1\nSample Output 1\n1\n条件を満たす数列は $\\{1\\}$ のみです。要素数が0であるような数列は考慮しません。\nSample Input 2\n6\nSample Output 2\n57\n条件を満たす数列は、\n$\\{6\\},\\{1,6\\},\\{2,3\\},\\{2,6\\},\\{3,6\\},\\{1,2,3\\},$\n$\\{1,2,6\\},\\{1,3,6\\},\\{2,3,6\\},\\{1,2,3,6\\}$\nを並べ替えてできる数列のみです。\n$\\{3,4\\}$ や $\\{2\\}$ を並べ替えてできる数列は、最小公倍数がそれぞれ $12$ と $2$ であるため、条件を満たしません。\nSample Input 3\n1000000000\nSample Output 3\n919844582\n$10^9+7$ で割った余りを出力してください。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3155_10092029","code_snippet":"// competitive-verifier: PROBLEM\n#include <cstdint>\n#include <iostream>\n#include <type_traits>\n#include <utility>\nnamespace internal {\n// @param m `1 <= m`\n// @return x mod m\nconstexpr std::int64_t safe_mod(std::int64_t x, std::int64_t m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n std::uint64_t im;\n // @param m `1 <= m`\n explicit barrett(unsigned int m) : _m(m), im((std::uint64_t)(-1) / m + 1) {}\n // @return m\n unsigned int umod() const { return _m; }\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n std::uint64_t z = a;\n z *= b;\n std::uint64_t x = (std::uint64_t)(((__uint128_t)(z)*im) >> 64);\n std::uint64_t y = x * _m;\n return (unsigned int)(z - y + (z < y ? _m : 0));\n }\n};\nstruct montgomery {\n std::uint64_t _m;\n std::uint64_t im;\n std::uint64_t r2;\n // @param m `1 <= m`\n explicit constexpr montgomery(std::uint64_t m) : _m(m), im(m), r2(-__uint128_t(m) % m) {\n for (int i = 0; i < 5; ++i) im = im * (2 - _m * im);\n im = -im;\n }\n // @return m\n constexpr std::uint64_t umod() const { return _m; }\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n constexpr std::uint64_t mul(std::uint64_t a, std::uint64_t b) const { return mr(mr(a, b), r2); }\n constexpr std::uint64_t exp(std::uint64_t a, std::uint64_t b) const {\n std::uint64_t res = 1, p = mr(a, r2);\n while (b) {\n if (b & 1) res = mr(res, p);\n p = mr(p, p);\n b >>= 1;\n }\n return res;\n }\n constexpr bool same_pow(std::uint64_t x, int s, std::uint64_t n) const {\n x = mr(x, r2), n = mr(n, r2);\n for (int r = 0; r < s; r++) {\n if (x == n) return true;\n x = mr(x, x);\n }\n return false;\n }\n private:\n constexpr std::uint64_t mr(std::uint64_t x) const {\n return ((__uint128_t)(x * im) * _m + x) >> 64;\n }\n constexpr std::uint64_t mr(std::uint64_t a, std::uint64_t b) const {\n __uint128_t t = (__uint128_t)a * b;\n std::uint64_t inc = std::uint64_t(t) != 0;\n std::uint64_t x = t >> 64, y = ((__uint128_t)(a * b * im) * _m) >> 64;\n unsigned long long z = 0;\n bool f = __builtin_uaddll_overflow(x, y, &z);\n z += inc;\n return f ? z - _m : z;\n }\n};\nconstexpr bool is_SPRP32(std::uint32_t n, std::uint32_t a) {\n std::uint32_t d = n - 1, s = 0;\n while ((d & 1) == 0) ++s, d >>= 1;\n std::uint64_t cur = 1, pw = d;\n while (pw) {\n if (pw & 1) cur = (cur * a) % n;\n a = (std::uint64_t)a * a % n;\n pw >>= 1;\n }\n if (cur == 1) return true;\n for (std::uint32_t r = 0; r < s; r++) {\n if (cur == n - 1) return true;\n cur = cur * cur % n;\n }\n return false;\n}\n// given 2 <= n,a < 2^64, a prime, check whether n is a-SPRP\nconstexpr bool is_SPRP64(const montgomery &m, std::uint64_t a) {\n auto n = m.umod();\n if (n == a) return true;\n if (n % a == 0) return false;\n std::uint64_t d = n - 1;\n int s = 0;\n while ((d & 1) == 0) ++s, d >>= 1;\n std::uint64_t cur = m.exp(a, d);\n if (cur == 1) return true;\n return m.same_pow(cur, s, n - 1);\n}\nconstexpr bool is_prime_constexpr(std::uint64_t x) {\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\n if (x < 121) return (x > 1);\n montgomery m(x);\n constexpr std::uint64_t bases[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\n for (auto a : bases) {\n if (!is_SPRP64(m, a)) return false;\n }\n return true;\n}\nconstexpr bool is_prime_constexpr(std::int64_t x) {\n if (x < 0) return false;\n return is_prime_constexpr(std::uint64_t(x));\n}\nconstexpr bool is_prime_constexpr(std::uint32_t x) {\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\n if (x < 121) return (x > 1);\n std::uint64_t h = x;\n h = ((h >> 16) ^ h) * 0x45d9f3b;\n h = ((h >> 16) ^ h) * 0x45d9f3b;\n h = ((h >> 16) ^ h) & 255;\n constexpr uint16_t bases[] = {\n 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620, 560,\n 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028,\n 2213, 6219, 620, 3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113,\n 7061, 803, 1269, 3875, 422, 751, 580, 4729, 10239, 746, 2951, 556, 2206,\n 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,\n 15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903,\n 737, 1887, 7447, 1888, 2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41,\n 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352, 6435, 165, 1169, 3315,\n 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,\n 27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524,\n 3577, 236, 2360, 6146, 2850, 55637, 1753, 4178, 8466, 222, 2579, 2743, 2031,\n 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159, 1725, 3597, 3366, 14336,\n 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,\n 434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183,\n 8126, 1870, 3296, 7455, 8947, 25017, 541, 19115, 368, 566, 5674, 411, 522,\n 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007, 35201, 4706, 1152, 1785,\n 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,\n 4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816,\n 5197, 13330, 7054, 2818, 3199, 811, 922, 350, 7514, 4452, 3449, 2663, 4708,\n 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194};\n return is_SPRP32(x, bases[h]);\n}\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr std::int64_t pow_mod_constexpr(std::int64_t x, std::int64_t n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n std::uint64_t r = 1;\n std::uint64_t y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n std::int64_t d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr std::int64_t bases[3] = {2, 7, 61};\n for (std::int64_t a : bases) {\n std::int64_t t = d;\n std::int64_t y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) { return false; }\n }\n return true;\n}\ntemplate <int n>\nconstexpr bool is_prime = is_prime_constexpr(n);\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<std::int64_t, std::int64_t> inv_gcd(std::int64_t a, std::int64_t b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n std::int64_t s = b, t = a;\n std::int64_t m0 = 0, m1 = 1;\n while (t) {\n std::int64_t u = s / t;\n s -= t * u;\n m0 -= m1 * u;\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (std::int64_t)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) { x /= i; }\n }\n }\n if (x > 1) { divs[cnt++] = x; }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m>\nconstexpr int primitive_root = primitive_root_constexpr(m);\n} // namespace internal\n#include <cassert>\n#include <numeric>\nnamespace internal {\ntemplate <class T>\nusing is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;\ntemplate <class T>\nusing is_integral =\n typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value, make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\ntemplate <class T>\nusing to_unsigned_t = typename to_unsigned<T>::type;\n} // namespace internal\nnamespace internal {\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\ntemplate <class T>\nusing is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T>\nusing is_modint_t = std::enable_if_t<is_modint<T>::value>;\n} // namespace internal\ntemplate <int m, std::enable_if_t<(1 <= m)> * = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n public:\n static constexpr int mod() { return m; }\n static constexpr mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n constexpr static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T> * = nullptr>\n constexpr static_modint(T v) : _v(0) {\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\n constexpr static_modint(T v) : _v(0) {\n _v = (unsigned int)(v % umod());\n }\n constexpr unsigned int val() const { return _v; }\n constexpr mint &operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n constexpr mint &operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n constexpr mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n constexpr mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n constexpr mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n constexpr mint &operator-=(const mint &rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n constexpr mint &operator*=(const mint &rhs) {\n std::uint64_t z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n constexpr mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n constexpr mint operator+() const { return *this; }\n constexpr mint operator-() const { return mint() - *this; }\n constexpr mint pow(std::int64_t n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n constexpr mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n friend constexpr mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\n friend constexpr mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\n friend constexpr mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\n friend constexpr mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\n friend constexpr bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\n friend constexpr bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\n std::int64_t t;\n is >> t;\n rhs = mint(t);\n return is;\n }\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\n return os << rhs._v;\n }\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\ntemplate <int id>\nstruct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n unsigned int val() const { return _v; }\n mint &operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint &operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint &operator-=(const mint &rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint &operator*=(const mint &rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n mint pow(std::int64_t n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\n friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\n friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\n friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\n friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\n friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\n std::int64_t t;\n is >> t;\n rhs = mint(t);\n return is;\n }\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\n return os << rhs._v;\n }\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id>\ninternal::barrett dynamic_modint<id>::bt(998244353);\nusing modint998 = static_modint<998244353>;\nusing modint107 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\nnamespace internal {\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\ntemplate <class>\nstruct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n} // namespace internal\n#include <algorithm>\n#include <bitset>\n#include <iterator>\n#include <vector>\n/**\n * @brief 素数ライブラリ\n *\n * @tparam N\n */\ntemplate <int N = 1 << 22>\nstruct prime_number {\n prime_number() : is_not_prime(), data() { init(); }\n /**\n * @brief 素数判定\n *\n * @param n\n * @return bool\n */\n bool is_prime(std::int64_t n) const {\n assert(n >= 0);\n if (n < N) return !is_not_prime[n];\n for (auto i : data) {\n if ((std::int64_t)i * i > n) break;\n if (n % i == 0) return false;\n }\n return true;\n }\n std::vector<int> prime_numbers(int x) const {\n std::vector<int> res;\n for (auto i : data) {\n if (i > x) break;\n res.emplace_back(i);\n }\n return res;\n }\n /**\n * @brief 素因数分解\n *\n * @tparam T\n * @param x\n * @return std::vector<std::pair<T, int>>\n */\n template <class T>\n std::vector<std::pair<T, int>> prime_factorization(T x) const {\n if (x == 1) return std::vector<std::pair<T, int>>();\n std::vector<std::pair<T, int>> res;\n for (auto p : data) {\n int cnt = 0;\n for (; x % p == 0; x /= p) ++cnt;\n if (cnt) res.emplace_back(p, cnt);\n if ((std::int64_t)p * p > x) break;\n }\n if (x != 1) res.emplace_back(x, 1);\n return res;\n }\n /**\n * @brief 約数列挙\n *\n * @tparam T\n * @param x\n * @return std::vector<T>\n */\n template <class T>\n std::vector<T> divisors(T x) const {\n if (x == 1) return std::vector<T>(1, 1);\n auto v = prime_factorization(x);\n std::vector<T> res;\n res.emplace_back(1);\n for (auto p : v) {\n int n = res.size();\n res.resize(n * (p.second + 1));\n for (int i = 0; i < n * p.second; ++i) res[n + i] = res[i] * p.first;\n for (int i = 1; i <= p.second; ++i) {\n std::inplace_merge(res.begin(), res.begin() + n * i, res.begin() + n * (i + 1));\n }\n }\n return res;\n }\n /**\n * @brief 因数分解列挙\n *\n * @tparam T\n * @param x\n * @return std::vector<std::vector<T>>\n */\n template <class T>\n std::vector<std::vector<T>> factorization(T x) const {\n std::vector<std::vector<T>> res;\n auto f = [&](auto self, std::vector<T> v, T a) -> void {\n if (a == 1) res.emplace_back(v);\n for (auto i : this->divisors(a)) {\n if (i == 1 || (!v.empty() && v.back() > i)) continue;\n v.emplace_back(i);\n self(self, v, a / i);\n v.pop_back();\n }\n };\n f(f, std::vector<T>(), x);\n return res;\n }\n private:\n std::bitset<N> is_not_prime;\n std::vector<int> data;\n void init() {\n is_not_prime[0] = is_not_prime[1] = true;\n for (int i = 2; i < N; ++i) {\n if (!is_not_prime[i]) {\n data.emplace_back(i);\n if ((std::int64_t)i * i >= N) continue;\n if (i == 2) {\n for (int j = i * i; j < N; j += i) is_not_prime[j] = true;\n } else {\n for (int j = i * i; j < N; j += i << 1) is_not_prime[j] = true;\n }\n }\n }\n }\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nusing Mint = modint107;\nprime_number pn;\nint main(void) {\n ll n;\n cin >> n;\n if (n == 1) {\n co(1);\n return 0;\n }\n auto v = pn.prime_factorization(n);\n int m = v.size();\n Mint ans = 0;\n rep (bit, 1 << m) {\n ll sum = 1;\n int c = 0;\n rep (i, m) {\n if (~bit >> i & 1) {\n sum *= v[i].second + 1;\n } else {\n ++c;\n sum *= v[i].second;\n }\n }\n Mint p = 1;\n Mint x = 0;\n repnr (i, sum) {\n p *= i;\n x += p;\n }\n if (c & 1) {\n ans -= x;\n } else {\n ans += x;\n }\n }\n co(ans);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6492,"score_of_the_acc":-0.0176,"final_rank":1},{"submission_id":"aoj_3155_10092027","code_snippet":"// competitive-verifier: PROBLEM\n#include <cstdint>\n#include <iostream>\n#include <type_traits>\n#include <utility>\nnamespace internal {\n// @param m `1 <= m`\n// @return x mod m\nconstexpr std::int64_t safe_mod(std::int64_t x, std::int64_t m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n std::uint64_t im;\n // @param m `1 <= m`\n explicit barrett(unsigned int m) : _m(m), im((std::uint64_t)(-1) / m + 1) {}\n // @return m\n unsigned int umod() const { return _m; }\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n std::uint64_t z = a;\n z *= b;\n std::uint64_t x = (std::uint64_t)(((__uint128_t)(z)*im) >> 64);\n std::uint64_t y = x * _m;\n return (unsigned int)(z - y + (z < y ? _m : 0));\n }\n};\nstruct montgomery {\n std::uint64_t _m;\n std::uint64_t im;\n std::uint64_t r2;\n // @param m `1 <= m`\n explicit constexpr montgomery(std::uint64_t m) : _m(m), im(m), r2(-__uint128_t(m) % m) {\n for (int i = 0; i < 5; ++i) im = im * (2 - _m * im);\n im = -im;\n }\n // @return m\n constexpr std::uint64_t umod() const { return _m; }\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n constexpr std::uint64_t mul(std::uint64_t a, std::uint64_t b) const { return mr(mr(a, b), r2); }\n constexpr std::uint64_t exp(std::uint64_t a, std::uint64_t b) const {\n std::uint64_t res = 1, p = mr(a, r2);\n while (b) {\n if (b & 1) res = mr(res, p);\n p = mr(p, p);\n b >>= 1;\n }\n return res;\n }\n constexpr bool same_pow(std::uint64_t x, int s, std::uint64_t n) const {\n x = mr(x, r2), n = mr(n, r2);\n for (int r = 0; r < s; r++) {\n if (x == n) return true;\n x = mr(x, x);\n }\n return false;\n }\n private:\n constexpr std::uint64_t mr(std::uint64_t x) const {\n return ((__uint128_t)(x * im) * _m + x) >> 64;\n }\n constexpr std::uint64_t mr(std::uint64_t a, std::uint64_t b) const {\n __uint128_t t = (__uint128_t)a * b;\n std::uint64_t inc = std::uint64_t(t) != 0;\n std::uint64_t x = t >> 64, y = ((__uint128_t)(a * b * im) * _m) >> 64;\n unsigned long long z = 0;\n bool f = __builtin_uaddll_overflow(x, y, &z);\n z += inc;\n return f ? z - _m : z;\n }\n};\nconstexpr bool is_SPRP32(std::uint32_t n, std::uint32_t a) {\n std::uint32_t d = n - 1, s = 0;\n while ((d & 1) == 0) ++s, d >>= 1;\n std::uint64_t cur = 1, pw = d;\n while (pw) {\n if (pw & 1) cur = (cur * a) % n;\n a = (std::uint64_t)a * a % n;\n pw >>= 1;\n }\n if (cur == 1) return true;\n for (std::uint32_t r = 0; r < s; r++) {\n if (cur == n - 1) return true;\n cur = cur * cur % n;\n }\n return false;\n}\n// given 2 <= n,a < 2^64, a prime, check whether n is a-SPRP\nconstexpr bool is_SPRP64(const montgomery &m, std::uint64_t a) {\n auto n = m.umod();\n if (n == a) return true;\n if (n % a == 0) return false;\n std::uint64_t d = n - 1;\n int s = 0;\n while ((d & 1) == 0) ++s, d >>= 1;\n std::uint64_t cur = m.exp(a, d);\n if (cur == 1) return true;\n return m.same_pow(cur, s, n - 1);\n}\nconstexpr bool is_prime_constexpr(std::uint64_t x) {\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\n if (x < 121) return (x > 1);\n montgomery m(x);\n constexpr std::uint64_t bases[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\n for (auto a : bases) {\n if (!is_SPRP64(m, a)) return false;\n }\n return true;\n}\nconstexpr bool is_prime_constexpr(std::int64_t x) {\n if (x < 0) return false;\n return is_prime_constexpr(std::uint64_t(x));\n}\nconstexpr bool is_prime_constexpr(std::uint32_t x) {\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\n if (x < 121) return (x > 1);\n std::uint64_t h = x;\n h = ((h >> 16) ^ h) * 0x45d9f3b;\n h = ((h >> 16) ^ h) * 0x45d9f3b;\n h = ((h >> 16) ^ h) & 255;\n constexpr uint16_t bases[] = {\n 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620, 560,\n 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028,\n 2213, 6219, 620, 3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113,\n 7061, 803, 1269, 3875, 422, 751, 580, 4729, 10239, 746, 2951, 556, 2206,\n 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,\n 15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903,\n 737, 1887, 7447, 1888, 2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41,\n 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352, 6435, 165, 1169, 3315,\n 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,\n 27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524,\n 3577, 236, 2360, 6146, 2850, 55637, 1753, 4178, 8466, 222, 2579, 2743, 2031,\n 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159, 1725, 3597, 3366, 14336,\n 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,\n 434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183,\n 8126, 1870, 3296, 7455, 8947, 25017, 541, 19115, 368, 566, 5674, 411, 522,\n 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007, 35201, 4706, 1152, 1785,\n 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,\n 4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816,\n 5197, 13330, 7054, 2818, 3199, 811, 922, 350, 7514, 4452, 3449, 2663, 4708,\n 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194};\n return is_SPRP32(x, bases[h]);\n}\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr std::int64_t pow_mod_constexpr(std::int64_t x, std::int64_t n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n std::uint64_t r = 1;\n std::uint64_t y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n std::int64_t d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr std::int64_t bases[3] = {2, 7, 61};\n for (std::int64_t a : bases) {\n std::int64_t t = d;\n std::int64_t y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) { return false; }\n }\n return true;\n}\ntemplate <int n>\nconstexpr bool is_prime = is_prime_constexpr(n);\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<std::int64_t, std::int64_t> inv_gcd(std::int64_t a, std::int64_t b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n std::int64_t s = b, t = a;\n std::int64_t m0 = 0, m1 = 1;\n while (t) {\n std::int64_t u = s / t;\n s -= t * u;\n m0 -= m1 * u;\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (std::int64_t)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) { x /= i; }\n }\n }\n if (x > 1) { divs[cnt++] = x; }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m>\nconstexpr int primitive_root = primitive_root_constexpr(m);\n} // namespace internal\n#include <cassert>\n#include <numeric>\nnamespace internal {\ntemplate <class T>\nusing is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;\ntemplate <class T>\nusing is_integral =\n typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value, make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\ntemplate <class T>\nusing to_unsigned_t = typename to_unsigned<T>::type;\n} // namespace internal\nnamespace internal {\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\ntemplate <class T>\nusing is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T>\nusing is_modint_t = std::enable_if_t<is_modint<T>::value>;\n} // namespace internal\ntemplate <int m, std::enable_if_t<(1 <= m)> * = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n public:\n static constexpr int mod() { return m; }\n static constexpr mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n constexpr static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T> * = nullptr>\n constexpr static_modint(T v) : _v(0) {\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\n constexpr static_modint(T v) : _v(0) {\n _v = (unsigned int)(v % umod());\n }\n constexpr unsigned int val() const { return _v; }\n constexpr mint &operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n constexpr mint &operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n constexpr mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n constexpr mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n constexpr mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n constexpr mint &operator-=(const mint &rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n constexpr mint &operator*=(const mint &rhs) {\n std::uint64_t z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n constexpr mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n constexpr mint operator+() const { return *this; }\n constexpr mint operator-() const { return mint() - *this; }\n constexpr mint pow(std::int64_t n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n constexpr mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n friend constexpr mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\n friend constexpr mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\n friend constexpr mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\n friend constexpr mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\n friend constexpr bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\n friend constexpr bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\n std::int64_t t;\n is >> t;\n rhs = mint(t);\n return is;\n }\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\n return os << rhs._v;\n }\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\ntemplate <int id>\nstruct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n unsigned int val() const { return _v; }\n mint &operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint &operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint &operator-=(const mint &rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint &operator*=(const mint &rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n mint pow(std::int64_t n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\n friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\n friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\n friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\n friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\n friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\n std::int64_t t;\n is >> t;\n rhs = mint(t);\n return is;\n }\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\n return os << rhs._v;\n }\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id>\ninternal::barrett dynamic_modint<id>::bt(998244353);\nusing modint998 = static_modint<998244353>;\nusing modint107 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\nnamespace internal {\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\ntemplate <class>\nstruct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n} // namespace internal\n#include <algorithm>\n#include <bitset>\n#include <iterator>\n#include <vector>\n/**\n * @brief 素数ライブラリ\n *\n * @tparam N\n */\ntemplate <int N = 1 << 22>\nstruct prime_number {\n prime_number() : is_not_prime(), data() { init(); }\n /**\n * @brief 素数判定\n *\n * @param n\n * @return bool\n */\n bool is_prime(std::int64_t n) const {\n assert(n >= 0);\n if (n < N) return !is_not_prime[n];\n for (auto i : data) {\n if ((std::int64_t)i * i > n) break;\n if (n % i == 0) return false;\n }\n return true;\n }\n std::vector<int> prime_numbers(int x) const {\n std::vector<int> res;\n for (auto i : data) {\n if (i > x) break;\n res.emplace_back(i);\n }\n return res;\n }\n /**\n * @brief 素因数分解\n *\n * @tparam T\n * @param x\n * @return std::vector<std::pair<T, int>>\n */\n template <class T>\n std::vector<std::pair<T, int>> prime_factorization(T x) const {\n if (x == 1) return std::vector<std::pair<T, int>>();\n std::vector<std::pair<T, int>> res;\n for (auto p : data) {\n int cnt = 0;\n for (; x % p == 0; x /= p) ++cnt;\n if (cnt) res.emplace_back(p, cnt);\n if ((std::int64_t)p * p > x) break;\n }\n if (x != 1) res.emplace_back(x, 1);\n return res;\n }\n /**\n * @brief 約数列挙\n *\n * @tparam T\n * @param x\n * @return std::vector<T>\n */\n template <class T>\n std::vector<T> divisors(T x) const {\n if (x == 1) return std::vector<T>(1, 1);\n auto v = prime_factorization(x);\n std::vector<T> res;\n res.emplace_back(1);\n for (auto p : v) {\n int n = res.size();\n res.resize(n * (p.second + 1));\n for (int i = 0; i < n * p.second; ++i) res[n + i] = res[i] * p.first;\n for (int i = 1; i <= p.second; ++i) {\n std::inplace_merge(res.begin(), res.begin() + n * i, res.begin() + n * (i + 1));\n }\n }\n return res;\n }\n /**\n * @brief 因数分解列挙\n *\n * @tparam T\n * @param x\n * @return std::vector<std::vector<T>>\n */\n template <class T>\n std::vector<std::vector<T>> factorization(T x) const {\n std::vector<std::vector<T>> res;\n auto f = [&](auto self, std::vector<T> v, T a) -> void {\n if (a == 1) res.emplace_back(v);\n for (auto i : this->divisors(a)) {\n if (i == 1 || (!v.empty() && v.back() > i)) continue;\n v.emplace_back(i);\n self(self, v, a / i);\n v.pop_back();\n }\n };\n f(f, std::vector<T>(), x);\n return res;\n }\n private:\n std::bitset<N> is_not_prime;\n std::vector<int> data;\n void init() {\n is_not_prime[0] = is_not_prime[1] = true;\n for (int i = 2; i < N; ++i) {\n if (!is_not_prime[i]) {\n data.emplace_back(i);\n if ((std::int64_t)i * i >= N) continue;\n if (i == 2) {\n for (int j = i * i; j < N; j += i) is_not_prime[j] = true;\n } else {\n for (int j = i * i; j < N; j += i << 1) is_not_prime[j] = true;\n }\n }\n }\n }\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nusing Mint = modint107;\nprime_number pn;\nint main(void) {\n ll n;\n cin >> n;\n if (n == 1) {\n co(1);\n return 0;\n }\n auto v = pn.prime_factorization(n);\n int m = v.size();\n Mint ans = 0;\n rep (bit, 1 << m) {\n ll sum = 1;\n int c = 0;\n rep (i, m) {\n if (~bit >> i & 1) {\n ++c;\n sum *= v[i].second + 1;\n } else {\n sum *= v[i].second;\n }\n }\n Mint p = 1;\n Mint x = 0;\n repnr (i, sum) {\n p *= i;\n x += p;\n }\n if (c & 1) {\n ans -= x;\n } else {\n ans += x;\n }\n }\n co(ans);\n return 0;\n}","accuracy":0.12121212121212122,"time_ms":10,"memory_kb":5524,"score_of_the_acc":-0.0122,"final_rank":18},{"submission_id":"aoj_3155_5973339","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\n#pragma GCC target (\"avx2\")\n#pragma GCC optimization (\"O3\")\n#pragma GCC optimization (\"unroll-loops\")\nusing namespace std;\n \ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<int, int> pii;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\n \ntypedef long long ll;\ntypedef long double ld;\ntypedef unsigned long long ull;\n \n \n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n \n#define MOD 1000000007\n \ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\nconst double EPS = 1e-8, PI = acos(-1);\nconst double pi = 3.141592653589793238462643383279;\n//ここから編集 \ntypedef string::const_iterator State;\nll GCD(ll a, ll b){\n return (b==0)?a:GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b) * b;\n}\ntemplate< int mod >\nstruct ModInt {\n int x;\n \n ModInt() : x(0) {}\n \n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n \n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n \n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n \n ModInt operator-() const { return ModInt(-x); }\n \n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n \n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n \n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n \n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n \n bool operator==(const ModInt &p) const { return x == p.x; }\n \n bool operator!=(const ModInt &p) const { return x != p.x; }\n \n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n \n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n \n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n \n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n \n static int get_mod() { return mod; }\n};\n \nusing modint = ModInt< 1000000007 >;\ntemplate< typename T >\nstruct Combination {\n vector< T > _fact, _rfact, _inv;\n \n Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {\n _fact[0] = _rfact[sz] = _inv[0] = 1;\n for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;\n _rfact[sz] /= _fact[sz];\n for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\n for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];\n }\n \n inline T fact(int k) const { return _fact[k]; }\n \n inline T rfact(int k) const { return _rfact[k]; }\n \n inline T inv(int k) const { return _inv[k]; }\n \n T P(int n, int r) const {\n if(r < 0 || n < r) return 0;\n return fact(n) * rfact(n - r);\n }\n \n T C(int p, int q) const {\n if(q < 0 || p < q) return 0;\n return fact(p) * rfact(q) * rfact(p - q);\n }\n \n T H(int n, int r) const {\n if(n < 0 || r < 0) return (0);\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\n \nll modpow(ll x, ll n, ll mod) {\n ll res = 1;\n x %= mod;\n if(x == 0) return 0;\n while(n) {\n if(n&1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n} \ninline long long mod(long long a, long long m) {\n return (a % m + m) % m;\n}\ntemplate<typename T> \nstruct BIT{\n int N;\n std::vector<T> node;\n BIT(){}\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\n void build(int n) {\n N = n;\n node.resize(N+10);\n }\n /* a: 1-indexed */\n void add(int a, T x){\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\n }\n\n /* [1, a] */\n T sum(int a){\n T res = 0;\n for(int x=a; x>0; x -= x & -x) res += node[x];\n return res;\n }\n\n /* [l, r] */\n T rangesum(int l, int r){\n return sum(r) - sum(l-1);\n }\n\n /* \n a1+a2+...+aw >= valとなるような最小のwを返す\n @verify https://codeforces.com/contest/992/problem/E\n */\n int lower_bound(T val) {\n if(val < 0) return 0;\n\n int res = 0;\n int n = 1; \n while (n < N) n *= 2;\n\n T tv=0;\n for (int k = n; k > 0; k /= 2) {\n if(res + k < N && node[res + k] < val){\n val -= node[res+k];\n res += k;\n }\n }\n return res+1; \n }\n};\nstruct UnionFind{\n std::vector<int> par;\n std::vector<int> siz;\n\n UnionFind(int sz_): par(sz_), siz(sz_) {\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n void init(int sz_){\n par.resize(sz_);\n siz.resize(sz_);\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n int root(int x){\n if(x == par[x]) return x;\n return par[x] = root(par[x]);\n }\n\n bool merge(int x, int y){\n x = root(x), y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) std::swap(x, y);\n siz[x] += siz[y];\n par[y] = x;\n return true;\n }\n\n bool issame(int x, int y){\n return root(x) == root(y);\n }\n\n int size(int x){\n return siz[root(x)];\n }\n};\nstruct RollingHash{\n\n using ull = unsigned long long;\n const ull mod = (1ULL << 61) - 1;\n const ull MASK30 = (1ULL << 30) - 1;\n const ull MASK31 = (1ULL << 31) - 1;\n\n const ull MASK61 = mod;\n\n ull base;\n int n;\n vector<ull> hash, pow;\n\n RollingHash(const string &s)\n {\n random_device rnd;\n mt19937_64 mt(rnd());\n base = 1001;\n \n n = (int)s.size();\n hash.assign(n+1, 0);\n pow.assign(n+1, 1);\n \n for(int i=0; i<n; i++){\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\n pow[i+1] = calc_mod(mul(pow[i], base));\n }\n }\n\n ull calc_mod(ull x){\n ull xu = x >> 61;\n ull xd = x & MASK61;\n ull res = xu + xd;\n if(res >= mod) res -= mod;\n return res;\n }\n\n ull mul(ull a, ull b){\n ull au = a >> 31;\n ull ad = a & MASK31;\n ull bu = b >> 31;\n ull bd = b & MASK31;\n ull mid = ad * bu + au * bd;\n ull midu = mid >> 30;\n ull midd = mid & MASK30;\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\n }\n\n //[l,r)のハッシュ値\n inline ull get(int l, int r){\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\n return res;\n }\n //string tのハッシュ値\n inline ull get(string t){\n ull res = 0;\n for(int i=0; i<t.size(); i++){\n res = calc_mod(mul(res, base)+t[i]);\n }\n return res;\n }\n //string s中のtの数をカウント\n inline int count(string t) {\n if(t.size() > n) return 0;\n auto hs = get(t);\n int res = 0;\n for(int i=0; i<n-t.size()+1; i++){\n if(get(i, i+t.size()) == hs) res++; \n }\n return res;\n }\n\n /* \n concat \n @verify https://codeforces.com/problemset/problem/514/C\n */\n inline ull concat(ull h1, ull h2, int h2len){\n return calc_mod(h2 + mul(h1, pow[h2len]));\n }\n\n // LCPを求める S[a:] T[b:]\n inline int LCP(int a, int b){\n int len = min((int)hash.size()-a, (int)hash.size()-b);\n \n int lb = -1, ub = len;\n while(ub-lb>1){\n int mid = (lb+ub)/2;\n\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\n else ub = mid;\n }\n return lb;\n }\n};\nint maximum_independent_set(vector<vector<int>> &g) {\n int n = g.size();\n int n1 = n/2, n2 = n-n1;\n vector<int> dp2((1<<n2));\n REP(i,n2) dp2[(1<<i)] = 1;\n REP(bit, (1<<n2)) {\n REP(i,n2) {\n if(bit >> i & 1) continue;\n bool ok = true;\n REP(j,n2) {\n if(bit >> j & 1) ok &= g[n1+i][n1+j];\n }\n int c = 0;\n if(ok) c++;\n dp2[bit | (1 << i)] = max(dp2[bit | (1 << i)], dp2[bit] + c);\n }\n }\n int ans = 0;\n REP(bit,(1<<n1)) {\n vector<int> cand;\n REP(i,n1) {\n if(bit >> i & 1) cand.push_back(i);\n }\n bool ok = true;\n REP(i,cand.size()) {\n FOR(j, i+1 ,cand.size()) {\n ok &= g[cand[i]][cand[j]];\n }\n }\n if(!ok) continue;\n ll bit2 = 0;\n REP(i,n2) {\n ok = true;\n REP(j,cand.size()){\n ok &= g[i+n1][cand[j]];\n }\n if(ok) bit2 |= (1<<i);\n }\n ans = max(ans, __builtin_popcount(bit) + dp2[bit2]);\n }\n return ans;\n}\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n \n ll N; cin >> N;\n vector<ll> d;\n ll t = N;\n for(ll i=1; i*i<=t; i++) {\n if(t%i == 0) {\n d.push_back(i);\n if(t/i != i) d.push_back(t/i);\n }\n }\n sort(all(d));\n map<ll, int> mp;\n for(ll i=2; i*i<=t; i++) {\n if(t%i == 0) {\n while(t%i == 0) {\n mp[i]++;\n t/=i;\n }\n }\n }\n if(t != 1) mp[t]++;\n vector<ll> v;\n for(auto e: mp) {\n ll tmp = 1;\n REP(i,e.second) tmp *= e.first;\n v.push_back(tmp);\n } \n Combination<modint> comb(10010);\n int n = mp.size();\n modint ans = 0;\n REP(bit, (1<<n)) {\n ll tmp = 1;\n int cnt = 0;\n REP(i,d.size()) {\n bool f = true;\n REP(j,n) {\n if(bit >> j & 1) {\n if(d[i]%v[j] == 0) f = false;\n }\n }\n if(f) cnt++;\n }\n \n modint res = 0;\n for(int i=1; i<=cnt; i++) res += comb.P(cnt, i);\n if(__builtin_popcount(bit)%2 == 1) res *= -1;\n ans += res;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":3580,"score_of_the_acc":-0.2578,"final_rank":4},{"submission_id":"aoj_3155_5973337","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\n#pragma GCC target (\"avx2\")\n#pragma GCC optimization (\"O3\")\n#pragma GCC optimization (\"unroll-loops\")\nusing namespace std;\n \ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<int, int> pii;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\n \ntypedef long long ll;\ntypedef long double ld;\ntypedef unsigned long long ull;\n \n \n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n \n#define MOD 1000000007\n \ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\nconst double EPS = 1e-8, PI = acos(-1);\nconst double pi = 3.141592653589793238462643383279;\n//ここから編集 \ntypedef string::const_iterator State;\nll GCD(ll a, ll b){\n return (b==0)?a:GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b) * b;\n}\ntemplate< int mod >\nstruct ModInt {\n int x;\n \n ModInt() : x(0) {}\n \n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n \n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n \n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n \n ModInt operator-() const { return ModInt(-x); }\n \n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n \n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n \n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n \n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n \n bool operator==(const ModInt &p) const { return x == p.x; }\n \n bool operator!=(const ModInt &p) const { return x != p.x; }\n \n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n \n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n \n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n \n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n \n static int get_mod() { return mod; }\n};\n \nusing modint = ModInt< 1000000007 >;\ntemplate< typename T >\nstruct Combination {\n vector< T > _fact, _rfact, _inv;\n \n Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {\n _fact[0] = _rfact[sz] = _inv[0] = 1;\n for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;\n _rfact[sz] /= _fact[sz];\n for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\n for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];\n }\n \n inline T fact(int k) const { return _fact[k]; }\n \n inline T rfact(int k) const { return _rfact[k]; }\n \n inline T inv(int k) const { return _inv[k]; }\n \n T P(int n, int r) const {\n if(r < 0 || n < r) return 0;\n return fact(n) * rfact(n - r);\n }\n \n T C(int p, int q) const {\n if(q < 0 || p < q) return 0;\n return fact(p) * rfact(q) * rfact(p - q);\n }\n \n T H(int n, int r) const {\n if(n < 0 || r < 0) return (0);\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\n \nll modpow(ll x, ll n, ll mod) {\n ll res = 1;\n x %= mod;\n if(x == 0) return 0;\n while(n) {\n if(n&1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n} \ninline long long mod(long long a, long long m) {\n return (a % m + m) % m;\n}\ntemplate<typename T> \nstruct BIT{\n int N;\n std::vector<T> node;\n BIT(){}\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\n void build(int n) {\n N = n;\n node.resize(N+10);\n }\n /* a: 1-indexed */\n void add(int a, T x){\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\n }\n\n /* [1, a] */\n T sum(int a){\n T res = 0;\n for(int x=a; x>0; x -= x & -x) res += node[x];\n return res;\n }\n\n /* [l, r] */\n T rangesum(int l, int r){\n return sum(r) - sum(l-1);\n }\n\n /* \n a1+a2+...+aw >= valとなるような最小のwを返す\n @verify https://codeforces.com/contest/992/problem/E\n */\n int lower_bound(T val) {\n if(val < 0) return 0;\n\n int res = 0;\n int n = 1; \n while (n < N) n *= 2;\n\n T tv=0;\n for (int k = n; k > 0; k /= 2) {\n if(res + k < N && node[res + k] < val){\n val -= node[res+k];\n res += k;\n }\n }\n return res+1; \n }\n};\nstruct UnionFind{\n std::vector<int> par;\n std::vector<int> siz;\n\n UnionFind(int sz_): par(sz_), siz(sz_) {\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n void init(int sz_){\n par.resize(sz_);\n siz.resize(sz_);\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n int root(int x){\n if(x == par[x]) return x;\n return par[x] = root(par[x]);\n }\n\n bool merge(int x, int y){\n x = root(x), y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) std::swap(x, y);\n siz[x] += siz[y];\n par[y] = x;\n return true;\n }\n\n bool issame(int x, int y){\n return root(x) == root(y);\n }\n\n int size(int x){\n return siz[root(x)];\n }\n};\nstruct RollingHash{\n\n using ull = unsigned long long;\n const ull mod = (1ULL << 61) - 1;\n const ull MASK30 = (1ULL << 30) - 1;\n const ull MASK31 = (1ULL << 31) - 1;\n\n const ull MASK61 = mod;\n\n ull base;\n int n;\n vector<ull> hash, pow;\n\n RollingHash(const string &s)\n {\n random_device rnd;\n mt19937_64 mt(rnd());\n base = 1001;\n \n n = (int)s.size();\n hash.assign(n+1, 0);\n pow.assign(n+1, 1);\n \n for(int i=0; i<n; i++){\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\n pow[i+1] = calc_mod(mul(pow[i], base));\n }\n }\n\n ull calc_mod(ull x){\n ull xu = x >> 61;\n ull xd = x & MASK61;\n ull res = xu + xd;\n if(res >= mod) res -= mod;\n return res;\n }\n\n ull mul(ull a, ull b){\n ull au = a >> 31;\n ull ad = a & MASK31;\n ull bu = b >> 31;\n ull bd = b & MASK31;\n ull mid = ad * bu + au * bd;\n ull midu = mid >> 30;\n ull midd = mid & MASK30;\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\n }\n\n //[l,r)のハッシュ値\n inline ull get(int l, int r){\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\n return res;\n }\n //string tのハッシュ値\n inline ull get(string t){\n ull res = 0;\n for(int i=0; i<t.size(); i++){\n res = calc_mod(mul(res, base)+t[i]);\n }\n return res;\n }\n //string s中のtの数をカウント\n inline int count(string t) {\n if(t.size() > n) return 0;\n auto hs = get(t);\n int res = 0;\n for(int i=0; i<n-t.size()+1; i++){\n if(get(i, i+t.size()) == hs) res++; \n }\n return res;\n }\n\n /* \n concat \n @verify https://codeforces.com/problemset/problem/514/C\n */\n inline ull concat(ull h1, ull h2, int h2len){\n return calc_mod(h2 + mul(h1, pow[h2len]));\n }\n\n // LCPを求める S[a:] T[b:]\n inline int LCP(int a, int b){\n int len = min((int)hash.size()-a, (int)hash.size()-b);\n \n int lb = -1, ub = len;\n while(ub-lb>1){\n int mid = (lb+ub)/2;\n\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\n else ub = mid;\n }\n return lb;\n }\n};\nint maximum_independent_set(vector<vector<int>> &g) {\n int n = g.size();\n int n1 = n/2, n2 = n-n1;\n vector<int> dp2((1<<n2));\n REP(i,n2) dp2[(1<<i)] = 1;\n REP(bit, (1<<n2)) {\n REP(i,n2) {\n if(bit >> i & 1) continue;\n bool ok = true;\n REP(j,n2) {\n if(bit >> j & 1) ok &= g[n1+i][n1+j];\n }\n int c = 0;\n if(ok) c++;\n dp2[bit | (1 << i)] = max(dp2[bit | (1 << i)], dp2[bit] + c);\n }\n }\n int ans = 0;\n REP(bit,(1<<n1)) {\n vector<int> cand;\n REP(i,n1) {\n if(bit >> i & 1) cand.push_back(i);\n }\n bool ok = true;\n REP(i,cand.size()) {\n FOR(j, i+1 ,cand.size()) {\n ok &= g[cand[i]][cand[j]];\n }\n }\n if(!ok) continue;\n ll bit2 = 0;\n REP(i,n2) {\n ok = true;\n REP(j,cand.size()){\n ok &= g[i+n1][cand[j]];\n }\n if(ok) bit2 |= (1<<i);\n }\n ans = max(ans, __builtin_popcount(bit) + dp2[bit2]);\n }\n return ans;\n}\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n \n ll N; cin >> N;\n vector<ll> d;\n ll t = N;\n for(ll i=1; i*i<=t; i++) {\n if(t%i == 0) {\n d.push_back(i);\n if(t/i != i) d.push_back(t/i);\n }\n }\n sort(all(d));\n map<ll, int> mp;\n for(ll i=2; i*i<=t; i++) {\n if(t%i == 0) {\n while(t%i == 0) {\n mp[i]++;\n t/=i;\n }\n }\n }\n if(t != 1) mp[t]++;\n vector<ll> v;\n for(auto e: mp) {\n ll tmp = 1;\n REP(i,e.second) tmp *= e.first;\n v.push_back(tmp);\n } \n Combination<modint> comb(2010);\n int n = mp.size();\n modint ans = 0;\n REP(bit, (1<<n)) {\n ll tmp = 1;\n int cnt = 0;\n REP(i,d.size()) {\n bool f = true;\n REP(j,n) {\n if(bit >> j & 1) {\n if(d[i]%v[j] == 0) f = false;\n }\n }\n if(f) cnt++;\n }\n \n modint res = 0;\n for(int i=1; i<=cnt; i++) res += comb.P(cnt, i);\n if(__builtin_popcount(bit)%2 == 1) res *= -1;\n ans += res;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":0.696969696969697,"time_ms":110,"memory_kb":3484,"score_of_the_acc":-0.2573,"final_rank":14},{"submission_id":"aoj_3155_5147767","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 3000005\n#define MAX 25\n\n\nll POW[MAX];\nll fact[SIZE],inv_fact[SIZE];\n\nll mod_pow(ll x,ll count, ll mod){\n\n\tif(count == 0)return 1;\n\tll ret = mod_pow((x*x)%mod,count/2,mod);\n\tif(count%2 == 1){\n\n\t\tret = (ret*x)%mod;\n\t}\n\treturn ret;\n}\n\nll extgcd(ll a,ll b,ll &x,ll &y){\n\tll d = a;\n\tif(b != 0){\n\t\td = extgcd(b,a%b,y,x);\n\t\ty -= (a/b)*x;\n\t}else{\n\t\tx = 1;\n\t\ty = 0;\n\t}\n\treturn d;\n}\n\nll mod_inverse(ll a,ll m){\n ll x,y;\n extgcd(a,m,x,y);\n return (m+x%m)%m;\n}\n\nll nCk(ll n,ll k){\n\n\tif(k > n)return 0;\n\n\tll ret = fact[n]*inv_fact[k];\n\tret %= MOD;\n\tret *= inv_fact[n-k];\n\n\treturn ret%MOD;\n}\n\nll nPk(ll n,ll k){\n\n\tif(k > n)return 0;\n\n\tll ret = fact[n]*inv_fact[n-k];\n\n\treturn ret%MOD;\n}\n\n\n\nint main(){\n\n\tfact[0] = 1;\n\tfor(ll i = 1; i < SIZE; i++){\n\t\tfact[i] = i*fact[i-1];\n\t\tfact[i] %= MOD;\n\t}\n\tinv_fact[SIZE-1] = mod_inverse(fact[SIZE-1],MOD);\n\tfor(ll i = SIZE-1; i >= 1; i--){\n\n\t\tinv_fact[i-1] = inv_fact[i]*i;\n\t\tinv_fact[i-1] %= MOD;\n\t}\n\tfor(ll i = 1; i < SIZE; i++){\n\n\t\tinv_fact[i] += inv_fact[i-1];\n\t\tinv_fact[i] %= MOD;\n\t}\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tll N;\n\tscanf(\"%lld\",&N);\n\n\tll tmp = N;\n\tvector<ll> vec;\n\n\tfor(ll i = 2; i*i <= N; i++){\n\t\tif(tmp%i != 0)continue;\n\n\t\tll count = 0;\n\n\t\twhile(tmp%i == 0){\n\n\t\t\ttmp /= i;\n\t\t\tcount++;\n\t\t}\n\t\tvec.push_back(count);\n\t}\n\tif(tmp > 1){\n\n\t\tvec.push_back(1);\n\t}\n\n\tll ans = 0;\n\n\tfor(ll state = 0; state < POW[vec.size()]; state++){\n\t\tll mult = 1;\n\t\tll count = 0;\n\t\tfor(ll loop = 0; loop < vec.size(); loop++){\n\t\t\tif(state & POW[loop]){ //最大次数に到達しない\n\n\n\t\t\t\tmult *= vec[loop];\n\t\t\t\tcount++;\n\n\t\t\t}else{\n\n\t\t\t\tmult *= vec[loop]+1;\n\t\t\t}\n\t\t}\n\n\t\t//printf(\"state:%lld mult:%lld\\n\",state,mult);\n\n\t\tll base = fact[mult];\n\t\tbase *= inv_fact[mult-1];\n\t\tbase %= MOD;\n\n\t\tif(count%2 == 1){\n\n\t\t\tans -= base;\n\t\t\tif(ans < 0){\n\n\t\t\t\tans += MOD;\n\t\t\t}\n\t\t}else{\n\n\t\t\tans += base;\n\t\t\tans %= MOD;\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":50160,"score_of_the_acc":-0.3376,"final_rank":5},{"submission_id":"aoj_3155_4993773","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 5000005\n#define MAX 25\n\n\nll fact[SIZE],inv_fact[SIZE];\nll POW[MAX+1];\n\n\nll mod_pow(ll x,ll count, ll mod){\n\n\tif(count == 0)return 1;\n\tll ret = mod_pow((x*x)%mod,count/2,mod);\n\tif(count%2 == 1){\n\n\t\tret = (ret*x)%mod;\n\t}\n\treturn ret;\n}\n\nll extgcd(ll a,ll b,ll &x,ll &y){\n\tll d = a;\n\tif(b != 0){\n\t\td = extgcd(b,a%b,y,x);\n\t\ty -= (a/b)*x;\n\t}else{\n\t\tx = 1;\n\t\ty = 0;\n\t}\n\treturn d;\n}\n\nll mod_inverse(ll a,ll m){\n ll x,y;\n extgcd(a,m,x,y);\n return (m+x%m)%m;\n}\n\nll nCk(ll n,ll k){\n\n\tif(k > n)return 0;\n\n\tll ret = fact[n]*inv_fact[k];\n\tret %= MOD;\n\tret *= inv_fact[n-k];\n\n\treturn ret%MOD;\n}\n\n//https://betrue12.hateblo.jp/entry/2020/11/03/205320\n\nint main(){\n\n\tfact[0] = 1;\n\tfor(ll i = 1; i < SIZE; i++){\n\t\tfact[i] = i*fact[i-1];\n\t\tfact[i] %= MOD;\n\t}\n\tinv_fact[SIZE-1] = mod_inverse(fact[SIZE-1],MOD);\n\tfor(ll i = SIZE-1; i >= 1; i--){\n\n\t\tinv_fact[i-1] = inv_fact[i]*i;\n\t\tinv_fact[i-1] %= MOD;\n\t}\n\tfor(ll i = 1; i < SIZE; i++){\n\n\t\tinv_fact[i] += inv_fact[i-1];\n\t\tinv_fact[i] %= MOD;\n\t}\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i <= MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tvector<ll> V;\n\n\tll N;\n\tscanf(\"%lld\",&N);\n\n\tll tmp = N;\n\n\tfor(ll i = 2; i*i <= N; i++){\n\t\tif(tmp%i != 0)continue;\n\n\t\tll count = 0;\n\n\t\twhile(tmp%i == 0){\n\t\t\tcount++;\n\t\t\ttmp /= i;\n\t\t}\n\t\tV.push_back(count);\n\t}\n\n\tif(tmp > 1)V.push_back(1);\n\n\tll ans = 0;\n\n\tfor(ll state = 0; state < POW[V.size()]; state++){\n\n\t\tll mult = 1;\n\t\tll count = 0;\n\n\t\tfor(ll loop = 0; loop < V.size(); loop++){\n\t\t\tif(state&POW[loop]){\n\n\t\t\t\tmult *= V[loop];\n\t\t\t\tmult %= MOD;\n\t\t\t\tcount++;\n\n\t\t\t}else{\n\n\t\t\t\tmult *= (V[loop]+1);\n\t\t\t\tmult %= MOD;\n\t\t\t}\n\t\t}\n\n\t\ttmp = fact[mult]*inv_fact[(mult-1)];\n\t\ttmp %= MOD;\n\n\t\tif(count%2 == 0){\n\n\t\t\tans += tmp;\n\t\t\tans %= MOD;\n\t\t}else{\n\n\t\t\tans -= tmp;\n\t\t\tif(ans < 0){\n\n\t\t\t\tans += MOD;\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":81412,"score_of_the_acc":-0.5885,"final_rank":7},{"submission_id":"aoj_3155_4965990","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 2000005\n#define MAX 24\n\nll POW[25];\nll fact[SIZE],inv_fact[SIZE];\n\nll mod_pow(ll x,ll count, ll mod){\n\n\tif(count == 0)return 1;\n\tll ret = mod_pow((x*x)%mod,count/2,mod);\n\tif(count%2 == 1){\n\n\t\tret = (ret*x)%mod;\n\t}\n\treturn ret;\n}\n\nll extgcd(ll a,ll b,ll &x,ll &y){\n\tll d = a;\n\tif(b != 0){\n\t\td = extgcd(b,a%b,y,x);\n\t\ty -= (a/b)*x;\n\t}else{\n\t\tx = 1;\n\t\ty = 0;\n\t}\n\treturn d;\n}\n\nll mod_inverse(ll a,ll m){\n ll x,y;\n extgcd(a,m,x,y);\n return (m+x%m)%m;\n}\n\nll nCk(ll n,ll k){\n\n\tif(k > n)return 0;\n\n\tll ret = fact[n]*inv_fact[k];\n\tret %= MOD;\n\tret *= inv_fact[n-k];\n\n\treturn ret%MOD;\n}\n\n//ありがとうございました\n//https://betrue12.hateblo.jp/entry/2020/11/03/205320\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i <= MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tfact[0] = 1;\n\tfor(ll i = 1; i < SIZE; i++){\n\t\tfact[i] = i*fact[i-1];\n\t\tfact[i] %= MOD;\n\t}\n\tinv_fact[SIZE-1] = mod_inverse(fact[SIZE-1],MOD);\n\tfor(ll i = SIZE-1; i >= 1; i--){\n\n\t\tinv_fact[i-1] = inv_fact[i]*i;\n\t\tinv_fact[i-1] %= MOD;\n\t}\n\tfor(ll i = 1; i < SIZE; i++){\n\n\t\tinv_fact[i] += inv_fact[i-1]; //★★累積和にする★★\n\t\tinv_fact[i] %= MOD;\n\t}\n\n\tll N;\n\tscanf(\"%lld\",&N);\n\n\tvector<ll> vec;\n\n\tll tmp = N;\n\tfor(ll i = 2; i*i <= N; i++){\n\t\tif(tmp%i != 0)continue;\n\n\t\tll count = 0;\n\t\twhile(tmp%i == 0){\n\t\t\ttmp /= i;\n\t\t\tcount++;\n\t\t}\n\t\tvec.push_back(count);\n\t}\n\tif(tmp > 1)vec.push_back(1);\n\n\tll num = vec.size();\n\tll ans = 0;\n\n\tfor(ll state = 0; state < POW[num]; state++){\n\t\tll count = 0;\n\t\tll mult = 1;\n\t\tfor(ll loop = 0; loop < num; loop++){\n\t\t\tif(state & POW[loop]){\n\n\t\t\t\tmult *= vec[loop];\n\t\t\t\tcount++;\n\t\t\t}else{\n\n\t\t\t\tmult *= vec[loop]+1;\n\t\t\t}\n\t\t}\n\n\t\tll tmp = fact[mult];\n\t\ttmp *= inv_fact[mult-1];\n\t\ttmp %= MOD;\n\n\t\tif(count%2 == 1){\n\n\t\t\tans -= tmp;\n\t\t\tif(ans < 0){\n\t\t\t\tans += MOD;\n\t\t\t}\n\n\t\t}else{\n\n\t\t\tans += tmp;\n\t\t\tans %= MOD;\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":34524,"score_of_the_acc":-0.2249,"final_rank":3},{"submission_id":"aoj_3155_4883336","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\ntemplate <int mod>\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator-=(const ModInt &p) {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator*=(const ModInt &p) {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n bool operator==(const ModInt &p) const { return x == p.x; }\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\n\nconst int mod = 1e9 + 7;\nusing mint = ModInt<mod>;\n\n// for test\n// 200560490130\n// 963761198400\n\nconst int N = 7000;\nmint fact[N], inv_fact[N];\nmint C(int n, int r) {\n if (n < r) return 0;\n return fact[n] * inv_fact[r] * inv_fact[n - r];\n}\n\nint main() {\n fact[0] = 1;\n for (int i = 1; i < N; ++i) fact[i] = fact[i - 1] * i;\n inv_fact[N - 1] = fact[N - 1].inverse();\n for (int i = N - 2; i >= 0; --i) inv_fact[i] = inv_fact[i + 1] * (i + 1);\n\n ll n;\n cin >> n;\n\n map<ll, int> f;\n vector<ll> d({1, n});\n\n ll t = n;\n for (ll i = 2; i * i <= n; ++i) {\n if (n % i == 0) {\n d.pb(i);\n d.pb(n / i);\n }\n while (t % i == 0) {\n ++f[i];\n t /= i;\n }\n }\n if (t > 1) ++f[t];\n sort(all(d));\n d.erase(unique(all(d)), d.end());\n int D = d.size();\n\n int F = f.size();\n vector<ll> x;\n vector<int> num;\n for (const auto &p : f) {\n x.pb(p.fi);\n num.pb(p.se);\n }\n\n vector<int> cand(1 << F);\n rep(i, D) {\n int cv = 0;\n ll xx = d[i];\n rep(j, F) {\n int ct = 0;\n while (xx % x[j] == 0) {\n ++ct;\n xx /= x[j];\n }\n if (ct == num[j]) cv |= (1 << j);\n }\n ++cand[cv];\n }\n rep(i, F) {\n rep(mask, 1 << F) {\n if (mask & (1 << i)) cand[mask] += cand[mask ^ (1 << i)];\n }\n }\n\n mint ans = 0;\n for (int i = 1; i <= D; ++i) {\n mint pat = 0;\n rep(mask, 1 << F) {\n int mul = 1;\n if ((F - __builtin_popcount(mask)) % 2) mul = -1;\n pat += C(cand[mask], i) * mul;\n }\n ans += pat * fact[i];\n }\n cout << ans << \"\\n\";\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3332,"score_of_the_acc":-0.0513,"final_rank":2},{"submission_id":"aoj_3155_4862682","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define N (1000000000+7)\n//#define N 998244353\n#define INF 1e16\ntypedef long long ll;\ntypedef pair<int,int> P;\ntypedef pair<int,P> Q;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\nconst int inf = (int)1e9; \n \nll gcd(ll a, ll b) {\n\tif (b > a) {\n\t\tll tmp = b;\n\t\tb = a;\n\t\ta = tmp;\n\t}\n\tif (a%b == 0)return b;\n\telse return gcd(b, a%b);\n}\n\nll kaijo[2000010];\nll sum[2000010];\nvoid init() {\n\tkaijo[0] = 1;\n\tfor (ll i = 1;i < 2000010;i++)kaijo[i] = (kaijo[i - 1] * i) % N;\n}\n \nll inv(ll x,ll power) {\n\tll res = 1;\n\tll k = power;\n\tll y = x%N;\n\twhile (k) {\n\t\tif (k & 1)res = (res*y) % N;\n\t\ty = (y%N*y%N) % N;\n\t\tk /= 2;\n\t}\n\treturn res;\n}\n\nvoid init1(){\n\tsum[0] = 1;\n\tfor(ll i=1;i< 2000010;i++){\n\t\tsum[i] = (sum[i-1]+inv(kaijo[i],N-2))%N;\n\t}\n}\n\nll Pow(ll x,ll power,ll r){\n\tll res = 1;\n\tll k = power;\n\tll y = x%r;\n\twhile (k) {\n\t\tif (k & 1)res = (res*y) % r;\n\t\ty = (y%r*y%N) % r;\n\t\tk /= 2;\n\t}\n\treturn res;\n}\n\nll Comb(ll n, ll k) {\n\tif (n < 0 || k < 0 || (n - k) < 0)return 0;\n\tll b = kaijo[n];\n\tll c = kaijo[n - k];\n\tll d = kaijo[k];\n\tll cd = (c*d) % N;\n\treturn ((b%N)*(inv(cd,N-2)) % N) % N;\n}\n \nll itertive_pow(ll x,ll power) {\n\tll res = 1;\n\tll k = power;\n\tll y = x;\n\twhile (k) {\n\t\tif (k & 1)res = (res*y) ;\n\t\ty = y*y;\n\t\tk /= 2;\n\t}\n\treturn res;\n}\n\n\nmap<ll,ll>mp1,mp2;\n\nvoid precalc(ll n){\n\tvector<ll>prime;\n\tll p = n;\n\tfor(ll i=2;i*i<=n;i++){\n\t\tif(p%i==0){\n\t\t\twhile(p%i==0)p/=i;\n\t\t\tprime.push_back(i);\n\t\t}\n\t}\n\tif(p>1)prime.push_back(p);\n\tll m = prime.size();\n\tmp1[1]=1;\n\tmp2[1]=1;\n\tfor(ll i=1;i<(1LL<<m);i++){\n\t\tll cnt = 0;\n\t\tll d = 1;\n\t\tfor(ll j=0;j<m;j++){\n\t\t\tif((i>>j)&1){\n\t\t\t\td*=prime[j];\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tmp1[d] = ((cnt%2==0)?1:-1);\n\t}\n}\n\n\n\nint main(void){\n\tll n;\n\tcin>>n;\n\tll ans = 0;\n\tsum[0] = 0;\n\tinit();\n\tinit1();\n\tprecalc(n);\n\tfor(auto [d,cnt]:mp1){\n\t\tll x = n/d;\n\t\tll c = 0;\n\t\tfor(ll i=1;i*i<=x;i++){\n\t\t\tif(x%i==0){\n\t\t\t\tll t = x/i;\n\t\t\t\tif(i==t)c++;\n\t\t\t\telse c+=2LL;\n\t\t\t}\n\t\t}\n\t\tll tmp = (kaijo[c]*sum[c-1])%N;\n\t\ttmp = (mp1[d]*tmp+N)%N;\n\t\ttmp = (tmp+N)%N;\n\t\tans = (ans+tmp+N)%N;\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":290,"memory_kb":34732,"score_of_the_acc":-0.8928,"final_rank":12},{"submission_id":"aoj_3155_4861779","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)\n\nvector<ll> yakusu(ll n){\n vector<ll> ret;\n for(ll i = 1; i*i <= n; i++){\n if(n % i != 0) continue;\n ret.push_back(i);\n if(i*i != n) ret.push_back(n/i);\n }\n sort(ret.begin(), ret.end());\n reverse(ret.begin(), ret.end());\n return ret;\n}\n\nconst ll mod = 1000000000 + 7;\n#define NMAX 1000010\nll fac[NMAX], inv[NMAX];\n\nll mod_pow(ll a, ll n, ll mod){\n ll ret = 1;\n while(n > 0){\n if(n & 1) ret = (ret*(a % mod))%mod;\n a = ((a%mod)*(a%mod)) % mod;\n n = n >> 1;\n }\n return ret;\n}\n\nll mod_inv(ll a, ll mod){\n return mod_pow(a, mod-2, mod);\n}\n\nvoid mae_nck(){\n fac[1] = 1;\n inv[1] = 1;\n for(ll i = 2; i < NMAX; i++){\n fac[i] = (fac[i-1] * i)%mod;\n inv[i] = (inv[i-1] * mod_inv(i, mod))%mod;\n }\n}\n\nll mod_nck(ll n, ll k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n if(k == 0 || k == n) return 1;\n ll ret = ((fac[n] * inv[k])%mod * inv[n-k])%mod;\n return ret;\n}\n\nll calc(ll n) {\n ll res = 0;\n for(ll i = 1; i <= n; i++) {\n res += (mod_nck(n, i) * fac[i]) % mod;\n res %= mod; \n }\n return res;\n}\n\nint main() {\n mae_nck();\n ll n;\n cin >> n;\n ll invalid = 0;\n auto vn = yakusu(n);\n map<ll, ll> cnt;\n for(auto e : vn) {\n if(cnt[e] == 1 || e == n) continue;\n auto v = yakusu(e);\n if(cnt[e] == 0) {\n invalid += calc(v.size());\n invalid %= mod;\n for(auto p : v) cnt[p]++;\n } else {\n invalid -= ((cnt[e] - 1) * calc(v.size())) % mod;\n invalid %= mod;\n ll gap = cnt[e] - 1;\n for(auto p : v) cnt[p] -= gap; \n }\n }\n ll sum = calc(vn.size());\n ll ans = sum - invalid + mod;\n ans %= mod;\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":19408,"score_of_the_acc":-0.8074,"final_rank":8},{"submission_id":"aoj_3155_4861778","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)\n\nvector<ll> yakusu(ll n){\n vector<ll> ret;\n for(ll i = 1; i*i <= n; i++){\n if(n % i != 0) continue;\n ret.push_back(i);\n if(i*i != n) ret.push_back(n/i);\n }\n sort(ret.begin(), ret.end());\n reverse(ret.begin(), ret.end());\n return ret;\n}\n\nconst ll mod = 1000000000 + 7;\n#define NMAX 1000010\nll fac[NMAX], inv[NMAX];\n\nll mod_pow(ll a, ll n, ll mod){\n ll ret = 1;\n while(n > 0){\n if(n & 1) ret = (ret*(a % mod))%mod;\n a = ((a%mod)*(a%mod)) % mod;\n n = n >> 1;\n }\n return ret;\n}\n\nll mod_inv(ll a, ll mod){\n return mod_pow(a, mod-2, mod);\n}\n\nvoid mae_nck(){\n fac[1] = 1;\n inv[1] = 1;\n for(ll i = 2; i < NMAX; i++){\n fac[i] = (fac[i-1] * i)%mod;\n inv[i] = (inv[i-1] * mod_inv(i, mod))%mod;\n }\n}\n\nll mod_nck(ll n, ll k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n if(k == 0 || k == n) return 1;\n ll ret = ((fac[n] * inv[k])%mod * inv[n-k])%mod;\n return ret;\n}\n\nll calc(ll n) {\n ll res = 0;\n for(ll i = 1; i <= n; i++) {\n res += (mod_nck(n, i) * fac[i]) % mod;\n res %= mod; \n }\n return res;\n}\n\nint main() {\n mae_nck();\n ll n;\n cin >> n;\n ll invalid = 0;\n auto vn = yakusu(n);\n map<ll, ll> cnt;\n for(auto e : vn) {\n if(cnt[e] == 1 || e == n) continue;\n auto v = yakusu(e);\n if(cnt[e] == 0) {\n invalid += calc(v.size());\n invalid %= mod;\n for(auto p : v) cnt[p]++;\n } else {\n invalid -= ((cnt[e] - 1) * calc(v.size())) % mod;\n invalid %= mod;\n ll gap = cnt[e] - 1;\n for(auto p : v) cnt[p]--;\n // for(auto p : v) cnt[p] -= gap; <============================ これも通る\n }\n }\n ll sum = calc(vn.size());\n ll ans = sum - invalid + mod;\n ans %= mod;\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":300,"memory_kb":19356,"score_of_the_acc":-0.8328,"final_rank":10},{"submission_id":"aoj_3155_4861723","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)\n\nvector<ll> yakusu(ll n){\n vector<ll> ret;\n for(ll i = 1; i*i <= n; i++){\n if(n % i != 0) continue;\n ret.push_back(i);\n if(i*i != n) ret.push_back(n/i);\n }\n sort(ret.begin(), ret.end());\n reverse(ret.begin(), ret.end());\n return ret;\n}\n\nconst ll mod = 1000000000 + 7;\n#define NMAX 1000010\nll fac[NMAX], inv[NMAX];\n\nll mod_pow(ll a, ll n, ll mod){\n ll ret = 1;\n while(n > 0){\n if(n & 1) ret = (ret*(a % mod))%mod;\n a = ((a%mod)*(a%mod)) % mod;\n n = n >> 1;\n }\n return ret;\n}\n\nll mod_inv(ll a, ll mod){\n return mod_pow(a, mod-2, mod);\n}\n\nvoid mae_nck(){\n fac[1] = 1;\n inv[1] = 1;\n for(ll i = 2; i < NMAX; i++){\n fac[i] = (fac[i-1] * i)%mod;\n inv[i] = (inv[i-1] * mod_inv(i, mod))%mod;\n }\n}\n\nll mod_nck(ll n, ll k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n if(k == 0 || k == n) return 1;\n ll ret = ((fac[n] * inv[k])%mod * inv[n-k])%mod;\n return ret;\n}\n\nll calc(ll n) {\n ll res = 0;\n for(ll i = 1; i <= n; i++) {\n res += (mod_nck(n, i) * fac[i]) % mod;\n res %= mod; \n }\n return res;\n}\n\nint main() {\n mae_nck();\n ll n;\n cin >> n;\n ll invalid = 0;\n auto vn = yakusu(n);\n map<ll, ll> cnt;\n for(auto e : vn) {\n if(cnt[e] == 1 || e == n) continue;\n auto v = yakusu(e);\n if(cnt[e] == 0) {\n invalid += calc(v.size());\n invalid %= mod;\n for(auto p : v) cnt[p]++;\n } else {\n invalid -= ((cnt[e] - 1) * calc(v.size())) % mod;\n int num = cnt[e] - 1;\n invalid %= mod;\n for(auto p : v) cnt[p] -= num;\n }\n }\n ll sum = calc(vn.size());\n ll ans = sum - invalid + mod;\n ans %= mod;\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":19452,"score_of_the_acc":-0.8077,"final_rank":9},{"submission_id":"aoj_3155_4861562","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)\n\nvector<ll> yakusu(ll n){\n vector<ll> ret;\n for(ll i = 1; i*i <= n; i++){\n if(n % i != 0) continue;\n ret.push_back(i);\n if(i*i != n) ret.push_back(n/i);\n }\n sort(ret.begin(), ret.end());\n reverse(ret.begin(), ret.end());\n return ret;\n}\n\nconst ll mod = 1000000000 + 7;\n#define NMAX 1000010\nll fac[NMAX], inv[NMAX];\n\nll mod_pow(ll a, ll n, ll mod){\n ll ret = 1;\n while(n > 0){\n if(n & 1) ret = (ret*(a % mod))%mod;\n a = ((a%mod)*(a%mod)) % mod;\n n = n >> 1;\n }\n return ret;\n}\n\nll mod_inv(ll a, ll mod){\n return mod_pow(a, mod-2, mod);\n}\n\nvoid mae_nck(){\n fac[1] = 1;\n inv[1] = 1;\n for(ll i = 2; i < NMAX; i++){\n fac[i] = (fac[i-1] * i)%mod;\n inv[i] = (inv[i-1] * mod_inv(i, mod))%mod;\n }\n}\n\nll mod_nck(ll n, ll k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n if(k == 0 || k == n) return 1;\n ll ret = ((fac[n] * inv[k])%mod * inv[n-k])%mod;\n return ret;\n}\n\nll calc(ll n) {\n ll res = 0;\n for(ll i = 1; i <= n; i++) {\n res += (mod_nck(n, i) * fac[i]) % mod;\n res %= mod; \n }\n return res;\n}\n\nint main() {\n mae_nck();\n ll n;\n cin >> n;\n ll invalid = 0;\n auto vn = yakusu(n);\n map<ll, ll> cnt;\n for(auto e : vn) {\n if(cnt[e] == 1 || e == n) continue;\n auto v = yakusu(e);\n if(cnt[e] == 0) {\n invalid += calc(v.size());\n invalid %= mod;\n for(auto p : v) cnt[p]++;\n } else {\n invalid -= ((cnt[e] - 1) * calc(v.size())) % mod;\n invalid %= mod;\n for(auto p : v) cnt[p] -= cnt[e] - 1;\n }\n }\n ll sum = calc(vn.size());\n ll ans = sum - invalid + mod;\n ans %= mod;\n cout << ans << endl;\n return 0;\n}","accuracy":0.06060606060606061,"time_ms":160,"memory_kb":19060,"score_of_the_acc":-0.4722,"final_rank":19},{"submission_id":"aoj_3155_4861560","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)\n\nvector<ll> yakusu(ll n){\n vector<ll> ret;\n for(ll i = 1; i*i <= n; i++){\n if(n % i != 0) continue;\n ret.push_back(i);\n if(i*i != n) ret.push_back(n/i);\n }\n sort(ret.begin(), ret.end());\n reverse(ret.begin(), ret.end());\n return ret;\n}\n\nconst ll mod = 1000000000 + 7;\n#define NMAX 1000010\nll fac[NMAX], inv[NMAX];\n\nll mod_pow(ll a, ll n, ll mod){\n ll ret = 1;\n while(n > 0){\n if(n & 1) ret = (ret*(a % mod))%mod;\n a = ((a%mod)*(a%mod)) % mod;\n n = n >> 1;\n }\n return ret;\n}\n\nll mod_inv(ll a, ll mod){\n return mod_pow(a, mod-2, mod);\n}\n\nvoid mae_nck(){\n fac[1] = 1;\n inv[1] = 1;\n for(ll i = 2; i < NMAX; i++){\n fac[i] = (fac[i-1] * i)%mod;\n inv[i] = (inv[i-1] * mod_inv(i, mod))%mod;\n }\n}\n\nll mod_nck(ll n, ll k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n if(k == 0 || k == n) return 1;\n ll ret = ((fac[n] * inv[k])%mod * inv[n-k])%mod;\n return ret;\n}\n\nll calc(ll n) {\n ll res = 0;\n for(ll i = 1; i <= n; i++) {\n res += (mod_nck(n, i) * fac[i]) % mod;\n res %= mod; \n }\n return res;\n}\n\nint main() {\n mae_nck();\n ll n;\n cin >> n;\n ll invalid = 0;\n auto vn = yakusu(n);\n map<ll, ll> cnt;\n for(auto e : vn) {\n if(cnt[e] == 1 || e == n) continue;\n auto v = yakusu(e);\n if(cnt[e] == 0) {\n invalid += calc(v.size());\n invalid %= mod;\n for(auto p : v) cnt[p]++;\n } else {\n invalid -= ((cnt[e] - 1) * calc(v.size())) % mod;\n invalid %= mod;\n for(auto p : v) cnt[p]--;\n }\n }\n ll sum = calc(vn.size());\n ll ans = sum - invalid + mod;\n ans %= mod;\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":300,"memory_kb":19396,"score_of_the_acc":-0.833,"final_rank":11},{"submission_id":"aoj_3155_4861046","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(1e9 + 7)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nstruct Combination {\n vector<ModInt<>> _fact, _rfact, _inv;\n Combination(long long nsize = 5000000)\n : _fact(nsize + 1), _rfact(nsize + 1), _inv(nsize + 1) {\n _fact[0] = _rfact[nsize] = _inv[0] = 1;\n for (int i = 1; i <= nsize; i++) _fact[i] = _fact[i - 1] * i;\n _rfact[nsize] /= _fact[nsize];\n for (int i = nsize - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\n for (int i = 1; i <= nsize; i++) _inv[i] = _rfact[i] * _fact[i - 1];\n }\n inline ModInt<> fact(int k) const { return _fact[k]; }\n\n inline ModInt<> rfact(int k) const { return _rfact[k]; }\n\n inline ModInt<> inv(int k) const { return _inv[k]; }\n\n ModInt<> P(int n, int r) const {\n if (r < 0 || n < r) return 0;\n return fact(n) * rfact(n - r);\n }\n\n ModInt<> C(int p, int q) const {\n if (q < 0 || p < q) return 0;\n return fact(p) * rfact(q) * rfact(p - q);\n }\n // n types,choose r\n ModInt<> H(int n, int r) const {\n if (n < 0 || r < 0) return (0);\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\n\nmap<long long, long long> div_moebius(long long n, vector<long long> &primes) {\n map<long long, long long> res;\n for (long long i = 2; i * i <= n; ++i)\n if (n % i == 0) {\n primes.push_back(i);\n while (n % i == 0) n /= i;\n }\n if (n > 1) primes.push_back(n);\n n = primes.size();\n for (long long i = 0; i < (1 << n); ++i) {\n long long mu = 1, d = 1;\n for (long long j = 0; j < n; ++j)\n if (i >> j & 1) {\n mu *= -1;\n d *= primes[j];\n }\n res[d] = mu;\n }\n return res;\n}\n\nlong long n;\nCombination com;\nvector<ModInt<>> rsum;\n\nModInt<> solve();\n\nint main() {\n {\n int len = com._rfact.size();\n rsum.assign(len, 1);\n for (int i = 1; i < len; ++i) rsum[i] = rsum[i - 1] + com.rfact(i);\n }\n cin >> n;\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n ModInt<> res = 0;\n vector<long long> primes, divisors;\n map<long long, long long> mb = div_moebius(n, primes), cnt;\n for (long long i = 1; i * i <= n; ++i)\n if (n % i == 0) {\n divisors.push_back(i);\n if (i * i != n) divisors.push_back(n / i);\n }\n sort(divisors.begin(), divisors.end());\n cnt[1] = 1;\n for (auto d : divisors)\n for (auto p : primes)\n if (d % p == 0) {\n long long now = 1, tmp = d;\n while (tmp % p == 0) ++now, tmp /= p;\n cnt[d] = cnt[d / p] * now / (now - 1);\n break;\n }\n for (auto p : mb) {\n long long d = n / p.first, u = p.second, c = 0;\n c = cnt[d];\n res += com.fact(c) * rsum[c - 1] * u;\n }\n return res;\n}","accuracy":1,"time_ms":60,"memory_kb":81692,"score_of_the_acc":-0.5644,"final_rank":6},{"submission_id":"aoj_3155_4844234","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <array>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <cassert>\n#include <iomanip>\n#define vll vector<ll>\n#define vvvl vector<vvl>\n#define vvl vector<vector<ll>>\n#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))\n#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));\n#define re(c, b) for(ll c=0;c<b;c++)\n#define all(obj) (obj).begin(), (obj).end()\ntypedef long long int ll;\ntypedef long double ld;\nusing namespace std;\n\nnamespace fact{\n ll gcd(ll _a, ll _b) {\n unsigned long long a = abs(_a), b = abs(_b);\n if(a == 0) return b;\n if(b == 0) return a;\n int shift = __builtin_ctzll(a | b);\n a >>= __builtin_ctzll(a);\n do {\n b >>= __builtin_ctzll(b);\n if(a > b) std::swap(a, b);\n b -= a;\n }while(b);\n return (a << shift);\n }\n template <class T, class U>\n T modpow(T x, U n, T md) {\n T r = 1 % md;\n x %= md;\n while(n) {\n if(n & 1) r = (r * x) % md;\n x = (x * x) % md;\n n >>= 1;\n }\n return r;\n }\n bool is_prime(ll n) {\n if(n<=1) return false;\n if(n==2) return true;\n if(n%2==0) return false;\n ll d = n - 1;\n while(d % 2 == 0) d /= 2;\n for(ll a : {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37}) {\n if(n <= a) break;\n ll t = d, y = modpow<__int128_t>(a, t, n);\n while(t != n - 1 && y != 1 && y != n - 1) {\n y = __int128_t(y) * y % n, t <<= 1;\n }\n if(y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n }\n ll rho(ll n){\n if(is_prime(n)) return n;\n if(n % 2 == 0) return 2;\n ll c = 0;\n while(true){\n c = (3 * c + 1) % 24;\n auto f = [&](ll x){return(__int128_t(x)*x+c)%n;};\n ll st = 0;\n while(true){\n st++;\n ll x = st%n, y = f(x);\n while(true){\n ll g = gcd(abs(x-y), n);\n if(g==1) x = f(x), y = f(f(y));\n else if(g==n) break;\n else return g;\n }\n }\n }\n }\n vll factorize(ll n) {\n if(n == 1) return {};\n ll x = rho(n);\n if(x == n) return {x};\n vll le = factorize(x);\n vll ri = factorize(n / x);\n le.insert(le.end(), ri.begin(), ri.end());\n return le;\n }\n}\n\n#define P 1000000007\n#define N_MAX 5000000\nll fac[N_MAX+1], inv[N_MAX+1], finv[N_MAX+1];\nll comb(ll n, ll k){\n if(n<0||k<0||n<k) return 0;\n return (((fac[n]*finv[n-k])%P)*finv[k])%P;\n}\nll perm(ll n, ll k){\n if(n<0||k<0||n<k) return 0;\n return (fac[n]*finv[n-k])%P;\n}\nvoid init(){\n fac[0] = finv[0] = fac[1] = finv[1] = inv[1] = 1;\n for(int i = 2; i <= N_MAX; i++){\n fac[i] = (fac[i-1]*i)%P;\n inv[i] = ((-(P/i)*inv[P%i])%P+P)%P;\n finv[i] = (finv[i-1]*inv[i])%P;\n }\n}\nll pp(ll a, ll b){ return (a * b)%P;}\nll mpow(ll a, ll b, ll p = -1){\n ll ret = 1, num = a;\n while(b>0){\n if(b&1) ret = (ret*num)%p;\n num = (num*num)%p;\n b /= 2;\n }\n return ret;\n}\nvll fiacc(N_MAX, 1);\n\nll nn;\nll trans(ll n){\n if(n < 1200000) return n;\n //if(n>=1500000) std::cout << \"err\" << n << '\\n';\n return nn/n + 1500000;\n}\n\nint main(){\n ll n;std::cin >> n;\n nn = n;\n init();\n for(int i=1;i<N_MAX;i++) fiacc[i] = (fiacc[i-1] + finv[i])%P;\n vll d;\n for(ll i=1;i*i<=n;i++){\n if(n%i) continue;\n d.push_back(i);\n if(i*i!=n) d.push_back(n/i);\n }\n ll N = d.size();\n vll ans(3000000, 0);\n ans[1] = 1;\n if(n==1){\n std::cout << 1 << '\\n';\n return 0;\n }\n\n sort(all(d));\n for(int i=1;i<N;i++){\n ll cnt = 0;\n ll num = d[i];\n ll now = trans(num);\n\n for(ll j=1;j*j<=num;j++){\n if(num%j!=0) continue;\n cnt++;\n ans[now] = (ans[now] - ans[trans(j)] + P)%P;\n if(j*j!=num){\n cnt++;\n ll to = trans(num/j);\n if(j!=1) ans[now] = (ans[now] - ans[to] + P)%P;\n }\n }\n ans[now] = (ans[now] + pp(fac[cnt], fiacc[cnt-1]))%P;\n if(i==N-1) std::cout << ans[now] << '\\n';\n }\n}","accuracy":1,"time_ms":400,"memory_kb":182956,"score_of_the_acc":-2,"final_rank":13},{"submission_id":"aoj_3155_4840410","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nint PREP = (cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12), 0);\n//int SEGV = getenv(\"D\") || (exit(system(\"D= SEGFAULT_SIGNALS=all catchsegv ./prog.exe\") >> 8), 0);\nconst Int MOD = 998244353;\nInt POW2[4100000];\nint main() {\n POW2[0] = 1;\n for (int i = 1; i < 4100000; i++) {\n POW2[i] = POW2[i - 1] * 2 % MOD;\n }\n int N, M, K, F; cin >> N >> M >> K >> F;\n vector<int> A(M), B(M), C(M);\n for (int i = 0; i < M; i++) {\n cin >> A[i] >> B[i] >> C[i];\n A[i]--, B[i]--;\n }\n Int ans = 1;\n for (int i = 0; i < K; i++) {\n int k = (N - 1) * (N - 2);\n for (int j = 0; j < M; j++) {\n if (abs(A[j] - B[j]) >= 2) {\n k--;\n } else {\n if (C[j] & (1 << i)) {\n k = -1;\n }\n }\n }\n Int total = POW2[N * N - M];\n Int zero = (k < 0 ? 0 : POW2[k]);\n Int one = (total - zero + MOD) % MOD;\n if (F & (1 << i)) {\n ans *= one;\n } else {\n ans *= zero;\n }\n ans %= MOD;\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":0.030303030303030304,"time_ms":10,"memory_kb":35468,"score_of_the_acc":-0.1789,"final_rank":20},{"submission_id":"aoj_3155_4839810","code_snippet":"#include <bits/stdc++.h>\n \nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n \n \n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SQ(a) ((a)*(a))\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n \n \n//repetition\n//------------------------------------------\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\n#define REP(i,n) FOR(i,0,n)\n#define MOD 1000000007\n \n \n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n \ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n \n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\n\nconst long double EPS = 1e-6, PI = acos((long double)-1);\n\n//ここから編集\n\n \nconst int MAX = 2000010;\nlong long fac[MAX], finv[MAX], inv[MAX];\n \n// テーブルを作る前処理\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n \n// 二項係数計算\nlong long COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\nll GCD(ll a, ll b){\n if(b == 0) return a;\n return GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b)*b;\n}\n\nunordered_map<ll, vector<ll>> mp;\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n \n ll N; cin >> N;\n\n vector<ll> divisor;\n for(ll i=1; i*i<=N; i++){\n if(N%i == 0){\n if(N/i != i){\n divisor.push_back(i);\n divisor.push_back(N/i);\n }else{\n divisor.push_back(i);\n }\n }\n }\n sort(all(divisor));\n \n mp[0].resize(1010);\n mp[0][0] = 1;\n \n for(int i=0; i<divisor.size(); i++){\n\n for(int sz=(int)divisor.size()-1; sz>=0; sz--){\n for(auto e: mp){\n \n ll a = e.first;\n ll t = a;\n if(a == 0) t = 1;\n ll lcm = LCM(t, divisor[i]);\n\n if(mp.find(lcm) == mp.end()){\n mp[lcm].resize(1010);\n mp[lcm][sz+1] += mp[a][sz];\n mp[lcm][sz+1] %= MOD;\n }else{\n mp[lcm][sz+1] += mp[a][sz];\n mp[lcm][sz+1] %= MOD;\n }\n }\n }\n }\n\n COMinit();\n ll ans = 0;\n for(int i=0; i<=divisor.size(); i++){\n \n if(mp[N][i] != 0){\n ans += fac[i] * mp[N][i] % MOD;\n ans %= MOD;\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":0.696969696969697,"time_ms":220,"memory_kb":50480,"score_of_the_acc":-0.8009,"final_rank":17},{"submission_id":"aoj_3155_4839774","code_snippet":"#include <bits/stdc++.h>\n \nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n \n \n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SQ(a) ((a)*(a))\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n \n \n//repetition\n//------------------------------------------\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\n#define REP(i,n) FOR(i,0,n)\n#define MOD 1000000007\n \n \n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n \ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n \n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\n\nconst long double EPS = 1e-6, PI = acos((long double)-1);\n\n//ここから編集\n\n \nconst int MAX = 2000010;\nlong long fac[MAX], finv[MAX], inv[MAX];\n \n// テーブルを作る前処理\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n \n// 二項係数計算\nlong long COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\nll GCD(ll a, ll b){\n return (b==0)?a:GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b)*b;\n}\n\nunordered_map<ll, vector<ll>> mp;\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n \n ll N; cin >> N;\n\n vector<ll> divisor;\n for(ll i=1; i*i<=N; i++){\n if(N%i == 0){\n if(N/i != i){\n divisor.push_back(i);\n divisor.push_back(N/i);\n }else{\n divisor.push_back(i);\n }\n }\n }\n sort(all(divisor));\n \n mp[0].resize(510);\n mp[0][0] = 1;\n \n for(int i=0; i<divisor.size(); i++){\n\n for(int sz=(int)divisor.size()-1; sz>=0; sz--){\n for(auto e: mp){\n \n ll a = e.first;\n ll t = a;\n if(a == 0) t = 1;\n ll lcm = LCM(t, divisor[i]);\n\n if(mp.find(lcm) == mp.end()){\n mp[lcm].resize(510);\n mp[lcm][sz+1] += mp[a][sz];\n mp[lcm][sz+1] %= MOD;\n }else{\n mp[lcm][sz+1] += mp[a][sz];\n mp[lcm][sz+1] %= MOD;\n }\n }\n }\n }\n\n COMinit();\n ll ans = 0;\n for(int i=0; i<510; i++){\n \n if(mp[N].size() != 0 && mp[N][i] != 0){\n ans += fac[i] * mp[N][i] % MOD;\n ans %= MOD;\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":0.696969696969697,"time_ms":170,"memory_kb":50300,"score_of_the_acc":-0.6717,"final_rank":16},{"submission_id":"aoj_3155_4839771","code_snippet":"#include <bits/stdc++.h>\n \nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n \n \n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SQ(a) ((a)*(a))\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n \n \n//repetition\n//------------------------------------------\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\n#define REP(i,n) FOR(i,0,n)\n#define MOD 1000000007\n \n \n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n \ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n \n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\n\nconst long double EPS = 1e-6, PI = acos((long double)-1);\n\n//ここから編集\n\n \nconst int MAX = 2000010;\nlong long fac[MAX], finv[MAX], inv[MAX];\n \n// テーブルを作る前処理\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n \n// 二項係数計算\nlong long COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\nll GCD(ll a, ll b){\n return (b==0)?a:GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b)*b;\n}\n\nunordered_map<ll, vector<ll>> mp;\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n \n ll N; cin >> N;\n\n vector<ll> divisor;\n for(ll i=1; i*i<=N; i++){\n if(N%i == 0){\n if(N/i != i){\n divisor.push_back(i);\n divisor.push_back(N/i);\n }else{\n divisor.push_back(i);\n }\n }\n }\n sort(all(divisor));\n \n mp[0].resize(310);\n mp[0][0] = 1;\n \n for(int i=0; i<divisor.size(); i++){\n\n for(int sz=(int)divisor.size()-1; sz>=0; sz--){\n for(auto e: mp){\n \n ll a = e.first;\n ll t = a;\n if(a == 0) t = 1;\n ll lcm = LCM(t, divisor[i]);\n\n if(mp.find(lcm) == mp.end()){\n mp[lcm].resize(310);\n mp[lcm][sz+1] += mp[a][sz];\n mp[lcm][sz+1] %= MOD;\n }else{\n mp[lcm][sz+1] += mp[a][sz];\n mp[lcm][sz+1] %= MOD;\n }\n }\n }\n }\n\n COMinit();\n ll ans = 0;\n for(int i=0; i<310; i++){\n \n if(mp[N].size() != 0 && mp[N][i] != 0){\n ans += fac[i] * mp[N][i] % MOD;\n ans %= MOD;\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":0.696969696969697,"time_ms":130,"memory_kb":50364,"score_of_the_acc":-0.5695,"final_rank":15}],"string":"[\n {\n \"submission_id\": \"aoj_3155_10092029\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <cstdint>\\n#include <iostream>\\n#include <type_traits>\\n#include <utility>\\nnamespace internal {\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr std::int64_t safe_mod(std::int64_t x, std::int64_t m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n std::uint64_t im;\\n // @param m `1 <= m`\\n explicit barrett(unsigned int m) : _m(m), im((std::uint64_t)(-1) / m + 1) {}\\n // @return m\\n unsigned int umod() const { return _m; }\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n std::uint64_t z = a;\\n z *= b;\\n std::uint64_t x = (std::uint64_t)(((__uint128_t)(z)*im) >> 64);\\n std::uint64_t y = x * _m;\\n return (unsigned int)(z - y + (z < y ? _m : 0));\\n }\\n};\\nstruct montgomery {\\n std::uint64_t _m;\\n std::uint64_t im;\\n std::uint64_t r2;\\n // @param m `1 <= m`\\n explicit constexpr montgomery(std::uint64_t m) : _m(m), im(m), r2(-__uint128_t(m) % m) {\\n for (int i = 0; i < 5; ++i) im = im * (2 - _m * im);\\n im = -im;\\n }\\n // @return m\\n constexpr std::uint64_t umod() const { return _m; }\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n constexpr std::uint64_t mul(std::uint64_t a, std::uint64_t b) const { return mr(mr(a, b), r2); }\\n constexpr std::uint64_t exp(std::uint64_t a, std::uint64_t b) const {\\n std::uint64_t res = 1, p = mr(a, r2);\\n while (b) {\\n if (b & 1) res = mr(res, p);\\n p = mr(p, p);\\n b >>= 1;\\n }\\n return res;\\n }\\n constexpr bool same_pow(std::uint64_t x, int s, std::uint64_t n) const {\\n x = mr(x, r2), n = mr(n, r2);\\n for (int r = 0; r < s; r++) {\\n if (x == n) return true;\\n x = mr(x, x);\\n }\\n return false;\\n }\\n private:\\n constexpr std::uint64_t mr(std::uint64_t x) const {\\n return ((__uint128_t)(x * im) * _m + x) >> 64;\\n }\\n constexpr std::uint64_t mr(std::uint64_t a, std::uint64_t b) const {\\n __uint128_t t = (__uint128_t)a * b;\\n std::uint64_t inc = std::uint64_t(t) != 0;\\n std::uint64_t x = t >> 64, y = ((__uint128_t)(a * b * im) * _m) >> 64;\\n unsigned long long z = 0;\\n bool f = __builtin_uaddll_overflow(x, y, &z);\\n z += inc;\\n return f ? z - _m : z;\\n }\\n};\\nconstexpr bool is_SPRP32(std::uint32_t n, std::uint32_t a) {\\n std::uint32_t d = n - 1, s = 0;\\n while ((d & 1) == 0) ++s, d >>= 1;\\n std::uint64_t cur = 1, pw = d;\\n while (pw) {\\n if (pw & 1) cur = (cur * a) % n;\\n a = (std::uint64_t)a * a % n;\\n pw >>= 1;\\n }\\n if (cur == 1) return true;\\n for (std::uint32_t r = 0; r < s; r++) {\\n if (cur == n - 1) return true;\\n cur = cur * cur % n;\\n }\\n return false;\\n}\\n// given 2 <= n,a < 2^64, a prime, check whether n is a-SPRP\\nconstexpr bool is_SPRP64(const montgomery &m, std::uint64_t a) {\\n auto n = m.umod();\\n if (n == a) return true;\\n if (n % a == 0) return false;\\n std::uint64_t d = n - 1;\\n int s = 0;\\n while ((d & 1) == 0) ++s, d >>= 1;\\n std::uint64_t cur = m.exp(a, d);\\n if (cur == 1) return true;\\n return m.same_pow(cur, s, n - 1);\\n}\\nconstexpr bool is_prime_constexpr(std::uint64_t x) {\\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\\n if (x < 121) return (x > 1);\\n montgomery m(x);\\n constexpr std::uint64_t bases[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\\n for (auto a : bases) {\\n if (!is_SPRP64(m, a)) return false;\\n }\\n return true;\\n}\\nconstexpr bool is_prime_constexpr(std::int64_t x) {\\n if (x < 0) return false;\\n return is_prime_constexpr(std::uint64_t(x));\\n}\\nconstexpr bool is_prime_constexpr(std::uint32_t x) {\\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\\n if (x < 121) return (x > 1);\\n std::uint64_t h = x;\\n h = ((h >> 16) ^ h) * 0x45d9f3b;\\n h = ((h >> 16) ^ h) * 0x45d9f3b;\\n h = ((h >> 16) ^ h) & 255;\\n constexpr uint16_t bases[] = {\\n 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620, 560,\\n 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028,\\n 2213, 6219, 620, 3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113,\\n 7061, 803, 1269, 3875, 422, 751, 580, 4729, 10239, 746, 2951, 556, 2206,\\n 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,\\n 15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903,\\n 737, 1887, 7447, 1888, 2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41,\\n 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352, 6435, 165, 1169, 3315,\\n 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,\\n 27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524,\\n 3577, 236, 2360, 6146, 2850, 55637, 1753, 4178, 8466, 222, 2579, 2743, 2031,\\n 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159, 1725, 3597, 3366, 14336,\\n 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,\\n 434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183,\\n 8126, 1870, 3296, 7455, 8947, 25017, 541, 19115, 368, 566, 5674, 411, 522,\\n 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007, 35201, 4706, 1152, 1785,\\n 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,\\n 4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816,\\n 5197, 13330, 7054, 2818, 3199, 811, 922, 350, 7514, 4452, 3449, 2663, 4708,\\n 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194};\\n return is_SPRP32(x, bases[h]);\\n}\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr std::int64_t pow_mod_constexpr(std::int64_t x, std::int64_t n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n std::uint64_t r = 1;\\n std::uint64_t y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n std::int64_t d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr std::int64_t bases[3] = {2, 7, 61};\\n for (std::int64_t a : bases) {\\n std::int64_t t = d;\\n std::int64_t y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) { return false; }\\n }\\n return true;\\n}\\ntemplate <int n>\\nconstexpr bool is_prime = is_prime_constexpr(n);\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<std::int64_t, std::int64_t> inv_gcd(std::int64_t a, std::int64_t b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n std::int64_t s = b, t = a;\\n std::int64_t m0 = 0, m1 = 1;\\n while (t) {\\n std::int64_t u = s / t;\\n s -= t * u;\\n m0 -= m1 * u;\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (std::int64_t)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) { x /= i; }\\n }\\n }\\n if (x > 1) { divs[cnt++] = x; }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m>\\nconstexpr int primitive_root = primitive_root_constexpr(m);\\n} // namespace internal\\n#include <cassert>\\n#include <numeric>\\nnamespace internal {\\ntemplate <class T>\\nusing is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;\\ntemplate <class T>\\nusing is_integral =\\n typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value, make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\ntemplate <class T>\\nusing to_unsigned_t = typename to_unsigned<T>::type;\\n} // namespace internal\\nnamespace internal {\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\ntemplate <class T>\\nusing is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T>\\nusing is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n} // namespace internal\\ntemplate <int m, std::enable_if_t<(1 <= m)> * = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n public:\\n static constexpr int mod() { return m; }\\n static constexpr mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n constexpr static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T> * = nullptr>\\n constexpr static_modint(T v) : _v(0) {\\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\\n constexpr static_modint(T v) : _v(0) {\\n _v = (unsigned int)(v % umod());\\n }\\n constexpr unsigned int val() const { return _v; }\\n constexpr mint &operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n constexpr mint &operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n constexpr mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n constexpr mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n constexpr mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n constexpr mint &operator-=(const mint &rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n constexpr mint &operator*=(const mint &rhs) {\\n std::uint64_t z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n constexpr mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n constexpr mint operator+() const { return *this; }\\n constexpr mint operator-() const { return mint() - *this; }\\n constexpr mint pow(std::int64_t n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n constexpr mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n friend constexpr mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\\n friend constexpr mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\\n friend constexpr mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\\n friend constexpr mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\\n friend constexpr bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\\n friend constexpr bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\\n std::int64_t t;\\n is >> t;\\n rhs = mint(t);\\n return is;\\n }\\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\\n return os << rhs._v;\\n }\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\ntemplate <int id>\\nstruct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n unsigned int val() const { return _v; }\\n mint &operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint &operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint &operator-=(const mint &rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint &operator*=(const mint &rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n mint pow(std::int64_t n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\\n friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\\n friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\\n friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\\n friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\\n friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\\n std::int64_t t;\\n is >> t;\\n rhs = mint(t);\\n return is;\\n }\\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\\n return os << rhs._v;\\n }\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id>\\ninternal::barrett dynamic_modint<id>::bt(998244353);\\nusing modint998 = static_modint<998244353>;\\nusing modint107 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\nnamespace internal {\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\ntemplate <class>\\nstruct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n} // namespace internal\\n#include <algorithm>\\n#include <bitset>\\n#include <iterator>\\n#include <vector>\\n/**\\n * @brief 素数ライブラリ\\n *\\n * @tparam N\\n */\\ntemplate <int N = 1 << 22>\\nstruct prime_number {\\n prime_number() : is_not_prime(), data() { init(); }\\n /**\\n * @brief 素数判定\\n *\\n * @param n\\n * @return bool\\n */\\n bool is_prime(std::int64_t n) const {\\n assert(n >= 0);\\n if (n < N) return !is_not_prime[n];\\n for (auto i : data) {\\n if ((std::int64_t)i * i > n) break;\\n if (n % i == 0) return false;\\n }\\n return true;\\n }\\n std::vector<int> prime_numbers(int x) const {\\n std::vector<int> res;\\n for (auto i : data) {\\n if (i > x) break;\\n res.emplace_back(i);\\n }\\n return res;\\n }\\n /**\\n * @brief 素因数分解\\n *\\n * @tparam T\\n * @param x\\n * @return std::vector<std::pair<T, int>>\\n */\\n template <class T>\\n std::vector<std::pair<T, int>> prime_factorization(T x) const {\\n if (x == 1) return std::vector<std::pair<T, int>>();\\n std::vector<std::pair<T, int>> res;\\n for (auto p : data) {\\n int cnt = 0;\\n for (; x % p == 0; x /= p) ++cnt;\\n if (cnt) res.emplace_back(p, cnt);\\n if ((std::int64_t)p * p > x) break;\\n }\\n if (x != 1) res.emplace_back(x, 1);\\n return res;\\n }\\n /**\\n * @brief 約数列挙\\n *\\n * @tparam T\\n * @param x\\n * @return std::vector<T>\\n */\\n template <class T>\\n std::vector<T> divisors(T x) const {\\n if (x == 1) return std::vector<T>(1, 1);\\n auto v = prime_factorization(x);\\n std::vector<T> res;\\n res.emplace_back(1);\\n for (auto p : v) {\\n int n = res.size();\\n res.resize(n * (p.second + 1));\\n for (int i = 0; i < n * p.second; ++i) res[n + i] = res[i] * p.first;\\n for (int i = 1; i <= p.second; ++i) {\\n std::inplace_merge(res.begin(), res.begin() + n * i, res.begin() + n * (i + 1));\\n }\\n }\\n return res;\\n }\\n /**\\n * @brief 因数分解列挙\\n *\\n * @tparam T\\n * @param x\\n * @return std::vector<std::vector<T>>\\n */\\n template <class T>\\n std::vector<std::vector<T>> factorization(T x) const {\\n std::vector<std::vector<T>> res;\\n auto f = [&](auto self, std::vector<T> v, T a) -> void {\\n if (a == 1) res.emplace_back(v);\\n for (auto i : this->divisors(a)) {\\n if (i == 1 || (!v.empty() && v.back() > i)) continue;\\n v.emplace_back(i);\\n self(self, v, a / i);\\n v.pop_back();\\n }\\n };\\n f(f, std::vector<T>(), x);\\n return res;\\n }\\n private:\\n std::bitset<N> is_not_prime;\\n std::vector<int> data;\\n void init() {\\n is_not_prime[0] = is_not_prime[1] = true;\\n for (int i = 2; i < N; ++i) {\\n if (!is_not_prime[i]) {\\n data.emplace_back(i);\\n if ((std::int64_t)i * i >= N) continue;\\n if (i == 2) {\\n for (int j = i * i; j < N; j += i) is_not_prime[j] = true;\\n } else {\\n for (int j = i * i; j < N; j += i << 1) is_not_prime[j] = true;\\n }\\n }\\n }\\n }\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nusing Mint = modint107;\\nprime_number pn;\\nint main(void) {\\n ll n;\\n cin >> n;\\n if (n == 1) {\\n co(1);\\n return 0;\\n }\\n auto v = pn.prime_factorization(n);\\n int m = v.size();\\n Mint ans = 0;\\n rep (bit, 1 << m) {\\n ll sum = 1;\\n int c = 0;\\n rep (i, m) {\\n if (~bit >> i & 1) {\\n sum *= v[i].second + 1;\\n } else {\\n ++c;\\n sum *= v[i].second;\\n }\\n }\\n Mint p = 1;\\n Mint x = 0;\\n repnr (i, sum) {\\n p *= i;\\n x += p;\\n }\\n if (c & 1) {\\n ans -= x;\\n } else {\\n ans += x;\\n }\\n }\\n co(ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6492,\n \"score_of_the_acc\": -0.0176,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3155_10092027\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <cstdint>\\n#include <iostream>\\n#include <type_traits>\\n#include <utility>\\nnamespace internal {\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr std::int64_t safe_mod(std::int64_t x, std::int64_t m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n std::uint64_t im;\\n // @param m `1 <= m`\\n explicit barrett(unsigned int m) : _m(m), im((std::uint64_t)(-1) / m + 1) {}\\n // @return m\\n unsigned int umod() const { return _m; }\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n std::uint64_t z = a;\\n z *= b;\\n std::uint64_t x = (std::uint64_t)(((__uint128_t)(z)*im) >> 64);\\n std::uint64_t y = x * _m;\\n return (unsigned int)(z - y + (z < y ? _m : 0));\\n }\\n};\\nstruct montgomery {\\n std::uint64_t _m;\\n std::uint64_t im;\\n std::uint64_t r2;\\n // @param m `1 <= m`\\n explicit constexpr montgomery(std::uint64_t m) : _m(m), im(m), r2(-__uint128_t(m) % m) {\\n for (int i = 0; i < 5; ++i) im = im * (2 - _m * im);\\n im = -im;\\n }\\n // @return m\\n constexpr std::uint64_t umod() const { return _m; }\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n constexpr std::uint64_t mul(std::uint64_t a, std::uint64_t b) const { return mr(mr(a, b), r2); }\\n constexpr std::uint64_t exp(std::uint64_t a, std::uint64_t b) const {\\n std::uint64_t res = 1, p = mr(a, r2);\\n while (b) {\\n if (b & 1) res = mr(res, p);\\n p = mr(p, p);\\n b >>= 1;\\n }\\n return res;\\n }\\n constexpr bool same_pow(std::uint64_t x, int s, std::uint64_t n) const {\\n x = mr(x, r2), n = mr(n, r2);\\n for (int r = 0; r < s; r++) {\\n if (x == n) return true;\\n x = mr(x, x);\\n }\\n return false;\\n }\\n private:\\n constexpr std::uint64_t mr(std::uint64_t x) const {\\n return ((__uint128_t)(x * im) * _m + x) >> 64;\\n }\\n constexpr std::uint64_t mr(std::uint64_t a, std::uint64_t b) const {\\n __uint128_t t = (__uint128_t)a * b;\\n std::uint64_t inc = std::uint64_t(t) != 0;\\n std::uint64_t x = t >> 64, y = ((__uint128_t)(a * b * im) * _m) >> 64;\\n unsigned long long z = 0;\\n bool f = __builtin_uaddll_overflow(x, y, &z);\\n z += inc;\\n return f ? z - _m : z;\\n }\\n};\\nconstexpr bool is_SPRP32(std::uint32_t n, std::uint32_t a) {\\n std::uint32_t d = n - 1, s = 0;\\n while ((d & 1) == 0) ++s, d >>= 1;\\n std::uint64_t cur = 1, pw = d;\\n while (pw) {\\n if (pw & 1) cur = (cur * a) % n;\\n a = (std::uint64_t)a * a % n;\\n pw >>= 1;\\n }\\n if (cur == 1) return true;\\n for (std::uint32_t r = 0; r < s; r++) {\\n if (cur == n - 1) return true;\\n cur = cur * cur % n;\\n }\\n return false;\\n}\\n// given 2 <= n,a < 2^64, a prime, check whether n is a-SPRP\\nconstexpr bool is_SPRP64(const montgomery &m, std::uint64_t a) {\\n auto n = m.umod();\\n if (n == a) return true;\\n if (n % a == 0) return false;\\n std::uint64_t d = n - 1;\\n int s = 0;\\n while ((d & 1) == 0) ++s, d >>= 1;\\n std::uint64_t cur = m.exp(a, d);\\n if (cur == 1) return true;\\n return m.same_pow(cur, s, n - 1);\\n}\\nconstexpr bool is_prime_constexpr(std::uint64_t x) {\\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\\n if (x < 121) return (x > 1);\\n montgomery m(x);\\n constexpr std::uint64_t bases[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\\n for (auto a : bases) {\\n if (!is_SPRP64(m, a)) return false;\\n }\\n return true;\\n}\\nconstexpr bool is_prime_constexpr(std::int64_t x) {\\n if (x < 0) return false;\\n return is_prime_constexpr(std::uint64_t(x));\\n}\\nconstexpr bool is_prime_constexpr(std::uint32_t x) {\\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\\n if (x < 121) return (x > 1);\\n std::uint64_t h = x;\\n h = ((h >> 16) ^ h) * 0x45d9f3b;\\n h = ((h >> 16) ^ h) * 0x45d9f3b;\\n h = ((h >> 16) ^ h) & 255;\\n constexpr uint16_t bases[] = {\\n 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620, 560,\\n 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028,\\n 2213, 6219, 620, 3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113,\\n 7061, 803, 1269, 3875, 422, 751, 580, 4729, 10239, 746, 2951, 556, 2206,\\n 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,\\n 15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903,\\n 737, 1887, 7447, 1888, 2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41,\\n 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352, 6435, 165, 1169, 3315,\\n 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,\\n 27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524,\\n 3577, 236, 2360, 6146, 2850, 55637, 1753, 4178, 8466, 222, 2579, 2743, 2031,\\n 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159, 1725, 3597, 3366, 14336,\\n 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,\\n 434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183,\\n 8126, 1870, 3296, 7455, 8947, 25017, 541, 19115, 368, 566, 5674, 411, 522,\\n 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007, 35201, 4706, 1152, 1785,\\n 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,\\n 4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816,\\n 5197, 13330, 7054, 2818, 3199, 811, 922, 350, 7514, 4452, 3449, 2663, 4708,\\n 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194};\\n return is_SPRP32(x, bases[h]);\\n}\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr std::int64_t pow_mod_constexpr(std::int64_t x, std::int64_t n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n std::uint64_t r = 1;\\n std::uint64_t y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n std::int64_t d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr std::int64_t bases[3] = {2, 7, 61};\\n for (std::int64_t a : bases) {\\n std::int64_t t = d;\\n std::int64_t y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) { return false; }\\n }\\n return true;\\n}\\ntemplate <int n>\\nconstexpr bool is_prime = is_prime_constexpr(n);\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<std::int64_t, std::int64_t> inv_gcd(std::int64_t a, std::int64_t b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n std::int64_t s = b, t = a;\\n std::int64_t m0 = 0, m1 = 1;\\n while (t) {\\n std::int64_t u = s / t;\\n s -= t * u;\\n m0 -= m1 * u;\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (std::int64_t)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) { x /= i; }\\n }\\n }\\n if (x > 1) { divs[cnt++] = x; }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m>\\nconstexpr int primitive_root = primitive_root_constexpr(m);\\n} // namespace internal\\n#include <cassert>\\n#include <numeric>\\nnamespace internal {\\ntemplate <class T>\\nusing is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;\\ntemplate <class T>\\nusing is_integral =\\n typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value, make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\ntemplate <class T>\\nusing to_unsigned_t = typename to_unsigned<T>::type;\\n} // namespace internal\\nnamespace internal {\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\ntemplate <class T>\\nusing is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T>\\nusing is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n} // namespace internal\\ntemplate <int m, std::enable_if_t<(1 <= m)> * = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n public:\\n static constexpr int mod() { return m; }\\n static constexpr mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n constexpr static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T> * = nullptr>\\n constexpr static_modint(T v) : _v(0) {\\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\\n constexpr static_modint(T v) : _v(0) {\\n _v = (unsigned int)(v % umod());\\n }\\n constexpr unsigned int val() const { return _v; }\\n constexpr mint &operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n constexpr mint &operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n constexpr mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n constexpr mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n constexpr mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n constexpr mint &operator-=(const mint &rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n constexpr mint &operator*=(const mint &rhs) {\\n std::uint64_t z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n constexpr mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n constexpr mint operator+() const { return *this; }\\n constexpr mint operator-() const { return mint() - *this; }\\n constexpr mint pow(std::int64_t n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n constexpr mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n friend constexpr mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\\n friend constexpr mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\\n friend constexpr mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\\n friend constexpr mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\\n friend constexpr bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\\n friend constexpr bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\\n std::int64_t t;\\n is >> t;\\n rhs = mint(t);\\n return is;\\n }\\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\\n return os << rhs._v;\\n }\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\ntemplate <int id>\\nstruct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n unsigned int val() const { return _v; }\\n mint &operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint &operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint &operator-=(const mint &rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint &operator*=(const mint &rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n mint pow(std::int64_t n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\\n friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\\n friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\\n friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\\n friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\\n friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\\n std::int64_t t;\\n is >> t;\\n rhs = mint(t);\\n return is;\\n }\\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\\n return os << rhs._v;\\n }\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id>\\ninternal::barrett dynamic_modint<id>::bt(998244353);\\nusing modint998 = static_modint<998244353>;\\nusing modint107 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\nnamespace internal {\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\ntemplate <class>\\nstruct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n} // namespace internal\\n#include <algorithm>\\n#include <bitset>\\n#include <iterator>\\n#include <vector>\\n/**\\n * @brief 素数ライブラリ\\n *\\n * @tparam N\\n */\\ntemplate <int N = 1 << 22>\\nstruct prime_number {\\n prime_number() : is_not_prime(), data() { init(); }\\n /**\\n * @brief 素数判定\\n *\\n * @param n\\n * @return bool\\n */\\n bool is_prime(std::int64_t n) const {\\n assert(n >= 0);\\n if (n < N) return !is_not_prime[n];\\n for (auto i : data) {\\n if ((std::int64_t)i * i > n) break;\\n if (n % i == 0) return false;\\n }\\n return true;\\n }\\n std::vector<int> prime_numbers(int x) const {\\n std::vector<int> res;\\n for (auto i : data) {\\n if (i > x) break;\\n res.emplace_back(i);\\n }\\n return res;\\n }\\n /**\\n * @brief 素因数分解\\n *\\n * @tparam T\\n * @param x\\n * @return std::vector<std::pair<T, int>>\\n */\\n template <class T>\\n std::vector<std::pair<T, int>> prime_factorization(T x) const {\\n if (x == 1) return std::vector<std::pair<T, int>>();\\n std::vector<std::pair<T, int>> res;\\n for (auto p : data) {\\n int cnt = 0;\\n for (; x % p == 0; x /= p) ++cnt;\\n if (cnt) res.emplace_back(p, cnt);\\n if ((std::int64_t)p * p > x) break;\\n }\\n if (x != 1) res.emplace_back(x, 1);\\n return res;\\n }\\n /**\\n * @brief 約数列挙\\n *\\n * @tparam T\\n * @param x\\n * @return std::vector<T>\\n */\\n template <class T>\\n std::vector<T> divisors(T x) const {\\n if (x == 1) return std::vector<T>(1, 1);\\n auto v = prime_factorization(x);\\n std::vector<T> res;\\n res.emplace_back(1);\\n for (auto p : v) {\\n int n = res.size();\\n res.resize(n * (p.second + 1));\\n for (int i = 0; i < n * p.second; ++i) res[n + i] = res[i] * p.first;\\n for (int i = 1; i <= p.second; ++i) {\\n std::inplace_merge(res.begin(), res.begin() + n * i, res.begin() + n * (i + 1));\\n }\\n }\\n return res;\\n }\\n /**\\n * @brief 因数分解列挙\\n *\\n * @tparam T\\n * @param x\\n * @return std::vector<std::vector<T>>\\n */\\n template <class T>\\n std::vector<std::vector<T>> factorization(T x) const {\\n std::vector<std::vector<T>> res;\\n auto f = [&](auto self, std::vector<T> v, T a) -> void {\\n if (a == 1) res.emplace_back(v);\\n for (auto i : this->divisors(a)) {\\n if (i == 1 || (!v.empty() && v.back() > i)) continue;\\n v.emplace_back(i);\\n self(self, v, a / i);\\n v.pop_back();\\n }\\n };\\n f(f, std::vector<T>(), x);\\n return res;\\n }\\n private:\\n std::bitset<N> is_not_prime;\\n std::vector<int> data;\\n void init() {\\n is_not_prime[0] = is_not_prime[1] = true;\\n for (int i = 2; i < N; ++i) {\\n if (!is_not_prime[i]) {\\n data.emplace_back(i);\\n if ((std::int64_t)i * i >= N) continue;\\n if (i == 2) {\\n for (int j = i * i; j < N; j += i) is_not_prime[j] = true;\\n } else {\\n for (int j = i * i; j < N; j += i << 1) is_not_prime[j] = true;\\n }\\n }\\n }\\n }\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nusing Mint = modint107;\\nprime_number pn;\\nint main(void) {\\n ll n;\\n cin >> n;\\n if (n == 1) {\\n co(1);\\n return 0;\\n }\\n auto v = pn.prime_factorization(n);\\n int m = v.size();\\n Mint ans = 0;\\n rep (bit, 1 << m) {\\n ll sum = 1;\\n int c = 0;\\n rep (i, m) {\\n if (~bit >> i & 1) {\\n ++c;\\n sum *= v[i].second + 1;\\n } else {\\n sum *= v[i].second;\\n }\\n }\\n Mint p = 1;\\n Mint x = 0;\\n repnr (i, sum) {\\n p *= i;\\n x += p;\\n }\\n if (c & 1) {\\n ans -= x;\\n } else {\\n ans += x;\\n }\\n }\\n co(ans);\\n return 0;\\n}\",\n \"accuracy\": 0.12121212121212122,\n \"time_ms\": 10,\n \"memory_kb\": 5524,\n \"score_of_the_acc\": -0.0122,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3155_5973339\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n#pragma GCC target (\\\"avx2\\\")\\n#pragma GCC optimization (\\\"O3\\\")\\n#pragma GCC optimization (\\\"unroll-loops\\\")\\nusing namespace std;\\n \\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<int, int> pii;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\n \\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef unsigned long long ull;\\n \\n \\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define trav(a, x) for (auto &a : x)\\n#define all(x) x.begin(), x.end()\\n \\n#define MOD 1000000007\\n \\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\\nconst double EPS = 1e-8, PI = acos(-1);\\nconst double pi = 3.141592653589793238462643383279;\\n//ここから編集 \\ntypedef string::const_iterator State;\\nll GCD(ll a, ll b){\\n return (b==0)?a:GCD(b, a%b);\\n}\\nll LCM(ll a, ll b){\\n return a/GCD(a, b) * b;\\n}\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n \\n ModInt() : x(0) {}\\n \\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n \\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n \\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n \\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n \\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n \\n ModInt operator-() const { return ModInt(-x); }\\n \\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n \\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n \\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n \\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n \\n bool operator==(const ModInt &p) const { return x == p.x; }\\n \\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n \\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n \\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n \\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n \\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n \\n static int get_mod() { return mod; }\\n};\\n \\nusing modint = ModInt< 1000000007 >;\\ntemplate< typename T >\\nstruct Combination {\\n vector< T > _fact, _rfact, _inv;\\n \\n Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {\\n _fact[0] = _rfact[sz] = _inv[0] = 1;\\n for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;\\n _rfact[sz] /= _fact[sz];\\n for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\\n for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];\\n }\\n \\n inline T fact(int k) const { return _fact[k]; }\\n \\n inline T rfact(int k) const { return _rfact[k]; }\\n \\n inline T inv(int k) const { return _inv[k]; }\\n \\n T P(int n, int r) const {\\n if(r < 0 || n < r) return 0;\\n return fact(n) * rfact(n - r);\\n }\\n \\n T C(int p, int q) const {\\n if(q < 0 || p < q) return 0;\\n return fact(p) * rfact(q) * rfact(p - q);\\n }\\n \\n T H(int n, int r) const {\\n if(n < 0 || r < 0) return (0);\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\n \\nll modpow(ll x, ll n, ll mod) {\\n ll res = 1;\\n x %= mod;\\n if(x == 0) return 0;\\n while(n) {\\n if(n&1) res = (res * x) % mod;\\n x = (x * x) % mod;\\n n >>= 1;\\n }\\n return res;\\n} \\ninline long long mod(long long a, long long m) {\\n return (a % m + m) % m;\\n}\\ntemplate<typename T> \\nstruct BIT{\\n int N;\\n std::vector<T> node;\\n BIT(){}\\n BIT(int n){\\n N = n;\\n node.resize(N+10);\\n }\\n void build(int n) {\\n N = n;\\n node.resize(N+10);\\n }\\n /* a: 1-indexed */\\n void add(int a, T x){\\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\\n }\\n\\n /* [1, a] */\\n T sum(int a){\\n T res = 0;\\n for(int x=a; x>0; x -= x & -x) res += node[x];\\n return res;\\n }\\n\\n /* [l, r] */\\n T rangesum(int l, int r){\\n return sum(r) - sum(l-1);\\n }\\n\\n /* \\n a1+a2+...+aw >= valとなるような最小のwを返す\\n @verify https://codeforces.com/contest/992/problem/E\\n */\\n int lower_bound(T val) {\\n if(val < 0) return 0;\\n\\n int res = 0;\\n int n = 1; \\n while (n < N) n *= 2;\\n\\n T tv=0;\\n for (int k = n; k > 0; k /= 2) {\\n if(res + k < N && node[res + k] < val){\\n val -= node[res+k];\\n res += k;\\n }\\n }\\n return res+1; \\n }\\n};\\nstruct UnionFind{\\n std::vector<int> par;\\n std::vector<int> siz;\\n\\n UnionFind(int sz_): par(sz_), siz(sz_) {\\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\\n }\\n\\n void init(int sz_){\\n par.resize(sz_);\\n siz.resize(sz_);\\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\\n }\\n\\n int root(int x){\\n if(x == par[x]) return x;\\n return par[x] = root(par[x]);\\n }\\n\\n bool merge(int x, int y){\\n x = root(x), y = root(y);\\n if(x == y) return false;\\n if(siz[x] < siz[y]) std::swap(x, y);\\n siz[x] += siz[y];\\n par[y] = x;\\n return true;\\n }\\n\\n bool issame(int x, int y){\\n return root(x) == root(y);\\n }\\n\\n int size(int x){\\n return siz[root(x)];\\n }\\n};\\nstruct RollingHash{\\n\\n using ull = unsigned long long;\\n const ull mod = (1ULL << 61) - 1;\\n const ull MASK30 = (1ULL << 30) - 1;\\n const ull MASK31 = (1ULL << 31) - 1;\\n\\n const ull MASK61 = mod;\\n\\n ull base;\\n int n;\\n vector<ull> hash, pow;\\n\\n RollingHash(const string &s)\\n {\\n random_device rnd;\\n mt19937_64 mt(rnd());\\n base = 1001;\\n \\n n = (int)s.size();\\n hash.assign(n+1, 0);\\n pow.assign(n+1, 1);\\n \\n for(int i=0; i<n; i++){\\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\\n pow[i+1] = calc_mod(mul(pow[i], base));\\n }\\n }\\n\\n ull calc_mod(ull x){\\n ull xu = x >> 61;\\n ull xd = x & MASK61;\\n ull res = xu + xd;\\n if(res >= mod) res -= mod;\\n return res;\\n }\\n\\n ull mul(ull a, ull b){\\n ull au = a >> 31;\\n ull ad = a & MASK31;\\n ull bu = b >> 31;\\n ull bd = b & MASK31;\\n ull mid = ad * bu + au * bd;\\n ull midu = mid >> 30;\\n ull midd = mid & MASK30;\\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\\n }\\n\\n //[l,r)のハッシュ値\\n inline ull get(int l, int r){\\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\\n return res;\\n }\\n //string tのハッシュ値\\n inline ull get(string t){\\n ull res = 0;\\n for(int i=0; i<t.size(); i++){\\n res = calc_mod(mul(res, base)+t[i]);\\n }\\n return res;\\n }\\n //string s中のtの数をカウント\\n inline int count(string t) {\\n if(t.size() > n) return 0;\\n auto hs = get(t);\\n int res = 0;\\n for(int i=0; i<n-t.size()+1; i++){\\n if(get(i, i+t.size()) == hs) res++; \\n }\\n return res;\\n }\\n\\n /* \\n concat \\n @verify https://codeforces.com/problemset/problem/514/C\\n */\\n inline ull concat(ull h1, ull h2, int h2len){\\n return calc_mod(h2 + mul(h1, pow[h2len]));\\n }\\n\\n // LCPを求める S[a:] T[b:]\\n inline int LCP(int a, int b){\\n int len = min((int)hash.size()-a, (int)hash.size()-b);\\n \\n int lb = -1, ub = len;\\n while(ub-lb>1){\\n int mid = (lb+ub)/2;\\n\\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\\n else ub = mid;\\n }\\n return lb;\\n }\\n};\\nint maximum_independent_set(vector<vector<int>> &g) {\\n int n = g.size();\\n int n1 = n/2, n2 = n-n1;\\n vector<int> dp2((1<<n2));\\n REP(i,n2) dp2[(1<<i)] = 1;\\n REP(bit, (1<<n2)) {\\n REP(i,n2) {\\n if(bit >> i & 1) continue;\\n bool ok = true;\\n REP(j,n2) {\\n if(bit >> j & 1) ok &= g[n1+i][n1+j];\\n }\\n int c = 0;\\n if(ok) c++;\\n dp2[bit | (1 << i)] = max(dp2[bit | (1 << i)], dp2[bit] + c);\\n }\\n }\\n int ans = 0;\\n REP(bit,(1<<n1)) {\\n vector<int> cand;\\n REP(i,n1) {\\n if(bit >> i & 1) cand.push_back(i);\\n }\\n bool ok = true;\\n REP(i,cand.size()) {\\n FOR(j, i+1 ,cand.size()) {\\n ok &= g[cand[i]][cand[j]];\\n }\\n }\\n if(!ok) continue;\\n ll bit2 = 0;\\n REP(i,n2) {\\n ok = true;\\n REP(j,cand.size()){\\n ok &= g[i+n1][cand[j]];\\n }\\n if(ok) bit2 |= (1<<i);\\n }\\n ans = max(ans, __builtin_popcount(bit) + dp2[bit2]);\\n }\\n return ans;\\n}\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n \\n ll N; cin >> N;\\n vector<ll> d;\\n ll t = N;\\n for(ll i=1; i*i<=t; i++) {\\n if(t%i == 0) {\\n d.push_back(i);\\n if(t/i != i) d.push_back(t/i);\\n }\\n }\\n sort(all(d));\\n map<ll, int> mp;\\n for(ll i=2; i*i<=t; i++) {\\n if(t%i == 0) {\\n while(t%i == 0) {\\n mp[i]++;\\n t/=i;\\n }\\n }\\n }\\n if(t != 1) mp[t]++;\\n vector<ll> v;\\n for(auto e: mp) {\\n ll tmp = 1;\\n REP(i,e.second) tmp *= e.first;\\n v.push_back(tmp);\\n } \\n Combination<modint> comb(10010);\\n int n = mp.size();\\n modint ans = 0;\\n REP(bit, (1<<n)) {\\n ll tmp = 1;\\n int cnt = 0;\\n REP(i,d.size()) {\\n bool f = true;\\n REP(j,n) {\\n if(bit >> j & 1) {\\n if(d[i]%v[j] == 0) f = false;\\n }\\n }\\n if(f) cnt++;\\n }\\n \\n modint res = 0;\\n for(int i=1; i<=cnt; i++) res += comb.P(cnt, i);\\n if(__builtin_popcount(bit)%2 == 1) res *= -1;\\n ans += res;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.2578,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3155_5973337\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n#pragma GCC target (\\\"avx2\\\")\\n#pragma GCC optimization (\\\"O3\\\")\\n#pragma GCC optimization (\\\"unroll-loops\\\")\\nusing namespace std;\\n \\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<int, int> pii;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\n \\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef unsigned long long ull;\\n \\n \\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define trav(a, x) for (auto &a : x)\\n#define all(x) x.begin(), x.end()\\n \\n#define MOD 1000000007\\n \\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\\nconst double EPS = 1e-8, PI = acos(-1);\\nconst double pi = 3.141592653589793238462643383279;\\n//ここから編集 \\ntypedef string::const_iterator State;\\nll GCD(ll a, ll b){\\n return (b==0)?a:GCD(b, a%b);\\n}\\nll LCM(ll a, ll b){\\n return a/GCD(a, b) * b;\\n}\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n \\n ModInt() : x(0) {}\\n \\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n \\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n \\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n \\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n \\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n \\n ModInt operator-() const { return ModInt(-x); }\\n \\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n \\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n \\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n \\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n \\n bool operator==(const ModInt &p) const { return x == p.x; }\\n \\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n \\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n \\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n \\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n \\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n \\n static int get_mod() { return mod; }\\n};\\n \\nusing modint = ModInt< 1000000007 >;\\ntemplate< typename T >\\nstruct Combination {\\n vector< T > _fact, _rfact, _inv;\\n \\n Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {\\n _fact[0] = _rfact[sz] = _inv[0] = 1;\\n for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;\\n _rfact[sz] /= _fact[sz];\\n for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\\n for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];\\n }\\n \\n inline T fact(int k) const { return _fact[k]; }\\n \\n inline T rfact(int k) const { return _rfact[k]; }\\n \\n inline T inv(int k) const { return _inv[k]; }\\n \\n T P(int n, int r) const {\\n if(r < 0 || n < r) return 0;\\n return fact(n) * rfact(n - r);\\n }\\n \\n T C(int p, int q) const {\\n if(q < 0 || p < q) return 0;\\n return fact(p) * rfact(q) * rfact(p - q);\\n }\\n \\n T H(int n, int r) const {\\n if(n < 0 || r < 0) return (0);\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\n \\nll modpow(ll x, ll n, ll mod) {\\n ll res = 1;\\n x %= mod;\\n if(x == 0) return 0;\\n while(n) {\\n if(n&1) res = (res * x) % mod;\\n x = (x * x) % mod;\\n n >>= 1;\\n }\\n return res;\\n} \\ninline long long mod(long long a, long long m) {\\n return (a % m + m) % m;\\n}\\ntemplate<typename T> \\nstruct BIT{\\n int N;\\n std::vector<T> node;\\n BIT(){}\\n BIT(int n){\\n N = n;\\n node.resize(N+10);\\n }\\n void build(int n) {\\n N = n;\\n node.resize(N+10);\\n }\\n /* a: 1-indexed */\\n void add(int a, T x){\\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\\n }\\n\\n /* [1, a] */\\n T sum(int a){\\n T res = 0;\\n for(int x=a; x>0; x -= x & -x) res += node[x];\\n return res;\\n }\\n\\n /* [l, r] */\\n T rangesum(int l, int r){\\n return sum(r) - sum(l-1);\\n }\\n\\n /* \\n a1+a2+...+aw >= valとなるような最小のwを返す\\n @verify https://codeforces.com/contest/992/problem/E\\n */\\n int lower_bound(T val) {\\n if(val < 0) return 0;\\n\\n int res = 0;\\n int n = 1; \\n while (n < N) n *= 2;\\n\\n T tv=0;\\n for (int k = n; k > 0; k /= 2) {\\n if(res + k < N && node[res + k] < val){\\n val -= node[res+k];\\n res += k;\\n }\\n }\\n return res+1; \\n }\\n};\\nstruct UnionFind{\\n std::vector<int> par;\\n std::vector<int> siz;\\n\\n UnionFind(int sz_): par(sz_), siz(sz_) {\\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\\n }\\n\\n void init(int sz_){\\n par.resize(sz_);\\n siz.resize(sz_);\\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\\n }\\n\\n int root(int x){\\n if(x == par[x]) return x;\\n return par[x] = root(par[x]);\\n }\\n\\n bool merge(int x, int y){\\n x = root(x), y = root(y);\\n if(x == y) return false;\\n if(siz[x] < siz[y]) std::swap(x, y);\\n siz[x] += siz[y];\\n par[y] = x;\\n return true;\\n }\\n\\n bool issame(int x, int y){\\n return root(x) == root(y);\\n }\\n\\n int size(int x){\\n return siz[root(x)];\\n }\\n};\\nstruct RollingHash{\\n\\n using ull = unsigned long long;\\n const ull mod = (1ULL << 61) - 1;\\n const ull MASK30 = (1ULL << 30) - 1;\\n const ull MASK31 = (1ULL << 31) - 1;\\n\\n const ull MASK61 = mod;\\n\\n ull base;\\n int n;\\n vector<ull> hash, pow;\\n\\n RollingHash(const string &s)\\n {\\n random_device rnd;\\n mt19937_64 mt(rnd());\\n base = 1001;\\n \\n n = (int)s.size();\\n hash.assign(n+1, 0);\\n pow.assign(n+1, 1);\\n \\n for(int i=0; i<n; i++){\\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\\n pow[i+1] = calc_mod(mul(pow[i], base));\\n }\\n }\\n\\n ull calc_mod(ull x){\\n ull xu = x >> 61;\\n ull xd = x & MASK61;\\n ull res = xu + xd;\\n if(res >= mod) res -= mod;\\n return res;\\n }\\n\\n ull mul(ull a, ull b){\\n ull au = a >> 31;\\n ull ad = a & MASK31;\\n ull bu = b >> 31;\\n ull bd = b & MASK31;\\n ull mid = ad * bu + au * bd;\\n ull midu = mid >> 30;\\n ull midd = mid & MASK30;\\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\\n }\\n\\n //[l,r)のハッシュ値\\n inline ull get(int l, int r){\\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\\n return res;\\n }\\n //string tのハッシュ値\\n inline ull get(string t){\\n ull res = 0;\\n for(int i=0; i<t.size(); i++){\\n res = calc_mod(mul(res, base)+t[i]);\\n }\\n return res;\\n }\\n //string s中のtの数をカウント\\n inline int count(string t) {\\n if(t.size() > n) return 0;\\n auto hs = get(t);\\n int res = 0;\\n for(int i=0; i<n-t.size()+1; i++){\\n if(get(i, i+t.size()) == hs) res++; \\n }\\n return res;\\n }\\n\\n /* \\n concat \\n @verify https://codeforces.com/problemset/problem/514/C\\n */\\n inline ull concat(ull h1, ull h2, int h2len){\\n return calc_mod(h2 + mul(h1, pow[h2len]));\\n }\\n\\n // LCPを求める S[a:] T[b:]\\n inline int LCP(int a, int b){\\n int len = min((int)hash.size()-a, (int)hash.size()-b);\\n \\n int lb = -1, ub = len;\\n while(ub-lb>1){\\n int mid = (lb+ub)/2;\\n\\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\\n else ub = mid;\\n }\\n return lb;\\n }\\n};\\nint maximum_independent_set(vector<vector<int>> &g) {\\n int n = g.size();\\n int n1 = n/2, n2 = n-n1;\\n vector<int> dp2((1<<n2));\\n REP(i,n2) dp2[(1<<i)] = 1;\\n REP(bit, (1<<n2)) {\\n REP(i,n2) {\\n if(bit >> i & 1) continue;\\n bool ok = true;\\n REP(j,n2) {\\n if(bit >> j & 1) ok &= g[n1+i][n1+j];\\n }\\n int c = 0;\\n if(ok) c++;\\n dp2[bit | (1 << i)] = max(dp2[bit | (1 << i)], dp2[bit] + c);\\n }\\n }\\n int ans = 0;\\n REP(bit,(1<<n1)) {\\n vector<int> cand;\\n REP(i,n1) {\\n if(bit >> i & 1) cand.push_back(i);\\n }\\n bool ok = true;\\n REP(i,cand.size()) {\\n FOR(j, i+1 ,cand.size()) {\\n ok &= g[cand[i]][cand[j]];\\n }\\n }\\n if(!ok) continue;\\n ll bit2 = 0;\\n REP(i,n2) {\\n ok = true;\\n REP(j,cand.size()){\\n ok &= g[i+n1][cand[j]];\\n }\\n if(ok) bit2 |= (1<<i);\\n }\\n ans = max(ans, __builtin_popcount(bit) + dp2[bit2]);\\n }\\n return ans;\\n}\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n \\n ll N; cin >> N;\\n vector<ll> d;\\n ll t = N;\\n for(ll i=1; i*i<=t; i++) {\\n if(t%i == 0) {\\n d.push_back(i);\\n if(t/i != i) d.push_back(t/i);\\n }\\n }\\n sort(all(d));\\n map<ll, int> mp;\\n for(ll i=2; i*i<=t; i++) {\\n if(t%i == 0) {\\n while(t%i == 0) {\\n mp[i]++;\\n t/=i;\\n }\\n }\\n }\\n if(t != 1) mp[t]++;\\n vector<ll> v;\\n for(auto e: mp) {\\n ll tmp = 1;\\n REP(i,e.second) tmp *= e.first;\\n v.push_back(tmp);\\n } \\n Combination<modint> comb(2010);\\n int n = mp.size();\\n modint ans = 0;\\n REP(bit, (1<<n)) {\\n ll tmp = 1;\\n int cnt = 0;\\n REP(i,d.size()) {\\n bool f = true;\\n REP(j,n) {\\n if(bit >> j & 1) {\\n if(d[i]%v[j] == 0) f = false;\\n }\\n }\\n if(f) cnt++;\\n }\\n \\n modint res = 0;\\n for(int i=1; i<=cnt; i++) res += comb.P(cnt, i);\\n if(__builtin_popcount(bit)%2 == 1) res *= -1;\\n ans += res;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.696969696969697,\n \"time_ms\": 110,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -0.2573,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3155_5147767\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 3000005\\n#define MAX 25\\n\\n\\nll POW[MAX];\\nll fact[SIZE],inv_fact[SIZE];\\n\\nll mod_pow(ll x,ll count, ll mod){\\n\\n\\tif(count == 0)return 1;\\n\\tll ret = mod_pow((x*x)%mod,count/2,mod);\\n\\tif(count%2 == 1){\\n\\n\\t\\tret = (ret*x)%mod;\\n\\t}\\n\\treturn ret;\\n}\\n\\nll extgcd(ll a,ll b,ll &x,ll &y){\\n\\tll d = a;\\n\\tif(b != 0){\\n\\t\\td = extgcd(b,a%b,y,x);\\n\\t\\ty -= (a/b)*x;\\n\\t}else{\\n\\t\\tx = 1;\\n\\t\\ty = 0;\\n\\t}\\n\\treturn d;\\n}\\n\\nll mod_inverse(ll a,ll m){\\n ll x,y;\\n extgcd(a,m,x,y);\\n return (m+x%m)%m;\\n}\\n\\nll nCk(ll n,ll k){\\n\\n\\tif(k > n)return 0;\\n\\n\\tll ret = fact[n]*inv_fact[k];\\n\\tret %= MOD;\\n\\tret *= inv_fact[n-k];\\n\\n\\treturn ret%MOD;\\n}\\n\\nll nPk(ll n,ll k){\\n\\n\\tif(k > n)return 0;\\n\\n\\tll ret = fact[n]*inv_fact[n-k];\\n\\n\\treturn ret%MOD;\\n}\\n\\n\\n\\nint main(){\\n\\n\\tfact[0] = 1;\\n\\tfor(ll i = 1; i < SIZE; i++){\\n\\t\\tfact[i] = i*fact[i-1];\\n\\t\\tfact[i] %= MOD;\\n\\t}\\n\\tinv_fact[SIZE-1] = mod_inverse(fact[SIZE-1],MOD);\\n\\tfor(ll i = SIZE-1; i >= 1; i--){\\n\\n\\t\\tinv_fact[i-1] = inv_fact[i]*i;\\n\\t\\tinv_fact[i-1] %= MOD;\\n\\t}\\n\\tfor(ll i = 1; i < SIZE; i++){\\n\\n\\t\\tinv_fact[i] += inv_fact[i-1];\\n\\t\\tinv_fact[i] %= MOD;\\n\\t}\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i < MAX; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tll N;\\n\\tscanf(\\\"%lld\\\",&N);\\n\\n\\tll tmp = N;\\n\\tvector<ll> vec;\\n\\n\\tfor(ll i = 2; i*i <= N; i++){\\n\\t\\tif(tmp%i != 0)continue;\\n\\n\\t\\tll count = 0;\\n\\n\\t\\twhile(tmp%i == 0){\\n\\n\\t\\t\\ttmp /= i;\\n\\t\\t\\tcount++;\\n\\t\\t}\\n\\t\\tvec.push_back(count);\\n\\t}\\n\\tif(tmp > 1){\\n\\n\\t\\tvec.push_back(1);\\n\\t}\\n\\n\\tll ans = 0;\\n\\n\\tfor(ll state = 0; state < POW[vec.size()]; state++){\\n\\t\\tll mult = 1;\\n\\t\\tll count = 0;\\n\\t\\tfor(ll loop = 0; loop < vec.size(); loop++){\\n\\t\\t\\tif(state & POW[loop]){ //最大次数に到達しない\\n\\n\\n\\t\\t\\t\\tmult *= vec[loop];\\n\\t\\t\\t\\tcount++;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tmult *= vec[loop]+1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//printf(\\\"state:%lld mult:%lld\\\\n\\\",state,mult);\\n\\n\\t\\tll base = fact[mult];\\n\\t\\tbase *= inv_fact[mult-1];\\n\\t\\tbase %= MOD;\\n\\n\\t\\tif(count%2 == 1){\\n\\n\\t\\t\\tans -= base;\\n\\t\\t\\tif(ans < 0){\\n\\n\\t\\t\\t\\tans += MOD;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\n\\t\\t\\tans += base;\\n\\t\\t\\tans %= MOD;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 50160,\n \"score_of_the_acc\": -0.3376,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3155_4993773\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 5000005\\n#define MAX 25\\n\\n\\nll fact[SIZE],inv_fact[SIZE];\\nll POW[MAX+1];\\n\\n\\nll mod_pow(ll x,ll count, ll mod){\\n\\n\\tif(count == 0)return 1;\\n\\tll ret = mod_pow((x*x)%mod,count/2,mod);\\n\\tif(count%2 == 1){\\n\\n\\t\\tret = (ret*x)%mod;\\n\\t}\\n\\treturn ret;\\n}\\n\\nll extgcd(ll a,ll b,ll &x,ll &y){\\n\\tll d = a;\\n\\tif(b != 0){\\n\\t\\td = extgcd(b,a%b,y,x);\\n\\t\\ty -= (a/b)*x;\\n\\t}else{\\n\\t\\tx = 1;\\n\\t\\ty = 0;\\n\\t}\\n\\treturn d;\\n}\\n\\nll mod_inverse(ll a,ll m){\\n ll x,y;\\n extgcd(a,m,x,y);\\n return (m+x%m)%m;\\n}\\n\\nll nCk(ll n,ll k){\\n\\n\\tif(k > n)return 0;\\n\\n\\tll ret = fact[n]*inv_fact[k];\\n\\tret %= MOD;\\n\\tret *= inv_fact[n-k];\\n\\n\\treturn ret%MOD;\\n}\\n\\n//https://betrue12.hateblo.jp/entry/2020/11/03/205320\\n\\nint main(){\\n\\n\\tfact[0] = 1;\\n\\tfor(ll i = 1; i < SIZE; i++){\\n\\t\\tfact[i] = i*fact[i-1];\\n\\t\\tfact[i] %= MOD;\\n\\t}\\n\\tinv_fact[SIZE-1] = mod_inverse(fact[SIZE-1],MOD);\\n\\tfor(ll i = SIZE-1; i >= 1; i--){\\n\\n\\t\\tinv_fact[i-1] = inv_fact[i]*i;\\n\\t\\tinv_fact[i-1] %= MOD;\\n\\t}\\n\\tfor(ll i = 1; i < SIZE; i++){\\n\\n\\t\\tinv_fact[i] += inv_fact[i-1];\\n\\t\\tinv_fact[i] %= MOD;\\n\\t}\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i <= MAX; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tvector<ll> V;\\n\\n\\tll N;\\n\\tscanf(\\\"%lld\\\",&N);\\n\\n\\tll tmp = N;\\n\\n\\tfor(ll i = 2; i*i <= N; i++){\\n\\t\\tif(tmp%i != 0)continue;\\n\\n\\t\\tll count = 0;\\n\\n\\t\\twhile(tmp%i == 0){\\n\\t\\t\\tcount++;\\n\\t\\t\\ttmp /= i;\\n\\t\\t}\\n\\t\\tV.push_back(count);\\n\\t}\\n\\n\\tif(tmp > 1)V.push_back(1);\\n\\n\\tll ans = 0;\\n\\n\\tfor(ll state = 0; state < POW[V.size()]; state++){\\n\\n\\t\\tll mult = 1;\\n\\t\\tll count = 0;\\n\\n\\t\\tfor(ll loop = 0; loop < V.size(); loop++){\\n\\t\\t\\tif(state&POW[loop]){\\n\\n\\t\\t\\t\\tmult *= V[loop];\\n\\t\\t\\t\\tmult %= MOD;\\n\\t\\t\\t\\tcount++;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tmult *= (V[loop]+1);\\n\\t\\t\\t\\tmult %= MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\ttmp = fact[mult]*inv_fact[(mult-1)];\\n\\t\\ttmp %= MOD;\\n\\n\\t\\tif(count%2 == 0){\\n\\n\\t\\t\\tans += tmp;\\n\\t\\t\\tans %= MOD;\\n\\t\\t}else{\\n\\n\\t\\t\\tans -= tmp;\\n\\t\\t\\tif(ans < 0){\\n\\n\\t\\t\\t\\tans += MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 81412,\n \"score_of_the_acc\": -0.5885,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3155_4965990\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 2000005\\n#define MAX 24\\n\\nll POW[25];\\nll fact[SIZE],inv_fact[SIZE];\\n\\nll mod_pow(ll x,ll count, ll mod){\\n\\n\\tif(count == 0)return 1;\\n\\tll ret = mod_pow((x*x)%mod,count/2,mod);\\n\\tif(count%2 == 1){\\n\\n\\t\\tret = (ret*x)%mod;\\n\\t}\\n\\treturn ret;\\n}\\n\\nll extgcd(ll a,ll b,ll &x,ll &y){\\n\\tll d = a;\\n\\tif(b != 0){\\n\\t\\td = extgcd(b,a%b,y,x);\\n\\t\\ty -= (a/b)*x;\\n\\t}else{\\n\\t\\tx = 1;\\n\\t\\ty = 0;\\n\\t}\\n\\treturn d;\\n}\\n\\nll mod_inverse(ll a,ll m){\\n ll x,y;\\n extgcd(a,m,x,y);\\n return (m+x%m)%m;\\n}\\n\\nll nCk(ll n,ll k){\\n\\n\\tif(k > n)return 0;\\n\\n\\tll ret = fact[n]*inv_fact[k];\\n\\tret %= MOD;\\n\\tret *= inv_fact[n-k];\\n\\n\\treturn ret%MOD;\\n}\\n\\n//ありがとうございました\\n//https://betrue12.hateblo.jp/entry/2020/11/03/205320\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i <= MAX; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tfact[0] = 1;\\n\\tfor(ll i = 1; i < SIZE; i++){\\n\\t\\tfact[i] = i*fact[i-1];\\n\\t\\tfact[i] %= MOD;\\n\\t}\\n\\tinv_fact[SIZE-1] = mod_inverse(fact[SIZE-1],MOD);\\n\\tfor(ll i = SIZE-1; i >= 1; i--){\\n\\n\\t\\tinv_fact[i-1] = inv_fact[i]*i;\\n\\t\\tinv_fact[i-1] %= MOD;\\n\\t}\\n\\tfor(ll i = 1; i < SIZE; i++){\\n\\n\\t\\tinv_fact[i] += inv_fact[i-1]; //★★累積和にする★★\\n\\t\\tinv_fact[i] %= MOD;\\n\\t}\\n\\n\\tll N;\\n\\tscanf(\\\"%lld\\\",&N);\\n\\n\\tvector<ll> vec;\\n\\n\\tll tmp = N;\\n\\tfor(ll i = 2; i*i <= N; i++){\\n\\t\\tif(tmp%i != 0)continue;\\n\\n\\t\\tll count = 0;\\n\\t\\twhile(tmp%i == 0){\\n\\t\\t\\ttmp /= i;\\n\\t\\t\\tcount++;\\n\\t\\t}\\n\\t\\tvec.push_back(count);\\n\\t}\\n\\tif(tmp > 1)vec.push_back(1);\\n\\n\\tll num = vec.size();\\n\\tll ans = 0;\\n\\n\\tfor(ll state = 0; state < POW[num]; state++){\\n\\t\\tll count = 0;\\n\\t\\tll mult = 1;\\n\\t\\tfor(ll loop = 0; loop < num; loop++){\\n\\t\\t\\tif(state & POW[loop]){\\n\\n\\t\\t\\t\\tmult *= vec[loop];\\n\\t\\t\\t\\tcount++;\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tmult *= vec[loop]+1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tll tmp = fact[mult];\\n\\t\\ttmp *= inv_fact[mult-1];\\n\\t\\ttmp %= MOD;\\n\\n\\t\\tif(count%2 == 1){\\n\\n\\t\\t\\tans -= tmp;\\n\\t\\t\\tif(ans < 0){\\n\\t\\t\\t\\tans += MOD;\\n\\t\\t\\t}\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tans += tmp;\\n\\t\\t\\tans %= MOD;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 34524,\n \"score_of_the_acc\": -0.2249,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3155_4883336\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\ntemplate <int mod>\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator-=(const ModInt &p) {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator*=(const ModInt &p) {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\n\\nconst int mod = 1e9 + 7;\\nusing mint = ModInt<mod>;\\n\\n// for test\\n// 200560490130\\n// 963761198400\\n\\nconst int N = 7000;\\nmint fact[N], inv_fact[N];\\nmint C(int n, int r) {\\n if (n < r) return 0;\\n return fact[n] * inv_fact[r] * inv_fact[n - r];\\n}\\n\\nint main() {\\n fact[0] = 1;\\n for (int i = 1; i < N; ++i) fact[i] = fact[i - 1] * i;\\n inv_fact[N - 1] = fact[N - 1].inverse();\\n for (int i = N - 2; i >= 0; --i) inv_fact[i] = inv_fact[i + 1] * (i + 1);\\n\\n ll n;\\n cin >> n;\\n\\n map<ll, int> f;\\n vector<ll> d({1, n});\\n\\n ll t = n;\\n for (ll i = 2; i * i <= n; ++i) {\\n if (n % i == 0) {\\n d.pb(i);\\n d.pb(n / i);\\n }\\n while (t % i == 0) {\\n ++f[i];\\n t /= i;\\n }\\n }\\n if (t > 1) ++f[t];\\n sort(all(d));\\n d.erase(unique(all(d)), d.end());\\n int D = d.size();\\n\\n int F = f.size();\\n vector<ll> x;\\n vector<int> num;\\n for (const auto &p : f) {\\n x.pb(p.fi);\\n num.pb(p.se);\\n }\\n\\n vector<int> cand(1 << F);\\n rep(i, D) {\\n int cv = 0;\\n ll xx = d[i];\\n rep(j, F) {\\n int ct = 0;\\n while (xx % x[j] == 0) {\\n ++ct;\\n xx /= x[j];\\n }\\n if (ct == num[j]) cv |= (1 << j);\\n }\\n ++cand[cv];\\n }\\n rep(i, F) {\\n rep(mask, 1 << F) {\\n if (mask & (1 << i)) cand[mask] += cand[mask ^ (1 << i)];\\n }\\n }\\n\\n mint ans = 0;\\n for (int i = 1; i <= D; ++i) {\\n mint pat = 0;\\n rep(mask, 1 << F) {\\n int mul = 1;\\n if ((F - __builtin_popcount(mask)) % 2) mul = -1;\\n pat += C(cand[mask], i) * mul;\\n }\\n ans += pat * fact[i];\\n }\\n cout << ans << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3332,\n \"score_of_the_acc\": -0.0513,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3155_4862682\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define N (1000000000+7)\\n//#define N 998244353\\n#define INF 1e16\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\ntypedef pair<int,P> Q;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\nconst int inf = (int)1e9; \\n \\nll gcd(ll a, ll b) {\\n\\tif (b > a) {\\n\\t\\tll tmp = b;\\n\\t\\tb = a;\\n\\t\\ta = tmp;\\n\\t}\\n\\tif (a%b == 0)return b;\\n\\telse return gcd(b, a%b);\\n}\\n\\nll kaijo[2000010];\\nll sum[2000010];\\nvoid init() {\\n\\tkaijo[0] = 1;\\n\\tfor (ll i = 1;i < 2000010;i++)kaijo[i] = (kaijo[i - 1] * i) % N;\\n}\\n \\nll inv(ll x,ll power) {\\n\\tll res = 1;\\n\\tll k = power;\\n\\tll y = x%N;\\n\\twhile (k) {\\n\\t\\tif (k & 1)res = (res*y) % N;\\n\\t\\ty = (y%N*y%N) % N;\\n\\t\\tk /= 2;\\n\\t}\\n\\treturn res;\\n}\\n\\nvoid init1(){\\n\\tsum[0] = 1;\\n\\tfor(ll i=1;i< 2000010;i++){\\n\\t\\tsum[i] = (sum[i-1]+inv(kaijo[i],N-2))%N;\\n\\t}\\n}\\n\\nll Pow(ll x,ll power,ll r){\\n\\tll res = 1;\\n\\tll k = power;\\n\\tll y = x%r;\\n\\twhile (k) {\\n\\t\\tif (k & 1)res = (res*y) % r;\\n\\t\\ty = (y%r*y%N) % r;\\n\\t\\tk /= 2;\\n\\t}\\n\\treturn res;\\n}\\n\\nll Comb(ll n, ll k) {\\n\\tif (n < 0 || k < 0 || (n - k) < 0)return 0;\\n\\tll b = kaijo[n];\\n\\tll c = kaijo[n - k];\\n\\tll d = kaijo[k];\\n\\tll cd = (c*d) % N;\\n\\treturn ((b%N)*(inv(cd,N-2)) % N) % N;\\n}\\n \\nll itertive_pow(ll x,ll power) {\\n\\tll res = 1;\\n\\tll k = power;\\n\\tll y = x;\\n\\twhile (k) {\\n\\t\\tif (k & 1)res = (res*y) ;\\n\\t\\ty = y*y;\\n\\t\\tk /= 2;\\n\\t}\\n\\treturn res;\\n}\\n\\n\\nmap<ll,ll>mp1,mp2;\\n\\nvoid precalc(ll n){\\n\\tvector<ll>prime;\\n\\tll p = n;\\n\\tfor(ll i=2;i*i<=n;i++){\\n\\t\\tif(p%i==0){\\n\\t\\t\\twhile(p%i==0)p/=i;\\n\\t\\t\\tprime.push_back(i);\\n\\t\\t}\\n\\t}\\n\\tif(p>1)prime.push_back(p);\\n\\tll m = prime.size();\\n\\tmp1[1]=1;\\n\\tmp2[1]=1;\\n\\tfor(ll i=1;i<(1LL<<m);i++){\\n\\t\\tll cnt = 0;\\n\\t\\tll d = 1;\\n\\t\\tfor(ll j=0;j<m;j++){\\n\\t\\t\\tif((i>>j)&1){\\n\\t\\t\\t\\td*=prime[j];\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmp1[d] = ((cnt%2==0)?1:-1);\\n\\t}\\n}\\n\\n\\n\\nint main(void){\\n\\tll n;\\n\\tcin>>n;\\n\\tll ans = 0;\\n\\tsum[0] = 0;\\n\\tinit();\\n\\tinit1();\\n\\tprecalc(n);\\n\\tfor(auto [d,cnt]:mp1){\\n\\t\\tll x = n/d;\\n\\t\\tll c = 0;\\n\\t\\tfor(ll i=1;i*i<=x;i++){\\n\\t\\t\\tif(x%i==0){\\n\\t\\t\\t\\tll t = x/i;\\n\\t\\t\\t\\tif(i==t)c++;\\n\\t\\t\\t\\telse c+=2LL;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tll tmp = (kaijo[c]*sum[c-1])%N;\\n\\t\\ttmp = (mp1[d]*tmp+N)%N;\\n\\t\\ttmp = (tmp+N)%N;\\n\\t\\tans = (ans+tmp+N)%N;\\n\\t}\\n\\tcout<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 34732,\n \"score_of_the_acc\": -0.8928,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3155_4861779\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)\\n\\nvector<ll> yakusu(ll n){\\n vector<ll> ret;\\n for(ll i = 1; i*i <= n; i++){\\n if(n % i != 0) continue;\\n ret.push_back(i);\\n if(i*i != n) ret.push_back(n/i);\\n }\\n sort(ret.begin(), ret.end());\\n reverse(ret.begin(), ret.end());\\n return ret;\\n}\\n\\nconst ll mod = 1000000000 + 7;\\n#define NMAX 1000010\\nll fac[NMAX], inv[NMAX];\\n\\nll mod_pow(ll a, ll n, ll mod){\\n ll ret = 1;\\n while(n > 0){\\n if(n & 1) ret = (ret*(a % mod))%mod;\\n a = ((a%mod)*(a%mod)) % mod;\\n n = n >> 1;\\n }\\n return ret;\\n}\\n\\nll mod_inv(ll a, ll mod){\\n return mod_pow(a, mod-2, mod);\\n}\\n\\nvoid mae_nck(){\\n fac[1] = 1;\\n inv[1] = 1;\\n for(ll i = 2; i < NMAX; i++){\\n fac[i] = (fac[i-1] * i)%mod;\\n inv[i] = (inv[i-1] * mod_inv(i, mod))%mod;\\n }\\n}\\n\\nll mod_nck(ll n, ll k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n if(k == 0 || k == n) return 1;\\n ll ret = ((fac[n] * inv[k])%mod * inv[n-k])%mod;\\n return ret;\\n}\\n\\nll calc(ll n) {\\n ll res = 0;\\n for(ll i = 1; i <= n; i++) {\\n res += (mod_nck(n, i) * fac[i]) % mod;\\n res %= mod; \\n }\\n return res;\\n}\\n\\nint main() {\\n mae_nck();\\n ll n;\\n cin >> n;\\n ll invalid = 0;\\n auto vn = yakusu(n);\\n map<ll, ll> cnt;\\n for(auto e : vn) {\\n if(cnt[e] == 1 || e == n) continue;\\n auto v = yakusu(e);\\n if(cnt[e] == 0) {\\n invalid += calc(v.size());\\n invalid %= mod;\\n for(auto p : v) cnt[p]++;\\n } else {\\n invalid -= ((cnt[e] - 1) * calc(v.size())) % mod;\\n invalid %= mod;\\n ll gap = cnt[e] - 1;\\n for(auto p : v) cnt[p] -= gap; \\n }\\n }\\n ll sum = calc(vn.size());\\n ll ans = sum - invalid + mod;\\n ans %= mod;\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 19408,\n \"score_of_the_acc\": -0.8074,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3155_4861778\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)\\n\\nvector<ll> yakusu(ll n){\\n vector<ll> ret;\\n for(ll i = 1; i*i <= n; i++){\\n if(n % i != 0) continue;\\n ret.push_back(i);\\n if(i*i != n) ret.push_back(n/i);\\n }\\n sort(ret.begin(), ret.end());\\n reverse(ret.begin(), ret.end());\\n return ret;\\n}\\n\\nconst ll mod = 1000000000 + 7;\\n#define NMAX 1000010\\nll fac[NMAX], inv[NMAX];\\n\\nll mod_pow(ll a, ll n, ll mod){\\n ll ret = 1;\\n while(n > 0){\\n if(n & 1) ret = (ret*(a % mod))%mod;\\n a = ((a%mod)*(a%mod)) % mod;\\n n = n >> 1;\\n }\\n return ret;\\n}\\n\\nll mod_inv(ll a, ll mod){\\n return mod_pow(a, mod-2, mod);\\n}\\n\\nvoid mae_nck(){\\n fac[1] = 1;\\n inv[1] = 1;\\n for(ll i = 2; i < NMAX; i++){\\n fac[i] = (fac[i-1] * i)%mod;\\n inv[i] = (inv[i-1] * mod_inv(i, mod))%mod;\\n }\\n}\\n\\nll mod_nck(ll n, ll k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n if(k == 0 || k == n) return 1;\\n ll ret = ((fac[n] * inv[k])%mod * inv[n-k])%mod;\\n return ret;\\n}\\n\\nll calc(ll n) {\\n ll res = 0;\\n for(ll i = 1; i <= n; i++) {\\n res += (mod_nck(n, i) * fac[i]) % mod;\\n res %= mod; \\n }\\n return res;\\n}\\n\\nint main() {\\n mae_nck();\\n ll n;\\n cin >> n;\\n ll invalid = 0;\\n auto vn = yakusu(n);\\n map<ll, ll> cnt;\\n for(auto e : vn) {\\n if(cnt[e] == 1 || e == n) continue;\\n auto v = yakusu(e);\\n if(cnt[e] == 0) {\\n invalid += calc(v.size());\\n invalid %= mod;\\n for(auto p : v) cnt[p]++;\\n } else {\\n invalid -= ((cnt[e] - 1) * calc(v.size())) % mod;\\n invalid %= mod;\\n ll gap = cnt[e] - 1;\\n for(auto p : v) cnt[p]--;\\n // for(auto p : v) cnt[p] -= gap; <============================ これも通る\\n }\\n }\\n ll sum = calc(vn.size());\\n ll ans = sum - invalid + mod;\\n ans %= mod;\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 19356,\n \"score_of_the_acc\": -0.8328,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3155_4861723\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)\\n\\nvector<ll> yakusu(ll n){\\n vector<ll> ret;\\n for(ll i = 1; i*i <= n; i++){\\n if(n % i != 0) continue;\\n ret.push_back(i);\\n if(i*i != n) ret.push_back(n/i);\\n }\\n sort(ret.begin(), ret.end());\\n reverse(ret.begin(), ret.end());\\n return ret;\\n}\\n\\nconst ll mod = 1000000000 + 7;\\n#define NMAX 1000010\\nll fac[NMAX], inv[NMAX];\\n\\nll mod_pow(ll a, ll n, ll mod){\\n ll ret = 1;\\n while(n > 0){\\n if(n & 1) ret = (ret*(a % mod))%mod;\\n a = ((a%mod)*(a%mod)) % mod;\\n n = n >> 1;\\n }\\n return ret;\\n}\\n\\nll mod_inv(ll a, ll mod){\\n return mod_pow(a, mod-2, mod);\\n}\\n\\nvoid mae_nck(){\\n fac[1] = 1;\\n inv[1] = 1;\\n for(ll i = 2; i < NMAX; i++){\\n fac[i] = (fac[i-1] * i)%mod;\\n inv[i] = (inv[i-1] * mod_inv(i, mod))%mod;\\n }\\n}\\n\\nll mod_nck(ll n, ll k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n if(k == 0 || k == n) return 1;\\n ll ret = ((fac[n] * inv[k])%mod * inv[n-k])%mod;\\n return ret;\\n}\\n\\nll calc(ll n) {\\n ll res = 0;\\n for(ll i = 1; i <= n; i++) {\\n res += (mod_nck(n, i) * fac[i]) % mod;\\n res %= mod; \\n }\\n return res;\\n}\\n\\nint main() {\\n mae_nck();\\n ll n;\\n cin >> n;\\n ll invalid = 0;\\n auto vn = yakusu(n);\\n map<ll, ll> cnt;\\n for(auto e : vn) {\\n if(cnt[e] == 1 || e == n) continue;\\n auto v = yakusu(e);\\n if(cnt[e] == 0) {\\n invalid += calc(v.size());\\n invalid %= mod;\\n for(auto p : v) cnt[p]++;\\n } else {\\n invalid -= ((cnt[e] - 1) * calc(v.size())) % mod;\\n int num = cnt[e] - 1;\\n invalid %= mod;\\n for(auto p : v) cnt[p] -= num;\\n }\\n }\\n ll sum = calc(vn.size());\\n ll ans = sum - invalid + mod;\\n ans %= mod;\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 19452,\n \"score_of_the_acc\": -0.8077,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3155_4861562\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)\\n\\nvector<ll> yakusu(ll n){\\n vector<ll> ret;\\n for(ll i = 1; i*i <= n; i++){\\n if(n % i != 0) continue;\\n ret.push_back(i);\\n if(i*i != n) ret.push_back(n/i);\\n }\\n sort(ret.begin(), ret.end());\\n reverse(ret.begin(), ret.end());\\n return ret;\\n}\\n\\nconst ll mod = 1000000000 + 7;\\n#define NMAX 1000010\\nll fac[NMAX], inv[NMAX];\\n\\nll mod_pow(ll a, ll n, ll mod){\\n ll ret = 1;\\n while(n > 0){\\n if(n & 1) ret = (ret*(a % mod))%mod;\\n a = ((a%mod)*(a%mod)) % mod;\\n n = n >> 1;\\n }\\n return ret;\\n}\\n\\nll mod_inv(ll a, ll mod){\\n return mod_pow(a, mod-2, mod);\\n}\\n\\nvoid mae_nck(){\\n fac[1] = 1;\\n inv[1] = 1;\\n for(ll i = 2; i < NMAX; i++){\\n fac[i] = (fac[i-1] * i)%mod;\\n inv[i] = (inv[i-1] * mod_inv(i, mod))%mod;\\n }\\n}\\n\\nll mod_nck(ll n, ll k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n if(k == 0 || k == n) return 1;\\n ll ret = ((fac[n] * inv[k])%mod * inv[n-k])%mod;\\n return ret;\\n}\\n\\nll calc(ll n) {\\n ll res = 0;\\n for(ll i = 1; i <= n; i++) {\\n res += (mod_nck(n, i) * fac[i]) % mod;\\n res %= mod; \\n }\\n return res;\\n}\\n\\nint main() {\\n mae_nck();\\n ll n;\\n cin >> n;\\n ll invalid = 0;\\n auto vn = yakusu(n);\\n map<ll, ll> cnt;\\n for(auto e : vn) {\\n if(cnt[e] == 1 || e == n) continue;\\n auto v = yakusu(e);\\n if(cnt[e] == 0) {\\n invalid += calc(v.size());\\n invalid %= mod;\\n for(auto p : v) cnt[p]++;\\n } else {\\n invalid -= ((cnt[e] - 1) * calc(v.size())) % mod;\\n invalid %= mod;\\n for(auto p : v) cnt[p] -= cnt[e] - 1;\\n }\\n }\\n ll sum = calc(vn.size());\\n ll ans = sum - invalid + mod;\\n ans %= mod;\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.06060606060606061,\n \"time_ms\": 160,\n \"memory_kb\": 19060,\n \"score_of_the_acc\": -0.4722,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3155_4861560\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)\\n\\nvector<ll> yakusu(ll n){\\n vector<ll> ret;\\n for(ll i = 1; i*i <= n; i++){\\n if(n % i != 0) continue;\\n ret.push_back(i);\\n if(i*i != n) ret.push_back(n/i);\\n }\\n sort(ret.begin(), ret.end());\\n reverse(ret.begin(), ret.end());\\n return ret;\\n}\\n\\nconst ll mod = 1000000000 + 7;\\n#define NMAX 1000010\\nll fac[NMAX], inv[NMAX];\\n\\nll mod_pow(ll a, ll n, ll mod){\\n ll ret = 1;\\n while(n > 0){\\n if(n & 1) ret = (ret*(a % mod))%mod;\\n a = ((a%mod)*(a%mod)) % mod;\\n n = n >> 1;\\n }\\n return ret;\\n}\\n\\nll mod_inv(ll a, ll mod){\\n return mod_pow(a, mod-2, mod);\\n}\\n\\nvoid mae_nck(){\\n fac[1] = 1;\\n inv[1] = 1;\\n for(ll i = 2; i < NMAX; i++){\\n fac[i] = (fac[i-1] * i)%mod;\\n inv[i] = (inv[i-1] * mod_inv(i, mod))%mod;\\n }\\n}\\n\\nll mod_nck(ll n, ll k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n if(k == 0 || k == n) return 1;\\n ll ret = ((fac[n] * inv[k])%mod * inv[n-k])%mod;\\n return ret;\\n}\\n\\nll calc(ll n) {\\n ll res = 0;\\n for(ll i = 1; i <= n; i++) {\\n res += (mod_nck(n, i) * fac[i]) % mod;\\n res %= mod; \\n }\\n return res;\\n}\\n\\nint main() {\\n mae_nck();\\n ll n;\\n cin >> n;\\n ll invalid = 0;\\n auto vn = yakusu(n);\\n map<ll, ll> cnt;\\n for(auto e : vn) {\\n if(cnt[e] == 1 || e == n) continue;\\n auto v = yakusu(e);\\n if(cnt[e] == 0) {\\n invalid += calc(v.size());\\n invalid %= mod;\\n for(auto p : v) cnt[p]++;\\n } else {\\n invalid -= ((cnt[e] - 1) * calc(v.size())) % mod;\\n invalid %= mod;\\n for(auto p : v) cnt[p]--;\\n }\\n }\\n ll sum = calc(vn.size());\\n ll ans = sum - invalid + mod;\\n ans %= mod;\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 19396,\n \"score_of_the_acc\": -0.833,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3155_4861046\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(1e9 + 7)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nstruct Combination {\\n vector<ModInt<>> _fact, _rfact, _inv;\\n Combination(long long nsize = 5000000)\\n : _fact(nsize + 1), _rfact(nsize + 1), _inv(nsize + 1) {\\n _fact[0] = _rfact[nsize] = _inv[0] = 1;\\n for (int i = 1; i <= nsize; i++) _fact[i] = _fact[i - 1] * i;\\n _rfact[nsize] /= _fact[nsize];\\n for (int i = nsize - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\\n for (int i = 1; i <= nsize; i++) _inv[i] = _rfact[i] * _fact[i - 1];\\n }\\n inline ModInt<> fact(int k) const { return _fact[k]; }\\n\\n inline ModInt<> rfact(int k) const { return _rfact[k]; }\\n\\n inline ModInt<> inv(int k) const { return _inv[k]; }\\n\\n ModInt<> P(int n, int r) const {\\n if (r < 0 || n < r) return 0;\\n return fact(n) * rfact(n - r);\\n }\\n\\n ModInt<> C(int p, int q) const {\\n if (q < 0 || p < q) return 0;\\n return fact(p) * rfact(q) * rfact(p - q);\\n }\\n // n types,choose r\\n ModInt<> H(int n, int r) const {\\n if (n < 0 || r < 0) return (0);\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\n\\nmap<long long, long long> div_moebius(long long n, vector<long long> &primes) {\\n map<long long, long long> res;\\n for (long long i = 2; i * i <= n; ++i)\\n if (n % i == 0) {\\n primes.push_back(i);\\n while (n % i == 0) n /= i;\\n }\\n if (n > 1) primes.push_back(n);\\n n = primes.size();\\n for (long long i = 0; i < (1 << n); ++i) {\\n long long mu = 1, d = 1;\\n for (long long j = 0; j < n; ++j)\\n if (i >> j & 1) {\\n mu *= -1;\\n d *= primes[j];\\n }\\n res[d] = mu;\\n }\\n return res;\\n}\\n\\nlong long n;\\nCombination com;\\nvector<ModInt<>> rsum;\\n\\nModInt<> solve();\\n\\nint main() {\\n {\\n int len = com._rfact.size();\\n rsum.assign(len, 1);\\n for (int i = 1; i < len; ++i) rsum[i] = rsum[i - 1] + com.rfact(i);\\n }\\n cin >> n;\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n ModInt<> res = 0;\\n vector<long long> primes, divisors;\\n map<long long, long long> mb = div_moebius(n, primes), cnt;\\n for (long long i = 1; i * i <= n; ++i)\\n if (n % i == 0) {\\n divisors.push_back(i);\\n if (i * i != n) divisors.push_back(n / i);\\n }\\n sort(divisors.begin(), divisors.end());\\n cnt[1] = 1;\\n for (auto d : divisors)\\n for (auto p : primes)\\n if (d % p == 0) {\\n long long now = 1, tmp = d;\\n while (tmp % p == 0) ++now, tmp /= p;\\n cnt[d] = cnt[d / p] * now / (now - 1);\\n break;\\n }\\n for (auto p : mb) {\\n long long d = n / p.first, u = p.second, c = 0;\\n c = cnt[d];\\n res += com.fact(c) * rsum[c - 1] * u;\\n }\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 81692,\n \"score_of_the_acc\": -0.5644,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3155_4844234\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <array>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <cmath>\\n#include <functional>\\n#include <cassert>\\n#include <iomanip>\\n#define vll vector<ll>\\n#define vvvl vector<vvl>\\n#define vvl vector<vector<ll>>\\n#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))\\n#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));\\n#define re(c, b) for(ll c=0;c<b;c++)\\n#define all(obj) (obj).begin(), (obj).end()\\ntypedef long long int ll;\\ntypedef long double ld;\\nusing namespace std;\\n\\nnamespace fact{\\n ll gcd(ll _a, ll _b) {\\n unsigned long long a = abs(_a), b = abs(_b);\\n if(a == 0) return b;\\n if(b == 0) return a;\\n int shift = __builtin_ctzll(a | b);\\n a >>= __builtin_ctzll(a);\\n do {\\n b >>= __builtin_ctzll(b);\\n if(a > b) std::swap(a, b);\\n b -= a;\\n }while(b);\\n return (a << shift);\\n }\\n template <class T, class U>\\n T modpow(T x, U n, T md) {\\n T r = 1 % md;\\n x %= md;\\n while(n) {\\n if(n & 1) r = (r * x) % md;\\n x = (x * x) % md;\\n n >>= 1;\\n }\\n return r;\\n }\\n bool is_prime(ll n) {\\n if(n<=1) return false;\\n if(n==2) return true;\\n if(n%2==0) return false;\\n ll d = n - 1;\\n while(d % 2 == 0) d /= 2;\\n for(ll a : {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37}) {\\n if(n <= a) break;\\n ll t = d, y = modpow<__int128_t>(a, t, n);\\n while(t != n - 1 && y != 1 && y != n - 1) {\\n y = __int128_t(y) * y % n, t <<= 1;\\n }\\n if(y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n }\\n ll rho(ll n){\\n if(is_prime(n)) return n;\\n if(n % 2 == 0) return 2;\\n ll c = 0;\\n while(true){\\n c = (3 * c + 1) % 24;\\n auto f = [&](ll x){return(__int128_t(x)*x+c)%n;};\\n ll st = 0;\\n while(true){\\n st++;\\n ll x = st%n, y = f(x);\\n while(true){\\n ll g = gcd(abs(x-y), n);\\n if(g==1) x = f(x), y = f(f(y));\\n else if(g==n) break;\\n else return g;\\n }\\n }\\n }\\n }\\n vll factorize(ll n) {\\n if(n == 1) return {};\\n ll x = rho(n);\\n if(x == n) return {x};\\n vll le = factorize(x);\\n vll ri = factorize(n / x);\\n le.insert(le.end(), ri.begin(), ri.end());\\n return le;\\n }\\n}\\n\\n#define P 1000000007\\n#define N_MAX 5000000\\nll fac[N_MAX+1], inv[N_MAX+1], finv[N_MAX+1];\\nll comb(ll n, ll k){\\n if(n<0||k<0||n<k) return 0;\\n return (((fac[n]*finv[n-k])%P)*finv[k])%P;\\n}\\nll perm(ll n, ll k){\\n if(n<0||k<0||n<k) return 0;\\n return (fac[n]*finv[n-k])%P;\\n}\\nvoid init(){\\n fac[0] = finv[0] = fac[1] = finv[1] = inv[1] = 1;\\n for(int i = 2; i <= N_MAX; i++){\\n fac[i] = (fac[i-1]*i)%P;\\n inv[i] = ((-(P/i)*inv[P%i])%P+P)%P;\\n finv[i] = (finv[i-1]*inv[i])%P;\\n }\\n}\\nll pp(ll a, ll b){ return (a * b)%P;}\\nll mpow(ll a, ll b, ll p = -1){\\n ll ret = 1, num = a;\\n while(b>0){\\n if(b&1) ret = (ret*num)%p;\\n num = (num*num)%p;\\n b /= 2;\\n }\\n return ret;\\n}\\nvll fiacc(N_MAX, 1);\\n\\nll nn;\\nll trans(ll n){\\n if(n < 1200000) return n;\\n //if(n>=1500000) std::cout << \\\"err\\\" << n << '\\\\n';\\n return nn/n + 1500000;\\n}\\n\\nint main(){\\n ll n;std::cin >> n;\\n nn = n;\\n init();\\n for(int i=1;i<N_MAX;i++) fiacc[i] = (fiacc[i-1] + finv[i])%P;\\n vll d;\\n for(ll i=1;i*i<=n;i++){\\n if(n%i) continue;\\n d.push_back(i);\\n if(i*i!=n) d.push_back(n/i);\\n }\\n ll N = d.size();\\n vll ans(3000000, 0);\\n ans[1] = 1;\\n if(n==1){\\n std::cout << 1 << '\\\\n';\\n return 0;\\n }\\n\\n sort(all(d));\\n for(int i=1;i<N;i++){\\n ll cnt = 0;\\n ll num = d[i];\\n ll now = trans(num);\\n\\n for(ll j=1;j*j<=num;j++){\\n if(num%j!=0) continue;\\n cnt++;\\n ans[now] = (ans[now] - ans[trans(j)] + P)%P;\\n if(j*j!=num){\\n cnt++;\\n ll to = trans(num/j);\\n if(j!=1) ans[now] = (ans[now] - ans[to] + P)%P;\\n }\\n }\\n ans[now] = (ans[now] + pp(fac[cnt], fiacc[cnt-1]))%P;\\n if(i==N-1) std::cout << ans[now] << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 182956,\n \"score_of_the_acc\": -2,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3155_4840410\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\nint PREP = (cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12), 0);\\n//int SEGV = getenv(\\\"D\\\") || (exit(system(\\\"D= SEGFAULT_SIGNALS=all catchsegv ./prog.exe\\\") >> 8), 0);\\nconst Int MOD = 998244353;\\nInt POW2[4100000];\\nint main() {\\n POW2[0] = 1;\\n for (int i = 1; i < 4100000; i++) {\\n POW2[i] = POW2[i - 1] * 2 % MOD;\\n }\\n int N, M, K, F; cin >> N >> M >> K >> F;\\n vector<int> A(M), B(M), C(M);\\n for (int i = 0; i < M; i++) {\\n cin >> A[i] >> B[i] >> C[i];\\n A[i]--, B[i]--;\\n }\\n Int ans = 1;\\n for (int i = 0; i < K; i++) {\\n int k = (N - 1) * (N - 2);\\n for (int j = 0; j < M; j++) {\\n if (abs(A[j] - B[j]) >= 2) {\\n k--;\\n } else {\\n if (C[j] & (1 << i)) {\\n k = -1;\\n }\\n }\\n }\\n Int total = POW2[N * N - M];\\n Int zero = (k < 0 ? 0 : POW2[k]);\\n Int one = (total - zero + MOD) % MOD;\\n if (F & (1 << i)) {\\n ans *= one;\\n } else {\\n ans *= zero;\\n }\\n ans %= MOD;\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.030303030303030304,\n \"time_ms\": 10,\n \"memory_kb\": 35468,\n \"score_of_the_acc\": -0.1789,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3155_4839810\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n \\n \\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SQ(a) ((a)*(a))\\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define SORT(c) sort((c).begin(),(c).end())\\n \\n \\n//repetition\\n//------------------------------------------\\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define MOD 1000000007\\n \\n \\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\\n#define trav(a, x) for(auto& a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n \\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n \\n#define chmin(x,y) x=min(x,y)\\n#define chmax(x,y) x=max(x,y)\\n\\nconst long double EPS = 1e-6, PI = acos((long double)-1);\\n\\n//ここから編集\\n\\n \\nconst int MAX = 2000010;\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n \\n// テーブルを作る前処理\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n \\n// 二項係数計算\\nlong long COM(int n, int k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\\n}\\nll GCD(ll a, ll b){\\n if(b == 0) return a;\\n return GCD(b, a%b);\\n}\\nll LCM(ll a, ll b){\\n return a/GCD(a, b)*b;\\n}\\n\\nunordered_map<ll, vector<ll>> mp;\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n \\n ll N; cin >> N;\\n\\n vector<ll> divisor;\\n for(ll i=1; i*i<=N; i++){\\n if(N%i == 0){\\n if(N/i != i){\\n divisor.push_back(i);\\n divisor.push_back(N/i);\\n }else{\\n divisor.push_back(i);\\n }\\n }\\n }\\n sort(all(divisor));\\n \\n mp[0].resize(1010);\\n mp[0][0] = 1;\\n \\n for(int i=0; i<divisor.size(); i++){\\n\\n for(int sz=(int)divisor.size()-1; sz>=0; sz--){\\n for(auto e: mp){\\n \\n ll a = e.first;\\n ll t = a;\\n if(a == 0) t = 1;\\n ll lcm = LCM(t, divisor[i]);\\n\\n if(mp.find(lcm) == mp.end()){\\n mp[lcm].resize(1010);\\n mp[lcm][sz+1] += mp[a][sz];\\n mp[lcm][sz+1] %= MOD;\\n }else{\\n mp[lcm][sz+1] += mp[a][sz];\\n mp[lcm][sz+1] %= MOD;\\n }\\n }\\n }\\n }\\n\\n COMinit();\\n ll ans = 0;\\n for(int i=0; i<=divisor.size(); i++){\\n \\n if(mp[N][i] != 0){\\n ans += fac[i] * mp[N][i] % MOD;\\n ans %= MOD;\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.696969696969697,\n \"time_ms\": 220,\n \"memory_kb\": 50480,\n \"score_of_the_acc\": -0.8009,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3155_4839774\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n \\n \\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SQ(a) ((a)*(a))\\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define SORT(c) sort((c).begin(),(c).end())\\n \\n \\n//repetition\\n//------------------------------------------\\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define MOD 1000000007\\n \\n \\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\\n#define trav(a, x) for(auto& a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n \\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n \\n#define chmin(x,y) x=min(x,y)\\n#define chmax(x,y) x=max(x,y)\\n\\nconst long double EPS = 1e-6, PI = acos((long double)-1);\\n\\n//ここから編集\\n\\n \\nconst int MAX = 2000010;\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n \\n// テーブルを作る前処理\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n \\n// 二項係数計算\\nlong long COM(int n, int k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\\n}\\nll GCD(ll a, ll b){\\n return (b==0)?a:GCD(b, a%b);\\n}\\nll LCM(ll a, ll b){\\n return a/GCD(a, b)*b;\\n}\\n\\nunordered_map<ll, vector<ll>> mp;\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n \\n ll N; cin >> N;\\n\\n vector<ll> divisor;\\n for(ll i=1; i*i<=N; i++){\\n if(N%i == 0){\\n if(N/i != i){\\n divisor.push_back(i);\\n divisor.push_back(N/i);\\n }else{\\n divisor.push_back(i);\\n }\\n }\\n }\\n sort(all(divisor));\\n \\n mp[0].resize(510);\\n mp[0][0] = 1;\\n \\n for(int i=0; i<divisor.size(); i++){\\n\\n for(int sz=(int)divisor.size()-1; sz>=0; sz--){\\n for(auto e: mp){\\n \\n ll a = e.first;\\n ll t = a;\\n if(a == 0) t = 1;\\n ll lcm = LCM(t, divisor[i]);\\n\\n if(mp.find(lcm) == mp.end()){\\n mp[lcm].resize(510);\\n mp[lcm][sz+1] += mp[a][sz];\\n mp[lcm][sz+1] %= MOD;\\n }else{\\n mp[lcm][sz+1] += mp[a][sz];\\n mp[lcm][sz+1] %= MOD;\\n }\\n }\\n }\\n }\\n\\n COMinit();\\n ll ans = 0;\\n for(int i=0; i<510; i++){\\n \\n if(mp[N].size() != 0 && mp[N][i] != 0){\\n ans += fac[i] * mp[N][i] % MOD;\\n ans %= MOD;\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.696969696969697,\n \"time_ms\": 170,\n \"memory_kb\": 50300,\n \"score_of_the_acc\": -0.6717,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3155_4839771\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n \\n \\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SQ(a) ((a)*(a))\\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define SORT(c) sort((c).begin(),(c).end())\\n \\n \\n//repetition\\n//------------------------------------------\\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define MOD 1000000007\\n \\n \\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\\n#define trav(a, x) for(auto& a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n \\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n \\n#define chmin(x,y) x=min(x,y)\\n#define chmax(x,y) x=max(x,y)\\n\\nconst long double EPS = 1e-6, PI = acos((long double)-1);\\n\\n//ここから編集\\n\\n \\nconst int MAX = 2000010;\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n \\n// テーブルを作る前処理\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n \\n// 二項係数計算\\nlong long COM(int n, int k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\\n}\\nll GCD(ll a, ll b){\\n return (b==0)?a:GCD(b, a%b);\\n}\\nll LCM(ll a, ll b){\\n return a/GCD(a, b)*b;\\n}\\n\\nunordered_map<ll, vector<ll>> mp;\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n \\n ll N; cin >> N;\\n\\n vector<ll> divisor;\\n for(ll i=1; i*i<=N; i++){\\n if(N%i == 0){\\n if(N/i != i){\\n divisor.push_back(i);\\n divisor.push_back(N/i);\\n }else{\\n divisor.push_back(i);\\n }\\n }\\n }\\n sort(all(divisor));\\n \\n mp[0].resize(310);\\n mp[0][0] = 1;\\n \\n for(int i=0; i<divisor.size(); i++){\\n\\n for(int sz=(int)divisor.size()-1; sz>=0; sz--){\\n for(auto e: mp){\\n \\n ll a = e.first;\\n ll t = a;\\n if(a == 0) t = 1;\\n ll lcm = LCM(t, divisor[i]);\\n\\n if(mp.find(lcm) == mp.end()){\\n mp[lcm].resize(310);\\n mp[lcm][sz+1] += mp[a][sz];\\n mp[lcm][sz+1] %= MOD;\\n }else{\\n mp[lcm][sz+1] += mp[a][sz];\\n mp[lcm][sz+1] %= MOD;\\n }\\n }\\n }\\n }\\n\\n COMinit();\\n ll ans = 0;\\n for(int i=0; i<310; i++){\\n \\n if(mp[N].size() != 0 && mp[N][i] != 0){\\n ans += fac[i] * mp[N][i] % MOD;\\n ans %= MOD;\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.696969696969697,\n \"time_ms\": 130,\n \"memory_kb\": 50364,\n \"score_of_the_acc\": -0.5695,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":1972,"cells":{"group_id":{"kind":"string","value":"aoj_3154_cpp"},"problem_description":{"kind":"string","value":"Problem D: Treasure Mountains\nProblem\n$N$ 個の山があり、 それぞれ $1 , 2 , \\ldots ,N$ の番号が割り振られています。\nここには、たくさんのお宝が眠っていると噂されています。\n また、この地域には長さ $M$ の数列が言い伝えられており、その数列の $i (1 ≤ i ≤ M)$ 番目の数字は $d_i$ です。\n山田君は $Q$ 個の巻物を入手しました。 $i (1 ≤ i ≤ Q)$ 番目の巻物には、3つの数字 $x_i, y_i, z_i$ が書かれています。\n 巻物の3つの数字は、宝のある山の番号を探すヒントになるようです。\nまた、巻物には次のような情報も書かれていました。\n宝のある山の番号を $t$ とする。 $t$ を $z$ 回暗号化したものが $x$ である。\n1回目の暗号化では、 $d_y$ を鍵として使用する。\nそれ以降の暗号化では、前回使った鍵の番号を $p$ として、 $d_{p+1}$ を鍵として使用する。ただし、前回使った鍵が $d_{M}$ の場合のみ、 $d_{1}$ を次の鍵とする。\n$t$ を鍵 $a$ で暗号化する、という操作は次のことを表す。\n$t^a$ を $N+1$ で割った余りを新たな $t$ とする。\n複数の巻物が同じ山の番号を指すこともあります。\n計算が苦手な山田君の代わりに、それぞれの巻物が指している山の番号を答えてください。\nなお、この制約において、それぞれの巻物が指す山の番号は一意に求まることが証明できます(\n制約をよく確認することを推奨します\n)。\nConstraints\n入力は以下の条件を満たす。\n$4 ≤ N ≤ 9999990$\n$N+1$ は素数である。\n$1 ≤ d_i ≤ N - 1$\n$d_i$ は $N$ と互いに素である。\n$1 ≤ M, Q ≤ 50000$\n$1 ≤ x_i ≤ N$\n$1 ≤ y_i ≤ M$\n$1 ≤ z_i ≤ 10^9$\n入力は全て整数である。\nInput\n入力は以下の形式で標準入力から与えられる。\n$N$ $M$ $Q$\n$d_1$ $d_2$ $\\ldots$ $d_M$\n$x_1$ $y_1$ $z_1$\n$\\vdots$\n$x_Q$ $y_Q$ $z_Q$\nOutput\n$Q$ 行出力してください。 $i$ 行目には、 $i$ 番目の巻物に書かれている宝が存在する山の番号を答えてください。\nまた、末尾に改行を出力するのを忘れないようにしてください。\nSample Input 1\n10 10 5\n1 3 7 9 1 3 3 3 9 3\n5 6 1\n4 6 2\n9 6 3\n8 10 3\n1 4 100\nSample Output 1\n3\n3\n3\n7\n1\n例えば、 $t = 3, y = 6$ として順に3回暗号化した場合のことを考えます。\n1回暗号化すると、 $3^3 = 27$ であるから、\n$27 \\equiv 5 \\mod 11$\nとなり、これは1つ目の巻物の情報 $(5, 6, 1)$ と一致します。\n2回目の暗号化を施すと、 $5^3 = 125$ であるから、\n$125 \\equiv 4 \\mod 11$\nとなり、これは2つ目の巻物の情報 $(4, 6, 2)$ と一致します。\n3回目の暗号化も同様に、 $4^3 = 64$ であるから、\n$64 \\equiv 9 \\mod 11$\nとなり、これは3つ目の巻物の情報 $(9, 6, 3)$ と一致します。\n$t$ が $3$ 以外のとき、巻物の情報と一致することがないので、最初の3行は全て $3$ を出力すればよいです。\n$y = 10$ の場合に3回暗号化するときは、 $d_{10}, d_1, d_2$ を順に鍵として使用します。\n$t = 7$ とすると、 $7 \\to 2 \\to 2 \\to 8$ と変化し、これは4つ目の巻物の情報 $(8, 10, 3)$ と一致します。\nこれ以外に条件を満たす $t$ はありません。よって、4行目には $7$ を出力します。\n$t = 1$ のとき、何乗しても $1$ であるため、5つめの巻物の宝がある山は $1$ となります。\nよって、5行目には $1$ を出力します。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3154_9741089","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\ntypedef long long int ll;\n\nll mod_inv(ll a,ll p){\n\tll b=p,x=1LL,y=0LL;\n\twhile(b){\n\t\tll t=a/b;\n\t\ta-=t*b; swap(a,b);\n\t\tx-=t*y; swap(x,y);\n\t}\n\treturn (x%p+p)%p;\n}\n\nll mod_pow(ll a,ll n,ll mod){\n\tll res=1LL;\n\twhile(n){\n\t\tif(n%2)res=res*a%mod;\n\t\ta=a*a%mod;\n\t\tn>>=1;\n\t}\n\treturn res;\n}\n\nint main(){\n\tint n,m,q; cin >> n >> m >> q;\n\tvector<ll> d(m);\n\tfor(int i=0;i<m;i++){\n\t\tcin >> d[i]; d[i]=mod_inv(d[i],n);\n\t}\n\tvector<ll> mul(2*m+1);\n\tmul[0]=1LL;\n\tfor(int i=0;i<2*m;i++){\n\t\tmul[i+1]=mul[i]*d[i%m]%n;\n\t}\n\twhile(q--){\n\t\tint x,y,z; cin >> x >> y >> z; y--;\n\t\tll r=mod_pow(mul[m],z/m,n);\n\t\tr=r*mul[y+z%m]%n*mod_inv(mul[y],n)%n;\n\t\tcout << mod_pow(x,r,n+1) << \"\\n\";\n\t}\n}","accuracy":1,"time_ms":110,"memory_kb":4140,"score_of_the_acc":-0.0501,"final_rank":3},{"submission_id":"aoj_3154_7009230","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3154.cc: Problem D: Treasure Mountains\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<utility>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 9999990;\nconst int MAX_M = 50000;\n\n/* typedef */\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vpii;\n\nstruct MI {\n static int MOD;\n int v;\n MI(): v() {}\n MI(int _v): v(_v % MOD) {}\n MI(long long _v): v(_v % MOD) {}\n\n MI operator+(const MI m) const { return MI(v + m.v); }\n MI operator-(const MI m) const { return MI(v + MOD - m.v); }\n MI operator*(const MI m) const { return MI((long long)v * m.v); }\n\n MI &operator+=(const MI m) { return (*this = *this + m); }\n MI &operator-=(const MI m) { return (*this = *this - m); }\n MI &operator*=(const MI m) { return (*this = *this * m); }\n\n bool operator==(const MI m) const { return v == m.v; }\n bool operator!=(const MI m) const { return v != m.v; }\n\n MI pow(int n) const { // a^n % MOD\n MI pm = 1, a = *this;\n while (n > 0) {\n if (n & 1) pm *= a;\n a *= a;\n n >>= 1;\n }\n return pm;\n }\n\n MI inv() const { return pow(MOD - 2); }\n MI operator/(const MI m) const { return *this * m.inv(); }\n MI &operator/=(const MI m) { return (*this = *this / m); }\n};\n\ntypedef MI mi;\nint MI::MOD;\n\nstruct SegTreeMul {\n typedef int T;\n typedef long long ll;\n int e2;\n vector<T> nodes;\n T defv, mod;\n SegTreeMul() {}\n\n void init(int n, T _defv, T _mod) {\n defv = _defv, mod = _mod;\n for (e2 = 1; e2 < n; e2 <<= 1);\n nodes.assign(e2 * 2, defv);\n }\n\n T &geti(int i) { return nodes[e2 - 1 + i]; }\n void seti(int i, T v) { geti(i) = v; }\n\n void setall() {\n for (int j = e2 - 2; j >= 0; j--)\n nodes[j] = (ll)nodes[j * 2 + 1] * nodes[j * 2 + 2] % mod;\n }\n\n void set(int i, T v) {\n int j = e2 - 1 + i;\n nodes[j] = v;\n while (j > 0) {\n j = (j - 1) / 2;\n nodes[j] = (ll)nodes[j * 2 + 1] * nodes[j * 2 + 2] % mod;\n }\n }\n\n T mul_range(int r0, int r1, int k, int i0, int i1) {\n if (r1 <= i0 || i1 <= r0) return defv;\n if (r0 <= i0 && i1 <= r1) return nodes[k];\n\n int im = (i0 + i1) / 2;\n T v0 = mul_range(r0, r1, k * 2 + 1, i0, im);\n T v1 = mul_range(r0, r1, k * 2 + 2, im, i1);\n return (ll)v0 * v1 % mod;\n }\n T mul_range(int r0, int r1) { return mul_range(r0, r1, 0, 0, e2); }\n};\n\n/* global variables */\n\nbool primes[MAX_N + 1];\nint ds[MAX_M];\nSegTreeMul st;\n\n/* subroutines */\n\nint gen_primes(int maxp, vi &pnums) {\n fill(primes, primes + maxp + 1, true);\n primes[0] = primes[1] = false;\n\n int p;\n for (p = 2; p * p <= maxp; p++)\n if (primes[p]) {\n pnums.push_back(p);\n for (int q = p * p; q <= maxp; q += p) primes[q] = false;\n }\n for (; p <= maxp; p++)\n if (primes[p]) pnums.push_back(p);\n return (int)pnums.size();\n}\n\nbool prime_decomp(int n, vi &pnums, vpii& pds) {\n pds.clear();\n\n int pn = pnums.size();\n for (int i = 0; i < pn; i++) {\n int pi = pnums[i];\n if (pi * pi > n) {\n if (n > 1) pds.push_back(pii(n, 1));\n return true;\n }\n\n if (n % pi == 0) {\n int fi = 0;\n while (n % pi == 0) n /= pi, fi++;\n pds.push_back(pii(pi, fi));\n }\n }\n return false;\n}\n\nint powi(int a, int n) { // a^n\n int pm = 1;\n while (n > 0) {\n if (n & 1) pm *= a;\n a *= a;\n n >>= 1;\n }\n return pm;\n}\n\nint phi(int n, vi &pnums) {\n vpii pds;\n prime_decomp(n, pnums, pds);\n\n int r = 1;\n for (auto pd: pds)\n r *= powi(pd.first, pd.second) - powi(pd.first, pd.second - 1);\n return r;\n}\n\nint powmod(int a, int n, int mod) { // a^n % MOD\n int pm = 1;\n while (n > 0) {\n if (n & 1) pm = (ll)pm * a % mod;\n a = (ll)a * a % mod;\n n >>= 1;\n }\n return pm;\n}\n\n/* main */\n\nint main() {\n vi pnums;\n gen_primes(MAX_N, pnums);\n\n int n, m, qn;\n scanf(\"%d%d%d\", &n, &m, &qn);\n MI::MOD = n + 1;\n\n int ph = phi(n, pnums);\n //printf(\"phi(%d) = %d\\n\", n, ph);\n\n for (int i = 0; i < m; i++) scanf(\"%d\", ds + i);\n\n st.init(m * 2, 1, n);\n for (int i = 0; i < m; i++)\n st.seti(i, ds[i]), st.seti(m + i, ds[i]);\n st.setall();\n\n int dm = st.mul_range(0, m);\n\n while (qn--) {\n int x, y, z;\n scanf(\"%d%d%d\", &x, &y, &z), y--;\n //printf(\"x=%d, y=%d, z=%d\\n\", x, y, z);\n\n int zq = z / m, zr = z % m;\n int e = (ll)powmod(dm, zq, n) * st.mul_range(y, y + zr) % n;\n\n // t^e=x, if e*f=1(%n) -> t=x^f\n // e*f=1(%n) -> f=1/e(%n)\n int f = powmod(e, ph - 1, n);\n //printf(\" t^%d=%d -> f=%d\\n\", e, x, f);\n\n mi t = mi(x).pow(f);\n printf(\"%d\\n\", t.v);\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":18340,"score_of_the_acc":-0.1728,"final_rank":10},{"submission_id":"aoj_3154_4883389","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\nll extgcd(ll a, ll b, ll& x, ll& y) {\n ll g = a;\n x = 1;\n y = 0;\n if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;\n return g;\n}\n\n// a^(-1) mod m\n// aとmは互いに素でなければならない\nll mod_inverse(ll a, ll m) {\n assert(__gcd(a, m) == 1);\n ll x, y;\n ll g = extgcd(a, m, x, y);\n while (x < 0) x += m;\n return x % m;\n}\n\nll mod_pow(ll x, ll n, ll mod) {\n ll ret = 1;\n while (n) {\n if (n & 1) (ret *= x) %= mod;\n n >>= 1;\n (x *= x) %= mod;\n }\n return ret;\n}\n\nconst int N = 10000000;\nint n, m, q;\nint d[N];\n\nconst int B = 250;\nll v[B][B];\nll b[B];\n\nll calc(int s, int e) {\n int sb = s / B, eb = e / B;\n ll ret = 1;\n if (s <= e) {\n if (sb == eb) {\n for (int i = s; i <= e; ++i) (ret *= v[sb][i % B]) %= n;\n } else {\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\n for (int i = sb + 1; i < eb; ++i) (ret *= b[i]) %= n;\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\n }\n } else {\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\n for (int i = sb + 1; i < B; ++i) (ret *= b[i]) %= n;\n for (int i = 0; i < eb; ++i) (ret *= b[i]) %= n;\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\n }\n return ret;\n}\n\nint main() {\n rep(i, B) rep(j, B) v[i][j] = 1;\n\n scanf(\" %d %d %d\", &n, &m, &q);\n rep(i, m) {\n scanf(\" %d\", &d[i]);\n v[i / B][i % B] = d[i];\n }\n\n ll prod_n = 1;\n rep(i, m)(prod_n *= d[i]) %= n;\n\n rep(i, B) {\n b[i] = 1;\n rep(j, B)(b[i] *= v[i][j]) %= n;\n }\n\n rep(qi, q) {\n int x, y, z;\n scanf(\" %d %d %d\", &x, &y, &z);\n\n --y;\n\n ll w = mod_pow(prod_n, z / m, n);\n z %= m;\n if (z) (w *= calc(y, (y + z - 1) % m)) %= n;\n\n // t^w = x (mod n+1)\n // x^r = tとして、 x = x^(r*w) (mod n+1)\n // r*w = 1 (mod n)\n ll r = mod_inverse(w, n);\n ll t = mod_pow(x, r, n + 1);\n printf(\"%lld\\n\", t);\n }\n return 0;\n}","accuracy":1,"time_ms":340,"memory_kb":3900,"score_of_the_acc":-0.1612,"final_rank":9},{"submission_id":"aoj_3154_4883384","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\nll extgcd(ll a, ll b, ll& x, ll& y) {\n ll g = a;\n x = 1;\n y = 0;\n if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;\n return g;\n}\n\n// a^(-1) mod m\n// aとmは互いに素でなければならない\nll mod_inverse(ll a, ll m) {\n assert(__gcd(a, m) == 1);\n ll x, y;\n ll g = extgcd(a, m, x, y);\n while (x < 0) x += m;\n return x % m;\n}\n\nll mod_pow(ll x, ll n, ll mod) {\n ll ret = 1;\n while (n) {\n if (n & 1) (ret *= x) %= mod;\n n >>= 1;\n (x *= x) %= mod;\n }\n return ret;\n}\n\nconst int N = 10000000;\nint n, m, q;\nint d[N];\n\nconst int B = 3180;\nll v[B][B];\nll b[B];\n\nll calc(int s, int e) {\n int sb = s / B, eb = e / B;\n ll ret = 1;\n if (s < e) {\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\n for (int i = sb + 1; i < eb; ++i) (ret *= b[i]) %= n;\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\n } else {\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\n for (int i = sb + 1; i < B; ++i) (ret *= b[i]) %= n;\n for (int i = 0; i < eb; ++i) (ret *= b[i]) %= n;\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\n }\n return ret;\n}\n\nint main() {\n rep(i, B) rep(j, B) v[i][j] = 1;\n\n scanf(\" %d %d %d\", &n, &m, &q);\n rep(i, m) {\n scanf(\" %d\", &d[i]);\n v[i / B][i % B] = d[i];\n }\n\n ll prod_n = 1;\n rep(i, m)(prod_n *= d[i]) %= n;\n\n rep(i, B) {\n b[i] = 1;\n rep(j, B)(b[i] *= v[i][j]) %= n;\n }\n\n rep(qi, q) {\n int x, y, z;\n scanf(\" %d %d %d\", &x, &y, &z);\n\n --y;\n\n ll w = mod_pow(prod_n, z / m, n);\n z %= m;\n if (z) (w *= calc(y, (y + z - 1) % m)) %= n;\n\n // t^w = x (mod n+1)\n // x^r = tとして、 x = x^(r*w) (mod n+1)\n // r*w = 1 (mod n)\n ll r = mod_inverse(w, n);\n ll t = mod_pow(x, r, n + 1);\n printf(\"%lld\\n\", t);\n }\n return 0;\n}","accuracy":0.034482758620689655,"time_ms":150,"memory_kb":82236,"score_of_the_acc":-0.772,"final_rank":18},{"submission_id":"aoj_3154_4883383","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\nll extgcd(ll a, ll b, ll& x, ll& y) {\n ll g = a;\n x = 1;\n y = 0;\n if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;\n return g;\n}\n\n// a^(-1) mod m\n// aとmは互いに素でなければならない\nll mod_inverse(ll a, ll m) {\n assert(__gcd(a, m) == 1);\n ll x, y;\n ll g = extgcd(a, m, x, y);\n while (x < 0) x += m;\n return x % m;\n}\n\nll mod_pow(ll x, ll n, ll mod) {\n ll ret = 1;\n while (n) {\n if (n & 1) (ret *= x) %= mod;\n n >>= 1;\n (x *= x) %= mod;\n }\n return ret;\n}\n\nconst int N = 10000000;\nint n, m, q;\nint d[N];\n\nconst int B = 3180;\nll v[B][B];\nll b[B];\n\nll calc(int s, int e) {\n int sb = s / B, eb = e / B;\n ll ret = 1;\n if (s < e) {\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\n for (int i = sb + 1; i < eb; ++i) (ret *= b[i]) %= n;\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\n } else {\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\n for (int i = sb + 1; i < B; ++i) (ret *= b[i]) %= n;\n for (int i = 0; i < eb; ++i) (ret *= b[i]) %= n;\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\n }\n return ret;\n}\n\nint main() {\n rep(i, B) rep(j, B) v[i][j] = 1;\n\n scanf(\" %d %d %d\", &n, &m, &q);\n rep(i, m) {\n scanf(\" %d\", &d[i]);\n v[i / B][i % B] = d[i];\n }\n\n ll prod_n = 1;\n rep(i, m)(prod_n *= d[i]) %= n;\n\n rep(i, B) {\n b[i] = 1;\n rep(j, B)(b[i] *= v[i][j]) %= n;\n }\n\n rep(qi, q) {\n int x, y, z;\n scanf(\" %d %d %d\", &x, &y, &z);\n\n --y;\n\n ll w = mod_pow(prod_n, z / n, n);\n z %= n;\n if (z) (w *= calc(y, (y + z - 1) % m)) %= n;\n\n // t^w = x (mod n+1)\n // x^r = tとして、 x = x^(r*w) (mod n+1)\n // r*w = 1 (mod n)\n ll r = mod_inverse(w, n);\n ll t = mod_pow(x, r, n + 1);\n printf(\"%lld\\n\", t);\n }\n return 0;\n}","accuracy":0.034482758620689655,"time_ms":150,"memory_kb":82236,"score_of_the_acc":-0.772,"final_rank":18},{"submission_id":"aoj_3154_4883382","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\nll extgcd(ll a, ll b, ll& x, ll& y) {\n ll g = a;\n x = 1;\n y = 0;\n if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;\n return g;\n}\n\n// a^(-1) mod m\n// aとmは互いに素でなければならない\nll mod_inverse(ll a, ll m) {\n assert(__gcd(a, m) == 1);\n ll x, y;\n ll g = extgcd(a, m, x, y);\n while (x < 0) x += m;\n return x % m;\n}\n\nll mod_pow(ll x, ll n, ll mod) {\n ll ret = 1;\n while (n) {\n if (n & 1) (ret *= x) %= mod;\n n >>= 1;\n (x *= x) %= mod;\n }\n return ret;\n}\n\nconst int N = 10000000;\nint n, m, q;\nint d[N];\n\nconst int B = 3180;\nll v[B][B];\nll b[B];\n\nll calc(int s, int e) {\n int sb = s / B, eb = e / B;\n ll ret = 1;\n if (s < e) {\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\n for (int i = sb + 1; i < eb; ++i) (ret *= b[i]) %= n;\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\n } else {\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\n for (int i = sb + 1; i < B; ++i) (ret *= b[i]) %= n;\n for (int i = 0; i < eb; ++i) (ret *= b[i]) %= n;\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\n }\n return ret;\n}\n\nint main() {\n rep(i, B) rep(j, B) v[i][j] = 1;\n\n scanf(\" %d %d %d\", &n, &m, &q);\n rep(i, m) {\n scanf(\" %d\", &d[i]);\n v[i / B][i % B] = d[i];\n }\n\n ll prod_n = 1;\n rep(i, m)(prod_n *= d[i]) %= n;\n\n rep(i, B) {\n b[i] = 1;\n rep(j, B)(b[i] *= v[i][j]) %= n;\n }\n\n rep(qi, q) {\n int x, y, z;\n scanf(\" %d %d %d\", &x, &y, &z);\n\n --y;\n\n ll w = mod_pow(prod_n, z / n, n);\n z %= n;\n if (z) (w *= calc(y, (y + z - 1) % n)) %= n;\n\n // t^w = x (mod n+1)\n // x^r = tとして、 x = x^(r*w) (mod n+1)\n // r*w = 1 (mod n)\n ll r = mod_inverse(w, n);\n ll t = mod_pow(x, r, n + 1);\n printf(\"%lld\\n\", t);\n }\n return 0;\n}","accuracy":0.034482758620689655,"time_ms":150,"memory_kb":82264,"score_of_the_acc":-0.7722,"final_rank":20},{"submission_id":"aoj_3154_4865389","code_snippet":"#include <iostream>\n#include <vector>\n\n\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m < 2^31`\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace ac = atcoder;\n\nusing mint0 = ac::dynamic_modint<0>;\nusing mint1 = ac::dynamic_modint<1>;\n\nvoid solve() {\n int n, m, q;\n std::cin >> n >> m >> q;\n\n mint0::set_mod(n + 0);\n mint1::set_mod(n + 1);\n\n std::vector<mint0> prods(m + 1); // 累積積\n prods[0] = 1;\n for (int i = 1; i <= m; ++i) {\n int d;\n std::cin >> d;\n prods[i] = prods[i - 1] * d;\n }\n\n // [0, len)の積を返す\n auto getprod = [&](int len) {\n return prods[m].pow(len / m) * prods[len % m];\n };\n\n while (q--) {\n int x, y, z;\n std::cin >> x >> y >> z;\n --y;\n\n auto p = getprod(y + z) / getprod(y);\n std::cout << mint1(x).pow(p.inv().val()).val() << \"\\n\";\n }\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3500,"score_of_the_acc":-0.0049,"final_rank":1},{"submission_id":"aoj_3154_4861045","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// as + bt = GCD(a,b) a,b:const s,t:var(any)\n// return GCD(a,b)\nlong long extGCD(long long a, long long b, long long& s, long long& t) {\n s = 1, t = 0;\n long long u = 0, v = 1;\n while (b) {\n long long tmp = a / b;\n a -= b * tmp;\n s -= u * tmp;\n t -= v * tmp;\n swap(s, u);\n swap(t, v);\n swap(a, b);\n }\n return a;\n}\n// (mod)x+ay=1, calculate y -> a^-1 (mod m) (a,m : coprime)\nlong long calcinv(long long a, long long m) {\n long long s, t;\n extGCD(a, m, s, t);\n return (s + m) % m;\n}\n\nlong long mod_pow(long long base, int e, int mod) {\n long long res = 1;\n while (e) {\n if (e & 1) (res *= base) %= mod;\n (base *= base) %= mod;\n e >>= 1;\n }\n return res;\n}\n\nint n, m, q, all = 1;\nvector<int> mul;\n\nint main() {\n cin >> n >> m >> q;\n { // input and pre calc\n mul.assign(2 * m + 1, 1);\n for (int i = 1; i <= 2 * m; ++i) {\n if (i <= m) {\n cin >> mul[i];\n mul[i] = mul[i + m] = calcinv(mul[i], n);\n all = 1LL * all * mul[i] % n;\n }\n mul[i] = 1LL * mul[i - 1] * mul[i] % n;\n }\n }\n auto calc = [](int l, int r) {\n return 1LL * mul[r] * calcinv(mul[l], n) % n;\n };\n for (int i = 0; i < q; ++i) {\n int x, y, z, e;\n cin >> x >> y >> z;\n --y;\n e = 1LL * mod_pow(all, z / m, n) * calc(y, y + z % m) % n;\n cout << mod_pow(x, e, n + 1) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3548,"score_of_the_acc":-0.0398,"final_rank":2},{"submission_id":"aoj_3154_4861043","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// 0-indexed\ntemplate <class T>\nstruct SegmentTree {\n // a,b,c: T, e:T(unit)\n // abc = (ab)c = a(bc)\n // ae = ea = a\n typedef function<T(T, T)> F;\n int n;\n F f;\n T unit;\n vector<T> dat;\n SegmentTree(){};\n SegmentTree(int newn, F f, T t) : f(f), unit(t) { init(newn); }\n SegmentTree(const vector<T>& v, F f, T t) : f(f), unit(t) {\n int _n = v.size();\n init(v.size());\n for (int i = 0; i < _n; ++i) dat[n + i] = v[i];\n for (int i = n - 1; i; --i) dat[i] = f(dat[i << 1], dat[(i << 1) | 1]);\n }\n void init(int newn) {\n n = 1;\n while (n < newn) n <<= 1;\n dat.assign(n << 1, unit);\n }\n\n // \"go up\" process\n void update(int k, T newdata) {\n dat[k += n] = newdata;\n while (k >>= 1) {\n dat[k] = f(dat[(k << 1) | 0], dat[(k << 1) | 1]);\n }\n }\n // [a,b)\n T query(int a, int b) {\n T vl = unit, vr = unit;\n for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {\n if (l & 1) vl = f(vl, dat[l++]);\n if (r & 1) vr = f(dat[--r], vr);\n }\n return f(vl, vr);\n }\n};\n\n// as + bt = GCD(a,b) a,b:const s,t:var(any)\n// return GCD(a,b)\nlong long extGCD(long long a, long long b, long long& s, long long& t) {\n s = 1, t = 0;\n long long u = 0, v = 1;\n while (b) {\n long long tmp = a / b;\n a -= b * tmp;\n s -= u * tmp;\n t -= v * tmp;\n swap(s, u);\n swap(t, v);\n swap(a, b);\n }\n return a;\n}\n// (mod)x+ay=1, calculate y -> a^-1 (mod m) (a,m : coprime)\nlong long calcinv(long long a, long long m) {\n long long s, t;\n extGCD(a, m, s, t);\n return (s + m) % m;\n}\n\nlong long mod_pow(long long base, int e, int mod) {\n long long res = 1;\n while (e) {\n if (e & 1) (res *= base) %= mod;\n (base *= base) %= mod;\n e >>= 1;\n }\n return res;\n}\n\nint n, m, q, all = 1;\nSegmentTree<int> seg;\n\nint main() {\n cin >> n >> m >> q;\n { // input and pre calc\n auto f = [](int l, int r) { return 1LL * l * r % n; };\n vector<int> v(m, 0);\n for (auto& p : v) {\n cin >> p;\n p = calcinv(p, n);\n all = 1LL * all * p % n;\n }\n for (int i = 0; i < m; ++i) v.push_back(v[i]);\n seg = SegmentTree<int>(v, f, 1);\n }\n for (int i = 0; i < q; ++i) {\n int x, y, z, e;\n cin >> x >> y >> z;\n --y;\n e = 1LL * mod_pow(all, z / m, n) * seg.query(y, y + z % m) % n;\n cout << mod_pow(x, e, n + 1) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":4420,"score_of_the_acc":-0.0526,"final_rank":4},{"submission_id":"aoj_3154_4840907","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n#define ll long long\n#define FOR(i, a, b) for(ll i=(a);i<(b);++i)\n#define rep(i, n) FOR(i, 0, n)\n#define rep1(i, n) FOR(i, 1, n+1)\n#define rrep(i, n) for (ll i = ((int)(n)-1); i >= 0; --i)\n#define whole(x) (x).begin(),(x).end()\n#define rwhole(x) (x).rbegin(), (x).rend()\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())\n#define P pair<int, int>\n#define debug(var) cerr << \"[\" << #var << \"] \" << var << endl\ntemplate<typename T1, typename T2>\nbool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>\nbool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\n#define vi vector<int>\n#define vl vector<ll>\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se second\n#define pr(s) cout << (s) << '\\n'\nll mod = 1000000007;\nconst int dx[] = {-1,0,1,0};\nconst int dy[] = {0,-1,0,1};\nconst int INF = 1001001001;\nconst ll INFll = 1E+18;\n\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) {\n (x *= a.x) %= mod;\n return *this;\n }\n mint operator+(const mint a) const {\n mint res(*this);\n return res+=a;\n }\n mint operator-(const mint a) const {\n mint res(*this);\n return res-=a;\n }\n mint operator*(const mint a) const {\n mint res(*this);\n return res*=a;\n }\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n \n // for prime mod\n mint inv() const {\n return pow(mod-2);\n }\n mint& operator/=(const mint a) {\n return (*this) *= a.inv();\n }\n mint operator/(const mint a) const {\n mint res(*this);\n return res/=a;\n }\n};\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\n\nstruct combination {\n vector<mint> fact, ifact;\n combination(int n):fact(n+1),ifact(n+1) {\n assert(n < mod);\n fact[0] = 1;\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\n ifact[n] = fact[n].inv();\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\n }\n mint operator()(int n, int k) {\n if (k < 0 || k > n) return 0;\n return fact[n]*ifact[k]*ifact[n-k];\n }\n mint per(int n, int k) {\n return fact[n]*ifact[n-k];\n }\n};\n\n \n\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n ll n, m, q;\n cin >> n >> m >> q;\n mod = n;\n //if (n!=10 && n!=970) debug(n);\n //if (n!=10 && n!=970) debug(m);\n //if (n!=10 && n!=970) debug(q);\n vector<ll> d(m);\n rep(i, m) cin >> d[i];\n //if (n!=10 && n!=970) rep(i, m) cerr << i << \" \" << d[i] << endl;\n vector<mint> sd(m*2+1);\n sd[0] = 1;\n rep(i, 2*m) {\n sd[i+1] = sd[i]*d[i%m];\n /*\n if (n!=10 && n!=970) {\n cerr << \"i sd[i]\" << i+1 << \" \" << sd[i+1].x << endl;\n }\n */\n //debug(sd[i+1]);\n }\n vector<ll> inverse(n+1);\n inverse[1] = 1;\n vector<bool> used(n+1);\n for (ll i=2; i<=n; i++) {\n if (used[i]) continue;\n if (__gcd(n, i)==1) {\n ll now = i;\n vector<ll> v;\n while (1) {\n used[now] = true;\n v.pb(now);\n if (now==1) break;\n now *= i;\n now %= n;\n }\n rep(j, v.size()-1) {\n ll zz = lcm(j+1, (ll)v.size());\n ll yy = zz - (j+1);\n inverse[v[j]] = v[(yy-1+v.size())%v.size()];\n if (n!=10) {\n //debug(v[j]);\n //debug((yy-1)%n);\n //debug(inverse[v[j]]);\n }\n }\n //debug(n);\n }\n }\n \n //debug(num_prime);\n rep(qi, q) {\n ll x, y, z;\n cin >> x >> y >> z;\n y--;\n mint p = sd[m].pow(z/m);\n /*\n if (n!=10) {\n cerr << \"sd[m] p \" << sd[m].x << \" \" << p.x << endl;\n }\n */\n z %= m;\n p *= sd[y+z]*inverse[sd[y].x];\n /*\n if (n!=10) {\n cerr << \"y+z y sd[y+z] sd[y] p \" << y+z << \" \" << y << \" \" << sd[y+z].x << \" \" << sd[y].x << \" \" << p.x << endl;\n }\n */\n //debug(y+z); debug(y);\n //debug(sd[y+z]); debug(sd[y]);\n //debug(p);\n ll inv = inverse[p.x];\n //debug(inv);\n mod = n+1;\n mint ans = mint(x).pow(inv);\n pr(ans);\n mod = n;\n /*\n if (n!=10 && n!=970) {\n cerr << x << \" \" << y << \" \" << z << endl;\n cerr << ans << \" \" << p.x << endl;\n int pp = p.x;\n mod = n+1;\n cerr << ans.pow(p.x) << endl;\n mod = n;\n }\n */\n \n }\n return 0;\n}","accuracy":1,"time_ms":2050,"memory_kb":114716,"score_of_the_acc":-2,"final_rank":11},{"submission_id":"aoj_3154_4840860","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n////////////////////////////// Begin Macros\n\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define in(x, a, b) (a <= x and x < b)\n#define rep(i, N) for (int i = 0; i < (int)(N); i++)\n#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i--)\n#define rep1(i, N) for (int i = 1; i <= (int)(N); i++)\n#define rep1rev(i, N) for (int i = (int)(N); i >= 0; i--)\n#define forbe(i, b, e) for (int i = (b); i < (e); i++)\n#define forberev(i, b, e) for (int i = (e)-1; i >= (b); i--)\n#define forfl(i, f, l) for (int i = (f); i <= (l); i++)\n#define forflrev(i, f, l) for (int i = (l); i >= (f); i--)\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pil = pair<int, ll>;\nusing pli = pair<ll, int>;\nusing pll = pair<ll, ll>;\n\ntemplate <typename T>\nbool chmax(T &m, const T q)\n{\n if (m < q)\n {\n m = q;\n return true;\n }\n else\n return false;\n}\ntemplate <typename T>\nbool chmin(T &m, const T q)\n{\n if (m > q)\n {\n m = q;\n return true;\n }\n else\n return false;\n}\ntemplate <typename T1, typename T2>\npair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first + r.first, l.second + r.second}; }\ntemplate <typename T1, typename T2>\npair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first - r.first, l.second - r.second}; }\ntemplate <typename T>\npair<T, T> operator*(const pair<T, T> &l, const T &r) { return {l.first * r, l.second * r}; }\ntemplate <typename T>\npair<T, T> operator/(const pair<T, T> &l, const T &r) { return {l.first / r, l.second / r}; }\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &vec)\n{\n for (auto &v : vec)\n is >> v;\n return is;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &vec)\n{\n os << \"[\";\n for (auto v : vec)\n os << v << \",\";\n os << \"]\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const deque<T> &vec)\n{\n os << \"deq[\";\n for (auto v : vec)\n os << v << \",\";\n os << \"]\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const set<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const unordered_set<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const multiset<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const unordered_multiset<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &pa)\n{\n is >> pa.first >> pa.second;\n return is;\n}\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &pa)\n{\n os << \"(\" << pa.first << \",\" << pa.second << \")\";\n return os;\n}\ntemplate <typename... Ts>\nistream &operator>>(istream &is, tuple<Ts...> &theTuple)\n{\n apply([&is](Ts &... tupleArgs) { ((is >> tupleArgs), ...); }, theTuple);\n return is;\n}\ntemplate <typename... Ts>\nostream &operator<<(ostream &os, const tuple<Ts...> &theTuple)\n{\n apply([&os](const Ts &... tupleArgs) {\n os << '(';\n size_t n(0);\n ((os << tupleArgs << (++n < sizeof...(Ts) ? \",\" : \"\")), ...);\n os << ')';\n },\n theTuple);\n return os;\n}\ntemplate <typename TK, typename TV>\nostream &operator<<(ostream &os, const map<TK, TV> &mp)\n{\n os << \"{\";\n for (auto v : mp)\n os << v.first << \"=>\" << v.second << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename TK, typename TV>\nostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp)\n{\n os << \"{\";\n for (auto v : mp)\n os << v.first << \"=>\" << v.second << \",\";\n os << \"}\";\n return os;\n}\n\ntemplate <typename T>\nvoid reset(vector<T> &v, const T reset_to)\n{\n for (auto &x : v)\n x = reset_to;\n}\ninline int popcount(const unsigned int x) { return __builtin_popcount(x); }\n#define dbg(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \") \" << __FILE__ << endl;\n\nll nC2(ll n)\n{\n return n * (n - 1) / 2;\n}\n\nconst int intinf = numeric_limits<int>::max();\nconst ll llinf = numeric_limits<ll>::max();\nconst pii udlr[4] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\n\n////////////////////////////// End Macros\n\n// Modulo.h start----------------------------------------\n\n#include <vector>\n#include <iostream>\n#include <cassert>\n\nusing namespace std;\n\n// a x + b y = gcd(a, b)\nint extgcd(const int a, const int b, int &x, int &y)\n{\n // O(log max(a,b))\n int g = a;\n x = 1;\n y = 0;\n if (b != 0)\n g = extgcd(b, a % b, y, x), y -= (a / b) * x;\n return g;\n}\n\nint inv_mod(const int a, const int mod)\n{\n int x, y;\n if (extgcd(a, mod, x, y) == 1)\n return (x + mod) % mod;\n else // unsolvable\n return 0;\n}\n\nstruct Modint\n{\n static int mod;\n static bool mod_is_prime;\n long long value;\n Modint(long long value = 0LL) : value((value % mod + mod) % mod) {}\n inline Modint operator+() const { return *this; }\n inline Modint operator-() const { return Modint(-value); }\n inline Modint &operator+=(const Modint &rhs)\n {\n if ((value += rhs.value) >= mod)\n value -= mod;\n return *this;\n }\n inline Modint &operator-=(const Modint &rhs)\n {\n if ((value += mod - rhs.value) >= mod)\n value -= mod;\n return *this;\n }\n inline Modint &operator*=(const Modint &rhs)\n {\n (value *= rhs.value) %= mod;\n return *this;\n }\n Modint pow(long long k) const\n {\n assert(k >= 0);\n if (k == 0)\n return 1;\n Modint res = pow(k / 2);\n res *= res;\n if (k % 2 == 1)\n res *= *this;\n return res;\n }\n\n Modint inv() const\n {\n if (mod_is_prime)\n return pow(mod - 2);\n\n // value and mod are coprime\n long long a = value, b = mod, u = 1, v = 0;\n while (b)\n {\n long long t = a / b;\n a -= t * b;\n swap(a, b);\n u -= t * v;\n swap(u, v);\n }\n u %= mod;\n if (u < 0)\n u += mod;\n return u;\n }\n inline Modint &operator/=(const Modint &rhs) { return *this *= rhs.inv(); }\n};\nint Modint::mod = 1000000007;\nbool Modint::mod_is_prime = true;\nbool operator==(const Modint &lhs, const Modint &rhs) { return lhs.value == rhs.value; }\nbool operator!=(const Modint &lhs, const Modint &rhs) { return !(lhs == rhs); }\nModint operator+(const Modint &lhs, const Modint &rhs) { return Modint(lhs) += rhs; }\nModint operator-(const Modint &lhs, const Modint &rhs) { return Modint(lhs) -= rhs; }\nModint operator*(const Modint &lhs, const Modint &rhs) { return Modint(lhs) *= rhs; }\nModint operator/(const Modint &lhs, const Modint &rhs) { return Modint(lhs) /= rhs; }\nistream &operator>>(istream &lhs, Modint &rhs) { return lhs >> rhs.value; }\nostream &operator<<(ostream &lhs, const Modint &rhs) { return lhs << rhs.value; }\n\nstruct Combination\n{\n std::vector<Modint> fact, ifact;\n Combination(int n = 0) : fact(n + 1), ifact(n + 1)\n {\n assert(n >= 0);\n fact[0] = 1;\n for (int i = 1; i <= n; i++)\n fact[i] = fact[i - 1] * i;\n ifact[n] = fact[n].inv();\n for (int i = n; i >= 1; i--)\n ifact[i - 1] = ifact[i] * i;\n }\n Modint operator()(int n, int k)\n {\n assert(0 <= n and n <= (int)fact.size());\n if (!(0 <= k and k <= n))\n return 0;\n return fact[n] * ifact[k] * ifact[n - k];\n }\n};\n\n// Modulo.h end----------------------------------------------\n\nvoid solve()\n{\n int N, M, Q;\n cin >> N >> M >> Q;\n vector<int> d(M);\n cin >> d;\n\n Modint::mod = N;\n Modint::mod_is_prime = false;\n vector<Modint> sd(2 * M + 1);\n sd[0] = 1;\n rep(i, 2 * M) sd[i + 1] = sd[i] * d[i % M];\n\n rep(_, Q)\n {\n int x, y, z;\n cin >> x >> y >> z;\n y--;\n\n Modint::mod = N;\n Modint::mod_is_prime = false;\n int q = z / M;\n int r = z % M;\n Modint a = sd[M].pow(q) * sd[y + r] / sd[y];\n auto b = a.inv().value;\n\n Modint::mod = N + 1;\n Modint::mod_is_prime = true;\n Modint t = ((Modint)(x)).pow(b);\n cout << t << endl;\n }\n}\n\nint main()\n{\n // cerr << \"start\" << endl;\n // srand(time(0));\n cout << fixed << setprecision(15);\n\n solve();\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3996,"score_of_the_acc":-0.0537,"final_rank":5},{"submission_id":"aoj_3154_4840226","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n#define ll long long\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\n#define rep(i, n) FOR(i, 0, n)\n#define rep1(i, n) FOR(i, 1, n+1)\n#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)\n#define whole(x) (x).begin(),(x).end()\n#define rwhole(x) (x).rbegin(), (x).rend()\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())\n#define P pair<int, int>\n#define debug(var) cerr << \"[\" << #var << \"] \" << var << endl\ntemplate<typename T1, typename T2>\nbool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>\nbool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\n#define vi vector<int>\n#define vl vector<ll>\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se second\n#define pr(s) cout << (s) << '\\n'\nll mod = 1000000007;\nconst int dx[] = {-1,0,1,0};\nconst int dy[] = {0,-1,0,1};\nconst int INF = 1001001001;\nconst ll INFll = 1E+18;\n\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) {\n (x *= a.x) %= mod;\n return *this;\n }\n mint operator+(const mint a) const {\n mint res(*this);\n return res+=a;\n }\n mint operator-(const mint a) const {\n mint res(*this);\n return res-=a;\n }\n mint operator*(const mint a) const {\n mint res(*this);\n return res*=a;\n }\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n \n // for prime mod\n mint inv() const {\n return pow(mod-2);\n }\n mint& operator/=(const mint a) {\n return (*this) *= a.inv();\n }\n mint operator/(const mint a) const {\n mint res(*this);\n return res/=a;\n }\n};\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\n\nstruct combination {\n vector<mint> fact, ifact;\n combination(int n):fact(n+1),ifact(n+1) {\n assert(n < mod);\n fact[0] = 1;\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\n ifact[n] = fact[n].inv();\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\n }\n mint operator()(int n, int k) {\n if (k < 0 || k > n) return 0;\n return fact[n]*ifact[k]*ifact[n-k];\n }\n mint per(int n, int k) {\n return fact[n]*ifact[n-k];\n }\n};\n\n \n\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int n, m, q;\n cin >> n >> m >> q;\n mod = n;\n //if (n!=10 && n!=970) debug(n);\n //if (n!=10 && n!=970) debug(m);\n //if (n!=10 && n!=970) debug(q);\n vector<int> d(m);\n rep(i, m) cin >> d[i];\n //if (n!=10 && n!=970) rep(i, m) cerr << i << \" \" << d[i] << endl;\n vector<mint> sd(2*m+1);\n sd[0] = 1;\n rep(i, 2*m) {\n sd[i+1] = sd[i]*d[i%m];\n /*\n if (n!=10 && n!=970) {\n cerr << \"i sd[i]\" << i+1 << \" \" << sd[i+1].x << endl;\n }\n */\n //debug(sd[i+1]);\n }\n vector<int> inverse(n+1);\n inverse[1] = 1;\n vector<bool> used(n+1);\n for (int i=2; i<=n; i++) {\n if (used[i]) continue;\n if (__gcd(n, i)==1) {\n ll now = i;\n vector<int> v;\n while (1) {\n used[now] = true;\n v.pb(now);\n if (now==1) break;\n now *= i;\n now %= n;\n }\n rep(j, v.size()-1) {\n ll zz = lcm(j+1, (int)v.size());\n ll yy = zz - (j+1);\n inverse[v[j]] = v[(yy-1+v.size())%v.size()];\n if (n!=10) {\n //debug(v[j]);\n //debug((yy-1)%n);\n //debug(inverse[v[j]]);\n }\n }\n //debug(n);\n }\n }\n \n //debug(num_prime);\n rep(qi, q) {\n int x, y, z;\n cin >> x >> y >> z;\n y--;\n mint p = sd[m].pow(z/m);\n /*\n if (n!=10) {\n cerr << \"sd[m] p \" << sd[m].x << \" \" << p.x << endl;\n }\n */\n z %= m;\n p *= sd[y+z]*inverse[sd[y].x];\n /*\n if (n!=10) {\n cerr << \"y+z y sd[y+z] sd[y] p \" << y+z << \" \" << y << \" \" << sd[y+z].x << \" \" << sd[y].x << \" \" << p.x << endl;\n }\n */\n //debug(y+z); debug(y);\n //debug(sd[y+z]); debug(sd[y]);\n //debug(p);\n int inv = inverse[p.x];\n //debug(inv);\n mod = n+1;\n mint ans = mint(x).pow(inv);\n pr(ans);\n mod = n;\n /*\n if (n!=10 && n!=970) {\n cerr << x << \" \" << y << \" \" << z << endl;\n cerr << ans << \" \" << p.x << endl;\n int pp = p.x;\n mod = n+1;\n cerr << ans.pow(p.x) << endl;\n mod = n;\n }\n */\n \n }\n return 0;\n}","accuracy":0.3103448275862069,"time_ms":1420,"memory_kb":46712,"score_of_the_acc":-1.0782,"final_rank":12},{"submission_id":"aoj_3154_4839264","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n\ntypedef long long ll;\n\nconst int MAX = 10000000;\nint MOD;\n\nlong long extGCD(long long a, long long b, long long &x, long long &y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n long long d = extGCD(b, a%b, y, x);\n y -= a / b * x;\n return d;\n}\n\ninline long long mod(long long a, long long m=MOD) {\n return (a % m + m) % m;\n}\n\nlong long modinv(long long a, long long m=MOD) {\n long long x, y;\n extGCD(a, m, x, y);\n return mod(x, m);\n}\n\n//Nの剰余でのpow\nll modpow(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow(n, k-1)*n % MOD;\n }\n else{\n ll temp = modpow(n, k/2);\n return temp*temp % MOD;\n }\n}\n\n//N+1の剰余でのpow\nll modpow2(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow2(n, k-1)*n % (MOD+1);\n }\n else{\n ll temp = modpow2(n, k/2);\n return temp*temp % (MOD+1);\n }\n}\n\nint main(void){\n //A[y-1]*A[y]*...*A[y+z-1] = aとすると,\n //pow(t, a) = x かつ a は gcd(a, N) = 1 より剰余環Z/NZ上で乗法逆元が存在するので pow(x, a^(-1)) が唯一の答え\n int N, M, Q; cin >> N >> M >> Q;\n MOD = N;\n vector<ll> A(M);\n rep(i, M){\n ll a; cin >> a;\n A[i] = a;\n }\n vector<ll> acc_left(M*2+1, 1); //acc_left[i]: A[0]~A[i-1]までの積 (mod N)\n for(int i = 1; i <= M*2; i++){\n acc_left[i] = acc_left[i-1]*A[(i-1) % M] % N;\n } \n\n vector<ll> ans;\n rep(i, Q){\n ll x, y, z; cin >> x >> y >> z;\n //A[y-1]*A[y]*...*A[y-1+part-1]を計算\n ll whole = (z - (z % M)) / M; //鍵を完全に周回する回数\n ll part = z - whole*M; //端数\n ll acc = modpow(acc_left[M], whole);\n \n acc = (acc * (acc_left[y-1+part] * modinv(acc_left[y-1]) % N)) % N;\n ans.push_back(modpow2(x, modinv(acc)));\n }\n rep(i, Q) cout << ans[i] << endl;\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":4760,"score_of_the_acc":-0.0606,"final_rank":7},{"submission_id":"aoj_3154_4839207","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n\ntypedef long long ll;\n\nconst int MAX = 10000000;\nint MOD;\n\nlong long inv[MAX];\n\n// テーブルを作る前処理\nvoid COMinit() {\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n }\n}\n\n//Nの剰余でのpow\nll modpow(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow(n, k-1)*n % MOD;\n }\n else{\n ll temp = modpow(n, k/2);\n return temp*temp % MOD;\n }\n}\n\n//N+1の剰余でのpow\nll modpow2(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow2(n, k-1)*n % (MOD+1);\n }\n else{\n ll temp = modpow2(n, k/2);\n return temp*temp % (MOD+1);\n }\n}\n\nint main(void){\n //A[y-1]*A[y]*...*A[y+z-1] = aとすると,\n //pow(t, a) = x かつ a は gcd(a, N) = 1 より剰余環Z/NZ上で乗法逆元が存在するので pow(x, a^(-1)) が唯一の答え\n int N, M, Q; cin >> N >> M >> Q;\n MOD = N;\n COMinit();\n vector<ll> A(M);\n rep(i, M){\n ll a; cin >> a;\n A[i] = a;\n }\n vector<ll> acc_left(M*2+1, 1); //acc_left[i]: A[0]~A[i-1]までの積 (mod N)\n for(int i = 1; i <= M*2; i++){\n acc_left[i] = acc_left[i-1]*A[(i-1) % M] % N;\n } \n\n vector<ll> ans;\n rep(i, Q){\n ll x, y, z; cin >> x >> y >> z;\n //A[y-1]*A[y]*...*A[y-1+part-1]を計算\n ll whole = (z - (z % M)) / M; //鍵を完全に周回する回数\n ll part = z - whole*M; //端数\n ll acc = modpow(acc_left[M], whole);\n acc = (acc * (acc_left[y-1+part] * inv[acc_left[y-1]] % N)) % N;\n ans.push_back(modpow2(x, inv[acc]));\n }\n rep(i, Q) cout << ans[i] << endl;\n return 0;\n}","accuracy":0.034482758620689655,"time_ms":90,"memory_kb":81572,"score_of_the_acc":-0.7365,"final_rank":16},{"submission_id":"aoj_3154_4839138","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n\ntypedef long long ll;\n\nconst int MAX = 10000000;\nint MOD;\n\nlong long fac[MAX], finv[MAX], inv[MAX];\n\n// テーブルを作る前処理\nvoid COMinit() {\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n }\n}\n\n//Nの剰余でのpow\nll modpow(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow(n, k-1)*n % MOD;\n }\n else{\n ll temp = modpow(n, k/2);\n return temp*temp % MOD;\n }\n}\n\n//N+1の剰余でのpow\nll modpow2(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow2(n, k-1)*n % (MOD+1);\n }\n else{\n ll temp = modpow2(n, k/2);\n return temp*temp % (MOD+1);\n }\n}\n\nint main(void){\n //A[y-1]*A[y]*...*A[y+z-1] = aとすると,\n //pow(t, a) = x かつ a は gcd(a, N) = 1 より剰余環Z/NZ上で乗法逆元が存在するので pow(x, a^(-1)) が唯一の答え\n int N, M, Q; cin >> N >> M >> Q;\n MOD = N;\n COMinit();\n vector<ll> Ainv(M);\n rep(i, M){\n ll a; cin >> a;\n Ainv[i] = inv[a];\n }\n vector<ll> acc_left(M*2+1, 1); //acc_left[i]: Ainv[0]~Ainv[i-1]までの積 (mod N)\n for(int i = 1; i <= M*2; i++){\n acc_left[i] = acc_left[i-1]*Ainv[(i-1) % M] % MOD;\n } \n\n vector<ll> ans;\n rep(i, Q){\n ll x, y, z; cin >> x >> y >> z;\n //Ainv[y-1]*Ainv[y]*...*Ainv[y-1+part-1]を計算\n ll whole = (z - (z % M)) / M; //鍵を完全に周回する回数\n ll part = z - whole*M; //端数\n ll acc = modpow(acc_left[M], whole);\n acc = (acc * (acc_left[y-1+part] * inv[acc_left[y-1]] % MOD)) % MOD;\n //ll acc = 1;\n //for(int i = y-1, cnt = 0; cnt < z; i = (i+1) % M, cnt++) acc = acc*Ainv[i] % N; これでもダメ\n ans.push_back(modpow2(x, acc));\n }\n rep(i, Q) cout << ans[i] << endl;\n return 0;\n}","accuracy":0.034482758620689655,"time_ms":110,"memory_kb":81312,"score_of_the_acc":-0.744,"final_rank":17},{"submission_id":"aoj_3154_4839060","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n\ntypedef long long ll;\n\nconst int MAX = 1000000;\nint MOD;\n\nlong long fac[MAX], finv[MAX], inv[MAX];\n\n// テーブルを作る前処理\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n\n//Nの剰余でのpow\nll modpow(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow(n, k-1)*n % MOD;\n }\n else{\n ll temp = modpow(n, k/2);\n return temp*temp % MOD;\n }\n}\n\n//N+1の剰余でのpow\nll modpow2(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow2(n, k-1)*n % (MOD+1);\n }\n else{\n ll temp = modpow2(n, k/2);\n return temp*temp % (MOD+1);\n }\n}\n\n//これを使うときにはCOMinit();を忘れずに\n\nint main(void){\n int N, M, Q; cin >> N >> M >> Q;\n MOD = N;\n COMinit();\n vector<ll> Ainv(M);\n rep(i, M){\n ll a; cin >> a;\n Ainv[i] = inv[a];\n }\n vector<ll> acc_left(M*2+1, 1);\n for(int i = 1; i <= M*2; i++){\n acc_left[i] = acc_left[i-1]*Ainv[(i-1) % M] % MOD;\n } \n vector<ll> ans;\n rep(i, Q){\n ll x, y, z; cin >> x >> y >> z;\n //Ainv[y-1]*Ainv[y]*...*Ainv[y-1+part-1]を計算\n ll whole = (z - (z % M)) / M; //巻物を完全に周回する回数\n ll part = z - whole*M; //端数\n //ll acc = modpow(acc_left[M], whole);\n ll acc = 1;\n for(int i = y-1, cnt = 0; cnt < z; i = (i+1) % M, cnt++) acc = acc*Ainv[i] % N;\n //acc = (acc * (acc_left[y-1+part] * inv[acc_left[y-1]] % MOD)) % MOD;\n ans.push_back(modpow2(x, acc));\n }\n rep(i, Q) cout << ans[i] << endl;\n return 0;\n}","accuracy":0.034482758620689655,"time_ms":30,"memory_kb":26524,"score_of_the_acc":-0.2119,"final_rank":14},{"submission_id":"aoj_3154_4838992","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n\ntypedef long long ll;\n\nconst int MAX = 1000000;\nint MOD;\n\nlong long fac[MAX], finv[MAX], inv[MAX];\n\n// テーブルを作る前処理\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n\n//Nの剰余でのpow\nll modpow(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow(n, k-1)*n % MOD;\n }\n else{\n ll temp = modpow(n, k/2);\n return temp*temp % MOD;\n }\n}\n\n//N+1の剰余でのpow\nll modpow2(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow2(n, k-1)*n % (MOD+1);\n }\n else{\n ll temp = modpow2(n, k/2);\n return temp*temp % (MOD+1);\n }\n}\n\n//これを使うときにはCOMinit();を忘れずに\n\nint main(void){\n int N, M, Q; cin >> N >> M >> Q;\n MOD = N;\n COMinit();\n vector<ll> Ainv(M);\n rep(i, M){\n ll a; cin >> a;\n Ainv[i] = inv[a];\n }\n vector<ll> acc_left(M*2+1, 1);\n for(int i = 1; i <= M*2; i++){\n acc_left[i] = acc_left[i-1]*Ainv[(i-1) % M] % MOD;\n } \n vector<ll> ans;\n rep(i, Q){\n ll x, y, z; cin >> x >> y >> z;\n //Ainv[y-1]*Ainv[y]*...*Ainv[y-1+part-1]を計算\n ll whole = (z - (z % M)) / M; //巻物を完全に周回する回数\n ll part = z - whole*M; //端数\n //ll acc = modpow(acc_left[M], whole);\n ll acc = 1;\n for(int i = y-1, cnt = 0; cnt < z; i = (i+1) % M, cnt++) acc = acc*Ainv[i] % M;\n //acc = (acc * (acc_left[y-1+part] * inv[acc_left[y-1]] % MOD)) % MOD;\n ans.push_back(modpow2(x, acc));\n }\n rep(i, Q) cout << ans[i] << endl;\n return 0;\n}","accuracy":0.034482758620689655,"time_ms":30,"memory_kb":26620,"score_of_the_acc":-0.2128,"final_rank":15},{"submission_id":"aoj_3154_4838848","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n\ntypedef long long ll;\n\nconst int MAX = 1000000;\nint MOD;\n\nlong long fac[MAX], finv[MAX], inv[MAX];\n\n// テーブルを作る前処理\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n\nll modpow(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow(n, k-1)*n % MOD;\n }\n else{\n ll temp = modpow(n, k/2);\n return temp*temp % MOD;\n }\n}\n\nll modpow2(ll n, ll k){\n if(k == 0) return 1;\n if(k%2){\n return modpow2(n, k-1)*n % (MOD+1);\n }\n else{\n ll temp = modpow2(n, k/2);\n return temp*temp % (MOD+1);\n }\n}\n\n//これを使うときにはCOMinit();を忘れずに\n\nint main(void){\n int N, M, Q; cin >> N >> M >> Q;\n MOD = N;\n COMinit();\n vector<ll> Ainv(M);\n rep(i, M){\n ll a; cin >> a;\n Ainv[i] = inv[a];\n }\n vector<ll> acc_left(M*2+1, 1);\n for(int i = 1; i <= M*2; i++){\n acc_left[i] = acc_left[i-1]*Ainv[(i-1) % M] % MOD;\n } \n vector<ll> ans;\n rep(i, Q){\n ll x, y, z; cin >> x >> y >> z;\n //Ainv[y-1]*Ainv[y]*...*Ainv[y+z-2]を計算\n ll whole = (z - (z % M)) / M; //巻物を完全に周回する回数\n ll part = z - whole*M; //端数\n ll acc = modpow(acc_left[M], whole);\n acc = (acc * (acc_left[y-1+part] * inv[acc_left[y-1]] % MOD)) % MOD;\n ans.push_back(modpow2(x, acc));\n }\n rep(i, Q) cout << ans[i] << endl;\n return 0;\n}","accuracy":0.034482758620689655,"time_ms":20,"memory_kb":26776,"score_of_the_acc":-0.2093,"final_rank":13},{"submission_id":"aoj_3154_4837302","code_snippet":"#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <set>\n#include <iomanip>\n#include <queue>\n#include <string>\n#include <map>\n#include <fstream>\n#include <cassert>\n#include <stack>\n#include <climits>\n#include <array>\n#include <unordered_set>\n#include <unordered_map>\n#include <memory>\n#include <functional>\n#include <cfloat>\n#include <numeric>\nlong long int power(const long long int base, const int exp, const long long int mod) {\n\tswitch (exp) {\n\tcase 0: return 1;\n\tcase 1: return base % mod;\n\tdefault: return power(base * base % mod, exp >> 1, mod) * power(base, exp & 1, mod) % mod;\n\t}\n}\nstd::pair<long long int, long long int> gcd_pair(const long long int a, const long long int b) {\n\tlong long int ax{ 1 }, bx{ 0 }, ay{ 0 }, by{ 1 };\n\twhile (a * ay + b * by != 0) {\n\t\tconst auto n = a * ax + b * bx;\n\t\tconst auto m = a * ay + b * by;\n\t\tconst auto q = n / m;\n\t\tconst auto ar = (ax - q * ay) % b;\n\t\tconst auto br = (bx - q * by) % a;\n\t\tax = ay;\n\t\tbx = by;\n\t\tay = ar;\n\t\tby = br;\n\t}\n\tif (ax < 0) {\n\t\tax += b;\n\t\tbx -= a;\n\t}\n\treturn std::make_pair(ax, by);\n}\nlong long int inverse(const long long int base, const long long int mod) {\n\treturn gcd_pair(base, mod).first;\n}\nint main() {\n\tint n, m, q; std::cin >> n >> m >> q;\n\tstd::vector<long long int> keys(m), product{ 1 };\n\tfor (auto& d : keys) std::cin >> d;\n\tfor (const auto d : keys) {\n\t\tproduct.push_back(product.back() * d % n);\n\t}\n\tfor (const auto d : keys) {\n\t\tproduct.push_back(product.back() * d % n);\n\t}\n\tconst auto all_key = std::accumulate(keys.begin(), keys.end(), 1LL, [n](const long long int acc, const long long int d) {return d * acc % n; });\n\tfor (auto i = 0; i < q; ++i) {\n\t\tint x, y, z; std::cin >> x >> y >> z; --y;\n\t\tconst auto key = power(all_key, z / m, n) * product[y + z % m] % n * inverse(product[y], n) % n;\n\t\tstd::cout << power(x, inverse(key, n), n + 1) << '\\n';\n\t}\n}","accuracy":1,"time_ms":140,"memory_kb":4508,"score_of_the_acc":-0.0682,"final_rank":8},{"submission_id":"aoj_3154_4836057","code_snippet":"#include <bits/stdc++.h>\n//#include <chrono>\n//#pragma GCC optimize(\"Ofast\")\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\n#define Rrep(i,n) Rreps(i,n,0)\n#define ALL(a) a.begin(), a.end()\n#define fi first\n#define se second\ntypedef long long ll;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nll N,M,H,W,Q,K,A,B;\nstring S;\ntypedef pair<ll, ll> P;\nconst ll INF = (1LL<<60);\n\nclass mint {\npublic:\n ll x;\n static ll mod;\n static unsigned long long mod_plus;\n static bool prime;\n\n static void set_mod(ll _mod, bool _prime = false) {\n mint::mod = _mod;\n mint::mod_plus = (LLONG_MAX / mod) * mod;\n mint::prime = _prime;\n }\n\n mint() { x = 0; }\n\n mint(ll _x) : x(_x < 0 ? ((_x += mod_plus) < 0 ? _x + mod_plus : _x) : _x){\n if(x >= mod) x %= mod;\n }\n\n mint operator-() {\n return x == 0 ? 0 : mod - x;\n }\n\n mint &operator+=(const mint &a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n\n mint operator+(const mint &a) const {\n return mint(*this) += a;\n }\n\n mint &operator-=(const mint &a) {\n if ((x -= a.x) < 0) x += mod;\n return *this;\n }\n\n mint operator-(const mint &a) const {\n return mint(*this) -= a;\n }\n\n mint &operator*=(const mint &a) {\n (x *= a.x) %= mod;\n return *this;\n }\n\n mint operator*(const mint &a) const {\n return mint(*this) *= a;\n }\n\n mint pow(unsigned long long pw) const {\n mint res(1), comp(*this);\n while (pw) {\n if (pw & 1) res *= comp;\n comp *= comp;\n pw >>= 1;\n }\n return res;\n }\n\n //modと互いに素な数aなら可能\n mint inv() const {\n if(prime){\n return mint(*this).pow(mod - 2);\n }else {\n // return p = (s.x, s.y) : a * p.fi + b * p.se = gcd(a, b);\n // 不要なのでxは省略\n ll su = mod, sy = 0, tu = x, ty = 1;\n while (tu != 0) {\n ll temp = su / tu;\n su -= tu * temp;\n sy -= ty * temp;\n swap(su, tu);\n swap(sy, ty);\n }\n return sy;\n }\n }\n\n mint &operator/=(const mint &a) {\n (x *= a.inv().x) %= mod;\n return *this;\n }\n\n mint operator/(const mint &a) const {\n mint res(*this);\n return res /= a;\n }\n};\nostream& operator<<(ostream& os, const mint& a){\n os << a.x;\n return os;\n}\nlong long mint::mod;\nunsigned long long mint::mod_plus;\nbool mint::prime;\nusing vm = vector<mint>;\n\nmint find_mul(int y, int z, vm &d){\n mint res(1);\n res *= mint(d[M]).pow(z / M);\n z %= M;\n res *= d[y + z - 1];\n res /= d[y - 1];\n return res;\n}\n\nll temp_pow(int x, mint _pw){\n ll pw = _pw.x, res(1), dbl(x);\n while(pw){\n if(pw&1) (res *= dbl) %= N + 1;\n (dbl *= dbl) %= N + 1;\n pw >>= 1;\n }\n return res;\n}\n\nint main() {\n cin>>N>>M>>Q;\n mint::set_mod(N, false);\n vm d(M + 1, 1);\n rep(i, M) cin>>d[i + 1].x;\n rep(i, M) d.push_back(d[i + 1]);\n rep(i, M * 2) d[i + 1] *= d[i];\n rep(_, Q){\n int x, y, z;\n cin>>x>>y>>z;\n mint mul = find_mul(y, z, d);\n cout<<temp_pow(x, mul.inv())<<endl;\n }\n}","accuracy":1,"time_ms":130,"memory_kb":3600,"score_of_the_acc":-0.0551,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_3154_9741089\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\ntypedef long long int ll;\\n\\nll mod_inv(ll a,ll p){\\n\\tll b=p,x=1LL,y=0LL;\\n\\twhile(b){\\n\\t\\tll t=a/b;\\n\\t\\ta-=t*b; swap(a,b);\\n\\t\\tx-=t*y; swap(x,y);\\n\\t}\\n\\treturn (x%p+p)%p;\\n}\\n\\nll mod_pow(ll a,ll n,ll mod){\\n\\tll res=1LL;\\n\\twhile(n){\\n\\t\\tif(n%2)res=res*a%mod;\\n\\t\\ta=a*a%mod;\\n\\t\\tn>>=1;\\n\\t}\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tint n,m,q; cin >> n >> m >> q;\\n\\tvector<ll> d(m);\\n\\tfor(int i=0;i<m;i++){\\n\\t\\tcin >> d[i]; d[i]=mod_inv(d[i],n);\\n\\t}\\n\\tvector<ll> mul(2*m+1);\\n\\tmul[0]=1LL;\\n\\tfor(int i=0;i<2*m;i++){\\n\\t\\tmul[i+1]=mul[i]*d[i%m]%n;\\n\\t}\\n\\twhile(q--){\\n\\t\\tint x,y,z; cin >> x >> y >> z; y--;\\n\\t\\tll r=mod_pow(mul[m],z/m,n);\\n\\t\\tr=r*mul[y+z%m]%n*mod_inv(mul[y],n)%n;\\n\\t\\tcout << mod_pow(x,r,n+1) << \\\"\\\\n\\\";\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 4140,\n \"score_of_the_acc\": -0.0501,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3154_7009230\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3154.cc: Problem D: Treasure Mountains\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<algorithm>\\n#include<utility>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 9999990;\\nconst int MAX_M = 50000;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vpii;\\n\\nstruct MI {\\n static int MOD;\\n int v;\\n MI(): v() {}\\n MI(int _v): v(_v % MOD) {}\\n MI(long long _v): v(_v % MOD) {}\\n\\n MI operator+(const MI m) const { return MI(v + m.v); }\\n MI operator-(const MI m) const { return MI(v + MOD - m.v); }\\n MI operator*(const MI m) const { return MI((long long)v * m.v); }\\n\\n MI &operator+=(const MI m) { return (*this = *this + m); }\\n MI &operator-=(const MI m) { return (*this = *this - m); }\\n MI &operator*=(const MI m) { return (*this = *this * m); }\\n\\n bool operator==(const MI m) const { return v == m.v; }\\n bool operator!=(const MI m) const { return v != m.v; }\\n\\n MI pow(int n) const { // a^n % MOD\\n MI pm = 1, a = *this;\\n while (n > 0) {\\n if (n & 1) pm *= a;\\n a *= a;\\n n >>= 1;\\n }\\n return pm;\\n }\\n\\n MI inv() const { return pow(MOD - 2); }\\n MI operator/(const MI m) const { return *this * m.inv(); }\\n MI &operator/=(const MI m) { return (*this = *this / m); }\\n};\\n\\ntypedef MI mi;\\nint MI::MOD;\\n\\nstruct SegTreeMul {\\n typedef int T;\\n typedef long long ll;\\n int e2;\\n vector<T> nodes;\\n T defv, mod;\\n SegTreeMul() {}\\n\\n void init(int n, T _defv, T _mod) {\\n defv = _defv, mod = _mod;\\n for (e2 = 1; e2 < n; e2 <<= 1);\\n nodes.assign(e2 * 2, defv);\\n }\\n\\n T &geti(int i) { return nodes[e2 - 1 + i]; }\\n void seti(int i, T v) { geti(i) = v; }\\n\\n void setall() {\\n for (int j = e2 - 2; j >= 0; j--)\\n nodes[j] = (ll)nodes[j * 2 + 1] * nodes[j * 2 + 2] % mod;\\n }\\n\\n void set(int i, T v) {\\n int j = e2 - 1 + i;\\n nodes[j] = v;\\n while (j > 0) {\\n j = (j - 1) / 2;\\n nodes[j] = (ll)nodes[j * 2 + 1] * nodes[j * 2 + 2] % mod;\\n }\\n }\\n\\n T mul_range(int r0, int r1, int k, int i0, int i1) {\\n if (r1 <= i0 || i1 <= r0) return defv;\\n if (r0 <= i0 && i1 <= r1) return nodes[k];\\n\\n int im = (i0 + i1) / 2;\\n T v0 = mul_range(r0, r1, k * 2 + 1, i0, im);\\n T v1 = mul_range(r0, r1, k * 2 + 2, im, i1);\\n return (ll)v0 * v1 % mod;\\n }\\n T mul_range(int r0, int r1) { return mul_range(r0, r1, 0, 0, e2); }\\n};\\n\\n/* global variables */\\n\\nbool primes[MAX_N + 1];\\nint ds[MAX_M];\\nSegTreeMul st;\\n\\n/* subroutines */\\n\\nint gen_primes(int maxp, vi &pnums) {\\n fill(primes, primes + maxp + 1, true);\\n primes[0] = primes[1] = false;\\n\\n int p;\\n for (p = 2; p * p <= maxp; p++)\\n if (primes[p]) {\\n pnums.push_back(p);\\n for (int q = p * p; q <= maxp; q += p) primes[q] = false;\\n }\\n for (; p <= maxp; p++)\\n if (primes[p]) pnums.push_back(p);\\n return (int)pnums.size();\\n}\\n\\nbool prime_decomp(int n, vi &pnums, vpii& pds) {\\n pds.clear();\\n\\n int pn = pnums.size();\\n for (int i = 0; i < pn; i++) {\\n int pi = pnums[i];\\n if (pi * pi > n) {\\n if (n > 1) pds.push_back(pii(n, 1));\\n return true;\\n }\\n\\n if (n % pi == 0) {\\n int fi = 0;\\n while (n % pi == 0) n /= pi, fi++;\\n pds.push_back(pii(pi, fi));\\n }\\n }\\n return false;\\n}\\n\\nint powi(int a, int n) { // a^n\\n int pm = 1;\\n while (n > 0) {\\n if (n & 1) pm *= a;\\n a *= a;\\n n >>= 1;\\n }\\n return pm;\\n}\\n\\nint phi(int n, vi &pnums) {\\n vpii pds;\\n prime_decomp(n, pnums, pds);\\n\\n int r = 1;\\n for (auto pd: pds)\\n r *= powi(pd.first, pd.second) - powi(pd.first, pd.second - 1);\\n return r;\\n}\\n\\nint powmod(int a, int n, int mod) { // a^n % MOD\\n int pm = 1;\\n while (n > 0) {\\n if (n & 1) pm = (ll)pm * a % mod;\\n a = (ll)a * a % mod;\\n n >>= 1;\\n }\\n return pm;\\n}\\n\\n/* main */\\n\\nint main() {\\n vi pnums;\\n gen_primes(MAX_N, pnums);\\n\\n int n, m, qn;\\n scanf(\\\"%d%d%d\\\", &n, &m, &qn);\\n MI::MOD = n + 1;\\n\\n int ph = phi(n, pnums);\\n //printf(\\\"phi(%d) = %d\\\\n\\\", n, ph);\\n\\n for (int i = 0; i < m; i++) scanf(\\\"%d\\\", ds + i);\\n\\n st.init(m * 2, 1, n);\\n for (int i = 0; i < m; i++)\\n st.seti(i, ds[i]), st.seti(m + i, ds[i]);\\n st.setall();\\n\\n int dm = st.mul_range(0, m);\\n\\n while (qn--) {\\n int x, y, z;\\n scanf(\\\"%d%d%d\\\", &x, &y, &z), y--;\\n //printf(\\\"x=%d, y=%d, z=%d\\\\n\\\", x, y, z);\\n\\n int zq = z / m, zr = z % m;\\n int e = (ll)powmod(dm, zq, n) * st.mul_range(y, y + zr) % n;\\n\\n // t^e=x, if e*f=1(%n) -> t=x^f\\n // e*f=1(%n) -> f=1/e(%n)\\n int f = powmod(e, ph - 1, n);\\n //printf(\\\" t^%d=%d -> f=%d\\\\n\\\", e, x, f);\\n\\n mi t = mi(x).pow(f);\\n printf(\\\"%d\\\\n\\\", t.v);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 18340,\n \"score_of_the_acc\": -0.1728,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3154_4883389\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\nll extgcd(ll a, ll b, ll& x, ll& y) {\\n ll g = a;\\n x = 1;\\n y = 0;\\n if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;\\n return g;\\n}\\n\\n// a^(-1) mod m\\n// aとmは互いに素でなければならない\\nll mod_inverse(ll a, ll m) {\\n assert(__gcd(a, m) == 1);\\n ll x, y;\\n ll g = extgcd(a, m, x, y);\\n while (x < 0) x += m;\\n return x % m;\\n}\\n\\nll mod_pow(ll x, ll n, ll mod) {\\n ll ret = 1;\\n while (n) {\\n if (n & 1) (ret *= x) %= mod;\\n n >>= 1;\\n (x *= x) %= mod;\\n }\\n return ret;\\n}\\n\\nconst int N = 10000000;\\nint n, m, q;\\nint d[N];\\n\\nconst int B = 250;\\nll v[B][B];\\nll b[B];\\n\\nll calc(int s, int e) {\\n int sb = s / B, eb = e / B;\\n ll ret = 1;\\n if (s <= e) {\\n if (sb == eb) {\\n for (int i = s; i <= e; ++i) (ret *= v[sb][i % B]) %= n;\\n } else {\\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\\n for (int i = sb + 1; i < eb; ++i) (ret *= b[i]) %= n;\\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\\n }\\n } else {\\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\\n for (int i = sb + 1; i < B; ++i) (ret *= b[i]) %= n;\\n for (int i = 0; i < eb; ++i) (ret *= b[i]) %= n;\\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\\n }\\n return ret;\\n}\\n\\nint main() {\\n rep(i, B) rep(j, B) v[i][j] = 1;\\n\\n scanf(\\\" %d %d %d\\\", &n, &m, &q);\\n rep(i, m) {\\n scanf(\\\" %d\\\", &d[i]);\\n v[i / B][i % B] = d[i];\\n }\\n\\n ll prod_n = 1;\\n rep(i, m)(prod_n *= d[i]) %= n;\\n\\n rep(i, B) {\\n b[i] = 1;\\n rep(j, B)(b[i] *= v[i][j]) %= n;\\n }\\n\\n rep(qi, q) {\\n int x, y, z;\\n scanf(\\\" %d %d %d\\\", &x, &y, &z);\\n\\n --y;\\n\\n ll w = mod_pow(prod_n, z / m, n);\\n z %= m;\\n if (z) (w *= calc(y, (y + z - 1) % m)) %= n;\\n\\n // t^w = x (mod n+1)\\n // x^r = tとして、 x = x^(r*w) (mod n+1)\\n // r*w = 1 (mod n)\\n ll r = mod_inverse(w, n);\\n ll t = mod_pow(x, r, n + 1);\\n printf(\\\"%lld\\\\n\\\", t);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 3900,\n \"score_of_the_acc\": -0.1612,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3154_4883384\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\nll extgcd(ll a, ll b, ll& x, ll& y) {\\n ll g = a;\\n x = 1;\\n y = 0;\\n if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;\\n return g;\\n}\\n\\n// a^(-1) mod m\\n// aとmは互いに素でなければならない\\nll mod_inverse(ll a, ll m) {\\n assert(__gcd(a, m) == 1);\\n ll x, y;\\n ll g = extgcd(a, m, x, y);\\n while (x < 0) x += m;\\n return x % m;\\n}\\n\\nll mod_pow(ll x, ll n, ll mod) {\\n ll ret = 1;\\n while (n) {\\n if (n & 1) (ret *= x) %= mod;\\n n >>= 1;\\n (x *= x) %= mod;\\n }\\n return ret;\\n}\\n\\nconst int N = 10000000;\\nint n, m, q;\\nint d[N];\\n\\nconst int B = 3180;\\nll v[B][B];\\nll b[B];\\n\\nll calc(int s, int e) {\\n int sb = s / B, eb = e / B;\\n ll ret = 1;\\n if (s < e) {\\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\\n for (int i = sb + 1; i < eb; ++i) (ret *= b[i]) %= n;\\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\\n } else {\\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\\n for (int i = sb + 1; i < B; ++i) (ret *= b[i]) %= n;\\n for (int i = 0; i < eb; ++i) (ret *= b[i]) %= n;\\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\\n }\\n return ret;\\n}\\n\\nint main() {\\n rep(i, B) rep(j, B) v[i][j] = 1;\\n\\n scanf(\\\" %d %d %d\\\", &n, &m, &q);\\n rep(i, m) {\\n scanf(\\\" %d\\\", &d[i]);\\n v[i / B][i % B] = d[i];\\n }\\n\\n ll prod_n = 1;\\n rep(i, m)(prod_n *= d[i]) %= n;\\n\\n rep(i, B) {\\n b[i] = 1;\\n rep(j, B)(b[i] *= v[i][j]) %= n;\\n }\\n\\n rep(qi, q) {\\n int x, y, z;\\n scanf(\\\" %d %d %d\\\", &x, &y, &z);\\n\\n --y;\\n\\n ll w = mod_pow(prod_n, z / m, n);\\n z %= m;\\n if (z) (w *= calc(y, (y + z - 1) % m)) %= n;\\n\\n // t^w = x (mod n+1)\\n // x^r = tとして、 x = x^(r*w) (mod n+1)\\n // r*w = 1 (mod n)\\n ll r = mod_inverse(w, n);\\n ll t = mod_pow(x, r, n + 1);\\n printf(\\\"%lld\\\\n\\\", t);\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.034482758620689655,\n \"time_ms\": 150,\n \"memory_kb\": 82236,\n \"score_of_the_acc\": -0.772,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3154_4883383\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\nll extgcd(ll a, ll b, ll& x, ll& y) {\\n ll g = a;\\n x = 1;\\n y = 0;\\n if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;\\n return g;\\n}\\n\\n// a^(-1) mod m\\n// aとmは互いに素でなければならない\\nll mod_inverse(ll a, ll m) {\\n assert(__gcd(a, m) == 1);\\n ll x, y;\\n ll g = extgcd(a, m, x, y);\\n while (x < 0) x += m;\\n return x % m;\\n}\\n\\nll mod_pow(ll x, ll n, ll mod) {\\n ll ret = 1;\\n while (n) {\\n if (n & 1) (ret *= x) %= mod;\\n n >>= 1;\\n (x *= x) %= mod;\\n }\\n return ret;\\n}\\n\\nconst int N = 10000000;\\nint n, m, q;\\nint d[N];\\n\\nconst int B = 3180;\\nll v[B][B];\\nll b[B];\\n\\nll calc(int s, int e) {\\n int sb = s / B, eb = e / B;\\n ll ret = 1;\\n if (s < e) {\\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\\n for (int i = sb + 1; i < eb; ++i) (ret *= b[i]) %= n;\\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\\n } else {\\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\\n for (int i = sb + 1; i < B; ++i) (ret *= b[i]) %= n;\\n for (int i = 0; i < eb; ++i) (ret *= b[i]) %= n;\\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\\n }\\n return ret;\\n}\\n\\nint main() {\\n rep(i, B) rep(j, B) v[i][j] = 1;\\n\\n scanf(\\\" %d %d %d\\\", &n, &m, &q);\\n rep(i, m) {\\n scanf(\\\" %d\\\", &d[i]);\\n v[i / B][i % B] = d[i];\\n }\\n\\n ll prod_n = 1;\\n rep(i, m)(prod_n *= d[i]) %= n;\\n\\n rep(i, B) {\\n b[i] = 1;\\n rep(j, B)(b[i] *= v[i][j]) %= n;\\n }\\n\\n rep(qi, q) {\\n int x, y, z;\\n scanf(\\\" %d %d %d\\\", &x, &y, &z);\\n\\n --y;\\n\\n ll w = mod_pow(prod_n, z / n, n);\\n z %= n;\\n if (z) (w *= calc(y, (y + z - 1) % m)) %= n;\\n\\n // t^w = x (mod n+1)\\n // x^r = tとして、 x = x^(r*w) (mod n+1)\\n // r*w = 1 (mod n)\\n ll r = mod_inverse(w, n);\\n ll t = mod_pow(x, r, n + 1);\\n printf(\\\"%lld\\\\n\\\", t);\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.034482758620689655,\n \"time_ms\": 150,\n \"memory_kb\": 82236,\n \"score_of_the_acc\": -0.772,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3154_4883382\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\nll extgcd(ll a, ll b, ll& x, ll& y) {\\n ll g = a;\\n x = 1;\\n y = 0;\\n if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;\\n return g;\\n}\\n\\n// a^(-1) mod m\\n// aとmは互いに素でなければならない\\nll mod_inverse(ll a, ll m) {\\n assert(__gcd(a, m) == 1);\\n ll x, y;\\n ll g = extgcd(a, m, x, y);\\n while (x < 0) x += m;\\n return x % m;\\n}\\n\\nll mod_pow(ll x, ll n, ll mod) {\\n ll ret = 1;\\n while (n) {\\n if (n & 1) (ret *= x) %= mod;\\n n >>= 1;\\n (x *= x) %= mod;\\n }\\n return ret;\\n}\\n\\nconst int N = 10000000;\\nint n, m, q;\\nint d[N];\\n\\nconst int B = 3180;\\nll v[B][B];\\nll b[B];\\n\\nll calc(int s, int e) {\\n int sb = s / B, eb = e / B;\\n ll ret = 1;\\n if (s < e) {\\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\\n for (int i = sb + 1; i < eb; ++i) (ret *= b[i]) %= n;\\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\\n } else {\\n for (int i = s; i < (sb + 1) * B; ++i) (ret *= v[sb][i % B]) %= n;\\n for (int i = sb + 1; i < B; ++i) (ret *= b[i]) %= n;\\n for (int i = 0; i < eb; ++i) (ret *= b[i]) %= n;\\n for (int i = eb * B; i <= e; ++i) (ret *= v[eb][i % B]) %= n;\\n }\\n return ret;\\n}\\n\\nint main() {\\n rep(i, B) rep(j, B) v[i][j] = 1;\\n\\n scanf(\\\" %d %d %d\\\", &n, &m, &q);\\n rep(i, m) {\\n scanf(\\\" %d\\\", &d[i]);\\n v[i / B][i % B] = d[i];\\n }\\n\\n ll prod_n = 1;\\n rep(i, m)(prod_n *= d[i]) %= n;\\n\\n rep(i, B) {\\n b[i] = 1;\\n rep(j, B)(b[i] *= v[i][j]) %= n;\\n }\\n\\n rep(qi, q) {\\n int x, y, z;\\n scanf(\\\" %d %d %d\\\", &x, &y, &z);\\n\\n --y;\\n\\n ll w = mod_pow(prod_n, z / n, n);\\n z %= n;\\n if (z) (w *= calc(y, (y + z - 1) % n)) %= n;\\n\\n // t^w = x (mod n+1)\\n // x^r = tとして、 x = x^(r*w) (mod n+1)\\n // r*w = 1 (mod n)\\n ll r = mod_inverse(w, n);\\n ll t = mod_pow(x, r, n + 1);\\n printf(\\\"%lld\\\\n\\\", t);\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.034482758620689655,\n \"time_ms\": 150,\n \"memory_kb\": 82264,\n \"score_of_the_acc\": -0.7722,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3154_4865389\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n\\n\\n#include <utility>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m < 2^31`\\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\nnamespace ac = atcoder;\\n\\nusing mint0 = ac::dynamic_modint<0>;\\nusing mint1 = ac::dynamic_modint<1>;\\n\\nvoid solve() {\\n int n, m, q;\\n std::cin >> n >> m >> q;\\n\\n mint0::set_mod(n + 0);\\n mint1::set_mod(n + 1);\\n\\n std::vector<mint0> prods(m + 1); // 累積積\\n prods[0] = 1;\\n for (int i = 1; i <= m; ++i) {\\n int d;\\n std::cin >> d;\\n prods[i] = prods[i - 1] * d;\\n }\\n\\n // [0, len)の積を返す\\n auto getprod = [&](int len) {\\n return prods[m].pow(len / m) * prods[len % m];\\n };\\n\\n while (q--) {\\n int x, y, z;\\n std::cin >> x >> y >> z;\\n --y;\\n\\n auto p = getprod(y + z) / getprod(y);\\n std::cout << mint1(x).pow(p.inv().val()).val() << \\\"\\\\n\\\";\\n }\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.0049,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3154_4861045\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// as + bt = GCD(a,b) a,b:const s,t:var(any)\\n// return GCD(a,b)\\nlong long extGCD(long long a, long long b, long long& s, long long& t) {\\n s = 1, t = 0;\\n long long u = 0, v = 1;\\n while (b) {\\n long long tmp = a / b;\\n a -= b * tmp;\\n s -= u * tmp;\\n t -= v * tmp;\\n swap(s, u);\\n swap(t, v);\\n swap(a, b);\\n }\\n return a;\\n}\\n// (mod)x+ay=1, calculate y -> a^-1 (mod m) (a,m : coprime)\\nlong long calcinv(long long a, long long m) {\\n long long s, t;\\n extGCD(a, m, s, t);\\n return (s + m) % m;\\n}\\n\\nlong long mod_pow(long long base, int e, int mod) {\\n long long res = 1;\\n while (e) {\\n if (e & 1) (res *= base) %= mod;\\n (base *= base) %= mod;\\n e >>= 1;\\n }\\n return res;\\n}\\n\\nint n, m, q, all = 1;\\nvector<int> mul;\\n\\nint main() {\\n cin >> n >> m >> q;\\n { // input and pre calc\\n mul.assign(2 * m + 1, 1);\\n for (int i = 1; i <= 2 * m; ++i) {\\n if (i <= m) {\\n cin >> mul[i];\\n mul[i] = mul[i + m] = calcinv(mul[i], n);\\n all = 1LL * all * mul[i] % n;\\n }\\n mul[i] = 1LL * mul[i - 1] * mul[i] % n;\\n }\\n }\\n auto calc = [](int l, int r) {\\n return 1LL * mul[r] * calcinv(mul[l], n) % n;\\n };\\n for (int i = 0; i < q; ++i) {\\n int x, y, z, e;\\n cin >> x >> y >> z;\\n --y;\\n e = 1LL * mod_pow(all, z / m, n) * calc(y, y + z % m) % n;\\n cout << mod_pow(x, e, n + 1) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -0.0398,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3154_4861043\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 0-indexed\\ntemplate <class T>\\nstruct SegmentTree {\\n // a,b,c: T, e:T(unit)\\n // abc = (ab)c = a(bc)\\n // ae = ea = a\\n typedef function<T(T, T)> F;\\n int n;\\n F f;\\n T unit;\\n vector<T> dat;\\n SegmentTree(){};\\n SegmentTree(int newn, F f, T t) : f(f), unit(t) { init(newn); }\\n SegmentTree(const vector<T>& v, F f, T t) : f(f), unit(t) {\\n int _n = v.size();\\n init(v.size());\\n for (int i = 0; i < _n; ++i) dat[n + i] = v[i];\\n for (int i = n - 1; i; --i) dat[i] = f(dat[i << 1], dat[(i << 1) | 1]);\\n }\\n void init(int newn) {\\n n = 1;\\n while (n < newn) n <<= 1;\\n dat.assign(n << 1, unit);\\n }\\n\\n // \\\"go up\\\" process\\n void update(int k, T newdata) {\\n dat[k += n] = newdata;\\n while (k >>= 1) {\\n dat[k] = f(dat[(k << 1) | 0], dat[(k << 1) | 1]);\\n }\\n }\\n // [a,b)\\n T query(int a, int b) {\\n T vl = unit, vr = unit;\\n for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {\\n if (l & 1) vl = f(vl, dat[l++]);\\n if (r & 1) vr = f(dat[--r], vr);\\n }\\n return f(vl, vr);\\n }\\n};\\n\\n// as + bt = GCD(a,b) a,b:const s,t:var(any)\\n// return GCD(a,b)\\nlong long extGCD(long long a, long long b, long long& s, long long& t) {\\n s = 1, t = 0;\\n long long u = 0, v = 1;\\n while (b) {\\n long long tmp = a / b;\\n a -= b * tmp;\\n s -= u * tmp;\\n t -= v * tmp;\\n swap(s, u);\\n swap(t, v);\\n swap(a, b);\\n }\\n return a;\\n}\\n// (mod)x+ay=1, calculate y -> a^-1 (mod m) (a,m : coprime)\\nlong long calcinv(long long a, long long m) {\\n long long s, t;\\n extGCD(a, m, s, t);\\n return (s + m) % m;\\n}\\n\\nlong long mod_pow(long long base, int e, int mod) {\\n long long res = 1;\\n while (e) {\\n if (e & 1) (res *= base) %= mod;\\n (base *= base) %= mod;\\n e >>= 1;\\n }\\n return res;\\n}\\n\\nint n, m, q, all = 1;\\nSegmentTree<int> seg;\\n\\nint main() {\\n cin >> n >> m >> q;\\n { // input and pre calc\\n auto f = [](int l, int r) { return 1LL * l * r % n; };\\n vector<int> v(m, 0);\\n for (auto& p : v) {\\n cin >> p;\\n p = calcinv(p, n);\\n all = 1LL * all * p % n;\\n }\\n for (int i = 0; i < m; ++i) v.push_back(v[i]);\\n seg = SegmentTree<int>(v, f, 1);\\n }\\n for (int i = 0; i < q; ++i) {\\n int x, y, z, e;\\n cin >> x >> y >> z;\\n --y;\\n e = 1LL * mod_pow(all, z / m, n) * seg.query(y, y + z % m) % n;\\n cout << mod_pow(x, e, n + 1) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 4420,\n \"score_of_the_acc\": -0.0526,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3154_4840907\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\n//using namespace atcoder;\\n#define ll long long\\n#define FOR(i, a, b) for(ll i=(a);i<(b);++i)\\n#define rep(i, n) FOR(i, 0, n)\\n#define rep1(i, n) FOR(i, 1, n+1)\\n#define rrep(i, n) for (ll i = ((int)(n)-1); i >= 0; --i)\\n#define whole(x) (x).begin(),(x).end()\\n#define rwhole(x) (x).rbegin(), (x).rend()\\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())\\n#define P pair<int, int>\\n#define debug(var) cerr << \\\"[\\\" << #var << \\\"] \\\" << var << endl\\ntemplate<typename T1, typename T2>\\nbool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>\\nbool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\n#define vi vector<int>\\n#define vl vector<ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define fi first\\n#define se second\\n#define pr(s) cout << (s) << '\\\\n'\\nll mod = 1000000007;\\nconst int dx[] = {-1,0,1,0};\\nconst int dy[] = {0,-1,0,1};\\nconst int INF = 1001001001;\\nconst ll INFll = 1E+18;\\n\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) {\\n (x *= a.x) %= mod;\\n return *this;\\n }\\n mint operator+(const mint a) const {\\n mint res(*this);\\n return res+=a;\\n }\\n mint operator-(const mint a) const {\\n mint res(*this);\\n return res-=a;\\n }\\n mint operator*(const mint a) const {\\n mint res(*this);\\n return res*=a;\\n }\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n \\n // for prime mod\\n mint inv() const {\\n return pow(mod-2);\\n }\\n mint& operator/=(const mint a) {\\n return (*this) *= a.inv();\\n }\\n mint operator/(const mint a) const {\\n mint res(*this);\\n return res/=a;\\n }\\n};\\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\\n\\nstruct combination {\\n vector<mint> fact, ifact;\\n combination(int n):fact(n+1),ifact(n+1) {\\n assert(n < mod);\\n fact[0] = 1;\\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\\n ifact[n] = fact[n].inv();\\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\\n }\\n mint operator()(int n, int k) {\\n if (k < 0 || k > n) return 0;\\n return fact[n]*ifact[k]*ifact[n-k];\\n }\\n mint per(int n, int k) {\\n return fact[n]*ifact[n-k];\\n }\\n};\\n\\n \\n\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n ll n, m, q;\\n cin >> n >> m >> q;\\n mod = n;\\n //if (n!=10 && n!=970) debug(n);\\n //if (n!=10 && n!=970) debug(m);\\n //if (n!=10 && n!=970) debug(q);\\n vector<ll> d(m);\\n rep(i, m) cin >> d[i];\\n //if (n!=10 && n!=970) rep(i, m) cerr << i << \\\" \\\" << d[i] << endl;\\n vector<mint> sd(m*2+1);\\n sd[0] = 1;\\n rep(i, 2*m) {\\n sd[i+1] = sd[i]*d[i%m];\\n /*\\n if (n!=10 && n!=970) {\\n cerr << \\\"i sd[i]\\\" << i+1 << \\\" \\\" << sd[i+1].x << endl;\\n }\\n */\\n //debug(sd[i+1]);\\n }\\n vector<ll> inverse(n+1);\\n inverse[1] = 1;\\n vector<bool> used(n+1);\\n for (ll i=2; i<=n; i++) {\\n if (used[i]) continue;\\n if (__gcd(n, i)==1) {\\n ll now = i;\\n vector<ll> v;\\n while (1) {\\n used[now] = true;\\n v.pb(now);\\n if (now==1) break;\\n now *= i;\\n now %= n;\\n }\\n rep(j, v.size()-1) {\\n ll zz = lcm(j+1, (ll)v.size());\\n ll yy = zz - (j+1);\\n inverse[v[j]] = v[(yy-1+v.size())%v.size()];\\n if (n!=10) {\\n //debug(v[j]);\\n //debug((yy-1)%n);\\n //debug(inverse[v[j]]);\\n }\\n }\\n //debug(n);\\n }\\n }\\n \\n //debug(num_prime);\\n rep(qi, q) {\\n ll x, y, z;\\n cin >> x >> y >> z;\\n y--;\\n mint p = sd[m].pow(z/m);\\n /*\\n if (n!=10) {\\n cerr << \\\"sd[m] p \\\" << sd[m].x << \\\" \\\" << p.x << endl;\\n }\\n */\\n z %= m;\\n p *= sd[y+z]*inverse[sd[y].x];\\n /*\\n if (n!=10) {\\n cerr << \\\"y+z y sd[y+z] sd[y] p \\\" << y+z << \\\" \\\" << y << \\\" \\\" << sd[y+z].x << \\\" \\\" << sd[y].x << \\\" \\\" << p.x << endl;\\n }\\n */\\n //debug(y+z); debug(y);\\n //debug(sd[y+z]); debug(sd[y]);\\n //debug(p);\\n ll inv = inverse[p.x];\\n //debug(inv);\\n mod = n+1;\\n mint ans = mint(x).pow(inv);\\n pr(ans);\\n mod = n;\\n /*\\n if (n!=10 && n!=970) {\\n cerr << x << \\\" \\\" << y << \\\" \\\" << z << endl;\\n cerr << ans << \\\" \\\" << p.x << endl;\\n int pp = p.x;\\n mod = n+1;\\n cerr << ans.pow(p.x) << endl;\\n mod = n;\\n }\\n */\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2050,\n \"memory_kb\": 114716,\n \"score_of_the_acc\": -2,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3154_4840860\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n////////////////////////////// Begin Macros\\n\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define in(x, a, b) (a <= x and x < b)\\n#define rep(i, N) for (int i = 0; i < (int)(N); i++)\\n#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i--)\\n#define rep1(i, N) for (int i = 1; i <= (int)(N); i++)\\n#define rep1rev(i, N) for (int i = (int)(N); i >= 0; i--)\\n#define forbe(i, b, e) for (int i = (b); i < (e); i++)\\n#define forberev(i, b, e) for (int i = (e)-1; i >= (b); i--)\\n#define forfl(i, f, l) for (int i = (f); i <= (l); i++)\\n#define forflrev(i, f, l) for (int i = (l); i >= (f); i--)\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pil = pair<int, ll>;\\nusing pli = pair<ll, int>;\\nusing pll = pair<ll, ll>;\\n\\ntemplate <typename T>\\nbool chmax(T &m, const T q)\\n{\\n if (m < q)\\n {\\n m = q;\\n return true;\\n }\\n else\\n return false;\\n}\\ntemplate <typename T>\\nbool chmin(T &m, const T q)\\n{\\n if (m > q)\\n {\\n m = q;\\n return true;\\n }\\n else\\n return false;\\n}\\ntemplate <typename T1, typename T2>\\npair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first + r.first, l.second + r.second}; }\\ntemplate <typename T1, typename T2>\\npair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first - r.first, l.second - r.second}; }\\ntemplate <typename T>\\npair<T, T> operator*(const pair<T, T> &l, const T &r) { return {l.first * r, l.second * r}; }\\ntemplate <typename T>\\npair<T, T> operator/(const pair<T, T> &l, const T &r) { return {l.first / r, l.second / r}; }\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &vec)\\n{\\n for (auto &v : vec)\\n is >> v;\\n return is;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const vector<T> &vec)\\n{\\n os << \\\"[\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"]\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const deque<T> &vec)\\n{\\n os << \\\"deq[\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"]\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const set<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const unordered_set<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const multiset<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const unordered_multiset<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &pa)\\n{\\n is >> pa.first >> pa.second;\\n return is;\\n}\\ntemplate <typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &pa)\\n{\\n os << \\\"(\\\" << pa.first << \\\",\\\" << pa.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename... Ts>\\nistream &operator>>(istream &is, tuple<Ts...> &theTuple)\\n{\\n apply([&is](Ts &... tupleArgs) { ((is >> tupleArgs), ...); }, theTuple);\\n return is;\\n}\\ntemplate <typename... Ts>\\nostream &operator<<(ostream &os, const tuple<Ts...> &theTuple)\\n{\\n apply([&os](const Ts &... tupleArgs) {\\n os << '(';\\n size_t n(0);\\n ((os << tupleArgs << (++n < sizeof...(Ts) ? \\\",\\\" : \\\"\\\")), ...);\\n os << ')';\\n },\\n theTuple);\\n return os;\\n}\\ntemplate <typename TK, typename TV>\\nostream &operator<<(ostream &os, const map<TK, TV> &mp)\\n{\\n os << \\\"{\\\";\\n for (auto v : mp)\\n os << v.first << \\\"=>\\\" << v.second << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename TK, typename TV>\\nostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp)\\n{\\n os << \\\"{\\\";\\n for (auto v : mp)\\n os << v.first << \\\"=>\\\" << v.second << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\n\\ntemplate <typename T>\\nvoid reset(vector<T> &v, const T reset_to)\\n{\\n for (auto &x : v)\\n x = reset_to;\\n}\\ninline int popcount(const unsigned int x) { return __builtin_popcount(x); }\\n#define dbg(x) cerr << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << endl;\\n\\nll nC2(ll n)\\n{\\n return n * (n - 1) / 2;\\n}\\n\\nconst int intinf = numeric_limits<int>::max();\\nconst ll llinf = numeric_limits<ll>::max();\\nconst pii udlr[4] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\\n\\n////////////////////////////// End Macros\\n\\n// Modulo.h start----------------------------------------\\n\\n#include <vector>\\n#include <iostream>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n// a x + b y = gcd(a, b)\\nint extgcd(const int a, const int b, int &x, int &y)\\n{\\n // O(log max(a,b))\\n int g = a;\\n x = 1;\\n y = 0;\\n if (b != 0)\\n g = extgcd(b, a % b, y, x), y -= (a / b) * x;\\n return g;\\n}\\n\\nint inv_mod(const int a, const int mod)\\n{\\n int x, y;\\n if (extgcd(a, mod, x, y) == 1)\\n return (x + mod) % mod;\\n else // unsolvable\\n return 0;\\n}\\n\\nstruct Modint\\n{\\n static int mod;\\n static bool mod_is_prime;\\n long long value;\\n Modint(long long value = 0LL) : value((value % mod + mod) % mod) {}\\n inline Modint operator+() const { return *this; }\\n inline Modint operator-() const { return Modint(-value); }\\n inline Modint &operator+=(const Modint &rhs)\\n {\\n if ((value += rhs.value) >= mod)\\n value -= mod;\\n return *this;\\n }\\n inline Modint &operator-=(const Modint &rhs)\\n {\\n if ((value += mod - rhs.value) >= mod)\\n value -= mod;\\n return *this;\\n }\\n inline Modint &operator*=(const Modint &rhs)\\n {\\n (value *= rhs.value) %= mod;\\n return *this;\\n }\\n Modint pow(long long k) const\\n {\\n assert(k >= 0);\\n if (k == 0)\\n return 1;\\n Modint res = pow(k / 2);\\n res *= res;\\n if (k % 2 == 1)\\n res *= *this;\\n return res;\\n }\\n\\n Modint inv() const\\n {\\n if (mod_is_prime)\\n return pow(mod - 2);\\n\\n // value and mod are coprime\\n long long a = value, b = mod, u = 1, v = 0;\\n while (b)\\n {\\n long long t = a / b;\\n a -= t * b;\\n swap(a, b);\\n u -= t * v;\\n swap(u, v);\\n }\\n u %= mod;\\n if (u < 0)\\n u += mod;\\n return u;\\n }\\n inline Modint &operator/=(const Modint &rhs) { return *this *= rhs.inv(); }\\n};\\nint Modint::mod = 1000000007;\\nbool Modint::mod_is_prime = true;\\nbool operator==(const Modint &lhs, const Modint &rhs) { return lhs.value == rhs.value; }\\nbool operator!=(const Modint &lhs, const Modint &rhs) { return !(lhs == rhs); }\\nModint operator+(const Modint &lhs, const Modint &rhs) { return Modint(lhs) += rhs; }\\nModint operator-(const Modint &lhs, const Modint &rhs) { return Modint(lhs) -= rhs; }\\nModint operator*(const Modint &lhs, const Modint &rhs) { return Modint(lhs) *= rhs; }\\nModint operator/(const Modint &lhs, const Modint &rhs) { return Modint(lhs) /= rhs; }\\nistream &operator>>(istream &lhs, Modint &rhs) { return lhs >> rhs.value; }\\nostream &operator<<(ostream &lhs, const Modint &rhs) { return lhs << rhs.value; }\\n\\nstruct Combination\\n{\\n std::vector<Modint> fact, ifact;\\n Combination(int n = 0) : fact(n + 1), ifact(n + 1)\\n {\\n assert(n >= 0);\\n fact[0] = 1;\\n for (int i = 1; i <= n; i++)\\n fact[i] = fact[i - 1] * i;\\n ifact[n] = fact[n].inv();\\n for (int i = n; i >= 1; i--)\\n ifact[i - 1] = ifact[i] * i;\\n }\\n Modint operator()(int n, int k)\\n {\\n assert(0 <= n and n <= (int)fact.size());\\n if (!(0 <= k and k <= n))\\n return 0;\\n return fact[n] * ifact[k] * ifact[n - k];\\n }\\n};\\n\\n// Modulo.h end----------------------------------------------\\n\\nvoid solve()\\n{\\n int N, M, Q;\\n cin >> N >> M >> Q;\\n vector<int> d(M);\\n cin >> d;\\n\\n Modint::mod = N;\\n Modint::mod_is_prime = false;\\n vector<Modint> sd(2 * M + 1);\\n sd[0] = 1;\\n rep(i, 2 * M) sd[i + 1] = sd[i] * d[i % M];\\n\\n rep(_, Q)\\n {\\n int x, y, z;\\n cin >> x >> y >> z;\\n y--;\\n\\n Modint::mod = N;\\n Modint::mod_is_prime = false;\\n int q = z / M;\\n int r = z % M;\\n Modint a = sd[M].pow(q) * sd[y + r] / sd[y];\\n auto b = a.inv().value;\\n\\n Modint::mod = N + 1;\\n Modint::mod_is_prime = true;\\n Modint t = ((Modint)(x)).pow(b);\\n cout << t << endl;\\n }\\n}\\n\\nint main()\\n{\\n // cerr << \\\"start\\\" << endl;\\n // srand(time(0));\\n cout << fixed << setprecision(15);\\n\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3996,\n \"score_of_the_acc\": -0.0537,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3154_4840226\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\n//using namespace atcoder;\\n#define ll long long\\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\\n#define rep(i, n) FOR(i, 0, n)\\n#define rep1(i, n) FOR(i, 1, n+1)\\n#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)\\n#define whole(x) (x).begin(),(x).end()\\n#define rwhole(x) (x).rbegin(), (x).rend()\\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())\\n#define P pair<int, int>\\n#define debug(var) cerr << \\\"[\\\" << #var << \\\"] \\\" << var << endl\\ntemplate<typename T1, typename T2>\\nbool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>\\nbool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\n#define vi vector<int>\\n#define vl vector<ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define fi first\\n#define se second\\n#define pr(s) cout << (s) << '\\\\n'\\nll mod = 1000000007;\\nconst int dx[] = {-1,0,1,0};\\nconst int dy[] = {0,-1,0,1};\\nconst int INF = 1001001001;\\nconst ll INFll = 1E+18;\\n\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) {\\n (x *= a.x) %= mod;\\n return *this;\\n }\\n mint operator+(const mint a) const {\\n mint res(*this);\\n return res+=a;\\n }\\n mint operator-(const mint a) const {\\n mint res(*this);\\n return res-=a;\\n }\\n mint operator*(const mint a) const {\\n mint res(*this);\\n return res*=a;\\n }\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n \\n // for prime mod\\n mint inv() const {\\n return pow(mod-2);\\n }\\n mint& operator/=(const mint a) {\\n return (*this) *= a.inv();\\n }\\n mint operator/(const mint a) const {\\n mint res(*this);\\n return res/=a;\\n }\\n};\\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\\n\\nstruct combination {\\n vector<mint> fact, ifact;\\n combination(int n):fact(n+1),ifact(n+1) {\\n assert(n < mod);\\n fact[0] = 1;\\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\\n ifact[n] = fact[n].inv();\\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\\n }\\n mint operator()(int n, int k) {\\n if (k < 0 || k > n) return 0;\\n return fact[n]*ifact[k]*ifact[n-k];\\n }\\n mint per(int n, int k) {\\n return fact[n]*ifact[n-k];\\n }\\n};\\n\\n \\n\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n int n, m, q;\\n cin >> n >> m >> q;\\n mod = n;\\n //if (n!=10 && n!=970) debug(n);\\n //if (n!=10 && n!=970) debug(m);\\n //if (n!=10 && n!=970) debug(q);\\n vector<int> d(m);\\n rep(i, m) cin >> d[i];\\n //if (n!=10 && n!=970) rep(i, m) cerr << i << \\\" \\\" << d[i] << endl;\\n vector<mint> sd(2*m+1);\\n sd[0] = 1;\\n rep(i, 2*m) {\\n sd[i+1] = sd[i]*d[i%m];\\n /*\\n if (n!=10 && n!=970) {\\n cerr << \\\"i sd[i]\\\" << i+1 << \\\" \\\" << sd[i+1].x << endl;\\n }\\n */\\n //debug(sd[i+1]);\\n }\\n vector<int> inverse(n+1);\\n inverse[1] = 1;\\n vector<bool> used(n+1);\\n for (int i=2; i<=n; i++) {\\n if (used[i]) continue;\\n if (__gcd(n, i)==1) {\\n ll now = i;\\n vector<int> v;\\n while (1) {\\n used[now] = true;\\n v.pb(now);\\n if (now==1) break;\\n now *= i;\\n now %= n;\\n }\\n rep(j, v.size()-1) {\\n ll zz = lcm(j+1, (int)v.size());\\n ll yy = zz - (j+1);\\n inverse[v[j]] = v[(yy-1+v.size())%v.size()];\\n if (n!=10) {\\n //debug(v[j]);\\n //debug((yy-1)%n);\\n //debug(inverse[v[j]]);\\n }\\n }\\n //debug(n);\\n }\\n }\\n \\n //debug(num_prime);\\n rep(qi, q) {\\n int x, y, z;\\n cin >> x >> y >> z;\\n y--;\\n mint p = sd[m].pow(z/m);\\n /*\\n if (n!=10) {\\n cerr << \\\"sd[m] p \\\" << sd[m].x << \\\" \\\" << p.x << endl;\\n }\\n */\\n z %= m;\\n p *= sd[y+z]*inverse[sd[y].x];\\n /*\\n if (n!=10) {\\n cerr << \\\"y+z y sd[y+z] sd[y] p \\\" << y+z << \\\" \\\" << y << \\\" \\\" << sd[y+z].x << \\\" \\\" << sd[y].x << \\\" \\\" << p.x << endl;\\n }\\n */\\n //debug(y+z); debug(y);\\n //debug(sd[y+z]); debug(sd[y]);\\n //debug(p);\\n int inv = inverse[p.x];\\n //debug(inv);\\n mod = n+1;\\n mint ans = mint(x).pow(inv);\\n pr(ans);\\n mod = n;\\n /*\\n if (n!=10 && n!=970) {\\n cerr << x << \\\" \\\" << y << \\\" \\\" << z << endl;\\n cerr << ans << \\\" \\\" << p.x << endl;\\n int pp = p.x;\\n mod = n+1;\\n cerr << ans.pow(p.x) << endl;\\n mod = n;\\n }\\n */\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 0.3103448275862069,\n \"time_ms\": 1420,\n \"memory_kb\": 46712,\n \"score_of_the_acc\": -1.0782,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3154_4839264\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < n; i++)\\n\\ntypedef long long ll;\\n\\nconst int MAX = 10000000;\\nint MOD;\\n\\nlong long extGCD(long long a, long long b, long long &x, long long &y) {\\n if (b == 0) {\\n x = 1;\\n y = 0;\\n return a;\\n }\\n long long d = extGCD(b, a%b, y, x);\\n y -= a / b * x;\\n return d;\\n}\\n\\ninline long long mod(long long a, long long m=MOD) {\\n return (a % m + m) % m;\\n}\\n\\nlong long modinv(long long a, long long m=MOD) {\\n long long x, y;\\n extGCD(a, m, x, y);\\n return mod(x, m);\\n}\\n\\n//Nの剰余でのpow\\nll modpow(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow(n, k-1)*n % MOD;\\n }\\n else{\\n ll temp = modpow(n, k/2);\\n return temp*temp % MOD;\\n }\\n}\\n\\n//N+1の剰余でのpow\\nll modpow2(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow2(n, k-1)*n % (MOD+1);\\n }\\n else{\\n ll temp = modpow2(n, k/2);\\n return temp*temp % (MOD+1);\\n }\\n}\\n\\nint main(void){\\n //A[y-1]*A[y]*...*A[y+z-1] = aとすると,\\n //pow(t, a) = x かつ a は gcd(a, N) = 1 より剰余環Z/NZ上で乗法逆元が存在するので pow(x, a^(-1)) が唯一の答え\\n int N, M, Q; cin >> N >> M >> Q;\\n MOD = N;\\n vector<ll> A(M);\\n rep(i, M){\\n ll a; cin >> a;\\n A[i] = a;\\n }\\n vector<ll> acc_left(M*2+1, 1); //acc_left[i]: A[0]~A[i-1]までの積 (mod N)\\n for(int i = 1; i <= M*2; i++){\\n acc_left[i] = acc_left[i-1]*A[(i-1) % M] % N;\\n } \\n\\n vector<ll> ans;\\n rep(i, Q){\\n ll x, y, z; cin >> x >> y >> z;\\n //A[y-1]*A[y]*...*A[y-1+part-1]を計算\\n ll whole = (z - (z % M)) / M; //鍵を完全に周回する回数\\n ll part = z - whole*M; //端数\\n ll acc = modpow(acc_left[M], whole);\\n \\n acc = (acc * (acc_left[y-1+part] * modinv(acc_left[y-1]) % N)) % N;\\n ans.push_back(modpow2(x, modinv(acc)));\\n }\\n rep(i, Q) cout << ans[i] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 4760,\n \"score_of_the_acc\": -0.0606,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3154_4839207\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < n; i++)\\n\\ntypedef long long ll;\\n\\nconst int MAX = 10000000;\\nint MOD;\\n\\nlong long inv[MAX];\\n\\n// テーブルを作る前処理\\nvoid COMinit() {\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n }\\n}\\n\\n//Nの剰余でのpow\\nll modpow(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow(n, k-1)*n % MOD;\\n }\\n else{\\n ll temp = modpow(n, k/2);\\n return temp*temp % MOD;\\n }\\n}\\n\\n//N+1の剰余でのpow\\nll modpow2(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow2(n, k-1)*n % (MOD+1);\\n }\\n else{\\n ll temp = modpow2(n, k/2);\\n return temp*temp % (MOD+1);\\n }\\n}\\n\\nint main(void){\\n //A[y-1]*A[y]*...*A[y+z-1] = aとすると,\\n //pow(t, a) = x かつ a は gcd(a, N) = 1 より剰余環Z/NZ上で乗法逆元が存在するので pow(x, a^(-1)) が唯一の答え\\n int N, M, Q; cin >> N >> M >> Q;\\n MOD = N;\\n COMinit();\\n vector<ll> A(M);\\n rep(i, M){\\n ll a; cin >> a;\\n A[i] = a;\\n }\\n vector<ll> acc_left(M*2+1, 1); //acc_left[i]: A[0]~A[i-1]までの積 (mod N)\\n for(int i = 1; i <= M*2; i++){\\n acc_left[i] = acc_left[i-1]*A[(i-1) % M] % N;\\n } \\n\\n vector<ll> ans;\\n rep(i, Q){\\n ll x, y, z; cin >> x >> y >> z;\\n //A[y-1]*A[y]*...*A[y-1+part-1]を計算\\n ll whole = (z - (z % M)) / M; //鍵を完全に周回する回数\\n ll part = z - whole*M; //端数\\n ll acc = modpow(acc_left[M], whole);\\n acc = (acc * (acc_left[y-1+part] * inv[acc_left[y-1]] % N)) % N;\\n ans.push_back(modpow2(x, inv[acc]));\\n }\\n rep(i, Q) cout << ans[i] << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.034482758620689655,\n \"time_ms\": 90,\n \"memory_kb\": 81572,\n \"score_of_the_acc\": -0.7365,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3154_4839138\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < n; i++)\\n\\ntypedef long long ll;\\n\\nconst int MAX = 10000000;\\nint MOD;\\n\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\n// テーブルを作る前処理\\nvoid COMinit() {\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n }\\n}\\n\\n//Nの剰余でのpow\\nll modpow(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow(n, k-1)*n % MOD;\\n }\\n else{\\n ll temp = modpow(n, k/2);\\n return temp*temp % MOD;\\n }\\n}\\n\\n//N+1の剰余でのpow\\nll modpow2(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow2(n, k-1)*n % (MOD+1);\\n }\\n else{\\n ll temp = modpow2(n, k/2);\\n return temp*temp % (MOD+1);\\n }\\n}\\n\\nint main(void){\\n //A[y-1]*A[y]*...*A[y+z-1] = aとすると,\\n //pow(t, a) = x かつ a は gcd(a, N) = 1 より剰余環Z/NZ上で乗法逆元が存在するので pow(x, a^(-1)) が唯一の答え\\n int N, M, Q; cin >> N >> M >> Q;\\n MOD = N;\\n COMinit();\\n vector<ll> Ainv(M);\\n rep(i, M){\\n ll a; cin >> a;\\n Ainv[i] = inv[a];\\n }\\n vector<ll> acc_left(M*2+1, 1); //acc_left[i]: Ainv[0]~Ainv[i-1]までの積 (mod N)\\n for(int i = 1; i <= M*2; i++){\\n acc_left[i] = acc_left[i-1]*Ainv[(i-1) % M] % MOD;\\n } \\n\\n vector<ll> ans;\\n rep(i, Q){\\n ll x, y, z; cin >> x >> y >> z;\\n //Ainv[y-1]*Ainv[y]*...*Ainv[y-1+part-1]を計算\\n ll whole = (z - (z % M)) / M; //鍵を完全に周回する回数\\n ll part = z - whole*M; //端数\\n ll acc = modpow(acc_left[M], whole);\\n acc = (acc * (acc_left[y-1+part] * inv[acc_left[y-1]] % MOD)) % MOD;\\n //ll acc = 1;\\n //for(int i = y-1, cnt = 0; cnt < z; i = (i+1) % M, cnt++) acc = acc*Ainv[i] % N; これでもダメ\\n ans.push_back(modpow2(x, acc));\\n }\\n rep(i, Q) cout << ans[i] << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.034482758620689655,\n \"time_ms\": 110,\n \"memory_kb\": 81312,\n \"score_of_the_acc\": -0.744,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3154_4839060\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < n; i++)\\n\\ntypedef long long ll;\\n\\nconst int MAX = 1000000;\\nint MOD;\\n\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\n// テーブルを作る前処理\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n\\n//Nの剰余でのpow\\nll modpow(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow(n, k-1)*n % MOD;\\n }\\n else{\\n ll temp = modpow(n, k/2);\\n return temp*temp % MOD;\\n }\\n}\\n\\n//N+1の剰余でのpow\\nll modpow2(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow2(n, k-1)*n % (MOD+1);\\n }\\n else{\\n ll temp = modpow2(n, k/2);\\n return temp*temp % (MOD+1);\\n }\\n}\\n\\n//これを使うときにはCOMinit();を忘れずに\\n\\nint main(void){\\n int N, M, Q; cin >> N >> M >> Q;\\n MOD = N;\\n COMinit();\\n vector<ll> Ainv(M);\\n rep(i, M){\\n ll a; cin >> a;\\n Ainv[i] = inv[a];\\n }\\n vector<ll> acc_left(M*2+1, 1);\\n for(int i = 1; i <= M*2; i++){\\n acc_left[i] = acc_left[i-1]*Ainv[(i-1) % M] % MOD;\\n } \\n vector<ll> ans;\\n rep(i, Q){\\n ll x, y, z; cin >> x >> y >> z;\\n //Ainv[y-1]*Ainv[y]*...*Ainv[y-1+part-1]を計算\\n ll whole = (z - (z % M)) / M; //巻物を完全に周回する回数\\n ll part = z - whole*M; //端数\\n //ll acc = modpow(acc_left[M], whole);\\n ll acc = 1;\\n for(int i = y-1, cnt = 0; cnt < z; i = (i+1) % M, cnt++) acc = acc*Ainv[i] % N;\\n //acc = (acc * (acc_left[y-1+part] * inv[acc_left[y-1]] % MOD)) % MOD;\\n ans.push_back(modpow2(x, acc));\\n }\\n rep(i, Q) cout << ans[i] << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.034482758620689655,\n \"time_ms\": 30,\n \"memory_kb\": 26524,\n \"score_of_the_acc\": -0.2119,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3154_4838992\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < n; i++)\\n\\ntypedef long long ll;\\n\\nconst int MAX = 1000000;\\nint MOD;\\n\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\n// テーブルを作る前処理\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n\\n//Nの剰余でのpow\\nll modpow(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow(n, k-1)*n % MOD;\\n }\\n else{\\n ll temp = modpow(n, k/2);\\n return temp*temp % MOD;\\n }\\n}\\n\\n//N+1の剰余でのpow\\nll modpow2(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow2(n, k-1)*n % (MOD+1);\\n }\\n else{\\n ll temp = modpow2(n, k/2);\\n return temp*temp % (MOD+1);\\n }\\n}\\n\\n//これを使うときにはCOMinit();を忘れずに\\n\\nint main(void){\\n int N, M, Q; cin >> N >> M >> Q;\\n MOD = N;\\n COMinit();\\n vector<ll> Ainv(M);\\n rep(i, M){\\n ll a; cin >> a;\\n Ainv[i] = inv[a];\\n }\\n vector<ll> acc_left(M*2+1, 1);\\n for(int i = 1; i <= M*2; i++){\\n acc_left[i] = acc_left[i-1]*Ainv[(i-1) % M] % MOD;\\n } \\n vector<ll> ans;\\n rep(i, Q){\\n ll x, y, z; cin >> x >> y >> z;\\n //Ainv[y-1]*Ainv[y]*...*Ainv[y-1+part-1]を計算\\n ll whole = (z - (z % M)) / M; //巻物を完全に周回する回数\\n ll part = z - whole*M; //端数\\n //ll acc = modpow(acc_left[M], whole);\\n ll acc = 1;\\n for(int i = y-1, cnt = 0; cnt < z; i = (i+1) % M, cnt++) acc = acc*Ainv[i] % M;\\n //acc = (acc * (acc_left[y-1+part] * inv[acc_left[y-1]] % MOD)) % MOD;\\n ans.push_back(modpow2(x, acc));\\n }\\n rep(i, Q) cout << ans[i] << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.034482758620689655,\n \"time_ms\": 30,\n \"memory_kb\": 26620,\n \"score_of_the_acc\": -0.2128,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3154_4838848\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < n; i++)\\n\\ntypedef long long ll;\\n\\nconst int MAX = 1000000;\\nint MOD;\\n\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\n// テーブルを作る前処理\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n\\nll modpow(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow(n, k-1)*n % MOD;\\n }\\n else{\\n ll temp = modpow(n, k/2);\\n return temp*temp % MOD;\\n }\\n}\\n\\nll modpow2(ll n, ll k){\\n if(k == 0) return 1;\\n if(k%2){\\n return modpow2(n, k-1)*n % (MOD+1);\\n }\\n else{\\n ll temp = modpow2(n, k/2);\\n return temp*temp % (MOD+1);\\n }\\n}\\n\\n//これを使うときにはCOMinit();を忘れずに\\n\\nint main(void){\\n int N, M, Q; cin >> N >> M >> Q;\\n MOD = N;\\n COMinit();\\n vector<ll> Ainv(M);\\n rep(i, M){\\n ll a; cin >> a;\\n Ainv[i] = inv[a];\\n }\\n vector<ll> acc_left(M*2+1, 1);\\n for(int i = 1; i <= M*2; i++){\\n acc_left[i] = acc_left[i-1]*Ainv[(i-1) % M] % MOD;\\n } \\n vector<ll> ans;\\n rep(i, Q){\\n ll x, y, z; cin >> x >> y >> z;\\n //Ainv[y-1]*Ainv[y]*...*Ainv[y+z-2]を計算\\n ll whole = (z - (z % M)) / M; //巻物を完全に周回する回数\\n ll part = z - whole*M; //端数\\n ll acc = modpow(acc_left[M], whole);\\n acc = (acc * (acc_left[y-1+part] * inv[acc_left[y-1]] % MOD)) % MOD;\\n ans.push_back(modpow2(x, acc));\\n }\\n rep(i, Q) cout << ans[i] << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.034482758620689655,\n \"time_ms\": 20,\n \"memory_kb\": 26776,\n \"score_of_the_acc\": -0.2093,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3154_4837302\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\n#include <set>\\n#include <iomanip>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <fstream>\\n#include <cassert>\\n#include <stack>\\n#include <climits>\\n#include <array>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <memory>\\n#include <functional>\\n#include <cfloat>\\n#include <numeric>\\nlong long int power(const long long int base, const int exp, const long long int mod) {\\n\\tswitch (exp) {\\n\\tcase 0: return 1;\\n\\tcase 1: return base % mod;\\n\\tdefault: return power(base * base % mod, exp >> 1, mod) * power(base, exp & 1, mod) % mod;\\n\\t}\\n}\\nstd::pair<long long int, long long int> gcd_pair(const long long int a, const long long int b) {\\n\\tlong long int ax{ 1 }, bx{ 0 }, ay{ 0 }, by{ 1 };\\n\\twhile (a * ay + b * by != 0) {\\n\\t\\tconst auto n = a * ax + b * bx;\\n\\t\\tconst auto m = a * ay + b * by;\\n\\t\\tconst auto q = n / m;\\n\\t\\tconst auto ar = (ax - q * ay) % b;\\n\\t\\tconst auto br = (bx - q * by) % a;\\n\\t\\tax = ay;\\n\\t\\tbx = by;\\n\\t\\tay = ar;\\n\\t\\tby = br;\\n\\t}\\n\\tif (ax < 0) {\\n\\t\\tax += b;\\n\\t\\tbx -= a;\\n\\t}\\n\\treturn std::make_pair(ax, by);\\n}\\nlong long int inverse(const long long int base, const long long int mod) {\\n\\treturn gcd_pair(base, mod).first;\\n}\\nint main() {\\n\\tint n, m, q; std::cin >> n >> m >> q;\\n\\tstd::vector<long long int> keys(m), product{ 1 };\\n\\tfor (auto& d : keys) std::cin >> d;\\n\\tfor (const auto d : keys) {\\n\\t\\tproduct.push_back(product.back() * d % n);\\n\\t}\\n\\tfor (const auto d : keys) {\\n\\t\\tproduct.push_back(product.back() * d % n);\\n\\t}\\n\\tconst auto all_key = std::accumulate(keys.begin(), keys.end(), 1LL, [n](const long long int acc, const long long int d) {return d * acc % n; });\\n\\tfor (auto i = 0; i < q; ++i) {\\n\\t\\tint x, y, z; std::cin >> x >> y >> z; --y;\\n\\t\\tconst auto key = power(all_key, z / m, n) * product[y + z % m] % n * inverse(product[y], n) % n;\\n\\t\\tstd::cout << power(x, inverse(key, n), n + 1) << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 4508,\n \"score_of_the_acc\": -0.0682,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3154_4836057\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <chrono>\\n//#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\\n#define Rrep(i,n) Rreps(i,n,0)\\n#define ALL(a) a.begin(), a.end()\\n#define fi first\\n#define se second\\ntypedef long long ll;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n\\nll N,M,H,W,Q,K,A,B;\\nstring S;\\ntypedef pair<ll, ll> P;\\nconst ll INF = (1LL<<60);\\n\\nclass mint {\\npublic:\\n ll x;\\n static ll mod;\\n static unsigned long long mod_plus;\\n static bool prime;\\n\\n static void set_mod(ll _mod, bool _prime = false) {\\n mint::mod = _mod;\\n mint::mod_plus = (LLONG_MAX / mod) * mod;\\n mint::prime = _prime;\\n }\\n\\n mint() { x = 0; }\\n\\n mint(ll _x) : x(_x < 0 ? ((_x += mod_plus) < 0 ? _x + mod_plus : _x) : _x){\\n if(x >= mod) x %= mod;\\n }\\n\\n mint operator-() {\\n return x == 0 ? 0 : mod - x;\\n }\\n\\n mint &operator+=(const mint &a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n mint operator+(const mint &a) const {\\n return mint(*this) += a;\\n }\\n\\n mint &operator-=(const mint &a) {\\n if ((x -= a.x) < 0) x += mod;\\n return *this;\\n }\\n\\n mint operator-(const mint &a) const {\\n return mint(*this) -= a;\\n }\\n\\n mint &operator*=(const mint &a) {\\n (x *= a.x) %= mod;\\n return *this;\\n }\\n\\n mint operator*(const mint &a) const {\\n return mint(*this) *= a;\\n }\\n\\n mint pow(unsigned long long pw) const {\\n mint res(1), comp(*this);\\n while (pw) {\\n if (pw & 1) res *= comp;\\n comp *= comp;\\n pw >>= 1;\\n }\\n return res;\\n }\\n\\n //modと互いに素な数aなら可能\\n mint inv() const {\\n if(prime){\\n return mint(*this).pow(mod - 2);\\n }else {\\n // return p = (s.x, s.y) : a * p.fi + b * p.se = gcd(a, b);\\n // 不要なのでxは省略\\n ll su = mod, sy = 0, tu = x, ty = 1;\\n while (tu != 0) {\\n ll temp = su / tu;\\n su -= tu * temp;\\n sy -= ty * temp;\\n swap(su, tu);\\n swap(sy, ty);\\n }\\n return sy;\\n }\\n }\\n\\n mint &operator/=(const mint &a) {\\n (x *= a.inv().x) %= mod;\\n return *this;\\n }\\n\\n mint operator/(const mint &a) const {\\n mint res(*this);\\n return res /= a;\\n }\\n};\\nostream& operator<<(ostream& os, const mint& a){\\n os << a.x;\\n return os;\\n}\\nlong long mint::mod;\\nunsigned long long mint::mod_plus;\\nbool mint::prime;\\nusing vm = vector<mint>;\\n\\nmint find_mul(int y, int z, vm &d){\\n mint res(1);\\n res *= mint(d[M]).pow(z / M);\\n z %= M;\\n res *= d[y + z - 1];\\n res /= d[y - 1];\\n return res;\\n}\\n\\nll temp_pow(int x, mint _pw){\\n ll pw = _pw.x, res(1), dbl(x);\\n while(pw){\\n if(pw&1) (res *= dbl) %= N + 1;\\n (dbl *= dbl) %= N + 1;\\n pw >>= 1;\\n }\\n return res;\\n}\\n\\nint main() {\\n cin>>N>>M>>Q;\\n mint::set_mod(N, false);\\n vm d(M + 1, 1);\\n rep(i, M) cin>>d[i + 1].x;\\n rep(i, M) d.push_back(d[i + 1]);\\n rep(i, M * 2) d[i + 1] *= d[i];\\n rep(_, Q){\\n int x, y, z;\\n cin>>x>>y>>z;\\n mint mul = find_mul(y, z, d);\\n cout<<temp_pow(x, mul.inv())<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -0.0551,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":1973,"cells":{"group_id":{"kind":"string","value":"aoj_3153_cpp"},"problem_description":{"kind":"string","value":"Problem C: Flip Difference Sequence\nProblem\nツバサさんは $N$ 個の整数からなる数列 $A=\\{A_1,A_2,\\ldots,A_N\\}$ と、縦 $N$ 行、横 $N$ 列のマス目 $B, X$ を持っています。\nまた、 $B, X$ のすべてのマスにははじめ $0$ が書き込んであります。\n以降、 $B, X$ の上から $i$ 行目、左から $j$ 列目に書き込んである数をそれぞれ $B_{i,j},\\,X_{i,j}$ と表記します。\nツバサさんは最初、任意の $(i,j)(1\\leq i,j\\leq N)$ に対し、 $X_{i,j}=1$ または $X_{i,j}=-1$ と初期化します。ここで、各マスに $1$ を設定するか $-1$ を設定するかは、各\n\t$(i,j)$ ごとに独立に決めることができるものとします。\n次に、 $B$ のマスに書いてある数を以下のようにして、上の行から書き換えます。\n$B_{1,j}=A_j (1 \\leq j \\leq N)$\n$B_{i+1,j}=X_{i+1,j} \\times (B_{i,j}-B_{i,j+1}) (1 \\leq i,j \\leq N-1)$\nツバサさんが $X$ の各マスの値をうまく設定したとき、 $B_{N,1}$ としてありえる最大値を求めてください。ただし答えは非常に大きくなる可能性があるので、 $10^9+7$ で割ったあまりを出力してください。\nConstraints\n入力は以下の条件を満たす。\n$2 \\leq N \\leq 2 \\times 10^5$\n$-10^9 \\leq A_i \\leq 10^9 (1 \\leq i \\leq N)$\n入力はすべて整数である。\nInput\n以下の形式で標準入力から与えられる。\n$N$\n$A_1$ $A_2$ $\\ldots$ $A_N$\nOutput\n答えを一行で出力してください。\n末尾に改行を出力するのを忘れないようにしてください。\nSample Input 1\n3\n5 7 5\nSample Output 1\n4\n例えば、\n$\n\tX=\n\t\\begin{pmatrix}\n\t-1 & -1 & 1 \\\\\n\t-1 & -1 & 1 \\\\\n\t1 & 1 & -1 \\\\\n\t\\end{pmatrix}\n\t$\nとすればよいです。このとき、\n$\n\tB=\n\t\\begin{pmatrix}\n\t5 & 7 & 5 \\\\\n\t2 & -2 & 0 \\\\\n\t4 & -2 & 0 \\\\\n\t\\end{pmatrix}\n\t$\nとなります(全ての行を同時に書き換えるのではなく、上から順に書き換えることに注意してください)。\n$B_{3,1}$ を $4$ より大きくするような $X$ は存在しないので、 $4$ を出力します。\nSample Input 2\n5\n4 2 16 8 1\nSample Output 2\n75\nSample Input 3\n9\n-111111111 222222222 -333333333 444444444 -555555555 666666666 -777777777 888888888 -999999999\nSample Output 3\n222221086\nオーバーフローに注意してください。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3153_10086332","code_snippet":"// competitive-verifier: PROBLEM\n#include <cassert>\n#include <vector>\n#include <cstdint>\n#include <iostream>\n#include <type_traits>\n#include <utility>\nnamespace internal {\n// @param m `1 <= m`\n// @return x mod m\nconstexpr std::int64_t safe_mod(std::int64_t x, std::int64_t m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n std::uint64_t im;\n // @param m `1 <= m`\n explicit barrett(unsigned int m) : _m(m), im((std::uint64_t)(-1) / m + 1) {}\n // @return m\n unsigned int umod() const { return _m; }\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n std::uint64_t z = a;\n z *= b;\n std::uint64_t x = (std::uint64_t)(((__uint128_t)(z)*im) >> 64);\n std::uint64_t y = x * _m;\n return (unsigned int)(z - y + (z < y ? _m : 0));\n }\n};\nstruct montgomery {\n std::uint64_t _m;\n std::uint64_t im;\n std::uint64_t r2;\n // @param m `1 <= m`\n explicit constexpr montgomery(std::uint64_t m) : _m(m), im(m), r2(-__uint128_t(m) % m) {\n for (int i = 0; i < 5; ++i) im = im * (2 - _m * im);\n im = -im;\n }\n // @return m\n constexpr std::uint64_t umod() const { return _m; }\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n constexpr std::uint64_t mul(std::uint64_t a, std::uint64_t b) const { return mr(mr(a, b), r2); }\n constexpr std::uint64_t exp(std::uint64_t a, std::uint64_t b) const {\n std::uint64_t res = 1, p = mr(a, r2);\n while (b) {\n if (b & 1) res = mr(res, p);\n p = mr(p, p);\n b >>= 1;\n }\n return res;\n }\n constexpr bool same_pow(std::uint64_t x, int s, std::uint64_t n) const {\n x = mr(x, r2), n = mr(n, r2);\n for (int r = 0; r < s; r++) {\n if (x == n) return true;\n x = mr(x, x);\n }\n return false;\n }\n private:\n constexpr std::uint64_t mr(std::uint64_t x) const {\n return ((__uint128_t)(x * im) * _m + x) >> 64;\n }\n constexpr std::uint64_t mr(std::uint64_t a, std::uint64_t b) const {\n __uint128_t t = (__uint128_t)a * b;\n std::uint64_t inc = std::uint64_t(t) != 0;\n std::uint64_t x = t >> 64, y = ((__uint128_t)(a * b * im) * _m) >> 64;\n unsigned long long z = 0;\n bool f = __builtin_uaddll_overflow(x, y, &z);\n z += inc;\n return f ? z - _m : z;\n }\n};\nconstexpr bool is_SPRP32(std::uint32_t n, std::uint32_t a) {\n std::uint32_t d = n - 1, s = 0;\n while ((d & 1) == 0) ++s, d >>= 1;\n std::uint64_t cur = 1, pw = d;\n while (pw) {\n if (pw & 1) cur = (cur * a) % n;\n a = (std::uint64_t)a * a % n;\n pw >>= 1;\n }\n if (cur == 1) return true;\n for (std::uint32_t r = 0; r < s; r++) {\n if (cur == n - 1) return true;\n cur = cur * cur % n;\n }\n return false;\n}\n// given 2 <= n,a < 2^64, a prime, check whether n is a-SPRP\nconstexpr bool is_SPRP64(const montgomery &m, std::uint64_t a) {\n auto n = m.umod();\n if (n == a) return true;\n if (n % a == 0) return false;\n std::uint64_t d = n - 1;\n int s = 0;\n while ((d & 1) == 0) ++s, d >>= 1;\n std::uint64_t cur = m.exp(a, d);\n if (cur == 1) return true;\n return m.same_pow(cur, s, n - 1);\n}\nconstexpr bool is_prime_constexpr(std::uint64_t x) {\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\n if (x < 121) return (x > 1);\n montgomery m(x);\n constexpr std::uint64_t bases[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\n for (auto a : bases) {\n if (!is_SPRP64(m, a)) return false;\n }\n return true;\n}\nconstexpr bool is_prime_constexpr(std::int64_t x) {\n if (x < 0) return false;\n return is_prime_constexpr(std::uint64_t(x));\n}\nconstexpr bool is_prime_constexpr(std::uint32_t x) {\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\n if (x < 121) return (x > 1);\n std::uint64_t h = x;\n h = ((h >> 16) ^ h) * 0x45d9f3b;\n h = ((h >> 16) ^ h) * 0x45d9f3b;\n h = ((h >> 16) ^ h) & 255;\n constexpr uint16_t bases[] = {\n 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620, 560,\n 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028,\n 2213, 6219, 620, 3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113,\n 7061, 803, 1269, 3875, 422, 751, 580, 4729, 10239, 746, 2951, 556, 2206,\n 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,\n 15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903,\n 737, 1887, 7447, 1888, 2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41,\n 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352, 6435, 165, 1169, 3315,\n 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,\n 27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524,\n 3577, 236, 2360, 6146, 2850, 55637, 1753, 4178, 8466, 222, 2579, 2743, 2031,\n 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159, 1725, 3597, 3366, 14336,\n 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,\n 434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183,\n 8126, 1870, 3296, 7455, 8947, 25017, 541, 19115, 368, 566, 5674, 411, 522,\n 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007, 35201, 4706, 1152, 1785,\n 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,\n 4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816,\n 5197, 13330, 7054, 2818, 3199, 811, 922, 350, 7514, 4452, 3449, 2663, 4708,\n 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194};\n return is_SPRP32(x, bases[h]);\n}\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr std::int64_t pow_mod_constexpr(std::int64_t x, std::int64_t n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n std::uint64_t r = 1;\n std::uint64_t y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n std::int64_t d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr std::int64_t bases[3] = {2, 7, 61};\n for (std::int64_t a : bases) {\n std::int64_t t = d;\n std::int64_t y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) { return false; }\n }\n return true;\n}\ntemplate <int n>\nconstexpr bool is_prime = is_prime_constexpr(n);\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<std::int64_t, std::int64_t> inv_gcd(std::int64_t a, std::int64_t b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n std::int64_t s = b, t = a;\n std::int64_t m0 = 0, m1 = 1;\n while (t) {\n std::int64_t u = s / t;\n s -= t * u;\n m0 -= m1 * u;\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (std::int64_t)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) { x /= i; }\n }\n }\n if (x > 1) { divs[cnt++] = x; }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m>\nconstexpr int primitive_root = primitive_root_constexpr(m);\n} // namespace internal\n#include <numeric>\nnamespace internal {\ntemplate <class T>\nusing is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;\ntemplate <class T>\nusing is_integral =\n typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value, make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\ntemplate <class T>\nusing to_unsigned_t = typename to_unsigned<T>::type;\n} // namespace internal\nnamespace internal {\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\ntemplate <class T>\nusing is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T>\nusing is_modint_t = std::enable_if_t<is_modint<T>::value>;\n} // namespace internal\ntemplate <int m, std::enable_if_t<(1 <= m)> * = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n public:\n static constexpr int mod() { return m; }\n static constexpr mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n constexpr static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T> * = nullptr>\n constexpr static_modint(T v) : _v(0) {\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\n constexpr static_modint(T v) : _v(0) {\n _v = (unsigned int)(v % umod());\n }\n constexpr unsigned int val() const { return _v; }\n constexpr mint &operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n constexpr mint &operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n constexpr mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n constexpr mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n constexpr mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n constexpr mint &operator-=(const mint &rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n constexpr mint &operator*=(const mint &rhs) {\n std::uint64_t z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n constexpr mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n constexpr mint operator+() const { return *this; }\n constexpr mint operator-() const { return mint() - *this; }\n constexpr mint pow(std::int64_t n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n constexpr mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n friend constexpr mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\n friend constexpr mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\n friend constexpr mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\n friend constexpr mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\n friend constexpr bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\n friend constexpr bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\n std::int64_t t;\n is >> t;\n rhs = mint(t);\n return is;\n }\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\n return os << rhs._v;\n }\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\ntemplate <int id>\nstruct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n unsigned int val() const { return _v; }\n mint &operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint &operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint &operator-=(const mint &rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint &operator*=(const mint &rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n mint pow(std::int64_t n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\n friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\n friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\n friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\n friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\n friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\n std::int64_t t;\n is >> t;\n rhs = mint(t);\n return is;\n }\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\n return os << rhs._v;\n }\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id>\ninternal::barrett dynamic_modint<id>::bt(998244353);\nusing modint998 = static_modint<998244353>;\nusing modint107 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\nnamespace internal {\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\ntemplate <class>\nstruct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n} // namespace internal\ntemplate <class mint = modint998, internal::is_modint_t<mint> * = nullptr>\nstruct Combination {\n Combination() : _fact(), _finv() {}\n mint operator()(int n, int k) {\n if (n < k || n < 0 || k < 0) return 0;\n _init(n);\n return _fact[n] * _finv[k] * _finv[n - k];\n }\n mint fact(int x) {\n assert(x >= 0);\n _init(x);\n return _fact[x];\n }\n mint finv(int x) {\n assert(x >= 0);\n _init(x);\n return _finv[x];\n }\n mint naive(int n, int k) const {\n if (n < k || n < 0 || k < 0) return 0;\n if (n - k < k) k = n - k;\n mint res = 1;\n for (int i = 0; i < k; ++i) {\n res *= n - i;\n res /= i + 1;\n }\n return res;\n }\n mint permu(int n, int k) {\n if (n < k || n < 0 || k < 0) return 0;\n _init(n);\n return _fact[n] * _finv[n - k];\n }\n private:\n std::vector<mint> _fact, _finv;\n void _init(int n) {\n if ((int)_fact.size() > n) return;\n int m = _fact.size();\n _fact.resize(n + 1);\n for (int i = m; i <= n; ++i) {\n if (i == 0) _fact[i] = 1;\n else _fact[i] = _fact[i - 1] * i;\n }\n _finv.resize(n + 1);\n _finv[n] = _fact[n].inv();\n for (int i = n - 1; i >= m; --i) _finv[i] = _finv[i + 1] * (i + 1);\n }\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nusing Mint = modint107;\nCombination<Mint> combi;\nint main(void) {\n int n;\n cin >> n;\n vector<int> a(n);\n cin >> a;\n Mint ans = 0;\n rep (i, n - 1) {\n if (a[i] >= a[i + 1])\n ans += combi(n - 2, i) * (a[i] - a[i + 1]);\n else\n ans += combi(n - 2, i) * (a[i + 1] - a[i]);\n }\n co(ans);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5428,"score_of_the_acc":-0.0042,"final_rank":1},{"submission_id":"aoj_3153_4949267","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nll N;\nll A[SIZE];ll fact[SIZE],inv_fact[SIZE];\n\nll mod_pow(ll x,ll count, ll mod){\n\n\tif(count == 0)return 1;\n\tll ret = mod_pow((x*x)%mod,count/2,mod);\n\tif(count%2 == 1){\n\n\t\tret = (ret*x)%mod;\n\t}\n\treturn ret;\n}\n\nll extgcd(ll a,ll b,ll &x,ll &y){\n\tll d = a;\n\tif(b != 0){\n\t\td = extgcd(b,a%b,y,x);\n\t\ty -= (a/b)*x;\n\t}else{\n\t\tx = 1;\n\t\ty = 0;\n\t}\n\treturn d;\n}\n\nll mod_inverse(ll a,ll m){\n ll x,y;\n extgcd(a,m,x,y);\n return (m+x%m)%m;\n}\n\nll nCk(ll n,ll k){\n\n\tif(k > n)return 0;\n\n\tll ret = fact[n]*inv_fact[k];\n\tret %= MOD;\n\tret *= inv_fact[n-k];\n\n\treturn ret%MOD;\n}\n\n\nint main(){\n\n\tfact[0] = 1;\n\tfor(ll i = 1; i < SIZE; i++){\n\t\tfact[i] = i*fact[i-1];\n\t\tfact[i] %= MOD;\n\t}\n\tinv_fact[SIZE-1] = mod_inverse(fact[SIZE-1],MOD);\n\tfor(ll i = SIZE-1; i >= 1; i--){\n\n\t\tinv_fact[i-1] = inv_fact[i]*i;\n\t\tinv_fact[i-1] %= MOD;\n\t}\n\n\tscanf(\"%lld\",&N);\n\n\tll ans = 0;\n\tfor(ll i = 1; i <= N; i++){\n\n\t\tscanf(\"%lld\",&A[i]);\n\t\tif(i >= 2){\n\n\t\t\tll tmp = (abs(A[i]-A[i-1])*nCk(N-2,i-2))%MOD;\n\t\t\tans += tmp;\n\t\t\tans %= MOD;\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":7916,"score_of_the_acc":-0.0602,"final_rank":2},{"submission_id":"aoj_3153_4892930","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing LL = long long int;\n#define incII(i, l, r) for(LL i = (l) ; i <= (r); i++)\n#define incIX(i, l, r) for(LL i = (l) ; i < (r); i++)\n#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)\n#define incXX(i, l, r) for(LL i = (l) + 1; i < (r); i++)\n#define decII(i, l, r) for(LL i = (r) ; i >= (l); i--)\n#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)\n#define decXI(i, l, r) for(LL i = (r) ; i > (l); i--)\n#define decXX(i, l, r) for(LL i = (r) - 1; i > (l); i--)\n#define inc(i, n) incIX(i, 0, n)\n#define dec(i, n) decIX(i, 0, n)\n#define inc1(i, n) incII(i, 1, n)\n#define dec1(i, n) decII(i, 1, n)\nauto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };\nauto inIX = [](auto x, auto l, auto r) { return (l <= x && x < r); };\nauto inXI = [](auto x, auto l, auto r) { return (l < x && x <= r); };\nauto inXX = [](auto x, auto l, auto r) { return (l < x && x < r); };\nauto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };\nauto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };\nauto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };\nauto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define MT make_tuple\n#define FI first\n#define SE second\n#define FR front()\n#define BA back()\n#define ALL(c) c.begin(), c.end()\n#define RALL(c) c.rbegin(), c.rend()\n#define RV(c) reverse(ALL(c))\n#define SC static_cast\n#define SI(c) SC<int>(c.size())\n#define SL(c) SC<LL >(c.size())\n#define RF(e, c) for(auto & e: c)\n#define SF(c, ...) for(auto & [__VA_ARGS__]: c)\n#define until(e) while(! (e))\n#define if_not(e) if(! (e))\n#define ef else if\n#define UR assert(false)\nauto * IS = & cin;\nauto * OS = & cout;\narray<string, 3> SEQ = { \"\", \" \", \"\" };\n// input\ntemplate<typename T> T in() { T a; (* IS) >> a; return a; }\n// input: tuple\ntemplate<int I, typename U> void tin_(istream & is, U & t) {\n\tif constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }\n}\ntemplate<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }\ntemplate<typename ... T> auto tin() { return in<tuple<T ...>>(); }\n// input: array\ntemplate<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }\ntemplate<typename T, size_t N> auto ain() { return in<array<T, N>>(); }\n// input: multi-dimensional vector\ntemplate<typename T> T vin() { T v; (* IS) >> v; return v; }\ntemplate<typename T, typename N, typename ... M> auto vin(N n, M ... m) {\n\tvector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;\n}\n// input: multi-column (tuple<vector>)\ntemplate<typename U, int I> void colin_([[maybe_unused]] U & t) { }\ntemplate<typename U, int I, typename A, typename ... B> void colin_(U & t) {\n\tget<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);\n}\ntemplate<typename ... T> auto colin(int n) {\n\ttuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;\n}\n// output\nvoid out_([[maybe_unused]] string s) { }\ntemplate<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }\ntemplate<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }\nauto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };\nauto out = [](auto ... a) { outF(\"\", \" \" , \"\\n\", a ...); };\nauto outS = [](auto ... a) { outF(\"\", \" \" , \" \" , a ...); };\nauto outL = [](auto ... a) { outF(\"\", \"\\n\", \"\\n\", a ...); };\nauto outN = [](auto ... a) { outF(\"\", \"\" , \"\" , a ...); };\n// output: multi-dimensional vector\ntemplate<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {\n\tos << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? \"\" : SEQ[1]) << v[i]; } return (os << SEQ[2]);\n}\ntemplate<typename T> void vout_(T && v) { (* OS) << v; }\ntemplate<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {\n\tinc(i, SI(v)) { (* OS) << (i == 0 ? \"\" : a); vout_(v[i], b ...); }\n}\ntemplate<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }\ntemplate<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << flush; }\n\n// ---- ----\n\ntemplate<LL M> class ModInt {\nprivate:\n\tLL v;\n\tpair<LL, LL> ext_gcd(LL a, LL b) {\n\t\tif(b == 0) { assert(a == 1); return { 1, 0 }; }\n\t\tauto p = ext_gcd(b, a % b);\n\t\treturn { p.SE, p.FI - (a / b) * p.SE };\n\t}\npublic:\n\tModInt(LL vv = 0) { v = vv; if(abs(v) >= M) { v %= M; } if(v < 0) { v += M; } }\n\tLL val() { return v; }\n\tstatic LL mod() { return M; }\n\tModInt inv() { return ext_gcd(M, v).SE; }\n\tModInt exp(LL b) {\n\t\tModInt p = 1, a = v; if(b < 0) { a = a.inv(); b = -b; }\n\t\twhile(b) { if(b & 1) { p *= a; } a *= a; b >>= 1; }\n\t\treturn p;\n\t}\n\tfriend bool operator< (ModInt a, ModInt b) { return (a.v < b.v); }\n\tfriend bool operator> (ModInt a, ModInt b) { return (a.v > b.v); }\n\tfriend bool operator<=(ModInt a, ModInt b) { return (a.v <= b.v); }\n\tfriend bool operator>=(ModInt a, ModInt b) { return (a.v >= b.v); }\n\tfriend bool operator==(ModInt a, ModInt b) { return (a.v == b.v); }\n\tfriend bool operator!=(ModInt a, ModInt b) { return (a.v != b.v); }\n\tfriend ModInt operator+ (ModInt a ) { return ModInt(+a.v); }\n\tfriend ModInt operator- (ModInt a ) { return ModInt(-a.v); }\n\tfriend ModInt operator+ (ModInt a, ModInt b) { return ModInt(a.v + b.v); }\n\tfriend ModInt operator- (ModInt a, ModInt b) { return ModInt(a.v - b.v); }\n\tfriend ModInt operator* (ModInt a, ModInt b) { return ModInt(a.v * b.v); }\n\tfriend ModInt operator/ (ModInt a, ModInt b) { return a * b.inv(); }\n\tfriend ModInt operator^ (ModInt a, LL b) { return a.exp(b); }\n\tfriend ModInt & operator+=(ModInt & a, ModInt b) { return (a = a + b); }\n\tfriend ModInt & operator-=(ModInt & a, ModInt b) { return (a = a - b); }\n\tfriend ModInt & operator*=(ModInt & a, ModInt b) { return (a = a * b); }\n\tfriend ModInt & operator/=(ModInt & a, ModInt b) { return (a = a / b); }\n\tfriend ModInt & operator^=(ModInt & a, LL b) { return (a = a ^ b); }\n\tfriend istream & operator>>(istream & s, ModInt & b) { s >> b.v; b = ModInt(b.v); return s; }\n\tfriend ostream & operator<<(ostream & s, ModInt b) { return (s << b.v); }\n};\n\n// ----\n\ntemplate<typename T> struct Combination {\n\tLL n;\n\tvector<T> f, r;\n\tCombination(LL n) : n(n) {\n\t\tf = r = vector<T>(n + 1);\n\t\tinc(i, n + 1) { f[i] = (i == 0 ? 1 : f[i - 1] * i ); }\n\t\tdec(i, n + 1) { r[i] = (i == n ? f[n].inv() : r[i + 1] * (i + 1)); }\n\t}\n\tT P(LL a, LL b) {\n\t\tassert(inII(a, 0, n) && inII(b, 0, n));\n\t\treturn (a < b ? 0 : f[a] * r[a - b]);\n\t}\n\tT C(LL a, LL b) {\n\t\tassert(inII(a, 0, n) && inII(b, 0, n));\n\t\treturn (a < b ? 0 : f[a] * r[a - b] * r[b]);\n\t}\n\tT H(LL a, LL b) {\n\t\tassert(inII(a, 0, n) && inII(b, 0, n) && inII(a + b - 1, -1, n));\n\t\treturn (a == 0 ? (b == 0 ? 1 : 0) : f[a + b - 1] * r[a - 1] * r[b]);\n\t}\n};\n\nusing MI = ModInt<1'000'000'007>;\n\nint main() {\n\tauto n = in<int>();\n\tauto a = vin<int>(n);\n\t\n\tCombination<MI> c(n - 2);\n\tMI ans = 0;\n\tincII(i, 0, n - 2) { ans += c.C(n - 2, i) * abs(a[i + 1] - a[i]); }\n\tout(ans);\n}","accuracy":1,"time_ms":50,"memory_kb":7060,"score_of_the_acc":-0.193,"final_rank":9},{"submission_id":"aoj_3153_4874422","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\ntemplate <int mod>\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator-=(const ModInt &p) {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator*=(const ModInt &p) {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n bool operator==(const ModInt &p) const { return x == p.x; }\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\n\nconst int mod = 1e9 + 7;\nusing mint = ModInt<mod>;\n\nconst int N = 200002;\nmint f[N], invf[N];\nmint C(int n, int r) { return f[n] * invf[r] * invf[n - r]; }\n\nint main() {\n f[0] = 1;\n for (int i = 1; i < N; ++i) f[i] = f[i - 1] * i;\n invf[N - 1] = f[N - 1].inverse();\n for (int i = N - 2; i >= 0; --i) invf[i] = invf[i + 1] * (i + 1);\n\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i, n) cin >> a[i];\n\n mint ans = 0;\n rep(i, n - 1) {\n mint x = abs(a[i] - a[i + 1]);\n ans += C(n - 2, i) * x;\n }\n cout << ans << \"\\n\";\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":5180,"score_of_the_acc":-0.2759,"final_rank":11},{"submission_id":"aoj_3153_4861042","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(1e9 + 7)>\nstruct ModInt {\n int x;\n ModInt() : x(0) {}\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n ModInt &operator+=(const ModInt &p) {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator-=(const ModInt &p) {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator*=(const ModInt &p) {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n ModInt operator-() const { return ModInt(-x); }\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n bool operator==(const ModInt &p) const { return x == p.x; }\n bool operator!=(const ModInt &p) const { return x != p.x; }\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n static int get_mod() { return mod; }\n};\n\nstruct Combination {\n vector<ModInt<>> _fact, _rfact, _inv;\n Combination(long long nsize = 5000000)\n : _fact(nsize + 1), _rfact(nsize + 1), _inv(nsize + 1) {\n _fact[0] = _rfact[nsize] = _inv[0] = 1;\n for (int i = 1; i <= nsize; i++) _fact[i] = _fact[i - 1] * i;\n _rfact[nsize] /= _fact[nsize];\n for (int i = nsize - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\n for (int i = 1; i <= nsize; i++) _inv[i] = _rfact[i] * _fact[i - 1];\n }\n inline ModInt<> fact(int k) const { return _fact[k]; }\n\n inline ModInt<> rfact(int k) const { return _rfact[k]; }\n\n inline ModInt<> inv(int k) const { return _inv[k]; }\n\n ModInt<> P(int n, int r) const {\n if (r < 0 || n < r) return 0;\n return fact(n) * rfact(n - r);\n }\n\n ModInt<> C(int p, int q) const {\n if (q < 0 || p < q) return 0;\n return fact(p) * rfact(q) * rfact(p - q);\n }\n // n types,choose r\n ModInt<> H(int n, int r) const {\n if (n < 0 || r < 0) return (0);\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\n\nint n, bf;\nCombination com;\n\nint main() {\n cin >> n >> bf;\n ModInt<> res;\n for (int i = 1; i < n; ++i) {\n int now, diff;\n cin >> now;\n diff = abs(now - bf);\n res += com.C(n - 2, i - 1) * diff;\n bf = now;\n }\n cout << res << endl;\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":61608,"score_of_the_acc":-0.6511,"final_rank":17},{"submission_id":"aoj_3153_4844235","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <array>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <cassert>\n#include <iomanip>\n#define vll vector<ll>\n#define vvvl vector<vvl>\n#define vvl vector<vector<ll>>\n#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))\n#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));\n#define re(c, b) for(ll c=0;c<b;c++)\n#define all(obj) (obj).begin(), (obj).end()\ntypedef long long int ll;\ntypedef long double ld;\nusing namespace std;\n\n#define P 1000000007\n#define N_MAX 10000000\nll fac[N_MAX+1], inv[N_MAX+1], finv[N_MAX+1];\nll comb(ll n, ll k){\n if(n<0||k<0||n<k) return 0;\n return (((fac[n]*finv[n-k])%P)*finv[k])%P;\n}\nll perm(ll n, ll k){\n if(n<0||k<0||n<k) return 0;\n return (fac[n]*finv[n-k])%P;\n}\nvoid init(){\n fac[0] = finv[0] = fac[1] = finv[1] = inv[1] = 1;\n for(int i = 2; i <= N_MAX; i++){\n fac[i] = (fac[i-1]*i)%P;\n inv[i] = ((-(P/i)*inv[P%i])%P+P)%P;\n finv[i] = (finv[i-1]*inv[i])%P;\n }\n}\nll pp(ll a, ll b){ return (a * b)%P;}\nll mpow(ll a, ll b, ll p = -1){\n ll ret = 1, num = a;\n while(b>0){\n if(b&1) ret = (ret*num)%p;\n num = (num*num)%p;\n b /= 2;\n }\n return ret;\n}\nint main(){\n ll n;std::cin >> n;\n init();\n vll a(n), b(n-1);\n re(i, n) scanf(\"%lld\", &a[i]);\n re(i, n-1) b[i] = abs(a[i] - a[i+1])%P;\n ll ans = 0;\n ll N = n-1;\n for(int i=0;i<N;i++){\n ans = (ans + (b[i]*comb(N-1, i))%P)%P;\n }\n std::cout << ans << '\\n';\n}","accuracy":1,"time_ms":230,"memory_kb":240676,"score_of_the_acc":-2,"final_rank":19},{"submission_id":"aoj_3153_4840774","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n//----------------------- Print Function ----------------------//\n\ninline void print() {\n cout << '\\n';\n}\ntemplate <typename First, typename... Rest>\nvoid print(const First &first, const Rest &... rest) {\n cout << first << ' ';\n print(rest...);\n}\n\ntemplate <typename T>\nvoid print(const T &a) {\n for (auto e : a) cout << e << ' ';\n cout << '\\n';\n}\n\n//------------------------- Libraries -------------------------//\n\ntemplate<int MOD> struct Fp {\n long long val;\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\n if (val < 0) val += MOD;\n }\n constexpr int getmod() { return MOD; }\n constexpr Fp operator - () const noexcept {\n return val ? MOD - val : 0;\n }\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\n constexpr Fp& operator += (const Fp& r) noexcept {\n val += r.val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -= (const Fp& r) noexcept {\n val -= r.val;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp& operator *= (const Fp& r) noexcept {\n val = val * r.val % MOD;\n return *this;\n }\n constexpr Fp& operator /= (const Fp& r) noexcept {\n long long a = r.val, b = MOD, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n val = val * u % MOD;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr bool operator == (const Fp& r) const noexcept {\n return this->val == r.val;\n }\n constexpr bool operator != (const Fp& r) const noexcept {\n return this->val != r.val;\n }\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\n return os << x.val;\n }\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\n if (n == 0) return 1;\n auto t = modpow(a, n / 2);\n t = t * t;\n if (n & 1) t = t * a;\n return t;\n }\n};\nusing mint = Fp<1000000007>;\n\nconst int MAX = 1000000;\nconst int MOD = 1000000007;\n \nlong long fac[MAX], finv[MAX], inv[MAX];\n \nvoid COMinit(){\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n \nlong long COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n \nlong long Perm(int n, int k) {\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * finv[n - k] % MOD;\n}\n\n//--------------------------- Solve ---------------------------//\n\nvoid solve() {\n int n; cin >> n;\n vector<long long> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n\n vector<long long> b(n-1);\n for (int i = 0; i < n-1; i++) {\n if (i % 2 == 0) {\n if (a[i] > a[i+1]) b[i] = a[i] - a[i+1];\n else b[i] = -(a[i] - a[i+1]);\n }\n else {\n if (a[i] > a[i+1]) b[i] = -(a[i] - a[i+1]);\n else b[i] = a[i] - a[i+1];\n }\n }\n\n COMinit(); \n\n mint ans = 0;\n for (int i = 0; i < n-1; i++) {\n if (i % 2 == 0) ans += b[i] * COM(n-2, i);\n else ans -= b[i] * COM(n-2, i);\n }\n\n cout << ans << '\\n';\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":29580,"score_of_the_acc":-0.1519,"final_rank":8},{"submission_id":"aoj_3153_4840768","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n//----------------------- Print Function ----------------------//\n\ninline void print() {\n cout << '\\n';\n}\ntemplate <typename First, typename... Rest>\nvoid print(const First &first, const Rest &... rest) {\n cout << first << ' ';\n print(rest...);\n}\n\ntemplate <typename T>\nvoid print(const T &a) {\n for (auto e : a) cout << e << ' ';\n cout << '\\n';\n}\n\n//------------------------- Libraries -------------------------//\n\ntemplate<int MOD> struct Fp {\n long long val;\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\n if (val < 0) val += MOD;\n }\n constexpr int getmod() { return MOD; }\n constexpr Fp operator - () const noexcept {\n return val ? MOD - val : 0;\n }\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\n constexpr Fp& operator += (const Fp& r) noexcept {\n val += r.val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -= (const Fp& r) noexcept {\n val -= r.val;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp& operator *= (const Fp& r) noexcept {\n val = val * r.val % MOD;\n return *this;\n }\n constexpr Fp& operator /= (const Fp& r) noexcept {\n long long a = r.val, b = MOD, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n val = val * u % MOD;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr bool operator == (const Fp& r) const noexcept {\n return this->val == r.val;\n }\n constexpr bool operator != (const Fp& r) const noexcept {\n return this->val != r.val;\n }\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\n return os << x.val;\n }\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\n if (n == 0) return 1;\n auto t = modpow(a, n / 2);\n t = t * t;\n if (n & 1) t = t * a;\n return t;\n }\n};\nusing mint = Fp<1000000007>;\n\nconst int MAX = 1000000;\nconst int MOD = 1000000007;\n \nlong long fac[MAX], finv[MAX], inv[MAX];\n \nvoid COMinit(){\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n \nlong long COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n \nlong long Perm(int n, int k) {\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * finv[n - k] % MOD;\n}\n\n//--------------------------- Solve ---------------------------//\n\nvoid solve() {\n int n; cin >> n;\n vector<long long> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n\n vector<long long> b(n-1);\n for (int i = 0; i < n; i++) {\n if (i % 2 == 0) {\n if (a[i] > a[i+1]) b[i] = a[i] - a[i+1];\n else b[i] = -(a[i] - a[i+1]);\n }\n else {\n if (a[i] > a[i+1]) b[i] = -(a[i] - a[i+1]);\n else b[i] = a[i] - a[i+1];\n }\n }\n\n COMinit(); \n\n mint ans = 0;\n for (int i = 0; i < n-1; i++) {\n if (i % 2 == 0) ans += b[i] * COM(n-2, i);\n else ans -= b[i] * COM(n-2, i);\n }\n\n cout << ans << '\\n';\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":0.13043478260869565,"time_ms":10,"memory_kb":26872,"score_of_the_acc":-0.095,"final_rank":20},{"submission_id":"aoj_3153_4840090","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\n#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];\n#define ft first\n#define sc second\n#define pb push_back\n#define lb lower_bound\n#define ub upper_bound\n#define all(v) (v).begin(),(v).end()\n#define LB(a,x) lb(all(a),x)-a.begin()\n#define UB(a,x) ub(all(a),x)-a.begin()\n#define mod 1000000007\n//#define mod 998244353\n#define FS fixed<<setprecision(15)\nusing namespace std;\ntypedef long long ll;\nconst double pi=3.141592653589793;\ntemplate<class T> using V=vector<T>;\nusing Graph = vector<vector<int>>;\nusing P=pair<ll,ll>;\ntypedef unsigned long long ull;\ntypedef long double ldouble;\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline void out(T a){ cout << a << '\\n'; }\nvoid YN(bool ok){if(ok) cout << \"Yes\" << endl; else cout << \"No\" << endl;}\n//void YN(bool ok){if(ok) cout << \"YES\" << endl; else cout << \"NO\" << endl;}\n\n\nconst ll INF=1e18;\nconst int mx=200005;\n//wupc\n\nll mod_pow(ll x,ll n,ll m){\n if(n==0) return 1;\n ll res=mod_pow(x*x%m,n/2,m);\n if(n&1) res=res*x%m;\n return res;\n}\n\nll modinv(ll n){\n return mod_pow(n,mod-2,mod);\n}\n\nint main(){\n cin.tie(0);ios::sync_with_stdio(false);\n ll n;\n cin>>n;\n V<ll> a(n);\n cinf(n,a);\n ll ans=0;\n ll c[n];\n c[0]=1;\n for(ll i=1;i<=n-1;i++){\n c[i]=(c[i-1]*(n-i-1))%mod;\n c[i]=(c[i]*modinv(i))%mod;\n }\n for(ll i=0;i<n-1;i++) ans=(ans+abs(a[i]-a[i+1])*c[i]%mod)%mod;\n out(ans);\n}","accuracy":1,"time_ms":90,"memory_kb":6000,"score_of_the_acc":-0.3703,"final_rank":15},{"submission_id":"aoj_3153_4837259","code_snippet":"#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <set>\n#include <iomanip>\n#include <numeric>\n#include <queue>\n#include <string>\n#include <map>\n#include <fstream>\n#include <cassert>\n#include <stack>\n#include <climits>\n#include <array>\n#include <unordered_set>\n#include <unordered_map>\n#include <memory>\n#include <functional>\n#include <cfloat>\nconstexpr long long int MOD = 1000000007LL;\n\n\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<long long int> factorial(n, 1), div(n, 1), inverse(n, 1);\n\tfor (auto i = 2; i < factorial.size(); ++i) {\n\t\tfactorial[i] = i * factorial[i - 1] % MOD;\n\t\tdiv[i] = (MOD - MOD / i) * div[MOD % i] % MOD;\n\t\tinverse[i] = div[i] * inverse[i - 1] % MOD;\n\t}\n\tconst auto combination = [&factorial, &inverse](const int n, const int r) {\n\t\treturn factorial[n] * inverse[n - r] % MOD * inverse[r] % MOD;\n\t};\n\tstd::vector<long long int> series(n);\n\tfor (auto& a : series) std::cin >> a;\n\tlong long int result{ 0 };\n\tfor (auto i = 0; i < n - 1; ++i) {\n\t\tresult += std::abs(series[i] - series[i + 1]) * combination(n - 2, i) % MOD;\n\t}\n\tstd::cout << result % MOD << '\\n';\n}","accuracy":1,"time_ms":50,"memory_kb":9404,"score_of_the_acc":-0.2029,"final_rank":10},{"submission_id":"aoj_3153_4837141","code_snippet":"#include <bits/stdc++.h>\n \nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n \n \n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SQ(a) ((a)*(a))\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n \n \n//repetition\n//------------------------------------------\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\n#define REP(i,n) FOR(i,0,n)\n#define MOD 1000000007\n \n \n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n \ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n \n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\n\nconst long double EPS = 1e-6, PI = acos((long double)-1);\n\n//ここから編集\n\nll GCD(ll a, ll b){\n return (b == 0)?a:GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b)*b;\n}\n \nconst int MAX = 2000010;\nlong long fac[MAX], finv[MAX], inv[MAX];\n \n// テーブルを作る前処理\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n \n// 二項係数計算\nlong long COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(4);\n\n int N; cin >> N;\n vector<ll> A(N);\n REP(i,N) cin >> A[i];\n COMinit();\n vector<ll> B(N);\n REP(i,N-1){\n B[i] = abs(A[i]-A[i+1]);\n }\n\n ll ans = 0;\n REP(i,N-1){\n ans += B[i] * COM(N-2, i);\n ans %= MOD;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":52724,"score_of_the_acc":-0.4317,"final_rank":16},{"submission_id":"aoj_3153_4835176","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define pb push_back\n#define fi first\n#define se second\ntypedef pair<ll, ll> P;\nusing VP = vector<P>;\nusing VVP = vector<VP>;\nusing VI = vector<ll>;\nusing VVI = vector<VI>;\nusing VVVI = vector<VVI>;\nconst int inf = 1e9 + 7;\nconst ll INF = 1LL << 61;\nconst ll mod = 1e9 + 7;\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nvector<ll> inv, fact, invfact;\nvoid Mod_build(int n = 201010) {\n fact.resize(n + 1);\n inv.resize(n + 1);\n invfact.resize(n + 1);\n fact[0] = inv[0] = invfact[0] = 1;\n inv[1] = 1;\n for (ll i = 0; i < n; i++) {\n fact[i + 1] = fact[i] * (i + 1) % mod;\n if (i > 0) inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;\n invfact[i + 1] = invfact[i] * inv[i + 1] % mod;\n }\n}\nll perm(int n, int k) {\n if (n < 0 || k < 0 || k > n) return 0;\n return fact[n] * invfact[n - k] % mod;\n}\nll comb(int n, int k) {\n if (n < 0 || k < 0 || k > n) return 0;\n return (fact[n] * invfact[n - k] % mod) * invfact[k] % mod;\n}\nll powmod(ll n, ll k) {\n k %= mod - 1;\n if (k < 0) k += mod - 1;\n ll ret = 1;\n while (k) {\n if (k & 1) ret = ret * n % mod;\n n = n * n % mod;\n k >>= 1;\n }\n return ret;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int i, j;\n Mod_build();\n ll n;\n cin >> n;\n ll a[n];\n for (i = 0; i < n; i++) cin >> a[i];\n ll ans = 0;\n ll ref = 1;\n for (i = 0; i < n - 1; i++) {\n ans += ref * abs(a[i + 1] - a[i]);\n ref = comb(n - 1, i + 1) + mod - ref;\n ref %= mod;\n ans %= mod;\n // cout << ref << endl;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":9404,"score_of_the_acc":-0.0665,"final_rank":3},{"submission_id":"aoj_3153_4835118","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\nconst int MOD=1e9+7;\n\nstd::vector<int> Factorial(5e6),Finverse(5e6);\nint pw(int n,int k){\n assert(k>=0);\n int res=1;\n while(k){\n if(k&1)(res*=n)%=MOD;\n (n*=n)%=MOD;\n k>>=1;\n }\n return res;\n}\ninline void Cinit(){\n Factorial[0]=1;\n for(int i=1;i<5e6;i++)Factorial[i]=(Factorial[i-1]*i)%MOD;\n Finverse[4999999]=pw(Factorial[4999999],MOD-2);\n for(int i=4999998;i>=0;i--)Finverse[i]=(i+1)*Finverse[i+1]%MOD;\n}\nint nCk(int n,int k){\n if(n<k)return 0;if(k<0)return 0;\n if(!Factorial[0])Cinit();\n int res=Factorial[n];\n (res*=Finverse[k])%=MOD;\n (res*=Finverse[n-k])%=MOD;\n return res;\n}\n\nsigned main(){\n int n;cin>>n;\n vector<int>v(n);\n for(int i=0;i<n;i++)cin>>v[i];\n vector<int> w(n-1);\n for(int i=0;i<n-1;i++)w[i]=abs(v[i]-v[i+1]);\n int ans=0;\n for(int i=0;i<n-1;i++)(ans+=nCk(n-2,i)*w[i]%MOD)%=MOD;\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":130,"memory_kb":84116,"score_of_the_acc":-0.8828,"final_rank":18},{"submission_id":"aoj_3153_4835067","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define P pair<ll,ll>\n#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)\n#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)\n#define TO(x,t,f) ((x)?(t):(f))\n#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9\n#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v x is sorted\n#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v x is sorted\n#define NUM(x,v) (POSU(x,v)-POSL(x,v)) //x is sorted\n#define REV(x) (reverse(x.begin(),x.end())) //reverse\nll gcd_(ll a,ll b){if(a%b==0)return b;return gcd_(b,a%b);}\nll lcm_(ll a,ll b){ll c=gcd_(a,b);return ((a/c)*(b/c)*c);}\n#define NEXTP(x) next_permutation(x.begin(),x.end())\nconst ll INF=ll(1e16)+ll(7);\nconst ll MOD=1000000007LL;\n#define out(a) cout<<fixed<<setprecision((a))\n//tie(a,b,c) = make_tuple(10,9,87);\n#define pop_(a) __builtin_popcount((a))\nll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}\n\nll calc(ll x,ll a){\n\tif(a==0) return 1LL;\n\tll res = calc(x,a/2);\n\tres = res*res % MOD;\n\tif(a&1)res = res*x % MOD;\n\treturn res;\n}\n\n\nint main(){\n\n\tll N;\n\tcin >> N;\n\tvector<ll> A(N);\n\tFOR(i,0,N) cin >> A[i];\n\n\tll ans = 0;\n\tll a = 1;\n\tFOR(i,0,N-1){\n\t\tll k = abs(A[i] - A[i+1]) % MOD;\n\t\t(ans += a*k%MOD) %= MOD;\n\t\ta *= N - 2 - i;\n\t\ta %= MOD;\n\t\ta *= calc(i+1,MOD-2);\n\t\ta %= MOD;\n\t}\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":90,"memory_kb":4428,"score_of_the_acc":-0.3636,"final_rank":14},{"submission_id":"aoj_3153_4834943","code_snippet":"/**\n * author: otera \n**/\n#include<iostream>\n#include<string> \n#include<cstdio>\n#include<cstring>\n#include<vector>\n#include<cmath>\n#include<algorithm> \n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<deque>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\n#define int long long\ntypedef long long ll;\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\ntypedef long double ld;\nconst int inf=1e9+7;\nconst ll INF=1LL<<60 ;\nconst ll mod=1e9+7 ;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef complex<ld> Point;\nconst ld eps = 1e-8;\nconst ld pi = acos(-1.0);\ntypedef pair<int, int> P;\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define debug(x) cerr << #x << \" = \" << (x) << endl;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n// modint: mod 計算を int を扱うように扱える構造体\ntemplate<int MOD> struct Fp {\n long long val;\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\n if (val < 0) val += MOD;\n }\n constexpr int getmod() { return MOD; }\n constexpr Fp operator - () const noexcept {\n return val ? MOD - val : 0;\n }\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\n constexpr Fp& operator += (const Fp& r) noexcept {\n val += r.val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -= (const Fp& r) noexcept {\n val -= r.val;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp& operator *= (const Fp& r) noexcept {\n val = val * r.val % MOD;\n return *this;\n }\n constexpr Fp& operator /= (const Fp& r) noexcept {\n long long a = r.val, b = MOD, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n val = val * u % MOD;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr bool operator == (const Fp& r) const noexcept {\n return this->val == r.val;\n }\n constexpr bool operator != (const Fp& r) const noexcept {\n return this->val != r.val;\n }\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\n return os << x.val;\n }\n friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {\n return is >> x.val;\n }\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\n if (n == 0) return 1;\n auto t = modpow(a, n / 2);\n t = t * t;\n if (n & 1) t = t * a;\n return t;\n }\n};\n\n// 二項係数ライブラリ\ntemplate<class T> struct BiCoef {\n vector<T> fact_, inv_, finv_;\n constexpr BiCoef() {}\n constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {\n init(n);\n }\n constexpr void init(int n) noexcept {\n fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);\n int MOD = fact_[0].getmod();\n for(int i = 2; i < n; i++){\n fact_[i] = fact_[i-1] * i;\n inv_[i] = -inv_[MOD%i] * (MOD/i);\n finv_[i] = finv_[i-1] * inv_[i];\n }\n }\n constexpr T com(int n, int k) const noexcept {\n if (n < k || n < 0 || k < 0) return 0;\n return fact_[n] * finv_[k] * finv_[n-k];\n }\n constexpr T fact(int n) const noexcept {\n if (n < 0) return 0;\n return fact_[n];\n }\n constexpr T inv(int n) const noexcept {\n if (n < 0) return 0;\n return inv_[n];\n }\n constexpr T finv(int n) const noexcept {\n if (n < 0) return 0;\n return finv_[n];\n }\n};\n\nconst int MOD = 1000000007;\n//const int MOD = 998244353;\nusing mint = Fp<MOD>;\nBiCoef<mint> bc;\n\nvoid solve() {\n\tint n; cin >> n;\n vector<int> a(n);\n rep(i, n) {\n cin >> a[i];\n }\n bc.init(200200);\n vector<mint> b(n - 1);\n rep(i, n - 1) {\n b[i] = (mint)(abs(a[(i + 1 + n) % n] - a[i]));\n }\n mint ans = 0;\n rep(i, n - 1) {\n ans += b[i] * bc.com(n - 2, i);\n }\n cout << ans << endl;\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//int t; cin >> t; rep(i, t)solve();\n\tsolve();\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":10720,"score_of_the_acc":-0.0721,"final_rank":5},{"submission_id":"aoj_3153_4834267","code_snippet":"#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n#define FOR(i, a, b) for(ll i = a; i < b; i++)\n#define rep(i, n) FOR(i, 0, n)\n#define rFOR(i, a, b) for(ll i = a - 1; i >= b; i--)\n#define rrep(i, a) rFOR(i, a, 0)\n#define pb push_back\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\ntypedef pair<ll,ll> P;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<P> vP;\ntypedef vector<char> vc;\ntypedef vector<vc> vvc;\nconst ll MOD = 1000000007;\nconst ll MOD2 = 998244353;\nconst ld PI = acos(-1);\nconst ll INF = 1e18;\nstruct edge{ll to, cost;};\n\ntemplate <typename T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <typename T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//組み合わせを線形で\n//参考:https://drken1215.hatenablog.com/entry/2018/06/08/210000\n\nconst int MXN = 1000001;//変更可\nlong long fac[MXN], inv[MXN], finv[MXN];\n\nvoid COMinit(int M){\n fac[0] = fac[1] = 1;\n inv[1] = 1;\n finv[0] = finv[1] = 1;\n for(int i = 2; i < MXN; i++){\n fac[i] = fac[i-1] * i % M;\n inv[i] = M - M / i * inv[M%i] % M;\n finv[i] = finv[i-1] * inv[i] % M;\n }\n}\n\nlong long COMBI(int N, int K, int M){\n if(N < K){\n return 0;\n }\n if(N < 0||K < 0){\n return 0;\n }\n return fac[N] * finv[N-K] % M * finv[K] % M;\n}\n\nlong long PERMU(int N, int K, int M){\n if(N < K){\n return 0;\n }\n if(N < 0||K < 0){\n return 0;\n }\n return fac[N] * finv[N-K] % M;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N;\n cin >> N;\n COMinit(MOD);\n vl A(N);\n rep(i,N){\n cin >> A[i];\n }\n ll MX=-INF,MN=INF;\n vl B(N-1);\n rep(i,N-1){\n B[i]=abs(A[i]-A[i+1]);\n }\n ll ans=0;\n rep(i,N-1){\n ans+=(B[i]*COMBI(N-2,i,MOD))%MOD;\n ans%=MOD;\n }\n cout << (ans+MOD)%MOD << '\\n';\n}","accuracy":1,"time_ms":50,"memory_kb":29528,"score_of_the_acc":-0.2881,"final_rank":12},{"submission_id":"aoj_3153_4834243","code_snippet":"#include <iostream>\n#include <string>\n#include <sstream>\n#include <stack>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <bitset>\n#include <iomanip>\n#include <limits>\n#include <chrono>\n#include <random>\n#include <array>\n#include <unordered_map>\n#include <functional>\n#include <complex>\n#include <numeric>\n#include <cctype>\n#include <map>\n#include <set>\n#include <cstdlib>\n#include <bitset>\n#include <tuple>\n#include <assert.h>\n#include <deque>\n#include <utility>\n#include <fstream>\n\nusing namespace std;\ntypedef long long ll;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }\n//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\n\nconstexpr long long INF = 1LL << 60;\nconstexpr int inf = 1000000007;\nconstexpr long long mod = 1000000007LL;\n\n\nstruct mint {\n\tlong long x;\n\tmint(long long x = 0) :x((x% mod + mod) % mod) {}\n\tmint& operator+=(const mint a) {\n\t\tif ((x += a.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tmint& operator-=(const mint a) {\n\t\tif ((x += mod - a.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tmint& operator*=(const mint a) {\n\t\t(x *= a.x) %= mod;\n\t\treturn *this;\n\t}\n\tmint operator+(const mint a) const {\n\t\tmint res(*this);\n\t\treturn res += a;\n\t}\n\tmint operator-(const mint a) const {\n\t\tmint res(*this);\n\t\treturn res -= a;\n\t}\n\tmint operator*(const mint a) const {\n\t\tmint res(*this);\n\t\treturn res *= a;\n\t}\n\tmint pow(ll t) const {\n\t\tif (!t) return 1;\n\t\tmint a = pow(t >> 1);\n\t\ta *= a;\n\t\tif (t & 1) a *= *this;\n\t\treturn a;\n\t}\n\n\t// for prime mod\n\tmint inv() const {\n\t\treturn pow(mod - 2);\n\t}\n\tmint& operator/=(const mint a) {\n\t\treturn (*this) *= a.inv();\n\t}\n\tmint operator/(const mint a) const {\n\t\tmint res(*this);\n\t\treturn res /= a;\n\t}\n};\nconstexpr int MAX = 500000;\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid COMinit() {\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor (int i = 2; i < MAX; i++) {\n\t\tfac[i] = fac[i - 1] * i % mod;\n\t\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\n\t\tfinv[i] = finv[i - 1] * inv[i] % mod;\n\t}\n}\n\nmint COM(int n, int k) {\n\tif (n < k) return 0;\n\tif (n < 0 || k < 0) return 0;\n\treturn mint(fac[n] * (finv[k] * finv[n - k] % mod) % mod);\n}\n\nmint LCOM(ll n, ll k) {\n\tif (n < k) return 0;\n\tif (n < 0 || k < 0) return 0;\n\tif (k > n / 2) k = n - k;\n\tmint res = 1;\n\tfor (int i = 0; i < k; i++) res *= (n - i);\n\tres *= finv[k];\n\treturn res;\n}\nint main()\n{\n\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tCOMinit();\n\tint n; cin >> n;\n\tvector<ll> a(n); for (int i = 0; i < n; i++) cin >> a[i];\n\tvector<mint> b(n); for (int i = 0; i < n - 1; i++) b[i] = llabs(a[i + 1] - a[i]);\n\tmint res = 0;\n\tfor (int i = 0; i < n - 1; i++) {\n\t\tres += COM(n - 2, i) * b[i];\n\t}\n\tcout << res.x << \"\\n\";\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":17604,"score_of_the_acc":-0.1012,"final_rank":7},{"submission_id":"aoj_3153_4834208","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\ntypedef long long int ll;\n\nconstexpr ll mod=1e9+7;\n\nll mod_pow(ll a,ll b){\n\ta%=mod;\n\tif(b==0)return 1;\n\tif(b==1)return a;\n\tll res=mod_pow(a,b/2)%mod;\n\tres*=res; res%=mod;\n\tif(b%2)res*=a;\n\treturn res%mod;\n}\n\nstruct perm{\nprivate:\n\tint sz;\n\tvector<ll> p,invp;\npublic:\n\tperm(int n){\n\t\tsz=n+1;\n\t\tp.resize(sz),invp.resize(sz);\n\t\tp[0]=1;\n\t\tfor(int i=1;i<=sz-1;i++){\n\t\t\tp[i]=p[i-1]*i%mod;\n\t\t}\n\t\tinvp[sz-1]=mod_pow(p[sz-1],mod-2);\n\t\tfor(int i=sz-2;i>=0;i--){\n\t\t\tinvp[i]=invp[i+1]*(i+1)%mod;\n\t\t}\n\t}\n\tll comb(ll x,ll y){\n\t\tif(x<y||y<0)return 0;\n\t\treturn (p[x]*invp[x-y]%mod)*invp[y]%mod;\n\t}\n};\nperm p(1<<20);\n\nint main(){\n\tint n; cin >> n;\n\tvector<ll> a(n);\n\tvector<ll> b(n-1);\n\tfor(int i=0;i<n;i++){\n\t\tcin >> a[i];\n\t}\n\tfor(int i=0;i<n-1;i++){\n\t\tb[i]=abs(a[i]-a[i+1]);\n\t}\n\tll res=0;\n\tfor(int i=0;i<n-1;i++){\n\t\t(res+=b[i]*p.comb(n-2,i)%mod)%=mod;\n\t}\n\tcout << res << \"\\n\";\n}","accuracy":1,"time_ms":70,"memory_kb":22340,"score_of_the_acc":-0.3485,"final_rank":13},{"submission_id":"aoj_3153_4834114","code_snippet":"#pragma region Macros\n#pragma GCC optimize(\"O3\")\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define pb push_back\n#define eb emplace_back\n#define vi vector<int>\n#define vll vector<ll>\n#define vpi vector<pii>\n#define vpll vector<pll>\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n#define fi first\n#define se second\n#define all(c) begin(c), end(c)\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\nusing namespace std;\nstring YES[2] = {\"NO\", \"YES\"};\nstring Yes[2] = {\"No\", \"Yes\"};\nstring yes[2] = {\"no\", \"yes\"};\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n#define si(c) (int)(c).size()\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\n scan(head);\n IN(tail...);\n}\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\nvi iota(int n) {\n vi a(n);\n iota(all(a), 0);\n return a;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n sort(all(y));\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\nint popcount(ll x) { return __builtin_popcountll(x); }\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n }\n} setup_io;\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return move(res);\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return move(res);\n}\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n for(auto &e : v) cout << e << \" \";\n cout << endl;\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n cout << \"(\" << p.fi << \", \" << p.se << \")\";\n return os;\n}\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\ntemplate <class A> string to_string(A v) {\n if(v.empty()) return \"{}\";\n string ret = \"{\";\n for(auto &x : v) ret += to_string(x) + \",\";\n ret.back() = '}';\n return ret;\n}\n\nvoid dump() { cerr << endl; }\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#define endl '\\n'\n#ifdef _LOCAL\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\n#define debug(x)\n#endif\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\n#pragma endregion\nnamespace modular {\nconstexpr ll MOD = 1000000007;\nconst int MAXN = 1100000;\ntemplate <ll Modulus> class modint;\n#define mint modint<MOD>\n#define vmint vector<mint>\nvector<mint> Inv;\nmint inv(int x);\ntemplate <ll Modulus> class modint {\n\n public:\n static constexpr int mod() { return Modulus; }\n ll a;\n\n constexpr modint(const ll x = 0) noexcept : a(((x % Modulus) + Modulus) % Modulus) {}\n constexpr ll &value() noexcept { return a; }\n constexpr const ll &value() const noexcept { return a; }\n constexpr modint operator-() const noexcept { return modint() - *this; }\n constexpr modint operator+() const noexcept { return *this; }\n constexpr modint &operator++() noexcept {\n if(++a == MOD) a = 0;\n return *this;\n }\n constexpr modint &operator--() noexcept {\n if(!a) a = MOD;\n a--;\n return *this;\n }\n constexpr modint operator++(int) {\n modint res = *this;\n ++*this;\n return res;\n }\n constexpr modint operator--(int) {\n mint res = *this;\n --*this;\n return res;\n }\n constexpr modint &operator+=(const modint rhs) noexcept {\n a += rhs.a;\n if(a >= Modulus) { a -= Modulus; }\n return *this;\n }\n constexpr modint &operator-=(const modint rhs) noexcept {\n if(a < rhs.a) { a += Modulus; }\n a -= rhs.a;\n return *this;\n }\n constexpr modint &operator*=(const modint rhs) noexcept {\n a = a * rhs.a % Modulus;\n return *this;\n }\n constexpr modint &operator/=(const modint rhs) noexcept {\n a = a * (modular::inv(rhs.a)).a % Modulus;\n return *this;\n }\n constexpr modint pow(long long n) const noexcept {\n modint x = *this, r = 1;\n while(n) {\n if(n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n constexpr modint inv() const noexcept { return pow(Modulus - 2); }\n constexpr friend modint operator+(const modint &lhs, const modint &rhs) { return modint(lhs) += modint(rhs); }\n constexpr friend modint operator-(const modint &lhs, const modint &rhs) { return modint(lhs) -= modint(rhs); }\n constexpr friend modint operator*(const modint &lhs, const modint &rhs) { return modint(lhs) *= modint(rhs); }\n constexpr friend modint operator/(const modint &lhs, const modint &rhs) { return modint(lhs) /= modint(rhs); }\n constexpr friend modint operator==(const modint &lhs, const modint &rhs) { return lhs.a == rhs.a; }\n constexpr friend modint operator!=(const modint &lhs, const modint &rhs) { return lhs.a != rhs.a; }\n // constexpr friend modint operator^=(const modint &lhs, const modint &rhs) { return modint(lhs) ^= modint(rhs); }\n};\nvmint Prd{1, 1}, Invprd{1, 1};\nmint inv(int n) {\n if(Inv.empty()) Inv.emplace_back(0), Inv.emplace_back(1);\n if(Inv.size() > n)\n return Inv[n];\n else {\n for(int i = Inv.size(); i <= n; ++i) Inv.emplace_back(Inv[MOD % i] * (-MOD / i));\n return Inv[n];\n }\n}\nmint prd(int n) {\n if(Prd.size() > n)\n return Prd[n];\n else\n for(int i = Prd.size(); i <= n; ++i) Prd.emplace_back(Prd[i - 1] * i);\n return Prd[n];\n}\nmint invprd(int n) {\n if(Invprd.size() > n)\n return Invprd[n];\n else\n for(int i = Invprd.size(); i <= n; ++i) Invprd.emplace_back(Invprd[i - 1] * inv(i));\n return Invprd[n];\n}\nmint modpow(ll a, ll n) { return mint(a).pow(n); }\nmint inv(mint a) { return inv(a.a); }\nmint invprd(mint a) { return invprd(a.a); }\nmint prd(mint a) { return prd(a.a); }\nmint modpow(mint a, ll n) { return modpow(a.a, n); }\nmint C(int a, int b) {\n if(a < 0 || b < 0) return 0;\n if(a < b) return 0;\n return prd(a) * invprd(b) * invprd(a - b);\n}\nmint P(int a, int b) {\n if(a < 0 || b < 0) return 0;\n if(a < b) return 0;\n return prd(a) * invprd(a - b);\n}\nostream &operator<<(ostream &os, mint a) {\n os << a.a;\n return os;\n}\nistream &operator>>(istream &is, mint &a) {\n ll x;\n is >> x;\n a = x;\n return is;\n}\nstruct modinfo {\n int mod, root;\n};\nconstexpr modinfo base0{1045430273, 3};\nconstexpr modinfo base1{1051721729, 6};\nconstexpr modinfo base2{1053818881, 7};\nusing mint0 = modint<base0.mod>;\nusing mint1 = modint<base1.mod>;\nusing mint2 = modint<base2.mod>;\nusing Poly = vmint;\ntemplate <int mod> void FMT(vector<modint<mod>> &f, bool inv = false) {\n using V = vector<modint<mod>>;\n static V g(30), ig(30);\n if(g.front().a == 0) {\n modint<mod> root = 2;\n while((root.pow((mod - 1) / 2)).a == 1) root += 1;\n rep(i, 30) g[i] = -(root.pow((mod - 1) >> (i + 2))), ig[i] = g[i].inv();\n }\n int n = size(f);\n if(!inv) {\n for(int m = n; m >>= 1;) {\n modint<mod> w = 1;\n for(int s = 0, k = 0; s < n; s += 2 * m) {\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\n auto x = f[i], y = f[j] * w;\n if(x.a >= mod) x.a -= mod;\n f[i].a = x.a + y.a, f[j].a = x.a + (mod - y.a);\n }\n w *= g[__builtin_ctz(++k)];\n }\n }\n } else {\n for(int m = 1; m < n; m *= 2) {\n modint<mod> w = 1;\n for(int s = 0, k = 0; s < n; s += 2 * m) {\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\n auto x = f[i], y = f[j];\n f[i] = x + y, f[j].a = x.a + (mod - y.a), f[j] *= w;\n }\n w *= ig[__builtin_ctz(++k)];\n }\n }\n }\n modint<mod> c;\n if(inv)\n c = modint<mod>(n).inv();\n else\n c = 1;\n for(auto &&e : f) e *= c;\n}\nPoly operator-(Poly f) {\n for(auto &&e : f) e = -e;\n return f;\n}\nPoly &operator+=(Poly &l, const Poly &r) {\n l.resize(max(l.size(), r.size()));\n rep(i, r.size()) l[i] += r[i];\n return l;\n}\nPoly operator+(Poly l, const Poly &r) { return l += r; }\nPoly &operator-=(Poly &l, const Poly &r) {\n l.resize(max(l.size(), r.size()));\n rep(i, r.size()) l[i] -= r[i];\n return l;\n}\nPoly operator-(Poly l, const Poly &r) { return l -= r; }\nPoly &operator<<=(Poly &f, size_t n) { return f.insert(f.begin(), n, 0), f; }\nPoly operator<<(Poly f, size_t n) { return f <<= n; }\nPoly &operator>>=(Poly &f, size_t n) { return f.erase(f.begin(), f.begin() + min(f.size(), n)), f; }\nPoly operator>>(Poly f, size_t n) { return f >>= n; }\n\nconstexpr int mod0 = 998244353, mod1 = 1300234241, mod2 = 1484783617;\nusing M0 = modint<mod0>;\nusing M1 = modint<mod1>;\nusing M2 = modint<mod2>;\n\ntemplate <int mod> void mul(vector<modint<mod>> &l, vector<modint<mod>> &r) {\n int n = size(l), m = size(r), sz = 1 << __lg(2 * (n + m - 1) - 1);\n l.resize(sz), FMT<mod>(l);\n r.resize(sz), FMT<mod>(r);\n rep(i, sz) l[i] *= r[i];\n FMT<mod>(l, true);\n l.resize(n + m - 1);\n}\nPoly operator*(const Poly &l, const Poly &r) {\n if(l.empty() or r.empty()) return Poly();\n int n = size(l), m = size(r), sz = 1 << __lg(2 * (n + m - 1) - 1);\n vector<M0> l0(n), r0(m);\n vector<M1> l1(n), r1(m);\n vector<M2> l2(n), r2(m);\n rep(i, n) l0[i] = l[i].a, l1[i] = l[i].a, l2[i] = l[i].a;\n rep(i, m) r0[i] = r[i].a, r1[i] = r[i].a, r2[i] = r[i].a;\n mul<mod0>(l0, r0), mul<mod1>(l1, r1), mul<mod2>(l2, r2);\n Poly res(n + m - 1);\n // garner\n static constexpr M1 inv0 = 613999507;\n static constexpr M2 inv1 = 1147332803, inv0m1 = 45381342;\n static constexpr mint m0 = mod0, m0m1 = m0 * mod1;\n rep(i, n + m - 1) {\n int y0 = l0[i].a;\n int y1 = (inv0 * (l1[i] - y0)).a;\n int y2 = (inv0m1 * (l2[i] - y0) - inv1 * y1).a;\n res[i] = m0 * y1 + m0m1 * y2 + y0;\n }\n return res;\n}\nPoly &operator*=(Poly &l, const Poly &r) { return l = l * r; }\nPoly integ(const Poly &f) {\n Poly res(f.size() + 1);\n for(int i = 1; i < (int)res.size(); ++i) res[i] = f[i - 1] / i;\n return res;\n}\n// Poly deriv(const Poly &f) {\n// if(f.size() == 0) return Poly();\n// Poly res(f.size() - 1);\n// rep(i, res.size()) res[i] = f[i + 1] * (i + 1);\n// return res;\n// }\nostream &operator<<(ostream &os, Poly a) {\n for(auto e : a) cout << e.a << \" \";\n return os;\n}\n} // namespace modular\nusing namespace modular;\n\nint main() {\n INT(n);\n VEC(int, a, n);\n vmint b;\n rep(i, n - 1) b.eb(abs(a[i + 1] - a[i]));\n mint ans;\n rep(i, n - 1) ans += C(n - 2, i) * b[i];\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":12100,"score_of_the_acc":-0.0779,"final_rank":6},{"submission_id":"aoj_3153_4834051","code_snippet":"#include <bits/stdc++.h>\n#define be(v) (v).begin(),(v).end()\n#define pb(q) push_back(q)\ntypedef long long ll;\nusing namespace std;\nconst ll mod=1000000007, INF=(1LL<<60);\n#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;\nlong long modpow(long long a, long long n) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n}\n\n\n///////// combinatison\nll fac[200007],finv[200007],inv[200007];\nvoid cominit(){\n fac[0]=fac[1]=1;\n finv[0]=finv[1]=1;\n inv[1]=1;\n for(int i=2;i<200007;i++){\n fac[i]=fac[i-1]*i%mod;\n inv[i]=mod-inv[mod%i]*(mod/i)%mod;\n finv[i]=finv[i-1]*inv[i]%mod;\n }\n}\nll com(ll n,ll k){\n if(n<k)return 0;\n if(n<0 || k<0)return 0;\n return fac[n]*(finv[k]*finv[n-k]%mod)%mod;\n}\n\n\n///////modint\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\n mint operator+(const mint a) const { return mint(*this) += a;}\n mint operator-(const mint a) const { return mint(*this) -= a;}\n mint operator*(const mint a) const { return mint(*this) *= a;}\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\n // for prime mod\n mint inv() const { return pow(mod-2);}\n mint& operator/=(const mint a) { return *this *= a.inv();}\n mint operator/(const mint a) const { return mint(*this) /= a;}\n};\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\n\n\nint main() {\n cin.tie(0);\n cout.tie(0);\n ios::sync_with_stdio(false);\n ll n;\n cin >> n;\n ll a[n];\n for(int i=0;i<n;i++) cin >> a[i];\n for(int i=1;i<n;i++) a[i - 1] = abs(a[i] - a[i - 1]);\n cominit();\n mint ans = mint(0);\n for(int i=0;i<n-1;i++){\n ans += mint(a[i]) * mint(com(n - 2, i));\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":9456,"score_of_the_acc":-0.0667,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_3153_10086332\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <cassert>\\n#include <vector>\\n#include <cstdint>\\n#include <iostream>\\n#include <type_traits>\\n#include <utility>\\nnamespace internal {\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr std::int64_t safe_mod(std::int64_t x, std::int64_t m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n std::uint64_t im;\\n // @param m `1 <= m`\\n explicit barrett(unsigned int m) : _m(m), im((std::uint64_t)(-1) / m + 1) {}\\n // @return m\\n unsigned int umod() const { return _m; }\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n std::uint64_t z = a;\\n z *= b;\\n std::uint64_t x = (std::uint64_t)(((__uint128_t)(z)*im) >> 64);\\n std::uint64_t y = x * _m;\\n return (unsigned int)(z - y + (z < y ? _m : 0));\\n }\\n};\\nstruct montgomery {\\n std::uint64_t _m;\\n std::uint64_t im;\\n std::uint64_t r2;\\n // @param m `1 <= m`\\n explicit constexpr montgomery(std::uint64_t m) : _m(m), im(m), r2(-__uint128_t(m) % m) {\\n for (int i = 0; i < 5; ++i) im = im * (2 - _m * im);\\n im = -im;\\n }\\n // @return m\\n constexpr std::uint64_t umod() const { return _m; }\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n constexpr std::uint64_t mul(std::uint64_t a, std::uint64_t b) const { return mr(mr(a, b), r2); }\\n constexpr std::uint64_t exp(std::uint64_t a, std::uint64_t b) const {\\n std::uint64_t res = 1, p = mr(a, r2);\\n while (b) {\\n if (b & 1) res = mr(res, p);\\n p = mr(p, p);\\n b >>= 1;\\n }\\n return res;\\n }\\n constexpr bool same_pow(std::uint64_t x, int s, std::uint64_t n) const {\\n x = mr(x, r2), n = mr(n, r2);\\n for (int r = 0; r < s; r++) {\\n if (x == n) return true;\\n x = mr(x, x);\\n }\\n return false;\\n }\\n private:\\n constexpr std::uint64_t mr(std::uint64_t x) const {\\n return ((__uint128_t)(x * im) * _m + x) >> 64;\\n }\\n constexpr std::uint64_t mr(std::uint64_t a, std::uint64_t b) const {\\n __uint128_t t = (__uint128_t)a * b;\\n std::uint64_t inc = std::uint64_t(t) != 0;\\n std::uint64_t x = t >> 64, y = ((__uint128_t)(a * b * im) * _m) >> 64;\\n unsigned long long z = 0;\\n bool f = __builtin_uaddll_overflow(x, y, &z);\\n z += inc;\\n return f ? z - _m : z;\\n }\\n};\\nconstexpr bool is_SPRP32(std::uint32_t n, std::uint32_t a) {\\n std::uint32_t d = n - 1, s = 0;\\n while ((d & 1) == 0) ++s, d >>= 1;\\n std::uint64_t cur = 1, pw = d;\\n while (pw) {\\n if (pw & 1) cur = (cur * a) % n;\\n a = (std::uint64_t)a * a % n;\\n pw >>= 1;\\n }\\n if (cur == 1) return true;\\n for (std::uint32_t r = 0; r < s; r++) {\\n if (cur == n - 1) return true;\\n cur = cur * cur % n;\\n }\\n return false;\\n}\\n// given 2 <= n,a < 2^64, a prime, check whether n is a-SPRP\\nconstexpr bool is_SPRP64(const montgomery &m, std::uint64_t a) {\\n auto n = m.umod();\\n if (n == a) return true;\\n if (n % a == 0) return false;\\n std::uint64_t d = n - 1;\\n int s = 0;\\n while ((d & 1) == 0) ++s, d >>= 1;\\n std::uint64_t cur = m.exp(a, d);\\n if (cur == 1) return true;\\n return m.same_pow(cur, s, n - 1);\\n}\\nconstexpr bool is_prime_constexpr(std::uint64_t x) {\\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\\n if (x < 121) return (x > 1);\\n montgomery m(x);\\n constexpr std::uint64_t bases[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\\n for (auto a : bases) {\\n if (!is_SPRP64(m, a)) return false;\\n }\\n return true;\\n}\\nconstexpr bool is_prime_constexpr(std::int64_t x) {\\n if (x < 0) return false;\\n return is_prime_constexpr(std::uint64_t(x));\\n}\\nconstexpr bool is_prime_constexpr(std::uint32_t x) {\\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\\n if (x < 121) return (x > 1);\\n std::uint64_t h = x;\\n h = ((h >> 16) ^ h) * 0x45d9f3b;\\n h = ((h >> 16) ^ h) * 0x45d9f3b;\\n h = ((h >> 16) ^ h) & 255;\\n constexpr uint16_t bases[] = {\\n 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620, 560,\\n 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028,\\n 2213, 6219, 620, 3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113,\\n 7061, 803, 1269, 3875, 422, 751, 580, 4729, 10239, 746, 2951, 556, 2206,\\n 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,\\n 15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903,\\n 737, 1887, 7447, 1888, 2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41,\\n 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352, 6435, 165, 1169, 3315,\\n 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,\\n 27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524,\\n 3577, 236, 2360, 6146, 2850, 55637, 1753, 4178, 8466, 222, 2579, 2743, 2031,\\n 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159, 1725, 3597, 3366, 14336,\\n 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,\\n 434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183,\\n 8126, 1870, 3296, 7455, 8947, 25017, 541, 19115, 368, 566, 5674, 411, 522,\\n 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007, 35201, 4706, 1152, 1785,\\n 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,\\n 4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816,\\n 5197, 13330, 7054, 2818, 3199, 811, 922, 350, 7514, 4452, 3449, 2663, 4708,\\n 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194};\\n return is_SPRP32(x, bases[h]);\\n}\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr std::int64_t pow_mod_constexpr(std::int64_t x, std::int64_t n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n std::uint64_t r = 1;\\n std::uint64_t y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n std::int64_t d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr std::int64_t bases[3] = {2, 7, 61};\\n for (std::int64_t a : bases) {\\n std::int64_t t = d;\\n std::int64_t y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) { return false; }\\n }\\n return true;\\n}\\ntemplate <int n>\\nconstexpr bool is_prime = is_prime_constexpr(n);\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<std::int64_t, std::int64_t> inv_gcd(std::int64_t a, std::int64_t b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n std::int64_t s = b, t = a;\\n std::int64_t m0 = 0, m1 = 1;\\n while (t) {\\n std::int64_t u = s / t;\\n s -= t * u;\\n m0 -= m1 * u;\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (std::int64_t)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) { x /= i; }\\n }\\n }\\n if (x > 1) { divs[cnt++] = x; }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m>\\nconstexpr int primitive_root = primitive_root_constexpr(m);\\n} // namespace internal\\n#include <numeric>\\nnamespace internal {\\ntemplate <class T>\\nusing is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;\\ntemplate <class T>\\nusing is_integral =\\n typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value, make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\ntemplate <class T>\\nusing to_unsigned_t = typename to_unsigned<T>::type;\\n} // namespace internal\\nnamespace internal {\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\ntemplate <class T>\\nusing is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T>\\nusing is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n} // namespace internal\\ntemplate <int m, std::enable_if_t<(1 <= m)> * = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n public:\\n static constexpr int mod() { return m; }\\n static constexpr mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n constexpr static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T> * = nullptr>\\n constexpr static_modint(T v) : _v(0) {\\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\\n constexpr static_modint(T v) : _v(0) {\\n _v = (unsigned int)(v % umod());\\n }\\n constexpr unsigned int val() const { return _v; }\\n constexpr mint &operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n constexpr mint &operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n constexpr mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n constexpr mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n constexpr mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n constexpr mint &operator-=(const mint &rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n constexpr mint &operator*=(const mint &rhs) {\\n std::uint64_t z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n constexpr mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n constexpr mint operator+() const { return *this; }\\n constexpr mint operator-() const { return mint() - *this; }\\n constexpr mint pow(std::int64_t n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n constexpr mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n friend constexpr mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\\n friend constexpr mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\\n friend constexpr mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\\n friend constexpr mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\\n friend constexpr bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\\n friend constexpr bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\\n std::int64_t t;\\n is >> t;\\n rhs = mint(t);\\n return is;\\n }\\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\\n return os << rhs._v;\\n }\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\ntemplate <int id>\\nstruct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n unsigned int val() const { return _v; }\\n mint &operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint &operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint &operator-=(const mint &rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint &operator*=(const mint &rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n mint pow(std::int64_t n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\\n friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\\n friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\\n friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\\n friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\\n friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\\n std::int64_t t;\\n is >> t;\\n rhs = mint(t);\\n return is;\\n }\\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\\n return os << rhs._v;\\n }\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id>\\ninternal::barrett dynamic_modint<id>::bt(998244353);\\nusing modint998 = static_modint<998244353>;\\nusing modint107 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\nnamespace internal {\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\ntemplate <class>\\nstruct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n} // namespace internal\\ntemplate <class mint = modint998, internal::is_modint_t<mint> * = nullptr>\\nstruct Combination {\\n Combination() : _fact(), _finv() {}\\n mint operator()(int n, int k) {\\n if (n < k || n < 0 || k < 0) return 0;\\n _init(n);\\n return _fact[n] * _finv[k] * _finv[n - k];\\n }\\n mint fact(int x) {\\n assert(x >= 0);\\n _init(x);\\n return _fact[x];\\n }\\n mint finv(int x) {\\n assert(x >= 0);\\n _init(x);\\n return _finv[x];\\n }\\n mint naive(int n, int k) const {\\n if (n < k || n < 0 || k < 0) return 0;\\n if (n - k < k) k = n - k;\\n mint res = 1;\\n for (int i = 0; i < k; ++i) {\\n res *= n - i;\\n res /= i + 1;\\n }\\n return res;\\n }\\n mint permu(int n, int k) {\\n if (n < k || n < 0 || k < 0) return 0;\\n _init(n);\\n return _fact[n] * _finv[n - k];\\n }\\n private:\\n std::vector<mint> _fact, _finv;\\n void _init(int n) {\\n if ((int)_fact.size() > n) return;\\n int m = _fact.size();\\n _fact.resize(n + 1);\\n for (int i = m; i <= n; ++i) {\\n if (i == 0) _fact[i] = 1;\\n else _fact[i] = _fact[i - 1] * i;\\n }\\n _finv.resize(n + 1);\\n _finv[n] = _fact[n].inv();\\n for (int i = n - 1; i >= m; --i) _finv[i] = _finv[i + 1] * (i + 1);\\n }\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nusing Mint = modint107;\\nCombination<Mint> combi;\\nint main(void) {\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n cin >> a;\\n Mint ans = 0;\\n rep (i, n - 1) {\\n if (a[i] >= a[i + 1])\\n ans += combi(n - 2, i) * (a[i] - a[i + 1]);\\n else\\n ans += combi(n - 2, i) * (a[i + 1] - a[i]);\\n }\\n co(ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5428,\n \"score_of_the_acc\": -0.0042,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3153_4949267\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 200005\\n\\nll N;\\nll A[SIZE];ll fact[SIZE],inv_fact[SIZE];\\n\\nll mod_pow(ll x,ll count, ll mod){\\n\\n\\tif(count == 0)return 1;\\n\\tll ret = mod_pow((x*x)%mod,count/2,mod);\\n\\tif(count%2 == 1){\\n\\n\\t\\tret = (ret*x)%mod;\\n\\t}\\n\\treturn ret;\\n}\\n\\nll extgcd(ll a,ll b,ll &x,ll &y){\\n\\tll d = a;\\n\\tif(b != 0){\\n\\t\\td = extgcd(b,a%b,y,x);\\n\\t\\ty -= (a/b)*x;\\n\\t}else{\\n\\t\\tx = 1;\\n\\t\\ty = 0;\\n\\t}\\n\\treturn d;\\n}\\n\\nll mod_inverse(ll a,ll m){\\n ll x,y;\\n extgcd(a,m,x,y);\\n return (m+x%m)%m;\\n}\\n\\nll nCk(ll n,ll k){\\n\\n\\tif(k > n)return 0;\\n\\n\\tll ret = fact[n]*inv_fact[k];\\n\\tret %= MOD;\\n\\tret *= inv_fact[n-k];\\n\\n\\treturn ret%MOD;\\n}\\n\\n\\nint main(){\\n\\n\\tfact[0] = 1;\\n\\tfor(ll i = 1; i < SIZE; i++){\\n\\t\\tfact[i] = i*fact[i-1];\\n\\t\\tfact[i] %= MOD;\\n\\t}\\n\\tinv_fact[SIZE-1] = mod_inverse(fact[SIZE-1],MOD);\\n\\tfor(ll i = SIZE-1; i >= 1; i--){\\n\\n\\t\\tinv_fact[i-1] = inv_fact[i]*i;\\n\\t\\tinv_fact[i-1] %= MOD;\\n\\t}\\n\\n\\tscanf(\\\"%lld\\\",&N);\\n\\n\\tll ans = 0;\\n\\tfor(ll i = 1; i <= N; i++){\\n\\n\\t\\tscanf(\\\"%lld\\\",&A[i]);\\n\\t\\tif(i >= 2){\\n\\n\\t\\t\\tll tmp = (abs(A[i]-A[i-1])*nCk(N-2,i-2))%MOD;\\n\\t\\t\\tans += tmp;\\n\\t\\t\\tans %= MOD;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7916,\n \"score_of_the_acc\": -0.0602,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3153_4892930\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing LL = long long int;\\n#define incII(i, l, r) for(LL i = (l) ; i <= (r); i++)\\n#define incIX(i, l, r) for(LL i = (l) ; i < (r); i++)\\n#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)\\n#define incXX(i, l, r) for(LL i = (l) + 1; i < (r); i++)\\n#define decII(i, l, r) for(LL i = (r) ; i >= (l); i--)\\n#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)\\n#define decXI(i, l, r) for(LL i = (r) ; i > (l); i--)\\n#define decXX(i, l, r) for(LL i = (r) - 1; i > (l); i--)\\n#define inc(i, n) incIX(i, 0, n)\\n#define dec(i, n) decIX(i, 0, n)\\n#define inc1(i, n) incII(i, 1, n)\\n#define dec1(i, n) decII(i, 1, n)\\nauto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };\\nauto inIX = [](auto x, auto l, auto r) { return (l <= x && x < r); };\\nauto inXI = [](auto x, auto l, auto r) { return (l < x && x <= r); };\\nauto inXX = [](auto x, auto l, auto r) { return (l < x && x < r); };\\nauto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };\\nauto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };\\nauto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };\\nauto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define MT make_tuple\\n#define FI first\\n#define SE second\\n#define FR front()\\n#define BA back()\\n#define ALL(c) c.begin(), c.end()\\n#define RALL(c) c.rbegin(), c.rend()\\n#define RV(c) reverse(ALL(c))\\n#define SC static_cast\\n#define SI(c) SC<int>(c.size())\\n#define SL(c) SC<LL >(c.size())\\n#define RF(e, c) for(auto & e: c)\\n#define SF(c, ...) for(auto & [__VA_ARGS__]: c)\\n#define until(e) while(! (e))\\n#define if_not(e) if(! (e))\\n#define ef else if\\n#define UR assert(false)\\nauto * IS = & cin;\\nauto * OS = & cout;\\narray<string, 3> SEQ = { \\\"\\\", \\\" \\\", \\\"\\\" };\\n// input\\ntemplate<typename T> T in() { T a; (* IS) >> a; return a; }\\n// input: tuple\\ntemplate<int I, typename U> void tin_(istream & is, U & t) {\\n\\tif constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }\\n}\\ntemplate<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }\\ntemplate<typename ... T> auto tin() { return in<tuple<T ...>>(); }\\n// input: array\\ntemplate<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }\\ntemplate<typename T, size_t N> auto ain() { return in<array<T, N>>(); }\\n// input: multi-dimensional vector\\ntemplate<typename T> T vin() { T v; (* IS) >> v; return v; }\\ntemplate<typename T, typename N, typename ... M> auto vin(N n, M ... m) {\\n\\tvector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;\\n}\\n// input: multi-column (tuple<vector>)\\ntemplate<typename U, int I> void colin_([[maybe_unused]] U & t) { }\\ntemplate<typename U, int I, typename A, typename ... B> void colin_(U & t) {\\n\\tget<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);\\n}\\ntemplate<typename ... T> auto colin(int n) {\\n\\ttuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;\\n}\\n// output\\nvoid out_([[maybe_unused]] string s) { }\\ntemplate<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }\\ntemplate<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }\\nauto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };\\nauto out = [](auto ... a) { outF(\\\"\\\", \\\" \\\" , \\\"\\\\n\\\", a ...); };\\nauto outS = [](auto ... a) { outF(\\\"\\\", \\\" \\\" , \\\" \\\" , a ...); };\\nauto outL = [](auto ... a) { outF(\\\"\\\", \\\"\\\\n\\\", \\\"\\\\n\\\", a ...); };\\nauto outN = [](auto ... a) { outF(\\\"\\\", \\\"\\\" , \\\"\\\" , a ...); };\\n// output: multi-dimensional vector\\ntemplate<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {\\n\\tos << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? \\\"\\\" : SEQ[1]) << v[i]; } return (os << SEQ[2]);\\n}\\ntemplate<typename T> void vout_(T && v) { (* OS) << v; }\\ntemplate<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {\\n\\tinc(i, SI(v)) { (* OS) << (i == 0 ? \\\"\\\" : a); vout_(v[i], b ...); }\\n}\\ntemplate<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }\\ntemplate<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << flush; }\\n\\n// ---- ----\\n\\ntemplate<LL M> class ModInt {\\nprivate:\\n\\tLL v;\\n\\tpair<LL, LL> ext_gcd(LL a, LL b) {\\n\\t\\tif(b == 0) { assert(a == 1); return { 1, 0 }; }\\n\\t\\tauto p = ext_gcd(b, a % b);\\n\\t\\treturn { p.SE, p.FI - (a / b) * p.SE };\\n\\t}\\npublic:\\n\\tModInt(LL vv = 0) { v = vv; if(abs(v) >= M) { v %= M; } if(v < 0) { v += M; } }\\n\\tLL val() { return v; }\\n\\tstatic LL mod() { return M; }\\n\\tModInt inv() { return ext_gcd(M, v).SE; }\\n\\tModInt exp(LL b) {\\n\\t\\tModInt p = 1, a = v; if(b < 0) { a = a.inv(); b = -b; }\\n\\t\\twhile(b) { if(b & 1) { p *= a; } a *= a; b >>= 1; }\\n\\t\\treturn p;\\n\\t}\\n\\tfriend bool operator< (ModInt a, ModInt b) { return (a.v < b.v); }\\n\\tfriend bool operator> (ModInt a, ModInt b) { return (a.v > b.v); }\\n\\tfriend bool operator<=(ModInt a, ModInt b) { return (a.v <= b.v); }\\n\\tfriend bool operator>=(ModInt a, ModInt b) { return (a.v >= b.v); }\\n\\tfriend bool operator==(ModInt a, ModInt b) { return (a.v == b.v); }\\n\\tfriend bool operator!=(ModInt a, ModInt b) { return (a.v != b.v); }\\n\\tfriend ModInt operator+ (ModInt a ) { return ModInt(+a.v); }\\n\\tfriend ModInt operator- (ModInt a ) { return ModInt(-a.v); }\\n\\tfriend ModInt operator+ (ModInt a, ModInt b) { return ModInt(a.v + b.v); }\\n\\tfriend ModInt operator- (ModInt a, ModInt b) { return ModInt(a.v - b.v); }\\n\\tfriend ModInt operator* (ModInt a, ModInt b) { return ModInt(a.v * b.v); }\\n\\tfriend ModInt operator/ (ModInt a, ModInt b) { return a * b.inv(); }\\n\\tfriend ModInt operator^ (ModInt a, LL b) { return a.exp(b); }\\n\\tfriend ModInt & operator+=(ModInt & a, ModInt b) { return (a = a + b); }\\n\\tfriend ModInt & operator-=(ModInt & a, ModInt b) { return (a = a - b); }\\n\\tfriend ModInt & operator*=(ModInt & a, ModInt b) { return (a = a * b); }\\n\\tfriend ModInt & operator/=(ModInt & a, ModInt b) { return (a = a / b); }\\n\\tfriend ModInt & operator^=(ModInt & a, LL b) { return (a = a ^ b); }\\n\\tfriend istream & operator>>(istream & s, ModInt & b) { s >> b.v; b = ModInt(b.v); return s; }\\n\\tfriend ostream & operator<<(ostream & s, ModInt b) { return (s << b.v); }\\n};\\n\\n// ----\\n\\ntemplate<typename T> struct Combination {\\n\\tLL n;\\n\\tvector<T> f, r;\\n\\tCombination(LL n) : n(n) {\\n\\t\\tf = r = vector<T>(n + 1);\\n\\t\\tinc(i, n + 1) { f[i] = (i == 0 ? 1 : f[i - 1] * i ); }\\n\\t\\tdec(i, n + 1) { r[i] = (i == n ? f[n].inv() : r[i + 1] * (i + 1)); }\\n\\t}\\n\\tT P(LL a, LL b) {\\n\\t\\tassert(inII(a, 0, n) && inII(b, 0, n));\\n\\t\\treturn (a < b ? 0 : f[a] * r[a - b]);\\n\\t}\\n\\tT C(LL a, LL b) {\\n\\t\\tassert(inII(a, 0, n) && inII(b, 0, n));\\n\\t\\treturn (a < b ? 0 : f[a] * r[a - b] * r[b]);\\n\\t}\\n\\tT H(LL a, LL b) {\\n\\t\\tassert(inII(a, 0, n) && inII(b, 0, n) && inII(a + b - 1, -1, n));\\n\\t\\treturn (a == 0 ? (b == 0 ? 1 : 0) : f[a + b - 1] * r[a - 1] * r[b]);\\n\\t}\\n};\\n\\nusing MI = ModInt<1'000'000'007>;\\n\\nint main() {\\n\\tauto n = in<int>();\\n\\tauto a = vin<int>(n);\\n\\t\\n\\tCombination<MI> c(n - 2);\\n\\tMI ans = 0;\\n\\tincII(i, 0, n - 2) { ans += c.C(n - 2, i) * abs(a[i + 1] - a[i]); }\\n\\tout(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 7060,\n \"score_of_the_acc\": -0.193,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3153_4874422\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\ntemplate <int mod>\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator-=(const ModInt &p) {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator*=(const ModInt &p) {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\n\\nconst int mod = 1e9 + 7;\\nusing mint = ModInt<mod>;\\n\\nconst int N = 200002;\\nmint f[N], invf[N];\\nmint C(int n, int r) { return f[n] * invf[r] * invf[n - r]; }\\n\\nint main() {\\n f[0] = 1;\\n for (int i = 1; i < N; ++i) f[i] = f[i - 1] * i;\\n invf[N - 1] = f[N - 1].inverse();\\n for (int i = N - 2; i >= 0; --i) invf[i] = invf[i + 1] * (i + 1);\\n\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n rep(i, n) cin >> a[i];\\n\\n mint ans = 0;\\n rep(i, n - 1) {\\n mint x = abs(a[i] - a[i + 1]);\\n ans += C(n - 2, i) * x;\\n }\\n cout << ans << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 5180,\n \"score_of_the_acc\": -0.2759,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3153_4861042\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(1e9 + 7)>\\nstruct ModInt {\\n int x;\\n ModInt() : x(0) {}\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n ModInt &operator+=(const ModInt &p) {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator-=(const ModInt &p) {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator*=(const ModInt &p) {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n ModInt operator-() const { return ModInt(-x); }\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n static int get_mod() { return mod; }\\n};\\n\\nstruct Combination {\\n vector<ModInt<>> _fact, _rfact, _inv;\\n Combination(long long nsize = 5000000)\\n : _fact(nsize + 1), _rfact(nsize + 1), _inv(nsize + 1) {\\n _fact[0] = _rfact[nsize] = _inv[0] = 1;\\n for (int i = 1; i <= nsize; i++) _fact[i] = _fact[i - 1] * i;\\n _rfact[nsize] /= _fact[nsize];\\n for (int i = nsize - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\\n for (int i = 1; i <= nsize; i++) _inv[i] = _rfact[i] * _fact[i - 1];\\n }\\n inline ModInt<> fact(int k) const { return _fact[k]; }\\n\\n inline ModInt<> rfact(int k) const { return _rfact[k]; }\\n\\n inline ModInt<> inv(int k) const { return _inv[k]; }\\n\\n ModInt<> P(int n, int r) const {\\n if (r < 0 || n < r) return 0;\\n return fact(n) * rfact(n - r);\\n }\\n\\n ModInt<> C(int p, int q) const {\\n if (q < 0 || p < q) return 0;\\n return fact(p) * rfact(q) * rfact(p - q);\\n }\\n // n types,choose r\\n ModInt<> H(int n, int r) const {\\n if (n < 0 || r < 0) return (0);\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\n\\nint n, bf;\\nCombination com;\\n\\nint main() {\\n cin >> n >> bf;\\n ModInt<> res;\\n for (int i = 1; i < n; ++i) {\\n int now, diff;\\n cin >> now;\\n diff = abs(now - bf);\\n res += com.C(n - 2, i - 1) * diff;\\n bf = now;\\n }\\n cout << res << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 61608,\n \"score_of_the_acc\": -0.6511,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3153_4844235\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <array>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <cmath>\\n#include <functional>\\n#include <cassert>\\n#include <iomanip>\\n#define vll vector<ll>\\n#define vvvl vector<vvl>\\n#define vvl vector<vector<ll>>\\n#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))\\n#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));\\n#define re(c, b) for(ll c=0;c<b;c++)\\n#define all(obj) (obj).begin(), (obj).end()\\ntypedef long long int ll;\\ntypedef long double ld;\\nusing namespace std;\\n\\n#define P 1000000007\\n#define N_MAX 10000000\\nll fac[N_MAX+1], inv[N_MAX+1], finv[N_MAX+1];\\nll comb(ll n, ll k){\\n if(n<0||k<0||n<k) return 0;\\n return (((fac[n]*finv[n-k])%P)*finv[k])%P;\\n}\\nll perm(ll n, ll k){\\n if(n<0||k<0||n<k) return 0;\\n return (fac[n]*finv[n-k])%P;\\n}\\nvoid init(){\\n fac[0] = finv[0] = fac[1] = finv[1] = inv[1] = 1;\\n for(int i = 2; i <= N_MAX; i++){\\n fac[i] = (fac[i-1]*i)%P;\\n inv[i] = ((-(P/i)*inv[P%i])%P+P)%P;\\n finv[i] = (finv[i-1]*inv[i])%P;\\n }\\n}\\nll pp(ll a, ll b){ return (a * b)%P;}\\nll mpow(ll a, ll b, ll p = -1){\\n ll ret = 1, num = a;\\n while(b>0){\\n if(b&1) ret = (ret*num)%p;\\n num = (num*num)%p;\\n b /= 2;\\n }\\n return ret;\\n}\\nint main(){\\n ll n;std::cin >> n;\\n init();\\n vll a(n), b(n-1);\\n re(i, n) scanf(\\\"%lld\\\", &a[i]);\\n re(i, n-1) b[i] = abs(a[i] - a[i+1])%P;\\n ll ans = 0;\\n ll N = n-1;\\n for(int i=0;i<N;i++){\\n ans = (ans + (b[i]*comb(N-1, i))%P)%P;\\n }\\n std::cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 240676,\n \"score_of_the_acc\": -2,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3153_4840774\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n//----------------------- Print Function ----------------------//\\n\\ninline void print() {\\n cout << '\\\\n';\\n}\\ntemplate <typename First, typename... Rest>\\nvoid print(const First &first, const Rest &... rest) {\\n cout << first << ' ';\\n print(rest...);\\n}\\n\\ntemplate <typename T>\\nvoid print(const T &a) {\\n for (auto e : a) cout << e << ' ';\\n cout << '\\\\n';\\n}\\n\\n//------------------------- Libraries -------------------------//\\n\\ntemplate<int MOD> struct Fp {\\n long long val;\\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\\n if (val < 0) val += MOD;\\n }\\n constexpr int getmod() { return MOD; }\\n constexpr Fp operator - () const noexcept {\\n return val ? MOD - val : 0;\\n }\\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\\n constexpr Fp& operator += (const Fp& r) noexcept {\\n val += r.val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -= (const Fp& r) noexcept {\\n val -= r.val;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp& operator *= (const Fp& r) noexcept {\\n val = val * r.val % MOD;\\n return *this;\\n }\\n constexpr Fp& operator /= (const Fp& r) noexcept {\\n long long a = r.val, b = MOD, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b; swap(a, b);\\n u -= t * v; swap(u, v);\\n }\\n val = val * u % MOD;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr bool operator == (const Fp& r) const noexcept {\\n return this->val == r.val;\\n }\\n constexpr bool operator != (const Fp& r) const noexcept {\\n return this->val != r.val;\\n }\\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\\n return os << x.val;\\n }\\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\\n if (n == 0) return 1;\\n auto t = modpow(a, n / 2);\\n t = t * t;\\n if (n & 1) t = t * a;\\n return t;\\n }\\n};\\nusing mint = Fp<1000000007>;\\n\\nconst int MAX = 1000000;\\nconst int MOD = 1000000007;\\n \\nlong long fac[MAX], finv[MAX], inv[MAX];\\n \\nvoid COMinit(){\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n \\nlong long COM(int n, int k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\\n}\\n \\nlong long Perm(int n, int k) {\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * finv[n - k] % MOD;\\n}\\n\\n//--------------------------- Solve ---------------------------//\\n\\nvoid solve() {\\n int n; cin >> n;\\n vector<long long> a(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n\\n vector<long long> b(n-1);\\n for (int i = 0; i < n-1; i++) {\\n if (i % 2 == 0) {\\n if (a[i] > a[i+1]) b[i] = a[i] - a[i+1];\\n else b[i] = -(a[i] - a[i+1]);\\n }\\n else {\\n if (a[i] > a[i+1]) b[i] = -(a[i] - a[i+1]);\\n else b[i] = a[i] - a[i+1];\\n }\\n }\\n\\n COMinit(); \\n\\n mint ans = 0;\\n for (int i = 0; i < n-1; i++) {\\n if (i % 2 == 0) ans += b[i] * COM(n-2, i);\\n else ans -= b[i] * COM(n-2, i);\\n }\\n\\n cout << ans << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 29580,\n \"score_of_the_acc\": -0.1519,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3153_4840768\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n//----------------------- Print Function ----------------------//\\n\\ninline void print() {\\n cout << '\\\\n';\\n}\\ntemplate <typename First, typename... Rest>\\nvoid print(const First &first, const Rest &... rest) {\\n cout << first << ' ';\\n print(rest...);\\n}\\n\\ntemplate <typename T>\\nvoid print(const T &a) {\\n for (auto e : a) cout << e << ' ';\\n cout << '\\\\n';\\n}\\n\\n//------------------------- Libraries -------------------------//\\n\\ntemplate<int MOD> struct Fp {\\n long long val;\\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\\n if (val < 0) val += MOD;\\n }\\n constexpr int getmod() { return MOD; }\\n constexpr Fp operator - () const noexcept {\\n return val ? MOD - val : 0;\\n }\\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\\n constexpr Fp& operator += (const Fp& r) noexcept {\\n val += r.val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -= (const Fp& r) noexcept {\\n val -= r.val;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp& operator *= (const Fp& r) noexcept {\\n val = val * r.val % MOD;\\n return *this;\\n }\\n constexpr Fp& operator /= (const Fp& r) noexcept {\\n long long a = r.val, b = MOD, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b; swap(a, b);\\n u -= t * v; swap(u, v);\\n }\\n val = val * u % MOD;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr bool operator == (const Fp& r) const noexcept {\\n return this->val == r.val;\\n }\\n constexpr bool operator != (const Fp& r) const noexcept {\\n return this->val != r.val;\\n }\\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\\n return os << x.val;\\n }\\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\\n if (n == 0) return 1;\\n auto t = modpow(a, n / 2);\\n t = t * t;\\n if (n & 1) t = t * a;\\n return t;\\n }\\n};\\nusing mint = Fp<1000000007>;\\n\\nconst int MAX = 1000000;\\nconst int MOD = 1000000007;\\n \\nlong long fac[MAX], finv[MAX], inv[MAX];\\n \\nvoid COMinit(){\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n \\nlong long COM(int n, int k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\\n}\\n \\nlong long Perm(int n, int k) {\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * finv[n - k] % MOD;\\n}\\n\\n//--------------------------- Solve ---------------------------//\\n\\nvoid solve() {\\n int n; cin >> n;\\n vector<long long> a(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n\\n vector<long long> b(n-1);\\n for (int i = 0; i < n; i++) {\\n if (i % 2 == 0) {\\n if (a[i] > a[i+1]) b[i] = a[i] - a[i+1];\\n else b[i] = -(a[i] - a[i+1]);\\n }\\n else {\\n if (a[i] > a[i+1]) b[i] = -(a[i] - a[i+1]);\\n else b[i] = a[i] - a[i+1];\\n }\\n }\\n\\n COMinit(); \\n\\n mint ans = 0;\\n for (int i = 0; i < n-1; i++) {\\n if (i % 2 == 0) ans += b[i] * COM(n-2, i);\\n else ans -= b[i] * COM(n-2, i);\\n }\\n\\n cout << ans << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 0.13043478260869565,\n \"time_ms\": 10,\n \"memory_kb\": 26872,\n \"score_of_the_acc\": -0.095,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3153_4840090\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];\\n#define ft first\\n#define sc second\\n#define pb push_back\\n#define lb lower_bound\\n#define ub upper_bound\\n#define all(v) (v).begin(),(v).end()\\n#define LB(a,x) lb(all(a),x)-a.begin()\\n#define UB(a,x) ub(all(a),x)-a.begin()\\n#define mod 1000000007\\n//#define mod 998244353\\n#define FS fixed<<setprecision(15)\\nusing namespace std;\\ntypedef long long ll;\\nconst double pi=3.141592653589793;\\ntemplate<class T> using V=vector<T>;\\nusing Graph = vector<vector<int>>;\\nusing P=pair<ll,ll>;\\ntypedef unsigned long long ull;\\ntypedef long double ldouble;\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> inline void out(T a){ cout << a << '\\\\n'; }\\nvoid YN(bool ok){if(ok) cout << \\\"Yes\\\" << endl; else cout << \\\"No\\\" << endl;}\\n//void YN(bool ok){if(ok) cout << \\\"YES\\\" << endl; else cout << \\\"NO\\\" << endl;}\\n\\n\\nconst ll INF=1e18;\\nconst int mx=200005;\\n//wupc\\n\\nll mod_pow(ll x,ll n,ll m){\\n if(n==0) return 1;\\n ll res=mod_pow(x*x%m,n/2,m);\\n if(n&1) res=res*x%m;\\n return res;\\n}\\n\\nll modinv(ll n){\\n return mod_pow(n,mod-2,mod);\\n}\\n\\nint main(){\\n cin.tie(0);ios::sync_with_stdio(false);\\n ll n;\\n cin>>n;\\n V<ll> a(n);\\n cinf(n,a);\\n ll ans=0;\\n ll c[n];\\n c[0]=1;\\n for(ll i=1;i<=n-1;i++){\\n c[i]=(c[i-1]*(n-i-1))%mod;\\n c[i]=(c[i]*modinv(i))%mod;\\n }\\n for(ll i=0;i<n-1;i++) ans=(ans+abs(a[i]-a[i+1])*c[i]%mod)%mod;\\n out(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 6000,\n \"score_of_the_acc\": -0.3703,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3153_4837259\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\n#include <set>\\n#include <iomanip>\\n#include <numeric>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <fstream>\\n#include <cassert>\\n#include <stack>\\n#include <climits>\\n#include <array>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <memory>\\n#include <functional>\\n#include <cfloat>\\nconstexpr long long int MOD = 1000000007LL;\\n\\n\\nint main() {\\n\\tint n; std::cin >> n;\\n\\tstd::vector<long long int> factorial(n, 1), div(n, 1), inverse(n, 1);\\n\\tfor (auto i = 2; i < factorial.size(); ++i) {\\n\\t\\tfactorial[i] = i * factorial[i - 1] % MOD;\\n\\t\\tdiv[i] = (MOD - MOD / i) * div[MOD % i] % MOD;\\n\\t\\tinverse[i] = div[i] * inverse[i - 1] % MOD;\\n\\t}\\n\\tconst auto combination = [&factorial, &inverse](const int n, const int r) {\\n\\t\\treturn factorial[n] * inverse[n - r] % MOD * inverse[r] % MOD;\\n\\t};\\n\\tstd::vector<long long int> series(n);\\n\\tfor (auto& a : series) std::cin >> a;\\n\\tlong long int result{ 0 };\\n\\tfor (auto i = 0; i < n - 1; ++i) {\\n\\t\\tresult += std::abs(series[i] - series[i + 1]) * combination(n - 2, i) % MOD;\\n\\t}\\n\\tstd::cout << result % MOD << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 9404,\n \"score_of_the_acc\": -0.2029,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3153_4837141\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n \\n \\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SQ(a) ((a)*(a))\\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define SORT(c) sort((c).begin(),(c).end())\\n \\n \\n//repetition\\n//------------------------------------------\\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define MOD 1000000007\\n \\n \\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\\n#define trav(a, x) for(auto& a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n \\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n \\n#define chmin(x,y) x=min(x,y)\\n#define chmax(x,y) x=max(x,y)\\n\\nconst long double EPS = 1e-6, PI = acos((long double)-1);\\n\\n//ここから編集\\n\\nll GCD(ll a, ll b){\\n return (b == 0)?a:GCD(b, a%b);\\n}\\nll LCM(ll a, ll b){\\n return a/GCD(a, b)*b;\\n}\\n \\nconst int MAX = 2000010;\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n \\n// テーブルを作る前処理\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n \\n// 二項係数計算\\nlong long COM(int n, int k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(4);\\n\\n int N; cin >> N;\\n vector<ll> A(N);\\n REP(i,N) cin >> A[i];\\n COMinit();\\n vector<ll> B(N);\\n REP(i,N-1){\\n B[i] = abs(A[i]-A[i+1]);\\n }\\n\\n ll ans = 0;\\n REP(i,N-1){\\n ans += B[i] * COM(N-2, i);\\n ans %= MOD;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 52724,\n \"score_of_the_acc\": -0.4317,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3153_4835176\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define pb push_back\\n#define fi first\\n#define se second\\ntypedef pair<ll, ll> P;\\nusing VP = vector<P>;\\nusing VVP = vector<VP>;\\nusing VI = vector<ll>;\\nusing VVI = vector<VI>;\\nusing VVVI = vector<VVI>;\\nconst int inf = 1e9 + 7;\\nconst ll INF = 1LL << 61;\\nconst ll mod = 1e9 + 7;\\n\\ntemplate <class T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nvector<ll> inv, fact, invfact;\\nvoid Mod_build(int n = 201010) {\\n fact.resize(n + 1);\\n inv.resize(n + 1);\\n invfact.resize(n + 1);\\n fact[0] = inv[0] = invfact[0] = 1;\\n inv[1] = 1;\\n for (ll i = 0; i < n; i++) {\\n fact[i + 1] = fact[i] * (i + 1) % mod;\\n if (i > 0) inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;\\n invfact[i + 1] = invfact[i] * inv[i + 1] % mod;\\n }\\n}\\nll perm(int n, int k) {\\n if (n < 0 || k < 0 || k > n) return 0;\\n return fact[n] * invfact[n - k] % mod;\\n}\\nll comb(int n, int k) {\\n if (n < 0 || k < 0 || k > n) return 0;\\n return (fact[n] * invfact[n - k] % mod) * invfact[k] % mod;\\n}\\nll powmod(ll n, ll k) {\\n k %= mod - 1;\\n if (k < 0) k += mod - 1;\\n ll ret = 1;\\n while (k) {\\n if (k & 1) ret = ret * n % mod;\\n n = n * n % mod;\\n k >>= 1;\\n }\\n return ret;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int i, j;\\n Mod_build();\\n ll n;\\n cin >> n;\\n ll a[n];\\n for (i = 0; i < n; i++) cin >> a[i];\\n ll ans = 0;\\n ll ref = 1;\\n for (i = 0; i < n - 1; i++) {\\n ans += ref * abs(a[i + 1] - a[i]);\\n ref = comb(n - 1, i + 1) + mod - ref;\\n ref %= mod;\\n ans %= mod;\\n // cout << ref << endl;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 9404,\n \"score_of_the_acc\": -0.0665,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3153_4835118\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\nconst int MOD=1e9+7;\\n\\nstd::vector<int> Factorial(5e6),Finverse(5e6);\\nint pw(int n,int k){\\n assert(k>=0);\\n int res=1;\\n while(k){\\n if(k&1)(res*=n)%=MOD;\\n (n*=n)%=MOD;\\n k>>=1;\\n }\\n return res;\\n}\\ninline void Cinit(){\\n Factorial[0]=1;\\n for(int i=1;i<5e6;i++)Factorial[i]=(Factorial[i-1]*i)%MOD;\\n Finverse[4999999]=pw(Factorial[4999999],MOD-2);\\n for(int i=4999998;i>=0;i--)Finverse[i]=(i+1)*Finverse[i+1]%MOD;\\n}\\nint nCk(int n,int k){\\n if(n<k)return 0;if(k<0)return 0;\\n if(!Factorial[0])Cinit();\\n int res=Factorial[n];\\n (res*=Finverse[k])%=MOD;\\n (res*=Finverse[n-k])%=MOD;\\n return res;\\n}\\n\\nsigned main(){\\n int n;cin>>n;\\n vector<int>v(n);\\n for(int i=0;i<n;i++)cin>>v[i];\\n vector<int> w(n-1);\\n for(int i=0;i<n-1;i++)w[i]=abs(v[i]-v[i+1]);\\n int ans=0;\\n for(int i=0;i<n-1;i++)(ans+=nCk(n-2,i)*w[i]%MOD)%=MOD;\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 84116,\n \"score_of_the_acc\": -0.8828,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3153_4835067\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define P pair<ll,ll>\\n#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)\\n#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)\\n#define TO(x,t,f) ((x)?(t):(f))\\n#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9\\n#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v x is sorted\\n#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v x is sorted\\n#define NUM(x,v) (POSU(x,v)-POSL(x,v)) //x is sorted\\n#define REV(x) (reverse(x.begin(),x.end())) //reverse\\nll gcd_(ll a,ll b){if(a%b==0)return b;return gcd_(b,a%b);}\\nll lcm_(ll a,ll b){ll c=gcd_(a,b);return ((a/c)*(b/c)*c);}\\n#define NEXTP(x) next_permutation(x.begin(),x.end())\\nconst ll INF=ll(1e16)+ll(7);\\nconst ll MOD=1000000007LL;\\n#define out(a) cout<<fixed<<setprecision((a))\\n//tie(a,b,c) = make_tuple(10,9,87);\\n#define pop_(a) __builtin_popcount((a))\\nll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}\\n\\nll calc(ll x,ll a){\\n\\tif(a==0) return 1LL;\\n\\tll res = calc(x,a/2);\\n\\tres = res*res % MOD;\\n\\tif(a&1)res = res*x % MOD;\\n\\treturn res;\\n}\\n\\n\\nint main(){\\n\\n\\tll N;\\n\\tcin >> N;\\n\\tvector<ll> A(N);\\n\\tFOR(i,0,N) cin >> A[i];\\n\\n\\tll ans = 0;\\n\\tll a = 1;\\n\\tFOR(i,0,N-1){\\n\\t\\tll k = abs(A[i] - A[i+1]) % MOD;\\n\\t\\t(ans += a*k%MOD) %= MOD;\\n\\t\\ta *= N - 2 - i;\\n\\t\\ta %= MOD;\\n\\t\\ta *= calc(i+1,MOD-2);\\n\\t\\ta %= MOD;\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 4428,\n \"score_of_the_acc\": -0.3636,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3153_4834943\",\n \"code_snippet\": \"/**\\n * author: otera \\n**/\\n#include<iostream>\\n#include<string> \\n#include<cstdio>\\n#include<cstring>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm> \\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<deque>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\n#define int long long\\ntypedef long long ll;\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\ntypedef long double ld;\\nconst int inf=1e9+7;\\nconst ll INF=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-8;\\nconst ld pi = acos(-1.0);\\ntypedef pair<int, int> P;\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define pb push_back\\n#define debug(x) cerr << #x << \\\" = \\\" << (x) << endl;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n// modint: mod 計算を int を扱うように扱える構造体\\ntemplate<int MOD> struct Fp {\\n long long val;\\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\\n if (val < 0) val += MOD;\\n }\\n constexpr int getmod() { return MOD; }\\n constexpr Fp operator - () const noexcept {\\n return val ? MOD - val : 0;\\n }\\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\\n constexpr Fp& operator += (const Fp& r) noexcept {\\n val += r.val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -= (const Fp& r) noexcept {\\n val -= r.val;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp& operator *= (const Fp& r) noexcept {\\n val = val * r.val % MOD;\\n return *this;\\n }\\n constexpr Fp& operator /= (const Fp& r) noexcept {\\n long long a = r.val, b = MOD, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b; swap(a, b);\\n u -= t * v; swap(u, v);\\n }\\n val = val * u % MOD;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr bool operator == (const Fp& r) const noexcept {\\n return this->val == r.val;\\n }\\n constexpr bool operator != (const Fp& r) const noexcept {\\n return this->val != r.val;\\n }\\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\\n return os << x.val;\\n }\\n friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {\\n return is >> x.val;\\n }\\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\\n if (n == 0) return 1;\\n auto t = modpow(a, n / 2);\\n t = t * t;\\n if (n & 1) t = t * a;\\n return t;\\n }\\n};\\n\\n// 二項係数ライブラリ\\ntemplate<class T> struct BiCoef {\\n vector<T> fact_, inv_, finv_;\\n constexpr BiCoef() {}\\n constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {\\n init(n);\\n }\\n constexpr void init(int n) noexcept {\\n fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);\\n int MOD = fact_[0].getmod();\\n for(int i = 2; i < n; i++){\\n fact_[i] = fact_[i-1] * i;\\n inv_[i] = -inv_[MOD%i] * (MOD/i);\\n finv_[i] = finv_[i-1] * inv_[i];\\n }\\n }\\n constexpr T com(int n, int k) const noexcept {\\n if (n < k || n < 0 || k < 0) return 0;\\n return fact_[n] * finv_[k] * finv_[n-k];\\n }\\n constexpr T fact(int n) const noexcept {\\n if (n < 0) return 0;\\n return fact_[n];\\n }\\n constexpr T inv(int n) const noexcept {\\n if (n < 0) return 0;\\n return inv_[n];\\n }\\n constexpr T finv(int n) const noexcept {\\n if (n < 0) return 0;\\n return finv_[n];\\n }\\n};\\n\\nconst int MOD = 1000000007;\\n//const int MOD = 998244353;\\nusing mint = Fp<MOD>;\\nBiCoef<mint> bc;\\n\\nvoid solve() {\\n\\tint n; cin >> n;\\n vector<int> a(n);\\n rep(i, n) {\\n cin >> a[i];\\n }\\n bc.init(200200);\\n vector<mint> b(n - 1);\\n rep(i, n - 1) {\\n b[i] = (mint)(abs(a[(i + 1 + n) % n] - a[i]));\\n }\\n mint ans = 0;\\n rep(i, n - 1) {\\n ans += b[i] * bc.com(n - 2, i);\\n }\\n cout << ans << endl;\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//int t; cin >> t; rep(i, t)solve();\\n\\tsolve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 10720,\n \"score_of_the_acc\": -0.0721,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3153_4834267\",\n \"code_snippet\": \"#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n#define FOR(i, a, b) for(ll i = a; i < b; i++)\\n#define rep(i, n) FOR(i, 0, n)\\n#define rFOR(i, a, b) for(ll i = a - 1; i >= b; i--)\\n#define rrep(i, a) rFOR(i, a, 0)\\n#define pb push_back\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\ntypedef pair<ll,ll> P;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<P> vP;\\ntypedef vector<char> vc;\\ntypedef vector<vc> vvc;\\nconst ll MOD = 1000000007;\\nconst ll MOD2 = 998244353;\\nconst ld PI = acos(-1);\\nconst ll INF = 1e18;\\nstruct edge{ll to, cost;};\\n\\ntemplate <typename T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <typename T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n//組み合わせを線形で\\n//参考:https://drken1215.hatenablog.com/entry/2018/06/08/210000\\n\\nconst int MXN = 1000001;//変更可\\nlong long fac[MXN], inv[MXN], finv[MXN];\\n\\nvoid COMinit(int M){\\n fac[0] = fac[1] = 1;\\n inv[1] = 1;\\n finv[0] = finv[1] = 1;\\n for(int i = 2; i < MXN; i++){\\n fac[i] = fac[i-1] * i % M;\\n inv[i] = M - M / i * inv[M%i] % M;\\n finv[i] = finv[i-1] * inv[i] % M;\\n }\\n}\\n\\nlong long COMBI(int N, int K, int M){\\n if(N < K){\\n return 0;\\n }\\n if(N < 0||K < 0){\\n return 0;\\n }\\n return fac[N] * finv[N-K] % M * finv[K] % M;\\n}\\n\\nlong long PERMU(int N, int K, int M){\\n if(N < K){\\n return 0;\\n }\\n if(N < 0||K < 0){\\n return 0;\\n }\\n return fac[N] * finv[N-K] % M;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int N;\\n cin >> N;\\n COMinit(MOD);\\n vl A(N);\\n rep(i,N){\\n cin >> A[i];\\n }\\n ll MX=-INF,MN=INF;\\n vl B(N-1);\\n rep(i,N-1){\\n B[i]=abs(A[i]-A[i+1]);\\n }\\n ll ans=0;\\n rep(i,N-1){\\n ans+=(B[i]*COMBI(N-2,i,MOD))%MOD;\\n ans%=MOD;\\n }\\n cout << (ans+MOD)%MOD << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 29528,\n \"score_of_the_acc\": -0.2881,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3153_4834243\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <sstream>\\n#include <stack>\\n#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <bitset>\\n#include <iomanip>\\n#include <limits>\\n#include <chrono>\\n#include <random>\\n#include <array>\\n#include <unordered_map>\\n#include <functional>\\n#include <complex>\\n#include <numeric>\\n#include <cctype>\\n#include <map>\\n#include <set>\\n#include <cstdlib>\\n#include <bitset>\\n#include <tuple>\\n#include <assert.h>\\n#include <deque>\\n#include <utility>\\n#include <fstream>\\n\\nusing namespace std;\\ntypedef long long ll;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }\\n//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\\n\\nconstexpr long long INF = 1LL << 60;\\nconstexpr int inf = 1000000007;\\nconstexpr long long mod = 1000000007LL;\\n\\n\\nstruct mint {\\n\\tlong long x;\\n\\tmint(long long x = 0) :x((x% mod + mod) % mod) {}\\n\\tmint& operator+=(const mint a) {\\n\\t\\tif ((x += a.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tmint& operator-=(const mint a) {\\n\\t\\tif ((x += mod - a.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tmint& operator*=(const mint a) {\\n\\t\\t(x *= a.x) %= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tmint operator+(const mint a) const {\\n\\t\\tmint res(*this);\\n\\t\\treturn res += a;\\n\\t}\\n\\tmint operator-(const mint a) const {\\n\\t\\tmint res(*this);\\n\\t\\treturn res -= a;\\n\\t}\\n\\tmint operator*(const mint a) const {\\n\\t\\tmint res(*this);\\n\\t\\treturn res *= a;\\n\\t}\\n\\tmint pow(ll t) const {\\n\\t\\tif (!t) return 1;\\n\\t\\tmint a = pow(t >> 1);\\n\\t\\ta *= a;\\n\\t\\tif (t & 1) a *= *this;\\n\\t\\treturn a;\\n\\t}\\n\\n\\t// for prime mod\\n\\tmint inv() const {\\n\\t\\treturn pow(mod - 2);\\n\\t}\\n\\tmint& operator/=(const mint a) {\\n\\t\\treturn (*this) *= a.inv();\\n\\t}\\n\\tmint operator/(const mint a) const {\\n\\t\\tmint res(*this);\\n\\t\\treturn res /= a;\\n\\t}\\n};\\nconstexpr int MAX = 500000;\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\nvoid COMinit() {\\n\\tfac[0] = fac[1] = 1;\\n\\tfinv[0] = finv[1] = 1;\\n\\tinv[1] = 1;\\n\\tfor (int i = 2; i < MAX; i++) {\\n\\t\\tfac[i] = fac[i - 1] * i % mod;\\n\\t\\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\\n\\t\\tfinv[i] = finv[i - 1] * inv[i] % mod;\\n\\t}\\n}\\n\\nmint COM(int n, int k) {\\n\\tif (n < k) return 0;\\n\\tif (n < 0 || k < 0) return 0;\\n\\treturn mint(fac[n] * (finv[k] * finv[n - k] % mod) % mod);\\n}\\n\\nmint LCOM(ll n, ll k) {\\n\\tif (n < k) return 0;\\n\\tif (n < 0 || k < 0) return 0;\\n\\tif (k > n / 2) k = n - k;\\n\\tmint res = 1;\\n\\tfor (int i = 0; i < k; i++) res *= (n - i);\\n\\tres *= finv[k];\\n\\treturn res;\\n}\\nint main()\\n{\\n\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\n\\tCOMinit();\\n\\tint n; cin >> n;\\n\\tvector<ll> a(n); for (int i = 0; i < n; i++) cin >> a[i];\\n\\tvector<mint> b(n); for (int i = 0; i < n - 1; i++) b[i] = llabs(a[i + 1] - a[i]);\\n\\tmint res = 0;\\n\\tfor (int i = 0; i < n - 1; i++) {\\n\\t\\tres += COM(n - 2, i) * b[i];\\n\\t}\\n\\tcout << res.x << \\\"\\\\n\\\";\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 17604,\n \"score_of_the_acc\": -0.1012,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3153_4834208\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\ntypedef long long int ll;\\n\\nconstexpr ll mod=1e9+7;\\n\\nll mod_pow(ll a,ll b){\\n\\ta%=mod;\\n\\tif(b==0)return 1;\\n\\tif(b==1)return a;\\n\\tll res=mod_pow(a,b/2)%mod;\\n\\tres*=res; res%=mod;\\n\\tif(b%2)res*=a;\\n\\treturn res%mod;\\n}\\n\\nstruct perm{\\nprivate:\\n\\tint sz;\\n\\tvector<ll> p,invp;\\npublic:\\n\\tperm(int n){\\n\\t\\tsz=n+1;\\n\\t\\tp.resize(sz),invp.resize(sz);\\n\\t\\tp[0]=1;\\n\\t\\tfor(int i=1;i<=sz-1;i++){\\n\\t\\t\\tp[i]=p[i-1]*i%mod;\\n\\t\\t}\\n\\t\\tinvp[sz-1]=mod_pow(p[sz-1],mod-2);\\n\\t\\tfor(int i=sz-2;i>=0;i--){\\n\\t\\t\\tinvp[i]=invp[i+1]*(i+1)%mod;\\n\\t\\t}\\n\\t}\\n\\tll comb(ll x,ll y){\\n\\t\\tif(x<y||y<0)return 0;\\n\\t\\treturn (p[x]*invp[x-y]%mod)*invp[y]%mod;\\n\\t}\\n};\\nperm p(1<<20);\\n\\nint main(){\\n\\tint n; cin >> n;\\n\\tvector<ll> a(n);\\n\\tvector<ll> b(n-1);\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tcin >> a[i];\\n\\t}\\n\\tfor(int i=0;i<n-1;i++){\\n\\t\\tb[i]=abs(a[i]-a[i+1]);\\n\\t}\\n\\tll res=0;\\n\\tfor(int i=0;i<n-1;i++){\\n\\t\\t(res+=b[i]*p.comb(n-2,i)%mod)%=mod;\\n\\t}\\n\\tcout << res << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 22340,\n \"score_of_the_acc\": -0.3485,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3153_4834114\",\n \"code_snippet\": \"#pragma region Macros\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define ll long long\\n#define ld long double\\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vll vector<ll>\\n#define vpi vector<pii>\\n#define vpll vector<pll>\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n#define fi first\\n#define se second\\n#define all(c) begin(c), end(c)\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\nusing namespace std;\\nstring YES[2] = {\\\"NO\\\", \\\"YES\\\"};\\nstring Yes[2] = {\\\"No\\\", \\\"Yes\\\"};\\nstring yes[2] = {\\\"no\\\", \\\"yes\\\"};\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\n#define si(c) (int)(c).size()\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\\n scan(head);\\n IN(tail...);\\n}\\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\nvi iota(int n) {\\n vi a(n);\\n iota(all(a), 0);\\n return a;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n sort(all(y));\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\nint popcount(ll x) { return __builtin_popcountll(x); }\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(15);\\n }\\n} setup_io;\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return move(res);\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n cin >> a >> b >> c;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return move(res);\\n}\\n\\n#define i128 __int128_t\\n#define ull unsigned long long int\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n for(auto &e : v) cout << e << \\\" \\\";\\n cout << endl;\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n cout << \\\"(\\\" << p.fi << \\\", \\\" << p.se << \\\")\\\";\\n return os;\\n}\\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \\\"(\\\" + to_string(p.first) + \\\",\\\" + to_string(p.second) + \\\")\\\"; }\\ntemplate <class A> string to_string(A v) {\\n if(v.empty()) return \\\"{}\\\";\\n string ret = \\\"{\\\";\\n for(auto &x : v) ret += to_string(x) + \\\",\\\";\\n ret.back() = '}';\\n return ret;\\n}\\n\\nvoid dump() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\\n cerr << to_string(head) << \\\" \\\";\\n dump(tail...);\\n}\\n#define endl '\\\\n'\\n#ifdef _LOCAL\\n#undef endl\\n#define debug(x) \\\\\\n cout << #x << \\\": \\\"; \\\\\\n dump(x)\\n#else\\n#define debug(x)\\n#endif\\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\\n\\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\n#pragma endregion\\nnamespace modular {\\nconstexpr ll MOD = 1000000007;\\nconst int MAXN = 1100000;\\ntemplate <ll Modulus> class modint;\\n#define mint modint<MOD>\\n#define vmint vector<mint>\\nvector<mint> Inv;\\nmint inv(int x);\\ntemplate <ll Modulus> class modint {\\n\\n public:\\n static constexpr int mod() { return Modulus; }\\n ll a;\\n\\n constexpr modint(const ll x = 0) noexcept : a(((x % Modulus) + Modulus) % Modulus) {}\\n constexpr ll &value() noexcept { return a; }\\n constexpr const ll &value() const noexcept { return a; }\\n constexpr modint operator-() const noexcept { return modint() - *this; }\\n constexpr modint operator+() const noexcept { return *this; }\\n constexpr modint &operator++() noexcept {\\n if(++a == MOD) a = 0;\\n return *this;\\n }\\n constexpr modint &operator--() noexcept {\\n if(!a) a = MOD;\\n a--;\\n return *this;\\n }\\n constexpr modint operator++(int) {\\n modint res = *this;\\n ++*this;\\n return res;\\n }\\n constexpr modint operator--(int) {\\n mint res = *this;\\n --*this;\\n return res;\\n }\\n constexpr modint &operator+=(const modint rhs) noexcept {\\n a += rhs.a;\\n if(a >= Modulus) { a -= Modulus; }\\n return *this;\\n }\\n constexpr modint &operator-=(const modint rhs) noexcept {\\n if(a < rhs.a) { a += Modulus; }\\n a -= rhs.a;\\n return *this;\\n }\\n constexpr modint &operator*=(const modint rhs) noexcept {\\n a = a * rhs.a % Modulus;\\n return *this;\\n }\\n constexpr modint &operator/=(const modint rhs) noexcept {\\n a = a * (modular::inv(rhs.a)).a % Modulus;\\n return *this;\\n }\\n constexpr modint pow(long long n) const noexcept {\\n modint x = *this, r = 1;\\n while(n) {\\n if(n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n constexpr modint inv() const noexcept { return pow(Modulus - 2); }\\n constexpr friend modint operator+(const modint &lhs, const modint &rhs) { return modint(lhs) += modint(rhs); }\\n constexpr friend modint operator-(const modint &lhs, const modint &rhs) { return modint(lhs) -= modint(rhs); }\\n constexpr friend modint operator*(const modint &lhs, const modint &rhs) { return modint(lhs) *= modint(rhs); }\\n constexpr friend modint operator/(const modint &lhs, const modint &rhs) { return modint(lhs) /= modint(rhs); }\\n constexpr friend modint operator==(const modint &lhs, const modint &rhs) { return lhs.a == rhs.a; }\\n constexpr friend modint operator!=(const modint &lhs, const modint &rhs) { return lhs.a != rhs.a; }\\n // constexpr friend modint operator^=(const modint &lhs, const modint &rhs) { return modint(lhs) ^= modint(rhs); }\\n};\\nvmint Prd{1, 1}, Invprd{1, 1};\\nmint inv(int n) {\\n if(Inv.empty()) Inv.emplace_back(0), Inv.emplace_back(1);\\n if(Inv.size() > n)\\n return Inv[n];\\n else {\\n for(int i = Inv.size(); i <= n; ++i) Inv.emplace_back(Inv[MOD % i] * (-MOD / i));\\n return Inv[n];\\n }\\n}\\nmint prd(int n) {\\n if(Prd.size() > n)\\n return Prd[n];\\n else\\n for(int i = Prd.size(); i <= n; ++i) Prd.emplace_back(Prd[i - 1] * i);\\n return Prd[n];\\n}\\nmint invprd(int n) {\\n if(Invprd.size() > n)\\n return Invprd[n];\\n else\\n for(int i = Invprd.size(); i <= n; ++i) Invprd.emplace_back(Invprd[i - 1] * inv(i));\\n return Invprd[n];\\n}\\nmint modpow(ll a, ll n) { return mint(a).pow(n); }\\nmint inv(mint a) { return inv(a.a); }\\nmint invprd(mint a) { return invprd(a.a); }\\nmint prd(mint a) { return prd(a.a); }\\nmint modpow(mint a, ll n) { return modpow(a.a, n); }\\nmint C(int a, int b) {\\n if(a < 0 || b < 0) return 0;\\n if(a < b) return 0;\\n return prd(a) * invprd(b) * invprd(a - b);\\n}\\nmint P(int a, int b) {\\n if(a < 0 || b < 0) return 0;\\n if(a < b) return 0;\\n return prd(a) * invprd(a - b);\\n}\\nostream &operator<<(ostream &os, mint a) {\\n os << a.a;\\n return os;\\n}\\nistream &operator>>(istream &is, mint &a) {\\n ll x;\\n is >> x;\\n a = x;\\n return is;\\n}\\nstruct modinfo {\\n int mod, root;\\n};\\nconstexpr modinfo base0{1045430273, 3};\\nconstexpr modinfo base1{1051721729, 6};\\nconstexpr modinfo base2{1053818881, 7};\\nusing mint0 = modint<base0.mod>;\\nusing mint1 = modint<base1.mod>;\\nusing mint2 = modint<base2.mod>;\\nusing Poly = vmint;\\ntemplate <int mod> void FMT(vector<modint<mod>> &f, bool inv = false) {\\n using V = vector<modint<mod>>;\\n static V g(30), ig(30);\\n if(g.front().a == 0) {\\n modint<mod> root = 2;\\n while((root.pow((mod - 1) / 2)).a == 1) root += 1;\\n rep(i, 30) g[i] = -(root.pow((mod - 1) >> (i + 2))), ig[i] = g[i].inv();\\n }\\n int n = size(f);\\n if(!inv) {\\n for(int m = n; m >>= 1;) {\\n modint<mod> w = 1;\\n for(int s = 0, k = 0; s < n; s += 2 * m) {\\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\\n auto x = f[i], y = f[j] * w;\\n if(x.a >= mod) x.a -= mod;\\n f[i].a = x.a + y.a, f[j].a = x.a + (mod - y.a);\\n }\\n w *= g[__builtin_ctz(++k)];\\n }\\n }\\n } else {\\n for(int m = 1; m < n; m *= 2) {\\n modint<mod> w = 1;\\n for(int s = 0, k = 0; s < n; s += 2 * m) {\\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\\n auto x = f[i], y = f[j];\\n f[i] = x + y, f[j].a = x.a + (mod - y.a), f[j] *= w;\\n }\\n w *= ig[__builtin_ctz(++k)];\\n }\\n }\\n }\\n modint<mod> c;\\n if(inv)\\n c = modint<mod>(n).inv();\\n else\\n c = 1;\\n for(auto &&e : f) e *= c;\\n}\\nPoly operator-(Poly f) {\\n for(auto &&e : f) e = -e;\\n return f;\\n}\\nPoly &operator+=(Poly &l, const Poly &r) {\\n l.resize(max(l.size(), r.size()));\\n rep(i, r.size()) l[i] += r[i];\\n return l;\\n}\\nPoly operator+(Poly l, const Poly &r) { return l += r; }\\nPoly &operator-=(Poly &l, const Poly &r) {\\n l.resize(max(l.size(), r.size()));\\n rep(i, r.size()) l[i] -= r[i];\\n return l;\\n}\\nPoly operator-(Poly l, const Poly &r) { return l -= r; }\\nPoly &operator<<=(Poly &f, size_t n) { return f.insert(f.begin(), n, 0), f; }\\nPoly operator<<(Poly f, size_t n) { return f <<= n; }\\nPoly &operator>>=(Poly &f, size_t n) { return f.erase(f.begin(), f.begin() + min(f.size(), n)), f; }\\nPoly operator>>(Poly f, size_t n) { return f >>= n; }\\n\\nconstexpr int mod0 = 998244353, mod1 = 1300234241, mod2 = 1484783617;\\nusing M0 = modint<mod0>;\\nusing M1 = modint<mod1>;\\nusing M2 = modint<mod2>;\\n\\ntemplate <int mod> void mul(vector<modint<mod>> &l, vector<modint<mod>> &r) {\\n int n = size(l), m = size(r), sz = 1 << __lg(2 * (n + m - 1) - 1);\\n l.resize(sz), FMT<mod>(l);\\n r.resize(sz), FMT<mod>(r);\\n rep(i, sz) l[i] *= r[i];\\n FMT<mod>(l, true);\\n l.resize(n + m - 1);\\n}\\nPoly operator*(const Poly &l, const Poly &r) {\\n if(l.empty() or r.empty()) return Poly();\\n int n = size(l), m = size(r), sz = 1 << __lg(2 * (n + m - 1) - 1);\\n vector<M0> l0(n), r0(m);\\n vector<M1> l1(n), r1(m);\\n vector<M2> l2(n), r2(m);\\n rep(i, n) l0[i] = l[i].a, l1[i] = l[i].a, l2[i] = l[i].a;\\n rep(i, m) r0[i] = r[i].a, r1[i] = r[i].a, r2[i] = r[i].a;\\n mul<mod0>(l0, r0), mul<mod1>(l1, r1), mul<mod2>(l2, r2);\\n Poly res(n + m - 1);\\n // garner\\n static constexpr M1 inv0 = 613999507;\\n static constexpr M2 inv1 = 1147332803, inv0m1 = 45381342;\\n static constexpr mint m0 = mod0, m0m1 = m0 * mod1;\\n rep(i, n + m - 1) {\\n int y0 = l0[i].a;\\n int y1 = (inv0 * (l1[i] - y0)).a;\\n int y2 = (inv0m1 * (l2[i] - y0) - inv1 * y1).a;\\n res[i] = m0 * y1 + m0m1 * y2 + y0;\\n }\\n return res;\\n}\\nPoly &operator*=(Poly &l, const Poly &r) { return l = l * r; }\\nPoly integ(const Poly &f) {\\n Poly res(f.size() + 1);\\n for(int i = 1; i < (int)res.size(); ++i) res[i] = f[i - 1] / i;\\n return res;\\n}\\n// Poly deriv(const Poly &f) {\\n// if(f.size() == 0) return Poly();\\n// Poly res(f.size() - 1);\\n// rep(i, res.size()) res[i] = f[i + 1] * (i + 1);\\n// return res;\\n// }\\nostream &operator<<(ostream &os, Poly a) {\\n for(auto e : a) cout << e.a << \\\" \\\";\\n return os;\\n}\\n} // namespace modular\\nusing namespace modular;\\n\\nint main() {\\n INT(n);\\n VEC(int, a, n);\\n vmint b;\\n rep(i, n - 1) b.eb(abs(a[i + 1] - a[i]));\\n mint ans;\\n rep(i, n - 1) ans += C(n - 2, i) * b[i];\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 12100,\n \"score_of_the_acc\": -0.0779,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3153_4834051\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define be(v) (v).begin(),(v).end()\\n#define pb(q) push_back(q)\\ntypedef long long ll;\\nusing namespace std;\\nconst ll mod=1000000007, INF=(1LL<<60);\\n#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;\\nlong long modpow(long long a, long long n) {\\n long long res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a % mod;\\n a = a * a % mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\n\\n///////// combinatison\\nll fac[200007],finv[200007],inv[200007];\\nvoid cominit(){\\n fac[0]=fac[1]=1;\\n finv[0]=finv[1]=1;\\n inv[1]=1;\\n for(int i=2;i<200007;i++){\\n fac[i]=fac[i-1]*i%mod;\\n inv[i]=mod-inv[mod%i]*(mod/i)%mod;\\n finv[i]=finv[i-1]*inv[i]%mod;\\n }\\n}\\nll com(ll n,ll k){\\n if(n<k)return 0;\\n if(n<0 || k<0)return 0;\\n return fac[n]*(finv[k]*finv[n-k]%mod)%mod;\\n}\\n\\n\\n///////modint\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\\n mint operator+(const mint a) const { return mint(*this) += a;}\\n mint operator-(const mint a) const { return mint(*this) -= a;}\\n mint operator*(const mint a) const { return mint(*this) *= a;}\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\n // for prime mod\\n mint inv() const { return pow(mod-2);}\\n mint& operator/=(const mint a) { return *this *= a.inv();}\\n mint operator/(const mint a) const { return mint(*this) /= a;}\\n};\\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\\n\\n\\nint main() {\\n cin.tie(0);\\n cout.tie(0);\\n ios::sync_with_stdio(false);\\n ll n;\\n cin >> n;\\n ll a[n];\\n for(int i=0;i<n;i++) cin >> a[i];\\n for(int i=1;i<n;i++) a[i - 1] = abs(a[i] - a[i - 1]);\\n cominit();\\n mint ans = mint(0);\\n for(int i=0;i<n-1;i++){\\n ans += mint(a[i]) * mint(com(n - 2, i));\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 9456,\n \"score_of_the_acc\": -0.0667,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1974,"cells":{"group_id":{"kind":"string","value":"aoj_3157_cpp"},"problem_description":{"kind":"string","value":"Problem G: Fitness\nProblem\n外出することが少ないツバサくんは、家で筋トレを毎日行うようにしている。\n筋トレのレパートリーは $N$ 種類あり、 $i (1 \\leqq i \\leqq N)$ 種類目のトレーニングを1回行うと、 $t_i$ 分で $p_i$ だけ筋力アップする。\nただし、それぞれのトレーニングは筋力にとても負荷がかかるので、基本的に1回しか行うことができない。\n負荷がかかる場所はバラバラなので、複数種類のトレーニングを行うことは可能だ。\nまた、ツバサくんは休憩も重要だと考えていて、 $K$ 分費やして休憩することができる。\n十分に休憩をすることで筋力も回復し、以前既に行ったトレーニング全てを再び行うことができる。\nもちろん休憩時に筋力アップは見込めない。休憩は複数回取ることも可能だ。\nさて、今日はトレーニングを行う時間が $T$ 分ある。時間内に終わるようなトレーニングメニューを上手く作成したとき、どれだけ筋力アップできるだろうか？\nなお、トレーニングや休憩の切り替え時間は無視できるものとする。\nConstraints\n入力は以下の条件を満たす。\n$1 \\leqq N,K,T \\leqq 2000$\n$1 \\leqq t_i \\leqq 2000$\n$1 \\leqq p_i \\leqq 10^{9}$\n入力は全て整数である。\nInput\n入力は以下の形式で標準入出力から与えられる。\n$N$ $K$ $T$\n$t_1$ $p_1$\n$t_2$ $p_2$\n$\\vdots$\n$t_N$ $p_N$\nOutput\n$T$ 分以内で上昇する筋力の最大値を1行で出力せよ。\n末尾の改行を忘れないこと。\nSample Input 1\n3 1 10\n1 2\n2 4\n3 3\nSample Output 1\n16\n例えば、 $1$ $\\to$ $2$ $\\to$ $3$ $\\to$ 休憩 $\\to$ $1$ $\\to$ $2$ というメニューを選ぶと、 $10$ 分で筋力が $15$ アップする。\n$2$ $\\to$ 休憩 $\\to$ $2$ $\\to$ 休憩 $\\to$ $2$ $\\to$ $1$ とすると $9$ 分で筋力が $14$ アップする。時間を余らせても問題ない点に注意すること。\n$1$ $\\to$ $2$ $\\to$ 休憩 $\\to$ $1$ $\\to$ $2$ $\\to$ 休憩 $\\to$ $2$ とすると $10$ 分で筋力が $16$アップし、これが最適である。\nSample Input 2\n3 1 10\n53 1576\n78 2115\n89 2006\nSample Output 2\n0\nそもそも時間内に終わるトレーニングが存在しない。\nSample Input 3\n4 8 800\n10 49275367\n474 100000000\n9 2587424\n20 99999999\nSample Output 3\n3137370110\nオーバーフローに注意すること。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3157_7073173","code_snippet":"#include <iostream>\n#include <string.h>\nusing namespace std;\nlong long int dp[2002][2002];\nlong long int ts[2001];\nlong long int ps[2001];\n\nint t;\nvoid f(int t2,int p2,long long int s2){\n\tif(t2>t)return ;\n\tif(dp[t2][p2]<s2)dp[t2][p2]=s2;\n}\n\n\nint main() {\n\tmemset(dp,-1,sizeof(dp));\n\tdp[0][0]=0;\n\tint n,k;\n\tcin>>n>>k>>t;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>ts[i]>>ps[i];\n\t}\n\tlong long int ans=0;\n\tfor(int t2=0;t2<=t;t2++){\n\t\tfor(int p2=0;p2<=n;p2++){\n\t\t\tlong long int s2=dp[t2][p2];\n\t\t\tif(s2==-1)continue;\n\t\t\tif(ans<s2)ans=s2;\n\t\t\tif(p2==n){\n\t\t\t\tf(t2+k,0,s2);\n\t\t\t}else{\n\t\t\t\tf(t2,p2+1,s2);\n\t\t\t\tf(t2+ts[p2],p2+1,s2+ps[p2]);\n\t\t\t\tf(t2+k,0,s2);\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":34456,"score_of_the_acc":-0.5115,"final_rank":12},{"submission_id":"aoj_3157_4947204","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 2005\n\nstruct Info{\n\n\tll need_time,value;\n};\n\nll N,K,T;\nInfo info[SIZE];\nll dp1[SIZE][SIZE],dp2[SIZE];\n\nint main(){\n\n\tscanf(\"%lld %lld %lld\",&N,&K,&T);\n\n\tfor(ll i = 1; i <= N; i++){\n\n\t\tscanf(\"%lld %lld\",&info[i].need_time,&info[i].value);\n\t}\n\n\tfor(ll i = 0; i <= N; i++){\n\t\tfor(ll k = 0; k <= T; k++){\n\t\t\tdp1[i][k] = -BIG_NUM;\n\t\t}\n\t}\n\n\tdp1[0][0] = 0;\n\tfor(ll i = 1; i <= N; i++){\n\t\tfor(ll k = 0; k <= T; k++){\n\t\t\tif(dp1[i-1][k] == -BIG_NUM)continue;\n\n\t\t\t//足さない\n\t\t\tdp1[i][k] = max(dp1[i][k],dp1[i-1][k]);\n\n\t\t\tif(k+info[i].need_time > T)continue;\n\n\t\t\t//足す\n\t\t\tdp1[i][k+info[i].need_time] = max(dp1[i][k+info[i].need_time],dp1[i-1][k]+info[i].value);\n\t\t}\n\t}\n\n\tfor(ll k = 0; k <= T; k++){\n\n\t\tdp2[k] = dp1[N][k];\n\t}\n\tdp2[0] = 0;\n\n\tfor(ll t = 1; t <= T; t++){\n\t\tfor(ll p = 0; p+(t+K) <= T; p++){\n\t\t\tif(dp2[p] == -BIG_NUM)continue;\n\n\t\t\tdp2[p+(t+K)] = max(dp2[p+(t+K)],dp2[p]+dp1[N][t]);\n\t\t}\n\t}\n\n\tll ans = 0;\n\n\tfor(ll k = 0; k <= T; k++){\n\n\t\tans = max(ans,dp2[k]);\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":34624,"score_of_the_acc":-0.1372,"final_rank":4},{"submission_id":"aoj_3157_4844233","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <array>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <cassert>\n#include <iomanip>\n#define vll vector<ll>\n#define vvvl vector<vvl>\n#define vvl vector<vector<ll>>\n#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))\n#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));\n#define re(c, b) for(ll c=0;c<b;c++)\n#define all(obj) (obj).begin(), (obj).end()\ntypedef long long int ll;\ntypedef long double ld;\nusing namespace std;\n\nint main(){\n ll INF = 1000000000000000000;\n ll n, k, t;scanf(\"%lld %lld %lld\", &n, &k, &t);\n vvl DP = VV(n+1, t+1, -INF, ll);\n DP[0][0] = 0;\n vvl dat = VV(n, 2, 0, ll);\n for(ll i=0;i<n;i++) scanf(\"%lld %lld\", &dat[i][0], &dat[i][1]);\n for(ll i=0;i<n;i++){\n for(ll j=0;j<=t;j++){\n DP[i+1][j] = max(DP[i+1][j], DP[i][j]);\n if(j + dat[i][0]<=t) DP[i+1][j+dat[i][0]] = max(DP[i+1][j+dat[i][0]], DP[i][j]+dat[i][1]);\n }\n }\n vll te = DP[n];//時間あたりの効率\n for(ll i=1;i<=t;i++) te[i] = max(te[i], te[i-1]);//メインの周期\n ll ans = 0;\n\n vvl dp = VV(t+n+2, t+1, -INF, ll);// 物0~T-1は重複可能\n dp[0][0] = 0;\n\n for(ll i=0;i<t+n+1;i++){\n if(i<=t){\n for(ll j=0;j<=t;j++){\n dp[i+1][j] = max(dp[i+1][j], dp[i][j]);\n if(j+i+k<=t) dp[i+1][j+i+k] = max({dp[i+1][j+i+k], dp[i][j]+te[i], dp[i+1][j]+te[i]});\n }\n }else{\n ll idx = i - t - 1;\n ll w = dat[idx][0], v = dat[idx][1];\n for(ll j=0;j<=t;j++){\n dp[i+1][j] = max(dp[i+1][j], dp[i][j]);\n if(j+w<=t) dp[i+1][j+w] = max(dp[i+1][j+w], dp[i][j] + v);\n }\n }\n }\n for(int i=0;i<=t;i++) ans = max(ans, dp[n+t+1][i]);\n std::cout << ans << '\\n';\n}","accuracy":1,"time_ms":40,"memory_kb":97316,"score_of_the_acc":-0.7889,"final_rank":15},{"submission_id":"aoj_3157_4840893","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n//----------------------- Print Function ----------------------//\n\ninline void print() {\n cout << '\\n';\n}\ntemplate <typename First, typename... Rest>\nvoid print(const First &first, const Rest &... rest) {\n cout << first << ' ';\n print(rest...);\n}\n\ntemplate <typename T>\nvoid print(const T &a) {\n for (auto e : a) cout << e << ' ';\n cout << '\\n';\n}\n\n//------------------------- Libraries -------------------------//\n\ntemplate<class T>\nbool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//--------------------------- Solve ---------------------------//\n\nlong long dp1[2005][2005];\nlong long dp2[2005][2005];\n\nvoid solve() {\n int N, K, T; cin >> N >> K >> T;\n vector<long long> t(N+1), p(N+1);\n for (int i = 1; i <= N; i++) cin >> t[i] >> p[i];\n\n for (int i = 1; i <= N; i++) {\n for (int j = 0; j <= T; j++) {\n chmax(dp1[i][j], dp1[i-1][j]);\n if (j - t[i] >= 0) chmax(dp1[i][j], dp1[i-1][j-t[i]] + p[i]);\n }\n }\n\n for (int i = 0; i <= T; i++) {\n dp2[0][i] = dp1[N][i];\n }\n for (int i = 1; i <= T; i++) {\n for (int j = 0; j <= T; j++) {\n chmax(dp2[i][j], dp2[i-1][j]);\n if (j-(i+K) >= 0) chmax(dp2[i][j], dp2[i][j-(i+K)] + dp1[N][i]);\n }\n }\n\n cout << dp2[T][T] << '\\n';\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":66220,"score_of_the_acc":-0.2767,"final_rank":7},{"submission_id":"aoj_3157_4840791","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\nusing ll = long long;\nusing P = pair<ll, ll>;\nconst long double PI = acos(-1.0L);\nll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }\nll LCM(ll a, ll b) { return a/GCD(a, b)*b; }\n\nll n, k, t;\nll dp[2020][2020];\nll dp2[2020][2020];\n\nint main() {\n cin >> n >> k >> t;\n vector<ll> tvec(n, 0);\n vector<ll> pvec(n, 0);\n for(int i = 0; i < n; ++i) cin >> tvec[i] >> pvec[i];\n\n memset(dp, 0, sizeof(dp));\n memset(dp2, 0, sizeof(dp2));\n\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j <= t; ++j) {\n chmax(dp[i+1][j], dp[i][j]);\n if(j-tvec[i] >= 0) {\n chmax(dp[i+1][j], dp[i][j-tvec[i]]+pvec[i]);\n }\n }\n }\n\n for(int i = 0; i <= t; ++i) dp2[0][i] = dp[n][i];\n\n vector<ll> wvec(t+1, 0);\n for(int i = 0; i <= t; ++i) wvec[i] = i+k;\n\n for(int i = 1; i <= t; ++i) {\n for(int j = 1; j <= t; ++j) {\n chmax(dp2[i][j], dp2[i-1][j]);\n if(j-wvec[i] >= 0) {\n chmax(dp2[i][j], dp2[i][j-wvec[i]]+dp[n][i]);\n }\n }\n }\n\n ll ans = 0;\n for(int i = 0; i <= t; ++i) chmax(ans, dp2[t][i]);\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":66932,"score_of_the_acc":-0.4048,"final_rank":10},{"submission_id":"aoj_3157_4840784","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\nusing ll = long long;\nusing P = pair<ll, ll>;\nconst long double PI = acos(-1.0L);\nll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }\nll LCM(ll a, ll b) { return a/GCD(a, b)*b; }\n\nll n, k, t;\nll dp[2020][2020];\nll dp2[2020][2020];\n\nint main() {\n cin >> n >> k >> t;\n vector<ll> tvec(n, 0);\n vector<ll> pvec(n, 0);\n for(int i = 0; i < n; ++i) cin >> tvec[i] >> pvec[i];\n\n memset(dp, 0, sizeof(dp));\n memset(dp2, 0, sizeof(dp2));\n\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j <= t; ++j) {\n chmax(dp[i+1][j], dp[i][j]);\n if(j-tvec[i] >= 0) {\n chmax(dp[i+1][j], dp[i][j-tvec[i]]+pvec[i]);\n }\n }\n }\n\n for(int i = 0; i <= t; ++i) dp2[0][i] = dp[n][i];\n\n vector<ll> wvec(t, 0);\n for(int i = 0; i <= t; ++i) wvec[i] = i+k;\n\n for(int i = 1; i <= t; ++i) {\n for(int j = 1; j <= t; ++j) {\n chmax(dp2[i][j], dp2[i-1][j]);\n if(j-wvec[i] >= 0) {\n chmax(dp2[i][j], dp2[i][j-wvec[i]]+dp[n][i]);\n }\n }\n }\n\n ll ans = 0;\n for(int i = 0; i <= t; ++i) chmax(ans, dp2[t][i]);\n\n cout << ans << endl;\n}","accuracy":0.1,"time_ms":20,"memory_kb":66900,"score_of_the_acc":-0.4047,"final_rank":19},{"submission_id":"aoj_3157_4840092","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\n#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];\n#define ft first\n#define sc second\n#define pb push_back\n#define lb lower_bound\n#define ub upper_bound\n#define all(v) (v).begin(),(v).end()\n#define LB(a,x) lb(all(a),x)-a.begin()\n#define UB(a,x) ub(all(a),x)-a.begin()\n#define mod 1000000007\n//#define mod 998244353\n#define FS fixed<<setprecision(15)\nusing namespace std;\ntypedef long long ll;\nconst double pi=3.141592653589793;\ntemplate<class T> using V=vector<T>;\nusing Graph = vector<vector<int>>;\nusing P=pair<ll,ll>;\ntypedef unsigned long long ull;\ntypedef long double ldouble;\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline void out(T a){ cout << a << '\\n'; }\nvoid YN(bool ok){if(ok) cout << \"Yes\" << endl; else cout << \"No\" << endl;}\n//void YN(bool ok){if(ok) cout << \"YES\" << endl; else cout << \"NO\" << endl;}\n\n\nconst ll INF=1e18;\nconst int mx=200005;\n//wupc\n\nll dp1[2005][2005],dp2[2005];\n\nint main(){\n cin.tie(0);ios::sync_with_stdio(false);\n ll n,k,T;\n cin>>n>>k>>T;\n V<ll> t(n),p(n);\n rep(i,n) cin>>t[i]>>p[i];\n rep(i,n){\n for(int j=0;j<=T;j++){\n chmax(dp1[i+1][j],dp1[i][j]);\n if(j-t[i]>=0) chmax(dp1[i+1][j],dp1[i][j-t[i]]+p[i]);\n }\n }\n V<ll> tt(T+1),q(T+1);\n for(int i=0;i<=T;i++){\n tt[i]=i+k;\n q[i]=dp1[n][i];\n }\n for(int i=0;i<=T;i++) dp2[i]=dp1[n][i];\n rep(j,T+1){\n rep(i,T+1){\n if(j+tt[i]<=T) chmax(dp2[j+tt[i]],dp2[j]+q[i]);\n }\n }\n ll ans=0;\n for(int i=0;i<=T;i++) chmax(ans,dp2[i]);\n out(ans);\n}","accuracy":1,"time_ms":10,"memory_kb":34596,"score_of_the_acc":-0.1371,"final_rank":3},{"submission_id":"aoj_3157_4836623","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,n) for(ll i=0;i<(ll)n;i++)\n#define dump(x) cerr << \"Line \" << __LINE__ << \": \" << #x << \" = \" << (x) << \"\\n\";\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n\nusing ld = long double;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<ld, ld>;\n\ntemplate<typename T> using V = vector<T>;\ntemplate<typename T> using P = pair<T, T>;\ntemplate<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }\ntemplate<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }\ntemplate<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << \"(\" << v.first << \", \" << v.second << \")\"; return os;}\ntemplate<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }\ntemplate<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << \"\\n\";} return os;}\nstruct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;\n\ntemplate <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\nvoid fail() { cout << -1 << '\\n'; exit(0); }\ninline int popcount(const int x) { return __builtin_popcount(x); }\ninline int popcount(const ll x) { return __builtin_popcountll(x); }\ntemplate<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)\n{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<\"\\n\";}};\ntemplate<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];\nfor(ll i=1;i<n;i++)cerr spa v[i];\ncerr<<\"\\n\";};\n\nconst ll INF = (1ll<<62);\n// const ld EPS = 1e-10;\n// const ld PI = acos(-1.0);\nconst ll mod = (int)1e9 + 7;\n//const ll mod = 998244353;\n\nint main(){\n\n ll N, K, T;\n cin >> N >> K >> T;\n V<ll> t(N), p(N);\n REP(i, N) cin >> t[i] >> p[i];\n\n V<V<ll>> dp(N+1, V<ll>(T+1, -1));\n dp[0][0] = 0;\n REP(i, N){\n REP(j, T+1){\n if(dp[i][j]!=-1){\n chmax(dp[i+1][j], dp[i][j]);\n if(j+t[i]<T+1)chmax(dp[i+1][j+t[i]], dp[i][j]+p[i]);\n }\n }\n }\n\n V<ll> pos(T+1, 0);\n REP(i, T+1) pos[i] = dp[N][i];\n\n V<V<ll>> dq(T+1, V<ll>(2, -INF));\n dq[0][0] = 0;\n REP(i, T){\n REP(j, T+1){\n if(i+j<T+1) chmax(dq[i+j][1], dq[i][0]+pos[j]);\n }\n if(i+K<T+1) chmax(dq[i+K][0], dq[i][1]);\n }\n\n ll res = 0;\n REP(i, T+1){\n REP(j, 2){\n chmax(res, dq[i][j]);\n }\n }\n\n cout << res << endl;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":34936,"score_of_the_acc":-0.1386,"final_rank":5},{"submission_id":"aoj_3157_4835649","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define P pair<ll,ll>\n#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)\n#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)\n#define TO(x,t,f) ((x)?(t):(f))\n#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9\n#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v x is sorted\n#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v x is sorted\n#define NUM(x,v) (POSU(x,v)-POSL(x,v)) //x is sorted\n#define REV(x) (reverse(x.begin(),x.end())) //reverse\nll gcd_(ll a,ll b){if(a%b==0)return b;return gcd_(b,a%b);}\nll lcm_(ll a,ll b){ll c=gcd_(a,b);return ((a/c)*(b/c)*c);}\n#define NEXTP(x) next_permutation(x.begin(),x.end())\nconst ll INF=ll(1e16)+ll(7);\nconst ll MOD=1000000007LL;\n#define out(a) cout<<fixed<<setprecision((a))\n//tie(a,b,c) = make_tuple(10,9,87);\n#define pop_(a) __builtin_popcount((a))\nll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}\n\n\n\n\nint main(){\n\n\n\tll N,K,T;\n\tcin >> N >> K >> T;\n\tvector<ll> t(N),p(N);\n\tFOR(i,0,N) cin >> t[i] >> p[i];\n\n\tll dp[N+1][T+1] = {};\n\tFOR(i,1,N+1){\n\t\tFOR(j,0,T+1){\n\t\t\tif(j>=t[i-1]){\n\t\t\t\tdp[i][j] = max(dp[i-1][j],dp[i-1][j-t[i-1]]+p[i-1]);\n\t\t\t}else{\n\t\t\t\tdp[i][j] = dp[i-1][j];\n\t\t\t}\n\t\t}\n\t}\n\n\tt.resize(T+24);\n\tp.resize(T+14);\n\tFOR(i,0,T+1){\n\t\tt[i] = i + K;\n\t\tp[i] = dp[N][i];\n\t}\n\n\tll dp2[T+2][T+1]={};\n\tll ans = 0;\n\tFOR(i,0,T+1) dp2[0][i] = dp[N][i];\n\tFOR(i,1,T+2){\n\t\tFOR(j,0,T+1){\n\t\t\tif(j>=t[i-1]){\n\t\t\t\tdp2[i][j] = max(dp2[i-1][j],dp2[i][j-t[i-1]]+p[i-1]);\n\t\t\t}else{\n\t\t\t\tdp2[i][j] = dp2[i-1][j];\n\t\t\t}\n\t\t\tans = max(ans,dp2[i][j]);\n\t\t}\n\t}\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":65776,"score_of_the_acc":-0.3997,"final_rank":9},{"submission_id":"aoj_3157_4835620","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2020.09.13 14:31:18 */\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region aliases\n\n#define rep(i, n) for(long long i = 0; i < (n); i++)\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bcnt(n) __builtin_popcountll(n)\n#define endk endl\n#define ednl endl\n#define enld endl\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vb = vector<bool>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing mll = map<long long, long long>;\nusing pll = pair<long long, long long>;\nusing qll = queue<long long>;\nusing sll = set<long long>;\nusing vpll = vector<pair<long long, long long>>;\ntemplate <class T = ll>\nusing V = vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\n//昇順pq(小さい方から取り出す)\ntemplate <class T = ll>\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\n//降順pq(大きい方から取り出す)\ntemplate <class T = ll>\nusing pqdn = priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\nlong long const dekai = 3e16;\nconst long double pi = acos(-1);\nconst char el = '\\n';\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\n\nconst int mod = 1000000007;\n// const int mod = 998244353;\n\n#pragma endregion\n\n#pragma region basic_procedure\n\ntemplate <class T>\ninline bool isin(T x, T lef, T rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { cout << (f ? \"Yes\" : \"No\") << \"\\n\"; }\nvoid No() { cout << \"No\\n\"; }\nvoid YES(bool f = 1) { cout << (f ? \"YES\" : \"NO\") << \"\\n\"; }\nvoid NO() { cout << \"NO\\n\"; }\ntemplate <class T>\nvoid drop(T answer) {\n\tcout << answer << \"\\n\";\n\texit(0);\n}\nvoid err() {\n\tcout << -1 << \"\\n\";\n\texit(0);\n}\n\nvector<long long> vin(long long n) { //整数n個の入力を受け取ってベクトルに突っ込んで返す\n\tvector<long long> v(n);\n\tfor(long long i = 0; i < n; i++) {\n\t\tcin >> v[i];\n\t}\n\treturn v;\n}\n\n//ベクトルの出力(検証済)\n// vectorの中身を出力する 答えの出力に利用可能\ntemplate <class T>\nvoid vout(vector<T> &v, bool tate = 0) {\n\tif(v.size() > 0) {\n\t\tfor(auto it = v.begin(); it < v.end(); it++) {\n\t\t\tcout << *it;\n\t\t\tif(it != v.end() - 1) {\n\t\t\t\tif(tate)\n\t\t\t\t\tcout << endl;\n\t\t\t\telse\n\t\t\t\t\tcout << \" \";\n\t\t\t}\n\t\t}\n\t}\n\tcout << endl;\n}\n\ntemplate <class T>\nvoid add(vector<T> &v, T val) {\t //ベクトルの各要素に加算\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\n// vectorの中身を数える map<要素,個数>を返す\ntemplate <class T>\nmap<T, long long> cntv(vector<T> v) {\n\tmap<T, long long> m;\n\tfor(auto &g : v) {\n\t\tif(m.count(g))\n\t\t\tm[g]++;\n\t\telse\n\t\t\tm[g] = 1;\n\t}\n\treturn m;\n}\n\n//配列圧縮(検証済)\n//{1,36,1,3,8,-2,-92}を\n//{2, 5,2,3,4, 1, 0}にする\ntemplate <class T>\nvector<long long> press(vector<T> &v) {\n\tlong long n = v.size();\n\tvector<long long> w(n);\n\tmap<T, long long> m;\n\tfor(T &p : v) m[p] = 0;\n\tlong long i = 0;\n\tfor(auto &p : m) {\n\t\tp.second = i;\n\t\ti++;\n\t}\n\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\n\treturn w;\n}\n\ntemplate <class T>\nT divup(T a, T b) {\n\t//端数繰りあがり割り算\n\tassert(b != 0);\n\tT x = abs(a);\n\tT y = abs(b);\n\tT z = (x + y - 1) / y;\n\tif((a < 0 && b > 0) || (a > 0 && b < 0))\n\t\treturn -z;\n\telse if(a == 0)\n\t\treturn 0;\n\telse\n\t\treturn z;\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\ntemplate <class T>\nint sgn(T x) {\t//符号関数\n\tif(x < 0) return -1;\n\tif(x == 0) return 0;\n\treturn 1;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\n// a * x % mod == __gcd(a,mod)なるxを返す\n// a が modの倍数でないことが条件\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tswap(a, b);\n\t\tu -= t * v;\n\t\tswap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\nvvll comb(100, vll(100, -1));\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\n\tassert(n < 100 && k < 100);\n\tif(n < k || k < 0 || n < 0) return 0;\n\tif(comb[n][k] != -1) return comb[n][k];\n\tll res;\n\tif(n - k < k)\n\t\tres = com(n, n - k);\n\telse if(k == 0)\n\t\tres = 1;\n\telse\n\t\tres = com(n - 1, k - 1) + com(n - 1, k);\n\tcomb[n][k] = res;\n\treturn res;\n}\n\n// nCk modを求める\nconst ll MAX = 5100000;\n// この値は求める二項計数の値に応じて変える\n// MAX=3*10^7のとき1900msほど、ほぼ比例\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid cominit() {\n\t// テーブルを作る前処理\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor(ll i = 2; i < MAX; i++) {\n\t\tfac[i] = fac[i - 1] * i % mod;\n\t\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\n\t\tfinv[i] = finv[i - 1] * inv[i] % mod;\n\t}\n}\nlong long commod(ll n, ll k) {\t// 二項係数計算\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\nlong long pmod(ll n, ll k) { //順列計算\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * finv[n - k] % mod;\n}\nlong long hmod(ll n, ll k) { // nHk計算\n\t// n個の区別しないoを区別するk個の箱に入れる方法の総数\n\t//(n+k-1)C(k-1)と等しい\n\treturn commod(n + k - 1, n);\n}\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tINPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tINPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n\ntemplate <class T>\nvoid scan(T &a) {\n\tcin >> a;\n}\ntemplate <class T>\nvoid scan(vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\ntemplate <class T, class L>\nvoid scan(pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\ntemplate <class T>\ninline void print(T x) {\n\tcout << x << '\\n';\n}\n\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tcerr << \", \";\n\tview(p.second);\n\tcerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(std::set<T> &s) {\n\tif(s.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tcerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tcerr << \", \";\n\t\tview(c.second);\n\t\tcerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tcerr << \"] : \";\n\t\tview(t.second);\n\t\tcerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tview(H);\n\tcerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tcerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tview(x); \\\n\t\tcerr << \"\\n\"; \\\n\t} while(0)\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tINT(n, k, timelim);\n\ttimelim += k;\n\tvll t(n), p(n);\n\trep(i, n) cin >> t[i] >> p[i];\n\n\tvvll dp(n + 1, vll(timelim + 1, -dekai));\n\n\tdp[0][k] = 0;\n\n\trep(i, n) {\n\t\trep(j, timelim + 1) {\n\t\t\tchmax(dp[i + 1][j], dp[i][j]);\n\t\t\tif(j - t[i] >= 0) {\n\t\t\t\tchmax(dp[i + 1][j], dp[i][j - t[i]] + p[i]);\n\t\t\t}\n\t\t}\n\t}\n\n\tvll cospa(timelim + 1);\n\trep(i, timelim + 1) { cospa[i] = dp[n][i]; }\n\tdebug(dp, cospa);\n\tvvll ep(timelim + 2, vll(timelim + 1, -dekai));\n\tep[0][0] = 0;\n\trep(i, timelim + 1) {\n\t\trep(j, timelim + 1) {\n\t\t\tchmax(ep[i + 1][j], ep[i][j]);\n\t\t\tll pre = j - i;\n\t\t\tif(pre >= 0) {\n\t\t\t\tchmax(ep[i + 1][j], ep[i][pre] + cospa[i]);\n\t\t\t\tchmax(ep[i + 1][j], ep[i + 1][pre] + cospa[i]);\n\t\t\t}\n\t\t}\n\t}\n\tll maxi = -1;\n\trep(i, timelim + 2) rep(j, timelim + 1) { chmax(maxi, ep[i][j]); }\n\tdrop(maxi);\n\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":191452,"score_of_the_acc":-1.8295,"final_rank":16},{"submission_id":"aoj_3157_4834937","code_snippet":"/**\n * author: otera \n**/\n#include<iostream>\n#include<string> \n#include<cstdio>\n#include<cstring>\n#include<vector>\n#include<cmath>\n#include<algorithm> \n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<deque>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\n#define int long long\ntypedef long long ll;\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\ntypedef long double ld;\nconst int inf=1e9+7;\nconst ll INF=1LL<<60 ;\nconst ll mod=1e9+7 ;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef complex<ld> Point;\nconst ld eps = 1e-8;\nconst ld pi = acos(-1.0);\ntypedef pair<int, int> P;\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define debug(x) cerr << #x << \" = \" << (x) << endl;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nvoid solve() {\n\tint n, k, T; cin >> n >> k >> T;\n vector<int> t(n), p(n);\n rep(i, n) {\n cin >> t[i] >> p[i];\n }\n static int dp[2020][2020];\n rep(i, 2020) {\n rep(j, 2020) {\n dp[i][j] = -INF;\n }\n }\n dp[0][0] = 0;\n rep(i, n) {\n for(int j = 0; j <= T; ++ j) {\n if(j + t[i] <= T) chmax(dp[i + 1][j + t[i]], dp[i][j] + p[i]);\n chmax(dp[i + 1][j], dp[i][j]);\n }\n }\n vector<int> sdp(T + 1, 0);\n rep(i, T + 1) {\n sdp[i] = dp[n][i];\n }\n for(int i = 0; i <= T; ++ i) {\n for(int j = 1; j <= T; ++ j) {\n if(i + k + j <= T) chmax(sdp[i + k + j], sdp[i] + dp[n][j]);\n }\n }\n cout << *max_element(all(sdp)) << endl;\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//int t; cin >> t; rep(i, t)solve();\n\tsolve();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":35128,"score_of_the_acc":-0.1394,"final_rank":6},{"submission_id":"aoj_3157_4834273","code_snippet":"/**\n * @FileName\ta.cpp\n * @Author\tkanpurin\n * @Created\t2020.09.12 21:46:46\n**/\n\n#include \"bits/stdc++.h\" \nusing namespace std; \ntypedef long long ll;\n\nint main() {\n int n,k,t;cin >> n >> k >> t;\n vector<vector<ll>> dp(n+1,vector<ll>(t+1,0));\n for (int i = 0; i < n; i++) {\n int a,p;cin >> a >> p;\n for (int j = 0; j <= t; j++) {\n dp[i+1][j]=dp[i][j];\n if (j-a>=0) dp[i + 1][j] = max(dp[i+1][j],dp[i][j-a] + p);\n }\n }\n \n vector<vector<ll>> dp2(t+1,vector<ll>(t+1,0));\n for (int i = 0; i < t; i++) {\n for (int j = 0; j <= t; j++) {\n dp2[i+1][j] = dp2[i][j];\n if (j-k-i-1>=0) dp2[i + 1][j] = max(dp2[i + 1][j],dp2[i + 1][j-k-i-1] + dp[n][i+1]);\n }\n }\n ll ans = 0;\n for (int i = 0; i < t; i++) {\n ans = max(ans,dp[n][i+1]);\n }\n for (int i = 0; i <= t; i++) {\n ans = max(ans,dp2[t][i] + dp[n][t-i]);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":65672,"score_of_the_acc":-0.3993,"final_rank":8},{"submission_id":"aoj_3157_4834261","code_snippet":"/**\n * @FileName\ta.cpp\n * @Author\tkanpurin\n * @Created\t2020.09.12 21:46:46\n**/\n\n#include \"bits/stdc++.h\" \nusing namespace std; \ntypedef long long ll;\n\nint main() {\n int n,k,t;cin >> n >> k >> t;\n vector<vector<ll>> dp(n+1,vector<ll>(t+1,0));\n for (int i = 0; i < n; i++) {\n int a,p;cin >> a >> p;\n for (int j = 0; j <= t; j++) {\n dp[i+1][j]=dp[i][j];\n if (j-a>=0) dp[i + 1][j] = max(dp[i+1][j],dp[i][j-a] + p);\n }\n }\n \n vector<vector<ll>> dp2(t+1,vector<ll>(t,0));\n for (int i = 0; i < t; i++) {\n for (int j = 0; j < t; j++) {\n dp2[i+1][j] = dp2[i][j];\n if (j-k-i-1>=0) dp2[i + 1][j] = max(dp2[i + 1][j],dp2[i + 1][j-k-i-1] + dp[n][i+1]);\n }\n }\n ll ans = 0;\n for (int i = 0; i < t; i++) {\n ans = max(ans,dp[n][i+1]);\n }\n for (int i = 0; i <= t; i++) {\n ans = max(ans,dp2[t][i] + dp[n][t-i]);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":0.4,"time_ms":20,"memory_kb":65696,"score_of_the_acc":-0.3994,"final_rank":18},{"submission_id":"aoj_3157_4834123","code_snippet":"#pragma region Macros\n#pragma GCC optimize(\"O3\")\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define pb push_back\n#define eb emplace_back\n#define vi vector<int>\n#define vll vector<ll>\n#define vpi vector<pii>\n#define vpll vector<pll>\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n#define fi first\n#define se second\n#define all(c) begin(c), end(c)\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\nusing namespace std;\nstring YES[2] = {\"NO\", \"YES\"};\nstring Yes[2] = {\"No\", \"Yes\"};\nstring yes[2] = {\"no\", \"yes\"};\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n#define si(c) (int)(c).size()\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\n scan(head);\n IN(tail...);\n}\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\nvi iota(int n) {\n vi a(n);\n iota(all(a), 0);\n return a;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n sort(all(y));\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\nint popcount(ll x) { return __builtin_popcountll(x); }\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n }\n} setup_io;\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return move(res);\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return move(res);\n}\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n for(auto &e : v) cout << e << \" \";\n cout << endl;\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n cout << \"(\" << p.fi << \", \" << p.se << \")\";\n return os;\n}\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\ntemplate <class A> string to_string(A v) {\n if(v.empty()) return \"{}\";\n string ret = \"{\";\n for(auto &x : v) ret += to_string(x) + \",\";\n ret.back() = '}';\n return ret;\n}\n\nvoid dump() { cerr << endl; }\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#define endl '\\n'\n#ifdef _LOCAL\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\n#define debug(x)\n#endif\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\n#pragma endregion\nnamespace modular {\nconstexpr ll MOD = 998244353;\nconst int MAXN = 1100000;\ntemplate <ll Modulus> class modint {\n using u64 = ll;\n\n public:\n u64 a;\n\n constexpr modint(const u64 x = 0) noexcept : a(((x % Modulus) + Modulus) % Modulus) {}\n constexpr u64 &value() noexcept { return a; }\n constexpr const u64 &value() const noexcept { return a; }\n constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; }\n constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; }\n constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; }\n template <typename T> constexpr modint operator^(T rhs) const noexcept { return modint(*this) ^= rhs; }\n constexpr modint operator-() const noexcept { return modint() - *this; }\n constexpr modint &operator+=(const modint rhs) noexcept {\n a += rhs.a;\n if(a >= Modulus) { a -= Modulus; }\n return *this;\n }\n constexpr modint &operator-=(const modint rhs) noexcept {\n if(a < rhs.a) { a += Modulus; }\n a -= rhs.a;\n return *this;\n }\n constexpr modint &operator*=(const modint rhs) noexcept {\n a = a * rhs.a % Modulus;\n return *this;\n }\n constexpr bool operator==(const modint rhs) const noexcept { return a == rhs.a; }\n template <typename T> constexpr modint &operator^=(T n) noexcept {\n modint<Modulus> res = 1;\n modint<Modulus> x = a;\n while(n) {\n if(n & 1) res *= x;\n x *= x;\n n >>= 1;\n }\n a = res.a;\n return *this;\n }\n};\n#define mint modint<MOD>\n#define vmint vector<mint>\nvmint Inv{0, 1}, Prd{1, 1}, Invprd{1, 1};\nmint inv(int n) {\n if(n > MAXN) return mint(n) ^ (MOD - 2);\n if(Inv.size() > n)\n return Inv[n];\n else {\n for(int i = Inv.size(); i <= n; ++i) Inv.emplace_back(Inv[MOD % i] * (-MOD / i));\n return Inv[n];\n }\n}\nmint inv(mint x) { return inv(x.a); }\nmint prd(int n) {\n if(Prd.size() > n)\n return Prd[n];\n else\n for(int i = Prd.size(); i <= n; ++i) Prd.emplace_back(Prd[i - 1] * i);\n return Prd[n];\n}\nmint invprd(int n) {\n if(Invprd.size() > n)\n return Invprd[n];\n else\n for(int i = Invprd.size(); i <= n; ++i) Invprd.emplace_back(Invprd[i - 1] * inv(i));\n return Invprd[n];\n}\nmint modpow(ll a, ll n) {\n mint x = a;\n return x ^= n;\n}\nmint operator/(mint l, mint r) { return l * inv(r); }\nmint &operator/=(mint &l, mint r) { return l = l / r; }\nmint C(int a, int b) {\n if(a < 0 || b < 0) return 0;\n if(a < b) return 0;\n return prd(a) * invprd(b) * invprd(a - b);\n}\nmint P(int a, int b) {\n if(a < 0 || b < 0) return 0;\n if(a < b) return 0;\n return prd(a) * invprd(a - b);\n}\nostream &operator<<(ostream &os, mint a) {\n os << a.a;\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> a) {\n for(auto &e : a) os << e << \" \";\n return os;\n}\nmint operator*(ll x, mint y) { return y * x; }\nistream &operator>>(istream &is, mint &a) {\n ll x;\n is >> x;\n a = x;\n return is;\n}\nmint proot = 3;\n\nvoid FMT(vmint &f, const bool is_inv = false) {\n const int n = f.size();\n const mint root = is_inv ? inv(proot) : proot;\n vmint g(n);\n for(int b = n >> 1; b > 0; b >>= 1) {\n mint a = root ^ ((MOD - 1) / (n / b)), p = 1;\n for(int i = 0; i < n; i += b << 1) {\n rep(j, b) {\n f[i + j + b] *= p;\n g[(i >> 1) + j] = f[i + j] + f[i + b + j];\n g[(n >> 1) + (i >> 1) + j] = f[i + j] - f[i + b + j];\n }\n p *= a;\n }\n swap(f, g);\n }\n if(is_inv) rep(i, n) f[i] *= inv(n);\n}\n\nvmint mul(vmint x, const vmint &y) {\n int n = x.size() + y.size() - 1;\n int s = 1;\n while(s < n) s <<= 1;\n x.resize(s);\n FMT(x);\n vmint z(s);\n rep(i, y.size()) z[i] = y[i];\n FMT(z);\n rep(i, s) x[i] *= z[i];\n FMT(x, true);\n x.resize(n);\n return x;\n}\n\nusing Poly = vmint;\nPoly operator-(Poly f) {\n for(auto &&e : f) e = -e;\n return f;\n}\nPoly &operator+=(Poly &l, const Poly &r) {\n l.resize(max(l.size(), r.size()));\n rep(i, r.size()) l[i] += r[i];\n return l;\n}\nPoly operator+(Poly l, const Poly &r) { return l += r; }\nPoly &operator-=(Poly &l, const Poly &r) {\n l.resize(max(l.size(), r.size()));\n rep(i, r.size()) l[i] -= r[i];\n return l;\n}\nPoly operator-(Poly l, const Poly &r) { return l -= r; }\nPoly &operator<<=(Poly &f, size_t n) { return f.insert(f.begin(), n, 0), f; }\nPoly operator<<(Poly f, size_t n) { return f <<= n; }\nPoly &operator>>=(Poly &f, size_t n) { return f.erase(f.begin(), f.begin() + min(f.size(), n)), f; }\nPoly operator>>(Poly f, size_t n) { return f >>= n; }\nPoly operator*(const Poly &l, const Poly &r) { return mul(l, r); }\nPoly &operator*=(Poly &l, const Poly &r) { return l = l * r; }\nPoly inv(const Poly &f) {\n Poly g{1 / f[0]};\n while(g.size() < f.size()) {\n Poly x(f.begin(), f.begin() + min(f.size(), g.size() << 1)), y = g;\n x.resize(g.size() << 1), FMT(x);\n y.resize(g.size() << 1), FMT(y);\n rep(i, x.size()) x[i] *= y[i];\n FMT(x, true);\n x >>= g.size();\n x.resize(g.size() << 1), FMT(x);\n rep(i, x.size()) x[i] *= -y[i];\n FMT(x, true);\n g.insert(g.end(), x.begin(), x.begin() + g.size());\n }\n return Poly{begin(g), begin(g) + f.size()};\n}\nPoly integ(const Poly &f) {\n Poly res(f.size() + 1);\n for(int i = 1; i < (int)res.size(); ++i) res[i] = f[i - 1] / i;\n return res;\n}\nPoly deriv(const Poly &f) {\n if(f.size() == 0) return Poly();\n Poly res(f.size() - 1);\n rep(i, res.size()) res[i] = f[i + 1] * (i + 1);\n return res;\n}\nPoly log(const Poly &f) {\n Poly g = integ(inv(f) * deriv(f));\n return Poly{g.begin(), g.begin() + f.size()};\n}\nPoly exp(const Poly &f) {\n Poly g{1};\n while(g.size() < f.size()) {\n Poly x(f.begin(), f.begin() + min(f.size(), g.size() * 2));\n x[0] += 1;\n g.resize(2 * g.size());\n x -= log(g);\n x *= {g.begin(), g.begin() + g.size() / 2};\n rep2(i, g.size() / 2, min<int>(x.size(), g.size()) - 1) g[i] = x[i];\n }\n return {g.begin(), g.begin() + f.size()};\n}\n\n} // namespace modular\nusing namespace modular;\nint main() {\n INT(n, k, t);\n constexpr int N = 2001;\n vv(int, v, N);\n rep(i, n) {\n INT(a, b);\n v[a].eb(b);\n }\n vv(pii, w, N);\n rep(i, N) {\n if(empty(v[i])) continue;\n sort(all(v[i]), greater<>());\n rep(j, si(v[i])) { rep(K, t / i / (j + 1)) w[K].eb(i, v[i][j]); }\n }\n vll dp(t + 1);\n ll ans = 0;\n rep(i, t / k + 1) {\n for(auto [W, V] : w[i]) { rep3(j, t, W) chmax(dp[j], dp[j - W] + V); }\n chmax(ans, dp[t - i * k]);\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3932,"score_of_the_acc":-0.1267,"final_rank":2},{"submission_id":"aoj_3157_4834076","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <utility>\n#include <set>\n#include <map>\n#include <cmath>\n#include <queue>\n#include <cstdio>\n#include <limits>\n#define rep(i,n) for(int i = 0; i < n; ++i)\n#define rep1(i,n) for(int i = 1; i <= n; ++i)\nusing namespace std;\ntemplate<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }\nusing ll = long long; using ld = long double;\nusing pi = pair<int,int>; using pl = pair<ll,ll>;\nusing vi = vector<int>; using vii = vector<vi>;\nusing vl = vector<ll>; using vll = vector<vl>;\nconst int inf = numeric_limits<int>::max();\nconst ll infll = numeric_limits<ll>::max();\nint main()\n{\n ll n,k,t; scanf(\"%lld %lld %lld\", &n, &k, &t);\n vector<ll> a(n), b(n);\n rep(i,n) {\n scanf(\"%lld %lld\", &a[i], &b[i]);\t\n }\n\n vl dp(t+1, 0);\n rep(i,n) {\n vl ndp(t+1, 0);\n rep(j,t+1) {\n if(j - a[i] >= 0) chmax(ndp[j], max(dp[j], dp[j - a[i]] + b[i]));\n else chmax(ndp[j], dp[j]);\n }\n dp = ndp;\n }\n\n vl dp2(t+k+1, 0);\n rep(i,t+1) {\n rep(j,t+k+1) {\n if(j - (i + k) >= 0) chmax(dp2[j], dp2[j - (i+k)] + dp[i]);\n }\n }\n cout << dp2[t+k] << \"\\n\";\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3544,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_3157_4833979","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <tuple>\n#include <algorithm>\n\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n\nvoid chmax(int64_t &a, int64_t b) {\n if (a < b) {\n a = b;\n }\n}\n\nint main() {\n int n, K, T;\n cin >> n >> K >> T;\n vector<pair<int, int64_t>> tp(n);\n for (auto &e: tp) {\n cin >> e.first >> e.second;\n }\n// sort(tp.begin(), tp.end(), [](const auto &lhs, const auto &rhs) {\n// // return lhs.second / lhs.first > rhs.second / rhs.first;\n// return lhs.second * rhs.first > rhs.second * lhs.first;\n// });\n vector<vector<int64_t>> dp(T + 1, vector<int64_t>(n + 1, -1));\n dp[0][0] = 0;\n rep(t, T) {\n rep(i, n + 1) {\n if (dp[t][i] < 0) continue;\n if (i + 1 <= n) { // i < n\n chmax(dp[t][i + 1], dp[t][i]);\n int ti;\n int64_t pi;\n tie(ti, pi) = tp[i];\n if (t + ti <= T) {\n chmax(dp[t + ti][i + 1], dp[t][i] + pi);\n }\n }\n if (t + K <= T) {\n chmax(dp[t + K][0], dp[t][i]);\n }\n }\n }\n int64_t ans = 0;\n for (int t = 0; t <= T; t++) {\n for (int i = 0; i <= n; i++) {\n chmax(ans, dp[t][i]);\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":34280,"score_of_the_acc":-0.6357,"final_rank":14},{"submission_id":"aoj_3157_4833798","code_snippet":"// I SELL YOU...! \n#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<functional>\n#include<queue>\n#include<chrono>\n#include<iomanip>\n#include<map>\n#include<set>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll,ll>;\nusing TP = tuple<ll,ll,ll>;\nvoid init_io(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(18);\n}\nsigned main(){\n init_io();\n ll n,k,T,ans=0;\n cin >> n >> k >> T;\n vector<ll> t(n),p(n);\n vector<vector<ll>> dp(n+1,vector<ll>(T+1,-1e15));\n vector<vector<ll>> dpx(T+1,vector<ll>(T+1,0));\n for(int i=0;i<n;i++){\n cin >> t[i] >> p[i];\n }\n for(int i=0;i<=T;i++){\n dp[0][i] = 0;\n }\n for(int i=0;i<n;i++){\n for(int j=0;j<=T;j++){\n dp[i+1][j] = max(dp[i][j],dp[i+1][j]);\n if(j+t[i]<=T){\n dp[i+1][j+t[i]] = max(dp[i+1][j+t[i]],dp[i][j]+p[i]);\n }\n }\n }\n ans = dp[n][T];\n for(int i=0;i<=T;i++){\n dpx[0][i] = dp[n][i];\n }\n for(int i=1;i<=T;i++){\n for(int j=0;j<=T;j++){\n ll w = i+k;\n ll v = dp[n][i];\n ll x=0;\n if(j-w>=0){\n x = dpx[i][j-w]+v;\n }\n dpx[i][j] = max(dpx[i-1][j],x);\n ans = max(ans,dpx[i][j]);\n }\n }\n for(int i=0;i<=T;i++){\n ans = max(ans,dpx[T][i]);\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":65904,"score_of_the_acc":-0.5253,"final_rank":13},{"submission_id":"aoj_3157_4833785","code_snippet":"// I SELL YOU...! \n#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<functional>\n#include<queue>\n#include<chrono>\n#include<iomanip>\n#include<map>\n#include<set>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll,ll>;\nusing TP = tuple<ll,ll,ll>;\nvoid init_io(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(18);\n}\nsigned main(){\n init_io();\n ll n,k,T,ans=0,c=13; cin >> n >> k >> T;\n vector<ll> t(n),p(n);\n vector<vector<ll>> dp(n+1,vector<ll>(T+1,-1e15));\n vector<vector<ll>> dpx(T+1,vector<ll>(T+1,0));\n for(int i=0;i<n;i++){\n cin >> t[i] >> p[i];\n }\n for(int i=0;i<=T;i++){\n dp[0][i] = 0;\n }\n for(int i=0;i<n;i++){\n for(int j=0;j<=T;j++){\n dp[i+1][j] = max(dp[i][j],dp[i+1][j]);\n if(j+t[i]<=T){\n dp[i+1][j+t[i]] = max(dp[i+1][j+t[i]],dp[i][j]+p[i]);\n }\n }\n }\n ans = dp[n][T];\n for(int i=0;i<=T;i++){\n dpx[0][i] = dp[n][i];\n }\n for(int i=1;i<=T;i++){\n for(int j=0;j<=T;j++){\n ll w = i+k;\n ll v = dp[n][i];\n if(j-w<0) continue;\n dpx[i][j] = max(dpx[i-1][j],dpx[i][j-w]+v);\n ans = max(ans,dpx[i][j]);\n }\n }\n cout << ans << endl;\n}","accuracy":0.05714285714285714,"time_ms":20,"memory_kb":49160,"score_of_the_acc":-0.3264,"final_rank":20},{"submission_id":"aoj_3157_4833547","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <tuple>\n#include <algorithm>\n\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n\nvoid chmax(int64_t &a, int64_t b) {\n if (a < b) {\n a = b;\n }\n}\n\nint main() {\n int n, K, T;\n cin >> n >> K >> T;\n vector<pair<int, int64_t>> tp(n);\n for (auto &e: tp) {\n cin >> e.first >> e.second;\n }\n sort(tp.begin(), tp.end(), [](const auto &lhs, const auto &rhs) {\n // return lhs.second / lhs.first > rhs.second / rhs.first;\n return lhs.second * rhs.first > rhs.second * lhs.first;\n });\n vector<vector<int64_t>> dp(T + 1, vector<int64_t>(n + 1, -1));\n dp[0][0] = 0;\n rep(t, T) {\n rep(i, n + 1) {\n if (dp[t][i] < 0) continue;\n if (i + 1 <= n) { // i < n\n chmax(dp[t][i + 1], dp[t][i]);\n int ti;\n int64_t pi;\n tie(ti, pi) = tp[i];\n if (t + ti <= T) {\n chmax(dp[t + ti][i + 1], dp[t][i] + pi);\n }\n }\n if (t + K <= T) {\n chmax(dp[t + K][0], dp[t][i]);\n }\n }\n }\n int64_t ans = 0;\n for (int t = 0; t <= T; t++) {\n for (int i = 0; i <= n; i++) {\n chmax(ans, dp[t][i]);\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":34280,"score_of_the_acc":-0.5107,"final_rank":11},{"submission_id":"aoj_3157_4833532","code_snippet":"//include\n//------------------------------------------\n#include <bits/stdc++.h>\nusing namespace std;\n\n//typedef\n//------------------------------------------\nusing LL = int64_t;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing PLL = pair<LL, LL>;\n\n//container util\n//------------------------------------------\n#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)\n#define rwhole(f,x,...) ([&](decltype((x)) whole) { return (f)(rbegin(whole), rend(whole), ## __VA_ARGS__); })(x)\n#define EACH(i,c) for(decltype((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define ALL(x) ::std::begin(x), ::std::end(x)\n#define RALL(x) ::std::rbegin(x), ::std::rend(x)\n#define SORT(c) whole(sort, c)\n#define RSORT(c) rwhole(sort, c)\n\n//constant\n//--------------------------------------------\nconstexpr double EPS = 1e-10;\nconstexpr double PI = 3.14159265358979323846;\nconstexpr int MOD = 1000000007;\n\n// grid\n//--------------------------------------------\nVL dx = {0, 1, 0, -1};\nVL dy = {1, 0, -1, 0};\nVL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};\nVL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};\n\n//debug\n//--------------------------------------------\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n\n//IO accelerate\n//--------------------------------------------\nstruct InitIO {\n InitIO() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(30);\n }\n} init_io;\n\n//template\n//--------------------------------------------\n// declaretion\ntemplate<typename T> istream& operator >>(istream& is, vector<T>& vec);\ntemplate<typename T1, typename T2> ostream& operator <<(ostream& os, const pair<T1, T2>& p);\ntemplate<typename T> ostream& operator <<(ostream& os, const vector<T>& vec);\ntemplate<typename T> ostream& operator <<(ostream& os, const vector<vector<T>>& vv);\ntemplate<typename T> vector<T> make_v(size_t a);\ntemplate<typename T,typename... Ts> auto make_v(size_t a,Ts... ts);\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v);\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v);\n\n// implementation\ntemplate<typename T>\nistream& operator >>(istream& is, vector<T>& vec) {\n\tfor(T& x: vec) is >> x;\n\treturn is;\n}\ntemplate<typename T1, typename T2>\nostream& operator <<(ostream& os, const pair<T1, T2>& p) {\n\tos << p.first << \",\" << p.second;\n\treturn os;\n}\ntemplate<typename T>\nostream& operator <<(ostream& os, const vector<T>& vec) {\n\tfor(int i=0; i<vec.size(); i++){\n\t\tos << vec[i] << ( i+1 == vec.size() ? \"\" : \"\\t\" );\n\t}\n\treturn os;\n}\ntemplate<typename T>\nostream& operator <<(ostream& s, const vector<vector<T>>& vv) {\n\tfor (int i = 0; i < vv.size(); ++i) {\n\t\ts << vv[i] << endl;\n\t}\n\treturn s;\n}\n\n// 多重vector\n// auto dp=make_v<int>(4,h,w) みたいに使える\ntemplate<typename T>\nvector<T> make_v(size_t a){return vector<T>(a);}\n\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts){\n\treturn vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\n\n// 多重vectorのためのfill\n// fill_v(dp,0) みたいに使える\ntemplate<typename T,typename V>\ntypename enable_if<is_class<T>::value==0>::type\nfill_v(T &t,const V &v){t=v;}\n\ntemplate<typename T,typename V>\ntypename enable_if<is_class<T>::value!=0>::type\nfill_v(T &t,const V &v){\n\tfor(auto &e:t) fill_v(e,v);\n}\n\ntemplate<class T,class U> void chmax(T&a,U b){if(a<b)a=b;}\ntemplate<class T,class U> void chmin(T&a,U b){if(b<a)a=b;}\ntemplate<typename T> T gcd(T a, T b) { return b?gcd(b,a%b):a;}\ntemplate<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b;}\n\nLL N,K,T;\n\n//main code\nint main(int argc, char *argv[])\n{\n\tcin >> N >> K >> T;\n VL t(N), p(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> t[i] >> p[i];\n\t}\n\tVVL dp(N,VL(T+1,0));\n\tfor (int i = t[0]; i < T+1; i++) {\n\t\tdp[0][i] = p[0];\n\t}\n\tfor (int i = 1; i < N; i++) {\n\t\tfor (int j = 0; j < T+1; j++) {\n\t\t\tif (j < t[i]) {\n\t\t\t\tdp[i][j] = dp[i-1][j];\n\t\t\t} else {\n\t\t\t\tdp[i][j] = max(dp[i-1][j-t[i]] + p[i], dp[i-1][j]);\n\t\t\t}\n\t\t}\n\t}\n\n VVL dp2(5000, VL(5000, 0));\n for(int i = 0; i <= T; i++) {\n for(int j = 0; j <= T; j++) {\n chmax(dp2[i+1][j], dp2[i][j]);\n if(i > j) chmax(dp2[i+K+1][i+K], dp2[i][j] + dp[N-1][i-j]);\n }\n } \n\t//dump(dp);\n\t//LL ans = dp[N-1][T];\n /*\n\tfor (int i = 1; i < T+1; i++) {\n\t\tif (dp[N-1][i] > dp[N-1][i-1]) { // iを区切りにやる\n\t\t\tLL tt = (K + i);\n\t\t\tLL d = T / tt;\n\t\t\tfor (LL j = 1; j < d+1; j++) { // j回休憩する((i,k)の組み合わせがj回)\n\t\t\t\tLL tmp = j*dp[N-1][i];\n\t\t\t\tLL nokori = T - (i+K)*j;\n\t\t\t\ttmp += dp[N-1][nokori];\n\t\t\t\tchmax(ans, tmp);\n\t\t\t}\n\t\t}\n\t}\n */\n LL ans = 0;\n for(int i = 0; i < 5000; i++) {\n for(int j = 0; j < 5000; j++) ans = max(ans, dp2[i][j]);\n }\n\tcout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":230076,"score_of_the_acc":-2,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_3157_7073173\",\n \"code_snippet\": \"#include <iostream>\\n#include <string.h>\\nusing namespace std;\\nlong long int dp[2002][2002];\\nlong long int ts[2001];\\nlong long int ps[2001];\\n\\nint t;\\nvoid f(int t2,int p2,long long int s2){\\n\\tif(t2>t)return ;\\n\\tif(dp[t2][p2]<s2)dp[t2][p2]=s2;\\n}\\n\\n\\nint main() {\\n\\tmemset(dp,-1,sizeof(dp));\\n\\tdp[0][0]=0;\\n\\tint n,k;\\n\\tcin>>n>>k>>t;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tcin>>ts[i]>>ps[i];\\n\\t}\\n\\tlong long int ans=0;\\n\\tfor(int t2=0;t2<=t;t2++){\\n\\t\\tfor(int p2=0;p2<=n;p2++){\\n\\t\\t\\tlong long int s2=dp[t2][p2];\\n\\t\\t\\tif(s2==-1)continue;\\n\\t\\t\\tif(ans<s2)ans=s2;\\n\\t\\t\\tif(p2==n){\\n\\t\\t\\t\\tf(t2+k,0,s2);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tf(t2,p2+1,s2);\\n\\t\\t\\t\\tf(t2+ts[p2],p2+1,s2+ps[p2]);\\n\\t\\t\\t\\tf(t2+k,0,s2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 34456,\n \"score_of_the_acc\": -0.5115,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3157_4947204\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 2005\\n\\nstruct Info{\\n\\n\\tll need_time,value;\\n};\\n\\nll N,K,T;\\nInfo info[SIZE];\\nll dp1[SIZE][SIZE],dp2[SIZE];\\n\\nint main(){\\n\\n\\tscanf(\\\"%lld %lld %lld\\\",&N,&K,&T);\\n\\n\\tfor(ll i = 1; i <= N; i++){\\n\\n\\t\\tscanf(\\\"%lld %lld\\\",&info[i].need_time,&info[i].value);\\n\\t}\\n\\n\\tfor(ll i = 0; i <= N; i++){\\n\\t\\tfor(ll k = 0; k <= T; k++){\\n\\t\\t\\tdp1[i][k] = -BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tdp1[0][0] = 0;\\n\\tfor(ll i = 1; i <= N; i++){\\n\\t\\tfor(ll k = 0; k <= T; k++){\\n\\t\\t\\tif(dp1[i-1][k] == -BIG_NUM)continue;\\n\\n\\t\\t\\t//足さない\\n\\t\\t\\tdp1[i][k] = max(dp1[i][k],dp1[i-1][k]);\\n\\n\\t\\t\\tif(k+info[i].need_time > T)continue;\\n\\n\\t\\t\\t//足す\\n\\t\\t\\tdp1[i][k+info[i].need_time] = max(dp1[i][k+info[i].need_time],dp1[i-1][k]+info[i].value);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(ll k = 0; k <= T; k++){\\n\\n\\t\\tdp2[k] = dp1[N][k];\\n\\t}\\n\\tdp2[0] = 0;\\n\\n\\tfor(ll t = 1; t <= T; t++){\\n\\t\\tfor(ll p = 0; p+(t+K) <= T; p++){\\n\\t\\t\\tif(dp2[p] == -BIG_NUM)continue;\\n\\n\\t\\t\\tdp2[p+(t+K)] = max(dp2[p+(t+K)],dp2[p]+dp1[N][t]);\\n\\t\\t}\\n\\t}\\n\\n\\tll ans = 0;\\n\\n\\tfor(ll k = 0; k <= T; k++){\\n\\n\\t\\tans = max(ans,dp2[k]);\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 34624,\n \"score_of_the_acc\": -0.1372,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3157_4844233\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <array>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <cmath>\\n#include <functional>\\n#include <cassert>\\n#include <iomanip>\\n#define vll vector<ll>\\n#define vvvl vector<vvl>\\n#define vvl vector<vector<ll>>\\n#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))\\n#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));\\n#define re(c, b) for(ll c=0;c<b;c++)\\n#define all(obj) (obj).begin(), (obj).end()\\ntypedef long long int ll;\\ntypedef long double ld;\\nusing namespace std;\\n\\nint main(){\\n ll INF = 1000000000000000000;\\n ll n, k, t;scanf(\\\"%lld %lld %lld\\\", &n, &k, &t);\\n vvl DP = VV(n+1, t+1, -INF, ll);\\n DP[0][0] = 0;\\n vvl dat = VV(n, 2, 0, ll);\\n for(ll i=0;i<n;i++) scanf(\\\"%lld %lld\\\", &dat[i][0], &dat[i][1]);\\n for(ll i=0;i<n;i++){\\n for(ll j=0;j<=t;j++){\\n DP[i+1][j] = max(DP[i+1][j], DP[i][j]);\\n if(j + dat[i][0]<=t) DP[i+1][j+dat[i][0]] = max(DP[i+1][j+dat[i][0]], DP[i][j]+dat[i][1]);\\n }\\n }\\n vll te = DP[n];//時間あたりの効率\\n for(ll i=1;i<=t;i++) te[i] = max(te[i], te[i-1]);//メインの周期\\n ll ans = 0;\\n\\n vvl dp = VV(t+n+2, t+1, -INF, ll);// 物0~T-1は重複可能\\n dp[0][0] = 0;\\n\\n for(ll i=0;i<t+n+1;i++){\\n if(i<=t){\\n for(ll j=0;j<=t;j++){\\n dp[i+1][j] = max(dp[i+1][j], dp[i][j]);\\n if(j+i+k<=t) dp[i+1][j+i+k] = max({dp[i+1][j+i+k], dp[i][j]+te[i], dp[i+1][j]+te[i]});\\n }\\n }else{\\n ll idx = i - t - 1;\\n ll w = dat[idx][0], v = dat[idx][1];\\n for(ll j=0;j<=t;j++){\\n dp[i+1][j] = max(dp[i+1][j], dp[i][j]);\\n if(j+w<=t) dp[i+1][j+w] = max(dp[i+1][j+w], dp[i][j] + v);\\n }\\n }\\n }\\n for(int i=0;i<=t;i++) ans = max(ans, dp[n+t+1][i]);\\n std::cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 97316,\n \"score_of_the_acc\": -0.7889,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3157_4840893\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n//----------------------- Print Function ----------------------//\\n\\ninline void print() {\\n cout << '\\\\n';\\n}\\ntemplate <typename First, typename... Rest>\\nvoid print(const First &first, const Rest &... rest) {\\n cout << first << ' ';\\n print(rest...);\\n}\\n\\ntemplate <typename T>\\nvoid print(const T &a) {\\n for (auto e : a) cout << e << ' ';\\n cout << '\\\\n';\\n}\\n\\n//------------------------- Libraries -------------------------//\\n\\ntemplate<class T>\\nbool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n//--------------------------- Solve ---------------------------//\\n\\nlong long dp1[2005][2005];\\nlong long dp2[2005][2005];\\n\\nvoid solve() {\\n int N, K, T; cin >> N >> K >> T;\\n vector<long long> t(N+1), p(N+1);\\n for (int i = 1; i <= N; i++) cin >> t[i] >> p[i];\\n\\n for (int i = 1; i <= N; i++) {\\n for (int j = 0; j <= T; j++) {\\n chmax(dp1[i][j], dp1[i-1][j]);\\n if (j - t[i] >= 0) chmax(dp1[i][j], dp1[i-1][j-t[i]] + p[i]);\\n }\\n }\\n\\n for (int i = 0; i <= T; i++) {\\n dp2[0][i] = dp1[N][i];\\n }\\n for (int i = 1; i <= T; i++) {\\n for (int j = 0; j <= T; j++) {\\n chmax(dp2[i][j], dp2[i-1][j]);\\n if (j-(i+K) >= 0) chmax(dp2[i][j], dp2[i][j-(i+K)] + dp1[N][i]);\\n }\\n }\\n\\n cout << dp2[T][T] << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 66220,\n \"score_of_the_acc\": -0.2767,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3157_4840791\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\nusing ll = long long;\\nusing P = pair<ll, ll>;\\nconst long double PI = acos(-1.0L);\\nll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }\\nll LCM(ll a, ll b) { return a/GCD(a, b)*b; }\\n\\nll n, k, t;\\nll dp[2020][2020];\\nll dp2[2020][2020];\\n\\nint main() {\\n cin >> n >> k >> t;\\n vector<ll> tvec(n, 0);\\n vector<ll> pvec(n, 0);\\n for(int i = 0; i < n; ++i) cin >> tvec[i] >> pvec[i];\\n\\n memset(dp, 0, sizeof(dp));\\n memset(dp2, 0, sizeof(dp2));\\n\\n for(int i = 0; i < n; ++i) {\\n for(int j = 0; j <= t; ++j) {\\n chmax(dp[i+1][j], dp[i][j]);\\n if(j-tvec[i] >= 0) {\\n chmax(dp[i+1][j], dp[i][j-tvec[i]]+pvec[i]);\\n }\\n }\\n }\\n\\n for(int i = 0; i <= t; ++i) dp2[0][i] = dp[n][i];\\n\\n vector<ll> wvec(t+1, 0);\\n for(int i = 0; i <= t; ++i) wvec[i] = i+k;\\n\\n for(int i = 1; i <= t; ++i) {\\n for(int j = 1; j <= t; ++j) {\\n chmax(dp2[i][j], dp2[i-1][j]);\\n if(j-wvec[i] >= 0) {\\n chmax(dp2[i][j], dp2[i][j-wvec[i]]+dp[n][i]);\\n }\\n }\\n }\\n\\n ll ans = 0;\\n for(int i = 0; i <= t; ++i) chmax(ans, dp2[t][i]);\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 66932,\n \"score_of_the_acc\": -0.4048,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3157_4840784\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\nusing ll = long long;\\nusing P = pair<ll, ll>;\\nconst long double PI = acos(-1.0L);\\nll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }\\nll LCM(ll a, ll b) { return a/GCD(a, b)*b; }\\n\\nll n, k, t;\\nll dp[2020][2020];\\nll dp2[2020][2020];\\n\\nint main() {\\n cin >> n >> k >> t;\\n vector<ll> tvec(n, 0);\\n vector<ll> pvec(n, 0);\\n for(int i = 0; i < n; ++i) cin >> tvec[i] >> pvec[i];\\n\\n memset(dp, 0, sizeof(dp));\\n memset(dp2, 0, sizeof(dp2));\\n\\n for(int i = 0; i < n; ++i) {\\n for(int j = 0; j <= t; ++j) {\\n chmax(dp[i+1][j], dp[i][j]);\\n if(j-tvec[i] >= 0) {\\n chmax(dp[i+1][j], dp[i][j-tvec[i]]+pvec[i]);\\n }\\n }\\n }\\n\\n for(int i = 0; i <= t; ++i) dp2[0][i] = dp[n][i];\\n\\n vector<ll> wvec(t, 0);\\n for(int i = 0; i <= t; ++i) wvec[i] = i+k;\\n\\n for(int i = 1; i <= t; ++i) {\\n for(int j = 1; j <= t; ++j) {\\n chmax(dp2[i][j], dp2[i-1][j]);\\n if(j-wvec[i] >= 0) {\\n chmax(dp2[i][j], dp2[i][j-wvec[i]]+dp[n][i]);\\n }\\n }\\n }\\n\\n ll ans = 0;\\n for(int i = 0; i <= t; ++i) chmax(ans, dp2[t][i]);\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 20,\n \"memory_kb\": 66900,\n \"score_of_the_acc\": -0.4047,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3157_4840092\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];\\n#define ft first\\n#define sc second\\n#define pb push_back\\n#define lb lower_bound\\n#define ub upper_bound\\n#define all(v) (v).begin(),(v).end()\\n#define LB(a,x) lb(all(a),x)-a.begin()\\n#define UB(a,x) ub(all(a),x)-a.begin()\\n#define mod 1000000007\\n//#define mod 998244353\\n#define FS fixed<<setprecision(15)\\nusing namespace std;\\ntypedef long long ll;\\nconst double pi=3.141592653589793;\\ntemplate<class T> using V=vector<T>;\\nusing Graph = vector<vector<int>>;\\nusing P=pair<ll,ll>;\\ntypedef unsigned long long ull;\\ntypedef long double ldouble;\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> inline void out(T a){ cout << a << '\\\\n'; }\\nvoid YN(bool ok){if(ok) cout << \\\"Yes\\\" << endl; else cout << \\\"No\\\" << endl;}\\n//void YN(bool ok){if(ok) cout << \\\"YES\\\" << endl; else cout << \\\"NO\\\" << endl;}\\n\\n\\nconst ll INF=1e18;\\nconst int mx=200005;\\n//wupc\\n\\nll dp1[2005][2005],dp2[2005];\\n\\nint main(){\\n cin.tie(0);ios::sync_with_stdio(false);\\n ll n,k,T;\\n cin>>n>>k>>T;\\n V<ll> t(n),p(n);\\n rep(i,n) cin>>t[i]>>p[i];\\n rep(i,n){\\n for(int j=0;j<=T;j++){\\n chmax(dp1[i+1][j],dp1[i][j]);\\n if(j-t[i]>=0) chmax(dp1[i+1][j],dp1[i][j-t[i]]+p[i]);\\n }\\n }\\n V<ll> tt(T+1),q(T+1);\\n for(int i=0;i<=T;i++){\\n tt[i]=i+k;\\n q[i]=dp1[n][i];\\n }\\n for(int i=0;i<=T;i++) dp2[i]=dp1[n][i];\\n rep(j,T+1){\\n rep(i,T+1){\\n if(j+tt[i]<=T) chmax(dp2[j+tt[i]],dp2[j]+q[i]);\\n }\\n }\\n ll ans=0;\\n for(int i=0;i<=T;i++) chmax(ans,dp2[i]);\\n out(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 34596,\n \"score_of_the_acc\": -0.1371,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3157_4836623\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i,n) for(ll i=0;i<(ll)n;i++)\\n#define dump(x) cerr << \\\"Line \\\" << __LINE__ << \\\": \\\" << #x << \\\" = \\\" << (x) << \\\"\\\\n\\\";\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n\\nusing ld = long double;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pdd = pair<ld, ld>;\\n\\ntemplate<typename T> using V = vector<T>;\\ntemplate<typename T> using P = pair<T, T>;\\ntemplate<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }\\ntemplate<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }\\ntemplate<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << \\\"(\\\" << v.first << \\\", \\\" << v.second << \\\")\\\"; return os;}\\ntemplate<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }\\ntemplate<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << \\\"\\\\n\\\";} return os;}\\nstruct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;\\n\\ntemplate <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\nvoid fail() { cout << -1 << '\\\\n'; exit(0); }\\ninline int popcount(const int x) { return __builtin_popcount(x); }\\ninline int popcount(const ll x) { return __builtin_popcountll(x); }\\ntemplate<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)\\n{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<\\\"\\\\n\\\";}};\\ntemplate<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];\\nfor(ll i=1;i<n;i++)cerr spa v[i];\\ncerr<<\\\"\\\\n\\\";};\\n\\nconst ll INF = (1ll<<62);\\n// const ld EPS = 1e-10;\\n// const ld PI = acos(-1.0);\\nconst ll mod = (int)1e9 + 7;\\n//const ll mod = 998244353;\\n\\nint main(){\\n\\n ll N, K, T;\\n cin >> N >> K >> T;\\n V<ll> t(N), p(N);\\n REP(i, N) cin >> t[i] >> p[i];\\n\\n V<V<ll>> dp(N+1, V<ll>(T+1, -1));\\n dp[0][0] = 0;\\n REP(i, N){\\n REP(j, T+1){\\n if(dp[i][j]!=-1){\\n chmax(dp[i+1][j], dp[i][j]);\\n if(j+t[i]<T+1)chmax(dp[i+1][j+t[i]], dp[i][j]+p[i]);\\n }\\n }\\n }\\n\\n V<ll> pos(T+1, 0);\\n REP(i, T+1) pos[i] = dp[N][i];\\n\\n V<V<ll>> dq(T+1, V<ll>(2, -INF));\\n dq[0][0] = 0;\\n REP(i, T){\\n REP(j, T+1){\\n if(i+j<T+1) chmax(dq[i+j][1], dq[i][0]+pos[j]);\\n }\\n if(i+K<T+1) chmax(dq[i+K][0], dq[i][1]);\\n }\\n\\n ll res = 0;\\n REP(i, T+1){\\n REP(j, 2){\\n chmax(res, dq[i][j]);\\n }\\n }\\n\\n cout << res << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 34936,\n \"score_of_the_acc\": -0.1386,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3157_4835649\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define P pair<ll,ll>\\n#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)\\n#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)\\n#define TO(x,t,f) ((x)?(t):(f))\\n#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9\\n#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v x is sorted\\n#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v x is sorted\\n#define NUM(x,v) (POSU(x,v)-POSL(x,v)) //x is sorted\\n#define REV(x) (reverse(x.begin(),x.end())) //reverse\\nll gcd_(ll a,ll b){if(a%b==0)return b;return gcd_(b,a%b);}\\nll lcm_(ll a,ll b){ll c=gcd_(a,b);return ((a/c)*(b/c)*c);}\\n#define NEXTP(x) next_permutation(x.begin(),x.end())\\nconst ll INF=ll(1e16)+ll(7);\\nconst ll MOD=1000000007LL;\\n#define out(a) cout<<fixed<<setprecision((a))\\n//tie(a,b,c) = make_tuple(10,9,87);\\n#define pop_(a) __builtin_popcount((a))\\nll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}\\n\\n\\n\\n\\nint main(){\\n\\n\\n\\tll N,K,T;\\n\\tcin >> N >> K >> T;\\n\\tvector<ll> t(N),p(N);\\n\\tFOR(i,0,N) cin >> t[i] >> p[i];\\n\\n\\tll dp[N+1][T+1] = {};\\n\\tFOR(i,1,N+1){\\n\\t\\tFOR(j,0,T+1){\\n\\t\\t\\tif(j>=t[i-1]){\\n\\t\\t\\t\\tdp[i][j] = max(dp[i-1][j],dp[i-1][j-t[i-1]]+p[i-1]);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tdp[i][j] = dp[i-1][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tt.resize(T+24);\\n\\tp.resize(T+14);\\n\\tFOR(i,0,T+1){\\n\\t\\tt[i] = i + K;\\n\\t\\tp[i] = dp[N][i];\\n\\t}\\n\\n\\tll dp2[T+2][T+1]={};\\n\\tll ans = 0;\\n\\tFOR(i,0,T+1) dp2[0][i] = dp[N][i];\\n\\tFOR(i,1,T+2){\\n\\t\\tFOR(j,0,T+1){\\n\\t\\t\\tif(j>=t[i-1]){\\n\\t\\t\\t\\tdp2[i][j] = max(dp2[i-1][j],dp2[i][j-t[i-1]]+p[i-1]);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tdp2[i][j] = dp2[i-1][j];\\n\\t\\t\\t}\\n\\t\\t\\tans = max(ans,dp2[i][j]);\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 65776,\n \"score_of_the_acc\": -0.3997,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3157_4835620\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2020.09.13 14:31:18 */\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region aliases\\n\\n#define rep(i, n) for(long long i = 0; i < (n); i++)\\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bcnt(n) __builtin_popcountll(n)\\n#define endk endl\\n#define ednl endl\\n#define enld endl\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vb = vector<bool>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing mll = map<long long, long long>;\\nusing pll = pair<long long, long long>;\\nusing qll = queue<long long>;\\nusing sll = set<long long>;\\nusing vpll = vector<pair<long long, long long>>;\\ntemplate <class T = ll>\\nusing V = vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\n//昇順pq(小さい方から取り出す)\\ntemplate <class T = ll>\\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\\n//降順pq(大きい方から取り出す)\\ntemplate <class T = ll>\\nusing pqdn = priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\\nlong long const dekai = 3e16;\\nconst long double pi = acos(-1);\\nconst char el = '\\\\n';\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\\n\\nconst int mod = 1000000007;\\n// const int mod = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_procedure\\n\\ntemplate <class T>\\ninline bool isin(T x, T lef, T rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { cout << (f ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"; }\\nvoid No() { cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { cout << (f ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"; }\\nvoid NO() { cout << \\\"NO\\\\n\\\"; }\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tcout << answer << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\nvoid err() {\\n\\tcout << -1 << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\n\\nvector<long long> vin(long long n) { //整数n個の入力を受け取ってベクトルに突っ込んで返す\\n\\tvector<long long> v(n);\\n\\tfor(long long i = 0; i < n; i++) {\\n\\t\\tcin >> v[i];\\n\\t}\\n\\treturn v;\\n}\\n\\n//ベクトルの出力(検証済)\\n// vectorの中身を出力する 答えの出力に利用可能\\ntemplate <class T>\\nvoid vout(vector<T> &v, bool tate = 0) {\\n\\tif(v.size() > 0) {\\n\\t\\tfor(auto it = v.begin(); it < v.end(); it++) {\\n\\t\\t\\tcout << *it;\\n\\t\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\t\\tif(tate)\\n\\t\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tcout << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << endl;\\n}\\n\\ntemplate <class T>\\nvoid add(vector<T> &v, T val) {\\t //ベクトルの各要素に加算\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\n// vectorの中身を数える map<要素,個数>を返す\\ntemplate <class T>\\nmap<T, long long> cntv(vector<T> v) {\\n\\tmap<T, long long> m;\\n\\tfor(auto &g : v) {\\n\\t\\tif(m.count(g))\\n\\t\\t\\tm[g]++;\\n\\t\\telse\\n\\t\\t\\tm[g] = 1;\\n\\t}\\n\\treturn m;\\n}\\n\\n//配列圧縮(検証済)\\n//{1,36,1,3,8,-2,-92}を\\n//{2, 5,2,3,4, 1, 0}にする\\ntemplate <class T>\\nvector<long long> press(vector<T> &v) {\\n\\tlong long n = v.size();\\n\\tvector<long long> w(n);\\n\\tmap<T, long long> m;\\n\\tfor(T &p : v) m[p] = 0;\\n\\tlong long i = 0;\\n\\tfor(auto &p : m) {\\n\\t\\tp.second = i;\\n\\t\\ti++;\\n\\t}\\n\\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\\n\\treturn w;\\n}\\n\\ntemplate <class T>\\nT divup(T a, T b) {\\n\\t//端数繰りあがり割り算\\n\\tassert(b != 0);\\n\\tT x = abs(a);\\n\\tT y = abs(b);\\n\\tT z = (x + y - 1) / y;\\n\\tif((a < 0 && b > 0) || (a > 0 && b < 0))\\n\\t\\treturn -z;\\n\\telse if(a == 0)\\n\\t\\treturn 0;\\n\\telse\\n\\t\\treturn z;\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\ntemplate <class T>\\nint sgn(T x) {\\t//符号関数\\n\\tif(x < 0) return -1;\\n\\tif(x == 0) return 0;\\n\\treturn 1;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\n// a * x % mod == __gcd(a,mod)なるxを返す\\n// a が modの倍数でないことが条件\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tswap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tswap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\nvvll comb(100, vll(100, -1));\\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\\n\\tassert(n < 100 && k < 100);\\n\\tif(n < k || k < 0 || n < 0) return 0;\\n\\tif(comb[n][k] != -1) return comb[n][k];\\n\\tll res;\\n\\tif(n - k < k)\\n\\t\\tres = com(n, n - k);\\n\\telse if(k == 0)\\n\\t\\tres = 1;\\n\\telse\\n\\t\\tres = com(n - 1, k - 1) + com(n - 1, k);\\n\\tcomb[n][k] = res;\\n\\treturn res;\\n}\\n\\n// nCk modを求める\\nconst ll MAX = 5100000;\\n// この値は求める二項計数の値に応じて変える\\n// MAX=3*10^7のとき1900msほど、ほぼ比例\\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\nvoid cominit() {\\n\\t// テーブルを作る前処理\\n\\tfac[0] = fac[1] = 1;\\n\\tfinv[0] = finv[1] = 1;\\n\\tinv[1] = 1;\\n\\tfor(ll i = 2; i < MAX; i++) {\\n\\t\\tfac[i] = fac[i - 1] * i % mod;\\n\\t\\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\\n\\t\\tfinv[i] = finv[i - 1] * inv[i] % mod;\\n\\t}\\n}\\nlong long commod(ll n, ll k) {\\t// 二項係数計算\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\nlong long pmod(ll n, ll k) { //順列計算\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * finv[n - k] % mod;\\n}\\nlong long hmod(ll n, ll k) { // nHk計算\\n\\t// n個の区別しないoを区別するk個の箱に入れる方法の総数\\n\\t//(n+k-1)C(k-1)と等しい\\n\\treturn commod(n + k - 1, n);\\n}\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tINPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tINPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tcin >> a;\\n}\\ntemplate <class T>\\nvoid scan(vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\ntemplate <class T, class L>\\nvoid scan(pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\ntemplate <class T>\\ninline void print(T x) {\\n\\tcout << x << '\\\\n';\\n}\\n\\ntemplate <typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tcerr << \\\", \\\";\\n\\tview(p.second);\\n\\tcerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tcerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tcerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tcerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tcerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tcerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tview(H);\\n\\tcerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tcerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tview(x); \\\\\\n\\t\\tcerr << \\\"\\\\n\\\"; \\\\\\n\\t} while(0)\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\tcout << fixed << setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tINT(n, k, timelim);\\n\\ttimelim += k;\\n\\tvll t(n), p(n);\\n\\trep(i, n) cin >> t[i] >> p[i];\\n\\n\\tvvll dp(n + 1, vll(timelim + 1, -dekai));\\n\\n\\tdp[0][k] = 0;\\n\\n\\trep(i, n) {\\n\\t\\trep(j, timelim + 1) {\\n\\t\\t\\tchmax(dp[i + 1][j], dp[i][j]);\\n\\t\\t\\tif(j - t[i] >= 0) {\\n\\t\\t\\t\\tchmax(dp[i + 1][j], dp[i][j - t[i]] + p[i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvll cospa(timelim + 1);\\n\\trep(i, timelim + 1) { cospa[i] = dp[n][i]; }\\n\\tdebug(dp, cospa);\\n\\tvvll ep(timelim + 2, vll(timelim + 1, -dekai));\\n\\tep[0][0] = 0;\\n\\trep(i, timelim + 1) {\\n\\t\\trep(j, timelim + 1) {\\n\\t\\t\\tchmax(ep[i + 1][j], ep[i][j]);\\n\\t\\t\\tll pre = j - i;\\n\\t\\t\\tif(pre >= 0) {\\n\\t\\t\\t\\tchmax(ep[i + 1][j], ep[i][pre] + cospa[i]);\\n\\t\\t\\t\\tchmax(ep[i + 1][j], ep[i + 1][pre] + cospa[i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tll maxi = -1;\\n\\trep(i, timelim + 2) rep(j, timelim + 1) { chmax(maxi, ep[i][j]); }\\n\\tdrop(maxi);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 191452,\n \"score_of_the_acc\": -1.8295,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3157_4834937\",\n \"code_snippet\": \"/**\\n * author: otera \\n**/\\n#include<iostream>\\n#include<string> \\n#include<cstdio>\\n#include<cstring>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm> \\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<deque>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\n#define int long long\\ntypedef long long ll;\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\ntypedef long double ld;\\nconst int inf=1e9+7;\\nconst ll INF=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-8;\\nconst ld pi = acos(-1.0);\\ntypedef pair<int, int> P;\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define pb push_back\\n#define debug(x) cerr << #x << \\\" = \\\" << (x) << endl;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nvoid solve() {\\n\\tint n, k, T; cin >> n >> k >> T;\\n vector<int> t(n), p(n);\\n rep(i, n) {\\n cin >> t[i] >> p[i];\\n }\\n static int dp[2020][2020];\\n rep(i, 2020) {\\n rep(j, 2020) {\\n dp[i][j] = -INF;\\n }\\n }\\n dp[0][0] = 0;\\n rep(i, n) {\\n for(int j = 0; j <= T; ++ j) {\\n if(j + t[i] <= T) chmax(dp[i + 1][j + t[i]], dp[i][j] + p[i]);\\n chmax(dp[i + 1][j], dp[i][j]);\\n }\\n }\\n vector<int> sdp(T + 1, 0);\\n rep(i, T + 1) {\\n sdp[i] = dp[n][i];\\n }\\n for(int i = 0; i <= T; ++ i) {\\n for(int j = 1; j <= T; ++ j) {\\n if(i + k + j <= T) chmax(sdp[i + k + j], sdp[i] + dp[n][j]);\\n }\\n }\\n cout << *max_element(all(sdp)) << endl;\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//int t; cin >> t; rep(i, t)solve();\\n\\tsolve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 35128,\n \"score_of_the_acc\": -0.1394,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3157_4834273\",\n \"code_snippet\": \"/**\\n * @FileName\\ta.cpp\\n * @Author\\tkanpurin\\n * @Created\\t2020.09.12 21:46:46\\n**/\\n\\n#include \\\"bits/stdc++.h\\\" \\nusing namespace std; \\ntypedef long long ll;\\n\\nint main() {\\n int n,k,t;cin >> n >> k >> t;\\n vector<vector<ll>> dp(n+1,vector<ll>(t+1,0));\\n for (int i = 0; i < n; i++) {\\n int a,p;cin >> a >> p;\\n for (int j = 0; j <= t; j++) {\\n dp[i+1][j]=dp[i][j];\\n if (j-a>=0) dp[i + 1][j] = max(dp[i+1][j],dp[i][j-a] + p);\\n }\\n }\\n \\n vector<vector<ll>> dp2(t+1,vector<ll>(t+1,0));\\n for (int i = 0; i < t; i++) {\\n for (int j = 0; j <= t; j++) {\\n dp2[i+1][j] = dp2[i][j];\\n if (j-k-i-1>=0) dp2[i + 1][j] = max(dp2[i + 1][j],dp2[i + 1][j-k-i-1] + dp[n][i+1]);\\n }\\n }\\n ll ans = 0;\\n for (int i = 0; i < t; i++) {\\n ans = max(ans,dp[n][i+1]);\\n }\\n for (int i = 0; i <= t; i++) {\\n ans = max(ans,dp2[t][i] + dp[n][t-i]);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 65672,\n \"score_of_the_acc\": -0.3993,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3157_4834261\",\n \"code_snippet\": \"/**\\n * @FileName\\ta.cpp\\n * @Author\\tkanpurin\\n * @Created\\t2020.09.12 21:46:46\\n**/\\n\\n#include \\\"bits/stdc++.h\\\" \\nusing namespace std; \\ntypedef long long ll;\\n\\nint main() {\\n int n,k,t;cin >> n >> k >> t;\\n vector<vector<ll>> dp(n+1,vector<ll>(t+1,0));\\n for (int i = 0; i < n; i++) {\\n int a,p;cin >> a >> p;\\n for (int j = 0; j <= t; j++) {\\n dp[i+1][j]=dp[i][j];\\n if (j-a>=0) dp[i + 1][j] = max(dp[i+1][j],dp[i][j-a] + p);\\n }\\n }\\n \\n vector<vector<ll>> dp2(t+1,vector<ll>(t,0));\\n for (int i = 0; i < t; i++) {\\n for (int j = 0; j < t; j++) {\\n dp2[i+1][j] = dp2[i][j];\\n if (j-k-i-1>=0) dp2[i + 1][j] = max(dp2[i + 1][j],dp2[i + 1][j-k-i-1] + dp[n][i+1]);\\n }\\n }\\n ll ans = 0;\\n for (int i = 0; i < t; i++) {\\n ans = max(ans,dp[n][i+1]);\\n }\\n for (int i = 0; i <= t; i++) {\\n ans = max(ans,dp2[t][i] + dp[n][t-i]);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.4,\n \"time_ms\": 20,\n \"memory_kb\": 65696,\n \"score_of_the_acc\": -0.3994,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3157_4834123\",\n \"code_snippet\": \"#pragma region Macros\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define ll long long\\n#define ld long double\\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vll vector<ll>\\n#define vpi vector<pii>\\n#define vpll vector<pll>\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n#define fi first\\n#define se second\\n#define all(c) begin(c), end(c)\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\nusing namespace std;\\nstring YES[2] = {\\\"NO\\\", \\\"YES\\\"};\\nstring Yes[2] = {\\\"No\\\", \\\"Yes\\\"};\\nstring yes[2] = {\\\"no\\\", \\\"yes\\\"};\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\n#define si(c) (int)(c).size()\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\\n scan(head);\\n IN(tail...);\\n}\\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\nvi iota(int n) {\\n vi a(n);\\n iota(all(a), 0);\\n return a;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n sort(all(y));\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\nint popcount(ll x) { return __builtin_popcountll(x); }\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(15);\\n }\\n} setup_io;\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return move(res);\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n cin >> a >> b >> c;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return move(res);\\n}\\n\\n#define i128 __int128_t\\n#define ull unsigned long long int\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n for(auto &e : v) cout << e << \\\" \\\";\\n cout << endl;\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n cout << \\\"(\\\" << p.fi << \\\", \\\" << p.se << \\\")\\\";\\n return os;\\n}\\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \\\"(\\\" + to_string(p.first) + \\\",\\\" + to_string(p.second) + \\\")\\\"; }\\ntemplate <class A> string to_string(A v) {\\n if(v.empty()) return \\\"{}\\\";\\n string ret = \\\"{\\\";\\n for(auto &x : v) ret += to_string(x) + \\\",\\\";\\n ret.back() = '}';\\n return ret;\\n}\\n\\nvoid dump() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\\n cerr << to_string(head) << \\\" \\\";\\n dump(tail...);\\n}\\n#define endl '\\\\n'\\n#ifdef _LOCAL\\n#undef endl\\n#define debug(x) \\\\\\n cout << #x << \\\": \\\"; \\\\\\n dump(x)\\n#else\\n#define debug(x)\\n#endif\\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\\n\\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\n#pragma endregion\\nnamespace modular {\\nconstexpr ll MOD = 998244353;\\nconst int MAXN = 1100000;\\ntemplate <ll Modulus> class modint {\\n using u64 = ll;\\n\\n public:\\n u64 a;\\n\\n constexpr modint(const u64 x = 0) noexcept : a(((x % Modulus) + Modulus) % Modulus) {}\\n constexpr u64 &value() noexcept { return a; }\\n constexpr const u64 &value() const noexcept { return a; }\\n constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; }\\n constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; }\\n constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; }\\n template <typename T> constexpr modint operator^(T rhs) const noexcept { return modint(*this) ^= rhs; }\\n constexpr modint operator-() const noexcept { return modint() - *this; }\\n constexpr modint &operator+=(const modint rhs) noexcept {\\n a += rhs.a;\\n if(a >= Modulus) { a -= Modulus; }\\n return *this;\\n }\\n constexpr modint &operator-=(const modint rhs) noexcept {\\n if(a < rhs.a) { a += Modulus; }\\n a -= rhs.a;\\n return *this;\\n }\\n constexpr modint &operator*=(const modint rhs) noexcept {\\n a = a * rhs.a % Modulus;\\n return *this;\\n }\\n constexpr bool operator==(const modint rhs) const noexcept { return a == rhs.a; }\\n template <typename T> constexpr modint &operator^=(T n) noexcept {\\n modint<Modulus> res = 1;\\n modint<Modulus> x = a;\\n while(n) {\\n if(n & 1) res *= x;\\n x *= x;\\n n >>= 1;\\n }\\n a = res.a;\\n return *this;\\n }\\n};\\n#define mint modint<MOD>\\n#define vmint vector<mint>\\nvmint Inv{0, 1}, Prd{1, 1}, Invprd{1, 1};\\nmint inv(int n) {\\n if(n > MAXN) return mint(n) ^ (MOD - 2);\\n if(Inv.size() > n)\\n return Inv[n];\\n else {\\n for(int i = Inv.size(); i <= n; ++i) Inv.emplace_back(Inv[MOD % i] * (-MOD / i));\\n return Inv[n];\\n }\\n}\\nmint inv(mint x) { return inv(x.a); }\\nmint prd(int n) {\\n if(Prd.size() > n)\\n return Prd[n];\\n else\\n for(int i = Prd.size(); i <= n; ++i) Prd.emplace_back(Prd[i - 1] * i);\\n return Prd[n];\\n}\\nmint invprd(int n) {\\n if(Invprd.size() > n)\\n return Invprd[n];\\n else\\n for(int i = Invprd.size(); i <= n; ++i) Invprd.emplace_back(Invprd[i - 1] * inv(i));\\n return Invprd[n];\\n}\\nmint modpow(ll a, ll n) {\\n mint x = a;\\n return x ^= n;\\n}\\nmint operator/(mint l, mint r) { return l * inv(r); }\\nmint &operator/=(mint &l, mint r) { return l = l / r; }\\nmint C(int a, int b) {\\n if(a < 0 || b < 0) return 0;\\n if(a < b) return 0;\\n return prd(a) * invprd(b) * invprd(a - b);\\n}\\nmint P(int a, int b) {\\n if(a < 0 || b < 0) return 0;\\n if(a < b) return 0;\\n return prd(a) * invprd(a - b);\\n}\\nostream &operator<<(ostream &os, mint a) {\\n os << a.a;\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> a) {\\n for(auto &e : a) os << e << \\\" \\\";\\n return os;\\n}\\nmint operator*(ll x, mint y) { return y * x; }\\nistream &operator>>(istream &is, mint &a) {\\n ll x;\\n is >> x;\\n a = x;\\n return is;\\n}\\nmint proot = 3;\\n\\nvoid FMT(vmint &f, const bool is_inv = false) {\\n const int n = f.size();\\n const mint root = is_inv ? inv(proot) : proot;\\n vmint g(n);\\n for(int b = n >> 1; b > 0; b >>= 1) {\\n mint a = root ^ ((MOD - 1) / (n / b)), p = 1;\\n for(int i = 0; i < n; i += b << 1) {\\n rep(j, b) {\\n f[i + j + b] *= p;\\n g[(i >> 1) + j] = f[i + j] + f[i + b + j];\\n g[(n >> 1) + (i >> 1) + j] = f[i + j] - f[i + b + j];\\n }\\n p *= a;\\n }\\n swap(f, g);\\n }\\n if(is_inv) rep(i, n) f[i] *= inv(n);\\n}\\n\\nvmint mul(vmint x, const vmint &y) {\\n int n = x.size() + y.size() - 1;\\n int s = 1;\\n while(s < n) s <<= 1;\\n x.resize(s);\\n FMT(x);\\n vmint z(s);\\n rep(i, y.size()) z[i] = y[i];\\n FMT(z);\\n rep(i, s) x[i] *= z[i];\\n FMT(x, true);\\n x.resize(n);\\n return x;\\n}\\n\\nusing Poly = vmint;\\nPoly operator-(Poly f) {\\n for(auto &&e : f) e = -e;\\n return f;\\n}\\nPoly &operator+=(Poly &l, const Poly &r) {\\n l.resize(max(l.size(), r.size()));\\n rep(i, r.size()) l[i] += r[i];\\n return l;\\n}\\nPoly operator+(Poly l, const Poly &r) { return l += r; }\\nPoly &operator-=(Poly &l, const Poly &r) {\\n l.resize(max(l.size(), r.size()));\\n rep(i, r.size()) l[i] -= r[i];\\n return l;\\n}\\nPoly operator-(Poly l, const Poly &r) { return l -= r; }\\nPoly &operator<<=(Poly &f, size_t n) { return f.insert(f.begin(), n, 0), f; }\\nPoly operator<<(Poly f, size_t n) { return f <<= n; }\\nPoly &operator>>=(Poly &f, size_t n) { return f.erase(f.begin(), f.begin() + min(f.size(), n)), f; }\\nPoly operator>>(Poly f, size_t n) { return f >>= n; }\\nPoly operator*(const Poly &l, const Poly &r) { return mul(l, r); }\\nPoly &operator*=(Poly &l, const Poly &r) { return l = l * r; }\\nPoly inv(const Poly &f) {\\n Poly g{1 / f[0]};\\n while(g.size() < f.size()) {\\n Poly x(f.begin(), f.begin() + min(f.size(), g.size() << 1)), y = g;\\n x.resize(g.size() << 1), FMT(x);\\n y.resize(g.size() << 1), FMT(y);\\n rep(i, x.size()) x[i] *= y[i];\\n FMT(x, true);\\n x >>= g.size();\\n x.resize(g.size() << 1), FMT(x);\\n rep(i, x.size()) x[i] *= -y[i];\\n FMT(x, true);\\n g.insert(g.end(), x.begin(), x.begin() + g.size());\\n }\\n return Poly{begin(g), begin(g) + f.size()};\\n}\\nPoly integ(const Poly &f) {\\n Poly res(f.size() + 1);\\n for(int i = 1; i < (int)res.size(); ++i) res[i] = f[i - 1] / i;\\n return res;\\n}\\nPoly deriv(const Poly &f) {\\n if(f.size() == 0) return Poly();\\n Poly res(f.size() - 1);\\n rep(i, res.size()) res[i] = f[i + 1] * (i + 1);\\n return res;\\n}\\nPoly log(const Poly &f) {\\n Poly g = integ(inv(f) * deriv(f));\\n return Poly{g.begin(), g.begin() + f.size()};\\n}\\nPoly exp(const Poly &f) {\\n Poly g{1};\\n while(g.size() < f.size()) {\\n Poly x(f.begin(), f.begin() + min(f.size(), g.size() * 2));\\n x[0] += 1;\\n g.resize(2 * g.size());\\n x -= log(g);\\n x *= {g.begin(), g.begin() + g.size() / 2};\\n rep2(i, g.size() / 2, min<int>(x.size(), g.size()) - 1) g[i] = x[i];\\n }\\n return {g.begin(), g.begin() + f.size()};\\n}\\n\\n} // namespace modular\\nusing namespace modular;\\nint main() {\\n INT(n, k, t);\\n constexpr int N = 2001;\\n vv(int, v, N);\\n rep(i, n) {\\n INT(a, b);\\n v[a].eb(b);\\n }\\n vv(pii, w, N);\\n rep(i, N) {\\n if(empty(v[i])) continue;\\n sort(all(v[i]), greater<>());\\n rep(j, si(v[i])) { rep(K, t / i / (j + 1)) w[K].eb(i, v[i][j]); }\\n }\\n vll dp(t + 1);\\n ll ans = 0;\\n rep(i, t / k + 1) {\\n for(auto [W, V] : w[i]) { rep3(j, t, W) chmax(dp[j], dp[j - W] + V); }\\n chmax(ans, dp[t - i * k]);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3932,\n \"score_of_the_acc\": -0.1267,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3157_4834076\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <utility>\\n#include <set>\\n#include <map>\\n#include <cmath>\\n#include <queue>\\n#include <cstdio>\\n#include <limits>\\n#define rep(i,n) for(int i = 0; i < n; ++i)\\n#define rep1(i,n) for(int i = 1; i <= n; ++i)\\nusing namespace std;\\ntemplate<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }\\nusing ll = long long; using ld = long double;\\nusing pi = pair<int,int>; using pl = pair<ll,ll>;\\nusing vi = vector<int>; using vii = vector<vi>;\\nusing vl = vector<ll>; using vll = vector<vl>;\\nconst int inf = numeric_limits<int>::max();\\nconst ll infll = numeric_limits<ll>::max();\\nint main()\\n{\\n ll n,k,t; scanf(\\\"%lld %lld %lld\\\", &n, &k, &t);\\n vector<ll> a(n), b(n);\\n rep(i,n) {\\n scanf(\\\"%lld %lld\\\", &a[i], &b[i]);\\t\\n }\\n\\n vl dp(t+1, 0);\\n rep(i,n) {\\n vl ndp(t+1, 0);\\n rep(j,t+1) {\\n if(j - a[i] >= 0) chmax(ndp[j], max(dp[j], dp[j - a[i]] + b[i]));\\n else chmax(ndp[j], dp[j]);\\n }\\n dp = ndp;\\n }\\n\\n vl dp2(t+k+1, 0);\\n rep(i,t+1) {\\n rep(j,t+k+1) {\\n if(j - (i + k) >= 0) chmax(dp2[j], dp2[j - (i+k)] + dp[i]);\\n }\\n }\\n cout << dp2[t+k] << \\\"\\\\n\\\";\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3544,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3157_4833979\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <tuple>\\n#include <algorithm>\\n\\nusing namespace std;\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n\\nvoid chmax(int64_t &a, int64_t b) {\\n if (a < b) {\\n a = b;\\n }\\n}\\n\\nint main() {\\n int n, K, T;\\n cin >> n >> K >> T;\\n vector<pair<int, int64_t>> tp(n);\\n for (auto &e: tp) {\\n cin >> e.first >> e.second;\\n }\\n// sort(tp.begin(), tp.end(), [](const auto &lhs, const auto &rhs) {\\n// // return lhs.second / lhs.first > rhs.second / rhs.first;\\n// return lhs.second * rhs.first > rhs.second * lhs.first;\\n// });\\n vector<vector<int64_t>> dp(T + 1, vector<int64_t>(n + 1, -1));\\n dp[0][0] = 0;\\n rep(t, T) {\\n rep(i, n + 1) {\\n if (dp[t][i] < 0) continue;\\n if (i + 1 <= n) { // i < n\\n chmax(dp[t][i + 1], dp[t][i]);\\n int ti;\\n int64_t pi;\\n tie(ti, pi) = tp[i];\\n if (t + ti <= T) {\\n chmax(dp[t + ti][i + 1], dp[t][i] + pi);\\n }\\n }\\n if (t + K <= T) {\\n chmax(dp[t + K][0], dp[t][i]);\\n }\\n }\\n }\\n int64_t ans = 0;\\n for (int t = 0; t <= T; t++) {\\n for (int i = 0; i <= n; i++) {\\n chmax(ans, dp[t][i]);\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 34280,\n \"score_of_the_acc\": -0.6357,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3157_4833798\",\n \"code_snippet\": \"// I SELL YOU...! \\n#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<functional>\\n#include<queue>\\n#include<chrono>\\n#include<iomanip>\\n#include<map>\\n#include<set>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll,ll>;\\nusing TP = tuple<ll,ll,ll>;\\nvoid init_io(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(18);\\n}\\nsigned main(){\\n init_io();\\n ll n,k,T,ans=0;\\n cin >> n >> k >> T;\\n vector<ll> t(n),p(n);\\n vector<vector<ll>> dp(n+1,vector<ll>(T+1,-1e15));\\n vector<vector<ll>> dpx(T+1,vector<ll>(T+1,0));\\n for(int i=0;i<n;i++){\\n cin >> t[i] >> p[i];\\n }\\n for(int i=0;i<=T;i++){\\n dp[0][i] = 0;\\n }\\n for(int i=0;i<n;i++){\\n for(int j=0;j<=T;j++){\\n dp[i+1][j] = max(dp[i][j],dp[i+1][j]);\\n if(j+t[i]<=T){\\n dp[i+1][j+t[i]] = max(dp[i+1][j+t[i]],dp[i][j]+p[i]);\\n }\\n }\\n }\\n ans = dp[n][T];\\n for(int i=0;i<=T;i++){\\n dpx[0][i] = dp[n][i];\\n }\\n for(int i=1;i<=T;i++){\\n for(int j=0;j<=T;j++){\\n ll w = i+k;\\n ll v = dp[n][i];\\n ll x=0;\\n if(j-w>=0){\\n x = dpx[i][j-w]+v;\\n }\\n dpx[i][j] = max(dpx[i-1][j],x);\\n ans = max(ans,dpx[i][j]);\\n }\\n }\\n for(int i=0;i<=T;i++){\\n ans = max(ans,dpx[T][i]);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 65904,\n \"score_of_the_acc\": -0.5253,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3157_4833785\",\n \"code_snippet\": \"// I SELL YOU...! \\n#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<functional>\\n#include<queue>\\n#include<chrono>\\n#include<iomanip>\\n#include<map>\\n#include<set>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll,ll>;\\nusing TP = tuple<ll,ll,ll>;\\nvoid init_io(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(18);\\n}\\nsigned main(){\\n init_io();\\n ll n,k,T,ans=0,c=13; cin >> n >> k >> T;\\n vector<ll> t(n),p(n);\\n vector<vector<ll>> dp(n+1,vector<ll>(T+1,-1e15));\\n vector<vector<ll>> dpx(T+1,vector<ll>(T+1,0));\\n for(int i=0;i<n;i++){\\n cin >> t[i] >> p[i];\\n }\\n for(int i=0;i<=T;i++){\\n dp[0][i] = 0;\\n }\\n for(int i=0;i<n;i++){\\n for(int j=0;j<=T;j++){\\n dp[i+1][j] = max(dp[i][j],dp[i+1][j]);\\n if(j+t[i]<=T){\\n dp[i+1][j+t[i]] = max(dp[i+1][j+t[i]],dp[i][j]+p[i]);\\n }\\n }\\n }\\n ans = dp[n][T];\\n for(int i=0;i<=T;i++){\\n dpx[0][i] = dp[n][i];\\n }\\n for(int i=1;i<=T;i++){\\n for(int j=0;j<=T;j++){\\n ll w = i+k;\\n ll v = dp[n][i];\\n if(j-w<0) continue;\\n dpx[i][j] = max(dpx[i-1][j],dpx[i][j-w]+v);\\n ans = max(ans,dpx[i][j]);\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.05714285714285714,\n \"time_ms\": 20,\n \"memory_kb\": 49160,\n \"score_of_the_acc\": -0.3264,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3157_4833547\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <tuple>\\n#include <algorithm>\\n\\nusing namespace std;\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n\\nvoid chmax(int64_t &a, int64_t b) {\\n if (a < b) {\\n a = b;\\n }\\n}\\n\\nint main() {\\n int n, K, T;\\n cin >> n >> K >> T;\\n vector<pair<int, int64_t>> tp(n);\\n for (auto &e: tp) {\\n cin >> e.first >> e.second;\\n }\\n sort(tp.begin(), tp.end(), [](const auto &lhs, const auto &rhs) {\\n // return lhs.second / lhs.first > rhs.second / rhs.first;\\n return lhs.second * rhs.first > rhs.second * lhs.first;\\n });\\n vector<vector<int64_t>> dp(T + 1, vector<int64_t>(n + 1, -1));\\n dp[0][0] = 0;\\n rep(t, T) {\\n rep(i, n + 1) {\\n if (dp[t][i] < 0) continue;\\n if (i + 1 <= n) { // i < n\\n chmax(dp[t][i + 1], dp[t][i]);\\n int ti;\\n int64_t pi;\\n tie(ti, pi) = tp[i];\\n if (t + ti <= T) {\\n chmax(dp[t + ti][i + 1], dp[t][i] + pi);\\n }\\n }\\n if (t + K <= T) {\\n chmax(dp[t + K][0], dp[t][i]);\\n }\\n }\\n }\\n int64_t ans = 0;\\n for (int t = 0; t <= T; t++) {\\n for (int i = 0; i <= n; i++) {\\n chmax(ans, dp[t][i]);\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 34280,\n \"score_of_the_acc\": -0.5107,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3157_4833532\",\n \"code_snippet\": \"//include\\n//------------------------------------------\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//typedef\\n//------------------------------------------\\nusing LL = int64_t;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing PLL = pair<LL, LL>;\\n\\n//container util\\n//------------------------------------------\\n#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)\\n#define rwhole(f,x,...) ([&](decltype((x)) whole) { return (f)(rbegin(whole), rend(whole), ## __VA_ARGS__); })(x)\\n#define EACH(i,c) for(decltype((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define ALL(x) ::std::begin(x), ::std::end(x)\\n#define RALL(x) ::std::rbegin(x), ::std::rend(x)\\n#define SORT(c) whole(sort, c)\\n#define RSORT(c) rwhole(sort, c)\\n\\n//constant\\n//--------------------------------------------\\nconstexpr double EPS = 1e-10;\\nconstexpr double PI = 3.14159265358979323846;\\nconstexpr int MOD = 1000000007;\\n\\n// grid\\n//--------------------------------------------\\nVL dx = {0, 1, 0, -1};\\nVL dy = {1, 0, -1, 0};\\nVL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};\\nVL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};\\n\\n//debug\\n//--------------------------------------------\\n#define dump(x) cerr << #x << \\\" = \\\" << (x) << endl;\\n#define debug(x) cerr << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << \\\" \\\" << __FILE__ << endl;\\n\\n//IO accelerate\\n//--------------------------------------------\\nstruct InitIO {\\n InitIO() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(30);\\n }\\n} init_io;\\n\\n//template\\n//--------------------------------------------\\n// declaretion\\ntemplate<typename T> istream& operator >>(istream& is, vector<T>& vec);\\ntemplate<typename T1, typename T2> ostream& operator <<(ostream& os, const pair<T1, T2>& p);\\ntemplate<typename T> ostream& operator <<(ostream& os, const vector<T>& vec);\\ntemplate<typename T> ostream& operator <<(ostream& os, const vector<vector<T>>& vv);\\ntemplate<typename T> vector<T> make_v(size_t a);\\ntemplate<typename T,typename... Ts> auto make_v(size_t a,Ts... ts);\\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v);\\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v);\\n\\n// implementation\\ntemplate<typename T>\\nistream& operator >>(istream& is, vector<T>& vec) {\\n\\tfor(T& x: vec) is >> x;\\n\\treturn is;\\n}\\ntemplate<typename T1, typename T2>\\nostream& operator <<(ostream& os, const pair<T1, T2>& p) {\\n\\tos << p.first << \\\",\\\" << p.second;\\n\\treturn os;\\n}\\ntemplate<typename T>\\nostream& operator <<(ostream& os, const vector<T>& vec) {\\n\\tfor(int i=0; i<vec.size(); i++){\\n\\t\\tos << vec[i] << ( i+1 == vec.size() ? \\\"\\\" : \\\"\\\\t\\\" );\\n\\t}\\n\\treturn os;\\n}\\ntemplate<typename T>\\nostream& operator <<(ostream& s, const vector<vector<T>>& vv) {\\n\\tfor (int i = 0; i < vv.size(); ++i) {\\n\\t\\ts << vv[i] << endl;\\n\\t}\\n\\treturn s;\\n}\\n\\n// 多重vector\\n// auto dp=make_v<int>(4,h,w) みたいに使える\\ntemplate<typename T>\\nvector<T> make_v(size_t a){return vector<T>(a);}\\n\\ntemplate<typename T,typename... Ts>\\nauto make_v(size_t a,Ts... ts){\\n\\treturn vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\\n}\\n\\n// 多重vectorのためのfill\\n// fill_v(dp,0) みたいに使える\\ntemplate<typename T,typename V>\\ntypename enable_if<is_class<T>::value==0>::type\\nfill_v(T &t,const V &v){t=v;}\\n\\ntemplate<typename T,typename V>\\ntypename enable_if<is_class<T>::value!=0>::type\\nfill_v(T &t,const V &v){\\n\\tfor(auto &e:t) fill_v(e,v);\\n}\\n\\ntemplate<class T,class U> void chmax(T&a,U b){if(a<b)a=b;}\\ntemplate<class T,class U> void chmin(T&a,U b){if(b<a)a=b;}\\ntemplate<typename T> T gcd(T a, T b) { return b?gcd(b,a%b):a;}\\ntemplate<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b;}\\n\\nLL N,K,T;\\n\\n//main code\\nint main(int argc, char *argv[])\\n{\\n\\tcin >> N >> K >> T;\\n VL t(N), p(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> t[i] >> p[i];\\n\\t}\\n\\tVVL dp(N,VL(T+1,0));\\n\\tfor (int i = t[0]; i < T+1; i++) {\\n\\t\\tdp[0][i] = p[0];\\n\\t}\\n\\tfor (int i = 1; i < N; i++) {\\n\\t\\tfor (int j = 0; j < T+1; j++) {\\n\\t\\t\\tif (j < t[i]) {\\n\\t\\t\\t\\tdp[i][j] = dp[i-1][j];\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tdp[i][j] = max(dp[i-1][j-t[i]] + p[i], dp[i-1][j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n VVL dp2(5000, VL(5000, 0));\\n for(int i = 0; i <= T; i++) {\\n for(int j = 0; j <= T; j++) {\\n chmax(dp2[i+1][j], dp2[i][j]);\\n if(i > j) chmax(dp2[i+K+1][i+K], dp2[i][j] + dp[N-1][i-j]);\\n }\\n } \\n\\t//dump(dp);\\n\\t//LL ans = dp[N-1][T];\\n /*\\n\\tfor (int i = 1; i < T+1; i++) {\\n\\t\\tif (dp[N-1][i] > dp[N-1][i-1]) { // iを区切りにやる\\n\\t\\t\\tLL tt = (K + i);\\n\\t\\t\\tLL d = T / tt;\\n\\t\\t\\tfor (LL j = 1; j < d+1; j++) { // j回休憩する((i,k)の組み合わせがj回)\\n\\t\\t\\t\\tLL tmp = j*dp[N-1][i];\\n\\t\\t\\t\\tLL nokori = T - (i+K)*j;\\n\\t\\t\\t\\ttmp += dp[N-1][nokori];\\n\\t\\t\\t\\tchmax(ans, tmp);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n */\\n LL ans = 0;\\n for(int i = 0; i < 5000; i++) {\\n for(int j = 0; j < 5000; j++) ans = max(ans, dp2[i][j]);\\n }\\n\\tcout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 230076,\n \"score_of_the_acc\": -2,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1975,"cells":{"group_id":{"kind":"string","value":"aoj_3160_cpp"},"problem_description":{"kind":"string","value":"Problem J: Meet on the Island\nProblem\nやまだくんは、友達と会うために旅行をすることにしました。\nやまだくんの住む国は $N$ 個の島からなる島国であり、島と島の間には $M$ 個の海流が流れています。\n$i$ 番目の海流が島 $A_i$ から島 $B_i$ に流れている時、またその時のみ、やまだくんは海流に乗ることで島 $A_i$ から島 $B_i$ に移動することができます。\nやまだくんは、はじめ島 $1$ にいるものとします。以下の $Q$ 個のクエリを処理してください。\n$i$ 番目のクエリでは、クエリの種類を表す $X_i$ と、島の番号を表す $Y_i$ が与えられます。\nクエリ 1：\n$X_i = 1$ のとき、やまだくんは今いる島から島 $Y_i$ へ $0$ 個以上の海流に乗って移動します。ここで、今いる島から $Y_i$ に $0$ 個以上の海流に乗って移動できることが保証されます。\nクエリ 2：\n$X_i = 2$ のとき、島 $Y_i$ に住んでいるやまだくんの友達が、 $0$ 個以上の海流に乗って移動することで、やまだくんのいる島にたどり着くことができるか判定してください。\nConstraints\n入力は以下の条件を満たします。\n$1 \\leq N \\leq 200000$\n$0 \\leq M \\leq \\min(N(N-1),200000)$\n$1 \\leq A_i , B_i \\leq N$\n$i \\neq j$ であって、 $A_i = A_j$ かつ $B_i = B_j$ であるような $( i , j )$ は存在しない。\n$1 \\leq Q \\leq 100000$\n$1 \\leq X_i \\leq 2$\n$1 \\leq Y_i \\leq N$\n$X_i = 1$ のとき、やまだくんが今いる島から、$0$ 個以上の海流を辿って $Y_i$ にたどり着けることが保証される。\n$X_i = 2$ であるような$ i ( 1 \\leq i \\leq Q )$ が、少なくとも一つ存在することが保証される。\n入力は全て整数である。\nInput\n入力は以下の形式で標準入力から与えられます。\n$N$ $M$\n$A_1$ $B_1$\n$A_2$ $B_2$\n$\\vdots$\n$A_M$ $B_M$\n$Q$\n$X_1$ $Y_1$\n$X_2$ $Y_2$\n$\\vdots$\n$X_Q$ $Y_Q$\nOutput\nそれぞれのクエリ２に対して順番に、移動可能な場合は\"YES\"、不可能な場合は\"NO\"を出力してください。\n各クエリ2の答えは改行区切りで出力してください。\n最後の出力の後に改行を出力するのを忘れないようにしてください。\nSample Input 1\n4 4\n1 2\n2 3\n3 4\n4 2\n3\n2 4\n1 2\n2 4\nSample Output 1\nNO\nYES\n島 $4$ から島 $1$ にはたどり着けないため、やまだくんが島 $1$ にいる間、島 $4$ にいる友達はやまだくんに会うことができません。\nその後、やまだくんが島 $2$ に移動すると、島 $4$ にいる友達は島 $2$ に移動することで、やまだくんに会うことができるようになります。\nSample Input 2\n2 0\n2\n2 1\n2 2\nSample Output 2\nYES\nNO\nSample Input 3\n7 9\n1 4\n1 5\n1 6\n2 4\n2 5\n2 6\n3 4\n3 5\n3 6\n4\n2 7\n2 1\n1 4\n2 3\nSample Output 3\nNO\nYES\nYES\n他の海流を飛び越える海流や、海流が流れていない島が存在する場合があります。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3160_10497568","code_snippet":"#include <bits/extc++.h>\n\nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector<pair<int, int>> AB(M);\n \n vector<vector<int>> nanachi(N), rev(N);\n \n for (int i = 0 ; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a--, b--;\n AB[i] = {a, b};\n nanachi[a].push_back(b);\n rev[b].push_back(a);\n }\n \n vector<bool> ok(N);\n \n ok[0] = true;\n \n queue<int> que;\n \n que.push(0);\n \n while (!que.empty()) {\n int v = que.front();\n que.pop();\n \n for (int w : rev[v]) {\n if (ok[w]) continue;\n ok[w] = true;\n que.push(w);\n }\n }\n \n int Q;\n cin >> Q;\n \n while (Q--) {\n int t, x;\n cin >> t >> x;\n x--;\n \n if (t == 1) {\n if (ok[x]) continue;\n \n ok[x] = true;\n \n queue<int> que;\n \n que.push(x);\n \n while (!que.empty()) {\n int v = que.front();\n que.pop();\n \n for (int w : rev[v]) {\n if (ok[w]) continue;\n ok[w] = true;\n que.push(w);\n }\n }\n } else {\n if (ok[x]) {\n cout << \"YES\\n\";\n } else {\n cout << \"NO\\n\";\n }\n }\n }\n}","accuracy":1,"time_ms":100,"memory_kb":23440,"score_of_the_acc":-0.8471,"final_rank":10},{"submission_id":"aoj_3160_10497514","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, a, b) for (ll i = a; i < b; i++)\nconst int INF = (1 << 29);\n\nint main(){\n int N, M;\n cin >> N >> M;\n vector<vector<int>> G(N);\n rep(i, 0, M){\n int a, b;\n cin >> a >> b;\n a--, b--;\n G[b].push_back(a);\n }\n int Q;\n cin >> Q;\n vector<int> seen(N);\n auto upd = [&](int a) -> void {\n if (seen[a]) return;\n vector<int> order = {a};\n seen[a] = 1;\n rep(rp, 0, order.size()){\n int b = order[rp];\n for (auto x : G[b]) if (seen[x] == 0){\n seen[x] = 1;\n order.push_back(x);\n }\n }\n };\n upd(0);\n while (Q--){\n int X, Y;\n cin >> X >> Y;\n Y--;\n if (X == 1) upd(Y);\n else cout << (seen[Y] ? \"YES\\n\" : \"NO\\n\");\n }\n}","accuracy":1,"time_ms":130,"memory_kb":13684,"score_of_the_acc":-0.7503,"final_rank":9},{"submission_id":"aoj_3160_10495082","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)\nusing namespace std;\nusing ll = long long;\n\nbool chmin(auto &a, auto b){ return a > b ? a = b, 1 : 0; }\nbool chmax(auto &a, auto b){ return a < b ? a = b, 1 : 0; }\n\nconst ll linf = 1e18;\n\nvoid solve(){\n int n, m; cin >> n >> m;\n vector<vector<int>> g(n);\n rep(i,0,m){\n int u, v; cin >> u >> v; u--, v--;\n g[v].emplace_back(u);\n }\n vector<bool> done(n,false);\n auto proc = [&](int start){\n if (done[start]) return ;\n queue<int> que;\n que.push(start);\n done[start] = true;\n while (!que.empty()){\n int v = que.front(); que.pop();\n for (int u : g[v]){\n if (done[u]) continue;\n que.push(u);\n done[u] = true;\n }\n }\n };\n proc(0);\n int q; cin >> q;\n while (q--){\n int t, v; cin >> t >> v; v--;\n if (t == 1){\n proc(v);\n }\n else {\n cout << (done[v] ? \"YES\" : \"NO\") << '\\n';\n }\n }\n}\n\nint main(){\n solve();\n}","accuracy":1,"time_ms":90,"memory_kb":12704,"score_of_the_acc":-0.5016,"final_rank":6},{"submission_id":"aoj_3160_10489273","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)\n#define all(v) begin(v),end(v)\nusing namespace std;\nusing ll = long long;\n\n\nvoid solve(){\n int n, m; cin >> n >> m;\n vector<vector<int>> g(n);\n rep(i,0,m){\n int u, v; cin >> u >> v; u--, v--;\n g[v].emplace_back(u);\n }\n vector<bool> done(n,false);\n auto vis = [&](int s){\n if (done[s]) return ;\n queue<int> que;\n que.push(s);\n done[s] = true;\n while (!que.empty()){\n int v = que.front(); que.pop();\n for (int u : g[v]){\n if (!done[u]){\n done[u] = true;\n que.push(u);\n }\n }\n }\n };\n int s = 0;\n vis(s);\n int q; cin >> q;\n while (q--){\n int t; cin >> t;\n if (t == 1){\n int v; cin >> v; v--;\n s = v;\n vis(s);\n }\n else if (t == 2){\n int v; cin >> v; v--;\n cout << (done[v] ? \"YES\" : \"NO\") << endl;\n }\n }\n}\n\nint main(){\n int t = 1; //cin >> t;\n while (t--){\n solve();\n }\n}","accuracy":1,"time_ms":90,"memory_kb":12704,"score_of_the_acc":-0.5016,"final_rank":6},{"submission_id":"aoj_3160_10489254","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)\n#define all(v) begin(v),end(v)\nusing namespace std;\nusing ll = long long;\n\n\nvoid solve(){\n int n, m; cin >> n >> m;\n vector<vector<int>> g(n);\n rep(i,0,m){\n int u, v; cin >> u >> v; u--, v--;\n g[v].emplace_back(u);\n }\n vector<bool> done(n,false);\n auto vis = [&](int s){\n if (done[s]) return ;\n queue<int> que;\n que.push(s);\n done[s] = true;\n while (!que.empty()){\n int v = que.front(); que.pop();\n for (int u : g[v]){\n if (!done[u]){\n done[u] = true;\n que.push(u);\n }\n }\n }\n };\n int s = 0;\n done[s] = true;\n int q; cin >> q;\n while (q--){\n int t; cin >> t;\n if (t == 1){\n int v; cin >> v; v--;\n s = v;\n vis(s);\n }\n else if (t == 2){\n int v; cin >> v; v--;\n cout << (done[v] ? \"YES\" : \"NO\") << endl;\n }\n }\n}\n\nint main(){\n int t = 1; //cin >> t;\n while (t--){\n solve();\n }\n}","accuracy":0.14634146341463414,"time_ms":40,"memory_kb":9248,"score_of_the_acc":-0.1306,"final_rank":19},{"submission_id":"aoj_3160_10199101","code_snippet":"// AOJ #3160\n// Meet on the Island 2025.2.6\n\n#include <bits/stdc++.h>\nusing namespace std;\n \nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N, M;\n cin >> N >> M;\n // 逆グラフを作成：原グラフで A -> B なら，逆グラフでは B -> A\n vector<vector<int>> rev(N+1);\n for(int i = 0; i < M; i++){\n int A, B;\n cin >> A >> B;\n rev[B].push_back(A);\n }\n \n int Q;\n cin >> Q;\n \n // やまだくんの現在位置．初期は1．\n int current = 1;\n // canMeet[x] = true なら，原グラフで x から現在の島にたどり着ける\n vector<bool> canMeet(N+1, false);\n \n // 初期状態：現在の島が1なので，逆グラフで1からたどれる頂点が集合 S(1)\n {\n queue<int> qu;\n qu.push(1);\n canMeet[1] = true;\n while(!qu.empty()){\n int cur = qu.front();\n qu.pop();\n for(auto nxt : rev[cur]){\n if(!canMeet[nxt]){\n canMeet[nxt] = true;\n qu.push(nxt);\n }\n }\n }\n }\n \n // 各クエリの処理\n for(int i = 0; i < Q; i++){\n int type, Y;\n cin >> type >> Y;\n if(type == 1){\n // クエリ1：移動\n current = Y;\n // モノトニシティの性質により，\n // S(Y) = { x: x -> Y (原グラフ) } は既に global に含まれている S(current) の部分集合に含まれていなければ，追加する\n if(!canMeet[Y]){\n queue<int> qu;\n qu.push(Y);\n canMeet[Y] = true;\n while(!qu.empty()){\n int cur = qu.front();\n qu.pop();\n for(auto nxt : rev[cur]){\n if(!canMeet[nxt]){\n canMeet[nxt] = true;\n qu.push(nxt);\n }\n }\n }\n }\n } else if(type == 2){\n cout << (canMeet[Y] ? \"YES\" : \"NO\") << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":12452,"score_of_the_acc":-0.4948,"final_rank":5},{"submission_id":"aoj_3160_10091982","code_snippet":"// competitive-verifier: PROBLEM\n#include <iostream>\n#include <vector>\n/**\n * @brief 重み付きグラフ\n *\n * @tparam T 辺の重みの型\n */\ntemplate <class T>\nstruct Graph {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to(), _weight() {}\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr T weight() const { return _weight; }\n private:\n int _from, _to;\n T _weight;\n };\n public:\n using edge_type = typename Graph<T>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\n void add_edges(int from, int to, T weight = T(1)) {\n edges[from].emplace_back(from, to, weight);\n edges[to].emplace_back(to, from, weight);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edge(from - base, to - base, weight);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edges(from - base, to - base, weight);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\ntemplate <>\nstruct Graph<void> {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to() {}\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr int weight() const { return 1; }\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n private:\n int _from, _to;\n };\n public:\n using edge_type = typename Graph<void>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\n void add_edges(int from, int to) {\n edges[from].emplace_back(from, to);\n edges[to].emplace_back(to, from);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edge(from - base, to - base);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edges(from - base, to - base);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nint main(void) {\n int n, m;\n cin >> n >> m;\n Graph<void> g(n);\n rep (i, m) {\n int a, b;\n cin >> a >> b;\n g.add_edge(b - 1, a - 1);\n }\n vector<bool> visit(n);\n auto dfs = [&](auto self, int x) {\n if (visit[x])\n return;\n visit[x] = true;\n for (auto e : g[x]) self(self, e.to());\n };\n dfs(dfs, 0);\n int q;\n cin >> q;\n rep (i, q) {\n int x, y;\n cin >> x >> y;\n if (x == 1) {\n dfs(dfs, y - 1);\n } else {\n YES(visit[y - 1]);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":16544,"score_of_the_acc":-0.3275,"final_rank":3},{"submission_id":"aoj_3160_7009659","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3160.cc: Problem J: Meet on the Island\n */\n\n#include<cstdio>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 200000;\n\n/* typedef */\n\ntypedef queue<int> qi;\ntypedef vector<int> vi;\ntypedef vector<bool> vb;\ntypedef vector<vi> vvi;\ntypedef stack<int> si;\n\n/* global variables */\n\nvi nbrs[MAX_N], gnbrs[MAX_N];\nint gids[MAX_N];\nbool used[MAX_N];\n\n/* subroutines */\n\nvoid scc_visit(const vi *nbrs, int v, vvi& scc,\n\t si& S, vb &inS, vi& low, vi& num, int& time) {\n low[v] = num[v] = ++time;\n S.push(v);\n inS[v] = true;\n\n const vi& nbrv = nbrs[v];\n for (vi::const_iterator vit = nbrv.begin(); vit != nbrv.end(); vit++) {\n const int& w = *vit;\n if (num[w] == 0) {\n scc_visit(nbrs, w, scc, S, inS, low, num, time);\n low[v] = min(low[v], low[w]);\n }\n else if (inS[w])\n low[v] = min(low[v], num[w]);\n }\n\n if (low[v] == num[v]) {\n scc.push_back(vi());\n for (;;) {\n int w = S.top(); S.pop();\n inS[w] = false;\n scc.back().push_back(w);\n if (v == w) break;\n }\n }\n}\n\nvoid calc_scc(const int n, const vi *nbrs, vvi& scc) {\n vi num(n), low(n);\n si S;\n vb inS(n);\n int time = 0;\n\n for (int u = 0; u < n; u++)\n if (num[u] == 0)\n scc_visit(nbrs, u, scc, S, inS, low, num, time);\n}\n\nvoid traceback(int st) {\n if (used[st]) return;\n\n used[st] = true;\n qi q;\n q.push(st);\n\n while (! q.empty()) {\n int u = q.front(); q.pop();\n for (auto v: gnbrs[u])\n if (! used[v]) {\n\tused[v] = true;\n\tq.push(v);\n }\n }\n}\n\n/* main */\n\nint main() {\n int n, m;\n scanf(\"%d%d\", &n, &m);\n\n for (int i = 0; i < m; i++) {\n int u, v;\n scanf(\"%d%d\", &u, &v);\n u--, v--;\n nbrs[u].push_back(v);\n }\n\n vvi scc;\n calc_scc(n, nbrs, scc);\n\n int gn = scc.size();\n for (int i = 0; i < gn; i++)\n for (auto u: scc[i]) gids[u] = i;\n\n for (int u = 0; u < n; u++) {\n int gu = gids[u];\n for (auto v: nbrs[u]) {\n int gv = gids[v];\n if (gu != gv) gnbrs[gv].push_back(gu);\n }\n }\n\n int cu = gids[0];\n traceback(cu);\n\n int qn;\n scanf(\"%d\", &qn);\n\n while (qn--) {\n int x, y;\n scanf(\"%d%d\", &x, &y), y--;\n\n if (x == 1) {\n cu = gids[y];\n traceback(cu);\n //for (int i = 0; i < gn; i++) printf(\"%d\", used[i]); putchar('\\n');\n }\n else {\n if (used[gids[y]]) puts(\"YES\");\n else puts(\"NO\");\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":43112,"score_of_the_acc":-1.1005,"final_rank":13},{"submission_id":"aoj_3160_7009645","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3160.cc: Problem J: Meet on the Island\n */\n\n#include<cstdio>\n#include<vector>\n#include<set>\n#include<stack>\n#include<queue>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 200000;\n\n/* typedef */\n\ntypedef queue<int> qi;\ntypedef vector<int> vi;\ntypedef vector<bool> vb;\ntypedef vector<vi> vvi;\ntypedef stack<int> si;\ntypedef set<int> seti;\n\n/* global variables */\n\nvi nbrs[MAX_N], gnbrs[MAX_N];\nint gids[MAX_N];\nbool used[MAX_N];\n\n/* subroutines */\n\nvoid scc_visit(const vi *nbrs, int v, vvi& scc,\n\t si& S, vb &inS, vi& low, vi& num, int& time) {\n low[v] = num[v] = ++time;\n S.push(v);\n inS[v] = true;\n\n const vi& nbrv = nbrs[v];\n for (vi::const_iterator vit = nbrv.begin(); vit != nbrv.end(); vit++) {\n const int& w = *vit;\n if (num[w] == 0) {\n scc_visit(nbrs, w, scc, S, inS, low, num, time);\n low[v] = min(low[v], low[w]);\n }\n else if (inS[w])\n low[v] = min(low[v], num[w]);\n }\n\n if (low[v] == num[v]) {\n scc.push_back(vi());\n for (;;) {\n int w = S.top(); S.pop();\n inS[w] = false;\n scc.back().push_back(w);\n if (v == w) break;\n }\n }\n}\n\nvoid calc_scc(const int n, const vi *nbrs, vvi& scc) {\n vi num(n), low(n);\n si S;\n vb inS(n);\n int time = 0;\n\n for (int u = 0; u < n; u++)\n if (num[u] == 0)\n scc_visit(nbrs, u, scc, S, inS, low, num, time);\n}\n\nvoid traceback(int st, seti &ts) {\n if (used[st]) return;\n\n used[st] = true, ts.insert(st);\n qi q;\n q.push(st);\n\n while (! q.empty()) {\n int u = q.front(); q.pop();\n for (auto v: nbrs[u])\n if (! used[v]) {\n\tused[v] = true, ts.insert(v);\n\tq.push(v);\n }\n }\n}\n\n/* main */\n\nint main() {\n int n, m;\n scanf(\"%d%d\", &n, &m);\n\n for (int i = 0; i < m; i++) {\n int u, v;\n scanf(\"%d%d\", &u, &v);\n u--, v--;\n nbrs[u].push_back(v);\n }\n\n vvi scc;\n calc_scc(n, nbrs, scc);\n\n int gn = scc.size();\n for (int i = 0; i < gn; i++)\n for (auto u: scc[i]) gids[u] = i;\n\n for (int u = 0; u < n; u++) {\n int gu = gids[u];\n for (auto v: nbrs[u]) {\n int gv = gids[v];\n if (gu != gv) gnbrs[gv].push_back(gu);\n }\n }\n\n seti ts;\n int cu = gids[0];\n traceback(cu, ts);\n\n int qn;\n scanf(\"%d\", &qn);\n\n while (qn--) {\n int x, y;\n scanf(\"%d%d\", &x, &y), y--;\n\n if (x == 1) {\n cu = gids[y];\n traceback(cu, ts);\n }\n else {\n if (ts.find(gids[y]) != ts.end()) puts(\"YES\");\n else puts(\"NO\");\n }\n }\n\n return 0;\n}","accuracy":0.17073170731707318,"time_ms":40,"memory_kb":31616,"score_of_the_acc":-0.7345,"final_rank":16},{"submission_id":"aoj_3160_6304577","code_snippet":"#include <iostream>\n#include <unordered_map>\n#include <unordered_set>\n#include <set>\n#include <vector>\n#include <numeric>\n#include <algorithm>\n#include <queue>\n#include <string>\n#include <random>\n#include <array>\n#include <climits>\n#include <map>\n#include <cassert>\n#include <stack>\n#include <iomanip>\n#include <cfloat>\n#include <fstream>\nstd::vector<int> calc_dag(const std::vector<std::vector<int>>& nodes) {\n\tconst int n = nodes.size();\n\tstd::vector<int> out_time(n, -1), indices; indices.reserve(n);\n\tstd::stack<int> stack;\n\tfor (auto root = 0; root < n; ++root) {\n\t\tif (out_time[root] != -1) continue;\n\t\tstack.push(root);\n\t\twhile (!stack.empty()) {\n\t\t\tconst auto top = stack.top(); stack.pop();\n\t\t\tif (top >= 0) {\n\t\t\t\tif (out_time[top] != -1) continue;\n\t\t\t\tout_time[top] = 0;\n\t\t\t\tstack.push(-1 - top);\n\t\t\t\tfor (const auto next : nodes[top]) {\n\t\t\t\t\tif (out_time[next] != -1) continue;\n\t\t\t\t\tstack.push(next);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tindices.push_back(-1 - top);\n\t\t\t}\n\t\t}\n\t}\n\tstd::reverse(indices.begin(), indices.end());\n\tstd::vector<std::vector<int>> reverse(nodes.size());\n\tfor (auto from = 0; from < nodes.size(); ++from) {\n\t\tfor (const auto to : nodes[from]) {\n\t\t\treverse[to].push_back(from);\n\t\t}\n\t}\n\tstd::fill(out_time.begin(), out_time.end(), -1);\n\tint time = 0;\n\tfor (const auto root : indices) {\n\t\tif (out_time[root] != -1) continue;\n\t\tout_time[root] = time;\n\t\tstack.push(root);\n\t\twhile (!stack.empty()) {\n\t\t\tconst auto top = stack.top(); stack.pop();\n\t\t\tfor (const auto next : reverse[top]) {\n\t\t\t\tif (out_time[next] != -1) continue;\n\t\t\t\tout_time[next] = time;\n\t\t\t\tstack.push(next);\n\t\t\t}\n\t\t}\n\t\t++time;\n\t}\n\treturn out_time;\n}\nint main() {\n\tint n, m; std::cin >> n >> m;\n\tstd::vector<std::pair<int, int>> edges(m);\n\tfor (auto& [s, t] : edges) {\n\t\tstd::cin >> s >> t; --s; --t;\n\t}\n\tint q; std::cin >> q;\n\tstd::vector<std::pair<int, int>> queries(q);\n\tfor (auto& [x, y] : queries) {\n\t\tstd::cin >> x >> y; --y;\n\t}\n\tstd::vector<std::vector<int>> graph(n);\n\tfor (const auto [s, t] : edges) {\n\t\tgraph[s].push_back(t);\n\t}\n\tconst auto dag = calc_dag(graph);\n\tstd::vector<std::vector<int>> dag_rev_graph(n);\n\tfor (const auto [s, t] : edges) {\n\t\tdag_rev_graph[dag[t]].push_back(dag[s]);\n\t}\n\tstd::vector<bool> can_reach(n, false);\n\tstd::queue<int> queue;\n\tcan_reach[dag[0]] = true;\n\tqueue.push(dag[0]);\n\twhile (!queue.empty()) {\n\t\tconst auto top = queue.front(); queue.pop();\n\t\tfor (const auto prev : dag_rev_graph[top]) {\n\t\t\tif (can_reach[prev]) continue;\n\t\t\tcan_reach[prev] = true;\n\t\t\tqueue.push(prev);\n\t\t}\n\t}\n\tfor (const auto [x, y] : queries) {\n\t\tif (x == 1) {\n\t\t\tif (can_reach[dag[y]]) continue;\n\t\t\tcan_reach[dag[y]] = true;\n\t\t\tqueue.push(dag[y]);\n\t\t\twhile (!queue.empty()) {\n\t\t\t\tconst auto top = queue.front(); queue.pop();\n\t\t\t\tfor (const auto prev : dag_rev_graph[top]) {\n\t\t\t\t\tif (can_reach[prev]) continue;\n\t\t\t\t\tcan_reach[prev] = true;\n\t\t\t\t\tqueue.push(prev);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tif (can_reach[dag[y]]) {\n\t\t\t\tstd::cout << \"YES\\n\";\n\t\t\t}\n\t\t\telse {\n\t\t\t\tstd::cout << \"NO\\n\";\n\t\t\t}\n\t\t}\n\t}\n}","accuracy":1,"time_ms":100,"memory_kb":25520,"score_of_the_acc":-0.9032,"final_rank":11},{"submission_id":"aoj_3160_5675914","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\nint main(){\n int N, M;\n scanf(\"%d %d\", &N, &M);\n vector<vector<int>> G(N);\n vector<vector<int>> to(N), from(N);\n for(int i = 0; i < M; i++){\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n G[b].push_back(a);\n }\n int Q;\n cin >> Q;\n queue<int> q;\n q.push(0);\n vector<int> can(N, 0);\n can[0] = 1;\n while(!q.empty()){\n int t = q.front();\n q.pop();\n for(int s: G[t]){\n if(can[s] == 0){\n can[s] = 1;\n q.push(s);\n }\n }\n }\n for(int i = 0; i < Q; i++){\n int X, Y;\n scanf(\"%d %d\", &X, &Y);\n Y--;\n if(X == 1){\n if(can[Y] == 0){\n q.push(Y);\n can[Y] = 1;\n while(!q.empty()){\n int t = q.front();\n q.pop();\n for(int s : G[t]){\n if(can[s] == 0){\n can[s] = 1;\n q.push(s);\n }\n }\n }\n }\n }\n else{\n if(can[Y] == 1) printf(\"YES\\n\");\n else printf(\"NO\\n\");\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":22604,"score_of_the_acc":-0.4356,"final_rank":4},{"submission_id":"aoj_3160_5073711","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\nnamespace CharacterClass {\n\tconstexpr string_view\n\t digit = \"0123456789\",\n\t xdigit = \"0123456789ABCDEFabcdef\", lower = \"abcdefghijklmnopqrstuvwxyz\",\n\t upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n\t alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t alnum = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t word = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\",\n\t punct = R\"(!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~)\",\n\t graph =\n\t R\"(!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t print =\n\t R\"( !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t blank = \" \\t\", space = \" \\t\\n\\r\\f\\v\";\n} // namespace CharacterClass\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Printer {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid print(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(bool v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(vector<bool>::reference v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid print(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid print(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid print(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void print(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\n\t\tprint(v.first);\n\t\tprint(D.d);\n\t\tprint(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) print(D.d);\n\t\t\tprint(*i);\n\t\t}\n\t}\n\ttemplate <class T> void print(const vector<T>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void print(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) print(D.l);\n\t\t\tprint(v[i]);\n\t\t}\n\t}\n\n\tPrinter() = default;\n\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tPrinter& operator()() {\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Printer& operator()(H&& h) {\n\t\tprint(h);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\n\t\tprint(h);\n\t\tprint(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\n\t\tprint_range(begin, end);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Printer& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tPrinter& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tPrinter& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tPrinter& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tPrinter& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n\ttemplate <class V> auto operator()(const V& val, size_t i) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(next(begin(v), i), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 7 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T = long long> constexpr T TEN(size_t n) {\n\tT result = 1;\n\tfor (size_t i = 0; i < n; ++i) result *= 10;\n\treturn result;\n}\ntemplate <class T, class U,\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr auto div_ceil(T n, U m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> constexpr T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> constexpr T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T, class U, class V>\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\n\treturn lower <= v && v < upper;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\nconstexpr bool is_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> constexpr T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T> constexpr int BIT(T x, int i) {\n\treturn (x & (1 << i)) ? 1 : 0;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Pow(T a, U n) {\n\tassert(n >= 0);\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Powmod(T a, U n, T mod) {\n\tassert(n >= 0);\n\tif (a > mod) a %= mod;\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 5 \"/home/yuruhiya/programming/library/Graph/StronglyConnectedComponents.cpp\"\nusing namespace std;\n\nclass StronglyConnectedComponents {\n\tint n;\n\tvector<vector<int>> graph, rgraph;\n\tvector<bool> used;\n\tvector<int> cmp, vs;\n\tint k;\n\tbool builded = false;\n\tvoid dfs(int v) {\n\t\tused[v] = true;\n\t\tfor (auto e : graph[v]) {\n\t\t\tif (!used[e]) dfs(e);\n\t\t}\n\t\tvs.push_back(v);\n\t}\n\tvoid rdfs(int v, int k) {\n\t\tused[v] = true;\n\t\tcmp[v] = k;\n\t\tfor (auto e : rgraph[v]) {\n\t\t\tif (!used[e]) rdfs(e, k);\n\t\t}\n\t}\n\npublic:\n\tStronglyConnectedComponents(int _n) : n(_n), graph(n), rgraph(n) {}\n\tStronglyConnectedComponents(const vector<vector<int>>& _graph)\n\t : n(_graph.size()), graph(_graph), rgraph(n) {\n\t\tfor (int v = 0; v < n; ++v) {\n\t\t\tfor (int u : graph[v]) {\n\t\t\t\trgraph[u].push_back(v);\n\t\t\t}\n\t\t}\n\t}\n\tvoid add_edge(int s, int t) {\n\t\tbuilded = false;\n\t\tgraph[s].push_back(t);\n\t\trgraph[t].push_back(s);\n\t}\n\tint build() {\n\t\tvs.clear();\n\t\tused.assign(n, false);\n\t\tcmp.assign(n, 0);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tif (!used[i]) dfs(i);\n\t\t}\n\t\tk = 0;\n\t\tfill(used.begin(), used.end(), false);\n\t\tfor (int i = vs.size() - 1; i >= 0; --i) {\n\t\t\tif (!used[vs[i]]) rdfs(vs[i], k++);\n\t\t}\n\t\tbuilded = true;\n\t\treturn k;\n\t}\n\tint operator[](int i) const {\n\t\tassert(builded);\n\t\treturn cmp[i];\n\t}\n\tconst vector<int>& get_cmp() const {\n\t\tassert(builded);\n\t\treturn cmp;\n\t}\n\tconst vector<vector<int>>& get_graph() const {\n\t\tassert(builded);\n\t\treturn graph;\n\t}\n\tint count_strongly_components() const {\n\t\tassert(builded);\n\t\treturn k;\n\t}\n\tvector<vector<int>> groups() const {\n\t\tassert(builded);\n\t\tvector<vector<int>> result(k);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tresult[cmp[i]].push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\tvector<vector<int>> make_DAG() const {\n\t\tassert(builded);\n\t\tvector<vector<int>> result(k);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tfor (auto e : graph[i]) {\n\t\t\t\tif (cmp[i] != cmp[e]) {\n\t\t\t\t\tresult[cmp[i]].push_back(cmp[e]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (auto& v : result) {\n\t\t\tsort(v.begin(), v.end());\n\t\t\tv.erase(unique(v.begin(), v.end()), v.end());\n\t\t}\n\t\treturn result;\n\t}\n};\n#line 3 \"a.cpp\"\n\nVVI reverse_edge(const VVI& g) {\n\tint n = g.size();\n\tVVI rg(n);\n\trep(v, n) {\n\t\tfor (int u : g[v]) {\n\t\t\trg[u].push_back(v);\n\t\t}\n\t}\n\treturn rg;\n}\n\nint main() {\n\tini(n, m);\n\tStronglyConnectedComponents scc(n);\n\trep(i, m) {\n\t\tint a = in--, b = in--;\n\t\tscc.add_edge(a, b);\n\t}\n\n\tint k = scc.build();\n\tauto g = scc.make_DAG();\n\tauto rg = reverse_edge(g);\n\n\tVB flag(k);\n\n\tauto update_flag = [&](auto&& f, int v) -> void {\n\t\tif (flag[v]) return;\n\t\tflag[v] = true;\n\t\tfor (int u : rg[v]) {\n\t\t\tif (!flag[u]) f(f, u);\n\t\t}\n\t};\n\n\tupdate_flag(update_flag, scc[0]);\n\n\tfor (int q = in; q--;) {\n\t\tint x = in, y = in--;\n\t\tif (x == 1) {\n\t\t\tupdate_flag(update_flag, scc[y]);\n\t\t} else {\n\t\t\tout.set(YES)(flag[scc[y]]);\n\t\t}\n\t}\n}","accuracy":1,"time_ms":50,"memory_kb":45244,"score_of_the_acc":-1.158,"final_rank":14},{"submission_id":"aoj_3160_4959577","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nint N,E;\nbool check[SIZE];\nvector<int> rev_G[SIZE];\n\nvoid dfs(int node_id,int pre){\n\n\tcheck[node_id] = true;\n\tfor(int i = 0; i < rev_G[node_id].size(); i++){\n\t\tint next = rev_G[node_id][i];\n\t\tif(next == pre||check[next])continue;\n\n\t\tdfs(next,node_id);\n\t}\n}\n\nint main(){\n\n\tscanf(\"%d %d\",&N,&E);\n\n\tint from,to;\n\tfor(int loop = 0; loop < E; loop++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\t\trev_G[to].push_back(from);\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tcheck[i] = false;\n\t}\n\n\tdfs(0,-1);\n\n\tint num_query;\n\tscanf(\"%d\",&num_query);\n\n\tint command,loc;\n\tint current = 0;\n\n\tfor(int loop = 0; loop < num_query; loop++){\n\n\t\tscanf(\"%d %d\",&command,&loc);\n\t\tloc--;\n\t\tif(command == 1){\n\n\t\t\tcurrent = loc;\n\t\t\tif(!check[current]){\n\t\t\t\tdfs(current,-1);\n\t\t\t}\n\t\t}else{\n\n\t\t\tif(check[loc]){\n\n\t\t\t\tprintf(\"YES\\n\");\n\t\t\t}else{\n\n\t\t\t\tprintf(\"NO\\n\");\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":15720,"score_of_the_acc":-0.3053,"final_rank":2},{"submission_id":"aoj_3160_4959499","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 200005\n\n\nstruct GROUP{\n\tvector<int> nodes;\n};\n\nint N,E;\nGROUP group[SIZE]; //強連結成分のグループ\nvector<int> scc_G[SIZE];\nvector<int> reverse_scc_G[SIZE];\nstack<int> S;\n\nbool check[SIZE];\nint table[SIZE],in_num[SIZE];\nint boss[SIZE],height[SIZE];\nint group_index,global_index;\n\n\nvector<int> G[SIZE];\n\nbool visited[SIZE];\nint LEFT[SIZE],RIGHT[SIZE];\n\n\nvoid scc_dfs(int node_id){\n\tcheck[node_id] = true;\n\n\tfor(int i = 0; i < scc_G[node_id].size(); i++){\n\t\tif(!check[scc_G[node_id][i]])scc_dfs(scc_G[node_id][i]);\n\t}\n\tS.push(node_id);\n}\n\nvoid reverse_scc_dfs(int node_id){\n\tcheck[node_id] = true;\n\n\tgroup[group_index].nodes.push_back(node_id); //group[group_index]にノードを突っ込む\n\ttable[node_id] = group_index;\n\n\tfor(int i = 0; i < reverse_scc_G[node_id].size(); i++){\n\t\tif(!check[reverse_scc_G[node_id][i]])reverse_scc_dfs(reverse_scc_G[node_id][i]);\n\t}\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\nvoid euler_tour(int node_id,int pre){\n\tLEFT[node_id] = global_index++;\n\tvisited[node_id] = true;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next = G[node_id][i];\n\t\tif(next == pre)continue;\n\n\t\teuler_tour(next,node_id);\n\t}\n\tRIGHT[node_id] = global_index++;\n}\n\nint main(){\n\n\tscanf(\"%d %d\",&N,&E);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t}\n\n\tint from,to;\n\n\tfor(int i = 0; i < E; i++){\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\n\t\tscc_G[from].push_back(to);\n\t\treverse_scc_G[to].push_back(from);\n\t}\n\n\tfor(int i = 0; i < N; i++)check[i] = false;\n\n\t//まずは帰りがけ順を計算\n\tfor(int i = 0; i < N;i++){\n\t\tif(!check[i])scc_dfs(i);\n\t}\n\n\tfor(int i = 0; i < N;i++)check[i] = false;\n\tfor(int i = 0; i < SIZE; i++)group[i].nodes.clear();\n\n\tgroup_index = -1;\n\t//ノードを、帰りがけ順の逆順に、各強連結成分(グループ)に分解\n\twhile(!S.empty()){\n\t\tif(!check[S.top()]){\n\t\t\tgroup_index++;\n\n\t\t\treverse_scc_dfs(S.top());\n\t\t}\n\t\tS.pop();\n\t}\n\n\n\tfor(int i = 0; i <= group_index; i++){\n\t\tfor(int k = 0; k < group[i].nodes.size(); k++){\n\t\t\tfor(int p = 0; p < scc_G[group[i].nodes[k]].size(); p++){\n\t\t\t\tint next_group = table[scc_G[group[i].nodes[k]][p]];\n\t\t\t\tif(next_group != i){\n\t\t\t\t\tG[i].push_back(next_group);\n\t\t\t\t\tunite(i,next_group);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i <= group_index; i++){\n\t\tif(G[i].size() == 0)continue;\n\n\t\tsort(G[i].begin(),G[i].end());\n\t\tG[i].erase(unique(G[i].begin(),G[i].end()),G[i].end());\n\t}\n\n\tfor(int i = 0; i <= group_index; i++){\n\n\t\tvisited[i] = false;\n\t}\n\tfor(int i = 0; i <= group_index; i++){\n\t\tif(!visited[i]){\n\t\t\tglobal_index = 0;\n\t\t\teuler_tour(i,-1);\n\t\t}\n\t}\n\n\tint num_query;\n\tscanf(\"%d\",&num_query);\n\n\tint current = 0;\n\tint command,loc;\n\n\tfor(int loop = 0; loop < num_query; loop++){\n\n\t\tscanf(\"%d %d\",&command,&loc);\n\t\tloc--;\n\n\t\tif(command == 1){\n\n\t\t\tcurrent = loc;\n\n\t\t}else{\n\n\t\t\tint from_group = table[loc];\n\t\t\tint to_group = table[current];\n\n\t\t\tif(!isSame(from_group,to_group)){\n\n\t\t\t\tprintf(\"NO\\n\");\n\n\t\t\t}else{\n\n\t\t\t\tif(from_group == to_group){\n\n\t\t\t\t\tprintf(\"YES\\n\");\n\t\t\t\t}else{\n\n\t\t\t\t\tif(LEFT[from_group] < LEFT[to_group] && RIGHT[from_group] > RIGHT[to_group]){\n\n\t\t\t\t\t\tprintf(\"YES\\n\");\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tprintf(\"NO\\n\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":0.17073170731707318,"time_ms":60,"memory_kb":45564,"score_of_the_acc":-1.2222,"final_rank":17},{"submission_id":"aoj_3160_4893215","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing LL = long long int;\n#define incII(i, l, r) for(LL i = (l) ; i <= (r); i++)\n#define incIX(i, l, r) for(LL i = (l) ; i < (r); i++)\n#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)\n#define incXX(i, l, r) for(LL i = (l) + 1; i < (r); i++)\n#define decII(i, l, r) for(LL i = (r) ; i >= (l); i--)\n#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)\n#define decXI(i, l, r) for(LL i = (r) ; i > (l); i--)\n#define decXX(i, l, r) for(LL i = (r) - 1; i > (l); i--)\n#define inc(i, n) incIX(i, 0, n)\n#define dec(i, n) decIX(i, 0, n)\n#define inc1(i, n) incII(i, 1, n)\n#define dec1(i, n) decII(i, 1, n)\nauto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };\nauto inIX = [](auto x, auto l, auto r) { return (l <= x && x < r); };\nauto inXI = [](auto x, auto l, auto r) { return (l < x && x <= r); };\nauto inXX = [](auto x, auto l, auto r) { return (l < x && x < r); };\nauto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };\nauto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };\nauto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };\nauto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define MT make_tuple\n#define FI first\n#define SE second\n#define FR front()\n#define BA back()\n#define ALL(c) c.begin(), c.end()\n#define RALL(c) c.rbegin(), c.rend()\n#define RV(c) reverse(ALL(c))\n#define SC static_cast\n#define SI(c) SC<int>(c.size())\n#define SL(c) SC<LL >(c.size())\n#define RF(e, c) for(auto & e: c)\n#define SF(c, ...) for(auto & [__VA_ARGS__]: c)\n#define until(e) while(! (e))\n#define if_not(e) if(! (e))\n#define ef else if\n#define UR assert(false)\nauto * IS = & cin;\nauto * OS = & cout;\narray<string, 3> SEQ = { \"\", \" \", \"\" };\n// input\ntemplate<typename T> T in() { T a; (* IS) >> a; return a; }\n// input: tuple\ntemplate<int I, typename U> void tin_(istream & is, U & t) {\n\tif constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }\n}\ntemplate<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }\ntemplate<typename ... T> auto tin() { return in<tuple<T ...>>(); }\n// input: array\ntemplate<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }\ntemplate<typename T, size_t N> auto ain() { return in<array<T, N>>(); }\n// input: multi-dimensional vector\ntemplate<typename T> T vin() { T v; (* IS) >> v; return v; }\ntemplate<typename T, typename N, typename ... M> auto vin(N n, M ... m) {\n\tvector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;\n}\n// input: multi-column (tuple<vector>)\ntemplate<typename U, int I> void colin_([[maybe_unused]] U & t) { }\ntemplate<typename U, int I, typename A, typename ... B> void colin_(U & t) {\n\tget<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);\n}\ntemplate<typename ... T> auto colin(int n) {\n\ttuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;\n}\n// output\nvoid out_([[maybe_unused]] string s) { }\ntemplate<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }\ntemplate<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }\nauto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };\nauto out = [](auto ... a) { outF(\"\", \" \" , \"\\n\", a ...); };\nauto outS = [](auto ... a) { outF(\"\", \" \" , \" \" , a ...); };\nauto outL = [](auto ... a) { outF(\"\", \"\\n\", \"\\n\", a ...); };\nauto outN = [](auto ... a) { outF(\"\", \"\" , \"\" , a ...); };\n// output: multi-dimensional vector\ntemplate<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {\n\tos << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? \"\" : SEQ[1]) << v[i]; } return (os << SEQ[2]);\n}\ntemplate<typename T> void vout_(T && v) { (* OS) << v; }\ntemplate<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {\n\tinc(i, SI(v)) { (* OS) << (i == 0 ? \"\" : a); vout_(v[i], b ...); }\n}\ntemplate<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }\ntemplate<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << flush; }\n\n// ---- ----\n\nint main() {\n\tauto [n, m] = ain<int, 2>();\n\tvector<vector<int>> g(n);\n\tinc(i, m) {\n\t\tauto [a, b] = ain<int, 2>();\n\t\ta--; b--;\n\t\tg[b].PB(a);\n\t}\n\t\n\tvector<bool> r(n, false);\n\tfunction<void(int)> dfs = [&](int v) {\n\t\tif(r[v]) { return; }\n\t\tr[v] = true;\n\t\tRF(e, g[v]) { dfs(e); }\n\t};\n\tdfs(0);\n\t\n\tvector<string> ans;\n\tauto Q = in<int>();\n\tinc(q, Q) {\n\t\tauto [x, y] = ain<int, 2>();\n\t\ty--;\n\t\tif(x == 1) {\n\t\t\tdfs(y);\n\t\t} else {\n\t\t\tans.PB(r[y] ? \"YES\" : \"NO\");\n\t\t}\n\t}\n\tvout(ans, \"\\n\");\n}","accuracy":1,"time_ms":90,"memory_kb":19012,"score_of_the_acc":-0.672,"final_rank":8},{"submission_id":"aoj_3160_4893208","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing LL = long long int;\n#define incII(i, l, r) for(LL i = (l) ; i <= (r); i++)\n#define incIX(i, l, r) for(LL i = (l) ; i < (r); i++)\n#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)\n#define incXX(i, l, r) for(LL i = (l) + 1; i < (r); i++)\n#define decII(i, l, r) for(LL i = (r) ; i >= (l); i--)\n#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)\n#define decXI(i, l, r) for(LL i = (r) ; i > (l); i--)\n#define decXX(i, l, r) for(LL i = (r) - 1; i > (l); i--)\n#define inc(i, n) incIX(i, 0, n)\n#define dec(i, n) decIX(i, 0, n)\n#define inc1(i, n) incII(i, 1, n)\n#define dec1(i, n) decII(i, 1, n)\nauto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };\nauto inIX = [](auto x, auto l, auto r) { return (l <= x && x < r); };\nauto inXI = [](auto x, auto l, auto r) { return (l < x && x <= r); };\nauto inXX = [](auto x, auto l, auto r) { return (l < x && x < r); };\nauto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };\nauto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };\nauto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };\nauto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define MT make_tuple\n#define FI first\n#define SE second\n#define FR front()\n#define BA back()\n#define ALL(c) c.begin(), c.end()\n#define RALL(c) c.rbegin(), c.rend()\n#define RV(c) reverse(ALL(c))\n#define SC static_cast\n#define SI(c) SC<int>(c.size())\n#define SL(c) SC<LL >(c.size())\n#define RF(e, c) for(auto & e: c)\n#define SF(c, ...) for(auto & [__VA_ARGS__]: c)\n#define until(e) while(! (e))\n#define if_not(e) if(! (e))\n#define ef else if\n#define UR assert(false)\nauto * IS = & cin;\nauto * OS = & cout;\narray<string, 3> SEQ = { \"\", \" \", \"\" };\n// input\ntemplate<typename T> T in() { T a; (* IS) >> a; return a; }\n// input: tuple\ntemplate<int I, typename U> void tin_(istream & is, U & t) {\n\tif constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }\n}\ntemplate<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }\ntemplate<typename ... T> auto tin() { return in<tuple<T ...>>(); }\n// input: array\ntemplate<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }\ntemplate<typename T, size_t N> auto ain() { return in<array<T, N>>(); }\n// input: multi-dimensional vector\ntemplate<typename T> T vin() { T v; (* IS) >> v; return v; }\ntemplate<typename T, typename N, typename ... M> auto vin(N n, M ... m) {\n\tvector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;\n}\n// input: multi-column (tuple<vector>)\ntemplate<typename U, int I> void colin_([[maybe_unused]] U & t) { }\ntemplate<typename U, int I, typename A, typename ... B> void colin_(U & t) {\n\tget<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);\n}\ntemplate<typename ... T> auto colin(int n) {\n\ttuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;\n}\n// output\nvoid out_([[maybe_unused]] string s) { }\ntemplate<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }\ntemplate<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }\nauto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };\nauto out = [](auto ... a) { outF(\"\", \" \" , \"\\n\", a ...); };\nauto outS = [](auto ... a) { outF(\"\", \" \" , \" \" , a ...); };\nauto outL = [](auto ... a) { outF(\"\", \"\\n\", \"\\n\", a ...); };\nauto outN = [](auto ... a) { outF(\"\", \"\" , \"\" , a ...); };\n// output: multi-dimensional vector\ntemplate<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {\n\tos << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? \"\" : SEQ[1]) << v[i]; } return (os << SEQ[2]);\n}\ntemplate<typename T> void vout_(T && v) { (* OS) << v; }\ntemplate<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {\n\tinc(i, SI(v)) { (* OS) << (i == 0 ? \"\" : a); vout_(v[i], b ...); }\n}\ntemplate<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }\ntemplate<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << flush; }\n\n// ---- ----\n\nint main() {\n\tauto [n, m] = ain<int, 2>();\n\tvector<vector<int>> g(n);\n\tinc(i, m) {\n\t\tauto [a, b] = ain<int, 2>();\n\t\ta--; b--;\n\t\tg[b].PB(a);\n\t}\n\t\n\tvector<bool> r(n, false);\n\tr[0] = true;\n\tfunction<void(int)> dfs = [&](int v) {\n\t\tif(r[v]) { return; }\n\t\tr[v] = true;\n\t\tRF(e, g[v]) { dfs(e); }\n\t};\n\t\n\tvector<string> ans;\n\tauto Q = in<int>();\n\tinc(q, Q) {\n\t\tauto [x, y] = ain<int, 2>();\n\t\ty--;\n\t\tif(x == 1) {\n\t\t\tdfs(y);\n\t\t} else {\n\t\t\tans.PB(r[y] ? \"YES\" : \"NO\");\n\t\t}\n\t}\n\tvout(ans, \"\\n\");\n}","accuracy":0.14634146341463414,"time_ms":60,"memory_kb":8528,"score_of_the_acc":-0.2222,"final_rank":20},{"submission_id":"aoj_3160_4880238","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\nstruct SCC {\n int V;\n vector<vector<int>> G, rG;\n vector<int> vs; // 帰りがけ順の並び\n vector<int> cmp; //属する強連結成分トポロジカル順序\n vector<bool> used;\n\n SCC() {}\n SCC(int n) {\n V = n;\n G = vector<vector<int>>(n);\n rG = vector<vector<int>>(n);\n }\n\n void add_edge(int from, int to) {\n G[from].push_back(to);\n rG[to].push_back(from);\n }\n\n void dfs(int v) {\n used[v] = true;\n rep(i, G[v].size()) if (!used[G[v][i]]) dfs(G[v][i]);\n vs.push_back(v);\n }\n\n void rdfs(int v, int k) {\n used[v] = true;\n cmp[v] = k;\n rep(i, rG[v].size()) if (!used[rG[v][i]]) rdfs(rG[v][i], k);\n }\n\n int scc() {\n used = vector<bool>(V, false);\n vs.clear();\n rep(i, V) if (!used[i]) dfs(i);\n\n used = vector<bool>(V, false);\n cmp = vector<int>(V);\n int num_scc = 0;\n for (int i = vs.size() - 1; i >= 0; --i)\n if (!used[vs[i]]) rdfs(vs[i], num_scc++);\n return num_scc;\n }\n};\n\nint main() {\n int n, m;\n cin >> n >> m;\n\n SCC s(n);\n\n vector<int> a(m), b(m);\n rep(i, m) {\n cin >> a[i] >> b[i];\n --a[i];\n --b[i];\n s.add_edge(a[i], b[i]);\n }\n\n const int V = s.scc();\n vector<vector<int>> rG(V);\n rep(i, m) {\n int u = s.cmp[a[i]], v = s.cmp[b[i]];\n if (u != v) rG[v].pb(u);\n }\n\n vector<bool> vis(V);\n auto MOVE = [&](int x) {\n if (vis[x]) return;\n vis[x] = true;\n queue<int> que({x});\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (int e : rG[v])\n if (!vis[e]) {\n vis[e] = true;\n que.push(e);\n }\n }\n };\n\n MOVE(s.cmp[0]);\n\n int q;\n cin >> q;\n rep(qi, q) {\n int x, y;\n cin >> x >> y;\n --y;\n if (x == 1)\n MOVE(s.cmp[y]);\n else\n cout << (vis[s.cmp[y]] ? \"YES\" : \"NO\") << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":34960,"score_of_the_acc":-1.7137,"final_rank":15},{"submission_id":"aoj_3160_4861053","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint n, m, q;\nvector<vector<int>> g, rg;\nvector<bool> reachable;\n\nvoid update(int x);\n\nint main() {\n cin >> n >> m;\n g.resize(n);\n rg.resize(n);\n for (int i = 0; i < m; ++i) {\n int a, b;\n cin >> a >> b;\n g[--a].push_back(--b);\n rg[b].push_back(a);\n }\n reachable.assign(n, 0);\n update(0);\n cin >> q;\n while (q--) {\n int x, y;\n cin >> x >> y;\n --x, --y;\n if (x)\n cout << (reachable[y] ? \"YES\" : \"NO\") << endl;\n else\n update(y);\n }\n return 0;\n}\n\nvoid update(int x) {\n queue<int> qu;\n qu.push(x);\n if (reachable[x]) return;\n reachable[x] = 1;\n while (qu.size()) {\n int now = qu.front();\n qu.pop();\n reachable[now] = 1;\n for (auto to : rg[now])\n if (!reachable[to]) {\n reachable[to] = 1;\n qu.push(to);\n }\n }\n}","accuracy":1,"time_ms":140,"memory_kb":21480,"score_of_the_acc":-1.0164,"final_rank":12},{"submission_id":"aoj_3160_4850124","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n//----------------------- Print Function ----------------------//\n\ninline void print() {\n cout << '\\n';\n}\ntemplate <typename First, typename... Rest>\nvoid print(const First &first, const Rest &... rest) {\n cout << first << ' ';\n print(rest...);\n}\n\ntemplate <typename T>\nvoid print(const T &a) {\n for (auto e : a) cout << e << ' ';\n cout << '\\n';\n}\n\n//------------------------- Libraries -------------------------//\n\n//--------------------------- Solve ---------------------------//\n\nusing Graph = vector<vector<int> >;\n\nint N, M;\nvector<bool> reach;\nGraph g;\n\nvoid dfs(int v) {\n reach[v] = true;\n for (int e : g[v]) {\n if (!reach[e]) dfs(e);\n }\n}\n\nvoid solve() {\n cin >> N >> M;\n g.resize(N);\n reach.resize(N);\n for (int i = 0; i < M; i++) {\n int a, b; cin >> a >> b;\n a--; b--;\n g[b].push_back(a);\n }\n\n reach[0] = true;\n dfs(0);\n\n int Q; cin >> Q;\n while (Q--) {\n int x, y; cin >> x >> y;\n y--;\n if (x == 1) {\n if (!reach[y]) dfs(y);\n }\n else if (x == 2) {\n if (reach[y]) cout << \"YES\" << '\\n';\n else cout << \"NO\" << '\\n';\n }\n }\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":12296,"score_of_the_acc":-0.1573,"final_rank":1},{"submission_id":"aoj_3160_4850121","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n//----------------------- Print Function ----------------------//\n\ninline void print() {\n cout << '\\n';\n}\ntemplate <typename First, typename... Rest>\nvoid print(const First &first, const Rest &... rest) {\n cout << first << ' ';\n print(rest...);\n}\n\ntemplate <typename T>\nvoid print(const T &a) {\n for (auto e : a) cout << e << ' ';\n cout << '\\n';\n}\n\n//------------------------- Libraries -------------------------//\n\n//--------------------------- Solve ---------------------------//\n\nusing Graph = vector<vector<int> >;\n\nint N, M;\nvector<bool> reach;\nGraph g;\n\nvoid dfs(int v) {\n if (reach[v]) return;\n reach[v] = true;\n for (int e : g[v]) {\n if (!reach[e]) dfs(e);\n }\n}\n\nvoid solve() {\n cin >> N >> M;\n g.resize(N);\n reach.resize(N);\n for (int i = 0; i < M; i++) {\n int a, b; cin >> a >> b;\n a--; b--;\n g[b].push_back(a);\n }\n\n reach[0] = true;\n dfs(0);\n \n int Q; cin >> Q;\n while (Q--) {\n int x, y; cin >> x >> y;\n y--;\n if (x == 1) {\n dfs(y);\n }\n else if (x == 2) {\n if (reach[y]) cout << \"YES\" << '\\n';\n else cout << \"NO\" << '\\n';\n }\n }\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":0.14634146341463414,"time_ms":20,"memory_kb":8696,"score_of_the_acc":-0.0045,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_3160_10497568\",\n \"code_snippet\": \"#include <bits/extc++.h>\\n\\nusing namespace std;\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n vector<pair<int, int>> AB(M);\\n \\n vector<vector<int>> nanachi(N), rev(N);\\n \\n for (int i = 0 ; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n a--, b--;\\n AB[i] = {a, b};\\n nanachi[a].push_back(b);\\n rev[b].push_back(a);\\n }\\n \\n vector<bool> ok(N);\\n \\n ok[0] = true;\\n \\n queue<int> que;\\n \\n que.push(0);\\n \\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n \\n for (int w : rev[v]) {\\n if (ok[w]) continue;\\n ok[w] = true;\\n que.push(w);\\n }\\n }\\n \\n int Q;\\n cin >> Q;\\n \\n while (Q--) {\\n int t, x;\\n cin >> t >> x;\\n x--;\\n \\n if (t == 1) {\\n if (ok[x]) continue;\\n \\n ok[x] = true;\\n \\n queue<int> que;\\n \\n que.push(x);\\n \\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n \\n for (int w : rev[v]) {\\n if (ok[w]) continue;\\n ok[w] = true;\\n que.push(w);\\n }\\n }\\n } else {\\n if (ok[x]) {\\n cout << \\\"YES\\\\n\\\";\\n } else {\\n cout << \\\"NO\\\\n\\\";\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 23440,\n \"score_of_the_acc\": -0.8471,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3160_10497514\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, a, b) for (ll i = a; i < b; i++)\\nconst int INF = (1 << 29);\\n\\nint main(){\\n int N, M;\\n cin >> N >> M;\\n vector<vector<int>> G(N);\\n rep(i, 0, M){\\n int a, b;\\n cin >> a >> b;\\n a--, b--;\\n G[b].push_back(a);\\n }\\n int Q;\\n cin >> Q;\\n vector<int> seen(N);\\n auto upd = [&](int a) -> void {\\n if (seen[a]) return;\\n vector<int> order = {a};\\n seen[a] = 1;\\n rep(rp, 0, order.size()){\\n int b = order[rp];\\n for (auto x : G[b]) if (seen[x] == 0){\\n seen[x] = 1;\\n order.push_back(x);\\n }\\n }\\n };\\n upd(0);\\n while (Q--){\\n int X, Y;\\n cin >> X >> Y;\\n Y--;\\n if (X == 1) upd(Y);\\n else cout << (seen[Y] ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\");\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 13684,\n \"score_of_the_acc\": -0.7503,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3160_10495082\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)\\nusing namespace std;\\nusing ll = long long;\\n\\nbool chmin(auto &a, auto b){ return a > b ? a = b, 1 : 0; }\\nbool chmax(auto &a, auto b){ return a < b ? a = b, 1 : 0; }\\n\\nconst ll linf = 1e18;\\n\\nvoid solve(){\\n int n, m; cin >> n >> m;\\n vector<vector<int>> g(n);\\n rep(i,0,m){\\n int u, v; cin >> u >> v; u--, v--;\\n g[v].emplace_back(u);\\n }\\n vector<bool> done(n,false);\\n auto proc = [&](int start){\\n if (done[start]) return ;\\n queue<int> que;\\n que.push(start);\\n done[start] = true;\\n while (!que.empty()){\\n int v = que.front(); que.pop();\\n for (int u : g[v]){\\n if (done[u]) continue;\\n que.push(u);\\n done[u] = true;\\n }\\n }\\n };\\n proc(0);\\n int q; cin >> q;\\n while (q--){\\n int t, v; cin >> t >> v; v--;\\n if (t == 1){\\n proc(v);\\n }\\n else {\\n cout << (done[v] ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n';\\n }\\n }\\n}\\n\\nint main(){\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 12704,\n \"score_of_the_acc\": -0.5016,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3160_10489273\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)\\n#define all(v) begin(v),end(v)\\nusing namespace std;\\nusing ll = long long;\\n\\n\\nvoid solve(){\\n int n, m; cin >> n >> m;\\n vector<vector<int>> g(n);\\n rep(i,0,m){\\n int u, v; cin >> u >> v; u--, v--;\\n g[v].emplace_back(u);\\n }\\n vector<bool> done(n,false);\\n auto vis = [&](int s){\\n if (done[s]) return ;\\n queue<int> que;\\n que.push(s);\\n done[s] = true;\\n while (!que.empty()){\\n int v = que.front(); que.pop();\\n for (int u : g[v]){\\n if (!done[u]){\\n done[u] = true;\\n que.push(u);\\n }\\n }\\n }\\n };\\n int s = 0;\\n vis(s);\\n int q; cin >> q;\\n while (q--){\\n int t; cin >> t;\\n if (t == 1){\\n int v; cin >> v; v--;\\n s = v;\\n vis(s);\\n }\\n else if (t == 2){\\n int v; cin >> v; v--;\\n cout << (done[v] ? \\\"YES\\\" : \\\"NO\\\") << endl;\\n }\\n }\\n}\\n\\nint main(){\\n int t = 1; //cin >> t;\\n while (t--){\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 12704,\n \"score_of_the_acc\": -0.5016,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3160_10489254\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)\\n#define all(v) begin(v),end(v)\\nusing namespace std;\\nusing ll = long long;\\n\\n\\nvoid solve(){\\n int n, m; cin >> n >> m;\\n vector<vector<int>> g(n);\\n rep(i,0,m){\\n int u, v; cin >> u >> v; u--, v--;\\n g[v].emplace_back(u);\\n }\\n vector<bool> done(n,false);\\n auto vis = [&](int s){\\n if (done[s]) return ;\\n queue<int> que;\\n que.push(s);\\n done[s] = true;\\n while (!que.empty()){\\n int v = que.front(); que.pop();\\n for (int u : g[v]){\\n if (!done[u]){\\n done[u] = true;\\n que.push(u);\\n }\\n }\\n }\\n };\\n int s = 0;\\n done[s] = true;\\n int q; cin >> q;\\n while (q--){\\n int t; cin >> t;\\n if (t == 1){\\n int v; cin >> v; v--;\\n s = v;\\n vis(s);\\n }\\n else if (t == 2){\\n int v; cin >> v; v--;\\n cout << (done[v] ? \\\"YES\\\" : \\\"NO\\\") << endl;\\n }\\n }\\n}\\n\\nint main(){\\n int t = 1; //cin >> t;\\n while (t--){\\n solve();\\n }\\n}\",\n \"accuracy\": 0.14634146341463414,\n \"time_ms\": 40,\n \"memory_kb\": 9248,\n \"score_of_the_acc\": -0.1306,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3160_10199101\",\n \"code_snippet\": \"// AOJ #3160\\n// Meet on the Island 2025.2.6\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n \\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n \\n int N, M;\\n cin >> N >> M;\\n // 逆グラフを作成：原グラフで A -> B なら，逆グラフでは B -> A\\n vector<vector<int>> rev(N+1);\\n for(int i = 0; i < M; i++){\\n int A, B;\\n cin >> A >> B;\\n rev[B].push_back(A);\\n }\\n \\n int Q;\\n cin >> Q;\\n \\n // やまだくんの現在位置．初期は1．\\n int current = 1;\\n // canMeet[x] = true なら，原グラフで x から現在の島にたどり着ける\\n vector<bool> canMeet(N+1, false);\\n \\n // 初期状態：現在の島が1なので，逆グラフで1からたどれる頂点が集合 S(1)\\n {\\n queue<int> qu;\\n qu.push(1);\\n canMeet[1] = true;\\n while(!qu.empty()){\\n int cur = qu.front();\\n qu.pop();\\n for(auto nxt : rev[cur]){\\n if(!canMeet[nxt]){\\n canMeet[nxt] = true;\\n qu.push(nxt);\\n }\\n }\\n }\\n }\\n \\n // 各クエリの処理\\n for(int i = 0; i < Q; i++){\\n int type, Y;\\n cin >> type >> Y;\\n if(type == 1){\\n // クエリ1：移動\\n current = Y;\\n // モノトニシティの性質により，\\n // S(Y) = { x: x -> Y (原グラフ) } は既に global に含まれている S(current) の部分集合に含まれていなければ，追加する\\n if(!canMeet[Y]){\\n queue<int> qu;\\n qu.push(Y);\\n canMeet[Y] = true;\\n while(!qu.empty()){\\n int cur = qu.front();\\n qu.pop();\\n for(auto nxt : rev[cur]){\\n if(!canMeet[nxt]){\\n canMeet[nxt] = true;\\n qu.push(nxt);\\n }\\n }\\n }\\n }\\n } else if(type == 2){\\n cout << (canMeet[Y] ? \\\"YES\\\" : \\\"NO\\\") << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 12452,\n \"score_of_the_acc\": -0.4948,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3160_10091982\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <iostream>\\n#include <vector>\\n/**\\n * @brief 重み付きグラフ\\n *\\n * @tparam T 辺の重みの型\\n */\\ntemplate <class T>\\nstruct Graph {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to(), _weight() {}\\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr T weight() const { return _weight; }\\n private:\\n int _from, _to;\\n T _weight;\\n };\\n public:\\n using edge_type = typename Graph<T>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\\n void add_edges(int from, int to, T weight = T(1)) {\\n edges[from].emplace_back(from, to, weight);\\n edges[to].emplace_back(to, from, weight);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edge(from - base, to - base, weight);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edges(from - base, to - base, weight);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\ntemplate <>\\nstruct Graph<void> {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to() {}\\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr int weight() const { return 1; }\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n private:\\n int _from, _to;\\n };\\n public:\\n using edge_type = typename Graph<void>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\\n void add_edges(int from, int to) {\\n edges[from].emplace_back(from, to);\\n edges[to].emplace_back(to, from);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edge(from - base, to - base);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edges(from - base, to - base);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nint main(void) {\\n int n, m;\\n cin >> n >> m;\\n Graph<void> g(n);\\n rep (i, m) {\\n int a, b;\\n cin >> a >> b;\\n g.add_edge(b - 1, a - 1);\\n }\\n vector<bool> visit(n);\\n auto dfs = [&](auto self, int x) {\\n if (visit[x])\\n return;\\n visit[x] = true;\\n for (auto e : g[x]) self(self, e.to());\\n };\\n dfs(dfs, 0);\\n int q;\\n cin >> q;\\n rep (i, q) {\\n int x, y;\\n cin >> x >> y;\\n if (x == 1) {\\n dfs(dfs, y - 1);\\n } else {\\n YES(visit[y - 1]);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 16544,\n \"score_of_the_acc\": -0.3275,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3160_7009659\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3160.cc: Problem J: Meet on the Island\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<stack>\\n#include<queue>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 200000;\\n\\n/* typedef */\\n\\ntypedef queue<int> qi;\\ntypedef vector<int> vi;\\ntypedef vector<bool> vb;\\ntypedef vector<vi> vvi;\\ntypedef stack<int> si;\\n\\n/* global variables */\\n\\nvi nbrs[MAX_N], gnbrs[MAX_N];\\nint gids[MAX_N];\\nbool used[MAX_N];\\n\\n/* subroutines */\\n\\nvoid scc_visit(const vi *nbrs, int v, vvi& scc,\\n\\t si& S, vb &inS, vi& low, vi& num, int& time) {\\n low[v] = num[v] = ++time;\\n S.push(v);\\n inS[v] = true;\\n\\n const vi& nbrv = nbrs[v];\\n for (vi::const_iterator vit = nbrv.begin(); vit != nbrv.end(); vit++) {\\n const int& w = *vit;\\n if (num[w] == 0) {\\n scc_visit(nbrs, w, scc, S, inS, low, num, time);\\n low[v] = min(low[v], low[w]);\\n }\\n else if (inS[w])\\n low[v] = min(low[v], num[w]);\\n }\\n\\n if (low[v] == num[v]) {\\n scc.push_back(vi());\\n for (;;) {\\n int w = S.top(); S.pop();\\n inS[w] = false;\\n scc.back().push_back(w);\\n if (v == w) break;\\n }\\n }\\n}\\n\\nvoid calc_scc(const int n, const vi *nbrs, vvi& scc) {\\n vi num(n), low(n);\\n si S;\\n vb inS(n);\\n int time = 0;\\n\\n for (int u = 0; u < n; u++)\\n if (num[u] == 0)\\n scc_visit(nbrs, u, scc, S, inS, low, num, time);\\n}\\n\\nvoid traceback(int st) {\\n if (used[st]) return;\\n\\n used[st] = true;\\n qi q;\\n q.push(st);\\n\\n while (! q.empty()) {\\n int u = q.front(); q.pop();\\n for (auto v: gnbrs[u])\\n if (! used[v]) {\\n\\tused[v] = true;\\n\\tq.push(v);\\n }\\n }\\n}\\n\\n/* main */\\n\\nint main() {\\n int n, m;\\n scanf(\\\"%d%d\\\", &n, &m);\\n\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n scanf(\\\"%d%d\\\", &u, &v);\\n u--, v--;\\n nbrs[u].push_back(v);\\n }\\n\\n vvi scc;\\n calc_scc(n, nbrs, scc);\\n\\n int gn = scc.size();\\n for (int i = 0; i < gn; i++)\\n for (auto u: scc[i]) gids[u] = i;\\n\\n for (int u = 0; u < n; u++) {\\n int gu = gids[u];\\n for (auto v: nbrs[u]) {\\n int gv = gids[v];\\n if (gu != gv) gnbrs[gv].push_back(gu);\\n }\\n }\\n\\n int cu = gids[0];\\n traceback(cu);\\n\\n int qn;\\n scanf(\\\"%d\\\", &qn);\\n\\n while (qn--) {\\n int x, y;\\n scanf(\\\"%d%d\\\", &x, &y), y--;\\n\\n if (x == 1) {\\n cu = gids[y];\\n traceback(cu);\\n //for (int i = 0; i < gn; i++) printf(\\\"%d\\\", used[i]); putchar('\\\\n');\\n }\\n else {\\n if (used[gids[y]]) puts(\\\"YES\\\");\\n else puts(\\\"NO\\\");\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 43112,\n \"score_of_the_acc\": -1.1005,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3160_7009645\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3160.cc: Problem J: Meet on the Island\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<set>\\n#include<stack>\\n#include<queue>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 200000;\\n\\n/* typedef */\\n\\ntypedef queue<int> qi;\\ntypedef vector<int> vi;\\ntypedef vector<bool> vb;\\ntypedef vector<vi> vvi;\\ntypedef stack<int> si;\\ntypedef set<int> seti;\\n\\n/* global variables */\\n\\nvi nbrs[MAX_N], gnbrs[MAX_N];\\nint gids[MAX_N];\\nbool used[MAX_N];\\n\\n/* subroutines */\\n\\nvoid scc_visit(const vi *nbrs, int v, vvi& scc,\\n\\t si& S, vb &inS, vi& low, vi& num, int& time) {\\n low[v] = num[v] = ++time;\\n S.push(v);\\n inS[v] = true;\\n\\n const vi& nbrv = nbrs[v];\\n for (vi::const_iterator vit = nbrv.begin(); vit != nbrv.end(); vit++) {\\n const int& w = *vit;\\n if (num[w] == 0) {\\n scc_visit(nbrs, w, scc, S, inS, low, num, time);\\n low[v] = min(low[v], low[w]);\\n }\\n else if (inS[w])\\n low[v] = min(low[v], num[w]);\\n }\\n\\n if (low[v] == num[v]) {\\n scc.push_back(vi());\\n for (;;) {\\n int w = S.top(); S.pop();\\n inS[w] = false;\\n scc.back().push_back(w);\\n if (v == w) break;\\n }\\n }\\n}\\n\\nvoid calc_scc(const int n, const vi *nbrs, vvi& scc) {\\n vi num(n), low(n);\\n si S;\\n vb inS(n);\\n int time = 0;\\n\\n for (int u = 0; u < n; u++)\\n if (num[u] == 0)\\n scc_visit(nbrs, u, scc, S, inS, low, num, time);\\n}\\n\\nvoid traceback(int st, seti &ts) {\\n if (used[st]) return;\\n\\n used[st] = true, ts.insert(st);\\n qi q;\\n q.push(st);\\n\\n while (! q.empty()) {\\n int u = q.front(); q.pop();\\n for (auto v: nbrs[u])\\n if (! used[v]) {\\n\\tused[v] = true, ts.insert(v);\\n\\tq.push(v);\\n }\\n }\\n}\\n\\n/* main */\\n\\nint main() {\\n int n, m;\\n scanf(\\\"%d%d\\\", &n, &m);\\n\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n scanf(\\\"%d%d\\\", &u, &v);\\n u--, v--;\\n nbrs[u].push_back(v);\\n }\\n\\n vvi scc;\\n calc_scc(n, nbrs, scc);\\n\\n int gn = scc.size();\\n for (int i = 0; i < gn; i++)\\n for (auto u: scc[i]) gids[u] = i;\\n\\n for (int u = 0; u < n; u++) {\\n int gu = gids[u];\\n for (auto v: nbrs[u]) {\\n int gv = gids[v];\\n if (gu != gv) gnbrs[gv].push_back(gu);\\n }\\n }\\n\\n seti ts;\\n int cu = gids[0];\\n traceback(cu, ts);\\n\\n int qn;\\n scanf(\\\"%d\\\", &qn);\\n\\n while (qn--) {\\n int x, y;\\n scanf(\\\"%d%d\\\", &x, &y), y--;\\n\\n if (x == 1) {\\n cu = gids[y];\\n traceback(cu, ts);\\n }\\n else {\\n if (ts.find(gids[y]) != ts.end()) puts(\\\"YES\\\");\\n else puts(\\\"NO\\\");\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.17073170731707318,\n \"time_ms\": 40,\n \"memory_kb\": 31616,\n \"score_of_the_acc\": -0.7345,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3160_6304577\",\n \"code_snippet\": \"#include <iostream>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <set>\\n#include <vector>\\n#include <numeric>\\n#include <algorithm>\\n#include <queue>\\n#include <string>\\n#include <random>\\n#include <array>\\n#include <climits>\\n#include <map>\\n#include <cassert>\\n#include <stack>\\n#include <iomanip>\\n#include <cfloat>\\n#include <fstream>\\nstd::vector<int> calc_dag(const std::vector<std::vector<int>>& nodes) {\\n\\tconst int n = nodes.size();\\n\\tstd::vector<int> out_time(n, -1), indices; indices.reserve(n);\\n\\tstd::stack<int> stack;\\n\\tfor (auto root = 0; root < n; ++root) {\\n\\t\\tif (out_time[root] != -1) continue;\\n\\t\\tstack.push(root);\\n\\t\\twhile (!stack.empty()) {\\n\\t\\t\\tconst auto top = stack.top(); stack.pop();\\n\\t\\t\\tif (top >= 0) {\\n\\t\\t\\t\\tif (out_time[top] != -1) continue;\\n\\t\\t\\t\\tout_time[top] = 0;\\n\\t\\t\\t\\tstack.push(-1 - top);\\n\\t\\t\\t\\tfor (const auto next : nodes[top]) {\\n\\t\\t\\t\\t\\tif (out_time[next] != -1) continue;\\n\\t\\t\\t\\t\\tstack.push(next);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tindices.push_back(-1 - top);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstd::reverse(indices.begin(), indices.end());\\n\\tstd::vector<std::vector<int>> reverse(nodes.size());\\n\\tfor (auto from = 0; from < nodes.size(); ++from) {\\n\\t\\tfor (const auto to : nodes[from]) {\\n\\t\\t\\treverse[to].push_back(from);\\n\\t\\t}\\n\\t}\\n\\tstd::fill(out_time.begin(), out_time.end(), -1);\\n\\tint time = 0;\\n\\tfor (const auto root : indices) {\\n\\t\\tif (out_time[root] != -1) continue;\\n\\t\\tout_time[root] = time;\\n\\t\\tstack.push(root);\\n\\t\\twhile (!stack.empty()) {\\n\\t\\t\\tconst auto top = stack.top(); stack.pop();\\n\\t\\t\\tfor (const auto next : reverse[top]) {\\n\\t\\t\\t\\tif (out_time[next] != -1) continue;\\n\\t\\t\\t\\tout_time[next] = time;\\n\\t\\t\\t\\tstack.push(next);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t++time;\\n\\t}\\n\\treturn out_time;\\n}\\nint main() {\\n\\tint n, m; std::cin >> n >> m;\\n\\tstd::vector<std::pair<int, int>> edges(m);\\n\\tfor (auto& [s, t] : edges) {\\n\\t\\tstd::cin >> s >> t; --s; --t;\\n\\t}\\n\\tint q; std::cin >> q;\\n\\tstd::vector<std::pair<int, int>> queries(q);\\n\\tfor (auto& [x, y] : queries) {\\n\\t\\tstd::cin >> x >> y; --y;\\n\\t}\\n\\tstd::vector<std::vector<int>> graph(n);\\n\\tfor (const auto [s, t] : edges) {\\n\\t\\tgraph[s].push_back(t);\\n\\t}\\n\\tconst auto dag = calc_dag(graph);\\n\\tstd::vector<std::vector<int>> dag_rev_graph(n);\\n\\tfor (const auto [s, t] : edges) {\\n\\t\\tdag_rev_graph[dag[t]].push_back(dag[s]);\\n\\t}\\n\\tstd::vector<bool> can_reach(n, false);\\n\\tstd::queue<int> queue;\\n\\tcan_reach[dag[0]] = true;\\n\\tqueue.push(dag[0]);\\n\\twhile (!queue.empty()) {\\n\\t\\tconst auto top = queue.front(); queue.pop();\\n\\t\\tfor (const auto prev : dag_rev_graph[top]) {\\n\\t\\t\\tif (can_reach[prev]) continue;\\n\\t\\t\\tcan_reach[prev] = true;\\n\\t\\t\\tqueue.push(prev);\\n\\t\\t}\\n\\t}\\n\\tfor (const auto [x, y] : queries) {\\n\\t\\tif (x == 1) {\\n\\t\\t\\tif (can_reach[dag[y]]) continue;\\n\\t\\t\\tcan_reach[dag[y]] = true;\\n\\t\\t\\tqueue.push(dag[y]);\\n\\t\\t\\twhile (!queue.empty()) {\\n\\t\\t\\t\\tconst auto top = queue.front(); queue.pop();\\n\\t\\t\\t\\tfor (const auto prev : dag_rev_graph[top]) {\\n\\t\\t\\t\\t\\tif (can_reach[prev]) continue;\\n\\t\\t\\t\\t\\tcan_reach[prev] = true;\\n\\t\\t\\t\\t\\tqueue.push(prev);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (can_reach[dag[y]]) {\\n\\t\\t\\t\\tstd::cout << \\\"YES\\\\n\\\";\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tstd::cout << \\\"NO\\\\n\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 25520,\n \"score_of_the_acc\": -0.9032,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3160_5675914\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\nint main(){\\n int N, M;\\n scanf(\\\"%d %d\\\", &N, &M);\\n vector<vector<int>> G(N);\\n vector<vector<int>> to(N), from(N);\\n for(int i = 0; i < M; i++){\\n int a, b;\\n scanf(\\\"%d %d\\\", &a, &b);\\n a--;\\n b--;\\n G[b].push_back(a);\\n }\\n int Q;\\n cin >> Q;\\n queue<int> q;\\n q.push(0);\\n vector<int> can(N, 0);\\n can[0] = 1;\\n while(!q.empty()){\\n int t = q.front();\\n q.pop();\\n for(int s: G[t]){\\n if(can[s] == 0){\\n can[s] = 1;\\n q.push(s);\\n }\\n }\\n }\\n for(int i = 0; i < Q; i++){\\n int X, Y;\\n scanf(\\\"%d %d\\\", &X, &Y);\\n Y--;\\n if(X == 1){\\n if(can[Y] == 0){\\n q.push(Y);\\n can[Y] = 1;\\n while(!q.empty()){\\n int t = q.front();\\n q.pop();\\n for(int s : G[t]){\\n if(can[s] == 0){\\n can[s] = 1;\\n q.push(s);\\n }\\n }\\n }\\n }\\n }\\n else{\\n if(can[Y] == 1) printf(\\\"YES\\\\n\\\");\\n else printf(\\\"NO\\\\n\\\");\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 22604,\n \"score_of_the_acc\": -0.4356,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3160_5073711\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\nnamespace CharacterClass {\\n\\tconstexpr string_view\\n\\t digit = \\\"0123456789\\\",\\n\\t xdigit = \\\"0123456789ABCDEFabcdef\\\", lower = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n\\t upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n\\t alpha = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t alnum = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t word = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\\\",\\n\\t punct = R\\\"(!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~)\\\",\\n\\t graph =\\n\\t R\\\"(!\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t print =\\n\\t R\\\"( !\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t blank = \\\" \\\\t\\\", space = \\\" \\\\t\\\\n\\\\r\\\\f\\\\v\\\";\\n} // namespace CharacterClass\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Printer {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid print(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(bool v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(vector<bool>::reference v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid print(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid print(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid print(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void print(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\\n\\t\\tprint(v.first);\\n\\t\\tprint(D.d);\\n\\t\\tprint(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) print(D.d);\\n\\t\\t\\tprint(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void print(const vector<T>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void print(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) print(D.l);\\n\\t\\t\\tprint(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tPrinter() = default;\\n\\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tPrinter& operator()() {\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Printer& operator()(H&& h) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tprint_range(begin, end);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Printer& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tPrinter& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class V> auto operator()(const V& val, size_t i) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(next(begin(v), i), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 7 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T = long long> constexpr T TEN(size_t n) {\\n\\tT result = 1;\\n\\tfor (size_t i = 0; i < n; ++i) result *= 10;\\n\\treturn result;\\n}\\ntemplate <class T, class U,\\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr auto div_ceil(T n, U m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> constexpr T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> constexpr T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T, class U, class V>\\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\\n\\treturn lower <= v && v < upper;\\n}\\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\\nconstexpr bool is_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> constexpr T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T> constexpr int BIT(T x, int i) {\\n\\treturn (x & (1 << i)) ? 1 : 0;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Pow(T a, U n) {\\n\\tassert(n >= 0);\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Powmod(T a, U n, T mod) {\\n\\tassert(n >= 0);\\n\\tif (a > mod) a %= mod;\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 5 \\\"/home/yuruhiya/programming/library/Graph/StronglyConnectedComponents.cpp\\\"\\nusing namespace std;\\n\\nclass StronglyConnectedComponents {\\n\\tint n;\\n\\tvector<vector<int>> graph, rgraph;\\n\\tvector<bool> used;\\n\\tvector<int> cmp, vs;\\n\\tint k;\\n\\tbool builded = false;\\n\\tvoid dfs(int v) {\\n\\t\\tused[v] = true;\\n\\t\\tfor (auto e : graph[v]) {\\n\\t\\t\\tif (!used[e]) dfs(e);\\n\\t\\t}\\n\\t\\tvs.push_back(v);\\n\\t}\\n\\tvoid rdfs(int v, int k) {\\n\\t\\tused[v] = true;\\n\\t\\tcmp[v] = k;\\n\\t\\tfor (auto e : rgraph[v]) {\\n\\t\\t\\tif (!used[e]) rdfs(e, k);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\tStronglyConnectedComponents(int _n) : n(_n), graph(n), rgraph(n) {}\\n\\tStronglyConnectedComponents(const vector<vector<int>>& _graph)\\n\\t : n(_graph.size()), graph(_graph), rgraph(n) {\\n\\t\\tfor (int v = 0; v < n; ++v) {\\n\\t\\t\\tfor (int u : graph[v]) {\\n\\t\\t\\t\\trgraph[u].push_back(v);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvoid add_edge(int s, int t) {\\n\\t\\tbuilded = false;\\n\\t\\tgraph[s].push_back(t);\\n\\t\\trgraph[t].push_back(s);\\n\\t}\\n\\tint build() {\\n\\t\\tvs.clear();\\n\\t\\tused.assign(n, false);\\n\\t\\tcmp.assign(n, 0);\\n\\t\\tfor (int i = 0; i < n; ++i) {\\n\\t\\t\\tif (!used[i]) dfs(i);\\n\\t\\t}\\n\\t\\tk = 0;\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\tfor (int i = vs.size() - 1; i >= 0; --i) {\\n\\t\\t\\tif (!used[vs[i]]) rdfs(vs[i], k++);\\n\\t\\t}\\n\\t\\tbuilded = true;\\n\\t\\treturn k;\\n\\t}\\n\\tint operator[](int i) const {\\n\\t\\tassert(builded);\\n\\t\\treturn cmp[i];\\n\\t}\\n\\tconst vector<int>& get_cmp() const {\\n\\t\\tassert(builded);\\n\\t\\treturn cmp;\\n\\t}\\n\\tconst vector<vector<int>>& get_graph() const {\\n\\t\\tassert(builded);\\n\\t\\treturn graph;\\n\\t}\\n\\tint count_strongly_components() const {\\n\\t\\tassert(builded);\\n\\t\\treturn k;\\n\\t}\\n\\tvector<vector<int>> groups() const {\\n\\t\\tassert(builded);\\n\\t\\tvector<vector<int>> result(k);\\n\\t\\tfor (int i = 0; i < n; ++i) {\\n\\t\\t\\tresult[cmp[i]].push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\tvector<vector<int>> make_DAG() const {\\n\\t\\tassert(builded);\\n\\t\\tvector<vector<int>> result(k);\\n\\t\\tfor (int i = 0; i < n; ++i) {\\n\\t\\t\\tfor (auto e : graph[i]) {\\n\\t\\t\\t\\tif (cmp[i] != cmp[e]) {\\n\\t\\t\\t\\t\\tresult[cmp[i]].push_back(cmp[e]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto& v : result) {\\n\\t\\t\\tsort(v.begin(), v.end());\\n\\t\\t\\tv.erase(unique(v.begin(), v.end()), v.end());\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n};\\n#line 3 \\\"a.cpp\\\"\\n\\nVVI reverse_edge(const VVI& g) {\\n\\tint n = g.size();\\n\\tVVI rg(n);\\n\\trep(v, n) {\\n\\t\\tfor (int u : g[v]) {\\n\\t\\t\\trg[u].push_back(v);\\n\\t\\t}\\n\\t}\\n\\treturn rg;\\n}\\n\\nint main() {\\n\\tini(n, m);\\n\\tStronglyConnectedComponents scc(n);\\n\\trep(i, m) {\\n\\t\\tint a = in--, b = in--;\\n\\t\\tscc.add_edge(a, b);\\n\\t}\\n\\n\\tint k = scc.build();\\n\\tauto g = scc.make_DAG();\\n\\tauto rg = reverse_edge(g);\\n\\n\\tVB flag(k);\\n\\n\\tauto update_flag = [&](auto&& f, int v) -> void {\\n\\t\\tif (flag[v]) return;\\n\\t\\tflag[v] = true;\\n\\t\\tfor (int u : rg[v]) {\\n\\t\\t\\tif (!flag[u]) f(f, u);\\n\\t\\t}\\n\\t};\\n\\n\\tupdate_flag(update_flag, scc[0]);\\n\\n\\tfor (int q = in; q--;) {\\n\\t\\tint x = in, y = in--;\\n\\t\\tif (x == 1) {\\n\\t\\t\\tupdate_flag(update_flag, scc[y]);\\n\\t\\t} else {\\n\\t\\t\\tout.set(YES)(flag[scc[y]]);\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 45244,\n \"score_of_the_acc\": -1.158,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3160_4959577\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 200005\\n\\nint N,E;\\nbool check[SIZE];\\nvector<int> rev_G[SIZE];\\n\\nvoid dfs(int node_id,int pre){\\n\\n\\tcheck[node_id] = true;\\n\\tfor(int i = 0; i < rev_G[node_id].size(); i++){\\n\\t\\tint next = rev_G[node_id][i];\\n\\t\\tif(next == pre||check[next])continue;\\n\\n\\t\\tdfs(next,node_id);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&N,&E);\\n\\n\\tint from,to;\\n\\tfor(int loop = 0; loop < E; loop++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\t\\trev_G[to].push_back(from);\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tcheck[i] = false;\\n\\t}\\n\\n\\tdfs(0,-1);\\n\\n\\tint num_query;\\n\\tscanf(\\\"%d\\\",&num_query);\\n\\n\\tint command,loc;\\n\\tint current = 0;\\n\\n\\tfor(int loop = 0; loop < num_query; loop++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&command,&loc);\\n\\t\\tloc--;\\n\\t\\tif(command == 1){\\n\\n\\t\\t\\tcurrent = loc;\\n\\t\\t\\tif(!check[current]){\\n\\t\\t\\t\\tdfs(current,-1);\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\n\\t\\t\\tif(check[loc]){\\n\\n\\t\\t\\t\\tprintf(\\\"YES\\\\n\\\");\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tprintf(\\\"NO\\\\n\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 15720,\n \"score_of_the_acc\": -0.3053,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3160_4959499\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 200005\\n\\n\\nstruct GROUP{\\n\\tvector<int> nodes;\\n};\\n\\nint N,E;\\nGROUP group[SIZE]; //強連結成分のグループ\\nvector<int> scc_G[SIZE];\\nvector<int> reverse_scc_G[SIZE];\\nstack<int> S;\\n\\nbool check[SIZE];\\nint table[SIZE],in_num[SIZE];\\nint boss[SIZE],height[SIZE];\\nint group_index,global_index;\\n\\n\\nvector<int> G[SIZE];\\n\\nbool visited[SIZE];\\nint LEFT[SIZE],RIGHT[SIZE];\\n\\n\\nvoid scc_dfs(int node_id){\\n\\tcheck[node_id] = true;\\n\\n\\tfor(int i = 0; i < scc_G[node_id].size(); i++){\\n\\t\\tif(!check[scc_G[node_id][i]])scc_dfs(scc_G[node_id][i]);\\n\\t}\\n\\tS.push(node_id);\\n}\\n\\nvoid reverse_scc_dfs(int node_id){\\n\\tcheck[node_id] = true;\\n\\n\\tgroup[group_index].nodes.push_back(node_id); //group[group_index]にノードを突っ込む\\n\\ttable[node_id] = group_index;\\n\\n\\tfor(int i = 0; i < reverse_scc_G[node_id].size(); i++){\\n\\t\\tif(!check[reverse_scc_G[node_id][i]])reverse_scc_dfs(reverse_scc_G[node_id][i]);\\n\\t}\\n}\\n\\nint get_boss(int id){\\n\\tif(boss[id] == id)return id;\\n\\telse{\\n\\t\\treturn boss[id] = get_boss(boss[id]);\\n\\t}\\n}\\n\\nint isSame(int x,int y){\\n\\treturn get_boss(x) == get_boss(y);\\n}\\n\\nvoid unite(int x,int y){\\n\\tint boss_x = get_boss(x);\\n\\tint boss_y = get_boss(y);\\n\\n\\tif(boss_x == boss_y)return;\\n\\n\\tif(height[boss_x] > height[boss_y]){\\n\\n\\t\\tboss[boss_y] = boss_x;\\n\\n\\t}else if(height[boss_x] < height[boss_y]){\\n\\n\\t\\tboss[boss_x] = boss_y;\\n\\n\\t}else{ //height[boss_x] == height[boss_y]\\n\\n\\t\\tboss[boss_y] = boss_x;\\n\\t\\theight[x]++;\\n\\t}\\n}\\n\\nvoid euler_tour(int node_id,int pre){\\n\\tLEFT[node_id] = global_index++;\\n\\tvisited[node_id] = true;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next = G[node_id][i];\\n\\t\\tif(next == pre)continue;\\n\\n\\t\\teuler_tour(next,node_id);\\n\\t}\\n\\tRIGHT[node_id] = global_index++;\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&N,&E);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tboss[i] = i;\\n\\t\\theight[i] = 0;\\n\\t}\\n\\n\\tint from,to;\\n\\n\\tfor(int i = 0; i < E; i++){\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\n\\t\\tscc_G[from].push_back(to);\\n\\t\\treverse_scc_G[to].push_back(from);\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++)check[i] = false;\\n\\n\\t//まずは帰りがけ順を計算\\n\\tfor(int i = 0; i < N;i++){\\n\\t\\tif(!check[i])scc_dfs(i);\\n\\t}\\n\\n\\tfor(int i = 0; i < N;i++)check[i] = false;\\n\\tfor(int i = 0; i < SIZE; i++)group[i].nodes.clear();\\n\\n\\tgroup_index = -1;\\n\\t//ノードを、帰りがけ順の逆順に、各強連結成分(グループ)に分解\\n\\twhile(!S.empty()){\\n\\t\\tif(!check[S.top()]){\\n\\t\\t\\tgroup_index++;\\n\\n\\t\\t\\treverse_scc_dfs(S.top());\\n\\t\\t}\\n\\t\\tS.pop();\\n\\t}\\n\\n\\n\\tfor(int i = 0; i <= group_index; i++){\\n\\t\\tfor(int k = 0; k < group[i].nodes.size(); k++){\\n\\t\\t\\tfor(int p = 0; p < scc_G[group[i].nodes[k]].size(); p++){\\n\\t\\t\\t\\tint next_group = table[scc_G[group[i].nodes[k]][p]];\\n\\t\\t\\t\\tif(next_group != i){\\n\\t\\t\\t\\t\\tG[i].push_back(next_group);\\n\\t\\t\\t\\t\\tunite(i,next_group);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i <= group_index; i++){\\n\\t\\tif(G[i].size() == 0)continue;\\n\\n\\t\\tsort(G[i].begin(),G[i].end());\\n\\t\\tG[i].erase(unique(G[i].begin(),G[i].end()),G[i].end());\\n\\t}\\n\\n\\tfor(int i = 0; i <= group_index; i++){\\n\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\tfor(int i = 0; i <= group_index; i++){\\n\\t\\tif(!visited[i]){\\n\\t\\t\\tglobal_index = 0;\\n\\t\\t\\teuler_tour(i,-1);\\n\\t\\t}\\n\\t}\\n\\n\\tint num_query;\\n\\tscanf(\\\"%d\\\",&num_query);\\n\\n\\tint current = 0;\\n\\tint command,loc;\\n\\n\\tfor(int loop = 0; loop < num_query; loop++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&command,&loc);\\n\\t\\tloc--;\\n\\n\\t\\tif(command == 1){\\n\\n\\t\\t\\tcurrent = loc;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tint from_group = table[loc];\\n\\t\\t\\tint to_group = table[current];\\n\\n\\t\\t\\tif(!isSame(from_group,to_group)){\\n\\n\\t\\t\\t\\tprintf(\\\"NO\\\\n\\\");\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tif(from_group == to_group){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"YES\\\\n\\\");\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tif(LEFT[from_group] < LEFT[to_group] && RIGHT[from_group] > RIGHT[to_group]){\\n\\n\\t\\t\\t\\t\\t\\tprintf(\\\"YES\\\\n\\\");\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tprintf(\\\"NO\\\\n\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.17073170731707318,\n \"time_ms\": 60,\n \"memory_kb\": 45564,\n \"score_of_the_acc\": -1.2222,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3160_4893215\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing LL = long long int;\\n#define incII(i, l, r) for(LL i = (l) ; i <= (r); i++)\\n#define incIX(i, l, r) for(LL i = (l) ; i < (r); i++)\\n#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)\\n#define incXX(i, l, r) for(LL i = (l) + 1; i < (r); i++)\\n#define decII(i, l, r) for(LL i = (r) ; i >= (l); i--)\\n#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)\\n#define decXI(i, l, r) for(LL i = (r) ; i > (l); i--)\\n#define decXX(i, l, r) for(LL i = (r) - 1; i > (l); i--)\\n#define inc(i, n) incIX(i, 0, n)\\n#define dec(i, n) decIX(i, 0, n)\\n#define inc1(i, n) incII(i, 1, n)\\n#define dec1(i, n) decII(i, 1, n)\\nauto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };\\nauto inIX = [](auto x, auto l, auto r) { return (l <= x && x < r); };\\nauto inXI = [](auto x, auto l, auto r) { return (l < x && x <= r); };\\nauto inXX = [](auto x, auto l, auto r) { return (l < x && x < r); };\\nauto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };\\nauto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };\\nauto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };\\nauto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define MT make_tuple\\n#define FI first\\n#define SE second\\n#define FR front()\\n#define BA back()\\n#define ALL(c) c.begin(), c.end()\\n#define RALL(c) c.rbegin(), c.rend()\\n#define RV(c) reverse(ALL(c))\\n#define SC static_cast\\n#define SI(c) SC<int>(c.size())\\n#define SL(c) SC<LL >(c.size())\\n#define RF(e, c) for(auto & e: c)\\n#define SF(c, ...) for(auto & [__VA_ARGS__]: c)\\n#define until(e) while(! (e))\\n#define if_not(e) if(! (e))\\n#define ef else if\\n#define UR assert(false)\\nauto * IS = & cin;\\nauto * OS = & cout;\\narray<string, 3> SEQ = { \\\"\\\", \\\" \\\", \\\"\\\" };\\n// input\\ntemplate<typename T> T in() { T a; (* IS) >> a; return a; }\\n// input: tuple\\ntemplate<int I, typename U> void tin_(istream & is, U & t) {\\n\\tif constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }\\n}\\ntemplate<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }\\ntemplate<typename ... T> auto tin() { return in<tuple<T ...>>(); }\\n// input: array\\ntemplate<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }\\ntemplate<typename T, size_t N> auto ain() { return in<array<T, N>>(); }\\n// input: multi-dimensional vector\\ntemplate<typename T> T vin() { T v; (* IS) >> v; return v; }\\ntemplate<typename T, typename N, typename ... M> auto vin(N n, M ... m) {\\n\\tvector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;\\n}\\n// input: multi-column (tuple<vector>)\\ntemplate<typename U, int I> void colin_([[maybe_unused]] U & t) { }\\ntemplate<typename U, int I, typename A, typename ... B> void colin_(U & t) {\\n\\tget<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);\\n}\\ntemplate<typename ... T> auto colin(int n) {\\n\\ttuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;\\n}\\n// output\\nvoid out_([[maybe_unused]] string s) { }\\ntemplate<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }\\ntemplate<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }\\nauto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };\\nauto out = [](auto ... a) { outF(\\\"\\\", \\\" \\\" , \\\"\\\\n\\\", a ...); };\\nauto outS = [](auto ... a) { outF(\\\"\\\", \\\" \\\" , \\\" \\\" , a ...); };\\nauto outL = [](auto ... a) { outF(\\\"\\\", \\\"\\\\n\\\", \\\"\\\\n\\\", a ...); };\\nauto outN = [](auto ... a) { outF(\\\"\\\", \\\"\\\" , \\\"\\\" , a ...); };\\n// output: multi-dimensional vector\\ntemplate<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {\\n\\tos << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? \\\"\\\" : SEQ[1]) << v[i]; } return (os << SEQ[2]);\\n}\\ntemplate<typename T> void vout_(T && v) { (* OS) << v; }\\ntemplate<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {\\n\\tinc(i, SI(v)) { (* OS) << (i == 0 ? \\\"\\\" : a); vout_(v[i], b ...); }\\n}\\ntemplate<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }\\ntemplate<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << flush; }\\n\\n// ---- ----\\n\\nint main() {\\n\\tauto [n, m] = ain<int, 2>();\\n\\tvector<vector<int>> g(n);\\n\\tinc(i, m) {\\n\\t\\tauto [a, b] = ain<int, 2>();\\n\\t\\ta--; b--;\\n\\t\\tg[b].PB(a);\\n\\t}\\n\\t\\n\\tvector<bool> r(n, false);\\n\\tfunction<void(int)> dfs = [&](int v) {\\n\\t\\tif(r[v]) { return; }\\n\\t\\tr[v] = true;\\n\\t\\tRF(e, g[v]) { dfs(e); }\\n\\t};\\n\\tdfs(0);\\n\\t\\n\\tvector<string> ans;\\n\\tauto Q = in<int>();\\n\\tinc(q, Q) {\\n\\t\\tauto [x, y] = ain<int, 2>();\\n\\t\\ty--;\\n\\t\\tif(x == 1) {\\n\\t\\t\\tdfs(y);\\n\\t\\t} else {\\n\\t\\t\\tans.PB(r[y] ? \\\"YES\\\" : \\\"NO\\\");\\n\\t\\t}\\n\\t}\\n\\tvout(ans, \\\"\\\\n\\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 19012,\n \"score_of_the_acc\": -0.672,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3160_4893208\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing LL = long long int;\\n#define incII(i, l, r) for(LL i = (l) ; i <= (r); i++)\\n#define incIX(i, l, r) for(LL i = (l) ; i < (r); i++)\\n#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)\\n#define incXX(i, l, r) for(LL i = (l) + 1; i < (r); i++)\\n#define decII(i, l, r) for(LL i = (r) ; i >= (l); i--)\\n#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)\\n#define decXI(i, l, r) for(LL i = (r) ; i > (l); i--)\\n#define decXX(i, l, r) for(LL i = (r) - 1; i > (l); i--)\\n#define inc(i, n) incIX(i, 0, n)\\n#define dec(i, n) decIX(i, 0, n)\\n#define inc1(i, n) incII(i, 1, n)\\n#define dec1(i, n) decII(i, 1, n)\\nauto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };\\nauto inIX = [](auto x, auto l, auto r) { return (l <= x && x < r); };\\nauto inXI = [](auto x, auto l, auto r) { return (l < x && x <= r); };\\nauto inXX = [](auto x, auto l, auto r) { return (l < x && x < r); };\\nauto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };\\nauto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };\\nauto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };\\nauto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define MT make_tuple\\n#define FI first\\n#define SE second\\n#define FR front()\\n#define BA back()\\n#define ALL(c) c.begin(), c.end()\\n#define RALL(c) c.rbegin(), c.rend()\\n#define RV(c) reverse(ALL(c))\\n#define SC static_cast\\n#define SI(c) SC<int>(c.size())\\n#define SL(c) SC<LL >(c.size())\\n#define RF(e, c) for(auto & e: c)\\n#define SF(c, ...) for(auto & [__VA_ARGS__]: c)\\n#define until(e) while(! (e))\\n#define if_not(e) if(! (e))\\n#define ef else if\\n#define UR assert(false)\\nauto * IS = & cin;\\nauto * OS = & cout;\\narray<string, 3> SEQ = { \\\"\\\", \\\" \\\", \\\"\\\" };\\n// input\\ntemplate<typename T> T in() { T a; (* IS) >> a; return a; }\\n// input: tuple\\ntemplate<int I, typename U> void tin_(istream & is, U & t) {\\n\\tif constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }\\n}\\ntemplate<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }\\ntemplate<typename ... T> auto tin() { return in<tuple<T ...>>(); }\\n// input: array\\ntemplate<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }\\ntemplate<typename T, size_t N> auto ain() { return in<array<T, N>>(); }\\n// input: multi-dimensional vector\\ntemplate<typename T> T vin() { T v; (* IS) >> v; return v; }\\ntemplate<typename T, typename N, typename ... M> auto vin(N n, M ... m) {\\n\\tvector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;\\n}\\n// input: multi-column (tuple<vector>)\\ntemplate<typename U, int I> void colin_([[maybe_unused]] U & t) { }\\ntemplate<typename U, int I, typename A, typename ... B> void colin_(U & t) {\\n\\tget<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);\\n}\\ntemplate<typename ... T> auto colin(int n) {\\n\\ttuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;\\n}\\n// output\\nvoid out_([[maybe_unused]] string s) { }\\ntemplate<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }\\ntemplate<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }\\nauto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };\\nauto out = [](auto ... a) { outF(\\\"\\\", \\\" \\\" , \\\"\\\\n\\\", a ...); };\\nauto outS = [](auto ... a) { outF(\\\"\\\", \\\" \\\" , \\\" \\\" , a ...); };\\nauto outL = [](auto ... a) { outF(\\\"\\\", \\\"\\\\n\\\", \\\"\\\\n\\\", a ...); };\\nauto outN = [](auto ... a) { outF(\\\"\\\", \\\"\\\" , \\\"\\\" , a ...); };\\n// output: multi-dimensional vector\\ntemplate<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {\\n\\tos << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? \\\"\\\" : SEQ[1]) << v[i]; } return (os << SEQ[2]);\\n}\\ntemplate<typename T> void vout_(T && v) { (* OS) << v; }\\ntemplate<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {\\n\\tinc(i, SI(v)) { (* OS) << (i == 0 ? \\\"\\\" : a); vout_(v[i], b ...); }\\n}\\ntemplate<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }\\ntemplate<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << flush; }\\n\\n// ---- ----\\n\\nint main() {\\n\\tauto [n, m] = ain<int, 2>();\\n\\tvector<vector<int>> g(n);\\n\\tinc(i, m) {\\n\\t\\tauto [a, b] = ain<int, 2>();\\n\\t\\ta--; b--;\\n\\t\\tg[b].PB(a);\\n\\t}\\n\\t\\n\\tvector<bool> r(n, false);\\n\\tr[0] = true;\\n\\tfunction<void(int)> dfs = [&](int v) {\\n\\t\\tif(r[v]) { return; }\\n\\t\\tr[v] = true;\\n\\t\\tRF(e, g[v]) { dfs(e); }\\n\\t};\\n\\t\\n\\tvector<string> ans;\\n\\tauto Q = in<int>();\\n\\tinc(q, Q) {\\n\\t\\tauto [x, y] = ain<int, 2>();\\n\\t\\ty--;\\n\\t\\tif(x == 1) {\\n\\t\\t\\tdfs(y);\\n\\t\\t} else {\\n\\t\\t\\tans.PB(r[y] ? \\\"YES\\\" : \\\"NO\\\");\\n\\t\\t}\\n\\t}\\n\\tvout(ans, \\\"\\\\n\\\");\\n}\",\n \"accuracy\": 0.14634146341463414,\n \"time_ms\": 60,\n \"memory_kb\": 8528,\n \"score_of_the_acc\": -0.2222,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3160_4880238\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\nstruct SCC {\\n int V;\\n vector<vector<int>> G, rG;\\n vector<int> vs; // 帰りがけ順の並び\\n vector<int> cmp; //属する強連結成分トポロジカル順序\\n vector<bool> used;\\n\\n SCC() {}\\n SCC(int n) {\\n V = n;\\n G = vector<vector<int>>(n);\\n rG = vector<vector<int>>(n);\\n }\\n\\n void add_edge(int from, int to) {\\n G[from].push_back(to);\\n rG[to].push_back(from);\\n }\\n\\n void dfs(int v) {\\n used[v] = true;\\n rep(i, G[v].size()) if (!used[G[v][i]]) dfs(G[v][i]);\\n vs.push_back(v);\\n }\\n\\n void rdfs(int v, int k) {\\n used[v] = true;\\n cmp[v] = k;\\n rep(i, rG[v].size()) if (!used[rG[v][i]]) rdfs(rG[v][i], k);\\n }\\n\\n int scc() {\\n used = vector<bool>(V, false);\\n vs.clear();\\n rep(i, V) if (!used[i]) dfs(i);\\n\\n used = vector<bool>(V, false);\\n cmp = vector<int>(V);\\n int num_scc = 0;\\n for (int i = vs.size() - 1; i >= 0; --i)\\n if (!used[vs[i]]) rdfs(vs[i], num_scc++);\\n return num_scc;\\n }\\n};\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n\\n SCC s(n);\\n\\n vector<int> a(m), b(m);\\n rep(i, m) {\\n cin >> a[i] >> b[i];\\n --a[i];\\n --b[i];\\n s.add_edge(a[i], b[i]);\\n }\\n\\n const int V = s.scc();\\n vector<vector<int>> rG(V);\\n rep(i, m) {\\n int u = s.cmp[a[i]], v = s.cmp[b[i]];\\n if (u != v) rG[v].pb(u);\\n }\\n\\n vector<bool> vis(V);\\n auto MOVE = [&](int x) {\\n if (vis[x]) return;\\n vis[x] = true;\\n queue<int> que({x});\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (int e : rG[v])\\n if (!vis[e]) {\\n vis[e] = true;\\n que.push(e);\\n }\\n }\\n };\\n\\n MOVE(s.cmp[0]);\\n\\n int q;\\n cin >> q;\\n rep(qi, q) {\\n int x, y;\\n cin >> x >> y;\\n --y;\\n if (x == 1)\\n MOVE(s.cmp[y]);\\n else\\n cout << (vis[s.cmp[y]] ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 34960,\n \"score_of_the_acc\": -1.7137,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3160_4861053\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint n, m, q;\\nvector<vector<int>> g, rg;\\nvector<bool> reachable;\\n\\nvoid update(int x);\\n\\nint main() {\\n cin >> n >> m;\\n g.resize(n);\\n rg.resize(n);\\n for (int i = 0; i < m; ++i) {\\n int a, b;\\n cin >> a >> b;\\n g[--a].push_back(--b);\\n rg[b].push_back(a);\\n }\\n reachable.assign(n, 0);\\n update(0);\\n cin >> q;\\n while (q--) {\\n int x, y;\\n cin >> x >> y;\\n --x, --y;\\n if (x)\\n cout << (reachable[y] ? \\\"YES\\\" : \\\"NO\\\") << endl;\\n else\\n update(y);\\n }\\n return 0;\\n}\\n\\nvoid update(int x) {\\n queue<int> qu;\\n qu.push(x);\\n if (reachable[x]) return;\\n reachable[x] = 1;\\n while (qu.size()) {\\n int now = qu.front();\\n qu.pop();\\n reachable[now] = 1;\\n for (auto to : rg[now])\\n if (!reachable[to]) {\\n reachable[to] = 1;\\n qu.push(to);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 21480,\n \"score_of_the_acc\": -1.0164,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3160_4850124\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n//----------------------- Print Function ----------------------//\\n\\ninline void print() {\\n cout << '\\\\n';\\n}\\ntemplate <typename First, typename... Rest>\\nvoid print(const First &first, const Rest &... rest) {\\n cout << first << ' ';\\n print(rest...);\\n}\\n\\ntemplate <typename T>\\nvoid print(const T &a) {\\n for (auto e : a) cout << e << ' ';\\n cout << '\\\\n';\\n}\\n\\n//------------------------- Libraries -------------------------//\\n\\n//--------------------------- Solve ---------------------------//\\n\\nusing Graph = vector<vector<int> >;\\n\\nint N, M;\\nvector<bool> reach;\\nGraph g;\\n\\nvoid dfs(int v) {\\n reach[v] = true;\\n for (int e : g[v]) {\\n if (!reach[e]) dfs(e);\\n }\\n}\\n\\nvoid solve() {\\n cin >> N >> M;\\n g.resize(N);\\n reach.resize(N);\\n for (int i = 0; i < M; i++) {\\n int a, b; cin >> a >> b;\\n a--; b--;\\n g[b].push_back(a);\\n }\\n\\n reach[0] = true;\\n dfs(0);\\n\\n int Q; cin >> Q;\\n while (Q--) {\\n int x, y; cin >> x >> y;\\n y--;\\n if (x == 1) {\\n if (!reach[y]) dfs(y);\\n }\\n else if (x == 2) {\\n if (reach[y]) cout << \\\"YES\\\" << '\\\\n';\\n else cout << \\\"NO\\\" << '\\\\n';\\n }\\n }\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 12296,\n \"score_of_the_acc\": -0.1573,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3160_4850121\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n//----------------------- Print Function ----------------------//\\n\\ninline void print() {\\n cout << '\\\\n';\\n}\\ntemplate <typename First, typename... Rest>\\nvoid print(const First &first, const Rest &... rest) {\\n cout << first << ' ';\\n print(rest...);\\n}\\n\\ntemplate <typename T>\\nvoid print(const T &a) {\\n for (auto e : a) cout << e << ' ';\\n cout << '\\\\n';\\n}\\n\\n//------------------------- Libraries -------------------------//\\n\\n//--------------------------- Solve ---------------------------//\\n\\nusing Graph = vector<vector<int> >;\\n\\nint N, M;\\nvector<bool> reach;\\nGraph g;\\n\\nvoid dfs(int v) {\\n if (reach[v]) return;\\n reach[v] = true;\\n for (int e : g[v]) {\\n if (!reach[e]) dfs(e);\\n }\\n}\\n\\nvoid solve() {\\n cin >> N >> M;\\n g.resize(N);\\n reach.resize(N);\\n for (int i = 0; i < M; i++) {\\n int a, b; cin >> a >> b;\\n a--; b--;\\n g[b].push_back(a);\\n }\\n\\n reach[0] = true;\\n dfs(0);\\n \\n int Q; cin >> Q;\\n while (Q--) {\\n int x, y; cin >> x >> y;\\n y--;\\n if (x == 1) {\\n dfs(y);\\n }\\n else if (x == 2) {\\n if (reach[y]) cout << \\\"YES\\\" << '\\\\n';\\n else cout << \\\"NO\\\" << '\\\\n';\\n }\\n }\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 0.14634146341463414,\n \"time_ms\": 20,\n \"memory_kb\": 8696,\n \"score_of_the_acc\": -0.0045,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":1976,"cells":{"group_id":{"kind":"string","value":"aoj_3158_cpp"},"problem_description":{"kind":"string","value":"Problem H: RGBtree\nProblem\n$N$ 頂点 $N-1$ 辺からなる木があり、頂点には $1,2,\\ldots,N$ の番号が、辺には $1,2,\\ldots,N-1$ の番号がついており、 $i$ 番目の辺は頂点 $a_i$ と 頂点 $b_i$\n\tを繋ぎます。\nカトー君は、赤、緑、青の三色を用いてこの木の全ての頂点に色をつけます。\n以下、'R' で赤、'G' で緑、'B' で青を表します。\nあるパスに含まれる赤色で塗られた頂点の個数を $r$ 、緑色で塗られた頂点の個数を $g$ 、青色で塗られた頂点の個数を $b$ としたとき、 $\\max (r,g,b)$ をそのパスのペナルティと定義します。\n木全体のペナルティを「その木に含まれる、全てのパスのペナルティの最大値」と定義します。\nあなたは、与えられた木に適切に色をつけた場合ペナルティの最小値はいくつになるか、カトー君の代わりに計算してあげることにしました。\nペナルティの最小値を求めてください。\nまた、そのペナルティを実現する色のつけ方を1つ求めてください。\n複数の色のつけ方が存在する場合、どれを出力しても構いません。\nConstraints\n入力は以下の条件を満たす。\n$1 \\leqq N \\leqq 2 \\times 10^{5}$\n$1 \\leqq a_i, b_i \\leqq N$\n与えられるグラフは木であることが保証される。\n入力は全て整数である。\nInput\n入力は以下の形式で標準入出力から与えられる。\n$N$\n$a_1$ $b_1$\n$a_2$ $b_2$\n$\\vdots$\n$a_{N-1}$ $b_{N-1}$\nOutput\n非負整数 $X$ 、文字列 $S$ を以下の形式で出力せよ。\nただし、 $X$ は達成可能な木全体のペナルティの最小値である。\n$S$ は $i$ 文字目 $(1 \\leqq i \\leqq N)$ が頂点 $i$ の色を表す、ペナルティ $X$ を達成する塗り方を表す長さ $N$ の文字列である。\n$S$ は、'R','G','B' の文字以外を含んではならない。\n$X$\n$S$\n末尾の改行を忘れないこと。\nSample Input 1\n4\n1 2\n2 3\n3 4\nSample Output 1\n2\nRGBR\nこの塗り方では、頂点1から頂点4までのパスのペナルティが一番大きく、最も多く含まれるのは 'R' で2個です。\nよって、この木のペナルティは2で、これ以上ペナルティを小さくすることはできないため、 $X=2$ が答えになります。\n$S$ としては他にも、 \"RRBG\" や \"GGBB\" といったものが正解として考えられます。\nSample Input 2\n6\n1 2\n2 3\n2 4\n4 5\n4 6\nSample Output 2\n2\nRGBRGB\nどのように色を塗ってもペナルティを2より小さくすることはできません。\n$S$ としては他にも、 \"RRGGBB\" といったものが正解として考えられます。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3158_4861050","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\nvector<vector<int>> g;\nstring res, col = \"RGB\";\n\nvector<int> search_diameter();\nvoid mod_coloring(int now, int par, int dist, int ad = 1);\nint calc_dist(int now, int par, int dist);\nint solve();\n\nint main() {\n cin >> n;\n g.resize(n);\n res = string(n, '-');\n for (int i = 1; i < n; ++i) {\n int a, b;\n cin >> a >> b;\n g[--a].push_back(--b);\n g[b].push_back(a);\n }\n cout << solve() << endl;\n cout << res << endl;\n return 0;\n}\n\nvector<int> search_diameter() {\n vector<int> par;\n int root = 0;\n for (int i = 0; i < 2; ++i) {\n queue<int> qu;\n qu.push(root);\n par.assign(n, -2);\n par[root] = -1;\n while (qu.size()) {\n int now = qu.front();\n root = now;\n qu.pop();\n for (auto to : g[now])\n if (par[to] == -2) {\n par[to] = now;\n qu.push(to);\n }\n }\n }\n vector<int> v;\n while (root != -1) {\n v.push_back(root);\n root = par[root];\n }\n return v;\n}\n\nvoid mod_coloring(int now, int par, int dist, int ad) {\n res[now] = col[dist];\n for (auto to : g[now])\n if (to != par) mod_coloring(to, now, (dist + ad + 3) % 3, ad);\n}\n\nint calc_dist(int now, int par, int dist) {\n int res = dist;\n for (auto to : g[now])\n if (to != par) res = max(res, calc_dist(to, now, dist + 1));\n return res;\n}\n\nint solve() {\n auto dpath = search_diameter();\n int d = dpath.size();\n if (d & 1) {\n if (d % 3) {\n mod_coloring(0, -1, 0);\n return (d + 2) / 3;\n } else { // check\n int cnt = 0, root = dpath[d / 2];\n mod_coloring(root, -1, 0);\n mod_coloring(dpath[d / 2 - 1], root, 2, -1);\n for (auto to : g[root])\n if (calc_dist(to, root, 1) == d / 2) ++cnt;\n return (d + 2 + (cnt >= 3)) / 3;\n }\n } else {\n mod_coloring(dpath[d / 2], dpath[d / 2 - 1], 0);\n mod_coloring(dpath[d / 2 - 1], dpath[d / 2], 2, -1);\n return (d + 2) / 3;\n }\n return -1;\n}","accuracy":1,"time_ms":90,"memory_kb":27628,"score_of_the_acc":-0.1837,"final_rank":2},{"submission_id":"aoj_3158_4835731","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <set>\n#include <tuple>\n#define mkp make_pair\n#define mkt make_tuple\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=1e9+7;\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\n\nint N;\nvector<vector<int>> g;\n\nint findFar(int st){\n queue<int> Q;\n vector<int> dist(N,MOD);\n dist[st]=0;\n Q.push(st);\n while(!Q.empty()){\n int now=Q.front();Q.pop();\n for(auto nex:g[now]){\n if(dist[nex]==MOD){\n dist[nex]=dist[now]+1;\n Q.push(nex);\n }\n }\n }\n int fat=0;\n rep(i,N) if(dist[i]>dist[fat]) fat=i;\n return fat;\n}\n\nbool dfs(int now,int par,int goal,vector<int> &v){\n if(now==goal){\n v.push_back(now);\n return true;\n }\n for(auto nex:g[now]) if(nex!=par){\n if(dfs(nex,now,goal,v)){\n v.push_back(now);\n return true;\n }\n }\n return false;\n}\n\nvector<int> getDiameter(){\n int st=findFar(0);\n st=findFar(st);\n int ed=findFar(st);\n vector<int> path;\n dfs(st,-1,ed,path);\n return path;\n}\n\nvector<int> getdist(int st,int ed){\n vector<int> dist(N,MOD);\n dist[st]=0;\n dist[ed]=0;\n queue<int> Q;\n Q.push(st);\n if(ed!=st) Q.push(ed);\n while(!Q.empty()){\n int now=Q.front();Q.pop();\n for(auto nex:g[now]){\n if(dist[nex]==MOD){\n dist[nex]=dist[now]+1;\n Q.push(nex);\n }\n }\n }\n return dist;\n}\n\nbool dfs(int now,int par,int d,int goal){\n if(d==goal) return true;\n for(auto nex:g[now]){\n if(nex!=par){\n if(dfs(nex,now,d+1,goal)) return true;\n }\n }\n return false;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n cin>>N;\n g.resize(N);\n rep(i,N-1){\n int a,b;\n cin>>a>>b;\n a--;b--;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n\n vector<int> diameter=getDiameter();\n int D=diameter.size();\n if(D%3){\n int st=diameter[D/2];\n vector<int> dist=getdist(st,st);\n\n string ans=\"\";\n rep(i,N){\n dist[i]%=3;\n if(dist[i]==0) ans+='R';\n else if(dist[i]==1) ans+='G';\n else ans+='B';\n }\n cout<<D/3+1<<\"\\n\";\n cout<<ans<<\"\\n\";\n return 0;\n }\n\n if(D%2==0){\n int st=diameter[D/2-1];\n int ed=diameter[D/2];\n vector<int> dist=getdist(st,ed);\n\n string ans=\"\";\n rep(i,N){\n dist[i]%=3;\n if(dist[i]==0) ans+='R';\n else if(dist[i]==1) ans+='G';\n else ans+='B';\n }\n cout<<D/3<<\"\\n\";\n cout<<ans<<\"\\n\";\n return 0;\n }\n\n {\n int st=diameter[D/2];\n vector<int> dist=getdist(st,st);\n int ma=*max_element(all(dist));\n\n int masubg=0;\n for(auto nex:g[st]){\n if(dfs(nex,st,1,ma)) masubg++;\n }\n\n if(masubg>2){\n cout<<D/3+1<<\"\\n\";\n\n st=diameter[D/2];\n dist=getdist(st,st);\n\n string ans=\"\";\n rep(i,N){\n dist[i]%=3;\n if(dist[i]==0) ans+='R';\n else if(dist[i]==1) ans+='G';\n else ans+='B';\n }\n cout<<ans<<\"\\n\";\n return 0;\n }else{\n cout<<D/3<<\"\\n\";\n\n st=diameter[D/2];\n int fir=diameter[D/2-1];\n int sec=diameter[D/2+1];\n vector<int> dist(N,MOD);\n queue<int> Q;\n Q.push(st);Q.push(fir);Q.push(sec);\n dist[st]=0;dist[fir]=1;dist[sec]=2;\n while(!Q.empty()){\n int now=Q.front();\n Q.pop();\n for(auto nex:g[now]){\n if(dist[nex]==MOD){\n dist[nex]=dist[now]+1;\n dist[nex]%=3;\n Q.push(nex);\n }\n }\n }\n\n string ans=\"\";\n rep(i,N){\n dist[i]%=3;\n if(dist[i]==0) ans+='R';\n else if(dist[i]==1) ans+='G';\n else ans+='B';\n }\n cout<<ans<<\"\\n\";\n }\n return 0;\n }\n\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":28428,"score_of_the_acc":-0.2034,"final_rank":5},{"submission_id":"aoj_3158_4835724","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <set>\n#include <tuple>\n#define mkp make_pair\n#define mkt make_tuple\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=1e9+7;\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\n\nint N;\nvector<vector<int>> g;\n\nint findFar(int st){\n queue<int> Q;\n vector<int> dist(N,MOD);\n dist[st]=0;\n Q.push(st);\n while(!Q.empty()){\n int now=Q.front();Q.pop();\n for(auto nex:g[now]){\n if(dist[nex]==MOD){\n dist[nex]=dist[now]+1;\n Q.push(nex);\n }\n }\n }\n int fat=0;\n rep(i,N) if(dist[i]>dist[fat]) fat=i;\n return fat;\n}\n\nbool dfs(int now,int par,int goal,vector<int> &v){\n if(now==goal){\n v.push_back(now);\n return true;\n }\n for(auto nex:g[now]) if(nex!=par){\n if(dfs(nex,now,goal,v)){\n v.push_back(now);\n return true;\n }\n }\n return false;\n}\n\nvector<int> getDiameter(){\n int st=findFar(0);\n st=findFar(st);\n int ed=findFar(st);\n vector<int> path;\n dfs(st,-1,ed,path);\n return path;\n}\n\nvector<int> getdist(int st,int ed){\n vector<int> dist(N,MOD);\n dist[st]=0;\n dist[ed]=0;\n queue<int> Q;\n Q.push(st);\n if(ed!=st) Q.push(ed);\n while(!Q.empty()){\n int now=Q.front();Q.pop();\n for(auto nex:g[now]){\n if(dist[nex]==MOD){\n dist[nex]=dist[now]+1;\n Q.push(nex);\n }\n }\n }\n return dist;\n}\n\nbool dfs(int now,int par,int d,int goal){\n if(d==goal) return true;\n for(auto nex:g[now]){\n if(nex!=par){\n if(dfs(nex,now,d+1,goal)) return true;\n }\n }\n return false;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n cin>>N;\n g.resize(N);\n rep(i,N-1){\n int a,b;\n cin>>a>>b;\n a--;b--;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n\n vector<int> diameter=getDiameter();\n int D=diameter.size();\n\n if(D%3){\n int st=diameter[D/2];\n vector<int> dist=getdist(st,st);\n\n string ans=\"\";\n rep(i,N){\n dist[i]%=3;\n if(dist[i]==0) ans+='R';\n else if(dist[i]==1) ans+='G';\n else ans+='B';\n }\n cout<<D/3+1<<\"\\n\";\n cout<<ans<<\"\\n\";\n return 0;\n }\n\n if(D%2==0){\n int st=diameter[D/2-1];\n int ed=diameter[D/2];\n vector<int> dist(N,MOD);\n dist[st]=0;dist[ed]=2;\n queue<int> Q;\n Q.push(st);\n while(!Q.empty()){\n int now=Q.front();\n Q.pop();\n for(auto nex:g[now]){\n if(dist[nex]==MOD){\n dist[nex]=dist[now]+1;\n dist[nex]%=3;\n Q.push(nex);\n }\n }\n }\n Q.push(ed);\n while(!Q.empty()){\n int now=Q.front();\n Q.pop();\n for(auto nex:g[now]){\n if(dist[nex]==MOD){\n dist[nex]=dist[now]-1;\n dist[nex]+=3;\n dist[nex]%=3;\n Q.push(nex);\n }\n }\n }\n\n string ans=\"\";\n rep(i,N){\n dist[i]%=3;\n if(dist[i]==0) ans+='R';\n else if(dist[i]==1) ans+='G';\n else ans+='B';\n }\n cout<<D/3<<\"\\n\";\n cout<<ans<<\"\\n\";\n return 0;\n }\n\n {\n int st=diameter[D/2];\n vector<int> dist=getdist(st,st);\n int ma=*max_element(all(dist));\n\n int masubg=0;\n for(auto nex:g[st]){\n if(dfs(nex,st,1,ma)) masubg++;\n }\n\n if(masubg>2){\n cout<<D/3+1<<\"\\n\";\n\n st=diameter[D/2];\n dist=getdist(st,st);\n\n string ans=\"\";\n rep(i,N){\n dist[i]%=3;\n if(dist[i]==0) ans+='R';\n else if(dist[i]==1) ans+='G';\n else ans+='B';\n }\n cout<<ans<<\"\\n\";\n return 0;\n }else{\n cout<<D/3<<\"\\n\";\n\n st=diameter[D/2];\n int fir=diameter[D/2-1];\n int sec=diameter[D/2+1];\n vector<int> dist(N,MOD);\n queue<int> Q;\n Q.push(st);Q.push(fir);\n dist[st]=0;dist[fir]=1;\n dist[sec]=2;\n while(!Q.empty()){\n int now=Q.front();\n Q.pop();\n for(auto nex:g[now]){\n if(dist[nex]==MOD){\n dist[nex]=dist[now]+1;\n dist[nex]%=3;\n Q.push(nex);\n }\n }\n }\n\n Q.push(sec);\n dist[sec]=2;\n while(!Q.empty()){\n int now=Q.front();\n Q.pop();\n for(auto nex:g[now]){\n if(dist[nex]==MOD){\n dist[nex]=dist[now]-1;\n dist[nex]+=3;\n dist[nex]%=3;\n Q.push(nex);\n }\n }\n }\n\n string ans=\"\";\n rep(i,N){\n dist[i]%=3;\n if(dist[i]==0) ans+='R';\n else if(dist[i]==1) ans+='G';\n else ans+='B';\n }\n cout<<ans<<\"\\n\";\n }\n return 0;\n }\n\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":28416,"score_of_the_acc":-0.1977,"final_rank":3},{"submission_id":"aoj_3158_4834902","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\nstruct edge{\n ll to=-1,cost=0;\n edge(){};\n edge(ll t,ll c):to(t),cost(c){};\n};\nstruct HLD{\n ll n, root;\n ll cnt = 0;\n vector<ll>sz;//部分木サイズ\n vector<ll>par,head;\n vector<vector<struct edge>>g;//隣接リスト\n vector<struct edge>edges;//データ構造に乗せるedge列\n vector<ll>in,out;//[in,out)で部分木、[ina,inb]でa~bのパス(aが上)\n //inは頂点のindexを表す。また、edge列の下側の頂点である\n HLD(vector<vector<struct edge>>&G,ll r = -1)\n :g(G),n(G.size()),root(r){\n par.assign(n,-1),in.assign(n,-1);\n out.assign(n,-1),head.assign(n,-1),sz.assign(n,-1);\n edges.assign(n,edge());\n dfs_build();\n }\n void dfs_build(){\n if(root == -1){//根がどこでも良い場合(森でも可)\n for(ll i=0;i<n;i++){\n if(sz[i] == -1){\n head[i] = i;\n dfs_sz(i);\n dfs_hld(i);\n }\n }\n }\n else{\n head[root] = root;\n dfs_sz(root);\n dfs_hld(root);\n }\n }\n void dfs_sz(ll k){\n sz[k] = 1;\n for(auto &e: g[k]){\n if(e.to == par[k])continue;\n par[e.to] = k;\n dfs_sz(e.to);\n sz[k] += sz[e.to];\n if(sz[e.to] > sz[g[k][0].to])swap(e, g[k][0]);\n }\n }\n void dfs_hld(ll k){\n in[k] = cnt++;\n for(auto e:g[k]){\n if(e.to == par[k])continue;\n head[e.to] = (e.to == g[k][0].to ? head[k]: e.to);\n edges[cnt] = e;\n dfs_hld(e.to);\n }\n out[k] = cnt;\n }\n ll lca(ll p,ll q){\n while(1){\n if(in[p] < in[q])swap(p,q);\n if(head[p] == head[q])return q;\n p = par[head[p]];\n }\n }\n vector<pair<ll,ll>>query_path(ll p,ll q,bool isEdge=true){\n ll r=lca(p,q);\n vector<pair<ll,ll>>ret;\n for(ll i=0;i<2;i++){\n if(i == 1)swap(p,q);\n while(1){\n if(isEdge&&p==r)break;\n if(head[p]==head[r]){\n ret.emplace_back(in[r]+(isEdge?1:i),in[p]+1);\n break;\n }\n ret.emplace_back(in[head[p]],in[p]+1);\n p = par[head[p]];\n }\n }\n return ret;\n }\n vector<vector<pair<ll,ll>>>query_order_path(ll p,ll q,bool isEdge=true){\n\t//非可換クエリ用、配列0を順番を反転したデータ構造に、配列1を通常のデータ構造に\n vector<vector<pair<ll,ll>>>ret(2);\n ll r=lca(p,q);\n for(ll i=0;i<2;i++){\n if(i == 1)swap(p,q);\n while(1){\n if(isEdge&&p==r)break;\n if(head[p]==head[r]){\n if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[r]+(isEdge?1:i)));\n else ret[i].emplace_back(in[r]+(isEdge?1:i),in[p]+1);\n break;\n }\n if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[head[p]]));\n else ret[i].emplace_back(in[head[p]],in[p]+1);\n p = par[head[p]];\n }\n }\n reverse(ret[1].begin(), ret[1].end());\n return ret;\n }\n pair<ll,ll>query_subtree(ll p,bool isEdge=true){\n return make_pair(in[p]+isEdge,out[p]);\n }\n};\ntemplate<typename T>\nstruct BIT{\n ll n;\n ll k=1;\n vector<T>data;\n BIT() = default;\n BIT(ll size):n(size){\n data.assign(n,0);\n while(k*2<=n)k*=2;\n }\n void add(ll a,T w){\n for(ll i=a+1;i<=n;i+=i&-i)data[i-1]+=w;\n }\n T sum(ll a){\n\tif(a<0)return 0;\n T ret = 0;\n for(ll i=a+1;i>0;i-=i&-i)ret+=data[i-1];\n return ret;\n }\n T sum(ll a,ll b){return a>b?0:sum(b)-sum(a-1);}\n T operator[](ll pos){\n return sum(pos,pos);\n }\n ll lower_bound(ll x){\n ll ret=0; \n for(ll i=k;i>0;i/=2){\n if(ret+i<=n&&data[ret+i-1]<x){\n x-=data[ret+i-1];\n ret+=i;\n }\n }\n return ret;\n }\n void print(){\n for(ll i=0;i<n;i++){\n if(i!=0)cout<<\" \";\n cout<<(*this)[i];\n }\n cout<<endl;\n }\n};\nstruct Diameter{\n vector<ll>dep,ret;\n ll n;\n vector<vector<ll>>g;\n ll diam,root,end;\n Diameter(vector<vector<ll>>&G):g(G),n(G.size()){\n dep.assign(n,-1LL);\n dfs(0,0);\n root = max_element(ALL(dep)) - dep.begin();\n fill(ALL(dep),-1LL);\n dfs(root,0);\n end = max_element(ALL(dep)) - dep.begin();\n diam = dep[end];\n }\n void dfs(ll k, ll d){\n dep[k] = d;\n for(auto to:g[k]){\n if(dep[to]==-1)dfs(to,d+1);\n }\n }\n vector<ll>diam_path(){\n vector<ll>tmp;\n dfs2(root,-1,tmp);\n return ret;\n }\n void dfs2(ll k, ll par,vector<ll>&v){\n v.PB(k);\n if(k==end)ret=v;\n for(auto to:g[k]){\n if(par!=to)dfs2(to,k,v);\n }\n v.pop_back();\n }\n};\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n ll n;cin>>n;\n vector<vector<edge>>g(n);\n vector<vector<ll>>gw(n);\n rep(i,0,n-1){\n ll u,v;cin>>u>>v;u--;v--;\n g[u].EB(v,1);\n g[v].EB(u,1);\n gw[u].PB(v);\n gw[v].PB(u);\n }\n HLD hld(g);\n Diameter dia(gw);\n string s(n,'?');\n string r=\"RGB\";\n vector<BIT<ll>>bit(3,BIT<ll>(n));\n auto vd=dia.diam_path();\n vector<ll>td(n,-1);\n rep(i,0,vd.size()){\n if(i*2<vd.size())td[vd[i]]=0;\n else td[vd[i]]=1;\n }\n //debug(td,n);\n //debug(vd,vd.size());\n {\n\n auto dfs=[&](auto &&f,ll k,ll par,ll d,ll flip)->void{\n s[k]=r[d];\n bit[d].add(hld.in[k],1);\n for(auto to:gw[k]){\n if(to==par)continue;\n if(flip||(td[k]==0&&td[to]==-1))f(f,to,k,(d+2)%3,1);\n else f(f,to,k,(d+1)%3,0);\n }\n };\n dfs(dfs,dia.root,-1,0,0);\n }\n //cout<<dia.root spa dia.end spa dia.diam<<endl;\n rep(i,0,n){\n for(auto to:{dia.root,dia.end}){\n //for(auto to:v){\n auto p=hld.query_path(i,to,false);\n rep(j,0,3){\n ll now=0;\n for(auto z:p)now+=bit[j].sum(z.fi,z.se-1);\n chmax(res,now);\n }\n }\n }\n cout<<res<<endl;\n cout<<s<<endl;\n return 0;\n}","accuracy":1,"time_ms":400,"memory_kb":88128,"score_of_the_acc":-1.0011,"final_rank":16},{"submission_id":"aoj_3158_4834266","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\nusing namespace std;\nconst int N=200000;\nvector<int> g[N];\nint res[N];\n\nvoid paint_tree(int s,int p,int c,int sn){\n\tres[s]=c;\n\tfor(int t:g[s]){\n\t\tif(t==p)continue;\n\t\tpaint_tree(t,s,(c+sn+3)%3,sn);\n\t}\n}\n\nvoid printres(int n){\n\tfor(int i=0;i<n;i++){\n\t\tif(res[i]==0)printf(\"R\");\n\t\tif(res[i]==1)printf(\"G\");\n\t\tif(res[i]==2)printf(\"B\");\n\t}\n\tprintf(\"\\n\");\n}\n\nint main(){\n\tint n; cin >> n;\n\tfor(int i=1;i<n;i++){\n\t\tint x,y; cin >> x >> y;\n\t\tx--; y--;\n\t\tg[x].push_back(y);\n\t\tg[y].push_back(x);\n\t}\n\tqueue<int> q;\n\tq.push(0);\n\tvector<int> d(n);\n\twhile(q.size()){\n\t\tint s=q.front(); q.pop();\n\t\tfor(int t:g[s]){\n\t\t\tif(t!=0&&d[t]==0){\n\t\t\t\td[t]=d[s]+1;\n\t\t\t\tq.push(t);\n\t\t\t}\n\t\t}\n\t}\n\tint id=-1;\n\tint mx=-1;\n\tfor(int i=0;i<n;i++){\n\t\tif(mx<d[i]){\n\t\t\tmx=d[i];\n\t\t\tid=i;\n\t\t}\n\t}\n\tvector<int> dd(n);\n\tq.push(id);\n\twhile(q.size()){\n\t\tint s=q.front(); q.pop();\n\t\tfor(int t:g[s]){\n\t\t\tif(t!=id&&dd[t]==0){\n\t\t\t\tdd[t]=dd[s]+1;\n\t\t\t\tq.push(t);\n\t\t\t}\n\t\t}\n\t}\n\tint D=*max_element(dd.begin(), dd.end());\n\tD++;\n\tif(D%3){\n\t\tprintf(\"%d\\n\",(D+2)/3);\n\t\tpaint_tree(0,-1,0,1);\n\t\tprintres(n);\n\t}\n\telse{\n\t\tif(D%2==0){\n\t\t\tint jd=-1;\n\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\tif(dd[i]==D-1)jd=i;\n\t\t\t}\n\t\t\tvector<int> ddd(n);\n\t\t\tq.push(jd);\n\t\t\twhile(q.size()){\n\t\t\t\tint s=q.front(); q.pop();\n\t\t\t\tfor(int t:g[s]){\n\t\t\t\t\tif(t!=jd&&ddd[t]==0){\n\t\t\t\t\t\tddd[t]=ddd[s]+1;\n\t\t\t\t\t\tq.push(t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\tif(dd[i]==D/2-1&&ddd[i]==D/2)id=i;\n\t\t\t\tif(dd[i]==D/2&&ddd[i]==D/2-1)jd=i;\n\t\t\t}\n\t\t\tprintf(\"%d\\n\",D/3);\n\t\t\tpaint_tree(id,jd,0,1);\n\t\t\tpaint_tree(jd,id,2,-1);\n\t\t\tprintres(n);\n\t\t}\n\t\telse{\n\t\t\tint jd=-1;\n\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\tif(dd[i]==D-1)jd=i;\n\t\t\t}\n\t\t\tvector<int> ddd(n);\n\t\t\tq.push(jd);\n\t\t\twhile(q.size()){\n\t\t\t\tint s=q.front(); q.pop();\n\t\t\t\tfor(int t:g[s]){\n\t\t\t\t\tif(t!=jd&&ddd[t]==0){\n\t\t\t\t\t\tddd[t]=ddd[s]+1;\n\t\t\t\t\t\tq.push(t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\tif(dd[i]==D/2&&ddd[i]==D/2)id=i;\n\t\t\t\td[i]=0;\n\t\t\t}\n\t\t\tq.push(id);\n\t\t\twhile(q.size()){\n\t\t\t\tint s=q.front(); q.pop();\n\t\t\t\tfor(int t:g[s]){\n\t\t\t\t\tif(t!=id&&d[t]==0){\n\t\t\t\t\t\td[t]=d[s]+1;\n\t\t\t\t\t\tq.push(t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tint cnt=0;\n\t\t\tint DD=*max_element(d.begin(), d.end());\n\t\t\tvector<bool>used(n);\n\t\t\tused[id]=1;\n\t\t\tfor(int s:g[id]){\n\t\t\t\tbool ok=0;\n\t\t\t\tqueue<int> qq;\n\t\t\t\tqq.push(s);\n\t\t\t\twhile(qq.size()){\n\t\t\t\t\tint ss=qq.front(); qq.pop();\n\t\t\t\t\tif(d[ss]==DD)ok=1;\n\t\t\t\t\tused[ss]=1;\n\t\t\t\t\tfor(int t:g[ss]){\n\t\t\t\t\t\tif(!used[t])qq.push(t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(ok)cnt++;\n\t\t\t}\n\t\t\tif(cnt>=3){\n\t\t\t\tprintf(\"%d\\n\",(D+3)/3);\n\t\t\t\tpaint_tree(0,-1,0,1);\n\t\t\t\tprintres(n);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tint kd=-1;\n\t\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\t\tif(d[i]==1&&ddd[i]+1==ddd[id])kd=i;\n\t\t\t\t}\n\t\t\t\tprintf(\"%d\\n\",D/3);\n\t\t\t\tpaint_tree(id,kd,0,1);\n\t\t\t\tpaint_tree(kd,id,2,-1);\n\t\t\t\tprintres(n);\n\t\t\t}\n\t\t}\n\t}\n}","accuracy":1,"time_ms":140,"memory_kb":28860,"score_of_the_acc":-0.2246,"final_rank":6},{"submission_id":"aoj_3158_4834124","code_snippet":"#pragma region Macros\n#pragma GCC optimize(\"O3\")\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define pb push_back\n#define eb emplace_back\n#define vi vector<int>\n#define vll vector<ll>\n#define vpi vector<pii>\n#define vpll vector<pll>\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n#define fi first\n#define se second\n#define all(c) begin(c), end(c)\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\nusing namespace std;\nstring YES[2] = {\"NO\", \"YES\"};\nstring Yes[2] = {\"No\", \"Yes\"};\nstring yes[2] = {\"no\", \"yes\"};\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n#define si(c) (int)(c).size()\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\n scan(head);\n IN(tail...);\n}\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\nvi iota(int n) {\n vi a(n);\n iota(all(a), 0);\n return a;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n sort(all(y));\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\nint popcount(ll x) { return __builtin_popcountll(x); }\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n }\n} setup_io;\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return move(res);\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return move(res);\n}\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n for(auto &e : v) cout << e << \" \";\n cout << endl;\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n cout << \"(\" << p.fi << \", \" << p.se << \")\";\n return os;\n}\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\ntemplate <class A> string to_string(A v) {\n if(v.empty()) return \"{}\";\n string ret = \"{\";\n for(auto &x : v) ret += to_string(x) + \",\";\n ret.back() = '}';\n return ret;\n}\n\nvoid dump() { cerr << endl; }\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#define endl '\\n'\n#ifdef _LOCAL\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\n#define debug(x)\n#endif\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\n#pragma endregion\n\nusing tree = Graph;\nint search_center(tree &g) {\n vector<int> res;\n int max_depth = -1, leaf;\n auto dfs = [&](auto &&self, int x, int p, int d, bool looking = false) -> bool {\n bool flag = false;\n if(max_depth < d) {\n max_depth = d, leaf = x, flag = true;\n res.clear();\n }\n for(auto e : g[x]) {\n if(e != p) flag |= self(self, e, x, d + 1, looking);\n }\n if(looking and flag and d == (max_depth >> 1) or d == ((max_depth + 1) >> 1)) res.emplace_back(x);\n return flag;\n };\n dfs(dfs, 0, -1, 0);\n max_depth = -1;\n dfs(dfs, leaf, -1, 0, true);\n return res[0];\n}\nint main() {\n string s = \"RGB\";\n INT(n);\n Graph g = getG(n);\n if(n <= 3) {\n cout << 1 << endl;\n cout << s.substr(0, n) << endl;\n exit(0);\n }\n vi ans(n);\n int num = 0;\n int c = search_center(g);\n vi d(n);\n {\n auto dfs = [&](auto &&f, int x, int p) -> int {\n d[x] = 1;\n for(auto e : g[x])\n if(e != p) chmax(d[x], f(f, e, x) + 1);\n return d[x];\n };\n dfs(dfs, c, -1);\n }\n int ma[2] = {};\n vi v;\n for(auto e : g[c]) v.eb(d[e]);\n sort(all(v), greater<>());\n num = 1 + v[0] / 3 + v[1] / 3;\n int cnt = 0;\n for(auto e : v)\n if(v[0] / 3 == e / 3) cnt += e % 3;\n if(cnt > 2) num++;\n cout << num << endl;\n auto dfs = [&](auto &&f, int x, int p, int col, int dx) -> void {\n ans[x] = col;\n col = (col + 3 + dx) % 3;\n for(auto e : g[x])\n if(e != p) f(f, e, x, col, dx);\n };\n vi w;\n for(auto e : g[c]) w.eb(e);\n sort(all(w), [&](int i, int j) { return d[i] > d[j]; });\n int k = 1;\n for(auto e : w) {\n dfs(dfs, e, c, (3 + k) % 3, k);\n k *= -1;\n }\n rep(i, n) cout << s[ans[i]];\n cout << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":34304,"score_of_the_acc":-0.2438,"final_rank":8},{"submission_id":"aoj_3158_4833750","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int_fast32_t int32;\ntypedef int_fast64_t int64;\n\nconst int32 inf = 1e9+7;\nconst int32 MOD = 1000000007;\nconst int64 llinf = 1e18;\n\n#define YES(n) cout << ((n) ? \"YES\\n\" : \"NO\\n\" )\n#define Yes(n) cout << ((n) ? \"Yes\\n\" : \"No\\n\" )\n#define POSSIBLE(n) cout << ((n) ? \"POSSIBLE\\n\" : \"IMPOSSIBLE\\n\" )\n#define ANS(n) cout << (n) << \"\\n\"\n#define REP(i,n) for(int64 i=0;i<(n);++i)\n#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)\n#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)\n#define all(obj) (obj).begin(),(obj).end()\n#define rall(obj) (obj).rbegin(),(obj).rend()\n#define fi first\n#define se second\n#define pb(a) push_back(a)\ntypedef pair<int32,int32> pii;\ntypedef pair<int64,int64> pll;\n\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) { a = b; return true; } return false;\n}\n\nvector<vector<int32>> adj;\nvector<int32> dist;\n\nvoid dfs(int32 v){\n for(auto u : adj[v]){\n if(dist[u] != inf)continue;\n dist[u] = dist[v] + 1;\n dfs(u);\n }\n}\n\n\nvector<int32> mxdepth;\n\nint32 dfs2(int32 v, int32 p = -1){\n for(auto u : adj[v]){\n if(u == p)continue;\n chmax(mxdepth[v],dfs2(u,v));\n }\n return mxdepth[v];\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int32 n;\n cin >> n;\n adj.resize(n);\n REP(i,n-1){\n int32 a,b;\n cin >> a >> b;\n --a;--b;\n adj[a].pb(b);\n adj[b].pb(a);\n }\n\n dist.resize(n,inf);\n dist[0] = 0;\n dfs(0);\n // REP(i,n)ANS(dist[i]);\n int32 s = -1;\n {\n int32 mx = 0;\n REP(i,n)chmax(mx, dist[i]);\n REP(i,n){\n if(dist[i] == mx){\n s = i;\n break;\n }\n }\n }\n\n dist = vector<int32>(n,inf);\n dist[s] = 0;\n dfs(s);\n int32 t = -1;\n {\n int32 mx = 0;\n REP(i,n)chmax(mx, dist[i]);\n REP(i,n){\n if(dist[i] == mx){\n t = i;\n break;\n }\n }\n }\n // ANS(s);\n // ANS(t);\n int32 diam = dist[t];\n // ANS(diam);\n\n vector<int32> diampath;\n int32 cur = t;\n diampath.pb(t);\n while(cur != s){\n for(auto v : adj[cur]){\n if(dist[v] == dist[cur] - 1){\n diampath.pb(v);\n cur = v;\n }\n }\n }\n // for(auto v : diampath){\n // ANS(v+1);\n // }\n\n dist = vector<int32>(n,inf);\n dist[diampath[diam/2]] = 0;\n dfs(diampath[diam/2]);\n vector<int32> depth1 = dist;\n\n dist = vector<int32>(n,inf);\n dist[diampath[diam/2+1]] = 0;\n dfs(diampath[diam/2+1]);\n vector<int32> depth2 = dist;\n\n vector<int32> color(n,-1);\n REP(i,n){\n if(depth1[i] < depth2[i]){\n color[i] = depth1[i] % 3;\n }else{\n color[i] = 2 - depth2[i] % 3;\n }\n }\n\n mxdepth = depth1;\n dfs2(diampath[diam/2]);\n int32 cnt = 0;\n for(auto v : adj[diampath[diam/2]]){\n if(mxdepth[v] == diam/2)++cnt;\n }\n\n if(diam % 6 == 2 && cnt >= 3){\n ANS((diam+3)/3+1);\n }else{\n ANS((diam+3)/3);\n }\n\n REP(i,n){\n // ANS(color[i]);\n if(color[i] == 0){\n cout << \"R\";\n }else if(color[i] == 1){\n cout << \"G\";\n }else{\n cout << \"B\";\n }\n }\n cout << endl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":29568,"score_of_the_acc":-0.1989,"final_rank":4},{"submission_id":"aoj_3158_4833644","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int_fast32_t int32;\ntypedef int_fast64_t int64;\n\nconst int32 inf = 1e9+7;\nconst int32 MOD = 1000000007;\nconst int64 llinf = 1e18;\n\n#define YES(n) cout << ((n) ? \"YES\\n\" : \"NO\\n\" )\n#define Yes(n) cout << ((n) ? \"Yes\\n\" : \"No\\n\" )\n#define POSSIBLE(n) cout << ((n) ? \"POSSIBLE\\n\" : \"IMPOSSIBLE\\n\" )\n#define ANS(n) cout << (n) << \"\\n\"\n#define REP(i,n) for(int64 i=0;i<(n);++i)\n#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)\n#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)\n#define all(obj) (obj).begin(),(obj).end()\n#define rall(obj) (obj).rbegin(),(obj).rend()\n#define fi first\n#define se second\n#define pb(a) push_back(a)\ntypedef pair<int32,int32> pii;\ntypedef pair<int64,int64> pll;\n\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) { a = b; return true; } return false;\n}\n\nvector<vector<int32>> adj;\nvector<int32> dist;\n\nvoid dfs(int32 v){\n for(auto u : adj[v]){\n if(dist[u] != inf)continue;\n dist[u] = dist[v] + 1;\n dfs(u);\n }\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int32 n;\n cin >> n;\n adj.resize(n);\n REP(i,n-1){\n int32 a,b;\n cin >> a >> b;\n --a;--b;\n adj[a].pb(b);\n adj[b].pb(a);\n }\n\n dist.resize(n,inf);\n dist[0] = 0;\n dfs(0);\n // REP(i,n)ANS(dist[i]);\n int32 s = -1;\n {\n int32 mx = 0;\n REP(i,n)chmax(mx, dist[i]);\n REP(i,n){\n if(dist[i] == mx){\n s = i;\n break;\n }\n }\n }\n\n dist = vector<int32>(n,inf);\n dist[s] = 0;\n dfs(s);\n int32 t = -1;\n {\n int32 mx = 0;\n REP(i,n)chmax(mx, dist[i]);\n REP(i,n){\n if(dist[i] == mx){\n t = i;\n break;\n }\n }\n }\n // ANS(s);\n // ANS(t);\n int32 diam = dist[t];\n // ANS(diam);\n\n vector<int32> diampath;\n int32 cur = t;\n diampath.pb(t);\n while(cur != s){\n for(auto v : adj[cur]){\n if(dist[v] == dist[cur] - 1){\n diampath.pb(v);\n cur = v;\n }\n }\n }\n // for(auto v : diampath){\n // ANS(v+1);\n // }\n\n dist = vector<int32>(n,inf);\n dist[diampath[diam/2]] = 0;\n dfs(diampath[diam/2]);\n vector<int32> depth1 = dist;\n\n dist = vector<int32>(n,inf);\n dist[diampath[diam/2+1]] = 0;\n dfs(diampath[diam/2+1]);\n vector<int32> depth2 = dist;\n\n vector<int32> color(n,-1);\n REP(i,n){\n if(depth1[i] < depth2[i]){\n color[i] = depth1[i] % 3;\n }else{\n color[i] = 2 - depth2[i] % 3;\n }\n }\n\n if(diam == 2 && n >= 4){\n ANS(2);\n }else{\n ANS((diam+3)/3); \n }\n\n REP(i,n){\n // ANS(color[i]);\n if(color[i] == 0){\n cout << \"R\";\n }else if(color[i] == 1){\n cout << \"G\";\n }else{\n cout << \"B\";\n }\n }\n cout << endl;\n return 0;\n}","accuracy":0.9444444444444444,"time_ms":80,"memory_kb":27852,"score_of_the_acc":-0.1806,"final_rank":18},{"submission_id":"aoj_3158_4833524","code_snippet":"#pragma region kyopro_template\n#define Nyaan_template\n#include <immintrin.h>\n#include <bits/stdc++.h>\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se second\n#define each(x, v) for (auto &x : v)\n#define all(v) (v).begin(), (v).end()\n#define sz(v) ((int)(v).size())\n#define mem(a, val) memset(a, val, sizeof(a))\n#define ini(...) \\\n int __VA_ARGS__; \\\n in(__VA_ARGS__)\n#define inl(...) \\\n long long __VA_ARGS__; \\\n in(__VA_ARGS__)\n#define ins(...) \\\n string __VA_ARGS__; \\\n in(__VA_ARGS__)\n#define inc(...) \\\n char __VA_ARGS__; \\\n in(__VA_ARGS__)\n#define in2(s, t) \\\n for (int i = 0; i < (int)s.size(); i++) { \\\n in(s[i], t[i]); \\\n }\n#define in3(s, t, u) \\\n for (int i = 0; i < (int)s.size(); i++) { \\\n in(s[i], t[i], u[i]); \\\n }\n#define in4(s, t, u, v) \\\n for (int i = 0; i < (int)s.size(); i++) { \\\n in(s[i], t[i], u[i], v[i]); \\\n }\n#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)\n#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)\n#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)\n#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)\n#define reg(i, a, b) for (long long i = (a); i < (b); i++)\n#define die(...) \\\n do { \\\n out(__VA_ARGS__); \\\n return; \\\n } while (0)\nusing namespace std;\nusing ll = long long;\ntemplate <class T>\nusing V = vector<T>;\nusing vi = vector<int>;\nusing vl = vector<long long>;\nusing vvi = vector<vector<int>>;\nusing vd = V<double>;\nusing vs = V<string>;\nusing vvl = vector<vector<long long>>;\nusing P = pair<long long, long long>;\nusing vp = vector<P>;\nusing pii = pair<int, int>;\nusing vpi = vector<pair<int, int>>;\nconstexpr int inf = 1001001001;\nconstexpr long long infLL = (1LL << 61) - 1;\ntemplate <typename T, typename U>\ninline bool amin(T &x, U y) {\n return (y < x) ? (x = y, true) : false;\n}\ntemplate <typename T, typename U>\ninline bool amax(T &x, U y) {\n return (x < y) ? (x = y, true) : false;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate <typename T, typename U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n is >> p.first >> p.second;\n return is;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n int s = (int)v.size();\n for (int i = 0; i < s; i++) os << (i ? \" \" : \"\") << v[i];\n return os;\n}\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (auto &x : v) is >> x;\n return is;\n}\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &... u) {\n cin >> t;\n in(u...);\n}\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U>\nvoid out(const T &t, const U &... u) {\n cout << t;\n if (sizeof...(u)) cout << \" \";\n out(u...);\n}\n\n#ifdef NyaanDebug\n#define trc(...) \\\n do { \\\n cerr << #__VA_ARGS__ << \" = \"; \\\n dbg_out(__VA_ARGS__); \\\n } while (0)\n#define trca(v, N) \\\n do { \\\n cerr << #v << \" = \"; \\\n array_out(v, N); \\\n } while (0)\n#define trcc(v) \\\n do { \\\n cerr << #v << \" = {\"; \\\n each(x, v) { cerr << \" \" << x << \",\"; } \\\n cerr << \"}\" << endl; \\\n } while (0)\ntemplate <typename T>\nvoid _cout(const T &c) {\n cerr << c;\n}\nvoid _cout(const int &c) {\n if (c == 1001001001)\n cerr << \"inf\";\n else if (c == -1001001001)\n cerr << \"-inf\";\n else\n cerr << c;\n}\nvoid _cout(const unsigned int &c) {\n if (c == 1001001001)\n cerr << \"inf\";\n else\n cerr << c;\n}\nvoid _cout(const long long &c) {\n if (c == 1001001001 || c == (1LL << 61) - 1)\n cerr << \"inf\";\n else if (c == -1001001001 || c == -((1LL << 61) - 1))\n cerr << \"-inf\";\n else\n cerr << c;\n}\nvoid _cout(const unsigned long long &c) {\n if (c == 1001001001 || c == (1LL << 61) - 1)\n cerr << \"inf\";\n else\n cerr << c;\n}\ntemplate <typename T, typename U>\nvoid _cout(const pair<T, U> &p) {\n cerr << \"{ \";\n _cout(p.fi);\n cerr << \", \";\n _cout(p.se);\n cerr << \" } \";\n}\ntemplate <typename T>\nvoid _cout(const vector<T> &v) {\n int s = v.size();\n cerr << \"{ \";\n for (int i = 0; i < s; i++) {\n cerr << (i ? \", \" : \"\");\n _cout(v[i]);\n }\n cerr << \" } \";\n}\ntemplate <typename T>\nvoid _cout(const vector<vector<T>> &v) {\n cerr << \"[ \";\n for (const auto &x : v) {\n cerr << endl;\n _cout(x);\n cerr << \", \";\n }\n cerr << endl << \" ] \";\n}\nvoid dbg_out() { cerr << endl; }\ntemplate <typename T, class... U>\nvoid dbg_out(const T &t, const U &... u) {\n _cout(t);\n if (sizeof...(u)) cerr << \", \";\n dbg_out(u...);\n}\ntemplate <typename T>\nvoid array_out(const T &v, int s) {\n cerr << \"{ \";\n for (int i = 0; i < s; i++) {\n cerr << (i ? \", \" : \"\");\n _cout(v[i]);\n }\n cerr << \" } \" << endl;\n}\ntemplate <typename T>\nvoid array_out(const T &v, int H, int W) {\n cerr << \"[ \";\n for (int i = 0; i < H; i++) {\n cerr << (i ? \", \" : \"\");\n array_out(v[i], W);\n }\n cerr << \" ] \" << endl;\n}\n#else\n#define trc(...)\n#define trca(...)\n#define trcc(...)\n#endif\n\ninline int popcnt(unsigned long long a) { return __builtin_popcountll(a); }\ninline int lsb(unsigned long long a) { return __builtin_ctzll(a); }\ninline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); }\ntemplate <typename T>\ninline int getbit(T a, int i) {\n return (a >> i) & 1;\n}\ntemplate <typename T>\ninline void setbit(T &a, int i) {\n a |= (1LL << i);\n}\ntemplate <typename T>\ninline void delbit(T &a, int i) {\n a &= ~(1LL << i);\n}\ntemplate <typename T>\nint lb(const vector<T> &v, const T &a) {\n return lower_bound(begin(v), end(v), a) - begin(v);\n}\ntemplate <typename T>\nint ub(const vector<T> &v, const T &a) {\n return upper_bound(begin(v), end(v), a) - begin(v);\n}\ntemplate <typename T>\nint btw(T a, T x, T b) {\n return a <= x && x < b;\n}\ntemplate <typename T, typename U>\nT ceil(T a, U b) {\n return (a + b - 1) / b;\n}\nconstexpr long long TEN(int n) {\n long long ret = 1, x = 10;\n while (n) {\n if (n & 1) ret *= x;\n x *= x;\n n >>= 1;\n }\n return ret;\n}\ntemplate <typename T>\nvector<T> mkrui(const vector<T> &v) {\n vector<T> ret(v.size() + 1);\n for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];\n return ret;\n};\ntemplate <typename T>\nvector<T> mkuni(const vector<T> &v) {\n vector<T> ret(v);\n sort(ret.begin(), ret.end());\n ret.erase(unique(ret.begin(), ret.end()), ret.end());\n return ret;\n}\ntemplate <typename F>\nvector<int> mkord(int N, F f) {\n vector<int> ord(N);\n iota(begin(ord), end(ord), 0);\n sort(begin(ord), end(ord), f);\n return ord;\n}\ntemplate <typename T = int>\nvector<T> mkiota(int N) {\n vector<T> ret(N);\n iota(begin(ret), end(ret), 0);\n return ret;\n}\ntemplate <typename T>\nvector<int> mkinv(vector<T> &v) {\n vector<int> inv(v.size());\n for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;\n return inv;\n}\n\nstruct IoSetupNya {\n IoSetupNya() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetupnya;\n\nvoid solve();\nint main() { solve(); }\n\n#pragma endregion\nusing namespace std;\n\ntemplate <typename T>\nstruct edge {\n int src, to;\n T cost;\n\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\n\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n\n operator int() const { return to; }\n};\ntemplate <typename T>\nusing Edges = vector<edge<T>>;\ntemplate <typename T>\nusing WeightedGraph = vector<Edges<T>>;\nusing UnweightedGraph = vector<vector<int>>;\n\n// Input of (Unweighted) Graph\nUnweightedGraph graph(int N, int M = -1, bool is_directed = false,\n bool is_1origin = true) {\n UnweightedGraph g(N);\n if (M == -1) M = N - 1;\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n if (is_1origin) x--, y--;\n g[x].push_back(y);\n if (!is_directed) g[y].push_back(x);\n }\n return g;\n}\n\n// Input of Weighted Graph\ntemplate <typename T>\nWeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,\n bool is_1origin = true) {\n WeightedGraph<T> g(N);\n if (M == -1) M = N - 1;\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n T c;\n cin >> c;\n if (is_1origin) x--, y--;\n g[x].eb(x, y, c);\n if (!is_directed) g[y].eb(y, x, c);\n }\n return g;\n}\n\n// Input of Edges\ntemplate <typename T>\nEdges<T> esgraph(int N, int M, int is_weighted = true, bool is_1origin = true) {\n Edges<T> es;\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n T c;\n if (is_weighted)\n cin >> c;\n else\n c = 1;\n if (is_1origin) x--, y--;\n es.emplace_back(x, y, c);\n }\n return es;\n}\n\n// Input of Adjacency Matrix\ntemplate <typename T>\nvector<vector<T>> adjgraph(int N, int M, T INF, int is_weighted = true,\n bool is_directed = false, bool is_1origin = true) {\n vector<vector<T>> d(N, vector<T>(N, INF));\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n T c;\n if (is_weighted)\n cin >> c;\n else\n c = 1;\n if (is_1origin) x--, y--;\n d[x][y] = c;\n if (!is_directed) d[y][x] = c;\n }\n return d;\n}\nusing namespace std;\n\n\n// Depth of Rooted Tree\n// unvisited nodes : d = -1\nvector<int> Depth(const UnweightedGraph &g, int start = 0) {\n vector<int> d(g.size(), -1);\n auto dfs = [&](auto rec, int cur, int par = -1) -> void {\n d[cur] = par == -1 ? 0 : d[par] + 1;\n for (auto &dst : g[cur]) {\n if (dst == par) continue;\n rec(rec, dst, cur);\n }\n };\n dfs(dfs, start);\n return d;\n}\n\n// Depth of Rooted Weighted Tree\n// unvisited nodes : d = -1\ntemplate <typename T>\nvector<T> Depth(const WeightedGraph<T> &g, int start = 0) {\n vector<T> d(g.size(), -1);\n auto dfs = [&](auto rec, int cur, T val, int par = -1) -> void {\n d[cur] = val;\n for (auto &dst : g[cur]) {\n if (dst == par) continue;\n rec(rec, dst, val + dst.cost, cur);\n }\n };\n dfs(dfs, start, 0);\n return d;\n}\n\n// Diameter of Tree\n// return value : { {u, v}, length }\npair<pair<int, int>, int> Diameter(const UnweightedGraph &g) {\n auto d = Depth(g, 0);\n int u = max_element(begin(d), end(d)) - begin(d);\n d = Depth(g, u);\n int v = max_element(begin(d), end(d)) - begin(d);\n return make_pair(make_pair(u, v), d[v]);\n}\n\n// Diameter of Weighted Tree\n// return value : { {u, v}, length }\ntemplate <typename T>\npair<pair<int, int>, T> Diameter(const WeightedGraph<T> &g) {\n auto d = Depth(g, 0);\n int u = max_element(begin(d), end(d)) - begin(d);\n d = Depth(g, u);\n int v = max_element(begin(d), end(d)) - begin(d);\n return make_pair(make_pair(u, v), d[v]);\n}\n\n// nodes on the path u-v ( O(N) )\ntemplate <typename G>\nvector<int> Path(G &g, int u, int v) {\n vi ret;\n int end = 0;\n auto dfs = [&](auto rec, int cur, int par = -1) -> void {\n ret.push_back(cur);\n if (cur == v) {\n end = 1;\n return;\n }\n for (int dst : g[cur]) {\n if (dst == par) continue;\n rec(rec, dst, cur);\n if (end) return;\n }\n if (end) return;\n ret.pop_back();\n };\n dfs(dfs, u);\n return ret;\n}\n\nstring ans;\nint n = 0;\n\ntemplate <typename G>\nstruct CentroidDecomposition {\n const G &g;\n vector<int> sub;\n vector<bool> v;\n vector<vector<int>> tree;\n int root;\n\n CentroidDecomposition(const G &g_, int isbuild = true) : g(g_) {\n sub.resize(g.size(), 0);\n v.resize(g.size(), false);\n if (isbuild) build();\n }\n\n void build() {\n tree.resize(g.size());\n root = build_dfs(0);\n }\n\n int get_size(int cur, int par) {\n sub[cur] = 1;\n for (auto &dst : g[cur]) {\n if (dst == par || v[dst]) continue;\n sub[cur] += get_size(dst, cur);\n }\n return sub[cur];\n }\n\n int get_centroid(int cur, int par, int mid) {\n for (auto &dst : g[cur]) {\n if (dst == par || v[dst]) continue;\n if (sub[dst] > mid) return get_centroid(dst, cur, mid);\n }\n return cur;\n }\n\n array<int, 3> calc(int cur, int par) {\n array<int, 3> r1{0, 0, 0}, r2{0, 0, 0};\n for (auto &dst : g[cur]) {\n if (dst == par || v[dst]) continue;\n auto d = calc(dst, cur);\n rep(i, 3) {\n if (d[i] > r1[i]) swap(d[i], r1[i]);\n if (d[i] > r2[i]) swap(d[i], r2[i]);\n }\n }\n if (ans[cur] == 'R') r1[0]++;\n if (ans[cur] == 'G') r1[1]++;\n if (ans[cur] == 'B') r1[2]++;\n rep(i, 3) amax(n, r1[i] + r2[i]);\n return r1;\n }\n\n int build_dfs(int cur) {\n int centroid = get_centroid(cur, -1, get_size(cur, -1) / 2);\n v[centroid] = true;\n calc(centroid, -1);\n for (auto &dst : g[centroid]) {\n if (!v[dst]) {\n int nxt = build_dfs(dst);\n if (centroid != nxt) tree[centroid].emplace_back(nxt);\n }\n }\n v[centroid] = false;\n return centroid;\n }\n};\n\nint solve_(int N, vvi g) {\n // ini(N);\n // auto g = graph(N);\n ans.resize(N);\n fill(all(ans), ' ');\n\n auto [p, l] = Diameter(g);\n auto [u, v] = p;\n auto path = Path(g, u, v);\n\n int i = 0;\n auto c = [&]() { return i == 0 ? 'R' : i == 1 ? 'G' : 'B'; };\n //int i = 0;\n rep(j,sz(path)) {\n ans[path[j]] = c();\n i = (i + 1) % 3;\n } \n //out(path);\n //out(ans);\n {\n i = 0;\n int rev = 0;\n auto dfs = [&](auto rec, int cur, int par) -> void {\n ans[cur] = c();\n each(dst, g[cur]) {\n if (dst == par || ans[dst] != ' ') continue;\n i = (rev ? (i + 2) % 3 : (i + 1) % 3);\n rec(rec, dst, cur);\n i = (rev ? (i + 1) % 3 : (i + 2) % 3);\n }\n };\n for(int j = 0; j < sz(path); j++){\n if(j * 2 <= sz(path) ) rev = 1;\n else rev = 0;\n i = j % 3;\n dfs(dfs, path[j], -1);\n }\n }\n each(x, ans) if (x == ' ') exit(1);\n // trc(ans);\n n = 0;\n CentroidDecomposition<vvi> dec(g);\n out(n);\n out(ans);\n return n;\n}\n\nint naive(int N, vvi g) {\n ans.resize(N, ' ');\n int n2 = inf;\n rep(i, int(pow(3, N))) {\n int j = i;\n rep(_, N) {\n int k = j % 3;\n j /= 3;\n ans[_] = (k == 0 ? 'R' : k == 1 ? 'G' : 'B');\n }\n n = 0;\n CentroidDecomposition<vvi> dec(g);\n amin(n2, n);\n }\n return n2;\n}\n\nvoid solve() {\n /**/\n ini(N);\n auto g=graph(N);\n solve_(N,g);\n //*/\n /**\n mt19937 rng;\n while (1) {\n int N = rng() % 7 + 2;\n vvi g(N);\n rep1(i, N - 1) {\n int j = rng() % i;\n g[i].push_back(j);\n g[j].push_back(i);\n }\n int n1 = solve_(N, g);\n int n2 = naive(N, g);\n if (n1 != n2) {\n trc(N);\n trc(g);\n trc(n1, n2);\n exit(1);\n }\n //trc(N);\n }\n //*/\n \n}","accuracy":1,"time_ms":310,"memory_kb":54372,"score_of_the_acc":-0.5912,"final_rank":15},{"submission_id":"aoj_3158_4833422","code_snippet":"#pragma region Macros\n#pragma GCC optimize(\"O3\")\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define pb push_back\n#define eb emplace_back\n#define vi vector<int>\n#define vll vector<ll>\n#define vpi vector<pii>\n#define vpll vector<pll>\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n#define fi first\n#define se second\n#define all(c) begin(c), end(c)\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\nusing namespace std;\nstring YES[2] = {\"NO\", \"YES\"};\nstring Yes[2] = {\"No\", \"Yes\"};\nstring yes[2] = {\"no\", \"yes\"};\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n#define si(c) (int)(c).size()\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\n scan(head);\n IN(tail...);\n}\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\nvi iota(int n) {\n vi a(n);\n iota(all(a), 0);\n return a;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n sort(all(y));\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\nint popcount(ll x) { return __builtin_popcountll(x); }\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n }\n} setup_io;\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return move(res);\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return move(res);\n}\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n for(auto &e : v) cout << e << \" \";\n cout << endl;\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n cout << \"(\" << p.fi << \", \" << p.se << \")\";\n return os;\n}\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\ntemplate <class A> string to_string(A v) {\n if(v.empty()) return \"{}\";\n string ret = \"{\";\n for(auto &x : v) ret += to_string(x) + \",\";\n ret.back() = '}';\n return ret;\n}\n\nvoid dump() { cerr << endl; }\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#define endl '\\n'\n#ifdef _LOCAL\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\n#define debug(x)\n#endif\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\n#pragma endregion\n\nusing tree = Graph;\nint search_center(tree &g) {\n vector<int> res;\n int max_depth = -1, leaf;\n auto dfs = [&](auto &&self, int x, int p, int d, bool looking = false) -> bool {\n bool flag = false;\n if(max_depth < d) {\n max_depth = d, leaf = x, flag = true;\n res.clear();\n }\n for(auto e : g[x]) {\n if(e != p) flag |= self(self, e, x, d + 1, looking);\n }\n if(looking and flag and d == (max_depth >> 1) or d == ((max_depth + 1) >> 1)) res.emplace_back(x);\n return flag;\n };\n dfs(dfs, 0, -1, 0);\n max_depth = -1;\n dfs(dfs, leaf, -1, 0, true);\n return res[0];\n}\nint main() {\n string s = \"RGB\";\n INT(n);\n Graph g = getG(n);\n if(n <= 3) {\n cout << 1 << endl;\n cout << s.substr(0, n) << endl;\n exit(0);\n }\n vi ans(n);\n int num = 0;\n int c = search_center(g);\n vi d(n);\n {\n auto dfs = [&](auto &&f, int x, int p) -> int {\n d[x] = 1;\n for(auto e : g[x])\n if(e != p) chmax(d[x], f(f, e, x) + 1);\n return d[x];\n };\n dfs(dfs, c, -1);\n }\n int ma[2] = {};\n vi v;\n for(auto e : g[c]) v.eb(d[e]);\n sort(all(v), greater<>());\n num = 1 + v[0] / 3 + v[1] / 3;\n int cnt = 0;\n for(auto e : v)\n if(v[0] / 3 == e / 3) cnt += e % 3;\n if(cnt > 2) num++;\n cout << num << endl;\n auto dfs = [&](auto &&f, int x, int p, int col, int dx) -> void {\n ans[x] = col;\n col = (col + 3 + dx) % 3;\n for(auto e : g[x])\n if(e != p) f(f, e, x, col, dx);\n };\n vi w;\n for(auto e : g[c]) w.eb(e);\n sort(all(w), [&](int i, int j) { return d[i] > d[j]; });\n int k = 1;\n for(auto e : w) {\n dfs(dfs, e, c, (3 + k) % 3, k);\n k *= -1;\n }\n rep(i, n) cout << s[ans[i]];\n cout << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":34400,"score_of_the_acc":-0.2393,"final_rank":7},{"submission_id":"aoj_3158_4833314","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=998244353,MAX=200005,INF=1<<30;\nvector<int> G[MAX];\nint deg[MAX];\nint ans[MAX];\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int N;cin>>N;\n \n if(N==1){\n cout<<1<<endl;\n cout<<\"R\"<<endl;\n return 0;\n }\n \n for(int i=0;i<N-1;i++){\n int a,b;cin>>a>>b;\n a--;b--;\n G[a].push_back(b);\n G[b].push_back(a);\n deg[a]++;\n deg[b]++;\n }\n \n memset(ans,-1,sizeof(ans));\n \n int rem=N,now=0,res=0;\n \n set<int> SE;\n for(int i=0;i<N;i++) if(deg[i]==1) SE.insert(i);\n \n while(rem){\n set<int> nex;\n if(rem<=3&&now%3==0){\n int cnt=0;\n for(int i=0;i<N;i++){\n if(ans[i]==-1){\n ans[i]=cnt;\n cnt++;\n }\n }\n res=now/3*2+1;\n \n break;\n }else{\n for(auto a:SE){\n ans[a]=now;\n deg[a]=0;\n rem--;\n \n for(int to:G[a]){\n if(ans[to]!=-1) continue;\n deg[to]--;\n if(deg[to]==1) nex.insert(to);\n }\n }\n \n res=(now/3+1)*2;\n }\n \n now++;\n SE=nex;\n }\n \n cout<<res<<endl;\n \n for(int i=0;i<N;i++){\n if(ans[i]%3==0) cout<<'R';\n else if(ans[i]%3==1) cout<<'G';\n else cout<<'B';\n }\n cout<<endl;\n}","accuracy":1,"time_ms":90,"memory_kb":25276,"score_of_the_acc":-0.1586,"final_rank":1},{"submission_id":"aoj_3158_4833256","code_snippet":"#include <string>\n#include <vector>\n#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<list>\n#include<deque>\n#include<bitset>\n#include<set>\n#include<map>\n#include<unordered_map>\n#include<unordered_set>\n#include<cstring>\n#include<sstream>\n#include<complex>\n#include<iomanip>\n#include<numeric>\n#include<cassert>\n#include<random>\n#define X first\n#define Y second\n#define pb push_back\n#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))\n#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))\n#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))\n#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))\n#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))\n#define peat(X,Y) for (;(X) < (Y);++(X))\n#define all(X) (X).begin(),(X).end()\n#define rall(X) (X).rbegin(),(X).rend()\n#define eb emplace_back\n#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())\n#define Endl endl\n#define NL <<\"\\n\"\n#define cauto const auto\n\nusing namespace std;\nusing ll=long long;\nusing pii=pair<int,int>;\nusing pll=pair<ll,ll>;\ntemplate<class T> using vv=vector<vector<T>>;\ntemplate<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}\ntemplate<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}\n//#undef NUIP\n#ifdef NUIP\n#include \"benri.h\"\n#else\n#define out(args...)\n#endif\n#ifdef __cpp_init_captures\ntemplate<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}\ntemplate <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}\n#endif\ntemplate<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}\ntemplate<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}\ntemplate<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}\ntemplate<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}\ntemplate<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}\ntemplate<class T=ll> T read(){ T re; cin>>re; return move(re);}\ntemplate<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}\ntemplate<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}\ntemplate<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}\nvv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}\nvv<int> readG(const int &n){ return readG(n,n-1);}\nconst ll MOD=1e9+7; //998244353\n\nvector<int> getDiam(const vv<int> &g){\n\tconst int n=g.size();\n\tint rt;\n\t{\n\t\tvector<int> d(n,MOD); d[0]=0;\n\t\tqueue<int> que; que.emplace(0);\n\t\twhile(que.size()){\n\t\t\tcauto v=que.front(); que.pop();\n\t\t\tfor(auto w:g[v])if(MN(d[w],d[v]+1)) que.emplace(w);\n\t\t}\n\t\tint mx=-1;\n\t\trep(v,n)if(MX(mx,d[v])) rt=v;\n\t\tout(d[3],mx,rt,1);\n\t}\n\tvector<int> re;\n\t{\n\t\tvector<pii> d(n,{MOD,0}); d[rt]={0,-1};\n\t\tqueue<int> que; que.emplace(rt);\n\t\twhile(que.size()){\n\t\t\tcauto v=que.front(); que.pop();\n\t\t\tfor(auto w:g[v])if(MN(d[w],{d[v].X+1,v})) que.emplace(w);\n\t\t}\n\t\tpii mx{-1,0};\n\t\tre.eb();\n\t\trep(v,n)if(MX(mx,d[v])) re.back()=v;\n\t\tout(d[3],re,rt,1);\n\t\twhile(re.back()!=rt){\n\t\t\tcauto tmp=d[re.back()].Y;\n\t\t\tre.eb(tmp);\n\t\t}\n\t\treturn re;\n\t}\n}\n\nvector<int> solve(const vv<int> &g){\n\tconst int n=g.size();\n\t// if(n==3) return {0,1,2};\n\tcauto diam=getDiam(g);\n\tout(diam,1);\n\tcauto rt=diam[diam.size()/2];\n\tvector<int> re(n,MOD); re[rt]=0;\n\tqueue<int> que; que.emplace(rt);\n\twhile(que.size()){\n\t\tcauto v=que.front(); que.pop();\n\t\tfor(auto w:g[v])if(MN(re[w],re[v]+1)) que.emplace(w);\n\t}\n\tfor(auto &x:re) x%=3;\n\tif(diam.size()%2){\n\t\tauto dfs=\n\t\t[&](auto &&dfs,int v,int p)->void{\n\t\t\tif(re[v]) re[v]=3-re[v];\n\t\t\tfor(auto w:g[v])if(w!=p) dfs(dfs,w,v);\n\t\t};\n\t\tdfs(dfs,rt,diam[diam.size()/2-1]);\n\t}else{\n\t\tauto dfs=\n\t\t[&](auto &&dfs,int v,int p)->void{\n\t\t\tre[v]=2-re[v];\n\t\t\tfor(auto w:g[v])if(w!=p) dfs(dfs,w,v);\n\t\t};\n\t\tdfs(dfs,rt,diam[diam.size()/2-1]);\n\t}\n\t// out(re,1);\n\treturn re;\n}\n\nint calc(const vv<int> &g, vector<int> cs){\n\tconst int n=g.size();\n\tvector<array<int,3>> cnt(n,{0,0,0});\n\tint re=1;\n\tauto dfs=\n\t\t[&](auto &&dfs,int v,int p)->void{\n\t\t\tarray<int,3> mx{0,0,0};\n\t\t\tfor(auto w:g[v])if(w!=p){\n\t\t\t\tdfs(dfs,w,v);\n\t\t\t\trep(i,3) MX(re,mx[i]+cnt[w][i]+(cs[v]==i));\n\t\t\t\trep(i,3) out(v,w,i,mx,cnt[w],mx[i]+cnt[w][i]+(cs[v]==i),1);\n\t\t\t\trep(i,3){\n\t\t\t\t\tMX(cnt[v][i],cnt[w][i]);\n\t\t\t\t\tMX(mx[i],cnt[w][i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\t++cnt[v][cs[v]];\n\t\t};\n\tdfs(dfs,0,-1);\n\treturn re;\n}\n\nmt19937 rnd(123);\nvv<int> tree(int n){\n\tvv<int> g(n);\n\tvector<int> ind(n); iota(all(ind),0);\n\tshuffle(all(ind),rnd);\n\treps(i,1,n){\n\t\tint a=ind[i];\n\t\tint b=ind[i-1];\n\t\t// while(b>0){\n\t\t// \tif(rnd()%2) break;\n\t\t// \t--b;\n\t\t// }\n\t\tg[a].pb(b);\n\t\tg[b].pb(a);\n\t}\n\treturn g;\n}\n\nint main(){\n ios_base::sync_with_stdio(false); cin.tie(0);\n cout<<fixed<<setprecision(0);\n\t// cauto gg=tree(100000);\n\t// out(solve(gg),1); return 0;\n// \tout(calc({{5,7}\n// ,{7}\n// ,{5,4}\n// ,{6}\n// ,{2}\n// ,{0,2}\n// ,{7,3}\n// \t\t\t\t\t\t,{0,1,6}},{1,1,0,0,0,0,0,0}),1);\n// \treturn 0;\n\tif(0){\n\t\tconst int N=12;\n\t\tvector<int> pw(N+1); pw[0]=1;\n\t\trep(i,N) pw[i+1]=pw[i]*3;\n\t\trep(_,1000){\n\t\t\tconst int n=rand()%N+1;\n\t\t\tcauto g=tree(n);\n\t\t\tint best=n;\n\t\t\tvector<int> wit;\n\t\t\trep(i,pw[n]){\n\t\t\t\tvector<int> v(n);\n\t\t\t\trep(j,n) v[j]=i/pw[j]%3;\n\t\t\t\tif(MN(best,calc(g,v))) wit=v;\n\t\t\t}\n\t\t\tcauto ans=solve(g);\n\t\t\tint act=calc(g,ans);\n\t\t\tif(act!=best){\n\t\t\t\tout(g,ans,act,best,wit,1);\n\t\t\t\trep(v,n)for(auto w:g[v])if(v<w) cout<<v<<\" \"<<w NL;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t}\n\t\tout(\"done\",1);\n\t\texit(0);\n\t}\n\tcauto n=read();\n\tcauto g=readG(n);\n\tcauto re=solve(g);\n\tcout<<calc(g,re) NL;\n\tfor(auto x:re) cout<<\"RGB\"[x]; cout NL;\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":39764,"score_of_the_acc":-0.302,"final_rank":10},{"submission_id":"aoj_3158_4833048","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> l_l;\ntypedef pair<int, int> i_i;\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nconst long long INF = 1e18;\n//const ll mod = 1000000007;\nll dist[10][201000];\nll N;\nvector<ll> edges[201000];\nll ans = 0;\nchar S[201000];\nstring RGB = \"RGB\";\nvector<ll> dp[201000];\n\nvoid dfs(int idx, int now, int from) {\n for(auto to : edges[now]) {\n if(to == from) continue;\n dist[idx][to] = dist[idx][now] + 1;\n dfs(idx, to, now);\n }\n}\n\nvoid dfs2(ll now, ll from) {\n for(int i = 0; i < 3; i++) {\n if(RGB[i] == S[now]) dp[now][i]++;\n chmax(ans, dp[now][i]);\n }\n for(auto to : edges[now]) {\n if(to == from) continue;\n dp[to] = dp[now];\n dfs2(to, now);\n }\n}\n\nvoid dfs3(int idx, int now, int from) {\n dist[idx][now] = 1;\n for(auto to : edges[now]) {\n if(to == from) continue;\n dfs3(idx, to, now);\n chmax(dist[idx][now], dist[idx][to] + 1);\n }\n}\n\nstring T[2] = {\"RGB\", \"GRB\"};\n\nvoid dfs4(string T, int idx, int now, int from) {\n S[now] = T[idx];\n for(auto to : edges[now]) {\n if(to == from) continue;\n dfs4(T, (idx + 1) % 3, to, now);\n }\n}\n\nvoid f(ll c) {\n map<ll, vector<ll>> mp;\n for(auto to : edges[c]) {\n mp[-dist[2][to]].push_back(to);\n }\n int parity = 0;\n for(auto tmp : mp) {\n ll d = -tmp.first;\n auto v = tmp.second;\n /*\n cerr << \"- \" << d << \" -\" << endl;\n for(auto tmp : v) {\n cerr << tmp << \" \";\n }\n cerr << endl;\n */\n if(v.size() == 1) {\n ll len = 1 + 2 * d - 1;\n chmax(ans, (len + 2) / 3);\n } else if(v.size() == 2) {\n ll len = 1 + 2 * d;\n chmax(ans, (len + 2) / 3);\n } else {\n if(d % 3 == 0) {\n chmax(ans, 1 + (d / 3) * 2);\n } else {\n chmax(ans, (d + 2) / 3 * 2);\n }\n }\n for(auto to : v) {\n dfs4(T[parity], 0, to, c);\n parity = 1 - parity;\n }\n }\n}\n\n\nint main() {\n cin >> N;\n for(int i = 0; i < N - 1; i++) {\n ll a, b;\n cin >> a >> b;\n a--;\n b--;\n edges[a].push_back(b);\n edges[b].push_back(a);\n }\n dist[0][0] = 0;\n dfs(0, 0, -1);\n ll B = 0;\n for(int i = 0; i < N; i++) {\n if(dist[0][i] > dist[0][B]) B = i;\n }\n dist[0][B] = 0;\n dfs(0, B, -1);\n ll A = 0;\n for(int i = 0; i < N; i++) {\n if(dist[0][A] < dist[0][i]) A = i;\n }\n dist[1][A] = 0;\n dfs(1, A, -1);\n ll c;\n for(int i = 0; i < N; i++) {\n if(dist[0][i] + dist[1][i] == dist[0][A] and abs(dist[0][i] - dist[1][i]) <= 1) {\n c = i;\n }\n }\n //cerr << A << \" \" << B << \" \" << c << endl;\n dfs3(2, c, -1);\n S[c] = 'B';\n f(c);\n dp[A] = {0, 0, 0};\n dfs2(A, -1);\n cout << ans << endl;\n for(int i = 0; i < N; i++) cout << S[i];\n cout << endl;\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":45576,"score_of_the_acc":-0.4807,"final_rank":12},{"submission_id":"aoj_3158_4832749","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\n//#include<atcoder/dsu>\n//#include<atcoder/fenwicktree>\n//#include<atcoder/math>\n//#include<atcoder/maxflow>\n\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 998244353;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m) {\n\tif (x >= m)x %= m;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\n\n\nconst int mn = 1 << 18;\nstruct edge {\n\tint to;\n};\nstruct Data {\n\tint d, ma;\n};\nvector<edge> G[mn];\nvector<int> ids[mn];\nvector<Data> memo[mn];\nint root;\n\nData merge(Data a, Data b) {\n\tData res;\n\t//\n\tres.d = max(a.d, b.d);\n\tres.ma = max(a.ma, b.ma);\n\t//\n\treturn res;\n}\n\nvoid add(P& p, int x) {\n\tif (p.first < x) {\n\t\tp.second = p.first;\n\t\tp.first = x;\n\t}\n\telse if (p.second < x)p.second = x;\n}\nData dfs(int id, int fr) {\n\tData res;\n\t//\n\t//initialize\n\tres = { 0,1 };\n\tP p = { 0,0 };\n\t//\n\tfor (edge e : G[id]) {\n\t\tif (e.to == fr)continue;\n\t\tData nex = dfs(e.to, id);\n\t\t//\n\t\t//update with edge\n\t\t//\n\t\tadd(p, nex.d);\n\t\tres = merge(res, nex);\n\t\tids[id].push_back(e.to);\n\t\tmemo[id].push_back(nex);\n\t}\n\t\n\t//\n\t//update for return\n int s0 = p.first/ 3 + p.second / 3 + 1;\n int s1 = (p.first+2) / 3 + (p.second+2) / 3;\n res.ma = max({ res.ma,s0,s1 });\n\tres.d++;\n\n\t//\n\treturn res;\n}\n\nint score[1 << 18];\nvoid invdfs(int id, int fr, Data pre) {\n\tvector<Data> v;\n\tfor (Data d : memo[id])v.push_back(d);\n\tif (fr >= 0)v.push_back(pre);\n\tint len = v.size();\n\t//\n\tP p = { 0,0 };\n\t//calcurate id's ans\n\tfor (Data d : v) {\n\t\tscore[id] = max(score[id], d.ma);\n\t\tadd(p, d.d);\n\t}\n\tint s0 = p.first / 3 + p.second / 3 + 1;\n\tint s1 = (p.first+2) / 3 + (p.second+2) / 3;\n\tscore[id] = max({ score[id],s0,s1 });\n\t//\n\tvector<Data> le(len + 1);\n\tvector<Data> ri(len + 1);\n\tvector<P> ple(len + 1);\n\tvector<P> pri(len + 1);\n\t//\n\tData init_c = { 0,0 };\n\t//\n\tle[0] = init_c;\n\tple[0] = { 0,0 };\n\trep(i, len) {\n\t\tle[i + 1] = merge(le[i], v[i]);\n\t\tple[i + 1] = ple[i]; add(ple[i + 1], v[i].d);\n\n\t}\n\tri[len] = init_c;\n\tpri[len] = { 0,0 };\n\tper(i, len) {\n\t\tri[i] = merge(ri[i + 1], v[i]);\n\t\tpri[i] = pri[i + 1]; add(pri[i], v[i].d);\n\t}\n\trep(i, ids[id].size()) {\n\t\tint to = ids[id][i];\n\t\tData d = merge(le[i], ri[i + 1]);\n\n\t\t//\n\t\t//update for return\n\t\tP p = { 0,0 };\n\t\tadd(p, ple[i].first);\n\t\tadd(p, ple[i].second);\n\t\tadd(p, pri[i+1].first);\n\t\tadd(p, pri[i+1].second);\n\n\t\tint s0 = p.first / 3 + p.second / 3 + 1;\n\t\tint s1 = (p.first+2) / 3 + (p.second+2) / 3;\n\t\td.ma = max({ d.ma,s0,s1 });\n\t\td.d++;\n\t\t//\n\t\tinvdfs(to, id, d);\n\t}\n}\nvoid yaru() {\n\tdfs(root, -1);\n\tinvdfs(root, -1, { 0,0 });\n}\n\n\n\nstring s = \"RGB\";\nstring ans;\nvoid dfs(int id, int fr, int col) {\n\tif (col == 3)col = 0;\n\tans[id] = s[col];\n\tfor (edge e : G[id])if (e.to != fr) {\n\t\tdfs(e.to, id, col + 1);\n\t}\n}\n\nint calcans() {\n\tint ma = 0;\n\trep(i, 3) {\n\t\tfunction<int(int, int)> calc = [&](int id, int fr)->int {\n\t\t\tvector<int> ts;\n\t\t\tfor (edge e : G[id])if (e.to != fr) {\n\t\t\t\tint nex = calc(e.to, id);\n\t\t\t\tts.push_back(nex);\n\t\t\t}\n\t\t\tsort(all(ts), greater<int>());\n\t\t\tif (ts.size() >= 2) {\n\t\t\t\tint sum = ts[0] + ts[1];\n\t\t\t\tif (ans[id] == s[i])sum++;\n\t\t\t\tma = max(ma, sum);\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tif (ts.size()) {\n\t\t\t\tres = ts[0];\n\t\t\t}\n\t\t\tif (ans[id] == s[i])res++;\n\t\t\tma = max(ma, res);\n\t\t\treturn res;\n\t\t}; calc(0, -1);\n\t}\n\treturn ma;\n}\n\nvoid solve() {\n\tint n; cin >> n; ans.resize(n);\n\trep(i, n - 1) {\n\t\tint a, b; cin >> a >> b; a--; b--;\n\t\tG[a].push_back({ b });\n\t\tG[b].push_back({ a });\n\t}\n\tyaru();\n\tint mi = mod;\n\tint chk = -1;\n\trep(i, n) {\n\t\tif (mi > score[i]) {\n\t\t\tmi = score[i];\n\t\t\tchk = i;\n\t\t}\n\t}\n\tdfs(chk, -1, 0);\n\tint val = calcans();\n\tassert(mi == val);\n\tcout << mi << \"\\n\";\n\tcout << ans << \"\\n\";\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(15);\n\t//init_f();\n\t//init();\n\t//expr();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":340,"memory_kb":106776,"score_of_the_acc":-1.1667,"final_rank":17},{"submission_id":"aoj_3158_4832735","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(long long i=0;i<(long long)(n);i++)\n#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)\n#define all(a) a.begin(),a.end()\n#define pb emplace_back\n#define eb emplace_back\n#define lb(v,k) (lower_bound(all(v),k)-v.begin())\n#define ub(v,k) (upper_bound(all(v),k)-v.begin())\n#define fi first\n#define se second\n#define pi M_PI\n#define PQ(T) priority_queue<T>\n#define SPQ(T) priority_queue<T,vector<T>,greater<T>>\n#define dame(a) {out(a);return 0;}\n#define decimal cout<<fixed<<setprecision(15);\n#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef tuple<ll,ll,ll> PP;\ntypedef tuple<ll,ll,ll,ll> PPP;\ntypedef multiset<ll> S;\nusing vi=vector<ll>;\nusing vvi=vector<vi>;\nusing vvvi=vector<vvi>;\nusing vvvvi=vector<vvvi>;\nusing vp=vector<P>;\nusing vvp=vector<vp>;\nusing vb=vector<bool>;\nusing vvb=vector<vb>;\nconst ll inf=1001001001001001001;\nconst ll INF=1001001001;\nconst ll mod=1000000007;\nconst double eps=1e-10;\ntemplate<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}\ntemplate<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}\ntemplate<class T> void out(T a){cout<<a<<'\\n';}\ntemplate<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\\n';}\ntemplate<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\\n';}\ntemplate<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}\ntemplate<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\\n';}\ntemplate<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}\ntemplate<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}\ntemplate<class T> void yesno(T b){if(b)out(\"yes\");else out(\"no\");}\ntemplate<class T> void YesNo(T b){if(b)out(\"Yes\");else out(\"No\");}\ntemplate<class T> void YESNO(T b){if(b)out(\"YES\");else out(\"NO\");}\ntemplate<class T> void noyes(T b){if(b)out(\"no\");else out(\"yes\");}\ntemplate<class T> void NoYes(T b){if(b)out(\"No\");else out(\"Yes\");}\ntemplate<class T> void NOYES(T b){if(b)out(\"NO\");else out(\"YES\");}\nvoid outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}\nll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}\nll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}\nvvi g;\nvi diameter(){\n ll n=g.size(),ne;\n vi par(n,-1);\n P far(-1,0);\n rep(tt,2){\n vi dis(n,inf);\n queue<ll> q;\n ne=far.se;\n q.emplace(ne);\n dis[ne]=0;\n while(!q.empty()){\n auto t=q.front();q.pop();\n for(ll x:g[t]){\n if(chmin(dis[x],dis[t]+1)){\n q.emplace(x);\n par[x]=t;\n }\n }\n }\n far=P(-1,0);\n rep(i,n)chmax(far,P(dis[i],i));\n }\n ll w=far.se;\n vi res;\n while(w!=ne){\n res.pb(w);\n w=par[w];\n }\n res.pb(ne);\n return res;\n}\nvi ans;\nvoid dfs0(int i,int p,int c){\n for(ll x:g[i])if(x!=p){\n ll nc=c-1;if(nc==-1)nc=2;\n ans[x]=nc;\n dfs0(x,i,nc);\n }\n}\nvoid dfs1(int i,int p,int c){\n for(ll x:g[i])if(x!=p){\n ll nc=c+1;if(nc==3)nc=0;\n ans[x]=nc;\n dfs1(x,i,nc);\n }\n}\nll res=0;\nvi dfs(int i,int p){\n vvi v(3);\n for(ll x:g[i])if(x!=p){\n auto t=dfs(x,i);\n rep(cnt,3)v[cnt].pb(t[cnt]);\n }\n rep(cnt,3){\n sort(all(v[cnt]));reverse(all(v[cnt]));\n }\n vi r(3),t(3);\n if(v[0].size())rep(c,3)r[c]=v[c][0];\n if(v[0].size()>1)rep(c,3)t[c]=v[c][0]+v[c][1];\n r[ans[i]]++;t[ans[i]]++;\n rep(c,3){chmax(res,r[c]);chmax(res,t[c]);}\n return r;\n}\nint main(){\n ll n;cin>>n;\n g=vvi(n);\n rep(i,n-1){\n ll a,b;cin>>a>>b;a--;b--;\n g[a].pb(b);g[b].pb(a);\n }\n vi d=diameter();\n // outv(d);\n ans=vi(n);\n rep(i,d.size()/2){\n ans[d[i]]=i%3;\n for(ll x:g[d[i]]){\n if((i!=d.size()-1&&x==d[i+1])||(i&&x==d[i-1]))continue;\n ans[x]=ans[d[i]]-1;\n if(ans[x]==-1)ans[x]=2;\n dfs0(x,d[i],ans[x]);\n }\n }\n REP(i,d.size()/2,d.size()){\n ans[d[i]]=i%3;\n for(ll x:g[d[i]]){\n if((i!=d.size()-1&&x==d[i+1])||(i&&x==d[i-1]))continue;\n ans[x]=ans[d[i]]+1;\n if(ans[x]==3)ans[x]=0;\n dfs1(x,d[i],ans[x]);\n }\n }\n // outv(ans);\n dfs(0,-1);\n out(res);\n for(ll x:ans){\n if(x==0)cout<<'R';\n if(x==1)cout<<'G';\n if(x==2)cout<<'B';\n }\n cout<<endl;\n}","accuracy":1,"time_ms":150,"memory_kb":60588,"score_of_the_acc":-0.5686,"final_rank":14},{"submission_id":"aoj_3158_4832645","code_snippet":"#include <stdio.h>\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define modulo N\n#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)\n#define Inf 1000000000000000000\nint Ans;\nstring S;\nint N;\nint D;\nvector<vector<int>> E;\nstruct tree_diameter{\n\tconst long long X = 1000000000000000000;\n\tpair<long long,vector<int>> get(vector<vector<pair<int,long long>>> &E){\n\t\tvector<long long> dis = bfs(E,0);\n\t\tlong long maxi = -1;\n\t\tint ind = 0;\n\t\tfor(int i=0;i<E.size();i++){\n\t\t\tif(dis[i]>maxi){\n\t\t\t\tmaxi=dis[i];\n\t\t\t\tind=i;\n\t\t\t}\n\t\t}\n\n\t\tdis = bfs(E,ind);\n\t\tmaxi = -1;\n\n\t\tfor(int i=0;i<E.size();i++){\n\t\t\tif(dis[i]>maxi){\n\t\t\t\tmaxi=dis[i];\n\t\t\t\tind=i;\n\t\t\t}\n\t\t}\n\n\t\tvector<int> ret;\n\t\tret.push_back(ind);\n\t\twhile(dis[ind]!=0LL){\n\t\t\tfor(int i=0;i<E[ind].size();i++){\n\t\t\t\tif(dis[ind] == dis[E[ind][i].first] + E[ind][i].second){\n\t\t\t\t\tind = E[ind][i].first;\n\t\t\t\t\tret.push_back(ind);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn make_pair(maxi,ret);\n\t\t\n\t}\n\t\n\tpair<long long,vector<int>> get(vector<vector<int>> &E){\n\t\tvector<vector<pair<int,long long>>> e(E.size(),vector<pair<int,long long>>());\n\t\tfor(int i=0;i<E.size();i++){\n\t\t\tfor(int j=0;j<E[i].size();j++){\n\t\t\t\te[i].emplace_back(E[i][j],1LL);\n\t\t\t}\n\t\t}\n\t\treturn get(e);\n\t}\n\t\n\tvector<long long> bfs(vector<vector<pair<int,long long>>> &E,int start){\n\t\tvector<long long> dis(E.size(),X);\n\t\tdis[start] = 0LL;\n\t\tqueue<int> Q;\n\t\tQ.push(start);\n\t\t\n\t\twhile(Q.size()!=0){\n\t\t\tint u = Q.front();\n\t\t\tQ.pop();\n\t\t\tfor(int i=0;i<E[u].size();i++){\n\t\t\t\tint v = E[u][i].first;\n\t\t\t\tif(dis[v]!=X)continue;\n\t\t\t\tdis[v] = dis[u] + E[u][i].second;\n\t\t\t\tQ.push(v);\n\t\t\t}\n\t\t}\n\t\treturn dis;\n\t}\n\t\n};\nvector<int> maxi;\n\nvoid dfs(int now,int p){\n\trep(i,E[now].size()){\n\t\tint to = E[now][i];\n\t\tif(to==p)continue;\n\t\tdfs(to,now);\n\t\tmaxi[now] = max(maxi[to] + 1,maxi[now]);\n\t}\n}\nstring s = \"RGB\";\nvoid dfs2(int now,int p,int ind,int d){\n\tS[now] = s[ind];\n\tif(d==0){\n\t\tvector<int> t;\n\t\trep(i,E[now].size()){\n\t\t\tt.push_back(maxi[E[now][i]]);\n\t\t}\n\t\tsort(t.rbegin(),t.rend());\n\t\tint x = 1;\n\t\tint cnt = 0;\n\t\trep(i,E[now].size()){\n\t\t\tint to = E[now][i];\n\t\t\tif(maxi[to]>=t[0]){\n\t\t\t\tcnt++;\n\t\t\t\tx*=-1;\n\t\t\t}\n\t\t\tint iind = ind + 3 + x;\n\t\t\tiind %= 3;\n\t\t\tdfs2(to,now,iind,x);\n\t\t}\n\t\tAns = (D+2)/3;\n\t\tif(cnt>=3){\n\t\t\tif(D%3==0)Ans++;\n\t\t}\n\t\t\t\n\t}\n\telse{\n\t\tind += d+3;\n\t\tind %= 3;\n\t\trep(i,E[now].size()){\n\t\t\tint to = E[now][i];\n\t\t\tif(to==p)continue;\n\t\t\tdfs2(to,now,ind,d);\n\t\t}\n\t}\n}\nint main(){\n\t\n\tcin>>N;\n\tS.resize(N,'.');\n\tE.resize(N,vector<int>());\n\trep(i,N-1){\n\t\tint a,b;\n\t\tscanf(\"%d %d\",&a,&b);\n\t\ta--;b--;\n\t\tE[a].push_back(b);\n\t\tE[b].push_back(a);\n\t\t\n\t}\n\t\n\ttree_diameter T;\n\tvector<int> X = T.get(E).second;\n\tD = X.size();\n\tif(N==1){\n\t\tS = \"R\";\n\t\tAns = 1;\n\t}\n\telse if(N==2){\n\t\tS = \"RG\";\n\t\tAns = 1;\n\t}\n\telse{\n\t\tint f = X[X.size()/2];\n\t\tmaxi.resize(N,0);\n\t\tdfs(f,-1);\n\t\tdfs2(f,-1,0,0);\n\t}\n\t\n\tcout<<Ans<<endl;\n\tcout<<S<<endl;\n\t\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":37852,"score_of_the_acc":-0.2983,"final_rank":9},{"submission_id":"aoj_3158_4832639","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\n//#include<atcoder/dsu>\n//#include<atcoder/fenwicktree>\n//#include<atcoder/math>\n//#include<atcoder/maxflow>\n\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 998244353;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m) {\n\tif (x >= m)x %= m;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\n\nstring s = \"RGB\";\nstring ans;\nvector<int> G[1 << 18];\nvoid dfs(int id, int fr, int col) {\n\tif (col == 3)col = 0;\n\tans[id] = s[col];\n\tfor (int to : G[id])if (to != fr) {\n\t\tdfs(to, id, col + 1);\n\t}\n}\n\nint calcans() {\n\tint ma = 0;\n\trep(i, 3) {\n\t\tfunction<int(int, int)> calc = [&](int id, int fr)->int {\n\t\t\tvector<int> ts;\n\t\t\tfor (int to : G[id])if (to != fr) {\n\t\t\t\tint nex = calc(to, id);\n\t\t\t\tts.push_back(nex);\n\t\t\t}\n\t\t\tsort(all(ts), greater<int>());\n\t\t\tif (ts.size() >= 2) {\n\t\t\t\tint sum = ts[0] + ts[1];\n\t\t\t\tif (ans[id] == s[i])sum++;\n\t\t\t\tma = max(ma, sum);\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tif (ts.size()) {\n\t\t\t\tres = ts[0];\n\t\t\t}\n\t\t\tif (ans[id] == s[i])res++;\n\t\t\tma = max(ma, res);\n\t\t\treturn res;\n\t\t}; calc(0, -1);\n\t}\n\treturn ma;\n}\n\nvoid solve() {\n\tint n; cin >> n; ans.resize(n);\n\trep(i, n - 1) {\n\t\tint a, b; cin >> a >> b; a--; b--;\n\t\tG[a].push_back(b);\n\t\tG[b].push_back(a);\n\t}\n\tint mi = mod;\n\tint chk = -1;\n\tmt19937 mt(time(0));\n\tuniform_int_distribution<> ud(0, n - 1);\n\trep(i, 100) {\n\t\tint r = ud(mt);\n\t\tdfs(r, -1, 0);\n\t\tif (mi > calcans()) {\n\t\t\tmi = calcans();\n\t\t\tchk = r;\n\t\t}\n\t}\n\tdfs(chk, -1, 0);\n\tcout << mi << \"\\n\";\n\tcout << ans << \"\\n\";\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(15);\n\t//init_f();\n\t//init();\n\t//expr();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}","accuracy":0.4222222222222222,"time_ms":1840,"memory_kb":13004,"score_of_the_acc":-1,"final_rank":20},{"submission_id":"aoj_3158_4832589","code_snippet":"#include <stdio.h>\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define modulo N\n#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)\n#define Inf 1000000000000000000\nint Ans;\nstring S;\nint N;\nint D;\nvector<vector<int>> E;\nstruct tree_diameter{\n\tconst long long X = 1000000000000000000;\n\tpair<long long,vector<int>> get(vector<vector<pair<int,long long>>> &E){\n\t\tvector<long long> dis = bfs(E,0);\n\t\tlong long maxi = -1;\n\t\tint ind = 0;\n\t\tfor(int i=0;i<E.size();i++){\n\t\t\tif(dis[i]>maxi){\n\t\t\t\tmaxi=dis[i];\n\t\t\t\tind=i;\n\t\t\t}\n\t\t}\n\n\t\tdis = bfs(E,ind);\n\t\tmaxi = -1;\n\n\t\tfor(int i=0;i<E.size();i++){\n\t\t\tif(dis[i]>maxi){\n\t\t\t\tmaxi=dis[i];\n\t\t\t\tind=i;\n\t\t\t}\n\t\t}\n\n\t\tvector<int> ret;\n\t\tret.push_back(ind);\n\t\twhile(dis[ind]!=0LL){\n\t\t\tfor(int i=0;i<E[ind].size();i++){\n\t\t\t\tif(dis[ind] == dis[E[ind][i].first] + E[ind][i].second){\n\t\t\t\t\tind = E[ind][i].first;\n\t\t\t\t\tret.push_back(ind);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn make_pair(maxi,ret);\n\t\t\n\t}\n\t\n\tpair<long long,vector<int>> get(vector<vector<int>> &E){\n\t\tvector<vector<pair<int,long long>>> e(E.size(),vector<pair<int,long long>>());\n\t\tfor(int i=0;i<E.size();i++){\n\t\t\tfor(int j=0;j<E[i].size();j++){\n\t\t\t\te[i].emplace_back(E[i][j],1LL);\n\t\t\t}\n\t\t}\n\t\treturn get(e);\n\t}\n\t\n\tvector<long long> bfs(vector<vector<pair<int,long long>>> &E,int start){\n\t\tvector<long long> dis(E.size(),X);\n\t\tdis[start] = 0LL;\n\t\tqueue<int> Q;\n\t\tQ.push(start);\n\t\t\n\t\twhile(Q.size()!=0){\n\t\t\tint u = Q.front();\n\t\t\tQ.pop();\n\t\t\tfor(int i=0;i<E[u].size();i++){\n\t\t\t\tint v = E[u][i].first;\n\t\t\t\tif(dis[v]!=X)continue;\n\t\t\t\tdis[v] = dis[u] + E[u][i].second;\n\t\t\t\tQ.push(v);\n\t\t\t}\n\t\t}\n\t\treturn dis;\n\t}\n\t\n};\nvector<int> maxi;\n\nvoid dfs(int now,int p){\n\trep(i,E[now].size()){\n\t\tint to = E[now][i];\n\t\tif(to==p)continue;\n\t\tdfs(to,now);\n\t\tmaxi[now] = max(maxi[to] + 1,maxi[now]);\n\t}\n}\nstring s = \"RGB\";\nvoid dfs2(int now,int p,int ind,int d){\n\tS[now] = s[ind];\n\tif(d==0){\n\t\tvector<int> t;\n\t\trep(i,E[now].size()){\n\t\t\tt.push_back(maxi[E[now][i]]);\n\t\t}\n\t\tsort(t.rbegin(),t.rend());\n\t\tint x = 1;\n\t\tint cnt = 0;\n\t\trep(i,E[now].size()){\n\t\t\tint to = E[now][i];\n\t\t\tif(maxi[to]>=t[1]){\n\t\t\t\tcnt++;\n\t\t\t\tx*=-1;\n\t\t\t}\n\t\t\tint iind = ind + 3 + x;\n\t\t\tiind %= 3;\n\t\t\tdfs2(to,now,iind,x);\n\t\t}\n\t\tAns = (D+2)/3;\n\t\tif(cnt>=3){\n\t\t\tif(D%3==0)Ans++;\n\t\t}\n\t\t\t\n\t}\n\telse{\n\t\tind += d+3;\n\t\tind %= 3;\n\t\trep(i,E[now].size()){\n\t\t\tint to = E[now][i];\n\t\t\tif(to==p)continue;\n\t\t\tdfs2(to,now,ind,d);\n\t\t}\n\t}\n}\nint main(){\n\t\n\tcin>>N;\n\tS.resize(N,'.');\n\tE.resize(N,vector<int>());\n\trep(i,N-1){\n\t\tint a,b;\n\t\tscanf(\"%d %d\",&a,&b);\n\t\ta--;b--;\n\t\tE[a].push_back(b);\n\t\tE[b].push_back(a);\n\t\t\n\t}\n\t\n\ttree_diameter T;\n\tvector<int> X = T.get(E).second;\n\tD = X.size();\n\tif(N==1){\n\t\tS = \"R\";\n\t\tAns = 1;\n\t}\n\telse if(N==2){\n\t\tS = \"RG\";\n\t\tAns = 1;\n\t}\n\telse{\n\t\tint f = X[X.size()/2];\n\t\tmaxi.resize(N,0);\n\t\tdfs(f,-1);\n\t\tdfs2(f,-1,0,0);\n\t}\n\t\n\tcout<<Ans<<endl;\n\tcout<<S<<endl;\n\t\n return 0;\n}","accuracy":0.4888888888888889,"time_ms":40,"memory_kb":29820,"score_of_the_acc":-0.1793,"final_rank":19},{"submission_id":"aoj_3158_4832083","code_snippet":"//#define NDEBUG\n\n#pragma region cp_template\n\n#include <algorithm>\n#include <cstddef>\n#include <cstdint>\n#include <iostream>\n#include <utility>\n#include <vector>\n\nnamespace n91 {\n\n using i32 = std::int32_t;\n using i64 = std::int64_t;\n using u32 = std::uint32_t;\n using u64 = std::uint64_t;\n using isize = std::ptrdiff_t;\n using usize = std::size_t;\n\n struct rep {\n struct itr {\n usize i;\n constexpr itr(const usize i) noexcept : i(i) {}\n void operator++() noexcept { ++i; }\n constexpr usize operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\n };\n const itr f, l;\n constexpr rep(const usize f, const usize l) noexcept\n : f(std::min(f, l)), l(l) {}\n constexpr auto begin() const noexcept { return f; }\n constexpr auto end() const noexcept { return l; }\n };\n struct revrep {\n struct itr {\n usize i;\n constexpr itr(const usize i) noexcept : i(i) {}\n void operator++() noexcept { --i; }\n constexpr usize operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\n };\n const itr f, l;\n constexpr revrep(const usize f, const usize l) noexcept\n : f(l - 1), l(std::min(f, l) - 1) {}\n constexpr auto begin() const noexcept { return f; }\n constexpr auto end() const noexcept { return l; }\n };\n template <class T> auto md_vec(const usize n, const T& value) {\n return std::vector<T>(n, value);\n }\n template <class... Args> auto md_vec(const usize n, Args... args) {\n return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));\n }\n template <class T> constexpr T difference(const T& a, const T& b) noexcept {\n return a < b ? b - a : a - b;\n }\n template <class T> void chmin(T& a, const T& b) noexcept {\n if (b < a)\n a = b;\n }\n template <class T> void chmax(T& a, const T& b) noexcept {\n if (a < b)\n a = b;\n }\n template <class F> class rec_lambda {\n F f;\n\n public:\n rec_lambda(F&& f) : f(std::move(f)) {}\n template <class... Args> auto operator()(Args&&... args) const {\n return f(*this, std::forward<Args>(args)...);\n }\n };\n template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }\n template <class T> T scan() {\n T ret;\n std::cin >> ret;\n return ret;\n }\n constexpr char eoln = '\\n';\n template <class T> T ceildiv(const T& l, const T& r) {\n return l / r + (l % r != 0 ? 1 : 0);\n }\n\n} // namespace n91\n\n#pragma endregion cp_template\n\n#include <cstdint>\n\ntemplate <std::uint_fast64_t mod> class modint {\n using u64 = std::uint_fast64_t;\n\npublic:\n u64 v;\n\n constexpr modint(const u64 x = 0) noexcept : v(x% mod) {}\n constexpr modint operator+(const modint rhs) const noexcept {\n return modint(*this) += rhs;\n }\n constexpr modint operator-(const modint rhs) const noexcept {\n return modint(*this) -= rhs;\n }\n constexpr modint operator*(const modint rhs) const noexcept {\n return modint(*this) *= rhs;\n }\n constexpr modint operator/(const modint rhs) const noexcept {\n return modint(*this) /= rhs;\n }\n constexpr modint& operator+=(const modint rhs) noexcept {\n v += rhs.v;\n if (v >= mod)\n v -= mod;\n return *this;\n }\n constexpr modint& operator-=(const modint rhs) noexcept {\n if (v < rhs.v)\n v += mod;\n v -= rhs.v;\n return *this;\n }\n constexpr modint& operator*=(const modint rhs) noexcept {\n v = v * rhs.v % mod;\n return *this;\n }\n constexpr modint& operator/=(modint rhs) noexcept {\n u64 exp = mod - 2;\n while (exp != 0) {\n if (exp % 2 != 0)\n *this *= rhs;\n rhs *= rhs;\n exp /= 2;\n }\n return *this;\n }\n};\n\n#include <functional>\n#include <utility>\n\nnamespace n91 {\n\n template <class T, class U, class Operate = std::multiplies<T>>\n constexpr T power(T base, U exp, const Operate& oper = Operate(), T iden = 1) {\n while (exp != 0) {\n if (exp % 2 != 0) {\n iden = oper(iden, base);\n }\n exp /= 2;\n base = oper(base, base);\n }\n return iden;\n }\n\n} // namespace n91\n\nnamespace n91 {\n\n void main_() {\n using mint = modint<998244353>;\n /*\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n //*/\n const usize n = scan<usize>();\n auto g = md_vec(n, 0, usize());\n for (const usize i : rep(0, n - 1)) {\n const usize a = scan<usize>() - 1;\n const usize b = scan<usize>() - 1;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n std::vector<usize> dist(n, 0), par(n);\n const auto dfs = [&](const auto& dfs, const usize v, const usize p) -> void {\n par[v] = p;\n for (const auto e : g[v]) {\n if (e != p) {\n dist[e] = dist[v] + 1;\n dfs(dfs, e, v);\n }\n }\n };\n dfs(dfs, 0, n);\n const usize d0 = std::max_element(dist.begin(), dist.end()) - dist.begin();\n dist[d0] = 0;\n dfs(dfs, d0, n);\n const usize d1 = std::max_element(dist.cbegin(), dist.cend()) - dist.begin();\n const usize diam = dist[d1];\n usize ans_x;\n std::vector<u32> ans(n);\n if (diam % 2 == 1) {\n usize c1 = d1;\n for (const usize i : rep(0, diam / 2)) {\n c1 = par[c1];\n }\n usize c0 = par[c1];\n ans_x = diam / 3 + 1;\n dist[c0] = 0;\n dist[c1] = n;\n dfs(dfs, c0, c1);\n dfs(dfs, c1, c0);\n for (const usize i : rep(0, n)) {\n if (dist[i] >= n) {\n ans[i] = 2 - (dist[i] - n) % 3;\n }\n else {\n ans[i] = dist[i] % 3;\n }\n }\n }\n else {\n usize c = d1;\n for (const usize i : rep(0, diam / 2)) {\n c = par[c];\n }\n dfs(dfs, c, n);\n dist[c] = 0;\n bool fl = false;\n for (const usize v : g[c]) {\n if (fl) {\n dist[v] = n;\n }\n else {\n dist[v] = 1;\n }\n dfs(dfs, v, c);\n fl = !fl;\n }\n for (const usize i : rep(0, n)) {\n if (dist[i] >= n) {\n ans[i] = 2 - (dist[i] - n) % 3;\n }\n else {\n ans[i] = dist[i] % 3;\n }\n }\n }\n std::vector<usize> c_dist(n, 0);\n const auto c_dfs = [&](const auto& c_dfs, const usize v, const usize p,\n const usize col) -> void {\n if (ans[v] == col) {\n ++c_dist[v];\n }\n for (const auto e : g[v]) {\n if (e != p) {\n c_dist[e] = c_dist[v];\n c_dfs(c_dfs, e, v, col);\n }\n }\n };\n ans_x = 0;\n for (const usize i : rep(0, 3)) {\n c_dist[0] = 0;\n c_dfs(c_dfs, 0, n, i);\n const usize c_d0 =\n std::max_element(c_dist.begin(), c_dist.end()) - c_dist.begin();\n c_dist[c_d0] = 0;\n c_dfs(c_dfs, c_d0, n, i);\n chmax(ans_x, *std::max_element(c_dist.cbegin(), c_dist.cend()));\n }\n\n std::cout << ans_x << eoln;\n for (const auto e : ans) {\n if (e % 3 == 0) {\n std::cout << \"R\";\n }\n else if (e % 3 == 1) {\n std::cout << \"G\";\n }\n else {\n std::cout << \"B\";\n }\n }\n std::cout << eoln;\n }\n\n} // namespace n91\n\nint main() {\n n91::main_();\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":35072,"score_of_the_acc":-0.3131,"final_rank":11},{"submission_id":"aoj_3158_4832039","code_snippet":"#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing uint = unsigned;\nusing pcc = pair<char, char>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<ld, ld>;\nusing tuplis = array<ll, 3>;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nconst ll LINF=0x1fffffffffffffff;\nconst ll MINF=0x7fffffffffff;\nconst int INF=0x3fffffff;\nconst int MOD=1000000007;\nconst int MODD=998244353;\nconst ld DINF=numeric_limits<ld>::infinity();\nconst ld EPS=1e-9;\nconst ld PI=3.1415926535897932;\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\n#define overload4(_1,_2,_3,_4,name,...) name\n#define overload3(_1,_2,_3,name,...) name\n#define rep1(n) for(ll i=0;i<n;++i)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(n) for(ll i=n;i--;)\n#define rrep2(i,n) for(ll i=n;i--;)\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\n#define each1(i,a) for(auto&&i:a)\n#define each2(x,y,a) for(auto&&[x,y]:a)\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\n#define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__)\n#define all1(i) begin(i),end(i)\n#define all2(i,a) begin(i),begin(i)+a\n#define all3(i,a,b) begin(i)+a,begin(i)+b\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\n#define rall1(i) (i).rbegin(),(i).rend()\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\n#define Msum(...) accumulate(all(__VA_ARGS__),0_M)\n#define elif else if\n#define unless(a) if(!(a))\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\nll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }\nll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\nvector<ll> iota(ll n){ vector<ll> a(n); iota(a.begin(), a.end(), 0); return a; }\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\nmap<ll,ll> factor_map(ull x){ map<ll,ll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans[i] = 1; while((x /= i) % i == 0) ans[i]++; } if(x != 1) ans[x] = 1; return ans; }\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\ntemplate<class T> unordered_map<T, ll> press(vector<T> a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\ntemplate<class T> map<T, ll> press_map(vector<T> a){ Uniq(a); map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\nint scan(){ return getchar(); }\nvoid scan(int& a){ scanf(\"%d\", &a); }\nvoid scan(unsigned& a){ scanf(\"%u\", &a); }\nvoid scan(long& a){ scanf(\"%ld\", &a); }\nvoid scan(long long& a){ scanf(\"%lld\", &a); }\nvoid scan(unsigned long long& a){ scanf(\"%llu\", &a); }\nvoid scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\\n'); }\nvoid scan(float& a){ scanf(\"%f\", &a); }\nvoid scan(double& a){ scanf(\"%lf\", &a); }\nvoid scan(long double& a){ scanf(\"%Lf\", &a); }\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\nvoid scan(char a[]){ scanf(\"%s\", a); }\nvoid scan(string& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>&);\ntemplate<class T, size_t size> void scan(array<T, size>&);\ntemplate<class T, class L> void scan(pair<T, L>&);\ntemplate<class T, size_t size> void scan(T(&)[size]);\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(T& a){ cin >> a; }\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(unsigned a){ printf(\"%u\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(unsigned long long a){ printf(\"%llu\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(float a){ printf(\"%.15f\", a); }\nvoid print(double a){ printf(\"%.15f\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\ntemplate<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }\ntemplate<class T> void print(const vector<T>&);\ntemplate<class T, size_t size> void print(const array<T, size>&);\ntemplate<class T, class L> void print(const pair<T, L>& p);\ntemplate<class T, size_t size> void print(const T (&)[size]);\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const T& a){ cout << a; }\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\n#ifdef DEBUG\ninline ll __lg(ull __n){ return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); }\n#define debug(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...) void(0)\n#endif\nint first(bool i = true){ return out(i?\"first\":\"second\"); }\nint yes(bool i = true){ return out(i?\"yes\":\"no\"); }\nint Yes(bool i = true){ return out(i?\"Yes\":\"No\"); }\nint No(){ return out(\"No\"); }\nint YES(bool i = true){ return out(i?\"YES\":\"NO\"); }\nint NO(){ return out(\"NO\"); }\nint Yay(bool i = true){ return out(i?\"Yay!\":\":(\"); }\nint possible(bool i = true){ return out(i?\"possible\":\"impossible\"); }\nint Possible(bool i = true){ return out(i?\"Possible\":\"Impossible\"); }\nint POSSIBLE(bool i = true){ return out(i?\"POSSIBLE\":\"IMPOSSIBLE\"); }\nvoid Case(ll i){ printf(\"Case #%lld: \", i); }\n\n\n\nstruct UnWeightedEdge{\n ll to;\n static constexpr ll cost = 1;\n UnWeightedEdge(){}\n UnWeightedEdge(ll to): to(to){}\n operator ll() const { return to; }\n};\nstruct UnWeightedGraph{\n using E = UnWeightedEdge;\n vector<vector<E>> g;\n UnWeightedGraph(){}\n UnWeightedGraph(ll n): g(n){}\n vector<E>& operator[](ll at){ return g[at]; }\n operator vector<vector<E>>&(){ return g; }\n auto begin(){ return g.begin(); }\n auto end(){ return g.end(); }\n auto begin() const { return g.cbegin(); }\n auto end() const { return g.cend(); }\n ll size() const { return g.size(); }\n void resize(ll n){ g.resize(n); }\n const vector<E>& operator[](ll at) const { return g[at]; }\n operator const vector<vector<E>>&() const { return g; }\n void add_edge(ll a, ll b){\n g[a].emplace_back(b);\n g[b].emplace_back(a);\n }\n void add_directed_edge(ll from, ll to){\n g[from].emplace_back(to);\n }\n template<ll start_index = 1, bool directed = false> void input_graph(ll m){\n while(m--){\n ll a, b;\n scanf(\"%lld%lld\", &a, &b);\n a -= start_index;\n b -= start_index;\n g[a].emplace_back(b);\n if(!directed) g[b].emplace_back(a);\n }\n }\n template<ll start_index = 1> void input_tree(ll n = -1){ if(n == -1) n = g.size(); input_graph<start_index>(n - 1); }\n};\nvector<ll> Diameter(const UnWeightedGraph& g){\n ll n = g.size();\n vector<ll> cost(n, LINF);\n queue<ll> q;\n cost[0] = 0;\n q.push(0);\n ll d1 = 0;\n while(q.size()){\n d1 = q.front();\n q.pop();\n each(i, g[d1]) if(chmin(cost[i], cost[d1] + 1)) q.push(i);\n }\n cost.assign(n, LINF);\n vector<ll> back(n, -1);\n cost[d1] = 0;\n q.push(d1);\n ll d2 = 0;\n while(q.size()){\n d2 = q.front();\n q.pop();\n each(i, g[d2]) if(chmin(cost[i], cost[d2] + 1)){\n back[i] = d2;\n q.push(i);\n }\n }\n vector<ll> ans = {d2};\n while(ans.back() != d1) ans.push_back(back[ans.back()]);\n return ans;\n}\nvector<ll> BFS(const UnWeightedGraph& g, ll start){\n vector<ll> cost(g.size(), LINF);\n queue<ll> q;\n cost[start] = 0;\n q.push(start);\n while(q.size()){\n ll at = q.front();\n q.pop();\n each(i, g[at]) if(chmin(cost[i], cost[at] + i.cost)) q.push(i);\n }\n return cost;\n}\nsigned main(){\n LL(n);\n if(n==1){\n out(1);\n return out('R');\n }\n UnWeightedGraph g(n);\n g.input_tree();\n auto d=Diameter(g);\n string color(n,'-');\n auto cost1=BFS(g,d[(d.size()-1)/2]),cost2=BFS(g,d[(d.size()+1)/2]);\n rep(n)color[i]=cost1[i]<cost2[i]?\"BGR\"[cost1[i]%3]:\"RGB\"[cost2[i]%3];\n ll ans=0;\n for(char c:\"RGB\"s){\n vec(pll,dp,n);\n auto dfs = [&](ll from, ll at, auto dfs) -> void {\n each(i, g[at]) if(i != from){\n dfs(at, i, dfs);\n if(chmax(dp[at].second,dp[i].first+(color[i]==c))&&dp[at].first<dp[at].second)swap(dp[at].first,dp[at].second);\n }\n };\n dfs(-1, 0, dfs);\n auto dfs2 = [&](ll from, ll at, auto dfs) -> void {\n each(i, g[at]) if(i != from){\n const ll a=dp[at].first==dp[i].first+(color[i]==c)?dp[at].second:dp[at].first;\n if(chmax(dp[i].second,a+(color[at]==c))&&dp[i].first<dp[i].second)swap(dp[i].first,dp[i].second);\n dfs(at, i, dfs);\n }\n };\n dfs2(-1, 0, dfs2);\n rep(n)chmax(ans,dp[i].first+dp[i].second+(color[i]==c));\n }\n out(ans);\n out(color);\n}","accuracy":1,"time_ms":170,"memory_kb":53488,"score_of_the_acc":-0.504,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_3158_4861050\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint n;\\nvector<vector<int>> g;\\nstring res, col = \\\"RGB\\\";\\n\\nvector<int> search_diameter();\\nvoid mod_coloring(int now, int par, int dist, int ad = 1);\\nint calc_dist(int now, int par, int dist);\\nint solve();\\n\\nint main() {\\n cin >> n;\\n g.resize(n);\\n res = string(n, '-');\\n for (int i = 1; i < n; ++i) {\\n int a, b;\\n cin >> a >> b;\\n g[--a].push_back(--b);\\n g[b].push_back(a);\\n }\\n cout << solve() << endl;\\n cout << res << endl;\\n return 0;\\n}\\n\\nvector<int> search_diameter() {\\n vector<int> par;\\n int root = 0;\\n for (int i = 0; i < 2; ++i) {\\n queue<int> qu;\\n qu.push(root);\\n par.assign(n, -2);\\n par[root] = -1;\\n while (qu.size()) {\\n int now = qu.front();\\n root = now;\\n qu.pop();\\n for (auto to : g[now])\\n if (par[to] == -2) {\\n par[to] = now;\\n qu.push(to);\\n }\\n }\\n }\\n vector<int> v;\\n while (root != -1) {\\n v.push_back(root);\\n root = par[root];\\n }\\n return v;\\n}\\n\\nvoid mod_coloring(int now, int par, int dist, int ad) {\\n res[now] = col[dist];\\n for (auto to : g[now])\\n if (to != par) mod_coloring(to, now, (dist + ad + 3) % 3, ad);\\n}\\n\\nint calc_dist(int now, int par, int dist) {\\n int res = dist;\\n for (auto to : g[now])\\n if (to != par) res = max(res, calc_dist(to, now, dist + 1));\\n return res;\\n}\\n\\nint solve() {\\n auto dpath = search_diameter();\\n int d = dpath.size();\\n if (d & 1) {\\n if (d % 3) {\\n mod_coloring(0, -1, 0);\\n return (d + 2) / 3;\\n } else { // check\\n int cnt = 0, root = dpath[d / 2];\\n mod_coloring(root, -1, 0);\\n mod_coloring(dpath[d / 2 - 1], root, 2, -1);\\n for (auto to : g[root])\\n if (calc_dist(to, root, 1) == d / 2) ++cnt;\\n return (d + 2 + (cnt >= 3)) / 3;\\n }\\n } else {\\n mod_coloring(dpath[d / 2], dpath[d / 2 - 1], 0);\\n mod_coloring(dpath[d / 2 - 1], dpath[d / 2], 2, -1);\\n return (d + 2) / 3;\\n }\\n return -1;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 27628,\n \"score_of_the_acc\": -0.1837,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3158_4835731\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <iomanip>\\n#include <set>\\n#include <tuple>\\n#define mkp make_pair\\n#define mkt make_tuple\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD=1e9+7;\\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\\n\\nint N;\\nvector<vector<int>> g;\\n\\nint findFar(int st){\\n queue<int> Q;\\n vector<int> dist(N,MOD);\\n dist[st]=0;\\n Q.push(st);\\n while(!Q.empty()){\\n int now=Q.front();Q.pop();\\n for(auto nex:g[now]){\\n if(dist[nex]==MOD){\\n dist[nex]=dist[now]+1;\\n Q.push(nex);\\n }\\n }\\n }\\n int fat=0;\\n rep(i,N) if(dist[i]>dist[fat]) fat=i;\\n return fat;\\n}\\n\\nbool dfs(int now,int par,int goal,vector<int> &v){\\n if(now==goal){\\n v.push_back(now);\\n return true;\\n }\\n for(auto nex:g[now]) if(nex!=par){\\n if(dfs(nex,now,goal,v)){\\n v.push_back(now);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nvector<int> getDiameter(){\\n int st=findFar(0);\\n st=findFar(st);\\n int ed=findFar(st);\\n vector<int> path;\\n dfs(st,-1,ed,path);\\n return path;\\n}\\n\\nvector<int> getdist(int st,int ed){\\n vector<int> dist(N,MOD);\\n dist[st]=0;\\n dist[ed]=0;\\n queue<int> Q;\\n Q.push(st);\\n if(ed!=st) Q.push(ed);\\n while(!Q.empty()){\\n int now=Q.front();Q.pop();\\n for(auto nex:g[now]){\\n if(dist[nex]==MOD){\\n dist[nex]=dist[now]+1;\\n Q.push(nex);\\n }\\n }\\n }\\n return dist;\\n}\\n\\nbool dfs(int now,int par,int d,int goal){\\n if(d==goal) return true;\\n for(auto nex:g[now]){\\n if(nex!=par){\\n if(dfs(nex,now,d+1,goal)) return true;\\n }\\n }\\n return false;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n cin>>N;\\n g.resize(N);\\n rep(i,N-1){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n\\n vector<int> diameter=getDiameter();\\n int D=diameter.size();\\n if(D%3){\\n int st=diameter[D/2];\\n vector<int> dist=getdist(st,st);\\n\\n string ans=\\\"\\\";\\n rep(i,N){\\n dist[i]%=3;\\n if(dist[i]==0) ans+='R';\\n else if(dist[i]==1) ans+='G';\\n else ans+='B';\\n }\\n cout<<D/3+1<<\\\"\\\\n\\\";\\n cout<<ans<<\\\"\\\\n\\\";\\n return 0;\\n }\\n\\n if(D%2==0){\\n int st=diameter[D/2-1];\\n int ed=diameter[D/2];\\n vector<int> dist=getdist(st,ed);\\n\\n string ans=\\\"\\\";\\n rep(i,N){\\n dist[i]%=3;\\n if(dist[i]==0) ans+='R';\\n else if(dist[i]==1) ans+='G';\\n else ans+='B';\\n }\\n cout<<D/3<<\\\"\\\\n\\\";\\n cout<<ans<<\\\"\\\\n\\\";\\n return 0;\\n }\\n\\n {\\n int st=diameter[D/2];\\n vector<int> dist=getdist(st,st);\\n int ma=*max_element(all(dist));\\n\\n int masubg=0;\\n for(auto nex:g[st]){\\n if(dfs(nex,st,1,ma)) masubg++;\\n }\\n\\n if(masubg>2){\\n cout<<D/3+1<<\\\"\\\\n\\\";\\n\\n st=diameter[D/2];\\n dist=getdist(st,st);\\n\\n string ans=\\\"\\\";\\n rep(i,N){\\n dist[i]%=3;\\n if(dist[i]==0) ans+='R';\\n else if(dist[i]==1) ans+='G';\\n else ans+='B';\\n }\\n cout<<ans<<\\\"\\\\n\\\";\\n return 0;\\n }else{\\n cout<<D/3<<\\\"\\\\n\\\";\\n\\n st=diameter[D/2];\\n int fir=diameter[D/2-1];\\n int sec=diameter[D/2+1];\\n vector<int> dist(N,MOD);\\n queue<int> Q;\\n Q.push(st);Q.push(fir);Q.push(sec);\\n dist[st]=0;dist[fir]=1;dist[sec]=2;\\n while(!Q.empty()){\\n int now=Q.front();\\n Q.pop();\\n for(auto nex:g[now]){\\n if(dist[nex]==MOD){\\n dist[nex]=dist[now]+1;\\n dist[nex]%=3;\\n Q.push(nex);\\n }\\n }\\n }\\n\\n string ans=\\\"\\\";\\n rep(i,N){\\n dist[i]%=3;\\n if(dist[i]==0) ans+='R';\\n else if(dist[i]==1) ans+='G';\\n else ans+='B';\\n }\\n cout<<ans<<\\\"\\\\n\\\";\\n }\\n return 0;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 28428,\n \"score_of_the_acc\": -0.2034,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3158_4835724\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <iomanip>\\n#include <set>\\n#include <tuple>\\n#define mkp make_pair\\n#define mkt make_tuple\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD=1e9+7;\\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\\n\\nint N;\\nvector<vector<int>> g;\\n\\nint findFar(int st){\\n queue<int> Q;\\n vector<int> dist(N,MOD);\\n dist[st]=0;\\n Q.push(st);\\n while(!Q.empty()){\\n int now=Q.front();Q.pop();\\n for(auto nex:g[now]){\\n if(dist[nex]==MOD){\\n dist[nex]=dist[now]+1;\\n Q.push(nex);\\n }\\n }\\n }\\n int fat=0;\\n rep(i,N) if(dist[i]>dist[fat]) fat=i;\\n return fat;\\n}\\n\\nbool dfs(int now,int par,int goal,vector<int> &v){\\n if(now==goal){\\n v.push_back(now);\\n return true;\\n }\\n for(auto nex:g[now]) if(nex!=par){\\n if(dfs(nex,now,goal,v)){\\n v.push_back(now);\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nvector<int> getDiameter(){\\n int st=findFar(0);\\n st=findFar(st);\\n int ed=findFar(st);\\n vector<int> path;\\n dfs(st,-1,ed,path);\\n return path;\\n}\\n\\nvector<int> getdist(int st,int ed){\\n vector<int> dist(N,MOD);\\n dist[st]=0;\\n dist[ed]=0;\\n queue<int> Q;\\n Q.push(st);\\n if(ed!=st) Q.push(ed);\\n while(!Q.empty()){\\n int now=Q.front();Q.pop();\\n for(auto nex:g[now]){\\n if(dist[nex]==MOD){\\n dist[nex]=dist[now]+1;\\n Q.push(nex);\\n }\\n }\\n }\\n return dist;\\n}\\n\\nbool dfs(int now,int par,int d,int goal){\\n if(d==goal) return true;\\n for(auto nex:g[now]){\\n if(nex!=par){\\n if(dfs(nex,now,d+1,goal)) return true;\\n }\\n }\\n return false;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n cin>>N;\\n g.resize(N);\\n rep(i,N-1){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n\\n vector<int> diameter=getDiameter();\\n int D=diameter.size();\\n\\n if(D%3){\\n int st=diameter[D/2];\\n vector<int> dist=getdist(st,st);\\n\\n string ans=\\\"\\\";\\n rep(i,N){\\n dist[i]%=3;\\n if(dist[i]==0) ans+='R';\\n else if(dist[i]==1) ans+='G';\\n else ans+='B';\\n }\\n cout<<D/3+1<<\\\"\\\\n\\\";\\n cout<<ans<<\\\"\\\\n\\\";\\n return 0;\\n }\\n\\n if(D%2==0){\\n int st=diameter[D/2-1];\\n int ed=diameter[D/2];\\n vector<int> dist(N,MOD);\\n dist[st]=0;dist[ed]=2;\\n queue<int> Q;\\n Q.push(st);\\n while(!Q.empty()){\\n int now=Q.front();\\n Q.pop();\\n for(auto nex:g[now]){\\n if(dist[nex]==MOD){\\n dist[nex]=dist[now]+1;\\n dist[nex]%=3;\\n Q.push(nex);\\n }\\n }\\n }\\n Q.push(ed);\\n while(!Q.empty()){\\n int now=Q.front();\\n Q.pop();\\n for(auto nex:g[now]){\\n if(dist[nex]==MOD){\\n dist[nex]=dist[now]-1;\\n dist[nex]+=3;\\n dist[nex]%=3;\\n Q.push(nex);\\n }\\n }\\n }\\n\\n string ans=\\\"\\\";\\n rep(i,N){\\n dist[i]%=3;\\n if(dist[i]==0) ans+='R';\\n else if(dist[i]==1) ans+='G';\\n else ans+='B';\\n }\\n cout<<D/3<<\\\"\\\\n\\\";\\n cout<<ans<<\\\"\\\\n\\\";\\n return 0;\\n }\\n\\n {\\n int st=diameter[D/2];\\n vector<int> dist=getdist(st,st);\\n int ma=*max_element(all(dist));\\n\\n int masubg=0;\\n for(auto nex:g[st]){\\n if(dfs(nex,st,1,ma)) masubg++;\\n }\\n\\n if(masubg>2){\\n cout<<D/3+1<<\\\"\\\\n\\\";\\n\\n st=diameter[D/2];\\n dist=getdist(st,st);\\n\\n string ans=\\\"\\\";\\n rep(i,N){\\n dist[i]%=3;\\n if(dist[i]==0) ans+='R';\\n else if(dist[i]==1) ans+='G';\\n else ans+='B';\\n }\\n cout<<ans<<\\\"\\\\n\\\";\\n return 0;\\n }else{\\n cout<<D/3<<\\\"\\\\n\\\";\\n\\n st=diameter[D/2];\\n int fir=diameter[D/2-1];\\n int sec=diameter[D/2+1];\\n vector<int> dist(N,MOD);\\n queue<int> Q;\\n Q.push(st);Q.push(fir);\\n dist[st]=0;dist[fir]=1;\\n dist[sec]=2;\\n while(!Q.empty()){\\n int now=Q.front();\\n Q.pop();\\n for(auto nex:g[now]){\\n if(dist[nex]==MOD){\\n dist[nex]=dist[now]+1;\\n dist[nex]%=3;\\n Q.push(nex);\\n }\\n }\\n }\\n\\n Q.push(sec);\\n dist[sec]=2;\\n while(!Q.empty()){\\n int now=Q.front();\\n Q.pop();\\n for(auto nex:g[now]){\\n if(dist[nex]==MOD){\\n dist[nex]=dist[now]-1;\\n dist[nex]+=3;\\n dist[nex]%=3;\\n Q.push(nex);\\n }\\n }\\n }\\n\\n string ans=\\\"\\\";\\n rep(i,N){\\n dist[i]%=3;\\n if(dist[i]==0) ans+='R';\\n else if(dist[i]==1) ans+='G';\\n else ans+='B';\\n }\\n cout<<ans<<\\\"\\\\n\\\";\\n }\\n return 0;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 28416,\n \"score_of_the_acc\": -0.1977,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3158_4834902\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\nstruct edge{\\n ll to=-1,cost=0;\\n edge(){};\\n edge(ll t,ll c):to(t),cost(c){};\\n};\\nstruct HLD{\\n ll n, root;\\n ll cnt = 0;\\n vector<ll>sz;//部分木サイズ\\n vector<ll>par,head;\\n vector<vector<struct edge>>g;//隣接リスト\\n vector<struct edge>edges;//データ構造に乗せるedge列\\n vector<ll>in,out;//[in,out)で部分木、[ina,inb]でa~bのパス(aが上)\\n //inは頂点のindexを表す。また、edge列の下側の頂点である\\n HLD(vector<vector<struct edge>>&G,ll r = -1)\\n :g(G),n(G.size()),root(r){\\n par.assign(n,-1),in.assign(n,-1);\\n out.assign(n,-1),head.assign(n,-1),sz.assign(n,-1);\\n edges.assign(n,edge());\\n dfs_build();\\n }\\n void dfs_build(){\\n if(root == -1){//根がどこでも良い場合(森でも可)\\n for(ll i=0;i<n;i++){\\n if(sz[i] == -1){\\n head[i] = i;\\n dfs_sz(i);\\n dfs_hld(i);\\n }\\n }\\n }\\n else{\\n head[root] = root;\\n dfs_sz(root);\\n dfs_hld(root);\\n }\\n }\\n void dfs_sz(ll k){\\n sz[k] = 1;\\n for(auto &e: g[k]){\\n if(e.to == par[k])continue;\\n par[e.to] = k;\\n dfs_sz(e.to);\\n sz[k] += sz[e.to];\\n if(sz[e.to] > sz[g[k][0].to])swap(e, g[k][0]);\\n }\\n }\\n void dfs_hld(ll k){\\n in[k] = cnt++;\\n for(auto e:g[k]){\\n if(e.to == par[k])continue;\\n head[e.to] = (e.to == g[k][0].to ? head[k]: e.to);\\n edges[cnt] = e;\\n dfs_hld(e.to);\\n }\\n out[k] = cnt;\\n }\\n ll lca(ll p,ll q){\\n while(1){\\n if(in[p] < in[q])swap(p,q);\\n if(head[p] == head[q])return q;\\n p = par[head[p]];\\n }\\n }\\n vector<pair<ll,ll>>query_path(ll p,ll q,bool isEdge=true){\\n ll r=lca(p,q);\\n vector<pair<ll,ll>>ret;\\n for(ll i=0;i<2;i++){\\n if(i == 1)swap(p,q);\\n while(1){\\n if(isEdge&&p==r)break;\\n if(head[p]==head[r]){\\n ret.emplace_back(in[r]+(isEdge?1:i),in[p]+1);\\n break;\\n }\\n ret.emplace_back(in[head[p]],in[p]+1);\\n p = par[head[p]];\\n }\\n }\\n return ret;\\n }\\n vector<vector<pair<ll,ll>>>query_order_path(ll p,ll q,bool isEdge=true){\\n\\t//非可換クエリ用、配列0を順番を反転したデータ構造に、配列1を通常のデータ構造に\\n vector<vector<pair<ll,ll>>>ret(2);\\n ll r=lca(p,q);\\n for(ll i=0;i<2;i++){\\n if(i == 1)swap(p,q);\\n while(1){\\n if(isEdge&&p==r)break;\\n if(head[p]==head[r]){\\n if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[r]+(isEdge?1:i)));\\n else ret[i].emplace_back(in[r]+(isEdge?1:i),in[p]+1);\\n break;\\n }\\n if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[head[p]]));\\n else ret[i].emplace_back(in[head[p]],in[p]+1);\\n p = par[head[p]];\\n }\\n }\\n reverse(ret[1].begin(), ret[1].end());\\n return ret;\\n }\\n pair<ll,ll>query_subtree(ll p,bool isEdge=true){\\n return make_pair(in[p]+isEdge,out[p]);\\n }\\n};\\ntemplate<typename T>\\nstruct BIT{\\n ll n;\\n ll k=1;\\n vector<T>data;\\n BIT() = default;\\n BIT(ll size):n(size){\\n data.assign(n,0);\\n while(k*2<=n)k*=2;\\n }\\n void add(ll a,T w){\\n for(ll i=a+1;i<=n;i+=i&-i)data[i-1]+=w;\\n }\\n T sum(ll a){\\n\\tif(a<0)return 0;\\n T ret = 0;\\n for(ll i=a+1;i>0;i-=i&-i)ret+=data[i-1];\\n return ret;\\n }\\n T sum(ll a,ll b){return a>b?0:sum(b)-sum(a-1);}\\n T operator[](ll pos){\\n return sum(pos,pos);\\n }\\n ll lower_bound(ll x){\\n ll ret=0; \\n for(ll i=k;i>0;i/=2){\\n if(ret+i<=n&&data[ret+i-1]<x){\\n x-=data[ret+i-1];\\n ret+=i;\\n }\\n }\\n return ret;\\n }\\n void print(){\\n for(ll i=0;i<n;i++){\\n if(i!=0)cout<<\\\" \\\";\\n cout<<(*this)[i];\\n }\\n cout<<endl;\\n }\\n};\\nstruct Diameter{\\n vector<ll>dep,ret;\\n ll n;\\n vector<vector<ll>>g;\\n ll diam,root,end;\\n Diameter(vector<vector<ll>>&G):g(G),n(G.size()){\\n dep.assign(n,-1LL);\\n dfs(0,0);\\n root = max_element(ALL(dep)) - dep.begin();\\n fill(ALL(dep),-1LL);\\n dfs(root,0);\\n end = max_element(ALL(dep)) - dep.begin();\\n diam = dep[end];\\n }\\n void dfs(ll k, ll d){\\n dep[k] = d;\\n for(auto to:g[k]){\\n if(dep[to]==-1)dfs(to,d+1);\\n }\\n }\\n vector<ll>diam_path(){\\n vector<ll>tmp;\\n dfs2(root,-1,tmp);\\n return ret;\\n }\\n void dfs2(ll k, ll par,vector<ll>&v){\\n v.PB(k);\\n if(k==end)ret=v;\\n for(auto to:g[k]){\\n if(par!=to)dfs2(to,k,v);\\n }\\n v.pop_back();\\n }\\n};\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n ll n;cin>>n;\\n vector<vector<edge>>g(n);\\n vector<vector<ll>>gw(n);\\n rep(i,0,n-1){\\n ll u,v;cin>>u>>v;u--;v--;\\n g[u].EB(v,1);\\n g[v].EB(u,1);\\n gw[u].PB(v);\\n gw[v].PB(u);\\n }\\n HLD hld(g);\\n Diameter dia(gw);\\n string s(n,'?');\\n string r=\\\"RGB\\\";\\n vector<BIT<ll>>bit(3,BIT<ll>(n));\\n auto vd=dia.diam_path();\\n vector<ll>td(n,-1);\\n rep(i,0,vd.size()){\\n if(i*2<vd.size())td[vd[i]]=0;\\n else td[vd[i]]=1;\\n }\\n //debug(td,n);\\n //debug(vd,vd.size());\\n {\\n\\n auto dfs=[&](auto &&f,ll k,ll par,ll d,ll flip)->void{\\n s[k]=r[d];\\n bit[d].add(hld.in[k],1);\\n for(auto to:gw[k]){\\n if(to==par)continue;\\n if(flip||(td[k]==0&&td[to]==-1))f(f,to,k,(d+2)%3,1);\\n else f(f,to,k,(d+1)%3,0);\\n }\\n };\\n dfs(dfs,dia.root,-1,0,0);\\n }\\n //cout<<dia.root spa dia.end spa dia.diam<<endl;\\n rep(i,0,n){\\n for(auto to:{dia.root,dia.end}){\\n //for(auto to:v){\\n auto p=hld.query_path(i,to,false);\\n rep(j,0,3){\\n ll now=0;\\n for(auto z:p)now+=bit[j].sum(z.fi,z.se-1);\\n chmax(res,now);\\n }\\n }\\n }\\n cout<<res<<endl;\\n cout<<s<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 88128,\n \"score_of_the_acc\": -1.0011,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3158_4834266\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <queue>\\nusing namespace std;\\nconst int N=200000;\\nvector<int> g[N];\\nint res[N];\\n\\nvoid paint_tree(int s,int p,int c,int sn){\\n\\tres[s]=c;\\n\\tfor(int t:g[s]){\\n\\t\\tif(t==p)continue;\\n\\t\\tpaint_tree(t,s,(c+sn+3)%3,sn);\\n\\t}\\n}\\n\\nvoid printres(int n){\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(res[i]==0)printf(\\\"R\\\");\\n\\t\\tif(res[i]==1)printf(\\\"G\\\");\\n\\t\\tif(res[i]==2)printf(\\\"B\\\");\\n\\t}\\n\\tprintf(\\\"\\\\n\\\");\\n}\\n\\nint main(){\\n\\tint n; cin >> n;\\n\\tfor(int i=1;i<n;i++){\\n\\t\\tint x,y; cin >> x >> y;\\n\\t\\tx--; y--;\\n\\t\\tg[x].push_back(y);\\n\\t\\tg[y].push_back(x);\\n\\t}\\n\\tqueue<int> q;\\n\\tq.push(0);\\n\\tvector<int> d(n);\\n\\twhile(q.size()){\\n\\t\\tint s=q.front(); q.pop();\\n\\t\\tfor(int t:g[s]){\\n\\t\\t\\tif(t!=0&&d[t]==0){\\n\\t\\t\\t\\td[t]=d[s]+1;\\n\\t\\t\\t\\tq.push(t);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint id=-1;\\n\\tint mx=-1;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(mx<d[i]){\\n\\t\\t\\tmx=d[i];\\n\\t\\t\\tid=i;\\n\\t\\t}\\n\\t}\\n\\tvector<int> dd(n);\\n\\tq.push(id);\\n\\twhile(q.size()){\\n\\t\\tint s=q.front(); q.pop();\\n\\t\\tfor(int t:g[s]){\\n\\t\\t\\tif(t!=id&&dd[t]==0){\\n\\t\\t\\t\\tdd[t]=dd[s]+1;\\n\\t\\t\\t\\tq.push(t);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint D=*max_element(dd.begin(), dd.end());\\n\\tD++;\\n\\tif(D%3){\\n\\t\\tprintf(\\\"%d\\\\n\\\",(D+2)/3);\\n\\t\\tpaint_tree(0,-1,0,1);\\n\\t\\tprintres(n);\\n\\t}\\n\\telse{\\n\\t\\tif(D%2==0){\\n\\t\\t\\tint jd=-1;\\n\\t\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\t\\tif(dd[i]==D-1)jd=i;\\n\\t\\t\\t}\\n\\t\\t\\tvector<int> ddd(n);\\n\\t\\t\\tq.push(jd);\\n\\t\\t\\twhile(q.size()){\\n\\t\\t\\t\\tint s=q.front(); q.pop();\\n\\t\\t\\t\\tfor(int t:g[s]){\\n\\t\\t\\t\\t\\tif(t!=jd&&ddd[t]==0){\\n\\t\\t\\t\\t\\t\\tddd[t]=ddd[s]+1;\\n\\t\\t\\t\\t\\t\\tq.push(t);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\t\\tif(dd[i]==D/2-1&&ddd[i]==D/2)id=i;\\n\\t\\t\\t\\tif(dd[i]==D/2&&ddd[i]==D/2-1)jd=i;\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\",D/3);\\n\\t\\t\\tpaint_tree(id,jd,0,1);\\n\\t\\t\\tpaint_tree(jd,id,2,-1);\\n\\t\\t\\tprintres(n);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tint jd=-1;\\n\\t\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\t\\tif(dd[i]==D-1)jd=i;\\n\\t\\t\\t}\\n\\t\\t\\tvector<int> ddd(n);\\n\\t\\t\\tq.push(jd);\\n\\t\\t\\twhile(q.size()){\\n\\t\\t\\t\\tint s=q.front(); q.pop();\\n\\t\\t\\t\\tfor(int t:g[s]){\\n\\t\\t\\t\\t\\tif(t!=jd&&ddd[t]==0){\\n\\t\\t\\t\\t\\t\\tddd[t]=ddd[s]+1;\\n\\t\\t\\t\\t\\t\\tq.push(t);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\t\\tif(dd[i]==D/2&&ddd[i]==D/2)id=i;\\n\\t\\t\\t\\td[i]=0;\\n\\t\\t\\t}\\n\\t\\t\\tq.push(id);\\n\\t\\t\\twhile(q.size()){\\n\\t\\t\\t\\tint s=q.front(); q.pop();\\n\\t\\t\\t\\tfor(int t:g[s]){\\n\\t\\t\\t\\t\\tif(t!=id&&d[t]==0){\\n\\t\\t\\t\\t\\t\\td[t]=d[s]+1;\\n\\t\\t\\t\\t\\t\\tq.push(t);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tint cnt=0;\\n\\t\\t\\tint DD=*max_element(d.begin(), d.end());\\n\\t\\t\\tvector<bool>used(n);\\n\\t\\t\\tused[id]=1;\\n\\t\\t\\tfor(int s:g[id]){\\n\\t\\t\\t\\tbool ok=0;\\n\\t\\t\\t\\tqueue<int> qq;\\n\\t\\t\\t\\tqq.push(s);\\n\\t\\t\\t\\twhile(qq.size()){\\n\\t\\t\\t\\t\\tint ss=qq.front(); qq.pop();\\n\\t\\t\\t\\t\\tif(d[ss]==DD)ok=1;\\n\\t\\t\\t\\t\\tused[ss]=1;\\n\\t\\t\\t\\t\\tfor(int t:g[ss]){\\n\\t\\t\\t\\t\\t\\tif(!used[t])qq.push(t);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(ok)cnt++;\\n\\t\\t\\t}\\n\\t\\t\\tif(cnt>=3){\\n\\t\\t\\t\\tprintf(\\\"%d\\\\n\\\",(D+3)/3);\\n\\t\\t\\t\\tpaint_tree(0,-1,0,1);\\n\\t\\t\\t\\tprintres(n);\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tint kd=-1;\\n\\t\\t\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\t\\t\\tif(d[i]==1&&ddd[i]+1==ddd[id])kd=i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"%d\\\\n\\\",D/3);\\n\\t\\t\\t\\tpaint_tree(id,kd,0,1);\\n\\t\\t\\t\\tpaint_tree(kd,id,2,-1);\\n\\t\\t\\t\\tprintres(n);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 28860,\n \"score_of_the_acc\": -0.2246,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3158_4834124\",\n \"code_snippet\": \"#pragma region Macros\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define ll long long\\n#define ld long double\\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vll vector<ll>\\n#define vpi vector<pii>\\n#define vpll vector<pll>\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n#define fi first\\n#define se second\\n#define all(c) begin(c), end(c)\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\nusing namespace std;\\nstring YES[2] = {\\\"NO\\\", \\\"YES\\\"};\\nstring Yes[2] = {\\\"No\\\", \\\"Yes\\\"};\\nstring yes[2] = {\\\"no\\\", \\\"yes\\\"};\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\n#define si(c) (int)(c).size()\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\\n scan(head);\\n IN(tail...);\\n}\\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\nvi iota(int n) {\\n vi a(n);\\n iota(all(a), 0);\\n return a;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n sort(all(y));\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\nint popcount(ll x) { return __builtin_popcountll(x); }\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(15);\\n }\\n} setup_io;\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return move(res);\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n cin >> a >> b >> c;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return move(res);\\n}\\n\\n#define i128 __int128_t\\n#define ull unsigned long long int\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n for(auto &e : v) cout << e << \\\" \\\";\\n cout << endl;\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n cout << \\\"(\\\" << p.fi << \\\", \\\" << p.se << \\\")\\\";\\n return os;\\n}\\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \\\"(\\\" + to_string(p.first) + \\\",\\\" + to_string(p.second) + \\\")\\\"; }\\ntemplate <class A> string to_string(A v) {\\n if(v.empty()) return \\\"{}\\\";\\n string ret = \\\"{\\\";\\n for(auto &x : v) ret += to_string(x) + \\\",\\\";\\n ret.back() = '}';\\n return ret;\\n}\\n\\nvoid dump() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\\n cerr << to_string(head) << \\\" \\\";\\n dump(tail...);\\n}\\n#define endl '\\\\n'\\n#ifdef _LOCAL\\n#undef endl\\n#define debug(x) \\\\\\n cout << #x << \\\": \\\"; \\\\\\n dump(x)\\n#else\\n#define debug(x)\\n#endif\\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\\n\\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\n#pragma endregion\\n\\nusing tree = Graph;\\nint search_center(tree &g) {\\n vector<int> res;\\n int max_depth = -1, leaf;\\n auto dfs = [&](auto &&self, int x, int p, int d, bool looking = false) -> bool {\\n bool flag = false;\\n if(max_depth < d) {\\n max_depth = d, leaf = x, flag = true;\\n res.clear();\\n }\\n for(auto e : g[x]) {\\n if(e != p) flag |= self(self, e, x, d + 1, looking);\\n }\\n if(looking and flag and d == (max_depth >> 1) or d == ((max_depth + 1) >> 1)) res.emplace_back(x);\\n return flag;\\n };\\n dfs(dfs, 0, -1, 0);\\n max_depth = -1;\\n dfs(dfs, leaf, -1, 0, true);\\n return res[0];\\n}\\nint main() {\\n string s = \\\"RGB\\\";\\n INT(n);\\n Graph g = getG(n);\\n if(n <= 3) {\\n cout << 1 << endl;\\n cout << s.substr(0, n) << endl;\\n exit(0);\\n }\\n vi ans(n);\\n int num = 0;\\n int c = search_center(g);\\n vi d(n);\\n {\\n auto dfs = [&](auto &&f, int x, int p) -> int {\\n d[x] = 1;\\n for(auto e : g[x])\\n if(e != p) chmax(d[x], f(f, e, x) + 1);\\n return d[x];\\n };\\n dfs(dfs, c, -1);\\n }\\n int ma[2] = {};\\n vi v;\\n for(auto e : g[c]) v.eb(d[e]);\\n sort(all(v), greater<>());\\n num = 1 + v[0] / 3 + v[1] / 3;\\n int cnt = 0;\\n for(auto e : v)\\n if(v[0] / 3 == e / 3) cnt += e % 3;\\n if(cnt > 2) num++;\\n cout << num << endl;\\n auto dfs = [&](auto &&f, int x, int p, int col, int dx) -> void {\\n ans[x] = col;\\n col = (col + 3 + dx) % 3;\\n for(auto e : g[x])\\n if(e != p) f(f, e, x, col, dx);\\n };\\n vi w;\\n for(auto e : g[c]) w.eb(e);\\n sort(all(w), [&](int i, int j) { return d[i] > d[j]; });\\n int k = 1;\\n for(auto e : w) {\\n dfs(dfs, e, c, (3 + k) % 3, k);\\n k *= -1;\\n }\\n rep(i, n) cout << s[ans[i]];\\n cout << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 34304,\n \"score_of_the_acc\": -0.2438,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3158_4833750\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int_fast32_t int32;\\ntypedef int_fast64_t int64;\\n\\nconst int32 inf = 1e9+7;\\nconst int32 MOD = 1000000007;\\nconst int64 llinf = 1e18;\\n\\n#define YES(n) cout << ((n) ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\" )\\n#define Yes(n) cout << ((n) ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\" )\\n#define POSSIBLE(n) cout << ((n) ? \\\"POSSIBLE\\\\n\\\" : \\\"IMPOSSIBLE\\\\n\\\" )\\n#define ANS(n) cout << (n) << \\\"\\\\n\\\"\\n#define REP(i,n) for(int64 i=0;i<(n);++i)\\n#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)\\n#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)\\n#define all(obj) (obj).begin(),(obj).end()\\n#define rall(obj) (obj).rbegin(),(obj).rend()\\n#define fi first\\n#define se second\\n#define pb(a) push_back(a)\\ntypedef pair<int32,int32> pii;\\ntypedef pair<int64,int64> pll;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) {\\n if (a < b) { a = b; return true; } return false;\\n}\\ntemplate<class T> inline bool chmin(T& a, T b) {\\n if (a > b) { a = b; return true; } return false;\\n}\\n\\nvector<vector<int32>> adj;\\nvector<int32> dist;\\n\\nvoid dfs(int32 v){\\n for(auto u : adj[v]){\\n if(dist[u] != inf)continue;\\n dist[u] = dist[v] + 1;\\n dfs(u);\\n }\\n}\\n\\n\\nvector<int32> mxdepth;\\n\\nint32 dfs2(int32 v, int32 p = -1){\\n for(auto u : adj[v]){\\n if(u == p)continue;\\n chmax(mxdepth[v],dfs2(u,v));\\n }\\n return mxdepth[v];\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int32 n;\\n cin >> n;\\n adj.resize(n);\\n REP(i,n-1){\\n int32 a,b;\\n cin >> a >> b;\\n --a;--b;\\n adj[a].pb(b);\\n adj[b].pb(a);\\n }\\n\\n dist.resize(n,inf);\\n dist[0] = 0;\\n dfs(0);\\n // REP(i,n)ANS(dist[i]);\\n int32 s = -1;\\n {\\n int32 mx = 0;\\n REP(i,n)chmax(mx, dist[i]);\\n REP(i,n){\\n if(dist[i] == mx){\\n s = i;\\n break;\\n }\\n }\\n }\\n\\n dist = vector<int32>(n,inf);\\n dist[s] = 0;\\n dfs(s);\\n int32 t = -1;\\n {\\n int32 mx = 0;\\n REP(i,n)chmax(mx, dist[i]);\\n REP(i,n){\\n if(dist[i] == mx){\\n t = i;\\n break;\\n }\\n }\\n }\\n // ANS(s);\\n // ANS(t);\\n int32 diam = dist[t];\\n // ANS(diam);\\n\\n vector<int32> diampath;\\n int32 cur = t;\\n diampath.pb(t);\\n while(cur != s){\\n for(auto v : adj[cur]){\\n if(dist[v] == dist[cur] - 1){\\n diampath.pb(v);\\n cur = v;\\n }\\n }\\n }\\n // for(auto v : diampath){\\n // ANS(v+1);\\n // }\\n\\n dist = vector<int32>(n,inf);\\n dist[diampath[diam/2]] = 0;\\n dfs(diampath[diam/2]);\\n vector<int32> depth1 = dist;\\n\\n dist = vector<int32>(n,inf);\\n dist[diampath[diam/2+1]] = 0;\\n dfs(diampath[diam/2+1]);\\n vector<int32> depth2 = dist;\\n\\n vector<int32> color(n,-1);\\n REP(i,n){\\n if(depth1[i] < depth2[i]){\\n color[i] = depth1[i] % 3;\\n }else{\\n color[i] = 2 - depth2[i] % 3;\\n }\\n }\\n\\n mxdepth = depth1;\\n dfs2(diampath[diam/2]);\\n int32 cnt = 0;\\n for(auto v : adj[diampath[diam/2]]){\\n if(mxdepth[v] == diam/2)++cnt;\\n }\\n\\n if(diam % 6 == 2 && cnt >= 3){\\n ANS((diam+3)/3+1);\\n }else{\\n ANS((diam+3)/3);\\n }\\n\\n REP(i,n){\\n // ANS(color[i]);\\n if(color[i] == 0){\\n cout << \\\"R\\\";\\n }else if(color[i] == 1){\\n cout << \\\"G\\\";\\n }else{\\n cout << \\\"B\\\";\\n }\\n }\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 29568,\n \"score_of_the_acc\": -0.1989,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3158_4833644\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int_fast32_t int32;\\ntypedef int_fast64_t int64;\\n\\nconst int32 inf = 1e9+7;\\nconst int32 MOD = 1000000007;\\nconst int64 llinf = 1e18;\\n\\n#define YES(n) cout << ((n) ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\" )\\n#define Yes(n) cout << ((n) ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\" )\\n#define POSSIBLE(n) cout << ((n) ? \\\"POSSIBLE\\\\n\\\" : \\\"IMPOSSIBLE\\\\n\\\" )\\n#define ANS(n) cout << (n) << \\\"\\\\n\\\"\\n#define REP(i,n) for(int64 i=0;i<(n);++i)\\n#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)\\n#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)\\n#define all(obj) (obj).begin(),(obj).end()\\n#define rall(obj) (obj).rbegin(),(obj).rend()\\n#define fi first\\n#define se second\\n#define pb(a) push_back(a)\\ntypedef pair<int32,int32> pii;\\ntypedef pair<int64,int64> pll;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) {\\n if (a < b) { a = b; return true; } return false;\\n}\\ntemplate<class T> inline bool chmin(T& a, T b) {\\n if (a > b) { a = b; return true; } return false;\\n}\\n\\nvector<vector<int32>> adj;\\nvector<int32> dist;\\n\\nvoid dfs(int32 v){\\n for(auto u : adj[v]){\\n if(dist[u] != inf)continue;\\n dist[u] = dist[v] + 1;\\n dfs(u);\\n }\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int32 n;\\n cin >> n;\\n adj.resize(n);\\n REP(i,n-1){\\n int32 a,b;\\n cin >> a >> b;\\n --a;--b;\\n adj[a].pb(b);\\n adj[b].pb(a);\\n }\\n\\n dist.resize(n,inf);\\n dist[0] = 0;\\n dfs(0);\\n // REP(i,n)ANS(dist[i]);\\n int32 s = -1;\\n {\\n int32 mx = 0;\\n REP(i,n)chmax(mx, dist[i]);\\n REP(i,n){\\n if(dist[i] == mx){\\n s = i;\\n break;\\n }\\n }\\n }\\n\\n dist = vector<int32>(n,inf);\\n dist[s] = 0;\\n dfs(s);\\n int32 t = -1;\\n {\\n int32 mx = 0;\\n REP(i,n)chmax(mx, dist[i]);\\n REP(i,n){\\n if(dist[i] == mx){\\n t = i;\\n break;\\n }\\n }\\n }\\n // ANS(s);\\n // ANS(t);\\n int32 diam = dist[t];\\n // ANS(diam);\\n\\n vector<int32> diampath;\\n int32 cur = t;\\n diampath.pb(t);\\n while(cur != s){\\n for(auto v : adj[cur]){\\n if(dist[v] == dist[cur] - 1){\\n diampath.pb(v);\\n cur = v;\\n }\\n }\\n }\\n // for(auto v : diampath){\\n // ANS(v+1);\\n // }\\n\\n dist = vector<int32>(n,inf);\\n dist[diampath[diam/2]] = 0;\\n dfs(diampath[diam/2]);\\n vector<int32> depth1 = dist;\\n\\n dist = vector<int32>(n,inf);\\n dist[diampath[diam/2+1]] = 0;\\n dfs(diampath[diam/2+1]);\\n vector<int32> depth2 = dist;\\n\\n vector<int32> color(n,-1);\\n REP(i,n){\\n if(depth1[i] < depth2[i]){\\n color[i] = depth1[i] % 3;\\n }else{\\n color[i] = 2 - depth2[i] % 3;\\n }\\n }\\n\\n if(diam == 2 && n >= 4){\\n ANS(2);\\n }else{\\n ANS((diam+3)/3); \\n }\\n\\n REP(i,n){\\n // ANS(color[i]);\\n if(color[i] == 0){\\n cout << \\\"R\\\";\\n }else if(color[i] == 1){\\n cout << \\\"G\\\";\\n }else{\\n cout << \\\"B\\\";\\n }\\n }\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.9444444444444444,\n \"time_ms\": 80,\n \"memory_kb\": 27852,\n \"score_of_the_acc\": -0.1806,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3158_4833524\",\n \"code_snippet\": \"#pragma region kyopro_template\\n#define Nyaan_template\\n#include <immintrin.h>\\n#include <bits/stdc++.h>\\n#define pb push_back\\n#define eb emplace_back\\n#define fi first\\n#define se second\\n#define each(x, v) for (auto &x : v)\\n#define all(v) (v).begin(), (v).end()\\n#define sz(v) ((int)(v).size())\\n#define mem(a, val) memset(a, val, sizeof(a))\\n#define ini(...) \\\\\\n int __VA_ARGS__; \\\\\\n in(__VA_ARGS__)\\n#define inl(...) \\\\\\n long long __VA_ARGS__; \\\\\\n in(__VA_ARGS__)\\n#define ins(...) \\\\\\n string __VA_ARGS__; \\\\\\n in(__VA_ARGS__)\\n#define inc(...) \\\\\\n char __VA_ARGS__; \\\\\\n in(__VA_ARGS__)\\n#define in2(s, t) \\\\\\n for (int i = 0; i < (int)s.size(); i++) { \\\\\\n in(s[i], t[i]); \\\\\\n }\\n#define in3(s, t, u) \\\\\\n for (int i = 0; i < (int)s.size(); i++) { \\\\\\n in(s[i], t[i], u[i]); \\\\\\n }\\n#define in4(s, t, u, v) \\\\\\n for (int i = 0; i < (int)s.size(); i++) { \\\\\\n in(s[i], t[i], u[i], v[i]); \\\\\\n }\\n#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)\\n#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)\\n#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)\\n#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)\\n#define reg(i, a, b) for (long long i = (a); i < (b); i++)\\n#define die(...) \\\\\\n do { \\\\\\n out(__VA_ARGS__); \\\\\\n return; \\\\\\n } while (0)\\nusing namespace std;\\nusing ll = long long;\\ntemplate <class T>\\nusing V = vector<T>;\\nusing vi = vector<int>;\\nusing vl = vector<long long>;\\nusing vvi = vector<vector<int>>;\\nusing vd = V<double>;\\nusing vs = V<string>;\\nusing vvl = vector<vector<long long>>;\\nusing P = pair<long long, long long>;\\nusing vp = vector<P>;\\nusing pii = pair<int, int>;\\nusing vpi = vector<pair<int, int>>;\\nconstexpr int inf = 1001001001;\\nconstexpr long long infLL = (1LL << 61) - 1;\\ntemplate <typename T, typename U>\\ninline bool amin(T &x, U y) {\\n return (y < x) ? (x = y, true) : false;\\n}\\ntemplate <typename T, typename U>\\ninline bool amax(T &x, U y) {\\n return (x < y) ? (x = y, true) : false;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\ntemplate <typename T, typename U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n int s = (int)v.size();\\n for (int i = 0; i < s; i++) os << (i ? \\\" \\\" : \\\"\\\") << v[i];\\n return os;\\n}\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v) {\\n for (auto &x : v) is >> x;\\n return is;\\n}\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &... u) {\\n cin >> t;\\n in(u...);\\n}\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U>\\nvoid out(const T &t, const U &... u) {\\n cout << t;\\n if (sizeof...(u)) cout << \\\" \\\";\\n out(u...);\\n}\\n\\n#ifdef NyaanDebug\\n#define trc(...) \\\\\\n do { \\\\\\n cerr << #__VA_ARGS__ << \\\" = \\\"; \\\\\\n dbg_out(__VA_ARGS__); \\\\\\n } while (0)\\n#define trca(v, N) \\\\\\n do { \\\\\\n cerr << #v << \\\" = \\\"; \\\\\\n array_out(v, N); \\\\\\n } while (0)\\n#define trcc(v) \\\\\\n do { \\\\\\n cerr << #v << \\\" = {\\\"; \\\\\\n each(x, v) { cerr << \\\" \\\" << x << \\\",\\\"; } \\\\\\n cerr << \\\"}\\\" << endl; \\\\\\n } while (0)\\ntemplate <typename T>\\nvoid _cout(const T &c) {\\n cerr << c;\\n}\\nvoid _cout(const int &c) {\\n if (c == 1001001001)\\n cerr << \\\"inf\\\";\\n else if (c == -1001001001)\\n cerr << \\\"-inf\\\";\\n else\\n cerr << c;\\n}\\nvoid _cout(const unsigned int &c) {\\n if (c == 1001001001)\\n cerr << \\\"inf\\\";\\n else\\n cerr << c;\\n}\\nvoid _cout(const long long &c) {\\n if (c == 1001001001 || c == (1LL << 61) - 1)\\n cerr << \\\"inf\\\";\\n else if (c == -1001001001 || c == -((1LL << 61) - 1))\\n cerr << \\\"-inf\\\";\\n else\\n cerr << c;\\n}\\nvoid _cout(const unsigned long long &c) {\\n if (c == 1001001001 || c == (1LL << 61) - 1)\\n cerr << \\\"inf\\\";\\n else\\n cerr << c;\\n}\\ntemplate <typename T, typename U>\\nvoid _cout(const pair<T, U> &p) {\\n cerr << \\\"{ \\\";\\n _cout(p.fi);\\n cerr << \\\", \\\";\\n _cout(p.se);\\n cerr << \\\" } \\\";\\n}\\ntemplate <typename T>\\nvoid _cout(const vector<T> &v) {\\n int s = v.size();\\n cerr << \\\"{ \\\";\\n for (int i = 0; i < s; i++) {\\n cerr << (i ? \\\", \\\" : \\\"\\\");\\n _cout(v[i]);\\n }\\n cerr << \\\" } \\\";\\n}\\ntemplate <typename T>\\nvoid _cout(const vector<vector<T>> &v) {\\n cerr << \\\"[ \\\";\\n for (const auto &x : v) {\\n cerr << endl;\\n _cout(x);\\n cerr << \\\", \\\";\\n }\\n cerr << endl << \\\" ] \\\";\\n}\\nvoid dbg_out() { cerr << endl; }\\ntemplate <typename T, class... U>\\nvoid dbg_out(const T &t, const U &... u) {\\n _cout(t);\\n if (sizeof...(u)) cerr << \\\", \\\";\\n dbg_out(u...);\\n}\\ntemplate <typename T>\\nvoid array_out(const T &v, int s) {\\n cerr << \\\"{ \\\";\\n for (int i = 0; i < s; i++) {\\n cerr << (i ? \\\", \\\" : \\\"\\\");\\n _cout(v[i]);\\n }\\n cerr << \\\" } \\\" << endl;\\n}\\ntemplate <typename T>\\nvoid array_out(const T &v, int H, int W) {\\n cerr << \\\"[ \\\";\\n for (int i = 0; i < H; i++) {\\n cerr << (i ? \\\", \\\" : \\\"\\\");\\n array_out(v[i], W);\\n }\\n cerr << \\\" ] \\\" << endl;\\n}\\n#else\\n#define trc(...)\\n#define trca(...)\\n#define trcc(...)\\n#endif\\n\\ninline int popcnt(unsigned long long a) { return __builtin_popcountll(a); }\\ninline int lsb(unsigned long long a) { return __builtin_ctzll(a); }\\ninline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); }\\ntemplate <typename T>\\ninline int getbit(T a, int i) {\\n return (a >> i) & 1;\\n}\\ntemplate <typename T>\\ninline void setbit(T &a, int i) {\\n a |= (1LL << i);\\n}\\ntemplate <typename T>\\ninline void delbit(T &a, int i) {\\n a &= ~(1LL << i);\\n}\\ntemplate <typename T>\\nint lb(const vector<T> &v, const T &a) {\\n return lower_bound(begin(v), end(v), a) - begin(v);\\n}\\ntemplate <typename T>\\nint ub(const vector<T> &v, const T &a) {\\n return upper_bound(begin(v), end(v), a) - begin(v);\\n}\\ntemplate <typename T>\\nint btw(T a, T x, T b) {\\n return a <= x && x < b;\\n}\\ntemplate <typename T, typename U>\\nT ceil(T a, U b) {\\n return (a + b - 1) / b;\\n}\\nconstexpr long long TEN(int n) {\\n long long ret = 1, x = 10;\\n while (n) {\\n if (n & 1) ret *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return ret;\\n}\\ntemplate <typename T>\\nvector<T> mkrui(const vector<T> &v) {\\n vector<T> ret(v.size() + 1);\\n for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];\\n return ret;\\n};\\ntemplate <typename T>\\nvector<T> mkuni(const vector<T> &v) {\\n vector<T> ret(v);\\n sort(ret.begin(), ret.end());\\n ret.erase(unique(ret.begin(), ret.end()), ret.end());\\n return ret;\\n}\\ntemplate <typename F>\\nvector<int> mkord(int N, F f) {\\n vector<int> ord(N);\\n iota(begin(ord), end(ord), 0);\\n sort(begin(ord), end(ord), f);\\n return ord;\\n}\\ntemplate <typename T = int>\\nvector<T> mkiota(int N) {\\n vector<T> ret(N);\\n iota(begin(ret), end(ret), 0);\\n return ret;\\n}\\ntemplate <typename T>\\nvector<int> mkinv(vector<T> &v) {\\n vector<int> inv(v.size());\\n for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;\\n return inv;\\n}\\n\\nstruct IoSetupNya {\\n IoSetupNya() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetupnya;\\n\\nvoid solve();\\nint main() { solve(); }\\n\\n#pragma endregion\\nusing namespace std;\\n\\ntemplate <typename T>\\nstruct edge {\\n int src, to;\\n T cost;\\n\\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\\n\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n\\n operator int() const { return to; }\\n};\\ntemplate <typename T>\\nusing Edges = vector<edge<T>>;\\ntemplate <typename T>\\nusing WeightedGraph = vector<Edges<T>>;\\nusing UnweightedGraph = vector<vector<int>>;\\n\\n// Input of (Unweighted) Graph\\nUnweightedGraph graph(int N, int M = -1, bool is_directed = false,\\n bool is_1origin = true) {\\n UnweightedGraph g(N);\\n if (M == -1) M = N - 1;\\n for (int _ = 0; _ < M; _++) {\\n int x, y;\\n cin >> x >> y;\\n if (is_1origin) x--, y--;\\n g[x].push_back(y);\\n if (!is_directed) g[y].push_back(x);\\n }\\n return g;\\n}\\n\\n// Input of Weighted Graph\\ntemplate <typename T>\\nWeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,\\n bool is_1origin = true) {\\n WeightedGraph<T> g(N);\\n if (M == -1) M = N - 1;\\n for (int _ = 0; _ < M; _++) {\\n int x, y;\\n cin >> x >> y;\\n T c;\\n cin >> c;\\n if (is_1origin) x--, y--;\\n g[x].eb(x, y, c);\\n if (!is_directed) g[y].eb(y, x, c);\\n }\\n return g;\\n}\\n\\n// Input of Edges\\ntemplate <typename T>\\nEdges<T> esgraph(int N, int M, int is_weighted = true, bool is_1origin = true) {\\n Edges<T> es;\\n for (int _ = 0; _ < M; _++) {\\n int x, y;\\n cin >> x >> y;\\n T c;\\n if (is_weighted)\\n cin >> c;\\n else\\n c = 1;\\n if (is_1origin) x--, y--;\\n es.emplace_back(x, y, c);\\n }\\n return es;\\n}\\n\\n// Input of Adjacency Matrix\\ntemplate <typename T>\\nvector<vector<T>> adjgraph(int N, int M, T INF, int is_weighted = true,\\n bool is_directed = false, bool is_1origin = true) {\\n vector<vector<T>> d(N, vector<T>(N, INF));\\n for (int _ = 0; _ < M; _++) {\\n int x, y;\\n cin >> x >> y;\\n T c;\\n if (is_weighted)\\n cin >> c;\\n else\\n c = 1;\\n if (is_1origin) x--, y--;\\n d[x][y] = c;\\n if (!is_directed) d[y][x] = c;\\n }\\n return d;\\n}\\nusing namespace std;\\n\\n\\n// Depth of Rooted Tree\\n// unvisited nodes : d = -1\\nvector<int> Depth(const UnweightedGraph &g, int start = 0) {\\n vector<int> d(g.size(), -1);\\n auto dfs = [&](auto rec, int cur, int par = -1) -> void {\\n d[cur] = par == -1 ? 0 : d[par] + 1;\\n for (auto &dst : g[cur]) {\\n if (dst == par) continue;\\n rec(rec, dst, cur);\\n }\\n };\\n dfs(dfs, start);\\n return d;\\n}\\n\\n// Depth of Rooted Weighted Tree\\n// unvisited nodes : d = -1\\ntemplate <typename T>\\nvector<T> Depth(const WeightedGraph<T> &g, int start = 0) {\\n vector<T> d(g.size(), -1);\\n auto dfs = [&](auto rec, int cur, T val, int par = -1) -> void {\\n d[cur] = val;\\n for (auto &dst : g[cur]) {\\n if (dst == par) continue;\\n rec(rec, dst, val + dst.cost, cur);\\n }\\n };\\n dfs(dfs, start, 0);\\n return d;\\n}\\n\\n// Diameter of Tree\\n// return value : { {u, v}, length }\\npair<pair<int, int>, int> Diameter(const UnweightedGraph &g) {\\n auto d = Depth(g, 0);\\n int u = max_element(begin(d), end(d)) - begin(d);\\n d = Depth(g, u);\\n int v = max_element(begin(d), end(d)) - begin(d);\\n return make_pair(make_pair(u, v), d[v]);\\n}\\n\\n// Diameter of Weighted Tree\\n// return value : { {u, v}, length }\\ntemplate <typename T>\\npair<pair<int, int>, T> Diameter(const WeightedGraph<T> &g) {\\n auto d = Depth(g, 0);\\n int u = max_element(begin(d), end(d)) - begin(d);\\n d = Depth(g, u);\\n int v = max_element(begin(d), end(d)) - begin(d);\\n return make_pair(make_pair(u, v), d[v]);\\n}\\n\\n// nodes on the path u-v ( O(N) )\\ntemplate <typename G>\\nvector<int> Path(G &g, int u, int v) {\\n vi ret;\\n int end = 0;\\n auto dfs = [&](auto rec, int cur, int par = -1) -> void {\\n ret.push_back(cur);\\n if (cur == v) {\\n end = 1;\\n return;\\n }\\n for (int dst : g[cur]) {\\n if (dst == par) continue;\\n rec(rec, dst, cur);\\n if (end) return;\\n }\\n if (end) return;\\n ret.pop_back();\\n };\\n dfs(dfs, u);\\n return ret;\\n}\\n\\nstring ans;\\nint n = 0;\\n\\ntemplate <typename G>\\nstruct CentroidDecomposition {\\n const G &g;\\n vector<int> sub;\\n vector<bool> v;\\n vector<vector<int>> tree;\\n int root;\\n\\n CentroidDecomposition(const G &g_, int isbuild = true) : g(g_) {\\n sub.resize(g.size(), 0);\\n v.resize(g.size(), false);\\n if (isbuild) build();\\n }\\n\\n void build() {\\n tree.resize(g.size());\\n root = build_dfs(0);\\n }\\n\\n int get_size(int cur, int par) {\\n sub[cur] = 1;\\n for (auto &dst : g[cur]) {\\n if (dst == par || v[dst]) continue;\\n sub[cur] += get_size(dst, cur);\\n }\\n return sub[cur];\\n }\\n\\n int get_centroid(int cur, int par, int mid) {\\n for (auto &dst : g[cur]) {\\n if (dst == par || v[dst]) continue;\\n if (sub[dst] > mid) return get_centroid(dst, cur, mid);\\n }\\n return cur;\\n }\\n\\n array<int, 3> calc(int cur, int par) {\\n array<int, 3> r1{0, 0, 0}, r2{0, 0, 0};\\n for (auto &dst : g[cur]) {\\n if (dst == par || v[dst]) continue;\\n auto d = calc(dst, cur);\\n rep(i, 3) {\\n if (d[i] > r1[i]) swap(d[i], r1[i]);\\n if (d[i] > r2[i]) swap(d[i], r2[i]);\\n }\\n }\\n if (ans[cur] == 'R') r1[0]++;\\n if (ans[cur] == 'G') r1[1]++;\\n if (ans[cur] == 'B') r1[2]++;\\n rep(i, 3) amax(n, r1[i] + r2[i]);\\n return r1;\\n }\\n\\n int build_dfs(int cur) {\\n int centroid = get_centroid(cur, -1, get_size(cur, -1) / 2);\\n v[centroid] = true;\\n calc(centroid, -1);\\n for (auto &dst : g[centroid]) {\\n if (!v[dst]) {\\n int nxt = build_dfs(dst);\\n if (centroid != nxt) tree[centroid].emplace_back(nxt);\\n }\\n }\\n v[centroid] = false;\\n return centroid;\\n }\\n};\\n\\nint solve_(int N, vvi g) {\\n // ini(N);\\n // auto g = graph(N);\\n ans.resize(N);\\n fill(all(ans), ' ');\\n\\n auto [p, l] = Diameter(g);\\n auto [u, v] = p;\\n auto path = Path(g, u, v);\\n\\n int i = 0;\\n auto c = [&]() { return i == 0 ? 'R' : i == 1 ? 'G' : 'B'; };\\n //int i = 0;\\n rep(j,sz(path)) {\\n ans[path[j]] = c();\\n i = (i + 1) % 3;\\n } \\n //out(path);\\n //out(ans);\\n {\\n i = 0;\\n int rev = 0;\\n auto dfs = [&](auto rec, int cur, int par) -> void {\\n ans[cur] = c();\\n each(dst, g[cur]) {\\n if (dst == par || ans[dst] != ' ') continue;\\n i = (rev ? (i + 2) % 3 : (i + 1) % 3);\\n rec(rec, dst, cur);\\n i = (rev ? (i + 1) % 3 : (i + 2) % 3);\\n }\\n };\\n for(int j = 0; j < sz(path); j++){\\n if(j * 2 <= sz(path) ) rev = 1;\\n else rev = 0;\\n i = j % 3;\\n dfs(dfs, path[j], -1);\\n }\\n }\\n each(x, ans) if (x == ' ') exit(1);\\n // trc(ans);\\n n = 0;\\n CentroidDecomposition<vvi> dec(g);\\n out(n);\\n out(ans);\\n return n;\\n}\\n\\nint naive(int N, vvi g) {\\n ans.resize(N, ' ');\\n int n2 = inf;\\n rep(i, int(pow(3, N))) {\\n int j = i;\\n rep(_, N) {\\n int k = j % 3;\\n j /= 3;\\n ans[_] = (k == 0 ? 'R' : k == 1 ? 'G' : 'B');\\n }\\n n = 0;\\n CentroidDecomposition<vvi> dec(g);\\n amin(n2, n);\\n }\\n return n2;\\n}\\n\\nvoid solve() {\\n /**/\\n ini(N);\\n auto g=graph(N);\\n solve_(N,g);\\n //*/\\n /**\\n mt19937 rng;\\n while (1) {\\n int N = rng() % 7 + 2;\\n vvi g(N);\\n rep1(i, N - 1) {\\n int j = rng() % i;\\n g[i].push_back(j);\\n g[j].push_back(i);\\n }\\n int n1 = solve_(N, g);\\n int n2 = naive(N, g);\\n if (n1 != n2) {\\n trc(N);\\n trc(g);\\n trc(n1, n2);\\n exit(1);\\n }\\n //trc(N);\\n }\\n //*/\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 54372,\n \"score_of_the_acc\": -0.5912,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3158_4833422\",\n \"code_snippet\": \"#pragma region Macros\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define ll long long\\n#define ld long double\\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vll vector<ll>\\n#define vpi vector<pii>\\n#define vpll vector<pll>\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n#define fi first\\n#define se second\\n#define all(c) begin(c), end(c)\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\nusing namespace std;\\nstring YES[2] = {\\\"NO\\\", \\\"YES\\\"};\\nstring Yes[2] = {\\\"No\\\", \\\"Yes\\\"};\\nstring yes[2] = {\\\"no\\\", \\\"yes\\\"};\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\n#define si(c) (int)(c).size()\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\\n scan(head);\\n IN(tail...);\\n}\\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\nvi iota(int n) {\\n vi a(n);\\n iota(all(a), 0);\\n return a;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n sort(all(y));\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\nint popcount(ll x) { return __builtin_popcountll(x); }\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(15);\\n }\\n} setup_io;\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return move(res);\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n cin >> a >> b >> c;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return move(res);\\n}\\n\\n#define i128 __int128_t\\n#define ull unsigned long long int\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n for(auto &e : v) cout << e << \\\" \\\";\\n cout << endl;\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n cout << \\\"(\\\" << p.fi << \\\", \\\" << p.se << \\\")\\\";\\n return os;\\n}\\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \\\"(\\\" + to_string(p.first) + \\\",\\\" + to_string(p.second) + \\\")\\\"; }\\ntemplate <class A> string to_string(A v) {\\n if(v.empty()) return \\\"{}\\\";\\n string ret = \\\"{\\\";\\n for(auto &x : v) ret += to_string(x) + \\\",\\\";\\n ret.back() = '}';\\n return ret;\\n}\\n\\nvoid dump() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\\n cerr << to_string(head) << \\\" \\\";\\n dump(tail...);\\n}\\n#define endl '\\\\n'\\n#ifdef _LOCAL\\n#undef endl\\n#define debug(x) \\\\\\n cout << #x << \\\": \\\"; \\\\\\n dump(x)\\n#else\\n#define debug(x)\\n#endif\\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\\n\\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\n#pragma endregion\\n\\nusing tree = Graph;\\nint search_center(tree &g) {\\n vector<int> res;\\n int max_depth = -1, leaf;\\n auto dfs = [&](auto &&self, int x, int p, int d, bool looking = false) -> bool {\\n bool flag = false;\\n if(max_depth < d) {\\n max_depth = d, leaf = x, flag = true;\\n res.clear();\\n }\\n for(auto e : g[x]) {\\n if(e != p) flag |= self(self, e, x, d + 1, looking);\\n }\\n if(looking and flag and d == (max_depth >> 1) or d == ((max_depth + 1) >> 1)) res.emplace_back(x);\\n return flag;\\n };\\n dfs(dfs, 0, -1, 0);\\n max_depth = -1;\\n dfs(dfs, leaf, -1, 0, true);\\n return res[0];\\n}\\nint main() {\\n string s = \\\"RGB\\\";\\n INT(n);\\n Graph g = getG(n);\\n if(n <= 3) {\\n cout << 1 << endl;\\n cout << s.substr(0, n) << endl;\\n exit(0);\\n }\\n vi ans(n);\\n int num = 0;\\n int c = search_center(g);\\n vi d(n);\\n {\\n auto dfs = [&](auto &&f, int x, int p) -> int {\\n d[x] = 1;\\n for(auto e : g[x])\\n if(e != p) chmax(d[x], f(f, e, x) + 1);\\n return d[x];\\n };\\n dfs(dfs, c, -1);\\n }\\n int ma[2] = {};\\n vi v;\\n for(auto e : g[c]) v.eb(d[e]);\\n sort(all(v), greater<>());\\n num = 1 + v[0] / 3 + v[1] / 3;\\n int cnt = 0;\\n for(auto e : v)\\n if(v[0] / 3 == e / 3) cnt += e % 3;\\n if(cnt > 2) num++;\\n cout << num << endl;\\n auto dfs = [&](auto &&f, int x, int p, int col, int dx) -> void {\\n ans[x] = col;\\n col = (col + 3 + dx) % 3;\\n for(auto e : g[x])\\n if(e != p) f(f, e, x, col, dx);\\n };\\n vi w;\\n for(auto e : g[c]) w.eb(e);\\n sort(all(w), [&](int i, int j) { return d[i] > d[j]; });\\n int k = 1;\\n for(auto e : w) {\\n dfs(dfs, e, c, (3 + k) % 3, k);\\n k *= -1;\\n }\\n rep(i, n) cout << s[ans[i]];\\n cout << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 34400,\n \"score_of_the_acc\": -0.2393,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3158_4833314\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=998244353,MAX=200005,INF=1<<30;\\nvector<int> G[MAX];\\nint deg[MAX];\\nint ans[MAX];\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n int N;cin>>N;\\n \\n if(N==1){\\n cout<<1<<endl;\\n cout<<\\\"R\\\"<<endl;\\n return 0;\\n }\\n \\n for(int i=0;i<N-1;i++){\\n int a,b;cin>>a>>b;\\n a--;b--;\\n G[a].push_back(b);\\n G[b].push_back(a);\\n deg[a]++;\\n deg[b]++;\\n }\\n \\n memset(ans,-1,sizeof(ans));\\n \\n int rem=N,now=0,res=0;\\n \\n set<int> SE;\\n for(int i=0;i<N;i++) if(deg[i]==1) SE.insert(i);\\n \\n while(rem){\\n set<int> nex;\\n if(rem<=3&&now%3==0){\\n int cnt=0;\\n for(int i=0;i<N;i++){\\n if(ans[i]==-1){\\n ans[i]=cnt;\\n cnt++;\\n }\\n }\\n res=now/3*2+1;\\n \\n break;\\n }else{\\n for(auto a:SE){\\n ans[a]=now;\\n deg[a]=0;\\n rem--;\\n \\n for(int to:G[a]){\\n if(ans[to]!=-1) continue;\\n deg[to]--;\\n if(deg[to]==1) nex.insert(to);\\n }\\n }\\n \\n res=(now/3+1)*2;\\n }\\n \\n now++;\\n SE=nex;\\n }\\n \\n cout<<res<<endl;\\n \\n for(int i=0;i<N;i++){\\n if(ans[i]%3==0) cout<<'R';\\n else if(ans[i]%3==1) cout<<'G';\\n else cout<<'B';\\n }\\n cout<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 25276,\n \"score_of_the_acc\": -0.1586,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3158_4833256\",\n \"code_snippet\": \"#include <string>\\n#include <vector>\\n#include<iostream>\\n#include<cstdio>\\n#include<cstdlib>\\n#include<stack>\\n#include<queue>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<list>\\n#include<deque>\\n#include<bitset>\\n#include<set>\\n#include<map>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<cstring>\\n#include<sstream>\\n#include<complex>\\n#include<iomanip>\\n#include<numeric>\\n#include<cassert>\\n#include<random>\\n#define X first\\n#define Y second\\n#define pb push_back\\n#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))\\n#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))\\n#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))\\n#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))\\n#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))\\n#define peat(X,Y) for (;(X) < (Y);++(X))\\n#define all(X) (X).begin(),(X).end()\\n#define rall(X) (X).rbegin(),(X).rend()\\n#define eb emplace_back\\n#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())\\n#define Endl endl\\n#define NL <<\\\"\\\\n\\\"\\n#define cauto const auto\\n\\nusing namespace std;\\nusing ll=long long;\\nusing pii=pair<int,int>;\\nusing pll=pair<ll,ll>;\\ntemplate<class T> using vv=vector<vector<T>>;\\ntemplate<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}\\ntemplate<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}\\n//#undef NUIP\\n#ifdef NUIP\\n#include \\\"benri.h\\\"\\n#else\\n#define out(args...)\\n#endif\\n#ifdef __cpp_init_captures\\ntemplate<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}\\ntemplate <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}\\n#endif\\ntemplate<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}\\ntemplate<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}\\ntemplate<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}\\ntemplate<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}\\ntemplate<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}\\ntemplate<class T=ll> T read(){ T re; cin>>re; return move(re);}\\ntemplate<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}\\ntemplate<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}\\ntemplate<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}\\nvv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}\\nvv<int> readG(const int &n){ return readG(n,n-1);}\\nconst ll MOD=1e9+7; //998244353\\n\\nvector<int> getDiam(const vv<int> &g){\\n\\tconst int n=g.size();\\n\\tint rt;\\n\\t{\\n\\t\\tvector<int> d(n,MOD); d[0]=0;\\n\\t\\tqueue<int> que; que.emplace(0);\\n\\t\\twhile(que.size()){\\n\\t\\t\\tcauto v=que.front(); que.pop();\\n\\t\\t\\tfor(auto w:g[v])if(MN(d[w],d[v]+1)) que.emplace(w);\\n\\t\\t}\\n\\t\\tint mx=-1;\\n\\t\\trep(v,n)if(MX(mx,d[v])) rt=v;\\n\\t\\tout(d[3],mx,rt,1);\\n\\t}\\n\\tvector<int> re;\\n\\t{\\n\\t\\tvector<pii> d(n,{MOD,0}); d[rt]={0,-1};\\n\\t\\tqueue<int> que; que.emplace(rt);\\n\\t\\twhile(que.size()){\\n\\t\\t\\tcauto v=que.front(); que.pop();\\n\\t\\t\\tfor(auto w:g[v])if(MN(d[w],{d[v].X+1,v})) que.emplace(w);\\n\\t\\t}\\n\\t\\tpii mx{-1,0};\\n\\t\\tre.eb();\\n\\t\\trep(v,n)if(MX(mx,d[v])) re.back()=v;\\n\\t\\tout(d[3],re,rt,1);\\n\\t\\twhile(re.back()!=rt){\\n\\t\\t\\tcauto tmp=d[re.back()].Y;\\n\\t\\t\\tre.eb(tmp);\\n\\t\\t}\\n\\t\\treturn re;\\n\\t}\\n}\\n\\nvector<int> solve(const vv<int> &g){\\n\\tconst int n=g.size();\\n\\t// if(n==3) return {0,1,2};\\n\\tcauto diam=getDiam(g);\\n\\tout(diam,1);\\n\\tcauto rt=diam[diam.size()/2];\\n\\tvector<int> re(n,MOD); re[rt]=0;\\n\\tqueue<int> que; que.emplace(rt);\\n\\twhile(que.size()){\\n\\t\\tcauto v=que.front(); que.pop();\\n\\t\\tfor(auto w:g[v])if(MN(re[w],re[v]+1)) que.emplace(w);\\n\\t}\\n\\tfor(auto &x:re) x%=3;\\n\\tif(diam.size()%2){\\n\\t\\tauto dfs=\\n\\t\\t[&](auto &&dfs,int v,int p)->void{\\n\\t\\t\\tif(re[v]) re[v]=3-re[v];\\n\\t\\t\\tfor(auto w:g[v])if(w!=p) dfs(dfs,w,v);\\n\\t\\t};\\n\\t\\tdfs(dfs,rt,diam[diam.size()/2-1]);\\n\\t}else{\\n\\t\\tauto dfs=\\n\\t\\t[&](auto &&dfs,int v,int p)->void{\\n\\t\\t\\tre[v]=2-re[v];\\n\\t\\t\\tfor(auto w:g[v])if(w!=p) dfs(dfs,w,v);\\n\\t\\t};\\n\\t\\tdfs(dfs,rt,diam[diam.size()/2-1]);\\n\\t}\\n\\t// out(re,1);\\n\\treturn re;\\n}\\n\\nint calc(const vv<int> &g, vector<int> cs){\\n\\tconst int n=g.size();\\n\\tvector<array<int,3>> cnt(n,{0,0,0});\\n\\tint re=1;\\n\\tauto dfs=\\n\\t\\t[&](auto &&dfs,int v,int p)->void{\\n\\t\\t\\tarray<int,3> mx{0,0,0};\\n\\t\\t\\tfor(auto w:g[v])if(w!=p){\\n\\t\\t\\t\\tdfs(dfs,w,v);\\n\\t\\t\\t\\trep(i,3) MX(re,mx[i]+cnt[w][i]+(cs[v]==i));\\n\\t\\t\\t\\trep(i,3) out(v,w,i,mx,cnt[w],mx[i]+cnt[w][i]+(cs[v]==i),1);\\n\\t\\t\\t\\trep(i,3){\\n\\t\\t\\t\\t\\tMX(cnt[v][i],cnt[w][i]);\\n\\t\\t\\t\\t\\tMX(mx[i],cnt[w][i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t++cnt[v][cs[v]];\\n\\t\\t};\\n\\tdfs(dfs,0,-1);\\n\\treturn re;\\n}\\n\\nmt19937 rnd(123);\\nvv<int> tree(int n){\\n\\tvv<int> g(n);\\n\\tvector<int> ind(n); iota(all(ind),0);\\n\\tshuffle(all(ind),rnd);\\n\\treps(i,1,n){\\n\\t\\tint a=ind[i];\\n\\t\\tint b=ind[i-1];\\n\\t\\t// while(b>0){\\n\\t\\t// \\tif(rnd()%2) break;\\n\\t\\t// \\t--b;\\n\\t\\t// }\\n\\t\\tg[a].pb(b);\\n\\t\\tg[b].pb(a);\\n\\t}\\n\\treturn g;\\n}\\n\\nint main(){\\n ios_base::sync_with_stdio(false); cin.tie(0);\\n cout<<fixed<<setprecision(0);\\n\\t// cauto gg=tree(100000);\\n\\t// out(solve(gg),1); return 0;\\n// \\tout(calc({{5,7}\\n// ,{7}\\n// ,{5,4}\\n// ,{6}\\n// ,{2}\\n// ,{0,2}\\n// ,{7,3}\\n// \\t\\t\\t\\t\\t\\t,{0,1,6}},{1,1,0,0,0,0,0,0}),1);\\n// \\treturn 0;\\n\\tif(0){\\n\\t\\tconst int N=12;\\n\\t\\tvector<int> pw(N+1); pw[0]=1;\\n\\t\\trep(i,N) pw[i+1]=pw[i]*3;\\n\\t\\trep(_,1000){\\n\\t\\t\\tconst int n=rand()%N+1;\\n\\t\\t\\tcauto g=tree(n);\\n\\t\\t\\tint best=n;\\n\\t\\t\\tvector<int> wit;\\n\\t\\t\\trep(i,pw[n]){\\n\\t\\t\\t\\tvector<int> v(n);\\n\\t\\t\\t\\trep(j,n) v[j]=i/pw[j]%3;\\n\\t\\t\\t\\tif(MN(best,calc(g,v))) wit=v;\\n\\t\\t\\t}\\n\\t\\t\\tcauto ans=solve(g);\\n\\t\\t\\tint act=calc(g,ans);\\n\\t\\t\\tif(act!=best){\\n\\t\\t\\t\\tout(g,ans,act,best,wit,1);\\n\\t\\t\\t\\trep(v,n)for(auto w:g[v])if(v<w) cout<<v<<\\\" \\\"<<w NL;\\n\\t\\t\\t\\texit(0);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tout(\\\"done\\\",1);\\n\\t\\texit(0);\\n\\t}\\n\\tcauto n=read();\\n\\tcauto g=readG(n);\\n\\tcauto re=solve(g);\\n\\tcout<<calc(g,re) NL;\\n\\tfor(auto x:re) cout<<\\\"RGB\\\"[x]; cout NL;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 39764,\n \"score_of_the_acc\": -0.302,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3158_4833048\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> l_l;\\ntypedef pair<int, int> i_i;\\ntemplate<class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nconst long long INF = 1e18;\\n//const ll mod = 1000000007;\\nll dist[10][201000];\\nll N;\\nvector<ll> edges[201000];\\nll ans = 0;\\nchar S[201000];\\nstring RGB = \\\"RGB\\\";\\nvector<ll> dp[201000];\\n\\nvoid dfs(int idx, int now, int from) {\\n for(auto to : edges[now]) {\\n if(to == from) continue;\\n dist[idx][to] = dist[idx][now] + 1;\\n dfs(idx, to, now);\\n }\\n}\\n\\nvoid dfs2(ll now, ll from) {\\n for(int i = 0; i < 3; i++) {\\n if(RGB[i] == S[now]) dp[now][i]++;\\n chmax(ans, dp[now][i]);\\n }\\n for(auto to : edges[now]) {\\n if(to == from) continue;\\n dp[to] = dp[now];\\n dfs2(to, now);\\n }\\n}\\n\\nvoid dfs3(int idx, int now, int from) {\\n dist[idx][now] = 1;\\n for(auto to : edges[now]) {\\n if(to == from) continue;\\n dfs3(idx, to, now);\\n chmax(dist[idx][now], dist[idx][to] + 1);\\n }\\n}\\n\\nstring T[2] = {\\\"RGB\\\", \\\"GRB\\\"};\\n\\nvoid dfs4(string T, int idx, int now, int from) {\\n S[now] = T[idx];\\n for(auto to : edges[now]) {\\n if(to == from) continue;\\n dfs4(T, (idx + 1) % 3, to, now);\\n }\\n}\\n\\nvoid f(ll c) {\\n map<ll, vector<ll>> mp;\\n for(auto to : edges[c]) {\\n mp[-dist[2][to]].push_back(to);\\n }\\n int parity = 0;\\n for(auto tmp : mp) {\\n ll d = -tmp.first;\\n auto v = tmp.second;\\n /*\\n cerr << \\\"- \\\" << d << \\\" -\\\" << endl;\\n for(auto tmp : v) {\\n cerr << tmp << \\\" \\\";\\n }\\n cerr << endl;\\n */\\n if(v.size() == 1) {\\n ll len = 1 + 2 * d - 1;\\n chmax(ans, (len + 2) / 3);\\n } else if(v.size() == 2) {\\n ll len = 1 + 2 * d;\\n chmax(ans, (len + 2) / 3);\\n } else {\\n if(d % 3 == 0) {\\n chmax(ans, 1 + (d / 3) * 2);\\n } else {\\n chmax(ans, (d + 2) / 3 * 2);\\n }\\n }\\n for(auto to : v) {\\n dfs4(T[parity], 0, to, c);\\n parity = 1 - parity;\\n }\\n }\\n}\\n\\n\\nint main() {\\n cin >> N;\\n for(int i = 0; i < N - 1; i++) {\\n ll a, b;\\n cin >> a >> b;\\n a--;\\n b--;\\n edges[a].push_back(b);\\n edges[b].push_back(a);\\n }\\n dist[0][0] = 0;\\n dfs(0, 0, -1);\\n ll B = 0;\\n for(int i = 0; i < N; i++) {\\n if(dist[0][i] > dist[0][B]) B = i;\\n }\\n dist[0][B] = 0;\\n dfs(0, B, -1);\\n ll A = 0;\\n for(int i = 0; i < N; i++) {\\n if(dist[0][A] < dist[0][i]) A = i;\\n }\\n dist[1][A] = 0;\\n dfs(1, A, -1);\\n ll c;\\n for(int i = 0; i < N; i++) {\\n if(dist[0][i] + dist[1][i] == dist[0][A] and abs(dist[0][i] - dist[1][i]) <= 1) {\\n c = i;\\n }\\n }\\n //cerr << A << \\\" \\\" << B << \\\" \\\" << c << endl;\\n dfs3(2, c, -1);\\n S[c] = 'B';\\n f(c);\\n dp[A] = {0, 0, 0};\\n dfs2(A, -1);\\n cout << ans << endl;\\n for(int i = 0; i < N; i++) cout << S[i];\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 45576,\n \"score_of_the_acc\": -0.4807,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3158_4832749\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\n//#include<atcoder/dsu>\\n//#include<atcoder/fenwicktree>\\n//#include<atcoder/math>\\n//#include<atcoder/maxflow>\\n\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 998244353;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m) {\\n\\tif (x >= m)x %= m;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\n\\nconst int mn = 1 << 18;\\nstruct edge {\\n\\tint to;\\n};\\nstruct Data {\\n\\tint d, ma;\\n};\\nvector<edge> G[mn];\\nvector<int> ids[mn];\\nvector<Data> memo[mn];\\nint root;\\n\\nData merge(Data a, Data b) {\\n\\tData res;\\n\\t//\\n\\tres.d = max(a.d, b.d);\\n\\tres.ma = max(a.ma, b.ma);\\n\\t//\\n\\treturn res;\\n}\\n\\nvoid add(P& p, int x) {\\n\\tif (p.first < x) {\\n\\t\\tp.second = p.first;\\n\\t\\tp.first = x;\\n\\t}\\n\\telse if (p.second < x)p.second = x;\\n}\\nData dfs(int id, int fr) {\\n\\tData res;\\n\\t//\\n\\t//initialize\\n\\tres = { 0,1 };\\n\\tP p = { 0,0 };\\n\\t//\\n\\tfor (edge e : G[id]) {\\n\\t\\tif (e.to == fr)continue;\\n\\t\\tData nex = dfs(e.to, id);\\n\\t\\t//\\n\\t\\t//update with edge\\n\\t\\t//\\n\\t\\tadd(p, nex.d);\\n\\t\\tres = merge(res, nex);\\n\\t\\tids[id].push_back(e.to);\\n\\t\\tmemo[id].push_back(nex);\\n\\t}\\n\\t\\n\\t//\\n\\t//update for return\\n int s0 = p.first/ 3 + p.second / 3 + 1;\\n int s1 = (p.first+2) / 3 + (p.second+2) / 3;\\n res.ma = max({ res.ma,s0,s1 });\\n\\tres.d++;\\n\\n\\t//\\n\\treturn res;\\n}\\n\\nint score[1 << 18];\\nvoid invdfs(int id, int fr, Data pre) {\\n\\tvector<Data> v;\\n\\tfor (Data d : memo[id])v.push_back(d);\\n\\tif (fr >= 0)v.push_back(pre);\\n\\tint len = v.size();\\n\\t//\\n\\tP p = { 0,0 };\\n\\t//calcurate id's ans\\n\\tfor (Data d : v) {\\n\\t\\tscore[id] = max(score[id], d.ma);\\n\\t\\tadd(p, d.d);\\n\\t}\\n\\tint s0 = p.first / 3 + p.second / 3 + 1;\\n\\tint s1 = (p.first+2) / 3 + (p.second+2) / 3;\\n\\tscore[id] = max({ score[id],s0,s1 });\\n\\t//\\n\\tvector<Data> le(len + 1);\\n\\tvector<Data> ri(len + 1);\\n\\tvector<P> ple(len + 1);\\n\\tvector<P> pri(len + 1);\\n\\t//\\n\\tData init_c = { 0,0 };\\n\\t//\\n\\tle[0] = init_c;\\n\\tple[0] = { 0,0 };\\n\\trep(i, len) {\\n\\t\\tle[i + 1] = merge(le[i], v[i]);\\n\\t\\tple[i + 1] = ple[i]; add(ple[i + 1], v[i].d);\\n\\n\\t}\\n\\tri[len] = init_c;\\n\\tpri[len] = { 0,0 };\\n\\tper(i, len) {\\n\\t\\tri[i] = merge(ri[i + 1], v[i]);\\n\\t\\tpri[i] = pri[i + 1]; add(pri[i], v[i].d);\\n\\t}\\n\\trep(i, ids[id].size()) {\\n\\t\\tint to = ids[id][i];\\n\\t\\tData d = merge(le[i], ri[i + 1]);\\n\\n\\t\\t//\\n\\t\\t//update for return\\n\\t\\tP p = { 0,0 };\\n\\t\\tadd(p, ple[i].first);\\n\\t\\tadd(p, ple[i].second);\\n\\t\\tadd(p, pri[i+1].first);\\n\\t\\tadd(p, pri[i+1].second);\\n\\n\\t\\tint s0 = p.first / 3 + p.second / 3 + 1;\\n\\t\\tint s1 = (p.first+2) / 3 + (p.second+2) / 3;\\n\\t\\td.ma = max({ d.ma,s0,s1 });\\n\\t\\td.d++;\\n\\t\\t//\\n\\t\\tinvdfs(to, id, d);\\n\\t}\\n}\\nvoid yaru() {\\n\\tdfs(root, -1);\\n\\tinvdfs(root, -1, { 0,0 });\\n}\\n\\n\\n\\nstring s = \\\"RGB\\\";\\nstring ans;\\nvoid dfs(int id, int fr, int col) {\\n\\tif (col == 3)col = 0;\\n\\tans[id] = s[col];\\n\\tfor (edge e : G[id])if (e.to != fr) {\\n\\t\\tdfs(e.to, id, col + 1);\\n\\t}\\n}\\n\\nint calcans() {\\n\\tint ma = 0;\\n\\trep(i, 3) {\\n\\t\\tfunction<int(int, int)> calc = [&](int id, int fr)->int {\\n\\t\\t\\tvector<int> ts;\\n\\t\\t\\tfor (edge e : G[id])if (e.to != fr) {\\n\\t\\t\\t\\tint nex = calc(e.to, id);\\n\\t\\t\\t\\tts.push_back(nex);\\n\\t\\t\\t}\\n\\t\\t\\tsort(all(ts), greater<int>());\\n\\t\\t\\tif (ts.size() >= 2) {\\n\\t\\t\\t\\tint sum = ts[0] + ts[1];\\n\\t\\t\\t\\tif (ans[id] == s[i])sum++;\\n\\t\\t\\t\\tma = max(ma, sum);\\n\\t\\t\\t}\\n\\t\\t\\tint res = 0;\\n\\t\\t\\tif (ts.size()) {\\n\\t\\t\\t\\tres = ts[0];\\n\\t\\t\\t}\\n\\t\\t\\tif (ans[id] == s[i])res++;\\n\\t\\t\\tma = max(ma, res);\\n\\t\\t\\treturn res;\\n\\t\\t}; calc(0, -1);\\n\\t}\\n\\treturn ma;\\n}\\n\\nvoid solve() {\\n\\tint n; cin >> n; ans.resize(n);\\n\\trep(i, n - 1) {\\n\\t\\tint a, b; cin >> a >> b; a--; b--;\\n\\t\\tG[a].push_back({ b });\\n\\t\\tG[b].push_back({ a });\\n\\t}\\n\\tyaru();\\n\\tint mi = mod;\\n\\tint chk = -1;\\n\\trep(i, n) {\\n\\t\\tif (mi > score[i]) {\\n\\t\\t\\tmi = score[i];\\n\\t\\t\\tchk = i;\\n\\t\\t}\\n\\t}\\n\\tdfs(chk, -1, 0);\\n\\tint val = calcans();\\n\\tassert(mi == val);\\n\\tcout << mi << \\\"\\\\n\\\";\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(15);\\n\\t//init_f();\\n\\t//init();\\n\\t//expr();\\n\\t//int t; cin >> t; rep(i, t)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 106776,\n \"score_of_the_acc\": -1.1667,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3158_4832735\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for(long long i=0;i<(long long)(n);i++)\\n#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)\\n#define all(a) a.begin(),a.end()\\n#define pb emplace_back\\n#define eb emplace_back\\n#define lb(v,k) (lower_bound(all(v),k)-v.begin())\\n#define ub(v,k) (upper_bound(all(v),k)-v.begin())\\n#define fi first\\n#define se second\\n#define pi M_PI\\n#define PQ(T) priority_queue<T>\\n#define SPQ(T) priority_queue<T,vector<T>,greater<T>>\\n#define dame(a) {out(a);return 0;}\\n#define decimal cout<<fixed<<setprecision(15);\\n#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}\\ntypedef long long ll;\\ntypedef pair<ll,ll> P;\\ntypedef tuple<ll,ll,ll> PP;\\ntypedef tuple<ll,ll,ll,ll> PPP;\\ntypedef multiset<ll> S;\\nusing vi=vector<ll>;\\nusing vvi=vector<vi>;\\nusing vvvi=vector<vvi>;\\nusing vvvvi=vector<vvvi>;\\nusing vp=vector<P>;\\nusing vvp=vector<vp>;\\nusing vb=vector<bool>;\\nusing vvb=vector<vb>;\\nconst ll inf=1001001001001001001;\\nconst ll INF=1001001001;\\nconst ll mod=1000000007;\\nconst double eps=1e-10;\\ntemplate<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}\\ntemplate<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}\\ntemplate<class T> void out(T a){cout<<a<<'\\\\n';}\\ntemplate<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\\\\n';}\\ntemplate<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\\\\n';}\\ntemplate<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}\\ntemplate<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\\\\n';}\\ntemplate<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}\\ntemplate<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}\\ntemplate<class T> void yesno(T b){if(b)out(\\\"yes\\\");else out(\\\"no\\\");}\\ntemplate<class T> void YesNo(T b){if(b)out(\\\"Yes\\\");else out(\\\"No\\\");}\\ntemplate<class T> void YESNO(T b){if(b)out(\\\"YES\\\");else out(\\\"NO\\\");}\\ntemplate<class T> void noyes(T b){if(b)out(\\\"no\\\");else out(\\\"yes\\\");}\\ntemplate<class T> void NoYes(T b){if(b)out(\\\"No\\\");else out(\\\"Yes\\\");}\\ntemplate<class T> void NOYES(T b){if(b)out(\\\"NO\\\");else out(\\\"YES\\\");}\\nvoid outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}\\nll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}\\nll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}\\nvvi g;\\nvi diameter(){\\n ll n=g.size(),ne;\\n vi par(n,-1);\\n P far(-1,0);\\n rep(tt,2){\\n vi dis(n,inf);\\n queue<ll> q;\\n ne=far.se;\\n q.emplace(ne);\\n dis[ne]=0;\\n while(!q.empty()){\\n auto t=q.front();q.pop();\\n for(ll x:g[t]){\\n if(chmin(dis[x],dis[t]+1)){\\n q.emplace(x);\\n par[x]=t;\\n }\\n }\\n }\\n far=P(-1,0);\\n rep(i,n)chmax(far,P(dis[i],i));\\n }\\n ll w=far.se;\\n vi res;\\n while(w!=ne){\\n res.pb(w);\\n w=par[w];\\n }\\n res.pb(ne);\\n return res;\\n}\\nvi ans;\\nvoid dfs0(int i,int p,int c){\\n for(ll x:g[i])if(x!=p){\\n ll nc=c-1;if(nc==-1)nc=2;\\n ans[x]=nc;\\n dfs0(x,i,nc);\\n }\\n}\\nvoid dfs1(int i,int p,int c){\\n for(ll x:g[i])if(x!=p){\\n ll nc=c+1;if(nc==3)nc=0;\\n ans[x]=nc;\\n dfs1(x,i,nc);\\n }\\n}\\nll res=0;\\nvi dfs(int i,int p){\\n vvi v(3);\\n for(ll x:g[i])if(x!=p){\\n auto t=dfs(x,i);\\n rep(cnt,3)v[cnt].pb(t[cnt]);\\n }\\n rep(cnt,3){\\n sort(all(v[cnt]));reverse(all(v[cnt]));\\n }\\n vi r(3),t(3);\\n if(v[0].size())rep(c,3)r[c]=v[c][0];\\n if(v[0].size()>1)rep(c,3)t[c]=v[c][0]+v[c][1];\\n r[ans[i]]++;t[ans[i]]++;\\n rep(c,3){chmax(res,r[c]);chmax(res,t[c]);}\\n return r;\\n}\\nint main(){\\n ll n;cin>>n;\\n g=vvi(n);\\n rep(i,n-1){\\n ll a,b;cin>>a>>b;a--;b--;\\n g[a].pb(b);g[b].pb(a);\\n }\\n vi d=diameter();\\n // outv(d);\\n ans=vi(n);\\n rep(i,d.size()/2){\\n ans[d[i]]=i%3;\\n for(ll x:g[d[i]]){\\n if((i!=d.size()-1&&x==d[i+1])||(i&&x==d[i-1]))continue;\\n ans[x]=ans[d[i]]-1;\\n if(ans[x]==-1)ans[x]=2;\\n dfs0(x,d[i],ans[x]);\\n }\\n }\\n REP(i,d.size()/2,d.size()){\\n ans[d[i]]=i%3;\\n for(ll x:g[d[i]]){\\n if((i!=d.size()-1&&x==d[i+1])||(i&&x==d[i-1]))continue;\\n ans[x]=ans[d[i]]+1;\\n if(ans[x]==3)ans[x]=0;\\n dfs1(x,d[i],ans[x]);\\n }\\n }\\n // outv(ans);\\n dfs(0,-1);\\n out(res);\\n for(ll x:ans){\\n if(x==0)cout<<'R';\\n if(x==1)cout<<'G';\\n if(x==2)cout<<'B';\\n }\\n cout<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 60588,\n \"score_of_the_acc\": -0.5686,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3158_4832645\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\n#define modulo N\\n#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)\\n#define Inf 1000000000000000000\\nint Ans;\\nstring S;\\nint N;\\nint D;\\nvector<vector<int>> E;\\nstruct tree_diameter{\\n\\tconst long long X = 1000000000000000000;\\n\\tpair<long long,vector<int>> get(vector<vector<pair<int,long long>>> &E){\\n\\t\\tvector<long long> dis = bfs(E,0);\\n\\t\\tlong long maxi = -1;\\n\\t\\tint ind = 0;\\n\\t\\tfor(int i=0;i<E.size();i++){\\n\\t\\t\\tif(dis[i]>maxi){\\n\\t\\t\\t\\tmaxi=dis[i];\\n\\t\\t\\t\\tind=i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tdis = bfs(E,ind);\\n\\t\\tmaxi = -1;\\n\\n\\t\\tfor(int i=0;i<E.size();i++){\\n\\t\\t\\tif(dis[i]>maxi){\\n\\t\\t\\t\\tmaxi=dis[i];\\n\\t\\t\\t\\tind=i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tvector<int> ret;\\n\\t\\tret.push_back(ind);\\n\\t\\twhile(dis[ind]!=0LL){\\n\\t\\t\\tfor(int i=0;i<E[ind].size();i++){\\n\\t\\t\\t\\tif(dis[ind] == dis[E[ind][i].first] + E[ind][i].second){\\n\\t\\t\\t\\t\\tind = E[ind][i].first;\\n\\t\\t\\t\\t\\tret.push_back(ind);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn make_pair(maxi,ret);\\n\\t\\t\\n\\t}\\n\\t\\n\\tpair<long long,vector<int>> get(vector<vector<int>> &E){\\n\\t\\tvector<vector<pair<int,long long>>> e(E.size(),vector<pair<int,long long>>());\\n\\t\\tfor(int i=0;i<E.size();i++){\\n\\t\\t\\tfor(int j=0;j<E[i].size();j++){\\n\\t\\t\\t\\te[i].emplace_back(E[i][j],1LL);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn get(e);\\n\\t}\\n\\t\\n\\tvector<long long> bfs(vector<vector<pair<int,long long>>> &E,int start){\\n\\t\\tvector<long long> dis(E.size(),X);\\n\\t\\tdis[start] = 0LL;\\n\\t\\tqueue<int> Q;\\n\\t\\tQ.push(start);\\n\\t\\t\\n\\t\\twhile(Q.size()!=0){\\n\\t\\t\\tint u = Q.front();\\n\\t\\t\\tQ.pop();\\n\\t\\t\\tfor(int i=0;i<E[u].size();i++){\\n\\t\\t\\t\\tint v = E[u][i].first;\\n\\t\\t\\t\\tif(dis[v]!=X)continue;\\n\\t\\t\\t\\tdis[v] = dis[u] + E[u][i].second;\\n\\t\\t\\t\\tQ.push(v);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn dis;\\n\\t}\\n\\t\\n};\\nvector<int> maxi;\\n\\nvoid dfs(int now,int p){\\n\\trep(i,E[now].size()){\\n\\t\\tint to = E[now][i];\\n\\t\\tif(to==p)continue;\\n\\t\\tdfs(to,now);\\n\\t\\tmaxi[now] = max(maxi[to] + 1,maxi[now]);\\n\\t}\\n}\\nstring s = \\\"RGB\\\";\\nvoid dfs2(int now,int p,int ind,int d){\\n\\tS[now] = s[ind];\\n\\tif(d==0){\\n\\t\\tvector<int> t;\\n\\t\\trep(i,E[now].size()){\\n\\t\\t\\tt.push_back(maxi[E[now][i]]);\\n\\t\\t}\\n\\t\\tsort(t.rbegin(),t.rend());\\n\\t\\tint x = 1;\\n\\t\\tint cnt = 0;\\n\\t\\trep(i,E[now].size()){\\n\\t\\t\\tint to = E[now][i];\\n\\t\\t\\tif(maxi[to]>=t[0]){\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\tx*=-1;\\n\\t\\t\\t}\\n\\t\\t\\tint iind = ind + 3 + x;\\n\\t\\t\\tiind %= 3;\\n\\t\\t\\tdfs2(to,now,iind,x);\\n\\t\\t}\\n\\t\\tAns = (D+2)/3;\\n\\t\\tif(cnt>=3){\\n\\t\\t\\tif(D%3==0)Ans++;\\n\\t\\t}\\n\\t\\t\\t\\n\\t}\\n\\telse{\\n\\t\\tind += d+3;\\n\\t\\tind %= 3;\\n\\t\\trep(i,E[now].size()){\\n\\t\\t\\tint to = E[now][i];\\n\\t\\t\\tif(to==p)continue;\\n\\t\\t\\tdfs2(to,now,ind,d);\\n\\t\\t}\\n\\t}\\n}\\nint main(){\\n\\t\\n\\tcin>>N;\\n\\tS.resize(N,'.');\\n\\tE.resize(N,vector<int>());\\n\\trep(i,N-1){\\n\\t\\tint a,b;\\n\\t\\tscanf(\\\"%d %d\\\",&a,&b);\\n\\t\\ta--;b--;\\n\\t\\tE[a].push_back(b);\\n\\t\\tE[b].push_back(a);\\n\\t\\t\\n\\t}\\n\\t\\n\\ttree_diameter T;\\n\\tvector<int> X = T.get(E).second;\\n\\tD = X.size();\\n\\tif(N==1){\\n\\t\\tS = \\\"R\\\";\\n\\t\\tAns = 1;\\n\\t}\\n\\telse if(N==2){\\n\\t\\tS = \\\"RG\\\";\\n\\t\\tAns = 1;\\n\\t}\\n\\telse{\\n\\t\\tint f = X[X.size()/2];\\n\\t\\tmaxi.resize(N,0);\\n\\t\\tdfs(f,-1);\\n\\t\\tdfs2(f,-1,0,0);\\n\\t}\\n\\t\\n\\tcout<<Ans<<endl;\\n\\tcout<<S<<endl;\\n\\t\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 37852,\n \"score_of_the_acc\": -0.2983,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3158_4832639\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\n//#include<atcoder/dsu>\\n//#include<atcoder/fenwicktree>\\n//#include<atcoder/math>\\n//#include<atcoder/maxflow>\\n\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 998244353;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m) {\\n\\tif (x >= m)x %= m;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nstring s = \\\"RGB\\\";\\nstring ans;\\nvector<int> G[1 << 18];\\nvoid dfs(int id, int fr, int col) {\\n\\tif (col == 3)col = 0;\\n\\tans[id] = s[col];\\n\\tfor (int to : G[id])if (to != fr) {\\n\\t\\tdfs(to, id, col + 1);\\n\\t}\\n}\\n\\nint calcans() {\\n\\tint ma = 0;\\n\\trep(i, 3) {\\n\\t\\tfunction<int(int, int)> calc = [&](int id, int fr)->int {\\n\\t\\t\\tvector<int> ts;\\n\\t\\t\\tfor (int to : G[id])if (to != fr) {\\n\\t\\t\\t\\tint nex = calc(to, id);\\n\\t\\t\\t\\tts.push_back(nex);\\n\\t\\t\\t}\\n\\t\\t\\tsort(all(ts), greater<int>());\\n\\t\\t\\tif (ts.size() >= 2) {\\n\\t\\t\\t\\tint sum = ts[0] + ts[1];\\n\\t\\t\\t\\tif (ans[id] == s[i])sum++;\\n\\t\\t\\t\\tma = max(ma, sum);\\n\\t\\t\\t}\\n\\t\\t\\tint res = 0;\\n\\t\\t\\tif (ts.size()) {\\n\\t\\t\\t\\tres = ts[0];\\n\\t\\t\\t}\\n\\t\\t\\tif (ans[id] == s[i])res++;\\n\\t\\t\\tma = max(ma, res);\\n\\t\\t\\treturn res;\\n\\t\\t}; calc(0, -1);\\n\\t}\\n\\treturn ma;\\n}\\n\\nvoid solve() {\\n\\tint n; cin >> n; ans.resize(n);\\n\\trep(i, n - 1) {\\n\\t\\tint a, b; cin >> a >> b; a--; b--;\\n\\t\\tG[a].push_back(b);\\n\\t\\tG[b].push_back(a);\\n\\t}\\n\\tint mi = mod;\\n\\tint chk = -1;\\n\\tmt19937 mt(time(0));\\n\\tuniform_int_distribution<> ud(0, n - 1);\\n\\trep(i, 100) {\\n\\t\\tint r = ud(mt);\\n\\t\\tdfs(r, -1, 0);\\n\\t\\tif (mi > calcans()) {\\n\\t\\t\\tmi = calcans();\\n\\t\\t\\tchk = r;\\n\\t\\t}\\n\\t}\\n\\tdfs(chk, -1, 0);\\n\\tcout << mi << \\\"\\\\n\\\";\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(15);\\n\\t//init_f();\\n\\t//init();\\n\\t//expr();\\n\\t//int t; cin >> t; rep(i, t)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4222222222222222,\n \"time_ms\": 1840,\n \"memory_kb\": 13004,\n \"score_of_the_acc\": -1,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3158_4832589\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\n#define modulo N\\n#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)\\n#define Inf 1000000000000000000\\nint Ans;\\nstring S;\\nint N;\\nint D;\\nvector<vector<int>> E;\\nstruct tree_diameter{\\n\\tconst long long X = 1000000000000000000;\\n\\tpair<long long,vector<int>> get(vector<vector<pair<int,long long>>> &E){\\n\\t\\tvector<long long> dis = bfs(E,0);\\n\\t\\tlong long maxi = -1;\\n\\t\\tint ind = 0;\\n\\t\\tfor(int i=0;i<E.size();i++){\\n\\t\\t\\tif(dis[i]>maxi){\\n\\t\\t\\t\\tmaxi=dis[i];\\n\\t\\t\\t\\tind=i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tdis = bfs(E,ind);\\n\\t\\tmaxi = -1;\\n\\n\\t\\tfor(int i=0;i<E.size();i++){\\n\\t\\t\\tif(dis[i]>maxi){\\n\\t\\t\\t\\tmaxi=dis[i];\\n\\t\\t\\t\\tind=i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tvector<int> ret;\\n\\t\\tret.push_back(ind);\\n\\t\\twhile(dis[ind]!=0LL){\\n\\t\\t\\tfor(int i=0;i<E[ind].size();i++){\\n\\t\\t\\t\\tif(dis[ind] == dis[E[ind][i].first] + E[ind][i].second){\\n\\t\\t\\t\\t\\tind = E[ind][i].first;\\n\\t\\t\\t\\t\\tret.push_back(ind);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn make_pair(maxi,ret);\\n\\t\\t\\n\\t}\\n\\t\\n\\tpair<long long,vector<int>> get(vector<vector<int>> &E){\\n\\t\\tvector<vector<pair<int,long long>>> e(E.size(),vector<pair<int,long long>>());\\n\\t\\tfor(int i=0;i<E.size();i++){\\n\\t\\t\\tfor(int j=0;j<E[i].size();j++){\\n\\t\\t\\t\\te[i].emplace_back(E[i][j],1LL);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn get(e);\\n\\t}\\n\\t\\n\\tvector<long long> bfs(vector<vector<pair<int,long long>>> &E,int start){\\n\\t\\tvector<long long> dis(E.size(),X);\\n\\t\\tdis[start] = 0LL;\\n\\t\\tqueue<int> Q;\\n\\t\\tQ.push(start);\\n\\t\\t\\n\\t\\twhile(Q.size()!=0){\\n\\t\\t\\tint u = Q.front();\\n\\t\\t\\tQ.pop();\\n\\t\\t\\tfor(int i=0;i<E[u].size();i++){\\n\\t\\t\\t\\tint v = E[u][i].first;\\n\\t\\t\\t\\tif(dis[v]!=X)continue;\\n\\t\\t\\t\\tdis[v] = dis[u] + E[u][i].second;\\n\\t\\t\\t\\tQ.push(v);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn dis;\\n\\t}\\n\\t\\n};\\nvector<int> maxi;\\n\\nvoid dfs(int now,int p){\\n\\trep(i,E[now].size()){\\n\\t\\tint to = E[now][i];\\n\\t\\tif(to==p)continue;\\n\\t\\tdfs(to,now);\\n\\t\\tmaxi[now] = max(maxi[to] + 1,maxi[now]);\\n\\t}\\n}\\nstring s = \\\"RGB\\\";\\nvoid dfs2(int now,int p,int ind,int d){\\n\\tS[now] = s[ind];\\n\\tif(d==0){\\n\\t\\tvector<int> t;\\n\\t\\trep(i,E[now].size()){\\n\\t\\t\\tt.push_back(maxi[E[now][i]]);\\n\\t\\t}\\n\\t\\tsort(t.rbegin(),t.rend());\\n\\t\\tint x = 1;\\n\\t\\tint cnt = 0;\\n\\t\\trep(i,E[now].size()){\\n\\t\\t\\tint to = E[now][i];\\n\\t\\t\\tif(maxi[to]>=t[1]){\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\tx*=-1;\\n\\t\\t\\t}\\n\\t\\t\\tint iind = ind + 3 + x;\\n\\t\\t\\tiind %= 3;\\n\\t\\t\\tdfs2(to,now,iind,x);\\n\\t\\t}\\n\\t\\tAns = (D+2)/3;\\n\\t\\tif(cnt>=3){\\n\\t\\t\\tif(D%3==0)Ans++;\\n\\t\\t}\\n\\t\\t\\t\\n\\t}\\n\\telse{\\n\\t\\tind += d+3;\\n\\t\\tind %= 3;\\n\\t\\trep(i,E[now].size()){\\n\\t\\t\\tint to = E[now][i];\\n\\t\\t\\tif(to==p)continue;\\n\\t\\t\\tdfs2(to,now,ind,d);\\n\\t\\t}\\n\\t}\\n}\\nint main(){\\n\\t\\n\\tcin>>N;\\n\\tS.resize(N,'.');\\n\\tE.resize(N,vector<int>());\\n\\trep(i,N-1){\\n\\t\\tint a,b;\\n\\t\\tscanf(\\\"%d %d\\\",&a,&b);\\n\\t\\ta--;b--;\\n\\t\\tE[a].push_back(b);\\n\\t\\tE[b].push_back(a);\\n\\t\\t\\n\\t}\\n\\t\\n\\ttree_diameter T;\\n\\tvector<int> X = T.get(E).second;\\n\\tD = X.size();\\n\\tif(N==1){\\n\\t\\tS = \\\"R\\\";\\n\\t\\tAns = 1;\\n\\t}\\n\\telse if(N==2){\\n\\t\\tS = \\\"RG\\\";\\n\\t\\tAns = 1;\\n\\t}\\n\\telse{\\n\\t\\tint f = X[X.size()/2];\\n\\t\\tmaxi.resize(N,0);\\n\\t\\tdfs(f,-1);\\n\\t\\tdfs2(f,-1,0,0);\\n\\t}\\n\\t\\n\\tcout<<Ans<<endl;\\n\\tcout<<S<<endl;\\n\\t\\n return 0;\\n}\",\n \"accuracy\": 0.4888888888888889,\n \"time_ms\": 40,\n \"memory_kb\": 29820,\n \"score_of_the_acc\": -0.1793,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3158_4832083\",\n \"code_snippet\": \"//#define NDEBUG\\n\\n#pragma region cp_template\\n\\n#include <algorithm>\\n#include <cstddef>\\n#include <cstdint>\\n#include <iostream>\\n#include <utility>\\n#include <vector>\\n\\nnamespace n91 {\\n\\n using i32 = std::int32_t;\\n using i64 = std::int64_t;\\n using u32 = std::uint32_t;\\n using u64 = std::uint64_t;\\n using isize = std::ptrdiff_t;\\n using usize = std::size_t;\\n\\n struct rep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept : i(i) {}\\n void operator++() noexcept { ++i; }\\n constexpr usize operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\\n };\\n const itr f, l;\\n constexpr rep(const usize f, const usize l) noexcept\\n : f(std::min(f, l)), l(l) {}\\n constexpr auto begin() const noexcept { return f; }\\n constexpr auto end() const noexcept { return l; }\\n };\\n struct revrep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept : i(i) {}\\n void operator++() noexcept { --i; }\\n constexpr usize operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\\n };\\n const itr f, l;\\n constexpr revrep(const usize f, const usize l) noexcept\\n : f(l - 1), l(std::min(f, l) - 1) {}\\n constexpr auto begin() const noexcept { return f; }\\n constexpr auto end() const noexcept { return l; }\\n };\\n template <class T> auto md_vec(const usize n, const T& value) {\\n return std::vector<T>(n, value);\\n }\\n template <class... Args> auto md_vec(const usize n, Args... args) {\\n return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));\\n }\\n template <class T> constexpr T difference(const T& a, const T& b) noexcept {\\n return a < b ? b - a : a - b;\\n }\\n template <class T> void chmin(T& a, const T& b) noexcept {\\n if (b < a)\\n a = b;\\n }\\n template <class T> void chmax(T& a, const T& b) noexcept {\\n if (a < b)\\n a = b;\\n }\\n template <class F> class rec_lambda {\\n F f;\\n\\n public:\\n rec_lambda(F&& f) : f(std::move(f)) {}\\n template <class... Args> auto operator()(Args&&... args) const {\\n return f(*this, std::forward<Args>(args)...);\\n }\\n };\\n template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }\\n template <class T> T scan() {\\n T ret;\\n std::cin >> ret;\\n return ret;\\n }\\n constexpr char eoln = '\\\\n';\\n template <class T> T ceildiv(const T& l, const T& r) {\\n return l / r + (l % r != 0 ? 1 : 0);\\n }\\n\\n} // namespace n91\\n\\n#pragma endregion cp_template\\n\\n#include <cstdint>\\n\\ntemplate <std::uint_fast64_t mod> class modint {\\n using u64 = std::uint_fast64_t;\\n\\npublic:\\n u64 v;\\n\\n constexpr modint(const u64 x = 0) noexcept : v(x% mod) {}\\n constexpr modint operator+(const modint rhs) const noexcept {\\n return modint(*this) += rhs;\\n }\\n constexpr modint operator-(const modint rhs) const noexcept {\\n return modint(*this) -= rhs;\\n }\\n constexpr modint operator*(const modint rhs) const noexcept {\\n return modint(*this) *= rhs;\\n }\\n constexpr modint operator/(const modint rhs) const noexcept {\\n return modint(*this) /= rhs;\\n }\\n constexpr modint& operator+=(const modint rhs) noexcept {\\n v += rhs.v;\\n if (v >= mod)\\n v -= mod;\\n return *this;\\n }\\n constexpr modint& operator-=(const modint rhs) noexcept {\\n if (v < rhs.v)\\n v += mod;\\n v -= rhs.v;\\n return *this;\\n }\\n constexpr modint& operator*=(const modint rhs) noexcept {\\n v = v * rhs.v % mod;\\n return *this;\\n }\\n constexpr modint& operator/=(modint rhs) noexcept {\\n u64 exp = mod - 2;\\n while (exp != 0) {\\n if (exp % 2 != 0)\\n *this *= rhs;\\n rhs *= rhs;\\n exp /= 2;\\n }\\n return *this;\\n }\\n};\\n\\n#include <functional>\\n#include <utility>\\n\\nnamespace n91 {\\n\\n template <class T, class U, class Operate = std::multiplies<T>>\\n constexpr T power(T base, U exp, const Operate& oper = Operate(), T iden = 1) {\\n while (exp != 0) {\\n if (exp % 2 != 0) {\\n iden = oper(iden, base);\\n }\\n exp /= 2;\\n base = oper(base, base);\\n }\\n return iden;\\n }\\n\\n} // namespace n91\\n\\nnamespace n91 {\\n\\n void main_() {\\n using mint = modint<998244353>;\\n /*\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n //*/\\n const usize n = scan<usize>();\\n auto g = md_vec(n, 0, usize());\\n for (const usize i : rep(0, n - 1)) {\\n const usize a = scan<usize>() - 1;\\n const usize b = scan<usize>() - 1;\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n std::vector<usize> dist(n, 0), par(n);\\n const auto dfs = [&](const auto& dfs, const usize v, const usize p) -> void {\\n par[v] = p;\\n for (const auto e : g[v]) {\\n if (e != p) {\\n dist[e] = dist[v] + 1;\\n dfs(dfs, e, v);\\n }\\n }\\n };\\n dfs(dfs, 0, n);\\n const usize d0 = std::max_element(dist.begin(), dist.end()) - dist.begin();\\n dist[d0] = 0;\\n dfs(dfs, d0, n);\\n const usize d1 = std::max_element(dist.cbegin(), dist.cend()) - dist.begin();\\n const usize diam = dist[d1];\\n usize ans_x;\\n std::vector<u32> ans(n);\\n if (diam % 2 == 1) {\\n usize c1 = d1;\\n for (const usize i : rep(0, diam / 2)) {\\n c1 = par[c1];\\n }\\n usize c0 = par[c1];\\n ans_x = diam / 3 + 1;\\n dist[c0] = 0;\\n dist[c1] = n;\\n dfs(dfs, c0, c1);\\n dfs(dfs, c1, c0);\\n for (const usize i : rep(0, n)) {\\n if (dist[i] >= n) {\\n ans[i] = 2 - (dist[i] - n) % 3;\\n }\\n else {\\n ans[i] = dist[i] % 3;\\n }\\n }\\n }\\n else {\\n usize c = d1;\\n for (const usize i : rep(0, diam / 2)) {\\n c = par[c];\\n }\\n dfs(dfs, c, n);\\n dist[c] = 0;\\n bool fl = false;\\n for (const usize v : g[c]) {\\n if (fl) {\\n dist[v] = n;\\n }\\n else {\\n dist[v] = 1;\\n }\\n dfs(dfs, v, c);\\n fl = !fl;\\n }\\n for (const usize i : rep(0, n)) {\\n if (dist[i] >= n) {\\n ans[i] = 2 - (dist[i] - n) % 3;\\n }\\n else {\\n ans[i] = dist[i] % 3;\\n }\\n }\\n }\\n std::vector<usize> c_dist(n, 0);\\n const auto c_dfs = [&](const auto& c_dfs, const usize v, const usize p,\\n const usize col) -> void {\\n if (ans[v] == col) {\\n ++c_dist[v];\\n }\\n for (const auto e : g[v]) {\\n if (e != p) {\\n c_dist[e] = c_dist[v];\\n c_dfs(c_dfs, e, v, col);\\n }\\n }\\n };\\n ans_x = 0;\\n for (const usize i : rep(0, 3)) {\\n c_dist[0] = 0;\\n c_dfs(c_dfs, 0, n, i);\\n const usize c_d0 =\\n std::max_element(c_dist.begin(), c_dist.end()) - c_dist.begin();\\n c_dist[c_d0] = 0;\\n c_dfs(c_dfs, c_d0, n, i);\\n chmax(ans_x, *std::max_element(c_dist.cbegin(), c_dist.cend()));\\n }\\n\\n std::cout << ans_x << eoln;\\n for (const auto e : ans) {\\n if (e % 3 == 0) {\\n std::cout << \\\"R\\\";\\n }\\n else if (e % 3 == 1) {\\n std::cout << \\\"G\\\";\\n }\\n else {\\n std::cout << \\\"B\\\";\\n }\\n }\\n std::cout << eoln;\\n }\\n\\n} // namespace n91\\n\\nint main() {\\n n91::main_();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 35072,\n \"score_of_the_acc\": -0.3131,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3158_4832039\",\n \"code_snippet\": \"#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing uint = unsigned;\\nusing pcc = pair<char, char>;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pdd = pair<ld, ld>;\\nusing tuplis = array<ll, 3>;\\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\\nconst ll LINF=0x1fffffffffffffff;\\nconst ll MINF=0x7fffffffffff;\\nconst int INF=0x3fffffff;\\nconst int MOD=1000000007;\\nconst int MODD=998244353;\\nconst ld DINF=numeric_limits<ld>::infinity();\\nconst ld EPS=1e-9;\\nconst ld PI=3.1415926535897932;\\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\\n#define overload4(_1,_2,_3,_4,name,...) name\\n#define overload3(_1,_2,_3,name,...) name\\n#define rep1(n) for(ll i=0;i<n;++i)\\n#define rep2(i,n) for(ll i=0;i<n;++i)\\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\\n#define rrep1(n) for(ll i=n;i--;)\\n#define rrep2(i,n) for(ll i=n;i--;)\\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\\n#define each1(i,a) for(auto&&i:a)\\n#define each2(x,y,a) for(auto&&[x,y]:a)\\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\\n#define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__)\\n#define all1(i) begin(i),end(i)\\n#define all2(i,a) begin(i),begin(i)+a\\n#define all3(i,a,b) begin(i)+a,begin(i)+b\\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\\n#define rall1(i) (i).rbegin(),(i).rend()\\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\\n#define Msum(...) accumulate(all(__VA_ARGS__),0_M)\\n#define elif else if\\n#define unless(a) if(!(a))\\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\\n#define Sort(a) sort(all(a))\\n#define Rev(a) reverse(all(a))\\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type>name(size);in(name)\\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\\nll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }\\nll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\\nvector<ll> iota(ll n){ vector<ll> a(n); iota(a.begin(), a.end(), 0); return a; }\\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\\nmap<ll,ll> factor_map(ull x){ map<ll,ll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans[i] = 1; while((x /= i) % i == 0) ans[i]++; } if(x != 1) ans[x] = 1; return ans; }\\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\\ntemplate<class T> unordered_map<T, ll> press(vector<T> a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\\ntemplate<class T> map<T, ll> press_map(vector<T> a){ Uniq(a); map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\\nint scan(){ return getchar(); }\\nvoid scan(int& a){ scanf(\\\"%d\\\", &a); }\\nvoid scan(unsigned& a){ scanf(\\\"%u\\\", &a); }\\nvoid scan(long& a){ scanf(\\\"%ld\\\", &a); }\\nvoid scan(long long& a){ scanf(\\\"%lld\\\", &a); }\\nvoid scan(unsigned long long& a){ scanf(\\\"%llu\\\", &a); }\\nvoid scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\\\\n'); }\\nvoid scan(float& a){ scanf(\\\"%f\\\", &a); }\\nvoid scan(double& a){ scanf(\\\"%lf\\\", &a); }\\nvoid scan(long double& a){ scanf(\\\"%Lf\\\", &a); }\\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\\nvoid scan(char a[]){ scanf(\\\"%s\\\", a); }\\nvoid scan(string& a){ cin >> a; }\\ntemplate<class T> void scan(vector<T>&);\\ntemplate<class T, size_t size> void scan(array<T, size>&);\\ntemplate<class T, class L> void scan(pair<T, L>&);\\ntemplate<class T, size_t size> void scan(T(&)[size]);\\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\\ntemplate<class T> void scan(T& a){ cin >> a; }\\nvoid in(){}\\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\\nvoid print(){ putchar(' '); }\\nvoid print(bool a){ printf(\\\"%d\\\", a); }\\nvoid print(int a){ printf(\\\"%d\\\", a); }\\nvoid print(unsigned a){ printf(\\\"%u\\\", a); }\\nvoid print(long a){ printf(\\\"%ld\\\", a); }\\nvoid print(long long a){ printf(\\\"%lld\\\", a); }\\nvoid print(unsigned long long a){ printf(\\\"%llu\\\", a); }\\nvoid print(char a){ printf(\\\"%c\\\", a); }\\nvoid print(char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(const char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(float a){ printf(\\\"%.15f\\\", a); }\\nvoid print(double a){ printf(\\\"%.15f\\\", a); }\\nvoid print(long double a){ printf(\\\"%.15Lf\\\", a); }\\nvoid print(const string& a){ for(auto&& i : a) print(i); }\\ntemplate<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }\\ntemplate<class T> void print(const vector<T>&);\\ntemplate<class T, size_t size> void print(const array<T, size>&);\\ntemplate<class T, class L> void print(const pair<T, L>& p);\\ntemplate<class T, size_t size> void print(const T (&)[size]);\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\\ntemplate<class T> void print(const T& a){ cout << a; }\\nint out(){ putchar('\\\\n'); return 0; }\\ntemplate<class T> int out(const T& t){ print(t); putchar('\\\\n'); return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\\n#ifdef DEBUG\\ninline ll __lg(ull __n){ return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); }\\n#define debug(...) { print(#__VA_ARGS__); print(\\\":\\\"); out(__VA_ARGS__); }\\n#else\\n#define debug(...) void(0)\\n#endif\\nint first(bool i = true){ return out(i?\\\"first\\\":\\\"second\\\"); }\\nint yes(bool i = true){ return out(i?\\\"yes\\\":\\\"no\\\"); }\\nint Yes(bool i = true){ return out(i?\\\"Yes\\\":\\\"No\\\"); }\\nint No(){ return out(\\\"No\\\"); }\\nint YES(bool i = true){ return out(i?\\\"YES\\\":\\\"NO\\\"); }\\nint NO(){ return out(\\\"NO\\\"); }\\nint Yay(bool i = true){ return out(i?\\\"Yay!\\\":\\\":(\\\"); }\\nint possible(bool i = true){ return out(i?\\\"possible\\\":\\\"impossible\\\"); }\\nint Possible(bool i = true){ return out(i?\\\"Possible\\\":\\\"Impossible\\\"); }\\nint POSSIBLE(bool i = true){ return out(i?\\\"POSSIBLE\\\":\\\"IMPOSSIBLE\\\"); }\\nvoid Case(ll i){ printf(\\\"Case #%lld: \\\", i); }\\n\\n\\n\\nstruct UnWeightedEdge{\\n ll to;\\n static constexpr ll cost = 1;\\n UnWeightedEdge(){}\\n UnWeightedEdge(ll to): to(to){}\\n operator ll() const { return to; }\\n};\\nstruct UnWeightedGraph{\\n using E = UnWeightedEdge;\\n vector<vector<E>> g;\\n UnWeightedGraph(){}\\n UnWeightedGraph(ll n): g(n){}\\n vector<E>& operator[](ll at){ return g[at]; }\\n operator vector<vector<E>>&(){ return g; }\\n auto begin(){ return g.begin(); }\\n auto end(){ return g.end(); }\\n auto begin() const { return g.cbegin(); }\\n auto end() const { return g.cend(); }\\n ll size() const { return g.size(); }\\n void resize(ll n){ g.resize(n); }\\n const vector<E>& operator[](ll at) const { return g[at]; }\\n operator const vector<vector<E>>&() const { return g; }\\n void add_edge(ll a, ll b){\\n g[a].emplace_back(b);\\n g[b].emplace_back(a);\\n }\\n void add_directed_edge(ll from, ll to){\\n g[from].emplace_back(to);\\n }\\n template<ll start_index = 1, bool directed = false> void input_graph(ll m){\\n while(m--){\\n ll a, b;\\n scanf(\\\"%lld%lld\\\", &a, &b);\\n a -= start_index;\\n b -= start_index;\\n g[a].emplace_back(b);\\n if(!directed) g[b].emplace_back(a);\\n }\\n }\\n template<ll start_index = 1> void input_tree(ll n = -1){ if(n == -1) n = g.size(); input_graph<start_index>(n - 1); }\\n};\\nvector<ll> Diameter(const UnWeightedGraph& g){\\n ll n = g.size();\\n vector<ll> cost(n, LINF);\\n queue<ll> q;\\n cost[0] = 0;\\n q.push(0);\\n ll d1 = 0;\\n while(q.size()){\\n d1 = q.front();\\n q.pop();\\n each(i, g[d1]) if(chmin(cost[i], cost[d1] + 1)) q.push(i);\\n }\\n cost.assign(n, LINF);\\n vector<ll> back(n, -1);\\n cost[d1] = 0;\\n q.push(d1);\\n ll d2 = 0;\\n while(q.size()){\\n d2 = q.front();\\n q.pop();\\n each(i, g[d2]) if(chmin(cost[i], cost[d2] + 1)){\\n back[i] = d2;\\n q.push(i);\\n }\\n }\\n vector<ll> ans = {d2};\\n while(ans.back() != d1) ans.push_back(back[ans.back()]);\\n return ans;\\n}\\nvector<ll> BFS(const UnWeightedGraph& g, ll start){\\n vector<ll> cost(g.size(), LINF);\\n queue<ll> q;\\n cost[start] = 0;\\n q.push(start);\\n while(q.size()){\\n ll at = q.front();\\n q.pop();\\n each(i, g[at]) if(chmin(cost[i], cost[at] + i.cost)) q.push(i);\\n }\\n return cost;\\n}\\nsigned main(){\\n LL(n);\\n if(n==1){\\n out(1);\\n return out('R');\\n }\\n UnWeightedGraph g(n);\\n g.input_tree();\\n auto d=Diameter(g);\\n string color(n,'-');\\n auto cost1=BFS(g,d[(d.size()-1)/2]),cost2=BFS(g,d[(d.size()+1)/2]);\\n rep(n)color[i]=cost1[i]<cost2[i]?\\\"BGR\\\"[cost1[i]%3]:\\\"RGB\\\"[cost2[i]%3];\\n ll ans=0;\\n for(char c:\\\"RGB\\\"s){\\n vec(pll,dp,n);\\n auto dfs = [&](ll from, ll at, auto dfs) -> void {\\n each(i, g[at]) if(i != from){\\n dfs(at, i, dfs);\\n if(chmax(dp[at].second,dp[i].first+(color[i]==c))&&dp[at].first<dp[at].second)swap(dp[at].first,dp[at].second);\\n }\\n };\\n dfs(-1, 0, dfs);\\n auto dfs2 = [&](ll from, ll at, auto dfs) -> void {\\n each(i, g[at]) if(i != from){\\n const ll a=dp[at].first==dp[i].first+(color[i]==c)?dp[at].second:dp[at].first;\\n if(chmax(dp[i].second,a+(color[at]==c))&&dp[i].first<dp[i].second)swap(dp[i].first,dp[i].second);\\n dfs(at, i, dfs);\\n }\\n };\\n dfs2(-1, 0, dfs2);\\n rep(n)chmax(ans,dp[i].first+dp[i].second+(color[i]==c));\\n }\\n out(ans);\\n out(color);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 53488,\n \"score_of_the_acc\": -0.504,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1977,"cells":{"group_id":{"kind":"string","value":"aoj_3163_cpp"},"problem_description":{"kind":"string","value":"Problem M: Star Gazer\nProblem\nsuta君は夜空を見ていた際に、オリジナルの新しい星座を思いつきました。\n思いついた星座は $N$ 個の星からなり、 $N-1$ 本の線で結ばれています。\n具体的には、 $i(1 \\leq i \\leq N-1)$ 本目の線が、 $a_i$ 番目の星と $b_i$ 番目の星を結びます。どの星も、少なくとも1つの別の星と結ばれます。\nsuta君は、この星座における、 $p(1 \\leq p \\leq N)$ 番目の星の美しさを次のように定義しました。\n$q(1 \\leq q \\leq N)$ 番目の星の明るさを $l_q$ 、 $p$ 番目の星と $q$ 番目の星の距離を $d_{p,q}$ とし、\n\t\t$\\displaystyle \\sum_{q = 1}^{N} l_q \\times d_{p,q}$\nここで $p$ 番目の星と $q$ 番目の星の距離とは、「 $p$ 番目の星から $q$ 番目の星に線を辿っていく時、辿る必要のある線の本数」\n\tです。\nまた、 $d_{p,p} = 0$ です。\nsuta君は星座の完成度を確認するために、それぞれの星の美しさが知りたくなりました。\n計算が苦手なsuta君に代わって、星の美しさを計算するプログラムを組んでください！\nConstraints\n入力は以下の条件を満たす。\n$2 \\leq N \\leq 10^5$\n$1 \\leq l_i \\leq 10^8$\n$1 \\leq a_i, b_i \\leq N$\n$a_i \\neq b_i$\n$(a_i, b_i) = (b_j, a_j)$ もしくは $(a_i, b_i) = (a_j, b_j)$ となるような $i,j(1 \\leq i,j \\leq N, i \\neq j)$ の組み合わせは存在しない。\n任意の星からいくつかの線を辿って別の星にたどり着くことができる。\n入力は全て整数で与えられる。\nInput\n入力は以下の形式で与えられる。\n$N$\n$l_1$ $l_2$ $\\ldots$ $l_N$\n$a_1$ $b_1$\n$a_2$ $b_2$\n$\\vdots$\n$a_{N-1}$ $b_{N-1}$\nOutput\n$N$ 行出力せよ。 $i$ 行目には、 $i$ 番目の星の美しさを出力せよ。\n末尾の改行を忘れないこと。\nSample Input 1\n4\n1 2 3 4\n1 2\n1 3\n3 4\nSample Output 1\n13\n19\n9\n11\n与えられる星座は図のようになります。\n1番目の星の美しさは、\n\t$1 × 0 + 2 × 1 + 3 × 1 + 4 × 2 = 13$\n\tとなります。\n同様に、2番目の星の美しさは、\n\t$1 × 1 + 2 × 0 + 3 × 2 + 4 × 3 = 19$\n\tとなります。\n3番目の星の美しさは、\n\t$1 × 1 + 2 × 2 + 3 × 0 + 4 × 1 = 9$\n\tとなります。\n4番目の星の美しさは、\n\t$1 × 2 + 2 × 3 + 3 × 1 + 4 × 0 = 11$\n\tとなります。\nSample Input 2\n5\n123 456 789 119 1\n5 2\n3 1\n1 2\n1 4\nSample Output 2\n1366\n1940\n1276\n2616\n3426"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3163_10092502","code_snippet":"// AOJ #3163\n// Star Gazer 2025.1.11\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 最大 10^5 頂点想定 (問題制約)\nstatic const int MAXN = 100005;\n\n// 各頂点の明るさ、部分木の明るさ合計、beauty(distSum) を格納\nlong long L[MAXN+1]; // brightness\nlong long subB[MAXN+1]; // uの部分木に含まれるすべての頂点の明るさ合計\nlong long distSum[MAXN+1]; // beauty(u)\n\n// 全頂点の明るさ合計\nlong long sumAll = 0;\n\n// 木の隣接リスト\nvector<int> g[MAXN+1];\n\nint N;\n\n// dfs1: 根を 1 として、distSum[1] と subB[u] をまとめて計算\n// d は「(仮の)根1 からの深さ」 = 距離\nvoid dfs1(int u, int parent, int depth) {\n // beauty(1) に l[u] * depth を足す\n distSum[1] += L[u] * depth;\n\n // 部分木の明るさを初期化\n subB[u] = L[u];\n\n // 子頂点へ\n for (auto &w : g[u]) {\n if (w == parent) continue;\n\n dfs1(w, u, depth + 1);\n subB[u] += subB[w]; // 子の部分木を親に加算\n }\n}\n\n// dfs2: 親 -> 子 で「再根付き」\n// parent = -1 はダミー (根)\nvoid dfs2(int u, int parent) {\n // 子頂点 w について「根を u から w へ移す(再根付き)」ときの beauty(w) を計算\n for (auto &w : g[u]) {\n if (w == parent) continue;\n\n // 親u の beauty(u) をもとに、再根付きで beauty(w) を更新\n distSum[w] = distSum[u] + (sumAll - 2 * subB[w]);\n\n // 再帰的に処理\n dfs2(w, u);\n }\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n cin >> N;\n for(int i = 1; i <= N; i++){\n cin >> L[i];\n sumAll += L[i];\n }\n\n // 辺の入力\n for(int i = 0; i < N - 1; i++){\n int a, b;\n cin >> a >> b;\n // 無向グラフ(=木)\n g[a].push_back(b);\n g[b].push_back(a);\n }\n\n // 1. dfs1 で beauty(1) と subB を計算\n dfs1(1, -1, 0);\n\n // 2. dfs2 で「再根付き」により distSum(beauty) を求める\n dfs2(1, -1);\n\n // 出力\n for(int i = 1; i <= N; i++){\n cout << distSum[i] << \"\\n\";\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":16456,"score_of_the_acc":-0.1123,"final_rank":2},{"submission_id":"aoj_3163_10086570","code_snippet":"// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/3163\n#include <cstdint>\n#include <iostream>\n#include <utility>\n#include <vector>\n/**\n * @brief 重み付きグラフ\n *\n * @tparam T 辺の重みの型\n */\ntemplate <class T>\nstruct Graph {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to(), _weight() {}\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr T weight() const { return _weight; }\n private:\n int _from, _to;\n T _weight;\n };\n public:\n using edge_type = typename Graph<T>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\n void add_edges(int from, int to, T weight = T(1)) {\n edges[from].emplace_back(from, to, weight);\n edges[to].emplace_back(to, from, weight);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edge(from - base, to - base, weight);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edges(from - base, to - base, weight);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\ntemplate <>\nstruct Graph<void> {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to() {}\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr int weight() const { return 1; }\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n private:\n int _from, _to;\n };\n public:\n using edge_type = typename Graph<void>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\n void add_edges(int from, int to) {\n edges[from].emplace_back(from, to);\n edges[to].emplace_back(to, from);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edge(from - base, to - base);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edges(from - base, to - base);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\n/// @brief 全方位木dp\n/// @see https://algo-logic.info/tree-dp/\ntemplate <class M, class T, class U>\nstruct ReRooting {\n private:\n using Value = typename M::value_type;\n public:\n ReRooting(const Graph<T> &g, const std::vector<U> &v)\n : graph(g), data(v), dp(g.size()), values(g.size()) {\n build();\n }\n const auto &operator[](int i) const { return values[i]; }\n auto &operator[](int i) { return values[i]; }\n const auto begin() const { return values.begin(); }\n auto begin() { return values.begin(); }\n const auto end() const { return values.end(); }\n auto end() { return values.end(); }\n private:\n Graph<T> graph;\n const std::vector<U> &data;\n std::vector<std::vector<Value>> dp;\n std::vector<Value> values;\n void build() {\n dfs(0);\n bfs(0);\n }\n Value dfs(int v, int p = -1) {\n Value res = M::id();\n int deg = graph[v].size();\n dp[v] = std::vector<Value>(deg, M::id());\n for (int i = 0; i < deg; ++i) {\n auto e = graph[v][i];\n if (e.to() == p) continue;\n dp[v][i] = M::f(dfs(e.to(), v), e.weight());\n res = M::op(res, dp[v][i]);\n }\n return M::g(res, data[v]);\n }\n void bfs(int v, int p = -1, Value dp_p = M::id()) {\n int deg = graph[v].size();\n std::vector<Value> dp_r(deg + 1, M::id());\n for (int i = deg - 1; i >= 0; --i) {\n auto e = graph[v][i];\n if (e.to() == p) dp[v][i] = M::f(dp_p, e.weight());\n dp_r[i] = M::op(dp[v][i], dp_r[i + 1]);\n }\n Value dp_l = M::id();\n for (int i = 0; i < deg; ++i) {\n int u = graph[v][i].to();\n if (u != p) bfs(u, v, M::g(M::op(dp_l, dp_r[i + 1]), data[v]));\n dp_l = M::op(dp_l, dp[v][i]);\n }\n values[v] = M::g(dp_l, v);\n }\n};\nstruct Monoid {\n using T = std::pair<std::int64_t, std::int64_t>;\n using value_type = T;\n static constexpr T id() {\n return {0, 0};\n };\n static constexpr T op(const T &lhs, const T &rhs) {\n return {lhs.first + rhs.first, lhs.second + rhs.second};\n }\n template <class U>\n static constexpr T f(const T &v, U u) {\n return {v.first + v.second, v.second};\n }\n template <class U>\n static constexpr T g(const T &v, U u) {\n return {v.first, v.second + u};\n }\n};\nint main(void) {\n int n;\n std::cin >> n;\n std::vector<std::int64_t> a(n);\n for (auto &e : a) std::cin >> e;\n Graph<void> g(n);\n g.input_edges(n - 1);\n ReRooting<Monoid, void, std::int64_t> rr(g, a);\n for (int i = 0; i < n; ++i) std::cout << rr[i].first << '\\n';\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":37640,"score_of_the_acc":-1.0498,"final_rank":16},{"submission_id":"aoj_3163_10086558","code_snippet":"// competitive-verifier: PROBLEM\n#include <iostream>\n#include <vector>\n/**\n * @brief 重み付きグラフ\n *\n * @tparam T 辺の重みの型\n */\ntemplate <class T>\nstruct Graph {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to(), _weight() {}\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr T weight() const { return _weight; }\n private:\n int _from, _to;\n T _weight;\n };\n public:\n using edge_type = typename Graph<T>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\n void add_edges(int from, int to, T weight = T(1)) {\n edges[from].emplace_back(from, to, weight);\n edges[to].emplace_back(to, from, weight);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edge(from - base, to - base, weight);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edges(from - base, to - base, weight);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\ntemplate <>\nstruct Graph<void> {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to() {}\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr int weight() const { return 1; }\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n private:\n int _from, _to;\n };\n public:\n using edge_type = typename Graph<void>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\n void add_edges(int from, int to) {\n edges[from].emplace_back(from, to);\n edges[to].emplace_back(to, from);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edge(from - base, to - base);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edges(from - base, to - base);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\n/// @brief 全方位木dp\n/// @see https://algo-logic.info/tree-dp/\ntemplate <class M, class T, class U>\nstruct ReRooting {\n private:\n using Value = typename M::value_type;\n public:\n ReRooting(const Graph<T> &g, const std::vector<U> &v)\n : graph(g), data(v), dp(g.size()), values(g.size()) {\n build();\n }\n const auto &operator[](int i) const { return values[i]; }\n auto &operator[](int i) { return values[i]; }\n const auto begin() const { return values.begin(); }\n auto begin() { return values.begin(); }\n const auto end() const { return values.end(); }\n auto end() { return values.end(); }\n private:\n Graph<T> graph;\n const std::vector<U> &data;\n std::vector<std::vector<Value>> dp;\n std::vector<Value> values;\n void build() {\n dfs(0);\n bfs(0);\n }\n Value dfs(int v, int p = -1) {\n Value res = M::id();\n int deg = graph[v].size();\n dp[v] = std::vector<Value>(deg, M::id());\n for (int i = 0; i < deg; ++i) {\n auto e = graph[v][i];\n if (e.to() == p) continue;\n dp[v][i] = M::f(dfs(e.to(), v), e.weight());\n res = M::op(res, dp[v][i]);\n }\n return M::g(res, data[v]);\n }\n void bfs(int v, int p = -1, Value dp_p = M::id()) {\n int deg = graph[v].size();\n std::vector<Value> dp_r(deg + 1, M::id());\n for (int i = deg - 1; i >= 0; --i) {\n auto e = graph[v][i];\n if (e.to() == p) dp[v][i] = M::f(dp_p, e.weight());\n dp_r[i] = M::op(dp[v][i], dp_r[i + 1]);\n }\n Value dp_l = M::id();\n for (int i = 0; i < deg; ++i) {\n int u = graph[v][i].to();\n if (u != p) bfs(u, v, M::g(M::op(dp_l, dp_r[i + 1]), data[v]));\n dp_l = M::op(dp_l, dp[v][i]);\n }\n values[v] = M::g(dp_l, v);\n }\n};\nstruct Monoid {\n using T = pair<ll, ll>;\n using value_type = T;\n static constexpr T id() {\n return {0, 0};\n };\n static constexpr T op(const T &lhs, const T &rhs) {\n return {lhs.first + rhs.first, lhs.second + rhs.second};\n }\n template <class U>\n static constexpr T f(const T &v, U u) {\n return {v.first + v.second, v.second};\n }\n template <class U>\n static constexpr T g(const T &v, U u) {\n return {v.first, v.second + u};\n }\n};\nint main(void) {\n int n;\n cin >> n;\n vector<ll> a(n);\n cin >> a;\n Graph<void> g(n);\n g.input_edges(n - 1);\n ReRooting<Monoid, void, ll> rr(g, a);\n rep (i, n) co(rr[i].first);\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":37752,"score_of_the_acc":-0.8527,"final_rank":12},{"submission_id":"aoj_3163_10086546","code_snippet":"// competitive-verifier: PROBLEM\n#include <iostream>\n#include <vector>\n/**\n * @brief 重み付きグラフ\n *\n * @tparam T 辺の重みの型\n */\ntemplate <class T>\nstruct Graph {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to(), _weight() {}\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr T weight() const { return _weight; }\n private:\n int _from, _to;\n T _weight;\n };\n public:\n using edge_type = typename Graph<T>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\n void add_edges(int from, int to, T weight = T(1)) {\n edges[from].emplace_back(from, to, weight);\n edges[to].emplace_back(to, from, weight);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edge(from - base, to - base, weight);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edges(from - base, to - base, weight);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\ntemplate <>\nstruct Graph<void> {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to() {}\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr int weight() const { return 1; }\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n private:\n int _from, _to;\n };\n public:\n using edge_type = typename Graph<void>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\n void add_edges(int from, int to) {\n edges[from].emplace_back(from, to);\n edges[to].emplace_back(to, from);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edge(from - base, to - base);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edges(from - base, to - base);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\n/**\n * @brief 全方位木dp\n * @see https://algo-logic.info/tree-dp/\n *\n * @tparam M モノイド\n * @tparam T 辺の重みの型\n */\ntemplate <class M, class U, class T>\nstruct ReRooting {\n private:\n using Value = typename M::value_type;\n public:\n ReRooting(const Graph<T> &g, const std::vector<U> &v)\n : graph(g), data(v), dp(g.size()), values(g.size()) {\n build();\n }\n const auto &operator[](int i) const { return values[i]; }\n auto &operator[](int i) { return values[i]; }\n const auto begin() const { return values.begin(); }\n auto begin() { return values.begin(); }\n const auto end() const { return values.end(); }\n auto end() { return values.end(); }\n private:\n Graph<T> graph;\n const std::vector<U> &data;\n std::vector<std::vector<Value>> dp;\n std::vector<Value> values;\n void build() {\n dfs(0);\n bfs(0);\n }\n Value dfs(int v, int p = -1) {\n Value res = M::id();\n int deg = graph[v].size();\n dp[v] = std::vector<Value>(deg, M::id());\n for (int i = 0; i < deg; ++i) {\n auto e = graph[v][i];\n if (e.to() == p) continue;\n dp[v][i] = M::f(dfs(e.to(), v), e.weight());\n res = M::op(res, dp[v][i]);\n }\n return M::g(res, data[v]);\n }\n void bfs(int v, int p = -1, Value dp_p = M::id()) {\n int deg = graph[v].size();\n std::vector<Value> dp_r(deg + 1, M::id());\n for (int i = deg - 1; i >= 0; --i) {\n auto e = graph[v][i];\n if (e.to() == p) dp[v][i] = M::f(dp_p, e.weight());\n dp_r[i] = M::op(dp[v][i], dp_r[i + 1]);\n }\n Value dp_l = M::id();\n for (int i = 0; i < deg; ++i) {\n int u = graph[v][i].to();\n if (u != p) bfs(u, v, M::g(M::op(dp_l, dp_r[i + 1]), data[v]));\n dp_l = M::op(dp_l, dp[v][i]);\n }\n values[v] = M::g(dp_l, v);\n }\n};\nstruct Monoid {\n using T = pair<ll, ll>;\n using value_type = T;\n static constexpr T id() {\n return {0, 0};\n };\n static constexpr T op(const T &lhs, const T &rhs) {\n return {lhs.first + rhs.first, lhs.second + rhs.second};\n }\n template <class U>\n static constexpr T f(const T &v, U u) {\n return {v.first + v.second, v.second};\n }\n template <class U>\n static constexpr T g(const T &v, U u) {\n return {v.first, v.second + u};\n }\n};\nint main(void) {\n int n;\n cin >> n;\n vector<ll> a(n);\n cin >> a;\n Graph<void> g(n);\n g.input_edges(n - 1);\n ReRooting<Monoid, ll, void> rr(g, a);\n rep (i, n) co(rr[i].first);\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":37712,"score_of_the_acc":-0.8516,"final_rank":11},{"submission_id":"aoj_3163_10086513","code_snippet":"// competitive-verifier: PROBLEM\n#include <iostream>\n#include <vector>\n/**\n * @brief 重み付きグラフ\n *\n * @tparam T 辺の重みの型\n */\ntemplate <class T>\nstruct Graph {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to(), _weight() {}\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr T weight() const { return _weight; }\n private:\n int _from, _to;\n T _weight;\n };\n public:\n using edge_type = typename Graph<T>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\n void add_edges(int from, int to, T weight = T(1)) {\n edges[from].emplace_back(from, to, weight);\n edges[to].emplace_back(to, from, weight);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edge(from - base, to - base, weight);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edges(from - base, to - base, weight);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\ntemplate <>\nstruct Graph<void> {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to() {}\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr int weight() const { return 1; }\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n private:\n int _from, _to;\n };\n public:\n using edge_type = typename Graph<void>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\n void add_edges(int from, int to) {\n edges[from].emplace_back(from, to);\n edges[to].emplace_back(to, from);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edge(from - base, to - base);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edges(from - base, to - base);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\n/**\n * @brief 全方位木dp\n * @see https://algo-logic.info/tree-dp/\n *\n * @tparam M モノイド\n * @tparam T 辺の重みの型\n */\ntemplate <class M, class U, class T>\nstruct ReRooting {\n private:\n using Value = typename M::value_type;\n public:\n ReRooting(const Graph<T> &g, const std::vector<U> &v)\n : graph(g), data(v), dp(g.size()), values(g.size()) {\n build();\n }\n const auto &operator[](int i) const { return values[i]; }\n auto &operator[](int i) { return values[i]; }\n const auto begin() const { return values.begin(); }\n auto begin() { return values.begin(); }\n const auto end() const { return values.end(); }\n auto end() { return values.end(); }\n private:\n Graph<T> graph;\n const std::vector<U> &data;\n std::vector<std::vector<Value>> dp;\n std::vector<Value> values;\n void build() {\n dfs(0);\n bfs(0);\n }\n Value dfs(int v, int p = -1) {\n Value res = M::id();\n int deg = graph[v].size();\n dp[v] = std::vector<Value>(deg, M::id());\n for (int i = 0; i < deg; ++i) {\n auto e = graph[v][i];\n if (e.to() == p) continue;\n dp[v][i] = M::f(dfs(e.to(), v), e.weight());\n res = M::op(res, dp[v][i]);\n }\n return M::g(res, data[v]);\n }\n void bfs(int v, int p = -1, Value dp_p = M::id()) {\n int deg = graph[v].size();\n std::vector<Value> dp_r(deg + 1, M::id());\n for (int i = deg - 1; i >= 0; --i) {\n auto e = graph[v][i];\n if (e.to() == p) dp[v][i] = M::f(dp_p, e.weight());\n dp_r[i] = M::op(dp[v][i], dp_r[i + 1]);\n }\n Value dp_l = M::id();\n for (int i = 0; i < deg; ++i) {\n int u = graph[v][i].to();\n if (u != p) bfs(u, v, M::g(M::op(dp_l, dp_r[i + 1]), data[v]));\n dp_l = M::op(dp_l, dp[v][i]);\n }\n values[v] = M::g(dp_l, v);\n }\n};\nstruct Monoid {\n using value_type = pair<ll, ll>;\n static constexpr value_type id() {\n return {0, 0};\n };\n static constexpr value_type op(const value_type &lhs, const value_type &rhs) {\n return {lhs.first + rhs.first, lhs.second + rhs.second};\n }\n template <class T>\n static constexpr value_type f(const value_type &v, T u) {\n return {v.first + v.second, v.second};\n }\n template <class T>\n static constexpr value_type g(const value_type &v, T u) {\n return {v.first, v.second + u};\n }\n};\nint main(void) {\n int n;\n cin >> n;\n vector<ll> a(n);\n cin >> a;\n Graph<void> g(n);\n g.input_edges(n - 1);\n ReRooting<Monoid, ll, void> rr(g, a);\n rep (i, n) co(rr[i].first);\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":37740,"score_of_the_acc":-0.7857,"final_rank":10},{"submission_id":"aoj_3163_9631368","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nconst int INF = 1000000000;\nint main() {\n int N;\n cin >> N;\n vector<int> l(N);\n for (int i = 0; i < N; i++) {\n cin >> l[i];\n }\n vector<vector<int>> E(N);\n for (int i = 0; i < N - 1; i++) {\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n E[a].push_back(b);\n E[b].push_back(a);\n }\n vector<vector<int>> c(N);\n vector<int> p(N, -1);\n vector<int> bfs;\n queue<int> Q;\n Q.push(0);\n while (!Q.empty()) {\n int v = Q.front();\n Q.pop();\n bfs.push_back(v);\n for (int w : E[v]) {\n if (w != p[v]) {\n p[w] = v;\n c[v].push_back(w);\n Q.push(w);\n }\n }\n }\n reverse(bfs.begin(), bfs.end());\n vector<long long> dp1(N);//部分木のlの合計\n vector<long long> dp2(N);\n for (int v : bfs) {\n for (int w : c[v]) {\n dp1[v] += dp1[w];\n dp2[v] += dp2[w];\n }\n dp2[v] += dp1[v];\n dp1[v] += l[v];\n }\n reverse(bfs.begin(), bfs.end());\n vector<long long> dp3(N);\n dp3[0] = 0;\n for (int v : bfs) {\n long long sum = dp2[v];\n for (int w : c[v]) {\n long long sum2 = sum - dp2[w];\n sum2 -= dp1[w];\n sum2 += dp1[0] - dp1[w];\n sum2 += dp3[v];\n dp3[w] = sum2;\n }\n }\n for (int i = 0; i < N; i++) {\n cout << dp2[i] + dp3[i] << '\\n';\n }\n}","accuracy":1,"time_ms":70,"memory_kb":17360,"score_of_the_acc":-0.4019,"final_rank":7},{"submission_id":"aoj_3163_9579823","code_snippet":"#include <iostream>\n#include <cstdint>\n#include <vector>\n\nusing namespace std;\n\nvoid calc_sub(vector<uint64_t>& sub_l_sum, vector<uint64_t>& sub_beauty, const vector<vector<uint32_t>>& edges, const vector<uint32_t>& l, const uint32_t cur = 0, const uint32_t from = 0)\n{\n\tsub_l_sum[cur] = l[cur], sub_beauty[cur] = 0;\n\tfor (auto edge : edges[cur])\n\t\tif (edge != from)\n\t\t\tcalc_sub(sub_l_sum, sub_beauty, edges, l, edge, cur), sub_l_sum[cur] += sub_l_sum[edge], sub_beauty[cur] += sub_beauty[edge] + sub_l_sum[edge];\n}\n\nvoid calc_beauty(vector<uint64_t>& beauty, const vector<uint64_t>& sub_l_sum, const vector<uint64_t>& sub_beauty, const vector<vector<uint32_t>>& edges, const uint32_t cur = 0, const uint32_t from = 0)\n{\n\tif (cur == 0) beauty[0] = sub_beauty[0];\n\telse beauty[cur] = beauty[from] + sub_l_sum[0] - sub_l_sum[cur] * 2;\n\n\tfor (auto edge : edges[cur])\n\t\tif (edge != from)\n\t\t\tcalc_beauty(beauty, sub_l_sum, sub_beauty, edges, edge, cur);\n}\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tuint32_t N, i;\n\tcin >> N;\n\tvector<uint32_t> l(N), a(N - 1), b(N - 1);\n\tfor (i = 0; i != N; ++i)\n\t\tcin >> l[i];\n\tfor (i = 0; i != N - 1; ++i)\n\t\tcin >> a[i] >> b[i];\n\n\tvector<vector<uint32_t>> edges(N, vector<uint32_t>());\n\tvector<uint64_t> sub_l_sum(N), sub_beauty(N), beauty(N);\n\tfor (i = 0; i != N - 1; ++i)\n\t\tedges[a[i] - 1].push_back(b[i] - 1), edges[b[i] - 1].push_back(a[i] - 1);\n\n\tcalc_sub(sub_l_sum, sub_beauty, edges, l);\n\tcalc_beauty(beauty, sub_l_sum, sub_beauty, edges);\n\t\n\tfor (i = 0; i != N; ++i) cout << beauty[i] << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":19848,"score_of_the_acc":-0.1983,"final_rank":3},{"submission_id":"aoj_3163_8575509","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repd(i,a,b) for (ll i=(a);i<(b);i++)\n#define rep(i,n) repd(i,0,n)\n#define all(x) (x).begin(),(x).end()\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef vector<ll> vec;\nusing Graph = vector<vector<ll>>;\nconst long long INF = 1LL<<60;\nconst long long MOD = 1000000007;\n\n//https://nyaannyaan.github.io/library/graph/graph-template.hpp\ntemplate <typename T>\nstruct edge {\n int src, to;\n T cost;\n\n edge(int _to, T _cost) : src(-1), to(_to), cost(_cost) {}\n edge(int _src, int _to, T _cost) : src(_src), to(_to), cost(_cost) {}\n\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n\n operator int() const { return to; }\n};\ntemplate <typename T>\nusing Edges = vector<edge<T>>;\ntemplate <typename T>\nusing WeightedGraph = vector<Edges<T>>;\nusing UnweightedGraph = vector<vector<int>>;\n\n// Input of (Unweighted) Graph\nUnweightedGraph graph(int N, int M = -1, bool is_directed = false,\n bool is_1origin = true) {\n UnweightedGraph g(N);\n if (M == -1) M = N - 1;\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n if (is_1origin) x--, y--;\n g[x].push_back(y);\n if (!is_directed) g[y].push_back(x);\n }\n return g;\n}\n\n// Input of Weighted Graph\ntemplate <typename T>\nWeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,\n bool is_1origin = true) {\n WeightedGraph<T> g(N);\n if (M == -1) M = N - 1;\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n T c;\n cin >> c;\n if (is_1origin) x--, y--;\n g[x].emplace_back(x, y, c);\n if (!is_directed) g[y].emplace_back(y, x, c);\n }\n return g;\n}\n\n// Input of Edges\ntemplate <typename T>\nEdges<T> esgraph(int N, int M, int is_weighted = true, bool is_1origin = true) {\n Edges<T> es;\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n T c;\n if (is_weighted)\n cin >> c;\n else\n c = 1;\n if (is_1origin) x--, y--;\n es.emplace_back(x, y, c);\n }\n return es;\n}\n\n// Input of Adjacency Matrix\ntemplate <typename T>\nvector<vector<T>> adjgraph(int N, int M, T INF, int is_weighted = true,\n bool is_directed = false, bool is_1origin = true) {\n vector<vector<T>> d(N, vector<T>(N, INF));\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n T c;\n if (is_weighted)\n cin >> c;\n else\n c = 1;\n if (is_1origin) x--, y--;\n d[x][y] = c;\n if (!is_directed) d[y][x] = c;\n }\n return d;\n}\n\n/**\n * @brief グラフテンプレート\n * @docs docs/graph/graph-template.md\n */\n\n//https://nyaannyaan.github.io/library/tree/rerooting.hpp\n\n// Rerooting\n// f1(c1, c2) ... merge value of child node\n// f2(memo[i], chd, par) ... return value from child node to parent node\n// memo[i] ... result of subtree rooted i\n// dp[i] ... result of tree rooted i\ntemplate <typename T, typename G, typename F1, typename F2>\nstruct Rerooting {\n const G &g;\n const F1 f1;\n const F2 f2;\n vector<T> memo, dp;\n T I;\n\n Rerooting(const G &_g, const F1 _f1, const F2 _f2, const T &I_)\n : g(_g), f1(_f1), f2(_f2), memo(g.size(), I_), dp(g.size(), I_), I(I_) {\n dfs(0, -1);\n efs(0, -1, I);\n }\n\n const T &operator[](int i) const { return dp[i]; }\n\n void dfs(int cur, int par) {\n for (auto &dst : g[cur]) {\n if (dst == par) continue;\n dfs(dst, cur);\n memo[cur] = f1(memo[cur], f2(memo[dst], dst, cur));\n }\n }\n\n void efs(int cur, int par, const T &pval) {\n // get cumulative sum\n vector<T> buf;\n for (auto dst : g[cur]) {\n if (dst == par) continue;\n buf.push_back(f2(memo[dst], dst, cur));\n }\n vector<T> head(buf.size() + 1), tail(buf.size() + 1);\n head[0] = tail[buf.size()] = I;\n for (int i = 0; i < (int)buf.size(); i++) head[i + 1] = f1(head[i], buf[i]);\n for (int i = (int)buf.size() - 1; i >= 0; i--)\n tail[i] = f1(tail[i + 1], buf[i]);\n\n // update\n dp[cur] = par == -1 ? head.back() : f1(pval, head.back());\n\n // propagate\n int idx = 0;\n for (auto &dst : g[cur]) {\n if (dst == par) continue;\n efs(dst, cur, f2(f1(pval, f1(head[idx], tail[idx + 1])), cur, dst));\n idx++;\n }\n }\n};\n\n/**\n * @brief Rerooting(全方位木DP)\n * @docs docs/tree/rerooting.md\n */\n\n// auto mod int\n// https://youtu.be/L8grWxBlIZ4?t=9858\n// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize\n// https://youtu.be/8uowVvQ_-Mo?t=1329 : division\nconst int mod = 1000000007;\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\n mint operator+(const mint a) const { return mint(*this) += a;}\n mint operator-(const mint a) const { return mint(*this) -= a;}\n mint operator*(const mint a) const { return mint(*this) *= a;}\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\n // for prime mod\n mint inv() const { return pow(mod-2);}\n mint& operator/=(const mint a) { return *this *= a.inv();}\n mint operator/(const mint a) const { return mint(*this) /= a;}\n};\nistream& operator>>(istream& is, mint& a) { return is >> a.x;}\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\n\n// combination mod prime\n// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619\nstruct combination {\n vector<mint> fact, ifact;\n combination(int n):fact(n+1),ifact(n+1) {\n assert(n < mod);\n fact[0] = 1;\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\n ifact[n] = fact[n].inv();\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\n }\n mint operator()(int n, int k) {\n if (k < 0 || k > n) return 0;\n return fact[n]*ifact[k]*ifact[n-k];\n }\n mint p(int n,int k){\n return fact[n]*ifact[n-k];\n }\n} C(1000005);\n\nusing F=tuple<ll,ll>;\n\nint main()\n{ \n ios::sync_with_stdio(false);\n cin.tie(0);\n ll n;cin>>n;\n vec l(n);\n rep(i,n)cin>>l[i];\n auto g=graph(n,n-1,0,1);\n auto f1=[&](F x,F y){\n auto[a,b]=x;\n auto[c,d]=y;\n a+=c;\n b+=d;\n return F(a,b);\n };\n auto f2=[&](F x,int ch,int p){\n auto[a,b]=x;\n b+=l[ch];\n a+=b;\n return F(a,b);\n };\n Rerooting<F,decltype(g),decltype(f1),decltype(f2)> dp(g,f1,f2,{0,0});\n for(auto ans:dp.dp){\n cout<<get<0>(ans)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":51160,"score_of_the_acc":-1.6596,"final_rank":18},{"submission_id":"aoj_3163_7009675","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3163.cc: Problem M: Star Gazer\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\n\n/* typedef */\n\ntypedef long long ll;\ntypedef vector<int> vi;\n\n/* global variables */\n\nint ls[MAX_N], ps[MAX_N], cis[MAX_N];\nvi nbrs[MAX_N];\nll lss[MAX_N], dp[MAX_N], pdp[MAX_N];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++) scanf(\"%d\", ls + i);\n\n for (int i = 1; i < n; i++) {\n int u, v;\n scanf(\"%d%d\", &u, &v);\n u--, v--;\n nbrs[u].push_back(v);\n nbrs[v].push_back(u);\n }\n\n ps[0] = -1;\n for (int u = 0; u >= 0;) {\n vi &nbru = nbrs[u];\n int up = ps[u];\n\n if (cis[u] < nbru.size()) {\n int v = nbru[cis[u]++];\n if (v != up) {\n\tps[v] = u;\n\tu = v;\n }\n }\n else {\n lss[u] += ls[u];\n\n if (up >= 0) {\n\tlss[up] += lss[u];\n\tdp[up] += dp[u] + lss[u];\n }\n\n u = up;\n }\n }\n //for (int u = 0; u < n; u++) printf(\"%lld \", dp[u]); putchar('\\n');\n\n fill(cis, cis + n, 0);\n pdp[0] = 0;\n for (int u = 0; u >= 0;) {\n vi &nbru = nbrs[u];\n int up = ps[u];\n\n if (cis[u] < nbru.size()) {\n int v = nbru[cis[u]++];\n if (v != up) {\n\tpdp[v] = (dp[u] + pdp[u]) - (dp[v] + lss[v]) + (lss[0] - lss[v]);\n\tu = v;\n }\n }\n else\n u = up;\n }\n\n for (int u = 0; u < n; u++) printf(\"%lld\\n\", dp[u] + pdp[u]);\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":12032,"score_of_the_acc":-0.0667,"final_rank":1},{"submission_id":"aoj_3163_6304884","code_snippet":"#include <iostream>\n#include <unordered_map>\n#include <unordered_set>\n#include <set>\n#include <vector>\n#include <numeric>\n#include <algorithm>\n#include <queue>\n#include <string>\n#include <random>\n#include <array>\n#include <climits>\n#include <map>\n#include <cassert>\n#include <stack>\n#include <iomanip>\n#include <cfloat>\n#include <fstream>\n\n\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<int> brightness(n);\n\tfor (auto& l : brightness) {\n\t\tstd::cin >> l;\n\t}\n\tstd::vector<std::pair<int, int>> edges(n - 1);\n\tfor (auto& [a, b] : edges) {\n\t\tstd::cin >> a >> b; --a; --b;\n\t}\n\tstd::vector<std::vector<int>> graph(n);\n\tfor (const auto [a, b] : edges) {\n\t\tgraph[a].push_back(b);\n\t\tgraph[b].push_back(a);\n\t}\n\tstd::vector<int> depth(n, -1);\n\tstd::stack<int> stack;\n\tstd::vector<int> history;\n\tdepth[0] = 0;\n\tstack.push(0);\n\twhile (!stack.empty()) {\n\t\tconst auto top = stack.top(); stack.pop();\n\t\thistory.push_back(top);\n\t\tfor (const auto next : graph[top]) {\n\t\t\tif (depth[next] != -1) continue;\n\t\t\tdepth[next] = depth[top] + 1;\n\t\t\tstack.push(next);\n\t\t}\n\t}\n\tstd::vector<long long int> sum_brightness(n), from_leaf(n, 0);\n\tstd::copy(brightness.begin(), brightness.end(), sum_brightness.begin());\n\tstd::reverse(history.begin(), history.end());\n\tfor (const auto node : history) {\n\t\tfor (const auto child : graph[node]) {\n\t\t\tif (depth[child] < depth[node]) continue;\n\t\t\tsum_brightness[node] += sum_brightness[child];\n\t\t\tfrom_leaf[node] += from_leaf[child] + sum_brightness[child];\n\t\t}\n\t}\n\tstd::vector<long long int> from_root(n, 0);\n\tstd::reverse(history.begin(), history.end());\n\tfor (const auto node : history) {\n\t\tfor (const auto child : graph[node]) {\n\t\t\tif (depth[child] < depth[node]) continue;\n\t\t\tfrom_root[child] = from_root[node] + (from_leaf[node] - from_leaf[child] - sum_brightness[child]) + (sum_brightness[0] - sum_brightness[child]);\n\t\t}\n\t}\n\tfor (auto i = 0; i < n; ++i) {\n\t\tstd::cout << from_leaf[i] + from_root[i] << '\\n';\n\t}\n}","accuracy":1,"time_ms":60,"memory_kb":13780,"score_of_the_acc":-0.2444,"final_rank":4},{"submission_id":"aoj_3163_5948346","code_snippet":"#ifdef LOCAL\n #define _GLIBCXX_DEBUG\n #define __clock__\n#else\n #pragma GCC optimize(\"Ofast\")\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing VI = vector<ll>;\nusing VV = vector<VI>;\nusing VS = vector<string>;\nusing PII = pair<ll, ll>;\n\n// #define INT128 // 必要なら有効化してください\n#ifdef INT128\n using LL = __int128;\n#endif\n\n// tourist set\ntemplate <typename A, typename B>\nstring to_string(pair<A, B> p);\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p);\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p);\n\nstring to_string(const string& s) {\n return '\"' + s + '\"';\n}\n\nstring to_string(const char* s) {\n return to_string((string) s);\n}\n\nstring to_string(bool b) {\n return (b ? \"true\" : \"false\");\n}\n\nstring to_string(char c){\n string s = {c};\n return s;\n}\n\n// LL\n#ifdef INT128\n// input\nistream& operator>>(istream& is, LL& v)\n{\n string s;\n is >> s;\n v = 0;\n for (int i = 0; i < (int)s.size(); i++) {\n if (isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\n }\n if (s[0] == '-') { v *= -1; }\n return is;\n}\nstd::ostream &operator<<(std::ostream &dest, LL value) {\n std::ostream::sentry s(dest);\n if (s) {\n LL tmp = value < 0 ? -value : value;\n char buffer[128];\n char *d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n if (value < 0) {\n --d;\n *d = '-';\n }\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\nstring to_string(LL v){\n stringstream ss;\n ss << v;\n return ss.str();\n}\n#endif // LL\n\nstring to_string(vector<bool> v) {\n bool first = true;\n string res = \"{\";\n for (int i = 0; i < static_cast<int>(v.size()); i++) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(v[i]);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <size_t N>\nstring to_string(bitset<N> v) {\n string res = \"\";\n for (size_t i = 0; i < N; i++) {\n res += static_cast<char>('0' + v[i]);\n }\n return res;\n}\n\ntemplate <typename A>\nstring to_string(A v) {\n bool first = true;\n string res = \"{\";\n for (const auto &x : v) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(x);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <typename A, typename B>\nstring to_string(pair<A, B> p) {\n return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";\n}\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \")\";\n}\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \", \" + to_string(get<3>(p)) + \")\";\n}\n\nvoid debug_out() { cerr << '\\n'; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cerr << \" \" << to_string(H);\n debug_out(T...);\n}\n\n#ifdef LOCAL\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n// tourist set end\n\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\n\n#define FOR(i,a,b) for(ll i=(a);i<(b);++i)\n#define rep(i,b) FOR(i, 0, b)\n#define ALL(v) (v).begin(), (v).end()\n#define p(s) cout<<(s)<<'\\n'\n#define p2(s, t) cout << (s) << \" \" << (t) << '\\n'\n#define SZ(x) ((int)(x).size())\n#define SORT(A) sort(ALL(A))\n#define RSORT(A) sort(ALL(A), greater<ll>())\n#define MP make_pair\n#define p_yes() p(\"Yes\")\n#define p_no() p(\"No\")\n#define p_possible() p(\"Possible\")\n#define p_impossible() p(\"Impossible\")\nvoid yes(){p_yes(); exit(0);}\nvoid no(){p_no(); exit(0);}\nvoid possible(){p_possible(); exit(0);}\nvoid impossible(){p_impossible(); exit(0);}\n\nll SUM(VI& V){\n return accumulate(ALL(V), 0LL);\n}\n\nll MIN(VI& V){return *min_element(ALL(V));}\nll MAX(VI& V){return *max_element(ALL(V));}\n\nvoid print_vector(VI& V, ll offset=0){\n ll n = V.size();\n rep(i, n){\n if(i) cout << ' ';\n cout << V[i]+offset;\n }\n cout << endl;\n}\n\nll gcd(ll a,ll b){\n if(b == 0) return a;\n return gcd(b,a%b);\n}\n\nll lcm(ll a,ll b){\n ll g = gcd(a,b);\n return a / g * b;\n}\n\n// long double\nusing ld = long double;\n// #define EPS (1e-14)\nconstexpr ld EPS = 1e-14;\n// #define equals(a,b) (fabs((a)-(b)) < EPS)\nconstexpr bool equals(ld a, ld b){return fabs((a)-(b)) < EPS;}\n\n// 小さい順に取り出すpriority queue\nusing inverse_priority_queue = priority_queue<ll, vector<ll>, greater<ll> >;\n\nint popcount(ll t){\n return __builtin_popcountll(t);\n}\n\nconst ll mod = 1e9 + 7;\n// const ll mod = 998244353;\nconst ll inf = 4e18; // LLONG_MAX = 9223372036854775807 (atcoder, codeforces)\nconst double PI = acos(-1);\n\n// [a/b] (繰り上げ)\nll ceil_div(ll a, ll b){\n return (a+b-1)/b;\n}\n\nll ll_pow(ll a, ll n){\n ll ans = 1;\n FOR(i, 0, n){\n ans *= a;\n }\n return ans;\n}\n// modなし\n\n// snuke's mint\n// auto mod int\n// https://youtu.be/L8grWxBlIZ4?t=9858\n// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize\n// https://youtu.be/8uowVvQ_-Mo?t=1329 : division\n// const int mod = 1000000007;\nstruct mint {\n ll x; // using ll = long long;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) {\n (x *= a.x) %= mod;\n return *this;\n }\n mint operator+(const mint a) const {\n mint res(*this);\n return res+=a;\n }\n mint operator-(const mint a) const {\n mint res(*this);\n return res-=a;\n }\n mint operator*(const mint a) const {\n mint res(*this);\n return res*=a;\n }\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\n // for prime mod\n mint inv() const {\n return pow(mod-2);\n }\n mint& operator/=(const mint a) {\n return (*this) *= a.inv();\n }\n mint operator/(const mint a) const {\n mint res(*this);\n return res/=a;\n }\n};\n\n// ※双方向\n// N : 頂点数\n// M : 辺数\n// return vector<vector<ll>>\nVV load_graph(ll N, ll M){\n VV G(N);\n rep(i,M){\n ll a,b;cin>>a>>b;\n a--;b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n return G;\n}\nVV load_tree(ll N){\n return load_graph(N, N-1);\n}\n\nVI loadV(ll N){\n VI A(N);\n rep(i,N)cin>>A[i];\n return A;\n}\n\n//#include <atcoder/dsu>\n//using namespace atcoder; // 忘れがち\n\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n // input\n ll N;cin>>N;\n VI L = loadV(N); // light\n ll sumL = SUM(L);\n\n VV G(N);\n rep(i,N-1){\n ll a,b;cin>>a>>b;\n a--;b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n\n VI parent(N,-1); // parent\n\n // light of subtree\n VI dpL(N);\n function<ll(ll,ll)> dfs2 = [&](ll i, ll prev){\n parent[i]=prev;\n ll sum=L[i];\n for(ll to : G[i]){\n if(to==prev)continue;\n sum += dfs2(to,i);\n }\n return dpL[i]=sum;\n };\n dfs2(0,-1);\n debug(dpL);\n\n // answer of subtree\n VI dp(N);\n function<ll(ll,ll)> dfs = [&](ll i, ll prev){\n ll sum=0;\n for(ll to : G[i]){\n if(to==prev)continue;\n sum += dfs(to,i) + dpL[to];\n }\n return dp[i]=sum;\n };\n dfs(0,-1);\n \n function<void(ll,ll)> bfs = [&](ll i, ll prev){\n // prevには全方向が入っている\n \n // 自分のdpを求めて\n ll otherlight = sumL - dpL[i];\n\n ll add = dp[prev]-dp[i]-dpL[i]+otherlight;\n dp[i]+=add;\n\n // 子へ\n for(ll to : G[i]){\n if(to==prev)continue;\n bfs(to,i);\n }\n };\n for(ll to : G[0]){\n bfs(to,0);\n }\n\n rep(i,N){\n p(dp[i]);\n }\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":19368,"score_of_the_acc":-0.2528,"final_rank":5},{"submission_id":"aoj_3163_5073758","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\nnamespace CharacterClass {\n\tconstexpr string_view\n\t digit = \"0123456789\",\n\t xdigit = \"0123456789ABCDEFabcdef\", lower = \"abcdefghijklmnopqrstuvwxyz\",\n\t upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n\t alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t alnum = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t word = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\",\n\t punct = R\"(!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~)\",\n\t graph =\n\t R\"(!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t print =\n\t R\"( !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t blank = \" \\t\", space = \" \\t\\n\\r\\f\\v\";\n} // namespace CharacterClass\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Printer {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid print(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(bool v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(vector<bool>::reference v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid print(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid print(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid print(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void print(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\n\t\tprint(v.first);\n\t\tprint(D.d);\n\t\tprint(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) print(D.d);\n\t\t\tprint(*i);\n\t\t}\n\t}\n\ttemplate <class T> void print(const vector<T>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void print(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) print(D.l);\n\t\t\tprint(v[i]);\n\t\t}\n\t}\n\n\tPrinter() = default;\n\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tPrinter& operator()() {\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Printer& operator()(H&& h) {\n\t\tprint(h);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\n\t\tprint(h);\n\t\tprint(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\n\t\tprint_range(begin, end);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Printer& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tPrinter& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tPrinter& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tPrinter& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tPrinter& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n\ttemplate <class V> auto operator()(const V& val, size_t i) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(next(begin(v), i), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 7 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T = long long> constexpr T TEN(size_t n) {\n\tT result = 1;\n\tfor (size_t i = 0; i < n; ++i) result *= 10;\n\treturn result;\n}\ntemplate <class T, class U,\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr auto div_ceil(T n, U m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> constexpr T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> constexpr T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T, class U, class V>\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\n\treturn lower <= v && v < upper;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\nconstexpr bool is_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> constexpr T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T> constexpr int BIT(T x, int i) {\n\treturn (x & (1 << i)) ? 1 : 0;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Pow(T a, U n) {\n\tassert(n >= 0);\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Powmod(T a, U n, T mod) {\n\tassert(n >= 0);\n\tif (a > mod) a %= mod;\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 3 \"/home/yuruhiya/programming/library/Graph/ReRooting.cpp\"\nusing namespace std;\n\ntemplate <class DP> class ReRooting {\n\tint n;\n\tvector<vector<int>> graph;\n\tvector<vector<DP>> dp;\n\tvector<DP> ans;\n\n\tDP dfs(int v, int p) {\n\t\tDP sum;\n\t\tfor (size_t i = 0; i < graph[v].size(); ++i) {\n\t\t\tint e = graph[v][i];\n\t\t\tDP& dp_e = dp[v][i];\n\t\t\tif (e != p) {\n\t\t\t\tdp_e = dfs(e, v);\n\t\t\t\tsum += dp_e;\n\t\t\t}\n\t\t}\n\t\treturn sum.add_root(v);\n\t}\n\tvoid bfs(int v, int p, const DP& dp_par) {\n\t\tfor (size_t i = 0; i < graph[v].size(); ++i) {\n\t\t\tif (graph[v][i] == p) {\n\t\t\t\tdp[v][i] = dp_par;\n\t\t\t}\n\t\t}\n\n\t\tvector<DP> dp_left(graph[v].size() + 1);\n\t\tfor (size_t i = 0; i < graph[v].size(); ++i) {\n\t\t\tdp_left[i + 1] = dp_left[i] + dp[v][i];\n\t\t}\n\t\tvector<DP> dp_right(graph[v].size() + 1);\n\t\tfor (int i = graph[v].size() - 1; i >= 0; --i) {\n\t\t\tdp_right[i] = dp_right[i + 1] + dp[v][i];\n\t\t}\n\t\tans[v] = dp_left.back().add_root(v);\n\n\t\tfor (size_t i = 0; i < graph[v].size(); ++i) {\n\t\t\tint e = graph[v][i];\n\t\t\tif (e != p) {\n\t\t\t\tbfs(e, v, (dp_left[i] + dp_right[i + 1]).add_root(v));\n\t\t\t}\n\t\t}\n\t}\n\npublic:\n\tReRooting(const vector<vector<int>>& _graph) : n(_graph.size()), graph(_graph), dp(n), ans(n) {\n\t\tfor (int i = 0; i < n; ++i) dp[i].resize(graph[i].size());\n\t}\n\tvector<DP> solve() {\n\t\tdfs(0, -1);\n\t\tbfs(0, -1, DP());\n\t\treturn ans;\n\t}\n};\n\n/*\nstruct DP {\n int dp;\n DP(int _dp = 1) : dp(_dp) {}\n DP operator+(const DP& d) const {\n return DP(*this) += d;\n }\n DP& operator+=(const DP& d) {\n return *this;\n }\n DP add_root([[maybe_unused]] int v) const {\n DP res = *this;\n\n return res;\n }\n};\n*/\n#line 3 \"a.cpp\"\n\nVL a;\n\nstruct DP {\n\tll sum, val;\n\tDP() : sum(0), val(0) {}\n\tDP operator+(const DP& d) const {\n\t\treturn DP(*this) += d;\n\t}\n\tDP& operator+=(const DP& d) {\n\t\tsum += d.sum;\n\t\tval += d.val;\n\t\treturn *this;\n\t}\n\tDP add_root([[maybe_unused]] int v) const {\n\t\tDP res = *this;\n\t\tres.val += sum;\n\t\tres.sum += a[v];\n\t\treturn res;\n\t}\n};\n\nint main() {\n\tini(n);\n\ta = in[n];\n\tVVI g(n);\n\trep(i, n - 1) {\n\t\tint u = in--, v = in--;\n\t\tg[u].push_back(v);\n\t\tg[v].push_back(u);\n\t}\n\n\tReRooting<DP> dp(g);\n\tauto ans = dp.solve();\n\trep(i, n) out(ans[i].val);\n}","accuracy":1,"time_ms":50,"memory_kb":43232,"score_of_the_acc":-0.9251,"final_rank":13},{"submission_id":"aoj_3163_4952868","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\nint N,root;\nll total_L;\nll dp[SIZE],L[SIZE],sum_L[SIZE];\nll ans[SIZE];\nvector<int> G[SIZE];\n\nvoid dfs(int node_id,int pre){\n\n\tsum_L[node_id] += L[node_id];\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next = G[node_id][i];\n\t\tif(next == pre)continue;\n\n\t\tdfs(next,node_id);\n\t\tdp[node_id] += dp[next]+sum_L[next];\n\t\tsum_L[node_id] += sum_L[next];\n\t}\n}\n\nvoid dfs2(int node_id,int pre){\n\n\tif(node_id == root){\n\n\t\tans[root] = dp[root];\n\t}else{\n\n\t\tans[node_id] = dp[node_id]+(ans[pre]-(dp[node_id]+sum_L[node_id]))+total_L-sum_L[node_id];\n\t}\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint next = G[node_id][i];\n\t\tif(next == pre)continue;\n\n\t\tdfs2(next,node_id);\n\t}\n}\n\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\ttotal_L = 0;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lld\",&L[i]);\n\t\ttotal_L += L[i];\n\t}\n\n\tint from,to;\n\n\tfor(int i = 0; i < N-1; i++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdp[i] = 0;\n\t\tsum_L[i] = 0;\n\t}\n\n\troot = 0;\n\n\tdfs(root,-1);\n\tdfs2(root,-1);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tprintf(\"%lld\\n\",ans[i]);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":17152,"score_of_the_acc":-0.2633,"final_rank":6},{"submission_id":"aoj_3163_4949975","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,n) for(ll i=0;i<(ll)n;i++)\n#define dump(x) cerr << \"Line \" << __LINE__ << \": \" << #x << \" = \" << (x) << \"\\n\";\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n\nusing ld = long double;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<ld, ld>;\n\ntemplate<typename T> using V = vector<T>;\ntemplate<typename T> using P = pair<T, T>;\ntemplate<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }\ntemplate<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }\ntemplate<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << \"(\" << v.first << \", \" << v.second << \")\"; return os;}\ntemplate<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }\ntemplate<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << \"\\n\";} return os;}\nstruct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;\n\ntemplate <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\nvoid fail() { cout << -1 << '\\n'; exit(0); }\ninline int popcount(const int x) { return __builtin_popcount(x); }\ninline int popcount(const ll x) { return __builtin_popcountll(x); }\ntemplate<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)\n{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<\"\\n\";}};\ntemplate<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];\nfor(ll i=1;i<n;i++)cerr spa v[i];\ncerr<<\"\\n\";};\n\nconst ll INF = (1ll<<62);\n// const ld EPS = 1e-10;\n// const ld PI = acos(-1.0);\nconst ll mod = (int)1e9 + 7;\n//const ll mod = 998244353;\n\ntemplate< typename sum_t, typename key_t >\nstruct ReRooting {\n struct Edge {\n int to;\n key_t data;\n sum_t dp, ndp;\n };\n\n using F = function< sum_t(sum_t, sum_t) >;\n using G = function< sum_t(sum_t, key_t) >;\n\n // subdp: 一度目のdfsの結果を保持する配列\n // dp: 二度目のdfsの後，結果を各頂点でマージした値を保持する配列\n vector< vector< Edge > > g;\n const F f;\n const G gg;\n const sum_t ident;\n vector< sum_t > subdp, dp;\n\n ReRooting(int V, const F f, const G g, const sum_t &ident)\n : g(V), f(f), gg(g), ident(ident), subdp(V, ident), dp(V, ident) {}\n\n // add_edge は危険なので使わない方が良い\n // u->v に重み d の有向辺を追加するのではなく，\n // u->v と v->u の両方に重み d の有向辺を追加する\n // void add_edge(int u, int v, const key_t &d) {\n // g[u].emplace_back((Edge) {v, d, ident, ident});\n // g[v].emplace_back((Edge) {u, d, ident, ident});\n // }\n\n // u->v に重み d の有向辺を追加し，\n // v->u に重み e の有向辺を追加する\n void add_edge_bi(int u, int v, const key_t &d, const key_t &e) {\n g[u].emplace_back((Edge) {v, d, ident, ident});\n g[v].emplace_back((Edge) {u, e, ident, ident});\n }\n\n // 一度目のdfs\n void dfs_sub(int idx, int par) {\n for(auto &e : g[idx]) {\n if(e.to == par) continue;\n dfs_sub(e.to, idx);\n subdp[idx] = f(subdp[idx], gg(subdp[e.to], e.data));\n }\n }\n\n // 二度目のdfs\n void dfs_all(int idx, int par, const sum_t &top) {\n sum_t buff{ident};\n for(int i = 0; i < (int) g[idx].size(); i++) {\n auto &e = g[idx][i];\n e.ndp = buff;\n e.dp = gg(par == e.to ? top : subdp[e.to], e.data);\n buff = f(buff, e.dp);\n }\n dp[idx] = buff;\n buff = ident;\n for(int i = (int) g[idx].size() - 1; i >= 0; i--) {\n auto &e = g[idx][i];\n if(e.to != par) dfs_all(e.to, idx, f(e.ndp, buff));\n e.ndp = f(e.ndp, buff);\n buff = f(buff, e.dp);\n }\n }\n\n vector< sum_t > build() {\n dfs_sub(0, -1);\n dfs_all(0, -1, ident);\n return dp;\n }\n};\n\nint main(){\n\n ll N;\n cin >> N;\n V<ll> l(N);\n REP(i, N) cin >> l[i];\n\n auto f1 = [](pll x, pll y){\n return pll{x.first+y.first, x.second+y.second};\n };\n\n auto f2 = [](pll x, ll a){\n return pll{x.first+a, x.first+x.second+a};\n };\n\n ReRooting<pll, ll> RR(N, f1, f2, pll{0, 0});\n\n REP(i, N-1){\n ll a, b;\n cin >> a >> b;\n a--, b--;\n RR.add_edge_bi(a, b, l[b], l[a]);\n }\n RR.build();\n\n REP(i, N) cout << RR.dp[i].second << \"\\n\";\n\n\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":44264,"score_of_the_acc":-1.0179,"final_rank":15},{"submission_id":"aoj_3163_4893533","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing LL = long long int;\n#define incII(i, l, r) for(LL i = (l) ; i <= (r); i++)\n#define incIX(i, l, r) for(LL i = (l) ; i < (r); i++)\n#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)\n#define incXX(i, l, r) for(LL i = (l) + 1; i < (r); i++)\n#define decII(i, l, r) for(LL i = (r) ; i >= (l); i--)\n#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)\n#define decXI(i, l, r) for(LL i = (r) ; i > (l); i--)\n#define decXX(i, l, r) for(LL i = (r) - 1; i > (l); i--)\n#define inc(i, n) incIX(i, 0, n)\n#define dec(i, n) decIX(i, 0, n)\n#define inc1(i, n) incII(i, 1, n)\n#define dec1(i, n) decII(i, 1, n)\nauto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };\nauto inIX = [](auto x, auto l, auto r) { return (l <= x && x < r); };\nauto inXI = [](auto x, auto l, auto r) { return (l < x && x <= r); };\nauto inXX = [](auto x, auto l, auto r) { return (l < x && x < r); };\nauto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };\nauto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };\nauto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };\nauto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define MT make_tuple\n#define FI first\n#define SE second\n#define FR front()\n#define BA back()\n#define ALL(c) c.begin(), c.end()\n#define RALL(c) c.rbegin(), c.rend()\n#define RV(c) reverse(ALL(c))\n#define SC static_cast\n#define SI(c) SC<int>(c.size())\n#define SL(c) SC<LL >(c.size())\n#define RF(e, c) for(auto & e: c)\n#define SF(c, ...) for(auto & [__VA_ARGS__]: c)\n#define until(e) while(! (e))\n#define if_not(e) if(! (e))\n#define ef else if\n#define UR assert(false)\nauto * IS = & cin;\nauto * OS = & cout;\narray<string, 3> SEQ = { \"\", \" \", \"\" };\n// input\ntemplate<typename T> T in() { T a; (* IS) >> a; return a; }\n// input: tuple\ntemplate<int I, typename U> void tin_(istream & is, U & t) {\n\tif constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }\n}\ntemplate<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }\ntemplate<typename ... T> auto tin() { return in<tuple<T ...>>(); }\n// input: array\ntemplate<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }\ntemplate<typename T, size_t N> auto ain() { return in<array<T, N>>(); }\n// input: multi-dimensional vector\ntemplate<typename T> T vin() { T v; (* IS) >> v; return v; }\ntemplate<typename T, typename N, typename ... M> auto vin(N n, M ... m) {\n\tvector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;\n}\n// input: multi-column (tuple<vector>)\ntemplate<typename U, int I> void colin_([[maybe_unused]] U & t) { }\ntemplate<typename U, int I, typename A, typename ... B> void colin_(U & t) {\n\tget<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);\n}\ntemplate<typename ... T> auto colin(int n) {\n\ttuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;\n}\n// output\nvoid out_([[maybe_unused]] string s) { }\ntemplate<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }\ntemplate<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }\nauto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };\nauto out = [](auto ... a) { outF(\"\", \" \" , \"\\n\", a ...); };\nauto outS = [](auto ... a) { outF(\"\", \" \" , \" \" , a ...); };\nauto outL = [](auto ... a) { outF(\"\", \"\\n\", \"\\n\", a ...); };\nauto outN = [](auto ... a) { outF(\"\", \"\" , \"\" , a ...); };\n// output: multi-dimensional vector\ntemplate<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {\n\tos << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? \"\" : SEQ[1]) << v[i]; } return (os << SEQ[2]);\n}\ntemplate<typename T> void vout_(T && v) { (* OS) << v; }\ntemplate<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {\n\tinc(i, SI(v)) { (* OS) << (i == 0 ? \"\" : a); vout_(v[i], b ...); }\n}\ntemplate<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }\ntemplate<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << flush; }\n\n// ---- ----\n\nint main() {\n\tauto n = in<int>();\n\tauto l = vin<LL>(n);\n\tvector<vector<int>> g(n);\n\tinc(i, n - 1) {\n\t\tauto [a, b] = ain<int, 2>();\n\t\ta--; b--;\n\t\tg[a].PB(b);\n\t\tg[b].PB(a);\n\t}\n\t\n\tvector<LL> s(n), ans(n);\n\tfunction<void(int, int, int)> dfs = [&](int t, int v, int p) {\n\t\tif(t == 0) {\n\t\t\tRF(e, g[v]) {\n\t\t\t\tif(e == p) { continue; }\n\t\t\t\tdfs(t, e, v);\n\t\t\t\tl[v] += l[e];\n\t\t\t\ts[v] += l[e] + s[e];\n\t\t\t}\n\t\t} else {\n\t\t\tif(v == 0) {\n\t\t\t\tans[v] = s[v];\n\t\t\t} else {\n\t\t\t\tans[v] = ans[p] + l[0] - 2 * l[v]; \n\t\t\t}\n\t\t\tRF(e, g[v]) {\n\t\t\t\tif(e == p) { continue; }\n\t\t\t\tdfs(t, e, v);\n\t\t\t}\n\t\t}\n\t};\n\tdfs(0, 0, -1);\n\tdfs(1, 0, -1);\n\tvout(ans, \"\\n\");\n}","accuracy":1,"time_ms":70,"memory_kb":20124,"score_of_the_acc":-0.472,"final_rank":8},{"submission_id":"aoj_3163_4878874","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\n#define pp pair<int,int>\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define ld long double\n#define al(a) (a).begin(),(a).end()\n#define mk make_pair\n#define check cout<<\"?\"<<endl;\n\nll MOD=1000000007;\nll mod=998244353;\nint inf=1000001000;\nll INF=1e18+5;\n\ntemplate<typename T>\nostream& operator<<(ostream& os,const vector<T>& v){\n if(v.empty()){\n os<<\"{ }\";\n return os;\n }\n os<<\"{\"<<v.front();\n for(auto itr=++v.begin();itr!=v.end();itr++){\n os<<\", \"<<*itr;\n }\n os<<\"}\";\n return os;\n}\n\ntemplate<typename T_first,typename T_second>\nostream& operator<<(ostream& os,const pair<T_first,T_second>& P){\n os<<\"(\"<<P.first;\n os<<\", \"<<P.second;\n os<<\")\";\n return os;\n}\n\nstruct edge{\n int from;\n int to;\n int idx;\n int rev;\n edge(int from=-1,int to=-1,int idx=-1,int rev=-1):to(to),rev(rev){}\n};\n\ntemplate<class DP>\nclass ReRooting{\npublic:\n\n using E=function<DP()>; \n using F=function<DP(DP,DP)>;\n using F_=function<DP(edge,DP)>;\n int n;\n vector<vector<edge>> path;\n vector<vector<DP>> edges_dp;\n E e;\n vector<DP> res;\n F merge;\n F_ mapping;\n\n ReRooting(int n,E e,F merge,F_ mapping):n(n),e(e),merge(merge),mapping(mapping){\n res.assign(n,e());\n path.assign(n,vector<edge>(0));\n edges_dp.assign(n,vector<DP>(0));\n }\n\n void add_edge(int from,int to){\n path[from].push_back(edge{from,to,(int)path[from].size(),(int)path[to].size()});\n path[to].push_back(edge{to,from,(int)path[to].size(),(int)path[from].size()-1});\n edges_dp[from].push_back(e());\n edges_dp[to].push_back(e());\n }\n\n void solve(){\n dfs(0,-1,-1);\n bfs(0);\n }\n\n DP dfs(int s,int p,int idx){\n if(s==0){\n rep(i,(int)path[s].size()){\n dfs(path[s][i].to,s,i);\n }\n return DP{};\n }\n\n DP& cur_edge=edges_dp[p][idx];\n rep(i,(int)path[s].size()){\n if(path[s][i].to==p) continue;\n cur_edge=merge(cur_edge,dfs(path[s][i].to,s,i));\n }\n cur_edge=mapping(path[p][idx],cur_edge);\n\n return cur_edge;\n }\n\n void bfs(int start){\n vector<bool> visited(n,false);\n queue<int> que;\n que.push(start);\n while(!que.empty()){\n int s=que.front();\n que.pop();\n int degree=(int)path[s].size();\n vector<DP> merge_left(degree,e());\n vector<DP> merge_right(degree,e());\n for(int i=1;i<degree;i++){\n merge_left[i]=merge(edges_dp[s][i-1],merge_left[i-1]);\n }\n for(int i=degree-2;i>=0;i--){\n merge_right[i]=merge(edges_dp[s][i+1],merge_right[i+1]);\n }\n rep(i,degree){\n if(visited[path[s][i].to]) continue;\n edge& cur_edge=path[s][i];\n edges_dp[cur_edge.to][cur_edge.rev]=merge(edges_dp[cur_edge.to][cur_edge.rev],merge_left[i]);\n edges_dp[cur_edge.to][cur_edge.rev]=merge(edges_dp[cur_edge.to][cur_edge.rev],merge_right[i]);\n edges_dp[cur_edge.to][cur_edge.rev]=mapping(path[cur_edge.to][cur_edge.rev],edges_dp[cur_edge.to][cur_edge.rev]);\n que.push(cur_edge.to);\n }\n res[s]=merge(edges_dp[s][0],merge_right[0]);\n visited[s]=true;\n }\n }\n};\n\nvector<ll> l;\n\n//using DP=intなども可\nstruct DP{\n ll dp;\n ll sum;\n};\nDP e(){\n return DP{0,0}; \n}\n//モノイド\nDP dp_merge(DP p,DP a){\n p.dp=p.dp+a.dp;\n p.sum=p.sum+a.sum;\n return p;\n}\nDP mapping(edge cur_edge,DP x){\n x.sum=x.sum+l[cur_edge.to];\n x.dp=x.dp+x.sum;\n return x;\n}\n\nint main(){\n int n; cin>>n;\n l.assign(n,0);\n rep(i,n) cin>>l[i];\n ReRooting<DP> tdp(n,e,dp_merge,mapping);\n rep(i,n-1){\n int a,b; cin>>a>>b;\n tdp.add_edge(a-1,b-1);\n }\n tdp.solve();\n rep(i,n) printf(\"%lld\\n\",tdp.res[i].dp);\n}","accuracy":1,"time_ms":100,"memory_kb":33408,"score_of_the_acc":-1.0091,"final_rank":14},{"submission_id":"aoj_3163_4878216","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\n#define pp pair<int,int>\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define ld long double\n#define al(a) (a).begin(),(a).end()\n#define mk make_pair\n#define check cout<<\"?\"<<endl;\n\nll MOD=1000000007;\nll mod=998244353;\nint inf=1000001000;\nll INF=1e18+5;\n\ntemplate<typename T>\nostream& operator<<(ostream& os,const vector<T>& v){\n if(v.empty()){\n os<<\"{ }\";\n return os;\n }\n os<<\"{\"<<v.front();\n for(auto itr=++v.begin();itr!=v.end();itr++){\n os<<\", \"<<*itr;\n }\n os<<\"}\";\n return os;\n}\n\ntemplate<typename T_first,typename T_second>\nostream& operator<<(ostream& os,const pair<T_first,T_second>& P){\n os<<\"(\"<<P.first;\n os<<\", \"<<P.second;\n os<<\")\";\n return os;\n}\n\ntemplate<class DP>\nclass ReRooting{\npublic:\n struct edge{\n int to;\n int rev;\n edge(int to=-1,int rev=-1):to(to),rev(rev){}\n };\n\n using E=function<DP(int)>; \n using F=function<DP(DP,DP)>;\n using F_=function<DP(DP)>;\n int n;\n vector<vector<edge>> path;\n vector<vector<DP>> edges_dp;\n E e;\n vector<DP> res;\n F merge;\n F_ mapping;\n\n ReRooting(int n,E e,F merge,F_ mapping):n(n),e(e),merge(merge),mapping(mapping){\n res.assign(n,e(-1));\n path.assign(n,vector<edge>(0));\n edges_dp.assign(n,vector<DP>(0));\n }\n\n void add_edge(int from,int to){\n path[from].push_back(edge{to,(int)path[to].size()});\n path[to].push_back(edge{from,(int)path[from].size()-1});\n edges_dp[from].push_back(e(to));\n edges_dp[to].push_back(e(from));\n }\n\n void solve(){\n dfs(0,-1,-1);\n bfs(0);\n }\n\n DP dfs(int s,int p,int idx){\n if(s==0){\n rep(i,(int)path[s].size()){\n dfs(path[s][i].to,s,i);\n }\n return DP{};\n }\n\n DP& cur_edge=edges_dp[p][idx];\n rep(i,(int)path[s].size()){\n if(path[s][i].to==p) continue;\n cur_edge=merge(cur_edge,dfs(path[s][i].to,s,i));\n }\n cur_edge=mapping(cur_edge);\n\n return cur_edge;\n }\n\n void bfs(int start){\n vector<bool> visited(n,false);\n queue<int> que;\n que.push(start);\n while(!que.empty()){\n int s=que.front();\n que.pop();\n int degree=(int)path[s].size();\n vector<DP> merge_left(degree,e(-1));\n vector<DP> merge_right(degree,e(-1));\n for(int i=1;i<degree;i++){\n merge_left[i]=merge(edges_dp[s][i-1],merge_left[i-1]);\n }\n for(int i=degree-2;i>=0;i--){\n merge_right[i]=merge(edges_dp[s][i+1],merge_right[i+1]);\n }\n rep(i,degree){\n if(visited[path[s][i].to]) continue;\n edge& cur_edge=path[s][i];\n edges_dp[cur_edge.to][cur_edge.rev]=merge(edges_dp[cur_edge.to][cur_edge.rev],merge_left[i]);\n edges_dp[cur_edge.to][cur_edge.rev]=merge(edges_dp[cur_edge.to][cur_edge.rev],merge_right[i]);\n edges_dp[cur_edge.to][cur_edge.rev]=mapping(edges_dp[cur_edge.to][cur_edge.rev]);\n que.push(cur_edge.to);\n }\n res[s]=merge(edges_dp[s][0],merge_right[0]);\n visited[s]=true;\n }\n }\n};\n\nvector<ll> l;\n\n//using DP=intなども可\nstruct DP{\n int to;\n ll dp;\n ll sum;\n};\nDP e(int to=-1){\n return DP{to,0,0}; \n}\nDP dp_merge(DP p,DP a){\n p.dp=p.dp+a.dp;\n p.sum=p.sum+a.sum;\n return p;\n}\nDP mapping(DP x){\n x.sum=x.sum+l[x.to];\n x.dp=x.dp+x.sum;\n return x;\n}\n\nint main(){\n int n; cin>>n;\n l.assign(n,0);\n rep(i,n) cin>>l[i];\n ReRooting<DP> tdp(n,e,dp_merge,mapping);\n rep(i,n-1){\n int a,b; cin>>a>>b;\n tdp.add_edge(a-1,b-1);\n }\n tdp.solve();\n rep(i,n) printf(\"%lld\\n\",tdp.res[i].dp);\n}","accuracy":1,"time_ms":110,"memory_kb":40836,"score_of_the_acc":-1.2643,"final_rank":17},{"submission_id":"aoj_3163_4876903","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n////////////////////////////// Begin Macros\n\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define in(x, a, b) (a <= x and x < b)\n#define rep(i, N) for (int i = 0; i < (int)(N); i++)\n#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i--)\n#define rep1(i, N) for (int i = 1; i <= (int)(N); i++)\n#define rep1rev(i, N) for (int i = (int)(N); i >= 0; i--)\n#define forbe(i, b, e) for (int i = (b); i < (e); i++)\n#define forberev(i, b, e) for (int i = (e)-1; i >= (b); i--)\n#define forfl(i, f, l) for (int i = (f); i <= (l); i++)\n#define forflrev(i, f, l) for (int i = (l); i >= (f); i--)\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pil = pair<int, ll>;\nusing pli = pair<ll, int>;\nusing pll = pair<ll, ll>;\n\ntemplate <typename T>\nbool chmax(T &m, const T q)\n{\n if (m < q)\n {\n m = q;\n return true;\n }\n else\n return false;\n}\ntemplate <typename T>\nbool chmin(T &m, const T q)\n{\n if (m > q)\n {\n m = q;\n return true;\n }\n else\n return false;\n}\ntemplate <typename T1, typename T2>\npair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first + r.first, l.second + r.second}; }\ntemplate <typename T1, typename T2>\npair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first - r.first, l.second - r.second}; }\ntemplate <typename T>\npair<T, T> operator*(const pair<T, T> &l, const T &r) { return {l.first * r, l.second * r}; }\ntemplate <typename T>\npair<T, T> operator/(const pair<T, T> &l, const T &r) { return {l.first / r, l.second / r}; }\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &vec)\n{\n for (auto &v : vec)\n is >> v;\n return is;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &vec)\n{\n os << \"[\";\n for (auto v : vec)\n os << v << \",\";\n os << \"]\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const deque<T> &vec)\n{\n os << \"deq[\";\n for (auto v : vec)\n os << v << \",\";\n os << \"]\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const set<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const unordered_set<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const multiset<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const unordered_multiset<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &pa)\n{\n is >> pa.first >> pa.second;\n return is;\n}\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &pa)\n{\n os << \"(\" << pa.first << \",\" << pa.second << \")\";\n return os;\n}\ntemplate <typename... Ts>\nistream &operator>>(istream &is, tuple<Ts...> &theTuple)\n{\n apply([&is](Ts &... tupleArgs) { ((is >> tupleArgs), ...); }, theTuple);\n return is;\n}\ntemplate <typename... Ts>\nostream &operator<<(ostream &os, const tuple<Ts...> &theTuple)\n{\n apply([&os](const Ts &... tupleArgs) {\n os << '(';\n size_t n(0);\n ((os << tupleArgs << (++n < sizeof...(Ts) ? \",\" : \"\")), ...);\n os << ')';\n },\n theTuple);\n return os;\n}\ntemplate <typename TK, typename TV>\nostream &operator<<(ostream &os, const map<TK, TV> &mp)\n{\n os << \"{\";\n for (auto v : mp)\n os << v.first << \"=>\" << v.second << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename TK, typename TV>\nostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp)\n{\n os << \"{\";\n for (auto v : mp)\n os << v.first << \"=>\" << v.second << \",\";\n os << \"}\";\n return os;\n}\n\ntemplate <typename T>\nvoid reset(vector<T> &v, const T reset_to)\n{\n for (auto &x : v)\n x = reset_to;\n}\ninline int popcount(const unsigned int x) { return __builtin_popcount(x); }\n#define dbg(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \") \" << __FILE__ << endl;\n\nll nC2(ll n)\n{\n return n * (n - 1) / 2;\n}\n\nconst int intinf = numeric_limits<int>::max();\nconst ll llinf = numeric_limits<ll>::max();\nconst pii udlr[4] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\n\n////////////////////////////// End Macros\n\n// Graph.h start--------------------------------------------\n\n#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename Weight>\nstruct Vertex;\ntemplate <typename Weight>\nstruct Edge;\n\ntemplate <typename Weight>\nstruct Vertex\n{\n int id;\n long long l;\n vector<int> ids_dst;\n vector<Edge<Weight>> edges;\n\n Vertex(const int id = 0) : id(id){};\n int &operator[](int n) { return ids_dst[n]; }\n const int &operator[](int n) const { return ids_dst[n]; }\n\n size_t size() const { return edges.size(); }\n void add_edge(const Edge<Weight> &);\n};\n\ntemplate <typename Weight>\nstruct Edge\n{\n int id_src, id_dst;\n Weight weight;\n\n Edge(const int id_src, const int id_dst) : id_src(id_src), id_dst(id_dst){};\n Edge(const int id_src, const int id_dst, const Weight weight) : id_src(id_src), id_dst(id_dst), weight(weight){};\n};\ntemplate <typename Weight>\nostream &operator<<(ostream &os, const Edge<Weight> &e) { return os << \"Edge(\" << e.id_src << \"->\" << e.id_dst << \",\" << e.weight << \")\"; }\n\ntemplate <typename Weight = long long>\nstruct Graph\n{\n vector<Vertex<Weight>> vertices;\n vector<Edge<Weight>> edges;\n\n Graph(const int nvertices = 0);\n Vertex<Weight> &operator[](int n) { return vertices[n]; }\n const Vertex<Weight> &operator[](int n) const { return vertices[n]; }\n\n size_t size() const { return vertices.size(); }\n void add_edge(const Edge<Weight> &);\n void add_edge(const int id_src, const int id_dst) { add_edge({id_src, id_dst}); };\n void add_edge(const int id_src, const int id_dst, const Weight w) { add_edge({id_src, id_dst, w}); };\n};\ntemplate <typename Weight>\nostream &operator<<(ostream &os, const Graph<Weight> &g)\n{\n cout << \"Graph(\" << g.size() << \")\"\n << \"[\" << endl;\n for (auto &e : g.edges)\n os << \" \" << e << \",\" << endl;\n cout << \"]\";\n return os;\n}\n\n//----------------------------------------------------------\n\ntemplate <typename Weight>\nvoid Vertex<Weight>::add_edge(const Edge<Weight> &e)\n{\n edges.push_back(e);\n ids_dst.push_back(e.id_dst);\n}\n\ntemplate <typename Weight>\nbool operator<(const Edge<Weight> &e1, const Edge<Weight> &e2)\n{\n return e1.weight != e2.weight ? e1.weight > e2.weight : // !!INVERSE!!\n e1.id_src != e2.id_src ? e1.id_src < e2.id_src : e1.id_dst < e2.id_dst;\n}\n\ntemplate <typename Weight>\nGraph<Weight>::Graph(const int nvertices)\n{\n for (int id = 0; id < nvertices; id++)\n vertices.emplace_back(id);\n}\ntemplate <typename Weight>\nvoid Graph<Weight>::add_edge(const Edge<Weight> &e)\n{\n edges.push_back(e);\n vertices[e.id_src].add_edge(e);\n}\n\ntemplate <typename Weight>\nGraph<Weight> make_tree(Graph<Weight> &g)\n{\n int nvertices = g.size();\n Graph<Weight> g_tree(nvertices);\n queue<int> q;\n vector<bool> is_used(nvertices, false);\n\n int v_start = 0;\n q.push(v_start);\n is_used[v_start] = true;\n while (!q.empty())\n {\n int v = q.front();\n q.pop();\n for (int c : g[v].ids_dst)\n {\n if (is_used[c])\n continue;\n g_tree.add_edge(v, c);\n g_tree.add_edge(c, v);\n q.push(c);\n is_used[c] = true;\n }\n }\n\n return g_tree;\n}\n\n// Graph.h end----------------------------------------------\n\n// Rerooting.h start--------------------------------------------\n\n#include <vector>\n#include <set>\n\ntemplate <typename Weight>\nstruct Rerooting\n{\n const vector<Vertex<Weight>> &vertices;\n\n // edit from here ----------------------------------------------------\n struct DP\n {\n long long b;\n ll sum_l;\n DP() : b(0), sum_l(0){};\n DP &operator+=(const DP &rhs)\n {\n sum_l += rhs.sum_l;\n b += rhs.b;\n return *this;\n }\n // DP &operator-=(const DP &rhs)\n // {\n // sum_l -= rhs.sum_l;\n // b -= rhs.b;\n // return *this;\n // }\n inline DP operator+(const DP &rhs) const\n {\n return DP(*this) += rhs;\n }\n // inline DP operator-(const DP &rhs) const\n // {\n // return DP(*this) -= rhs;\n // }\n };\n DP add_root(DP dp, const int v)\n {\n dp.b += dp.sum_l;\n dp.sum_l += vertices[v].l;\n return dp;\n }\n\n // edit until here ----------------------------------------------------\n\n vector<vector<DP>> dp;\n vector<DP> ans;\n Rerooting(const Graph<Weight> &g) : vertices(g.vertices), dp(g.size()), ans(g.size()){};\n\n void init()\n {\n const int root_init = 0;\n dfs(root_init);\n bfs(root_init);\n }\n DP dfs(int v, int parent = -1)\n {\n DP dp_sum;\n int n = vertices[v].size();\n dp[v] = vector<DP>(n);\n for (int i = 0; i < n; i++)\n {\n const int child = vertices[v][i];\n if (child == parent)\n continue;\n dp_sum += dp[v][i] = dfs(child, v);\n }\n return add_root(dp_sum, v);\n }\n void bfs(int v, int parent = -1, const DP &dp_parent = DP())\n {\n const int n = vertices[v].size();\n for (int i = 0; i < n; i++)\n if (vertices[v][i] == parent)\n dp[v][i] = dp_parent;\n\n vector<DP> dp_sum_left(n + 1);\n for (int i = 0; i < n; i++)\n dp_sum_left[i + 1] = dp_sum_left[i] + dp[v][i];\n vector<DP> dp_sum_right(n + 1);\n for (int i = n - 1; i >= 0; i--)\n dp_sum_right[i] = dp[v][i] + dp_sum_right[i + 1];\n\n ans[v] = add_root(dp_sum_left[n], v);\n\n for (int i = 0; i < n; i++)\n {\n int child = vertices[v][i];\n if (child == parent)\n continue;\n const DP dp_sum_without_i = dp_sum_left[i] + dp_sum_right[i + 1];\n bfs(child, v, add_root(dp_sum_without_i, v));\n }\n }\n};\n\n// Rerooting.h end----------------------------------------------\n\nvoid solve()\n{\n int N;\n cin >> N;\n Graph g(N);\n rep(i, N)\n {\n int l;\n cin >> l;\n g[i].l = l;\n }\n rep(i, N - 1)\n {\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n g.add_edge(a, b);\n g.add_edge(b, a);\n }\n\n Rerooting rt(g);\n rt.init();\n auto ans = rt.ans;\n rep(i, N)\n {\n cout << ans[i].b << endl;\n }\n}\n\nint main()\n{\n cout << fixed << setprecision(15);\n\n solve();\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":51440,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_3163_4876858","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n////////////////////////////// Begin Macros\n\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define in(x, a, b) (a <= x and x < b)\n#define rep(i, N) for (int i = 0; i < (int)(N); i++)\n#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i--)\n#define rep1(i, N) for (int i = 1; i <= (int)(N); i++)\n#define rep1rev(i, N) for (int i = (int)(N); i >= 0; i--)\n#define forbe(i, b, e) for (int i = (b); i < (e); i++)\n#define forberev(i, b, e) for (int i = (e)-1; i >= (b); i--)\n#define forfl(i, f, l) for (int i = (f); i <= (l); i++)\n#define forflrev(i, f, l) for (int i = (l); i >= (f); i--)\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pil = pair<int, ll>;\nusing pli = pair<ll, int>;\nusing pll = pair<ll, ll>;\n\ntemplate <typename T>\nbool chmax(T &m, const T q)\n{\n if (m < q)\n {\n m = q;\n return true;\n }\n else\n return false;\n}\ntemplate <typename T>\nbool chmin(T &m, const T q)\n{\n if (m > q)\n {\n m = q;\n return true;\n }\n else\n return false;\n}\ntemplate <typename T1, typename T2>\npair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first + r.first, l.second + r.second}; }\ntemplate <typename T1, typename T2>\npair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first - r.first, l.second - r.second}; }\ntemplate <typename T>\npair<T, T> operator*(const pair<T, T> &l, const T &r) { return {l.first * r, l.second * r}; }\ntemplate <typename T>\npair<T, T> operator/(const pair<T, T> &l, const T &r) { return {l.first / r, l.second / r}; }\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &vec)\n{\n for (auto &v : vec)\n is >> v;\n return is;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &vec)\n{\n os << \"[\";\n for (auto v : vec)\n os << v << \",\";\n os << \"]\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const deque<T> &vec)\n{\n os << \"deq[\";\n for (auto v : vec)\n os << v << \",\";\n os << \"]\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const set<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const unordered_set<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const multiset<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const unordered_multiset<T> &vec)\n{\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &pa)\n{\n is >> pa.first >> pa.second;\n return is;\n}\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &pa)\n{\n os << \"(\" << pa.first << \",\" << pa.second << \")\";\n return os;\n}\ntemplate <typename... Ts>\nistream &operator>>(istream &is, tuple<Ts...> &theTuple)\n{\n apply([&is](Ts &... tupleArgs) { ((is >> tupleArgs), ...); }, theTuple);\n return is;\n}\ntemplate <typename... Ts>\nostream &operator<<(ostream &os, const tuple<Ts...> &theTuple)\n{\n apply([&os](const Ts &... tupleArgs) {\n os << '(';\n size_t n(0);\n ((os << tupleArgs << (++n < sizeof...(Ts) ? \",\" : \"\")), ...);\n os << ')';\n },\n theTuple);\n return os;\n}\ntemplate <typename TK, typename TV>\nostream &operator<<(ostream &os, const map<TK, TV> &mp)\n{\n os << \"{\";\n for (auto v : mp)\n os << v.first << \"=>\" << v.second << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename TK, typename TV>\nostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp)\n{\n os << \"{\";\n for (auto v : mp)\n os << v.first << \"=>\" << v.second << \",\";\n os << \"}\";\n return os;\n}\n\ntemplate <typename T>\nvoid reset(vector<T> &v, const T reset_to)\n{\n for (auto &x : v)\n x = reset_to;\n}\ninline int popcount(const unsigned int x) { return __builtin_popcount(x); }\n#define dbg(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \") \" << __FILE__ << endl;\n\nll nC2(ll n)\n{\n return n * (n - 1) / 2;\n}\n\nconst int intinf = numeric_limits<int>::max();\nconst ll llinf = numeric_limits<ll>::max();\nconst pii udlr[4] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\n\n////////////////////////////// End Macros\n\n// Graph.h start--------------------------------------------\n\n#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename Weight>\nstruct Vertex;\ntemplate <typename Weight>\nstruct Edge;\n\ntemplate <typename Weight>\nstruct Vertex\n{\n int id;\n long long l;\n vector<int> ids_dst;\n vector<Edge<Weight>> edges;\n\n Vertex(const int id = 0) : id(id){};\n int &operator[](int n) { return ids_dst[n]; }\n const int &operator[](int n) const { return ids_dst[n]; }\n\n size_t size() const { return edges.size(); }\n void add_edge(const Edge<Weight> &);\n};\n\ntemplate <typename Weight>\nstruct Edge\n{\n int id_src, id_dst;\n Weight weight;\n\n Edge(const int id_src, const int id_dst) : id_src(id_src), id_dst(id_dst){};\n Edge(const int id_src, const int id_dst, const Weight weight) : id_src(id_src), id_dst(id_dst), weight(weight){};\n};\ntemplate <typename Weight>\nostream &operator<<(ostream &os, const Edge<Weight> &e) { return os << \"Edge(\" << e.id_src << \"->\" << e.id_dst << \",\" << e.weight << \")\"; }\n\ntemplate <typename Weight = long long>\nstruct Graph\n{\n vector<Vertex<Weight>> vertices;\n vector<Edge<Weight>> edges;\n\n Graph(const int nvertices = 0);\n Vertex<Weight> &operator[](int n) { return vertices[n]; }\n const Vertex<Weight> &operator[](int n) const { return vertices[n]; }\n\n size_t size() const { return vertices.size(); }\n void add_edge(const Edge<Weight> &);\n void add_edge(const int id_src, const int id_dst) { add_edge({id_src, id_dst}); };\n void add_edge(const int id_src, const int id_dst, const Weight w) { add_edge({id_src, id_dst, w}); };\n};\ntemplate <typename Weight>\nostream &operator<<(ostream &os, const Graph<Weight> &g)\n{\n cout << \"Graph(\" << g.size() << \")\"\n << \"[\" << endl;\n for (auto &e : g.edges)\n os << \" \" << e << \",\" << endl;\n cout << \"]\";\n return os;\n}\n\n//----------------------------------------------------------\n\ntemplate <typename Weight>\nvoid Vertex<Weight>::add_edge(const Edge<Weight> &e)\n{\n edges.push_back(e);\n ids_dst.push_back(e.id_dst);\n}\n\ntemplate <typename Weight>\nbool operator<(const Edge<Weight> &e1, const Edge<Weight> &e2)\n{\n return e1.weight != e2.weight ? e1.weight > e2.weight : // !!INVERSE!!\n e1.id_src != e2.id_src ? e1.id_src < e2.id_src : e1.id_dst < e2.id_dst;\n}\n\ntemplate <typename Weight>\nGraph<Weight>::Graph(const int nvertices)\n{\n for (int id = 0; id < nvertices; id++)\n vertices.emplace_back(id);\n}\ntemplate <typename Weight>\nvoid Graph<Weight>::add_edge(const Edge<Weight> &e)\n{\n edges.push_back(e);\n vertices[e.id_src].add_edge(e);\n}\n\ntemplate <typename Weight>\nGraph<Weight> make_tree(Graph<Weight> &g)\n{\n int nvertices = g.size();\n Graph<Weight> g_tree(nvertices);\n queue<int> q;\n vector<bool> is_used(nvertices, false);\n\n int v_start = 0;\n q.push(v_start);\n is_used[v_start] = true;\n while (!q.empty())\n {\n int v = q.front();\n q.pop();\n for (int c : g[v].ids_dst)\n {\n if (is_used[c])\n continue;\n g_tree.add_edge(v, c);\n g_tree.add_edge(c, v);\n q.push(c);\n is_used[c] = true;\n }\n }\n\n return g_tree;\n}\n\n// Graph.h end----------------------------------------------\n\n// Rerooting.h start--------------------------------------------\n\n#include <vector>\n#include <set>\n\ntemplate <typename Weight>\nstruct Rerooting\n{\n const vector<Vertex<Weight>> &vertices;\n\n // edit from here ----------------------------------------------------\n struct DP\n {\n long long b;\n ll sum_l;\n DP() : b(0), sum_l(0){};\n DP &operator+=(const DP &rhs)\n {\n sum_l += rhs.sum_l;\n b += rhs.b + rhs.sum_l;\n return *this;\n }\n DP &operator-=(const DP &rhs)\n {\n sum_l -= rhs.sum_l;\n b -= rhs.b + rhs.sum_l;\n return *this;\n }\n inline DP operator+(const DP &rhs) const\n {\n return DP(*this) += rhs;\n }\n inline DP operator-(const DP &rhs) const\n {\n return DP(*this) -= rhs;\n }\n };\n DP add_root(DP dp, const int v)\n {\n dp.sum_l += vertices[v].l;\n return dp;\n }\n\n // edit until here ----------------------------------------------------\n\n vector<vector<DP>> dp;\n vector<DP> ans;\n Rerooting(const Graph<Weight> &g) : vertices(g.vertices), dp(g.size()), ans(g.size()){};\n\n void init()\n {\n const int root_init = 0;\n dfs(root_init);\n bfs(root_init);\n }\n DP dfs(int v, int parent = -1)\n {\n DP dp_sum;\n int n = vertices[v].size();\n dp[v] = vector<DP>(n);\n for (int i = 0; i < n; i++)\n {\n const int child = vertices[v][i];\n if (child == parent)\n continue;\n dp_sum += dp[v][i] = dfs(child, v);\n }\n return add_root(dp_sum, v);\n }\n\n void bfs(int v, int parent = -1, const DP &dp_parent = DP())\n {\n const int n = vertices[v].size();\n for (int i = 0; i < n; i++)\n if (vertices[v][i] == parent)\n dp[v][i] = dp_parent;\n\n DP dp_sum;\n for (int i = 0; i < n; i++)\n dp_sum += dp[v][i];\n\n ans[v] = add_root(dp_sum, v);\n for (int i = 0; i < n; i++)\n {\n int child = vertices[v][i];\n if (child == parent)\n continue;\n const DP dp_sum_without_i = dp_sum - dp[v][i];\n bfs(child, v, add_root(dp_sum_without_i, v));\n }\n }\n};\n\n// Rerooting.h end----------------------------------------------\n\nvoid solve()\n{\n int N;\n cin >> N;\n Graph g(N);\n rep(i, N)\n {\n int l;\n cin >> l;\n g[i].l = l;\n }\n rep(i, N - 1)\n {\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n g.add_edge(a, b);\n g.add_edge(b, a);\n }\n\n Rerooting rt(g);\n rt.init();\n auto ans = rt.ans;\n rep(i, N)\n {\n cout << ans[i].b << endl;\n }\n}\n\nint main()\n{\n cout << fixed << setprecision(15);\n\n solve();\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":40896,"score_of_the_acc":-1.6658,"final_rank":19},{"submission_id":"aoj_3163_4875922","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\nconst int N = 100010;\nll L[N];\nvector<int> G[N];\n\nll sL = 0;\n\nll s[N], d[N];\nvoid calc(int v, int p) {\n s[v] = L[v];\n for (int e : G[v])\n if (e != p) {\n d[e] = d[v] + 1;\n calc(e, v);\n s[v] += s[e];\n }\n}\n\nll ans[N];\nvoid dfs(int v, int p, ll now) {\n ans[v] = now;\n for (int e : G[v])\n if (e != p) {\n ll t = now - s[e] + (sL - s[e]);\n dfs(e, v, t);\n }\n}\n\nint main() {\n int n;\n cin >> n;\n rep(i, n) {\n cin >> L[i];\n sL += L[i];\n }\n rep(i, n - 1) {\n int a, b;\n cin >> a >> b;\n --a;\n --b;\n G[a].pb(b);\n G[b].pb(a);\n }\n\n calc(0, -1);\n\n ll v0 = 0;\n rep(i, n) v0 += L[i] * d[i];\n\n dfs(0, -1, v0);\n\n rep(i, n) cout << ans[i] << \"\\n\";\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":16988,"score_of_the_acc":-0.5924,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_3163_10092502\",\n \"code_snippet\": \"// AOJ #3163\\n// Star Gazer 2025.1.11\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 最大 10^5 頂点想定 (問題制約)\\nstatic const int MAXN = 100005;\\n\\n// 各頂点の明るさ、部分木の明るさ合計、beauty(distSum) を格納\\nlong long L[MAXN+1]; // brightness\\nlong long subB[MAXN+1]; // uの部分木に含まれるすべての頂点の明るさ合計\\nlong long distSum[MAXN+1]; // beauty(u)\\n\\n// 全頂点の明るさ合計\\nlong long sumAll = 0;\\n\\n// 木の隣接リスト\\nvector<int> g[MAXN+1];\\n\\nint N;\\n\\n// dfs1: 根を 1 として、distSum[1] と subB[u] をまとめて計算\\n// d は「(仮の)根1 からの深さ」 = 距離\\nvoid dfs1(int u, int parent, int depth) {\\n // beauty(1) に l[u] * depth を足す\\n distSum[1] += L[u] * depth;\\n\\n // 部分木の明るさを初期化\\n subB[u] = L[u];\\n\\n // 子頂点へ\\n for (auto &w : g[u]) {\\n if (w == parent) continue;\\n\\n dfs1(w, u, depth + 1);\\n subB[u] += subB[w]; // 子の部分木を親に加算\\n }\\n}\\n\\n// dfs2: 親 -> 子 で「再根付き」\\n// parent = -1 はダミー (根)\\nvoid dfs2(int u, int parent) {\\n // 子頂点 w について「根を u から w へ移す(再根付き)」ときの beauty(w) を計算\\n for (auto &w : g[u]) {\\n if (w == parent) continue;\\n\\n // 親u の beauty(u) をもとに、再根付きで beauty(w) を更新\\n distSum[w] = distSum[u] + (sumAll - 2 * subB[w]);\\n\\n // 再帰的に処理\\n dfs2(w, u);\\n }\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n\\n cin >> N;\\n for(int i = 1; i <= N; i++){\\n cin >> L[i];\\n sumAll += L[i];\\n }\\n\\n // 辺の入力\\n for(int i = 0; i < N - 1; i++){\\n int a, b;\\n cin >> a >> b;\\n // 無向グラフ(=木)\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n\\n // 1. dfs1 で beauty(1) と subB を計算\\n dfs1(1, -1, 0);\\n\\n // 2. dfs2 で「再根付き」により distSum(beauty) を求める\\n dfs2(1, -1);\\n\\n // 出力\\n for(int i = 1; i <= N; i++){\\n cout << distSum[i] << \\\"\\\\n\\\";\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 16456,\n \"score_of_the_acc\": -0.1123,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3163_10086570\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/3163\\n#include <cstdint>\\n#include <iostream>\\n#include <utility>\\n#include <vector>\\n/**\\n * @brief 重み付きグラフ\\n *\\n * @tparam T 辺の重みの型\\n */\\ntemplate <class T>\\nstruct Graph {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to(), _weight() {}\\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr T weight() const { return _weight; }\\n private:\\n int _from, _to;\\n T _weight;\\n };\\n public:\\n using edge_type = typename Graph<T>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\\n void add_edges(int from, int to, T weight = T(1)) {\\n edges[from].emplace_back(from, to, weight);\\n edges[to].emplace_back(to, from, weight);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edge(from - base, to - base, weight);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edges(from - base, to - base, weight);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\ntemplate <>\\nstruct Graph<void> {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to() {}\\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr int weight() const { return 1; }\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n private:\\n int _from, _to;\\n };\\n public:\\n using edge_type = typename Graph<void>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\\n void add_edges(int from, int to) {\\n edges[from].emplace_back(from, to);\\n edges[to].emplace_back(to, from);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edge(from - base, to - base);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edges(from - base, to - base);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\n/// @brief 全方位木dp\\n/// @see https://algo-logic.info/tree-dp/\\ntemplate <class M, class T, class U>\\nstruct ReRooting {\\n private:\\n using Value = typename M::value_type;\\n public:\\n ReRooting(const Graph<T> &g, const std::vector<U> &v)\\n : graph(g), data(v), dp(g.size()), values(g.size()) {\\n build();\\n }\\n const auto &operator[](int i) const { return values[i]; }\\n auto &operator[](int i) { return values[i]; }\\n const auto begin() const { return values.begin(); }\\n auto begin() { return values.begin(); }\\n const auto end() const { return values.end(); }\\n auto end() { return values.end(); }\\n private:\\n Graph<T> graph;\\n const std::vector<U> &data;\\n std::vector<std::vector<Value>> dp;\\n std::vector<Value> values;\\n void build() {\\n dfs(0);\\n bfs(0);\\n }\\n Value dfs(int v, int p = -1) {\\n Value res = M::id();\\n int deg = graph[v].size();\\n dp[v] = std::vector<Value>(deg, M::id());\\n for (int i = 0; i < deg; ++i) {\\n auto e = graph[v][i];\\n if (e.to() == p) continue;\\n dp[v][i] = M::f(dfs(e.to(), v), e.weight());\\n res = M::op(res, dp[v][i]);\\n }\\n return M::g(res, data[v]);\\n }\\n void bfs(int v, int p = -1, Value dp_p = M::id()) {\\n int deg = graph[v].size();\\n std::vector<Value> dp_r(deg + 1, M::id());\\n for (int i = deg - 1; i >= 0; --i) {\\n auto e = graph[v][i];\\n if (e.to() == p) dp[v][i] = M::f(dp_p, e.weight());\\n dp_r[i] = M::op(dp[v][i], dp_r[i + 1]);\\n }\\n Value dp_l = M::id();\\n for (int i = 0; i < deg; ++i) {\\n int u = graph[v][i].to();\\n if (u != p) bfs(u, v, M::g(M::op(dp_l, dp_r[i + 1]), data[v]));\\n dp_l = M::op(dp_l, dp[v][i]);\\n }\\n values[v] = M::g(dp_l, v);\\n }\\n};\\nstruct Monoid {\\n using T = std::pair<std::int64_t, std::int64_t>;\\n using value_type = T;\\n static constexpr T id() {\\n return {0, 0};\\n };\\n static constexpr T op(const T &lhs, const T &rhs) {\\n return {lhs.first + rhs.first, lhs.second + rhs.second};\\n }\\n template <class U>\\n static constexpr T f(const T &v, U u) {\\n return {v.first + v.second, v.second};\\n }\\n template <class U>\\n static constexpr T g(const T &v, U u) {\\n return {v.first, v.second + u};\\n }\\n};\\nint main(void) {\\n int n;\\n std::cin >> n;\\n std::vector<std::int64_t> a(n);\\n for (auto &e : a) std::cin >> e;\\n Graph<void> g(n);\\n g.input_edges(n - 1);\\n ReRooting<Monoid, void, std::int64_t> rr(g, a);\\n for (int i = 0; i < n; ++i) std::cout << rr[i].first << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 37640,\n \"score_of_the_acc\": -1.0498,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3163_10086558\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <iostream>\\n#include <vector>\\n/**\\n * @brief 重み付きグラフ\\n *\\n * @tparam T 辺の重みの型\\n */\\ntemplate <class T>\\nstruct Graph {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to(), _weight() {}\\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr T weight() const { return _weight; }\\n private:\\n int _from, _to;\\n T _weight;\\n };\\n public:\\n using edge_type = typename Graph<T>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\\n void add_edges(int from, int to, T weight = T(1)) {\\n edges[from].emplace_back(from, to, weight);\\n edges[to].emplace_back(to, from, weight);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edge(from - base, to - base, weight);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edges(from - base, to - base, weight);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\ntemplate <>\\nstruct Graph<void> {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to() {}\\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr int weight() const { return 1; }\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n private:\\n int _from, _to;\\n };\\n public:\\n using edge_type = typename Graph<void>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\\n void add_edges(int from, int to) {\\n edges[from].emplace_back(from, to);\\n edges[to].emplace_back(to, from);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edge(from - base, to - base);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edges(from - base, to - base);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\n/// @brief 全方位木dp\\n/// @see https://algo-logic.info/tree-dp/\\ntemplate <class M, class T, class U>\\nstruct ReRooting {\\n private:\\n using Value = typename M::value_type;\\n public:\\n ReRooting(const Graph<T> &g, const std::vector<U> &v)\\n : graph(g), data(v), dp(g.size()), values(g.size()) {\\n build();\\n }\\n const auto &operator[](int i) const { return values[i]; }\\n auto &operator[](int i) { return values[i]; }\\n const auto begin() const { return values.begin(); }\\n auto begin() { return values.begin(); }\\n const auto end() const { return values.end(); }\\n auto end() { return values.end(); }\\n private:\\n Graph<T> graph;\\n const std::vector<U> &data;\\n std::vector<std::vector<Value>> dp;\\n std::vector<Value> values;\\n void build() {\\n dfs(0);\\n bfs(0);\\n }\\n Value dfs(int v, int p = -1) {\\n Value res = M::id();\\n int deg = graph[v].size();\\n dp[v] = std::vector<Value>(deg, M::id());\\n for (int i = 0; i < deg; ++i) {\\n auto e = graph[v][i];\\n if (e.to() == p) continue;\\n dp[v][i] = M::f(dfs(e.to(), v), e.weight());\\n res = M::op(res, dp[v][i]);\\n }\\n return M::g(res, data[v]);\\n }\\n void bfs(int v, int p = -1, Value dp_p = M::id()) {\\n int deg = graph[v].size();\\n std::vector<Value> dp_r(deg + 1, M::id());\\n for (int i = deg - 1; i >= 0; --i) {\\n auto e = graph[v][i];\\n if (e.to() == p) dp[v][i] = M::f(dp_p, e.weight());\\n dp_r[i] = M::op(dp[v][i], dp_r[i + 1]);\\n }\\n Value dp_l = M::id();\\n for (int i = 0; i < deg; ++i) {\\n int u = graph[v][i].to();\\n if (u != p) bfs(u, v, M::g(M::op(dp_l, dp_r[i + 1]), data[v]));\\n dp_l = M::op(dp_l, dp[v][i]);\\n }\\n values[v] = M::g(dp_l, v);\\n }\\n};\\nstruct Monoid {\\n using T = pair<ll, ll>;\\n using value_type = T;\\n static constexpr T id() {\\n return {0, 0};\\n };\\n static constexpr T op(const T &lhs, const T &rhs) {\\n return {lhs.first + rhs.first, lhs.second + rhs.second};\\n }\\n template <class U>\\n static constexpr T f(const T &v, U u) {\\n return {v.first + v.second, v.second};\\n }\\n template <class U>\\n static constexpr T g(const T &v, U u) {\\n return {v.first, v.second + u};\\n }\\n};\\nint main(void) {\\n int n;\\n cin >> n;\\n vector<ll> a(n);\\n cin >> a;\\n Graph<void> g(n);\\n g.input_edges(n - 1);\\n ReRooting<Monoid, void, ll> rr(g, a);\\n rep (i, n) co(rr[i].first);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 37752,\n \"score_of_the_acc\": -0.8527,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3163_10086546\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <iostream>\\n#include <vector>\\n/**\\n * @brief 重み付きグラフ\\n *\\n * @tparam T 辺の重みの型\\n */\\ntemplate <class T>\\nstruct Graph {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to(), _weight() {}\\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr T weight() const { return _weight; }\\n private:\\n int _from, _to;\\n T _weight;\\n };\\n public:\\n using edge_type = typename Graph<T>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\\n void add_edges(int from, int to, T weight = T(1)) {\\n edges[from].emplace_back(from, to, weight);\\n edges[to].emplace_back(to, from, weight);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edge(from - base, to - base, weight);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edges(from - base, to - base, weight);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\ntemplate <>\\nstruct Graph<void> {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to() {}\\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr int weight() const { return 1; }\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n private:\\n int _from, _to;\\n };\\n public:\\n using edge_type = typename Graph<void>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\\n void add_edges(int from, int to) {\\n edges[from].emplace_back(from, to);\\n edges[to].emplace_back(to, from);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edge(from - base, to - base);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edges(from - base, to - base);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\n/**\\n * @brief 全方位木dp\\n * @see https://algo-logic.info/tree-dp/\\n *\\n * @tparam M モノイド\\n * @tparam T 辺の重みの型\\n */\\ntemplate <class M, class U, class T>\\nstruct ReRooting {\\n private:\\n using Value = typename M::value_type;\\n public:\\n ReRooting(const Graph<T> &g, const std::vector<U> &v)\\n : graph(g), data(v), dp(g.size()), values(g.size()) {\\n build();\\n }\\n const auto &operator[](int i) const { return values[i]; }\\n auto &operator[](int i) { return values[i]; }\\n const auto begin() const { return values.begin(); }\\n auto begin() { return values.begin(); }\\n const auto end() const { return values.end(); }\\n auto end() { return values.end(); }\\n private:\\n Graph<T> graph;\\n const std::vector<U> &data;\\n std::vector<std::vector<Value>> dp;\\n std::vector<Value> values;\\n void build() {\\n dfs(0);\\n bfs(0);\\n }\\n Value dfs(int v, int p = -1) {\\n Value res = M::id();\\n int deg = graph[v].size();\\n dp[v] = std::vector<Value>(deg, M::id());\\n for (int i = 0; i < deg; ++i) {\\n auto e = graph[v][i];\\n if (e.to() == p) continue;\\n dp[v][i] = M::f(dfs(e.to(), v), e.weight());\\n res = M::op(res, dp[v][i]);\\n }\\n return M::g(res, data[v]);\\n }\\n void bfs(int v, int p = -1, Value dp_p = M::id()) {\\n int deg = graph[v].size();\\n std::vector<Value> dp_r(deg + 1, M::id());\\n for (int i = deg - 1; i >= 0; --i) {\\n auto e = graph[v][i];\\n if (e.to() == p) dp[v][i] = M::f(dp_p, e.weight());\\n dp_r[i] = M::op(dp[v][i], dp_r[i + 1]);\\n }\\n Value dp_l = M::id();\\n for (int i = 0; i < deg; ++i) {\\n int u = graph[v][i].to();\\n if (u != p) bfs(u, v, M::g(M::op(dp_l, dp_r[i + 1]), data[v]));\\n dp_l = M::op(dp_l, dp[v][i]);\\n }\\n values[v] = M::g(dp_l, v);\\n }\\n};\\nstruct Monoid {\\n using T = pair<ll, ll>;\\n using value_type = T;\\n static constexpr T id() {\\n return {0, 0};\\n };\\n static constexpr T op(const T &lhs, const T &rhs) {\\n return {lhs.first + rhs.first, lhs.second + rhs.second};\\n }\\n template <class U>\\n static constexpr T f(const T &v, U u) {\\n return {v.first + v.second, v.second};\\n }\\n template <class U>\\n static constexpr T g(const T &v, U u) {\\n return {v.first, v.second + u};\\n }\\n};\\nint main(void) {\\n int n;\\n cin >> n;\\n vector<ll> a(n);\\n cin >> a;\\n Graph<void> g(n);\\n g.input_edges(n - 1);\\n ReRooting<Monoid, ll, void> rr(g, a);\\n rep (i, n) co(rr[i].first);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 37712,\n \"score_of_the_acc\": -0.8516,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3163_10086513\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <iostream>\\n#include <vector>\\n/**\\n * @brief 重み付きグラフ\\n *\\n * @tparam T 辺の重みの型\\n */\\ntemplate <class T>\\nstruct Graph {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to(), _weight() {}\\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr T weight() const { return _weight; }\\n private:\\n int _from, _to;\\n T _weight;\\n };\\n public:\\n using edge_type = typename Graph<T>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\\n void add_edges(int from, int to, T weight = T(1)) {\\n edges[from].emplace_back(from, to, weight);\\n edges[to].emplace_back(to, from, weight);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edge(from - base, to - base, weight);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edges(from - base, to - base, weight);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\ntemplate <>\\nstruct Graph<void> {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to() {}\\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr int weight() const { return 1; }\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n private:\\n int _from, _to;\\n };\\n public:\\n using edge_type = typename Graph<void>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\\n void add_edges(int from, int to) {\\n edges[from].emplace_back(from, to);\\n edges[to].emplace_back(to, from);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edge(from - base, to - base);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edges(from - base, to - base);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\n/**\\n * @brief 全方位木dp\\n * @see https://algo-logic.info/tree-dp/\\n *\\n * @tparam M モノイド\\n * @tparam T 辺の重みの型\\n */\\ntemplate <class M, class U, class T>\\nstruct ReRooting {\\n private:\\n using Value = typename M::value_type;\\n public:\\n ReRooting(const Graph<T> &g, const std::vector<U> &v)\\n : graph(g), data(v), dp(g.size()), values(g.size()) {\\n build();\\n }\\n const auto &operator[](int i) const { return values[i]; }\\n auto &operator[](int i) { return values[i]; }\\n const auto begin() const { return values.begin(); }\\n auto begin() { return values.begin(); }\\n const auto end() const { return values.end(); }\\n auto end() { return values.end(); }\\n private:\\n Graph<T> graph;\\n const std::vector<U> &data;\\n std::vector<std::vector<Value>> dp;\\n std::vector<Value> values;\\n void build() {\\n dfs(0);\\n bfs(0);\\n }\\n Value dfs(int v, int p = -1) {\\n Value res = M::id();\\n int deg = graph[v].size();\\n dp[v] = std::vector<Value>(deg, M::id());\\n for (int i = 0; i < deg; ++i) {\\n auto e = graph[v][i];\\n if (e.to() == p) continue;\\n dp[v][i] = M::f(dfs(e.to(), v), e.weight());\\n res = M::op(res, dp[v][i]);\\n }\\n return M::g(res, data[v]);\\n }\\n void bfs(int v, int p = -1, Value dp_p = M::id()) {\\n int deg = graph[v].size();\\n std::vector<Value> dp_r(deg + 1, M::id());\\n for (int i = deg - 1; i >= 0; --i) {\\n auto e = graph[v][i];\\n if (e.to() == p) dp[v][i] = M::f(dp_p, e.weight());\\n dp_r[i] = M::op(dp[v][i], dp_r[i + 1]);\\n }\\n Value dp_l = M::id();\\n for (int i = 0; i < deg; ++i) {\\n int u = graph[v][i].to();\\n if (u != p) bfs(u, v, M::g(M::op(dp_l, dp_r[i + 1]), data[v]));\\n dp_l = M::op(dp_l, dp[v][i]);\\n }\\n values[v] = M::g(dp_l, v);\\n }\\n};\\nstruct Monoid {\\n using value_type = pair<ll, ll>;\\n static constexpr value_type id() {\\n return {0, 0};\\n };\\n static constexpr value_type op(const value_type &lhs, const value_type &rhs) {\\n return {lhs.first + rhs.first, lhs.second + rhs.second};\\n }\\n template <class T>\\n static constexpr value_type f(const value_type &v, T u) {\\n return {v.first + v.second, v.second};\\n }\\n template <class T>\\n static constexpr value_type g(const value_type &v, T u) {\\n return {v.first, v.second + u};\\n }\\n};\\nint main(void) {\\n int n;\\n cin >> n;\\n vector<ll> a(n);\\n cin >> a;\\n Graph<void> g(n);\\n g.input_edges(n - 1);\\n ReRooting<Monoid, ll, void> rr(g, a);\\n rep (i, n) co(rr[i].first);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 37740,\n \"score_of_the_acc\": -0.7857,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3163_9631368\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 1000000000;\\nint main() {\\n int N;\\n cin >> N;\\n vector<int> l(N);\\n for (int i = 0; i < N; i++) {\\n cin >> l[i];\\n }\\n vector<vector<int>> E(N);\\n for (int i = 0; i < N - 1; i++) {\\n int a, b;\\n cin >> a >> b;\\n a--;\\n b--;\\n E[a].push_back(b);\\n E[b].push_back(a);\\n }\\n vector<vector<int>> c(N);\\n vector<int> p(N, -1);\\n vector<int> bfs;\\n queue<int> Q;\\n Q.push(0);\\n while (!Q.empty()) {\\n int v = Q.front();\\n Q.pop();\\n bfs.push_back(v);\\n for (int w : E[v]) {\\n if (w != p[v]) {\\n p[w] = v;\\n c[v].push_back(w);\\n Q.push(w);\\n }\\n }\\n }\\n reverse(bfs.begin(), bfs.end());\\n vector<long long> dp1(N);//部分木のlの合計\\n vector<long long> dp2(N);\\n for (int v : bfs) {\\n for (int w : c[v]) {\\n dp1[v] += dp1[w];\\n dp2[v] += dp2[w];\\n }\\n dp2[v] += dp1[v];\\n dp1[v] += l[v];\\n }\\n reverse(bfs.begin(), bfs.end());\\n vector<long long> dp3(N);\\n dp3[0] = 0;\\n for (int v : bfs) {\\n long long sum = dp2[v];\\n for (int w : c[v]) {\\n long long sum2 = sum - dp2[w];\\n sum2 -= dp1[w];\\n sum2 += dp1[0] - dp1[w];\\n sum2 += dp3[v];\\n dp3[w] = sum2;\\n }\\n }\\n for (int i = 0; i < N; i++) {\\n cout << dp2[i] + dp3[i] << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 17360,\n \"score_of_the_acc\": -0.4019,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3163_9579823\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdint>\\n#include <vector>\\n\\nusing namespace std;\\n\\nvoid calc_sub(vector<uint64_t>& sub_l_sum, vector<uint64_t>& sub_beauty, const vector<vector<uint32_t>>& edges, const vector<uint32_t>& l, const uint32_t cur = 0, const uint32_t from = 0)\\n{\\n\\tsub_l_sum[cur] = l[cur], sub_beauty[cur] = 0;\\n\\tfor (auto edge : edges[cur])\\n\\t\\tif (edge != from)\\n\\t\\t\\tcalc_sub(sub_l_sum, sub_beauty, edges, l, edge, cur), sub_l_sum[cur] += sub_l_sum[edge], sub_beauty[cur] += sub_beauty[edge] + sub_l_sum[edge];\\n}\\n\\nvoid calc_beauty(vector<uint64_t>& beauty, const vector<uint64_t>& sub_l_sum, const vector<uint64_t>& sub_beauty, const vector<vector<uint32_t>>& edges, const uint32_t cur = 0, const uint32_t from = 0)\\n{\\n\\tif (cur == 0) beauty[0] = sub_beauty[0];\\n\\telse beauty[cur] = beauty[from] + sub_l_sum[0] - sub_l_sum[cur] * 2;\\n\\n\\tfor (auto edge : edges[cur])\\n\\t\\tif (edge != from)\\n\\t\\t\\tcalc_beauty(beauty, sub_l_sum, sub_beauty, edges, edge, cur);\\n}\\n\\nint main()\\n{\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\n\\tuint32_t N, i;\\n\\tcin >> N;\\n\\tvector<uint32_t> l(N), a(N - 1), b(N - 1);\\n\\tfor (i = 0; i != N; ++i)\\n\\t\\tcin >> l[i];\\n\\tfor (i = 0; i != N - 1; ++i)\\n\\t\\tcin >> a[i] >> b[i];\\n\\n\\tvector<vector<uint32_t>> edges(N, vector<uint32_t>());\\n\\tvector<uint64_t> sub_l_sum(N), sub_beauty(N), beauty(N);\\n\\tfor (i = 0; i != N - 1; ++i)\\n\\t\\tedges[a[i] - 1].push_back(b[i] - 1), edges[b[i] - 1].push_back(a[i] - 1);\\n\\n\\tcalc_sub(sub_l_sum, sub_beauty, edges, l);\\n\\tcalc_beauty(beauty, sub_l_sum, sub_beauty, edges);\\n\\t\\n\\tfor (i = 0; i != N; ++i) cout << beauty[i] << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 19848,\n \"score_of_the_acc\": -0.1983,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3163_8575509\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repd(i,a,b) for (ll i=(a);i<(b);i++)\\n#define rep(i,n) repd(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntypedef long long ll;\\ntypedef pair<ll,ll> P;\\ntypedef vector<ll> vec;\\nusing Graph = vector<vector<ll>>;\\nconst long long INF = 1LL<<60;\\nconst long long MOD = 1000000007;\\n\\n//https://nyaannyaan.github.io/library/graph/graph-template.hpp\\ntemplate <typename T>\\nstruct edge {\\n int src, to;\\n T cost;\\n\\n edge(int _to, T _cost) : src(-1), to(_to), cost(_cost) {}\\n edge(int _src, int _to, T _cost) : src(_src), to(_to), cost(_cost) {}\\n\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n\\n operator int() const { return to; }\\n};\\ntemplate <typename T>\\nusing Edges = vector<edge<T>>;\\ntemplate <typename T>\\nusing WeightedGraph = vector<Edges<T>>;\\nusing UnweightedGraph = vector<vector<int>>;\\n\\n// Input of (Unweighted) Graph\\nUnweightedGraph graph(int N, int M = -1, bool is_directed = false,\\n bool is_1origin = true) {\\n UnweightedGraph g(N);\\n if (M == -1) M = N - 1;\\n for (int _ = 0; _ < M; _++) {\\n int x, y;\\n cin >> x >> y;\\n if (is_1origin) x--, y--;\\n g[x].push_back(y);\\n if (!is_directed) g[y].push_back(x);\\n }\\n return g;\\n}\\n\\n// Input of Weighted Graph\\ntemplate <typename T>\\nWeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,\\n bool is_1origin = true) {\\n WeightedGraph<T> g(N);\\n if (M == -1) M = N - 1;\\n for (int _ = 0; _ < M; _++) {\\n int x, y;\\n cin >> x >> y;\\n T c;\\n cin >> c;\\n if (is_1origin) x--, y--;\\n g[x].emplace_back(x, y, c);\\n if (!is_directed) g[y].emplace_back(y, x, c);\\n }\\n return g;\\n}\\n\\n// Input of Edges\\ntemplate <typename T>\\nEdges<T> esgraph(int N, int M, int is_weighted = true, bool is_1origin = true) {\\n Edges<T> es;\\n for (int _ = 0; _ < M; _++) {\\n int x, y;\\n cin >> x >> y;\\n T c;\\n if (is_weighted)\\n cin >> c;\\n else\\n c = 1;\\n if (is_1origin) x--, y--;\\n es.emplace_back(x, y, c);\\n }\\n return es;\\n}\\n\\n// Input of Adjacency Matrix\\ntemplate <typename T>\\nvector<vector<T>> adjgraph(int N, int M, T INF, int is_weighted = true,\\n bool is_directed = false, bool is_1origin = true) {\\n vector<vector<T>> d(N, vector<T>(N, INF));\\n for (int _ = 0; _ < M; _++) {\\n int x, y;\\n cin >> x >> y;\\n T c;\\n if (is_weighted)\\n cin >> c;\\n else\\n c = 1;\\n if (is_1origin) x--, y--;\\n d[x][y] = c;\\n if (!is_directed) d[y][x] = c;\\n }\\n return d;\\n}\\n\\n/**\\n * @brief グラフテンプレート\\n * @docs docs/graph/graph-template.md\\n */\\n\\n//https://nyaannyaan.github.io/library/tree/rerooting.hpp\\n\\n// Rerooting\\n// f1(c1, c2) ... merge value of child node\\n// f2(memo[i], chd, par) ... return value from child node to parent node\\n// memo[i] ... result of subtree rooted i\\n// dp[i] ... result of tree rooted i\\ntemplate <typename T, typename G, typename F1, typename F2>\\nstruct Rerooting {\\n const G &g;\\n const F1 f1;\\n const F2 f2;\\n vector<T> memo, dp;\\n T I;\\n\\n Rerooting(const G &_g, const F1 _f1, const F2 _f2, const T &I_)\\n : g(_g), f1(_f1), f2(_f2), memo(g.size(), I_), dp(g.size(), I_), I(I_) {\\n dfs(0, -1);\\n efs(0, -1, I);\\n }\\n\\n const T &operator[](int i) const { return dp[i]; }\\n\\n void dfs(int cur, int par) {\\n for (auto &dst : g[cur]) {\\n if (dst == par) continue;\\n dfs(dst, cur);\\n memo[cur] = f1(memo[cur], f2(memo[dst], dst, cur));\\n }\\n }\\n\\n void efs(int cur, int par, const T &pval) {\\n // get cumulative sum\\n vector<T> buf;\\n for (auto dst : g[cur]) {\\n if (dst == par) continue;\\n buf.push_back(f2(memo[dst], dst, cur));\\n }\\n vector<T> head(buf.size() + 1), tail(buf.size() + 1);\\n head[0] = tail[buf.size()] = I;\\n for (int i = 0; i < (int)buf.size(); i++) head[i + 1] = f1(head[i], buf[i]);\\n for (int i = (int)buf.size() - 1; i >= 0; i--)\\n tail[i] = f1(tail[i + 1], buf[i]);\\n\\n // update\\n dp[cur] = par == -1 ? head.back() : f1(pval, head.back());\\n\\n // propagate\\n int idx = 0;\\n for (auto &dst : g[cur]) {\\n if (dst == par) continue;\\n efs(dst, cur, f2(f1(pval, f1(head[idx], tail[idx + 1])), cur, dst));\\n idx++;\\n }\\n }\\n};\\n\\n/**\\n * @brief Rerooting(全方位木DP)\\n * @docs docs/tree/rerooting.md\\n */\\n\\n// auto mod int\\n// https://youtu.be/L8grWxBlIZ4?t=9858\\n// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize\\n// https://youtu.be/8uowVvQ_-Mo?t=1329 : division\\nconst int mod = 1000000007;\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\\n mint operator+(const mint a) const { return mint(*this) += a;}\\n mint operator-(const mint a) const { return mint(*this) -= a;}\\n mint operator*(const mint a) const { return mint(*this) *= a;}\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\n // for prime mod\\n mint inv() const { return pow(mod-2);}\\n mint& operator/=(const mint a) { return *this *= a.inv();}\\n mint operator/(const mint a) const { return mint(*this) /= a;}\\n};\\nistream& operator>>(istream& is, mint& a) { return is >> a.x;}\\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\\n\\n// combination mod prime\\n// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619\\nstruct combination {\\n vector<mint> fact, ifact;\\n combination(int n):fact(n+1),ifact(n+1) {\\n assert(n < mod);\\n fact[0] = 1;\\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\\n ifact[n] = fact[n].inv();\\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\\n }\\n mint operator()(int n, int k) {\\n if (k < 0 || k > n) return 0;\\n return fact[n]*ifact[k]*ifact[n-k];\\n }\\n mint p(int n,int k){\\n return fact[n]*ifact[n-k];\\n }\\n} C(1000005);\\n\\nusing F=tuple<ll,ll>;\\n\\nint main()\\n{ \\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n ll n;cin>>n;\\n vec l(n);\\n rep(i,n)cin>>l[i];\\n auto g=graph(n,n-1,0,1);\\n auto f1=[&](F x,F y){\\n auto[a,b]=x;\\n auto[c,d]=y;\\n a+=c;\\n b+=d;\\n return F(a,b);\\n };\\n auto f2=[&](F x,int ch,int p){\\n auto[a,b]=x;\\n b+=l[ch];\\n a+=b;\\n return F(a,b);\\n };\\n Rerooting<F,decltype(g),decltype(f1),decltype(f2)> dp(g,f1,f2,{0,0});\\n for(auto ans:dp.dp){\\n cout<<get<0>(ans)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 51160,\n \"score_of_the_acc\": -1.6596,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3163_7009675\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3163.cc: Problem M: Star Gazer\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\n\\n/* global variables */\\n\\nint ls[MAX_N], ps[MAX_N], cis[MAX_N];\\nvi nbrs[MAX_N];\\nll lss[MAX_N], dp[MAX_N], pdp[MAX_N];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n for (int i = 0; i < n; i++) scanf(\\\"%d\\\", ls + i);\\n\\n for (int i = 1; i < n; i++) {\\n int u, v;\\n scanf(\\\"%d%d\\\", &u, &v);\\n u--, v--;\\n nbrs[u].push_back(v);\\n nbrs[v].push_back(u);\\n }\\n\\n ps[0] = -1;\\n for (int u = 0; u >= 0;) {\\n vi &nbru = nbrs[u];\\n int up = ps[u];\\n\\n if (cis[u] < nbru.size()) {\\n int v = nbru[cis[u]++];\\n if (v != up) {\\n\\tps[v] = u;\\n\\tu = v;\\n }\\n }\\n else {\\n lss[u] += ls[u];\\n\\n if (up >= 0) {\\n\\tlss[up] += lss[u];\\n\\tdp[up] += dp[u] + lss[u];\\n }\\n\\n u = up;\\n }\\n }\\n //for (int u = 0; u < n; u++) printf(\\\"%lld \\\", dp[u]); putchar('\\\\n');\\n\\n fill(cis, cis + n, 0);\\n pdp[0] = 0;\\n for (int u = 0; u >= 0;) {\\n vi &nbru = nbrs[u];\\n int up = ps[u];\\n\\n if (cis[u] < nbru.size()) {\\n int v = nbru[cis[u]++];\\n if (v != up) {\\n\\tpdp[v] = (dp[u] + pdp[u]) - (dp[v] + lss[v]) + (lss[0] - lss[v]);\\n\\tu = v;\\n }\\n }\\n else\\n u = up;\\n }\\n\\n for (int u = 0; u < n; u++) printf(\\\"%lld\\\\n\\\", dp[u] + pdp[u]);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 12032,\n \"score_of_the_acc\": -0.0667,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3163_6304884\",\n \"code_snippet\": \"#include <iostream>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <set>\\n#include <vector>\\n#include <numeric>\\n#include <algorithm>\\n#include <queue>\\n#include <string>\\n#include <random>\\n#include <array>\\n#include <climits>\\n#include <map>\\n#include <cassert>\\n#include <stack>\\n#include <iomanip>\\n#include <cfloat>\\n#include <fstream>\\n\\n\\nint main() {\\n\\tint n; std::cin >> n;\\n\\tstd::vector<int> brightness(n);\\n\\tfor (auto& l : brightness) {\\n\\t\\tstd::cin >> l;\\n\\t}\\n\\tstd::vector<std::pair<int, int>> edges(n - 1);\\n\\tfor (auto& [a, b] : edges) {\\n\\t\\tstd::cin >> a >> b; --a; --b;\\n\\t}\\n\\tstd::vector<std::vector<int>> graph(n);\\n\\tfor (const auto [a, b] : edges) {\\n\\t\\tgraph[a].push_back(b);\\n\\t\\tgraph[b].push_back(a);\\n\\t}\\n\\tstd::vector<int> depth(n, -1);\\n\\tstd::stack<int> stack;\\n\\tstd::vector<int> history;\\n\\tdepth[0] = 0;\\n\\tstack.push(0);\\n\\twhile (!stack.empty()) {\\n\\t\\tconst auto top = stack.top(); stack.pop();\\n\\t\\thistory.push_back(top);\\n\\t\\tfor (const auto next : graph[top]) {\\n\\t\\t\\tif (depth[next] != -1) continue;\\n\\t\\t\\tdepth[next] = depth[top] + 1;\\n\\t\\t\\tstack.push(next);\\n\\t\\t}\\n\\t}\\n\\tstd::vector<long long int> sum_brightness(n), from_leaf(n, 0);\\n\\tstd::copy(brightness.begin(), brightness.end(), sum_brightness.begin());\\n\\tstd::reverse(history.begin(), history.end());\\n\\tfor (const auto node : history) {\\n\\t\\tfor (const auto child : graph[node]) {\\n\\t\\t\\tif (depth[child] < depth[node]) continue;\\n\\t\\t\\tsum_brightness[node] += sum_brightness[child];\\n\\t\\t\\tfrom_leaf[node] += from_leaf[child] + sum_brightness[child];\\n\\t\\t}\\n\\t}\\n\\tstd::vector<long long int> from_root(n, 0);\\n\\tstd::reverse(history.begin(), history.end());\\n\\tfor (const auto node : history) {\\n\\t\\tfor (const auto child : graph[node]) {\\n\\t\\t\\tif (depth[child] < depth[node]) continue;\\n\\t\\t\\tfrom_root[child] = from_root[node] + (from_leaf[node] - from_leaf[child] - sum_brightness[child]) + (sum_brightness[0] - sum_brightness[child]);\\n\\t\\t}\\n\\t}\\n\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\tstd::cout << from_leaf[i] + from_root[i] << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 13780,\n \"score_of_the_acc\": -0.2444,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3163_5948346\",\n \"code_snippet\": \"#ifdef LOCAL\\n #define _GLIBCXX_DEBUG\\n #define __clock__\\n#else\\n #pragma GCC optimize(\\\"Ofast\\\")\\n#endif\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing VI = vector<ll>;\\nusing VV = vector<VI>;\\nusing VS = vector<string>;\\nusing PII = pair<ll, ll>;\\n\\n// #define INT128 // 必要なら有効化してください\\n#ifdef INT128\\n using LL = __int128;\\n#endif\\n\\n// tourist set\\ntemplate <typename A, typename B>\\nstring to_string(pair<A, B> p);\\n\\ntemplate <typename A, typename B, typename C>\\nstring to_string(tuple<A, B, C> p);\\n\\ntemplate <typename A, typename B, typename C, typename D>\\nstring to_string(tuple<A, B, C, D> p);\\n\\nstring to_string(const string& s) {\\n return '\\\"' + s + '\\\"';\\n}\\n\\nstring to_string(const char* s) {\\n return to_string((string) s);\\n}\\n\\nstring to_string(bool b) {\\n return (b ? \\\"true\\\" : \\\"false\\\");\\n}\\n\\nstring to_string(char c){\\n string s = {c};\\n return s;\\n}\\n\\n// LL\\n#ifdef INT128\\n// input\\nistream& operator>>(istream& is, LL& v)\\n{\\n string s;\\n is >> s;\\n v = 0;\\n for (int i = 0; i < (int)s.size(); i++) {\\n if (isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\\n }\\n if (s[0] == '-') { v *= -1; }\\n return is;\\n}\\nstd::ostream &operator<<(std::ostream &dest, LL value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n LL tmp = value < 0 ? -value : value;\\n char buffer[128];\\n char *d = std::end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[tmp % 10];\\n tmp /= 10;\\n } while (tmp != 0);\\n if (value < 0) {\\n --d;\\n *d = '-';\\n }\\n int len = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\nstring to_string(LL v){\\n stringstream ss;\\n ss << v;\\n return ss.str();\\n}\\n#endif // LL\\n\\nstring to_string(vector<bool> v) {\\n bool first = true;\\n string res = \\\"{\\\";\\n for (int i = 0; i < static_cast<int>(v.size()); i++) {\\n if (!first) {\\n res += \\\", \\\";\\n }\\n first = false;\\n res += to_string(v[i]);\\n }\\n res += \\\"}\\\";\\n return res;\\n}\\n\\ntemplate <size_t N>\\nstring to_string(bitset<N> v) {\\n string res = \\\"\\\";\\n for (size_t i = 0; i < N; i++) {\\n res += static_cast<char>('0' + v[i]);\\n }\\n return res;\\n}\\n\\ntemplate <typename A>\\nstring to_string(A v) {\\n bool first = true;\\n string res = \\\"{\\\";\\n for (const auto &x : v) {\\n if (!first) {\\n res += \\\", \\\";\\n }\\n first = false;\\n res += to_string(x);\\n }\\n res += \\\"}\\\";\\n return res;\\n}\\n\\ntemplate <typename A, typename B>\\nstring to_string(pair<A, B> p) {\\n return \\\"(\\\" + to_string(p.first) + \\\", \\\" + to_string(p.second) + \\\")\\\";\\n}\\n\\ntemplate <typename A, typename B, typename C>\\nstring to_string(tuple<A, B, C> p) {\\n return \\\"(\\\" + to_string(get<0>(p)) + \\\", \\\" + to_string(get<1>(p)) + \\\", \\\" + to_string(get<2>(p)) + \\\")\\\";\\n}\\n\\ntemplate <typename A, typename B, typename C, typename D>\\nstring to_string(tuple<A, B, C, D> p) {\\n return \\\"(\\\" + to_string(get<0>(p)) + \\\", \\\" + to_string(get<1>(p)) + \\\", \\\" + to_string(get<2>(p)) + \\\", \\\" + to_string(get<3>(p)) + \\\")\\\";\\n}\\n\\nvoid debug_out() { cerr << '\\\\n'; }\\n\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n cerr << \\\" \\\" << to_string(H);\\n debug_out(T...);\\n}\\n\\n#ifdef LOCAL\\n#define debug(...) cerr << \\\"[\\\" << #__VA_ARGS__ << \\\"]:\\\", debug_out(__VA_ARGS__)\\n#else\\n#define debug(...) 42\\n#endif\\n// tourist set end\\n\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\\n\\n#define FOR(i,a,b) for(ll i=(a);i<(b);++i)\\n#define rep(i,b) FOR(i, 0, b)\\n#define ALL(v) (v).begin(), (v).end()\\n#define p(s) cout<<(s)<<'\\\\n'\\n#define p2(s, t) cout << (s) << \\\" \\\" << (t) << '\\\\n'\\n#define SZ(x) ((int)(x).size())\\n#define SORT(A) sort(ALL(A))\\n#define RSORT(A) sort(ALL(A), greater<ll>())\\n#define MP make_pair\\n#define p_yes() p(\\\"Yes\\\")\\n#define p_no() p(\\\"No\\\")\\n#define p_possible() p(\\\"Possible\\\")\\n#define p_impossible() p(\\\"Impossible\\\")\\nvoid yes(){p_yes(); exit(0);}\\nvoid no(){p_no(); exit(0);}\\nvoid possible(){p_possible(); exit(0);}\\nvoid impossible(){p_impossible(); exit(0);}\\n\\nll SUM(VI& V){\\n return accumulate(ALL(V), 0LL);\\n}\\n\\nll MIN(VI& V){return *min_element(ALL(V));}\\nll MAX(VI& V){return *max_element(ALL(V));}\\n\\nvoid print_vector(VI& V, ll offset=0){\\n ll n = V.size();\\n rep(i, n){\\n if(i) cout << ' ';\\n cout << V[i]+offset;\\n }\\n cout << endl;\\n}\\n\\nll gcd(ll a,ll b){\\n if(b == 0) return a;\\n return gcd(b,a%b);\\n}\\n\\nll lcm(ll a,ll b){\\n ll g = gcd(a,b);\\n return a / g * b;\\n}\\n\\n// long double\\nusing ld = long double;\\n// #define EPS (1e-14)\\nconstexpr ld EPS = 1e-14;\\n// #define equals(a,b) (fabs((a)-(b)) < EPS)\\nconstexpr bool equals(ld a, ld b){return fabs((a)-(b)) < EPS;}\\n\\n// 小さい順に取り出すpriority queue\\nusing inverse_priority_queue = priority_queue<ll, vector<ll>, greater<ll> >;\\n\\nint popcount(ll t){\\n return __builtin_popcountll(t);\\n}\\n\\nconst ll mod = 1e9 + 7;\\n// const ll mod = 998244353;\\nconst ll inf = 4e18; // LLONG_MAX = 9223372036854775807 (atcoder, codeforces)\\nconst double PI = acos(-1);\\n\\n// [a/b] (繰り上げ)\\nll ceil_div(ll a, ll b){\\n return (a+b-1)/b;\\n}\\n\\nll ll_pow(ll a, ll n){\\n ll ans = 1;\\n FOR(i, 0, n){\\n ans *= a;\\n }\\n return ans;\\n}\\n// modなし\\n\\n// snuke's mint\\n// auto mod int\\n// https://youtu.be/L8grWxBlIZ4?t=9858\\n// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize\\n// https://youtu.be/8uowVvQ_-Mo?t=1329 : division\\n// const int mod = 1000000007;\\nstruct mint {\\n ll x; // using ll = long long;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) {\\n (x *= a.x) %= mod;\\n return *this;\\n }\\n mint operator+(const mint a) const {\\n mint res(*this);\\n return res+=a;\\n }\\n mint operator-(const mint a) const {\\n mint res(*this);\\n return res-=a;\\n }\\n mint operator*(const mint a) const {\\n mint res(*this);\\n return res*=a;\\n }\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\n // for prime mod\\n mint inv() const {\\n return pow(mod-2);\\n }\\n mint& operator/=(const mint a) {\\n return (*this) *= a.inv();\\n }\\n mint operator/(const mint a) const {\\n mint res(*this);\\n return res/=a;\\n }\\n};\\n\\n// ※双方向\\n// N : 頂点数\\n// M : 辺数\\n// return vector<vector<ll>>\\nVV load_graph(ll N, ll M){\\n VV G(N);\\n rep(i,M){\\n ll a,b;cin>>a>>b;\\n a--;b--;\\n G[a].push_back(b);\\n G[b].push_back(a);\\n }\\n return G;\\n}\\nVV load_tree(ll N){\\n return load_graph(N, N-1);\\n}\\n\\nVI loadV(ll N){\\n VI A(N);\\n rep(i,N)cin>>A[i];\\n return A;\\n}\\n\\n//#include <atcoder/dsu>\\n//using namespace atcoder; // 忘れがち\\n\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n // input\\n ll N;cin>>N;\\n VI L = loadV(N); // light\\n ll sumL = SUM(L);\\n\\n VV G(N);\\n rep(i,N-1){\\n ll a,b;cin>>a>>b;\\n a--;b--;\\n G[a].push_back(b);\\n G[b].push_back(a);\\n }\\n\\n VI parent(N,-1); // parent\\n\\n // light of subtree\\n VI dpL(N);\\n function<ll(ll,ll)> dfs2 = [&](ll i, ll prev){\\n parent[i]=prev;\\n ll sum=L[i];\\n for(ll to : G[i]){\\n if(to==prev)continue;\\n sum += dfs2(to,i);\\n }\\n return dpL[i]=sum;\\n };\\n dfs2(0,-1);\\n debug(dpL);\\n\\n // answer of subtree\\n VI dp(N);\\n function<ll(ll,ll)> dfs = [&](ll i, ll prev){\\n ll sum=0;\\n for(ll to : G[i]){\\n if(to==prev)continue;\\n sum += dfs(to,i) + dpL[to];\\n }\\n return dp[i]=sum;\\n };\\n dfs(0,-1);\\n \\n function<void(ll,ll)> bfs = [&](ll i, ll prev){\\n // prevには全方向が入っている\\n \\n // 自分のdpを求めて\\n ll otherlight = sumL - dpL[i];\\n\\n ll add = dp[prev]-dp[i]-dpL[i]+otherlight;\\n dp[i]+=add;\\n\\n // 子へ\\n for(ll to : G[i]){\\n if(to==prev)continue;\\n bfs(to,i);\\n }\\n };\\n for(ll to : G[0]){\\n bfs(to,0);\\n }\\n\\n rep(i,N){\\n p(dp[i]);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 19368,\n \"score_of_the_acc\": -0.2528,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3163_5073758\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\nnamespace CharacterClass {\\n\\tconstexpr string_view\\n\\t digit = \\\"0123456789\\\",\\n\\t xdigit = \\\"0123456789ABCDEFabcdef\\\", lower = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n\\t upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n\\t alpha = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t alnum = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t word = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\\\",\\n\\t punct = R\\\"(!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~)\\\",\\n\\t graph =\\n\\t R\\\"(!\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t print =\\n\\t R\\\"( !\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t blank = \\\" \\\\t\\\", space = \\\" \\\\t\\\\n\\\\r\\\\f\\\\v\\\";\\n} // namespace CharacterClass\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Printer {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid print(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(bool v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(vector<bool>::reference v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid print(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid print(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid print(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void print(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\\n\\t\\tprint(v.first);\\n\\t\\tprint(D.d);\\n\\t\\tprint(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) print(D.d);\\n\\t\\t\\tprint(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void print(const vector<T>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void print(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) print(D.l);\\n\\t\\t\\tprint(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tPrinter() = default;\\n\\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tPrinter& operator()() {\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Printer& operator()(H&& h) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tprint_range(begin, end);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Printer& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tPrinter& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class V> auto operator()(const V& val, size_t i) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(next(begin(v), i), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 7 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T = long long> constexpr T TEN(size_t n) {\\n\\tT result = 1;\\n\\tfor (size_t i = 0; i < n; ++i) result *= 10;\\n\\treturn result;\\n}\\ntemplate <class T, class U,\\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr auto div_ceil(T n, U m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> constexpr T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> constexpr T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T, class U, class V>\\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\\n\\treturn lower <= v && v < upper;\\n}\\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\\nconstexpr bool is_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> constexpr T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T> constexpr int BIT(T x, int i) {\\n\\treturn (x & (1 << i)) ? 1 : 0;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Pow(T a, U n) {\\n\\tassert(n >= 0);\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Powmod(T a, U n, T mod) {\\n\\tassert(n >= 0);\\n\\tif (a > mod) a %= mod;\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 3 \\\"/home/yuruhiya/programming/library/Graph/ReRooting.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class DP> class ReRooting {\\n\\tint n;\\n\\tvector<vector<int>> graph;\\n\\tvector<vector<DP>> dp;\\n\\tvector<DP> ans;\\n\\n\\tDP dfs(int v, int p) {\\n\\t\\tDP sum;\\n\\t\\tfor (size_t i = 0; i < graph[v].size(); ++i) {\\n\\t\\t\\tint e = graph[v][i];\\n\\t\\t\\tDP& dp_e = dp[v][i];\\n\\t\\t\\tif (e != p) {\\n\\t\\t\\t\\tdp_e = dfs(e, v);\\n\\t\\t\\t\\tsum += dp_e;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn sum.add_root(v);\\n\\t}\\n\\tvoid bfs(int v, int p, const DP& dp_par) {\\n\\t\\tfor (size_t i = 0; i < graph[v].size(); ++i) {\\n\\t\\t\\tif (graph[v][i] == p) {\\n\\t\\t\\t\\tdp[v][i] = dp_par;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tvector<DP> dp_left(graph[v].size() + 1);\\n\\t\\tfor (size_t i = 0; i < graph[v].size(); ++i) {\\n\\t\\t\\tdp_left[i + 1] = dp_left[i] + dp[v][i];\\n\\t\\t}\\n\\t\\tvector<DP> dp_right(graph[v].size() + 1);\\n\\t\\tfor (int i = graph[v].size() - 1; i >= 0; --i) {\\n\\t\\t\\tdp_right[i] = dp_right[i + 1] + dp[v][i];\\n\\t\\t}\\n\\t\\tans[v] = dp_left.back().add_root(v);\\n\\n\\t\\tfor (size_t i = 0; i < graph[v].size(); ++i) {\\n\\t\\t\\tint e = graph[v][i];\\n\\t\\t\\tif (e != p) {\\n\\t\\t\\t\\tbfs(e, v, (dp_left[i] + dp_right[i + 1]).add_root(v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\tReRooting(const vector<vector<int>>& _graph) : n(_graph.size()), graph(_graph), dp(n), ans(n) {\\n\\t\\tfor (int i = 0; i < n; ++i) dp[i].resize(graph[i].size());\\n\\t}\\n\\tvector<DP> solve() {\\n\\t\\tdfs(0, -1);\\n\\t\\tbfs(0, -1, DP());\\n\\t\\treturn ans;\\n\\t}\\n};\\n\\n/*\\nstruct DP {\\n int dp;\\n DP(int _dp = 1) : dp(_dp) {}\\n DP operator+(const DP& d) const {\\n return DP(*this) += d;\\n }\\n DP& operator+=(const DP& d) {\\n return *this;\\n }\\n DP add_root([[maybe_unused]] int v) const {\\n DP res = *this;\\n\\n return res;\\n }\\n};\\n*/\\n#line 3 \\\"a.cpp\\\"\\n\\nVL a;\\n\\nstruct DP {\\n\\tll sum, val;\\n\\tDP() : sum(0), val(0) {}\\n\\tDP operator+(const DP& d) const {\\n\\t\\treturn DP(*this) += d;\\n\\t}\\n\\tDP& operator+=(const DP& d) {\\n\\t\\tsum += d.sum;\\n\\t\\tval += d.val;\\n\\t\\treturn *this;\\n\\t}\\n\\tDP add_root([[maybe_unused]] int v) const {\\n\\t\\tDP res = *this;\\n\\t\\tres.val += sum;\\n\\t\\tres.sum += a[v];\\n\\t\\treturn res;\\n\\t}\\n};\\n\\nint main() {\\n\\tini(n);\\n\\ta = in[n];\\n\\tVVI g(n);\\n\\trep(i, n - 1) {\\n\\t\\tint u = in--, v = in--;\\n\\t\\tg[u].push_back(v);\\n\\t\\tg[v].push_back(u);\\n\\t}\\n\\n\\tReRooting<DP> dp(g);\\n\\tauto ans = dp.solve();\\n\\trep(i, n) out(ans[i].val);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 43232,\n \"score_of_the_acc\": -0.9251,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3163_4952868\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 100005\\n\\nint N,root;\\nll total_L;\\nll dp[SIZE],L[SIZE],sum_L[SIZE];\\nll ans[SIZE];\\nvector<int> G[SIZE];\\n\\nvoid dfs(int node_id,int pre){\\n\\n\\tsum_L[node_id] += L[node_id];\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next = G[node_id][i];\\n\\t\\tif(next == pre)continue;\\n\\n\\t\\tdfs(next,node_id);\\n\\t\\tdp[node_id] += dp[next]+sum_L[next];\\n\\t\\tsum_L[node_id] += sum_L[next];\\n\\t}\\n}\\n\\nvoid dfs2(int node_id,int pre){\\n\\n\\tif(node_id == root){\\n\\n\\t\\tans[root] = dp[root];\\n\\t}else{\\n\\n\\t\\tans[node_id] = dp[node_id]+(ans[pre]-(dp[node_id]+sum_L[node_id]))+total_L-sum_L[node_id];\\n\\t}\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tint next = G[node_id][i];\\n\\t\\tif(next == pre)continue;\\n\\n\\t\\tdfs2(next,node_id);\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\ttotal_L = 0;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lld\\\",&L[i]);\\n\\t\\ttotal_L += L[i];\\n\\t}\\n\\n\\tint from,to;\\n\\n\\tfor(int i = 0; i < N-1; i++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tdp[i] = 0;\\n\\t\\tsum_L[i] = 0;\\n\\t}\\n\\n\\troot = 0;\\n\\n\\tdfs(root,-1);\\n\\tdfs2(root,-1);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tprintf(\\\"%lld\\\\n\\\",ans[i]);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 17152,\n \"score_of_the_acc\": -0.2633,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3163_4949975\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i,n) for(ll i=0;i<(ll)n;i++)\\n#define dump(x) cerr << \\\"Line \\\" << __LINE__ << \\\": \\\" << #x << \\\" = \\\" << (x) << \\\"\\\\n\\\";\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n\\nusing ld = long double;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pdd = pair<ld, ld>;\\n\\ntemplate<typename T> using V = vector<T>;\\ntemplate<typename T> using P = pair<T, T>;\\ntemplate<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }\\ntemplate<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }\\ntemplate<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << \\\"(\\\" << v.first << \\\", \\\" << v.second << \\\")\\\"; return os;}\\ntemplate<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }\\ntemplate<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << \\\"\\\\n\\\";} return os;}\\nstruct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;\\n\\ntemplate <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\nvoid fail() { cout << -1 << '\\\\n'; exit(0); }\\ninline int popcount(const int x) { return __builtin_popcount(x); }\\ninline int popcount(const ll x) { return __builtin_popcountll(x); }\\ntemplate<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)\\n{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<\\\"\\\\n\\\";}};\\ntemplate<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];\\nfor(ll i=1;i<n;i++)cerr spa v[i];\\ncerr<<\\\"\\\\n\\\";};\\n\\nconst ll INF = (1ll<<62);\\n// const ld EPS = 1e-10;\\n// const ld PI = acos(-1.0);\\nconst ll mod = (int)1e9 + 7;\\n//const ll mod = 998244353;\\n\\ntemplate< typename sum_t, typename key_t >\\nstruct ReRooting {\\n struct Edge {\\n int to;\\n key_t data;\\n sum_t dp, ndp;\\n };\\n\\n using F = function< sum_t(sum_t, sum_t) >;\\n using G = function< sum_t(sum_t, key_t) >;\\n\\n // subdp: 一度目のdfsの結果を保持する配列\\n // dp: 二度目のdfsの後，結果を各頂点でマージした値を保持する配列\\n vector< vector< Edge > > g;\\n const F f;\\n const G gg;\\n const sum_t ident;\\n vector< sum_t > subdp, dp;\\n\\n ReRooting(int V, const F f, const G g, const sum_t &ident)\\n : g(V), f(f), gg(g), ident(ident), subdp(V, ident), dp(V, ident) {}\\n\\n // add_edge は危険なので使わない方が良い\\n // u->v に重み d の有向辺を追加するのではなく，\\n // u->v と v->u の両方に重み d の有向辺を追加する\\n // void add_edge(int u, int v, const key_t &d) {\\n // g[u].emplace_back((Edge) {v, d, ident, ident});\\n // g[v].emplace_back((Edge) {u, d, ident, ident});\\n // }\\n\\n // u->v に重み d の有向辺を追加し，\\n // v->u に重み e の有向辺を追加する\\n void add_edge_bi(int u, int v, const key_t &d, const key_t &e) {\\n g[u].emplace_back((Edge) {v, d, ident, ident});\\n g[v].emplace_back((Edge) {u, e, ident, ident});\\n }\\n\\n // 一度目のdfs\\n void dfs_sub(int idx, int par) {\\n for(auto &e : g[idx]) {\\n if(e.to == par) continue;\\n dfs_sub(e.to, idx);\\n subdp[idx] = f(subdp[idx], gg(subdp[e.to], e.data));\\n }\\n }\\n\\n // 二度目のdfs\\n void dfs_all(int idx, int par, const sum_t &top) {\\n sum_t buff{ident};\\n for(int i = 0; i < (int) g[idx].size(); i++) {\\n auto &e = g[idx][i];\\n e.ndp = buff;\\n e.dp = gg(par == e.to ? top : subdp[e.to], e.data);\\n buff = f(buff, e.dp);\\n }\\n dp[idx] = buff;\\n buff = ident;\\n for(int i = (int) g[idx].size() - 1; i >= 0; i--) {\\n auto &e = g[idx][i];\\n if(e.to != par) dfs_all(e.to, idx, f(e.ndp, buff));\\n e.ndp = f(e.ndp, buff);\\n buff = f(buff, e.dp);\\n }\\n }\\n\\n vector< sum_t > build() {\\n dfs_sub(0, -1);\\n dfs_all(0, -1, ident);\\n return dp;\\n }\\n};\\n\\nint main(){\\n\\n ll N;\\n cin >> N;\\n V<ll> l(N);\\n REP(i, N) cin >> l[i];\\n\\n auto f1 = [](pll x, pll y){\\n return pll{x.first+y.first, x.second+y.second};\\n };\\n\\n auto f2 = [](pll x, ll a){\\n return pll{x.first+a, x.first+x.second+a};\\n };\\n\\n ReRooting<pll, ll> RR(N, f1, f2, pll{0, 0});\\n\\n REP(i, N-1){\\n ll a, b;\\n cin >> a >> b;\\n a--, b--;\\n RR.add_edge_bi(a, b, l[b], l[a]);\\n }\\n RR.build();\\n\\n REP(i, N) cout << RR.dp[i].second << \\\"\\\\n\\\";\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 44264,\n \"score_of_the_acc\": -1.0179,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3163_4893533\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing LL = long long int;\\n#define incII(i, l, r) for(LL i = (l) ; i <= (r); i++)\\n#define incIX(i, l, r) for(LL i = (l) ; i < (r); i++)\\n#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)\\n#define incXX(i, l, r) for(LL i = (l) + 1; i < (r); i++)\\n#define decII(i, l, r) for(LL i = (r) ; i >= (l); i--)\\n#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)\\n#define decXI(i, l, r) for(LL i = (r) ; i > (l); i--)\\n#define decXX(i, l, r) for(LL i = (r) - 1; i > (l); i--)\\n#define inc(i, n) incIX(i, 0, n)\\n#define dec(i, n) decIX(i, 0, n)\\n#define inc1(i, n) incII(i, 1, n)\\n#define dec1(i, n) decII(i, 1, n)\\nauto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };\\nauto inIX = [](auto x, auto l, auto r) { return (l <= x && x < r); };\\nauto inXI = [](auto x, auto l, auto r) { return (l < x && x <= r); };\\nauto inXX = [](auto x, auto l, auto r) { return (l < x && x < r); };\\nauto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };\\nauto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };\\nauto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };\\nauto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define MT make_tuple\\n#define FI first\\n#define SE second\\n#define FR front()\\n#define BA back()\\n#define ALL(c) c.begin(), c.end()\\n#define RALL(c) c.rbegin(), c.rend()\\n#define RV(c) reverse(ALL(c))\\n#define SC static_cast\\n#define SI(c) SC<int>(c.size())\\n#define SL(c) SC<LL >(c.size())\\n#define RF(e, c) for(auto & e: c)\\n#define SF(c, ...) for(auto & [__VA_ARGS__]: c)\\n#define until(e) while(! (e))\\n#define if_not(e) if(! (e))\\n#define ef else if\\n#define UR assert(false)\\nauto * IS = & cin;\\nauto * OS = & cout;\\narray<string, 3> SEQ = { \\\"\\\", \\\" \\\", \\\"\\\" };\\n// input\\ntemplate<typename T> T in() { T a; (* IS) >> a; return a; }\\n// input: tuple\\ntemplate<int I, typename U> void tin_(istream & is, U & t) {\\n\\tif constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }\\n}\\ntemplate<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }\\ntemplate<typename ... T> auto tin() { return in<tuple<T ...>>(); }\\n// input: array\\ntemplate<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }\\ntemplate<typename T, size_t N> auto ain() { return in<array<T, N>>(); }\\n// input: multi-dimensional vector\\ntemplate<typename T> T vin() { T v; (* IS) >> v; return v; }\\ntemplate<typename T, typename N, typename ... M> auto vin(N n, M ... m) {\\n\\tvector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;\\n}\\n// input: multi-column (tuple<vector>)\\ntemplate<typename U, int I> void colin_([[maybe_unused]] U & t) { }\\ntemplate<typename U, int I, typename A, typename ... B> void colin_(U & t) {\\n\\tget<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);\\n}\\ntemplate<typename ... T> auto colin(int n) {\\n\\ttuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;\\n}\\n// output\\nvoid out_([[maybe_unused]] string s) { }\\ntemplate<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }\\ntemplate<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }\\nauto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };\\nauto out = [](auto ... a) { outF(\\\"\\\", \\\" \\\" , \\\"\\\\n\\\", a ...); };\\nauto outS = [](auto ... a) { outF(\\\"\\\", \\\" \\\" , \\\" \\\" , a ...); };\\nauto outL = [](auto ... a) { outF(\\\"\\\", \\\"\\\\n\\\", \\\"\\\\n\\\", a ...); };\\nauto outN = [](auto ... a) { outF(\\\"\\\", \\\"\\\" , \\\"\\\" , a ...); };\\n// output: multi-dimensional vector\\ntemplate<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {\\n\\tos << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? \\\"\\\" : SEQ[1]) << v[i]; } return (os << SEQ[2]);\\n}\\ntemplate<typename T> void vout_(T && v) { (* OS) << v; }\\ntemplate<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {\\n\\tinc(i, SI(v)) { (* OS) << (i == 0 ? \\\"\\\" : a); vout_(v[i], b ...); }\\n}\\ntemplate<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }\\ntemplate<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << flush; }\\n\\n// ---- ----\\n\\nint main() {\\n\\tauto n = in<int>();\\n\\tauto l = vin<LL>(n);\\n\\tvector<vector<int>> g(n);\\n\\tinc(i, n - 1) {\\n\\t\\tauto [a, b] = ain<int, 2>();\\n\\t\\ta--; b--;\\n\\t\\tg[a].PB(b);\\n\\t\\tg[b].PB(a);\\n\\t}\\n\\t\\n\\tvector<LL> s(n), ans(n);\\n\\tfunction<void(int, int, int)> dfs = [&](int t, int v, int p) {\\n\\t\\tif(t == 0) {\\n\\t\\t\\tRF(e, g[v]) {\\n\\t\\t\\t\\tif(e == p) { continue; }\\n\\t\\t\\t\\tdfs(t, e, v);\\n\\t\\t\\t\\tl[v] += l[e];\\n\\t\\t\\t\\ts[v] += l[e] + s[e];\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tif(v == 0) {\\n\\t\\t\\t\\tans[v] = s[v];\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tans[v] = ans[p] + l[0] - 2 * l[v]; \\n\\t\\t\\t}\\n\\t\\t\\tRF(e, g[v]) {\\n\\t\\t\\t\\tif(e == p) { continue; }\\n\\t\\t\\t\\tdfs(t, e, v);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t};\\n\\tdfs(0, 0, -1);\\n\\tdfs(1, 0, -1);\\n\\tvout(ans, \\\"\\\\n\\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 20124,\n \"score_of_the_acc\": -0.472,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3163_4878874\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\nusing namespace std;\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nusing ll = long long;\\n#define pp pair<int,int>\\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\\n#define ld long double\\n#define al(a) (a).begin(),(a).end()\\n#define mk make_pair\\n#define check cout<<\\\"?\\\"<<endl;\\n\\nll MOD=1000000007;\\nll mod=998244353;\\nint inf=1000001000;\\nll INF=1e18+5;\\n\\ntemplate<typename T>\\nostream& operator<<(ostream& os,const vector<T>& v){\\n if(v.empty()){\\n os<<\\\"{ }\\\";\\n return os;\\n }\\n os<<\\\"{\\\"<<v.front();\\n for(auto itr=++v.begin();itr!=v.end();itr++){\\n os<<\\\", \\\"<<*itr;\\n }\\n os<<\\\"}\\\";\\n return os;\\n}\\n\\ntemplate<typename T_first,typename T_second>\\nostream& operator<<(ostream& os,const pair<T_first,T_second>& P){\\n os<<\\\"(\\\"<<P.first;\\n os<<\\\", \\\"<<P.second;\\n os<<\\\")\\\";\\n return os;\\n}\\n\\nstruct edge{\\n int from;\\n int to;\\n int idx;\\n int rev;\\n edge(int from=-1,int to=-1,int idx=-1,int rev=-1):to(to),rev(rev){}\\n};\\n\\ntemplate<class DP>\\nclass ReRooting{\\npublic:\\n\\n using E=function<DP()>; \\n using F=function<DP(DP,DP)>;\\n using F_=function<DP(edge,DP)>;\\n int n;\\n vector<vector<edge>> path;\\n vector<vector<DP>> edges_dp;\\n E e;\\n vector<DP> res;\\n F merge;\\n F_ mapping;\\n\\n ReRooting(int n,E e,F merge,F_ mapping):n(n),e(e),merge(merge),mapping(mapping){\\n res.assign(n,e());\\n path.assign(n,vector<edge>(0));\\n edges_dp.assign(n,vector<DP>(0));\\n }\\n\\n void add_edge(int from,int to){\\n path[from].push_back(edge{from,to,(int)path[from].size(),(int)path[to].size()});\\n path[to].push_back(edge{to,from,(int)path[to].size(),(int)path[from].size()-1});\\n edges_dp[from].push_back(e());\\n edges_dp[to].push_back(e());\\n }\\n\\n void solve(){\\n dfs(0,-1,-1);\\n bfs(0);\\n }\\n\\n DP dfs(int s,int p,int idx){\\n if(s==0){\\n rep(i,(int)path[s].size()){\\n dfs(path[s][i].to,s,i);\\n }\\n return DP{};\\n }\\n\\n DP& cur_edge=edges_dp[p][idx];\\n rep(i,(int)path[s].size()){\\n if(path[s][i].to==p) continue;\\n cur_edge=merge(cur_edge,dfs(path[s][i].to,s,i));\\n }\\n cur_edge=mapping(path[p][idx],cur_edge);\\n\\n return cur_edge;\\n }\\n\\n void bfs(int start){\\n vector<bool> visited(n,false);\\n queue<int> que;\\n que.push(start);\\n while(!que.empty()){\\n int s=que.front();\\n que.pop();\\n int degree=(int)path[s].size();\\n vector<DP> merge_left(degree,e());\\n vector<DP> merge_right(degree,e());\\n for(int i=1;i<degree;i++){\\n merge_left[i]=merge(edges_dp[s][i-1],merge_left[i-1]);\\n }\\n for(int i=degree-2;i>=0;i--){\\n merge_right[i]=merge(edges_dp[s][i+1],merge_right[i+1]);\\n }\\n rep(i,degree){\\n if(visited[path[s][i].to]) continue;\\n edge& cur_edge=path[s][i];\\n edges_dp[cur_edge.to][cur_edge.rev]=merge(edges_dp[cur_edge.to][cur_edge.rev],merge_left[i]);\\n edges_dp[cur_edge.to][cur_edge.rev]=merge(edges_dp[cur_edge.to][cur_edge.rev],merge_right[i]);\\n edges_dp[cur_edge.to][cur_edge.rev]=mapping(path[cur_edge.to][cur_edge.rev],edges_dp[cur_edge.to][cur_edge.rev]);\\n que.push(cur_edge.to);\\n }\\n res[s]=merge(edges_dp[s][0],merge_right[0]);\\n visited[s]=true;\\n }\\n }\\n};\\n\\nvector<ll> l;\\n\\n//using DP=intなども可\\nstruct DP{\\n ll dp;\\n ll sum;\\n};\\nDP e(){\\n return DP{0,0}; \\n}\\n//モノイド\\nDP dp_merge(DP p,DP a){\\n p.dp=p.dp+a.dp;\\n p.sum=p.sum+a.sum;\\n return p;\\n}\\nDP mapping(edge cur_edge,DP x){\\n x.sum=x.sum+l[cur_edge.to];\\n x.dp=x.dp+x.sum;\\n return x;\\n}\\n\\nint main(){\\n int n; cin>>n;\\n l.assign(n,0);\\n rep(i,n) cin>>l[i];\\n ReRooting<DP> tdp(n,e,dp_merge,mapping);\\n rep(i,n-1){\\n int a,b; cin>>a>>b;\\n tdp.add_edge(a-1,b-1);\\n }\\n tdp.solve();\\n rep(i,n) printf(\\\"%lld\\\\n\\\",tdp.res[i].dp);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 33408,\n \"score_of_the_acc\": -1.0091,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3163_4878216\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\nusing namespace std;\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nusing ll = long long;\\n#define pp pair<int,int>\\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\\n#define ld long double\\n#define al(a) (a).begin(),(a).end()\\n#define mk make_pair\\n#define check cout<<\\\"?\\\"<<endl;\\n\\nll MOD=1000000007;\\nll mod=998244353;\\nint inf=1000001000;\\nll INF=1e18+5;\\n\\ntemplate<typename T>\\nostream& operator<<(ostream& os,const vector<T>& v){\\n if(v.empty()){\\n os<<\\\"{ }\\\";\\n return os;\\n }\\n os<<\\\"{\\\"<<v.front();\\n for(auto itr=++v.begin();itr!=v.end();itr++){\\n os<<\\\", \\\"<<*itr;\\n }\\n os<<\\\"}\\\";\\n return os;\\n}\\n\\ntemplate<typename T_first,typename T_second>\\nostream& operator<<(ostream& os,const pair<T_first,T_second>& P){\\n os<<\\\"(\\\"<<P.first;\\n os<<\\\", \\\"<<P.second;\\n os<<\\\")\\\";\\n return os;\\n}\\n\\ntemplate<class DP>\\nclass ReRooting{\\npublic:\\n struct edge{\\n int to;\\n int rev;\\n edge(int to=-1,int rev=-1):to(to),rev(rev){}\\n };\\n\\n using E=function<DP(int)>; \\n using F=function<DP(DP,DP)>;\\n using F_=function<DP(DP)>;\\n int n;\\n vector<vector<edge>> path;\\n vector<vector<DP>> edges_dp;\\n E e;\\n vector<DP> res;\\n F merge;\\n F_ mapping;\\n\\n ReRooting(int n,E e,F merge,F_ mapping):n(n),e(e),merge(merge),mapping(mapping){\\n res.assign(n,e(-1));\\n path.assign(n,vector<edge>(0));\\n edges_dp.assign(n,vector<DP>(0));\\n }\\n\\n void add_edge(int from,int to){\\n path[from].push_back(edge{to,(int)path[to].size()});\\n path[to].push_back(edge{from,(int)path[from].size()-1});\\n edges_dp[from].push_back(e(to));\\n edges_dp[to].push_back(e(from));\\n }\\n\\n void solve(){\\n dfs(0,-1,-1);\\n bfs(0);\\n }\\n\\n DP dfs(int s,int p,int idx){\\n if(s==0){\\n rep(i,(int)path[s].size()){\\n dfs(path[s][i].to,s,i);\\n }\\n return DP{};\\n }\\n\\n DP& cur_edge=edges_dp[p][idx];\\n rep(i,(int)path[s].size()){\\n if(path[s][i].to==p) continue;\\n cur_edge=merge(cur_edge,dfs(path[s][i].to,s,i));\\n }\\n cur_edge=mapping(cur_edge);\\n\\n return cur_edge;\\n }\\n\\n void bfs(int start){\\n vector<bool> visited(n,false);\\n queue<int> que;\\n que.push(start);\\n while(!que.empty()){\\n int s=que.front();\\n que.pop();\\n int degree=(int)path[s].size();\\n vector<DP> merge_left(degree,e(-1));\\n vector<DP> merge_right(degree,e(-1));\\n for(int i=1;i<degree;i++){\\n merge_left[i]=merge(edges_dp[s][i-1],merge_left[i-1]);\\n }\\n for(int i=degree-2;i>=0;i--){\\n merge_right[i]=merge(edges_dp[s][i+1],merge_right[i+1]);\\n }\\n rep(i,degree){\\n if(visited[path[s][i].to]) continue;\\n edge& cur_edge=path[s][i];\\n edges_dp[cur_edge.to][cur_edge.rev]=merge(edges_dp[cur_edge.to][cur_edge.rev],merge_left[i]);\\n edges_dp[cur_edge.to][cur_edge.rev]=merge(edges_dp[cur_edge.to][cur_edge.rev],merge_right[i]);\\n edges_dp[cur_edge.to][cur_edge.rev]=mapping(edges_dp[cur_edge.to][cur_edge.rev]);\\n que.push(cur_edge.to);\\n }\\n res[s]=merge(edges_dp[s][0],merge_right[0]);\\n visited[s]=true;\\n }\\n }\\n};\\n\\nvector<ll> l;\\n\\n//using DP=intなども可\\nstruct DP{\\n int to;\\n ll dp;\\n ll sum;\\n};\\nDP e(int to=-1){\\n return DP{to,0,0}; \\n}\\nDP dp_merge(DP p,DP a){\\n p.dp=p.dp+a.dp;\\n p.sum=p.sum+a.sum;\\n return p;\\n}\\nDP mapping(DP x){\\n x.sum=x.sum+l[x.to];\\n x.dp=x.dp+x.sum;\\n return x;\\n}\\n\\nint main(){\\n int n; cin>>n;\\n l.assign(n,0);\\n rep(i,n) cin>>l[i];\\n ReRooting<DP> tdp(n,e,dp_merge,mapping);\\n rep(i,n-1){\\n int a,b; cin>>a>>b;\\n tdp.add_edge(a-1,b-1);\\n }\\n tdp.solve();\\n rep(i,n) printf(\\\"%lld\\\\n\\\",tdp.res[i].dp);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 40836,\n \"score_of_the_acc\": -1.2643,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3163_4876903\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n////////////////////////////// Begin Macros\\n\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define in(x, a, b) (a <= x and x < b)\\n#define rep(i, N) for (int i = 0; i < (int)(N); i++)\\n#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i--)\\n#define rep1(i, N) for (int i = 1; i <= (int)(N); i++)\\n#define rep1rev(i, N) for (int i = (int)(N); i >= 0; i--)\\n#define forbe(i, b, e) for (int i = (b); i < (e); i++)\\n#define forberev(i, b, e) for (int i = (e)-1; i >= (b); i--)\\n#define forfl(i, f, l) for (int i = (f); i <= (l); i++)\\n#define forflrev(i, f, l) for (int i = (l); i >= (f); i--)\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pil = pair<int, ll>;\\nusing pli = pair<ll, int>;\\nusing pll = pair<ll, ll>;\\n\\ntemplate <typename T>\\nbool chmax(T &m, const T q)\\n{\\n if (m < q)\\n {\\n m = q;\\n return true;\\n }\\n else\\n return false;\\n}\\ntemplate <typename T>\\nbool chmin(T &m, const T q)\\n{\\n if (m > q)\\n {\\n m = q;\\n return true;\\n }\\n else\\n return false;\\n}\\ntemplate <typename T1, typename T2>\\npair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first + r.first, l.second + r.second}; }\\ntemplate <typename T1, typename T2>\\npair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first - r.first, l.second - r.second}; }\\ntemplate <typename T>\\npair<T, T> operator*(const pair<T, T> &l, const T &r) { return {l.first * r, l.second * r}; }\\ntemplate <typename T>\\npair<T, T> operator/(const pair<T, T> &l, const T &r) { return {l.first / r, l.second / r}; }\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &vec)\\n{\\n for (auto &v : vec)\\n is >> v;\\n return is;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const vector<T> &vec)\\n{\\n os << \\\"[\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"]\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const deque<T> &vec)\\n{\\n os << \\\"deq[\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"]\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const set<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const unordered_set<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const multiset<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const unordered_multiset<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &pa)\\n{\\n is >> pa.first >> pa.second;\\n return is;\\n}\\ntemplate <typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &pa)\\n{\\n os << \\\"(\\\" << pa.first << \\\",\\\" << pa.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename... Ts>\\nistream &operator>>(istream &is, tuple<Ts...> &theTuple)\\n{\\n apply([&is](Ts &... tupleArgs) { ((is >> tupleArgs), ...); }, theTuple);\\n return is;\\n}\\ntemplate <typename... Ts>\\nostream &operator<<(ostream &os, const tuple<Ts...> &theTuple)\\n{\\n apply([&os](const Ts &... tupleArgs) {\\n os << '(';\\n size_t n(0);\\n ((os << tupleArgs << (++n < sizeof...(Ts) ? \\\",\\\" : \\\"\\\")), ...);\\n os << ')';\\n },\\n theTuple);\\n return os;\\n}\\ntemplate <typename TK, typename TV>\\nostream &operator<<(ostream &os, const map<TK, TV> &mp)\\n{\\n os << \\\"{\\\";\\n for (auto v : mp)\\n os << v.first << \\\"=>\\\" << v.second << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename TK, typename TV>\\nostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp)\\n{\\n os << \\\"{\\\";\\n for (auto v : mp)\\n os << v.first << \\\"=>\\\" << v.second << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\n\\ntemplate <typename T>\\nvoid reset(vector<T> &v, const T reset_to)\\n{\\n for (auto &x : v)\\n x = reset_to;\\n}\\ninline int popcount(const unsigned int x) { return __builtin_popcount(x); }\\n#define dbg(x) cerr << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << endl;\\n\\nll nC2(ll n)\\n{\\n return n * (n - 1) / 2;\\n}\\n\\nconst int intinf = numeric_limits<int>::max();\\nconst ll llinf = numeric_limits<ll>::max();\\nconst pii udlr[4] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\\n\\n////////////////////////////// End Macros\\n\\n// Graph.h start--------------------------------------------\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <typename Weight>\\nstruct Vertex;\\ntemplate <typename Weight>\\nstruct Edge;\\n\\ntemplate <typename Weight>\\nstruct Vertex\\n{\\n int id;\\n long long l;\\n vector<int> ids_dst;\\n vector<Edge<Weight>> edges;\\n\\n Vertex(const int id = 0) : id(id){};\\n int &operator[](int n) { return ids_dst[n]; }\\n const int &operator[](int n) const { return ids_dst[n]; }\\n\\n size_t size() const { return edges.size(); }\\n void add_edge(const Edge<Weight> &);\\n};\\n\\ntemplate <typename Weight>\\nstruct Edge\\n{\\n int id_src, id_dst;\\n Weight weight;\\n\\n Edge(const int id_src, const int id_dst) : id_src(id_src), id_dst(id_dst){};\\n Edge(const int id_src, const int id_dst, const Weight weight) : id_src(id_src), id_dst(id_dst), weight(weight){};\\n};\\ntemplate <typename Weight>\\nostream &operator<<(ostream &os, const Edge<Weight> &e) { return os << \\\"Edge(\\\" << e.id_src << \\\"->\\\" << e.id_dst << \\\",\\\" << e.weight << \\\")\\\"; }\\n\\ntemplate <typename Weight = long long>\\nstruct Graph\\n{\\n vector<Vertex<Weight>> vertices;\\n vector<Edge<Weight>> edges;\\n\\n Graph(const int nvertices = 0);\\n Vertex<Weight> &operator[](int n) { return vertices[n]; }\\n const Vertex<Weight> &operator[](int n) const { return vertices[n]; }\\n\\n size_t size() const { return vertices.size(); }\\n void add_edge(const Edge<Weight> &);\\n void add_edge(const int id_src, const int id_dst) { add_edge({id_src, id_dst}); };\\n void add_edge(const int id_src, const int id_dst, const Weight w) { add_edge({id_src, id_dst, w}); };\\n};\\ntemplate <typename Weight>\\nostream &operator<<(ostream &os, const Graph<Weight> &g)\\n{\\n cout << \\\"Graph(\\\" << g.size() << \\\")\\\"\\n << \\\"[\\\" << endl;\\n for (auto &e : g.edges)\\n os << \\\" \\\" << e << \\\",\\\" << endl;\\n cout << \\\"]\\\";\\n return os;\\n}\\n\\n//----------------------------------------------------------\\n\\ntemplate <typename Weight>\\nvoid Vertex<Weight>::add_edge(const Edge<Weight> &e)\\n{\\n edges.push_back(e);\\n ids_dst.push_back(e.id_dst);\\n}\\n\\ntemplate <typename Weight>\\nbool operator<(const Edge<Weight> &e1, const Edge<Weight> &e2)\\n{\\n return e1.weight != e2.weight ? e1.weight > e2.weight : // !!INVERSE!!\\n e1.id_src != e2.id_src ? e1.id_src < e2.id_src : e1.id_dst < e2.id_dst;\\n}\\n\\ntemplate <typename Weight>\\nGraph<Weight>::Graph(const int nvertices)\\n{\\n for (int id = 0; id < nvertices; id++)\\n vertices.emplace_back(id);\\n}\\ntemplate <typename Weight>\\nvoid Graph<Weight>::add_edge(const Edge<Weight> &e)\\n{\\n edges.push_back(e);\\n vertices[e.id_src].add_edge(e);\\n}\\n\\ntemplate <typename Weight>\\nGraph<Weight> make_tree(Graph<Weight> &g)\\n{\\n int nvertices = g.size();\\n Graph<Weight> g_tree(nvertices);\\n queue<int> q;\\n vector<bool> is_used(nvertices, false);\\n\\n int v_start = 0;\\n q.push(v_start);\\n is_used[v_start] = true;\\n while (!q.empty())\\n {\\n int v = q.front();\\n q.pop();\\n for (int c : g[v].ids_dst)\\n {\\n if (is_used[c])\\n continue;\\n g_tree.add_edge(v, c);\\n g_tree.add_edge(c, v);\\n q.push(c);\\n is_used[c] = true;\\n }\\n }\\n\\n return g_tree;\\n}\\n\\n// Graph.h end----------------------------------------------\\n\\n// Rerooting.h start--------------------------------------------\\n\\n#include <vector>\\n#include <set>\\n\\ntemplate <typename Weight>\\nstruct Rerooting\\n{\\n const vector<Vertex<Weight>> &vertices;\\n\\n // edit from here ----------------------------------------------------\\n struct DP\\n {\\n long long b;\\n ll sum_l;\\n DP() : b(0), sum_l(0){};\\n DP &operator+=(const DP &rhs)\\n {\\n sum_l += rhs.sum_l;\\n b += rhs.b;\\n return *this;\\n }\\n // DP &operator-=(const DP &rhs)\\n // {\\n // sum_l -= rhs.sum_l;\\n // b -= rhs.b;\\n // return *this;\\n // }\\n inline DP operator+(const DP &rhs) const\\n {\\n return DP(*this) += rhs;\\n }\\n // inline DP operator-(const DP &rhs) const\\n // {\\n // return DP(*this) -= rhs;\\n // }\\n };\\n DP add_root(DP dp, const int v)\\n {\\n dp.b += dp.sum_l;\\n dp.sum_l += vertices[v].l;\\n return dp;\\n }\\n\\n // edit until here ----------------------------------------------------\\n\\n vector<vector<DP>> dp;\\n vector<DP> ans;\\n Rerooting(const Graph<Weight> &g) : vertices(g.vertices), dp(g.size()), ans(g.size()){};\\n\\n void init()\\n {\\n const int root_init = 0;\\n dfs(root_init);\\n bfs(root_init);\\n }\\n DP dfs(int v, int parent = -1)\\n {\\n DP dp_sum;\\n int n = vertices[v].size();\\n dp[v] = vector<DP>(n);\\n for (int i = 0; i < n; i++)\\n {\\n const int child = vertices[v][i];\\n if (child == parent)\\n continue;\\n dp_sum += dp[v][i] = dfs(child, v);\\n }\\n return add_root(dp_sum, v);\\n }\\n void bfs(int v, int parent = -1, const DP &dp_parent = DP())\\n {\\n const int n = vertices[v].size();\\n for (int i = 0; i < n; i++)\\n if (vertices[v][i] == parent)\\n dp[v][i] = dp_parent;\\n\\n vector<DP> dp_sum_left(n + 1);\\n for (int i = 0; i < n; i++)\\n dp_sum_left[i + 1] = dp_sum_left[i] + dp[v][i];\\n vector<DP> dp_sum_right(n + 1);\\n for (int i = n - 1; i >= 0; i--)\\n dp_sum_right[i] = dp[v][i] + dp_sum_right[i + 1];\\n\\n ans[v] = add_root(dp_sum_left[n], v);\\n\\n for (int i = 0; i < n; i++)\\n {\\n int child = vertices[v][i];\\n if (child == parent)\\n continue;\\n const DP dp_sum_without_i = dp_sum_left[i] + dp_sum_right[i + 1];\\n bfs(child, v, add_root(dp_sum_without_i, v));\\n }\\n }\\n};\\n\\n// Rerooting.h end----------------------------------------------\\n\\nvoid solve()\\n{\\n int N;\\n cin >> N;\\n Graph g(N);\\n rep(i, N)\\n {\\n int l;\\n cin >> l;\\n g[i].l = l;\\n }\\n rep(i, N - 1)\\n {\\n int a, b;\\n cin >> a >> b;\\n a--;\\n b--;\\n g.add_edge(a, b);\\n g.add_edge(b, a);\\n }\\n\\n Rerooting rt(g);\\n rt.init();\\n auto ans = rt.ans;\\n rep(i, N)\\n {\\n cout << ans[i].b << endl;\\n }\\n}\\n\\nint main()\\n{\\n cout << fixed << setprecision(15);\\n\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 51440,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3163_4876858\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n////////////////////////////// Begin Macros\\n\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define in(x, a, b) (a <= x and x < b)\\n#define rep(i, N) for (int i = 0; i < (int)(N); i++)\\n#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i--)\\n#define rep1(i, N) for (int i = 1; i <= (int)(N); i++)\\n#define rep1rev(i, N) for (int i = (int)(N); i >= 0; i--)\\n#define forbe(i, b, e) for (int i = (b); i < (e); i++)\\n#define forberev(i, b, e) for (int i = (e)-1; i >= (b); i--)\\n#define forfl(i, f, l) for (int i = (f); i <= (l); i++)\\n#define forflrev(i, f, l) for (int i = (l); i >= (f); i--)\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pil = pair<int, ll>;\\nusing pli = pair<ll, int>;\\nusing pll = pair<ll, ll>;\\n\\ntemplate <typename T>\\nbool chmax(T &m, const T q)\\n{\\n if (m < q)\\n {\\n m = q;\\n return true;\\n }\\n else\\n return false;\\n}\\ntemplate <typename T>\\nbool chmin(T &m, const T q)\\n{\\n if (m > q)\\n {\\n m = q;\\n return true;\\n }\\n else\\n return false;\\n}\\ntemplate <typename T1, typename T2>\\npair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first + r.first, l.second + r.second}; }\\ntemplate <typename T1, typename T2>\\npair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first - r.first, l.second - r.second}; }\\ntemplate <typename T>\\npair<T, T> operator*(const pair<T, T> &l, const T &r) { return {l.first * r, l.second * r}; }\\ntemplate <typename T>\\npair<T, T> operator/(const pair<T, T> &l, const T &r) { return {l.first / r, l.second / r}; }\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &vec)\\n{\\n for (auto &v : vec)\\n is >> v;\\n return is;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const vector<T> &vec)\\n{\\n os << \\\"[\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"]\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const deque<T> &vec)\\n{\\n os << \\\"deq[\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"]\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const set<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const unordered_set<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const multiset<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const unordered_multiset<T> &vec)\\n{\\n os << \\\"{\\\";\\n for (auto v : vec)\\n os << v << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &pa)\\n{\\n is >> pa.first >> pa.second;\\n return is;\\n}\\ntemplate <typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &pa)\\n{\\n os << \\\"(\\\" << pa.first << \\\",\\\" << pa.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename... Ts>\\nistream &operator>>(istream &is, tuple<Ts...> &theTuple)\\n{\\n apply([&is](Ts &... tupleArgs) { ((is >> tupleArgs), ...); }, theTuple);\\n return is;\\n}\\ntemplate <typename... Ts>\\nostream &operator<<(ostream &os, const tuple<Ts...> &theTuple)\\n{\\n apply([&os](const Ts &... tupleArgs) {\\n os << '(';\\n size_t n(0);\\n ((os << tupleArgs << (++n < sizeof...(Ts) ? \\\",\\\" : \\\"\\\")), ...);\\n os << ')';\\n },\\n theTuple);\\n return os;\\n}\\ntemplate <typename TK, typename TV>\\nostream &operator<<(ostream &os, const map<TK, TV> &mp)\\n{\\n os << \\\"{\\\";\\n for (auto v : mp)\\n os << v.first << \\\"=>\\\" << v.second << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename TK, typename TV>\\nostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp)\\n{\\n os << \\\"{\\\";\\n for (auto v : mp)\\n os << v.first << \\\"=>\\\" << v.second << \\\",\\\";\\n os << \\\"}\\\";\\n return os;\\n}\\n\\ntemplate <typename T>\\nvoid reset(vector<T> &v, const T reset_to)\\n{\\n for (auto &x : v)\\n x = reset_to;\\n}\\ninline int popcount(const unsigned int x) { return __builtin_popcount(x); }\\n#define dbg(x) cerr << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << endl;\\n\\nll nC2(ll n)\\n{\\n return n * (n - 1) / 2;\\n}\\n\\nconst int intinf = numeric_limits<int>::max();\\nconst ll llinf = numeric_limits<ll>::max();\\nconst pii udlr[4] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\\n\\n////////////////////////////// End Macros\\n\\n// Graph.h start--------------------------------------------\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <typename Weight>\\nstruct Vertex;\\ntemplate <typename Weight>\\nstruct Edge;\\n\\ntemplate <typename Weight>\\nstruct Vertex\\n{\\n int id;\\n long long l;\\n vector<int> ids_dst;\\n vector<Edge<Weight>> edges;\\n\\n Vertex(const int id = 0) : id(id){};\\n int &operator[](int n) { return ids_dst[n]; }\\n const int &operator[](int n) const { return ids_dst[n]; }\\n\\n size_t size() const { return edges.size(); }\\n void add_edge(const Edge<Weight> &);\\n};\\n\\ntemplate <typename Weight>\\nstruct Edge\\n{\\n int id_src, id_dst;\\n Weight weight;\\n\\n Edge(const int id_src, const int id_dst) : id_src(id_src), id_dst(id_dst){};\\n Edge(const int id_src, const int id_dst, const Weight weight) : id_src(id_src), id_dst(id_dst), weight(weight){};\\n};\\ntemplate <typename Weight>\\nostream &operator<<(ostream &os, const Edge<Weight> &e) { return os << \\\"Edge(\\\" << e.id_src << \\\"->\\\" << e.id_dst << \\\",\\\" << e.weight << \\\")\\\"; }\\n\\ntemplate <typename Weight = long long>\\nstruct Graph\\n{\\n vector<Vertex<Weight>> vertices;\\n vector<Edge<Weight>> edges;\\n\\n Graph(const int nvertices = 0);\\n Vertex<Weight> &operator[](int n) { return vertices[n]; }\\n const Vertex<Weight> &operator[](int n) const { return vertices[n]; }\\n\\n size_t size() const { return vertices.size(); }\\n void add_edge(const Edge<Weight> &);\\n void add_edge(const int id_src, const int id_dst) { add_edge({id_src, id_dst}); };\\n void add_edge(const int id_src, const int id_dst, const Weight w) { add_edge({id_src, id_dst, w}); };\\n};\\ntemplate <typename Weight>\\nostream &operator<<(ostream &os, const Graph<Weight> &g)\\n{\\n cout << \\\"Graph(\\\" << g.size() << \\\")\\\"\\n << \\\"[\\\" << endl;\\n for (auto &e : g.edges)\\n os << \\\" \\\" << e << \\\",\\\" << endl;\\n cout << \\\"]\\\";\\n return os;\\n}\\n\\n//----------------------------------------------------------\\n\\ntemplate <typename Weight>\\nvoid Vertex<Weight>::add_edge(const Edge<Weight> &e)\\n{\\n edges.push_back(e);\\n ids_dst.push_back(e.id_dst);\\n}\\n\\ntemplate <typename Weight>\\nbool operator<(const Edge<Weight> &e1, const Edge<Weight> &e2)\\n{\\n return e1.weight != e2.weight ? e1.weight > e2.weight : // !!INVERSE!!\\n e1.id_src != e2.id_src ? e1.id_src < e2.id_src : e1.id_dst < e2.id_dst;\\n}\\n\\ntemplate <typename Weight>\\nGraph<Weight>::Graph(const int nvertices)\\n{\\n for (int id = 0; id < nvertices; id++)\\n vertices.emplace_back(id);\\n}\\ntemplate <typename Weight>\\nvoid Graph<Weight>::add_edge(const Edge<Weight> &e)\\n{\\n edges.push_back(e);\\n vertices[e.id_src].add_edge(e);\\n}\\n\\ntemplate <typename Weight>\\nGraph<Weight> make_tree(Graph<Weight> &g)\\n{\\n int nvertices = g.size();\\n Graph<Weight> g_tree(nvertices);\\n queue<int> q;\\n vector<bool> is_used(nvertices, false);\\n\\n int v_start = 0;\\n q.push(v_start);\\n is_used[v_start] = true;\\n while (!q.empty())\\n {\\n int v = q.front();\\n q.pop();\\n for (int c : g[v].ids_dst)\\n {\\n if (is_used[c])\\n continue;\\n g_tree.add_edge(v, c);\\n g_tree.add_edge(c, v);\\n q.push(c);\\n is_used[c] = true;\\n }\\n }\\n\\n return g_tree;\\n}\\n\\n// Graph.h end----------------------------------------------\\n\\n// Rerooting.h start--------------------------------------------\\n\\n#include <vector>\\n#include <set>\\n\\ntemplate <typename Weight>\\nstruct Rerooting\\n{\\n const vector<Vertex<Weight>> &vertices;\\n\\n // edit from here ----------------------------------------------------\\n struct DP\\n {\\n long long b;\\n ll sum_l;\\n DP() : b(0), sum_l(0){};\\n DP &operator+=(const DP &rhs)\\n {\\n sum_l += rhs.sum_l;\\n b += rhs.b + rhs.sum_l;\\n return *this;\\n }\\n DP &operator-=(const DP &rhs)\\n {\\n sum_l -= rhs.sum_l;\\n b -= rhs.b + rhs.sum_l;\\n return *this;\\n }\\n inline DP operator+(const DP &rhs) const\\n {\\n return DP(*this) += rhs;\\n }\\n inline DP operator-(const DP &rhs) const\\n {\\n return DP(*this) -= rhs;\\n }\\n };\\n DP add_root(DP dp, const int v)\\n {\\n dp.sum_l += vertices[v].l;\\n return dp;\\n }\\n\\n // edit until here ----------------------------------------------------\\n\\n vector<vector<DP>> dp;\\n vector<DP> ans;\\n Rerooting(const Graph<Weight> &g) : vertices(g.vertices), dp(g.size()), ans(g.size()){};\\n\\n void init()\\n {\\n const int root_init = 0;\\n dfs(root_init);\\n bfs(root_init);\\n }\\n DP dfs(int v, int parent = -1)\\n {\\n DP dp_sum;\\n int n = vertices[v].size();\\n dp[v] = vector<DP>(n);\\n for (int i = 0; i < n; i++)\\n {\\n const int child = vertices[v][i];\\n if (child == parent)\\n continue;\\n dp_sum += dp[v][i] = dfs(child, v);\\n }\\n return add_root(dp_sum, v);\\n }\\n\\n void bfs(int v, int parent = -1, const DP &dp_parent = DP())\\n {\\n const int n = vertices[v].size();\\n for (int i = 0; i < n; i++)\\n if (vertices[v][i] == parent)\\n dp[v][i] = dp_parent;\\n\\n DP dp_sum;\\n for (int i = 0; i < n; i++)\\n dp_sum += dp[v][i];\\n\\n ans[v] = add_root(dp_sum, v);\\n for (int i = 0; i < n; i++)\\n {\\n int child = vertices[v][i];\\n if (child == parent)\\n continue;\\n const DP dp_sum_without_i = dp_sum - dp[v][i];\\n bfs(child, v, add_root(dp_sum_without_i, v));\\n }\\n }\\n};\\n\\n// Rerooting.h end----------------------------------------------\\n\\nvoid solve()\\n{\\n int N;\\n cin >> N;\\n Graph g(N);\\n rep(i, N)\\n {\\n int l;\\n cin >> l;\\n g[i].l = l;\\n }\\n rep(i, N - 1)\\n {\\n int a, b;\\n cin >> a >> b;\\n a--;\\n b--;\\n g.add_edge(a, b);\\n g.add_edge(b, a);\\n }\\n\\n Rerooting rt(g);\\n rt.init();\\n auto ans = rt.ans;\\n rep(i, N)\\n {\\n cout << ans[i].b << endl;\\n }\\n}\\n\\nint main()\\n{\\n cout << fixed << setprecision(15);\\n\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 40896,\n \"score_of_the_acc\": -1.6658,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3163_4875922\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\nconst int N = 100010;\\nll L[N];\\nvector<int> G[N];\\n\\nll sL = 0;\\n\\nll s[N], d[N];\\nvoid calc(int v, int p) {\\n s[v] = L[v];\\n for (int e : G[v])\\n if (e != p) {\\n d[e] = d[v] + 1;\\n calc(e, v);\\n s[v] += s[e];\\n }\\n}\\n\\nll ans[N];\\nvoid dfs(int v, int p, ll now) {\\n ans[v] = now;\\n for (int e : G[v])\\n if (e != p) {\\n ll t = now - s[e] + (sL - s[e]);\\n dfs(e, v, t);\\n }\\n}\\n\\nint main() {\\n int n;\\n cin >> n;\\n rep(i, n) {\\n cin >> L[i];\\n sL += L[i];\\n }\\n rep(i, n - 1) {\\n int a, b;\\n cin >> a >> b;\\n --a;\\n --b;\\n G[a].pb(b);\\n G[b].pb(a);\\n }\\n\\n calc(0, -1);\\n\\n ll v0 = 0;\\n rep(i, n) v0 += L[i] * d[i];\\n\\n dfs(0, -1, v0);\\n\\n rep(i, n) cout << ans[i] << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 16988,\n \"score_of_the_acc\": -0.5924,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":1978,"cells":{"group_id":{"kind":"string","value":"aoj_3162_cpp"},"problem_description":{"kind":"string","value":"Problem L: Count Pow Sum\nProblem\n$Q$ 個の3つの整数の組 $(a_i,l_i,r_i) (1 \\leq i \\leq Q)$ が与えられる。\nそれぞれの組に対し、\n\t$\\displaystyle \\sum_{k=l_i}^{r_i}\\left\\lfloor{\\left(a_i+\\sqrt{a_i^2-1}\\right)^k}\\right\\rfloor$ を $10^9+7$\n\tで割った余りを求めよ。\n但し、$\\lfloor{x}\\rfloor$ は $x$ 以下である最大の整数を表す。\nConstraints\n入力は以下の条件を満たす。\n$1 \\leq Q \\leq 10000$\n$1 \\leq a_i \\leq 10^9$\n$0 \\leq l_i \\leq r_i \\leq 10^9$\n入力は全て整数である。\nInput\n入力は以下の形式で与えられる。\n$Q$\n$a_1$ $l_1$ $r_1$\n$a_2$ $l_2$ $r_2$\n$\\vdots$\n$a_Q$ $l_Q$ $r_Q$\nOutput\n$Q$ 個のクエリそれぞれに対し、 $\\displaystyle \\sum_{k=l_i}^{r_i}\\left\\lfloor{\\left(a_i+\\sqrt{a_i^2-1}\\right)^k}\\right\\rfloor$ を\n\t$10^9+7$ で割った余りを出力せよ。\n末尾の改行を忘れないこと。\nSample Input 1\n5\n2 0 0\n2 1 1\n2 2 2\n2 3 3\n2 2 3\nSample Output 1\n1\n3\n13\n51\n64\n$\\left\\lfloor\\left(2+\\sqrt{3}\\right)^0\\right\\rfloor=1$\n$\\left\\lfloor\\left(2+\\sqrt{3}\\right)^1\\right\\rfloor=\\left\\lfloor 2+\\sqrt{3}\\right\\rfloor=3$\n$\\left\\lfloor\\left(2+\\sqrt{3}\\right)^2\\right\\rfloor=\\left\\lfloor 7+4\\sqrt{3}\\right\\rfloor=13$\n$\\left\\lfloor\\left(2+\\sqrt{3}\\right)^3\\right\\rfloor=\\left\\lfloor 26+15\\sqrt{3}\\right\\rfloor=51$\nより、\n\tそれぞれ\n$1$\n$3$\n$13$\n$51$\n$13+51=64$\nが答えになります。\nSample Input 2\n10\n459404297 517642810 741889747\n581992024 866504331 929744396\n222841627 420642437 697287723\n683338343 430705406 509597170\n390891363 475139614 643827664\n855081312 565758976 925253656\n883384773 466157419 667964073\n962783174 289373011 576778244\n843984728 54647959 959764601\n825451551 69560986 411653622\nSample Output 2\n818692813\n502289003\n874771119\n265904125\n166949046\n644621561\n489591300\n573971217\n378976183\n486013871\n$10^9+7$ で割った余りを求めてください。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3162_9739986","code_snippet":"#include <iostream>\n#include <algorithm>\nusing namespace std;\ntypedef long long int ll;\nconstexpr ll mod=1e9+7;\n\nstruct mat{\n\tll x[3][3];\n\tfriend mat operator*(mat &a,mat &b){\n\t\tmat c;\n\t\tfor(int i=0;i<3;i++){\n\t\t\tfor(int j=0;j<3;j++){\n\t\t\t\tc.x[i][j]=0;\n\t\t\t\tfor(int k=0;k<3;k++){\n\t\t\t\t\t(c.x[i][j]+=a.x[i][k]*b.x[k][j]%mod)%=mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn c;\n\t}\n};\n\nmat x,res;\n\nll mod_pow(int n){\n\twhile(n){\n\t\tif(n%2)res=x*res;\n\t\tx=x*x;\n\t\tn>>=1;\n\t}\n\treturn res.x[0][0];\n}\n\nvoid init(ll a){\n\tfor(int i=0;i<3;i++)for(int j=0;j<3;j++)x.x[i][j]=res.x[i][j]=0;\n\tres.x[0][0]=2,res.x[1][0]=1;\n\tx.x[0][0]=1,x.x[0][1]=2*a,x.x[0][2]=2*(a*a-1);\n\tx.x[1][1]=a,x.x[1][2]=a*a-1;\n\tx.x[2][1]=1,x.x[2][2]=a;\n\tfor(int i=0;i<3;i++)for(int j=0;j<3;j++)x.x[i][j]%=mod;\n\treturn;\n}\n\nll solve(int a,int l,int r){\n\tif(a==1)return (r-l+1);\n\tinit(a); ll R=mod_pow(r);\n\tinit(a); ll L=(l?mod_pow(l-1):0);\n\tll val=(R-L-(r-l+1))%mod;\n\treturn (val+mod)%mod;\n}\n\nint main(){\n\tint q; cin >> q;\n\twhile(q--){\n\t\tint a,l,r; cin >> a >> l >> r;\n\t\tcout << solve(a,l,r) << \"\\n\";\n\t}\n}","accuracy":1,"time_ms":60,"memory_kb":3440,"score_of_the_acc":-0.6761,"final_rank":7},{"submission_id":"aoj_3162_5128860","code_snippet":"#line 1 \"a.cpp\"\n#include<iostream>\nusing namespace std;\n#line 3 \"/home/kotatsugame/library/math/modint.cpp\"\n#include<utility>\ntemplate<int m>\nstruct modint{\n\tunsigned int x;\n\tconstexpr modint()noexcept:x(){}\n\ttemplate<typename T>\n\tconstexpr modint(T x_)noexcept:x((x_%=m)<0?x_+m:x_){}\n\tconstexpr unsigned int val()const noexcept{return x;}\n\tconstexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}\n\tconstexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}\n\tconstexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}\n\tconstexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}\n\tconstexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}\n\tconstexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}\n\tconstexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}\n\tconstexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}\n\tconstexpr modint operator+()const noexcept{return*this;}\n\tconstexpr modint operator-()const noexcept{return modint()-*this;}\n\tconstexpr modint pow(long long n)const noexcept\n\t{\n\t\tif(n<0)return pow(-n).inv();\n\t\tmodint x=*this,r=1;\n\t\tfor(;n;x*=x,n>>=1)if(n&1)r*=x;\n\t\treturn r;\n\t}\n\tconstexpr modint inv()const noexcept\n\t{\n\t\tint s=x,t=m,x=1,u=0;\n\t\twhile(t)\n\t\t{\n\t\t\tint k=s/t;\n\t\t\ts-=k*t;\n\t\t\tswap(s,t);\n\t\t\tx-=k*u;\n\t\t\tswap(x,u);\n\t\t}\n\t\treturn modint(x);\n\t}\n\tfriend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}\n\tfriend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}\n\tfriend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}\n\tfriend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}\n\tfriend constexpr bool operator==(const modint&a,const modint&b){return a.x==b.x;}\n\tfriend constexpr bool operator!=(const modint&a,const modint&b){return a.x!=b.x;}\n\tfriend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}\n\tfriend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}\n};\n#line 1 \"/home/kotatsugame/library/math/squarematrix.cpp\"\n#include<array>\ntemplate<typename T,unsigned int N>\nstruct Matrix{\n\tarray<array<T,N>,N>dat;\n\tarray<T,N>&operator[](int i){return dat[i];}\n\tconst array<T,N>&operator[](int i)const{return dat[i];}\n\tstatic Matrix eye(){\n\t\tMatrix res;\n\t\tfor(int i=0;i<N;i++)res[i][i]=1;\n\t\treturn res;\n\t}\n\tMatrix operator+(const Matrix&A)const{\n\t\tMatrix res;\n\t\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)\n\t\t\tres[i][j]=dat[i][j]+A[i][j];\n\t\treturn res;\n\t}\n\tMatrix operator*(const Matrix&A)const{\n\t\tMatrix res;\n\t\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)for(int k=0;k<N;k++)\n\t\t\tres[i][j]+=dat[i][k]*A[k][j];\n\t\treturn res;\n\t}\n\tMatrix pow(long long n)const{\n\t\tMatrix a=*this,res=eye();\n\t\tfor(;n;a=a*a,n>>=1)if(n&1)res=res*a;\n\t\treturn res;\n\t}\n};\n#line 5 \"a.cpp\"\nusing mint=modint<(int)1e9+7>;\nusing mat=Matrix<mint,3>;\nint Q,A;\nmint f(int N)\n{\n\tif(N<0)return 0;\n\tmat X;\n\tX[0][0]=1;\n\tX[0][1]=1;\n\tX[1][1]=2*A;\n\tX[1][2]=-1;\n\tX[2][1]=1;\n\tX=X.pow(N);\n\treturn X[0][0]*2+X[0][1]*2*A+X[0][2]*2-N-1;\n}\nmain()\n{\n\tcin>>Q;\n\tfor(;Q--;)\n\t{\n\t\tint L,R;\n\t\tcin>>A>>L>>R;\n\t\tcout<<f(R)-f(L-1)<<endl;\n\t}\n}","accuracy":1,"time_ms":70,"memory_kb":3104,"score_of_the_acc":-0.1739,"final_rank":2},{"submission_id":"aoj_3162_4867538","code_snippet":"#pragma GCC target(\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\n// #include<ext/pb_ds/assoc_container.hpp>\n// #include<ext/pb_ds/tree_policy.hpp>\n// #include<ext/pb_ds/tag_and_trait.hpp>\n// using namespace __gnu_pbds;\n// #include<boost/multiprecision/cpp_int.hpp>\n// namespace multiprecisioninteger = boost::multiprecision;\n// using cint=multiprecisioninteger::cpp_int;\nusing namespace std;\nusing ll=long long;\n#define double long double\nusing datas=pair<ll,ll>;\nusing ddatas=pair<double,double>;\nusing tdata=pair<ll,datas>;\nusing vec=vector<ll>;\nusing mat=vector<vec>;\nusing pvec=vector<datas>;\nusing pmat=vector<pvec>;\n// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;\n#define For(i,a,b) for(i=a;i<(ll)b;++i)\n#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)\n#define rep(i,N) For(i,0,N)\n#define rep1(i,N) For(i,1,N)\n#define brep(i,N) bFor(i,N,0)\n#define brep1(i,N) bFor(i,N,1)\n#define all(v) (v).begin(),(v).end()\n#define allr(v) (v).rbegin(),(v).rend()\n#define vsort(v) sort(all(v))\n#define vrsort(v) sort(allr(v))\n#define endl \"\\n\"\n#define eb emplace_back\n#define print(v) cout<<v<<endl\n#define printyes cout<<\"Yes\"<<endl\n#define printno cout<<\"No\"<<endl\n#define printYES cout<<\"YES\"<<endl\n#define printNO cout<<\"NO\"<<endl\n#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?\" \":\"\")<<outi;f=1;}cout<<endl;}while(0)\n#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)\nconst ll mod=1000000007;\n// const ll mod=998244353;\nconst ll inf=1LL<<60;\nconst double PI = acos(-1);\nconst double eps = 1e-9;\ntemplate<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} \ntemplate<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} \n\nvoid startupcpp(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout<<fixed<<setprecision(15);\n}\n\ndouble distance(ddatas x,ddatas y){\n double a=x.first-y.first,b=x.second-y.second;\n return sqrt(a*a+b*b);\n}\n\nll modinv(ll a,ll m=mod) {\n ll b=m,u=1,v=0,t;\n while(b){\n t=a/b;\n a-=t*b; swap(a,b);\n u-=t*v; swap(u,v);\n }\n return (u+m)%m;\n}\n\nll moddevide(ll a,ll b){return (a*modinv(b))%mod;}\n\nvec modncrlistp,modncrlistm;\n\nll modncr(ll n,ll r){\n if(n<r)return 0;\n ll i,size=modncrlistp.size();\n if(size<=n){\n modncrlistp.resize(n+1);\n modncrlistm.resize(n+1);\n if(!size){\n modncrlistp[0]=modncrlistm[0]=1;\n size++;\n }\n For(i,size,n+1){\n modncrlistp[i]=modncrlistp[i-1]*i%mod;\n modncrlistm[i]=modinv(modncrlistp[i]);\n }\n }\n return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;\n}\n\nll modpow(ll a,ll n,ll m=mod){\n ll res=1;\n while(n>0){\n if(n&1)res=res*a%m;\n a=a*a%m;\n n>>=1;\n }\n return res;\n}\n\nll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\n\nll countdigits(ll n){\n ll ans=0;\n while(n){n/=10;ans++;}\n return ans;\n}\n\nll sumdigits(ll n){\n ll ans=0;\n while(n){ans+=n%10;n/=10;}\n return ans;\n}\nclass matrix{\n mat a;\n ll H,W;\npublic:\n matrix(mat& g):a(g){\n H=g.size();\n W=g[0].size();\n }\n matrix(ll i,ll j):a(i,vec(j,0)){H=i;W=j;}\n matrix(ll n):a(n,vec(n,0)){H=W=n;}\n inline vec& operator [](int k){\n return a.at(k);\n }\n // matrix operator =(matrix b){\n // this->a.swap(b->a);\n // this->H=b.H;\n // this->W=b.W;\n // return (*this);\n // }\n matrix operator +=(matrix b){\n ll i,j;\n rep(i,this->H)rep(j,this->W)(*this)[i][j]+=b[i][j];\n return (*this);\n }\n matrix operator -=(matrix b){\n ll i,j;\n rep(i,this->H)rep(j,this->W)(*this)[i][j]-=b[i][j];\n return (*this);\n }\n matrix operator *=(matrix b){\n ll i,j,k;\n assert(this->W==b.H);\n matrix c(this->H,b.W);\n rep(i,this->H)rep(j,b.W){\n c[i][j]=0;\n rep(k,this->W)(c[i][j]+=(*this)[i][k]*b[k][j]%mod)%=mod;\n }\n (*this)=c;\n return (*this);\n }\n matrix operator ^=(ll K){\n assert(this->H==this->W);\n matrix c(this->H);\n ll i;\n rep(i,this->H)c[i][i]=1;\n if(K&1)c*=(*this);\n while(K){\n K>>=1;\n (*this)*=(*this);\n if(K&1)c*=(*this);\n }\n this->a.swap(c.a);\n return (*this);\n }\n matrix operator +(matrix c){\n return matrix(*this)+=c;\n }\n matrix operator -(matrix c){\n return matrix(*this)-=c;\n }\n matrix operator *(matrix c){\n return matrix(*this)*=c;\n }\n matrix operator ^(ll K){\n return matrix(*this)^=K;\n }\n void out(){\n for(auto x:a)output(x);\n }\n};\n\nint main(){\n startupcpp();\n int codeforces;cin>>codeforces;while(codeforces--){\n ll i,j,a,l,r,ans;\n cin>>a>>l>>r;\n if(r==0){\n print(1);\n continue;\n }\n if(a==1){\n print(r-l+1);\n continue;\n }\n l+=ans=!l;\n ans-=r-l+1;\n matrix g(2),I(2),v(2,1);\n I[0][0]=I[1][1]=1;\n v[0][0]=-1;v[1][0]=1;\n g[0][0]=2*a%mod;g[0][1]=-1;g[1][0]=1;g[1][1]=0;\n auto xg=I-(g^(r-l+1));\n auto ansg=(g^(l-1))*xg*v;\n ans+=ansg[0][0];\n ans%=mod;\n if(ans<0)ans+=mod;\n print(ans);\n}\n}","accuracy":1,"time_ms":160,"memory_kb":3476,"score_of_the_acc":-0.9597,"final_rank":14},{"submission_id":"aoj_3162_4865597","code_snippet":"#include <iostream>\n#include <array>\n\n\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m < 2^31`\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace ac = atcoder;\n\ntemplate <class T, int D>\nstruct Vector {\n using V = std::array<T, D>;\n\n V vec;\n\n // constructor\n Vector(T val = 0) { vec.fill(val); }\n\n // getter\n T& operator[](int i) { return vec[i]; }\n T operator[](int i) const { return vec[i]; }\n typename V::iterator begin() { return vec.begin(); }\n typename V::iterator end() { return vec.end(); }\n\n // arithmetic\n Vector operator+(const Vector& v) const { return Vector(*this) += v; }\n Vector operator-(const Vector& v) const { return Vector(*this) -= v; }\n T operator*(const Vector& v) const {\n T ret(0);\n for (int i = 0; i < D; ++i) ret += vec[i] * v[i];\n return ret;\n }\n\n // compound assignment\n Vector& operator+=(const Vector& v) {\n for (int i = 0; i < D; ++i) vec[i] += v[i];\n return *this;\n }\n Vector& operator-=(const Vector& v) {\n for (int i = 0; i < D; ++i) vec[i] -= v[i];\n return *this;\n }\n};\n\ntemplate <class T, int D>\nstruct Matrix {\n using M = std::array<std::array<T, D>, D>;\n\n M mat;\n\n // constructor\n Matrix(T val = 0) {\n for (auto& v : mat) v.fill(val);\n }\n\n static Matrix id() {\n Matrix m;\n for (int i = 0; i < D; ++i) m[i][i] = 1;\n return m;\n }\n\n // getter\n std::array<T, D>& operator[](int i) { return mat[i]; }\n std::array<T, D> operator[](int i) const { return mat[i]; }\n typename M::iterator begin() { return mat.begin(); }\n typename M::iterator end() { return mat.end(); }\n\n // arithmetic\n Matrix operator+(const Matrix& m) const { return Matrix(*this) += m; }\n Matrix operator-(const Matrix& m) const { return Matrix(*this) -= m; }\n Matrix operator*(const Matrix& m) const { return Matrix(*this) *= m; }\n\n template <class U>\n Matrix pow(U k) {\n Matrix ret = id();\n Matrix a = *this;\n\n while (k > 0) {\n if (k & 1) ret *= a;\n a *= a;\n k >>= 1;\n }\n return ret;\n }\n\n // compound assignment\n Matrix& operator+=(const Matrix& m) {\n for (int i = 0; i < D; ++i) {\n for (int j = 0; j < D; ++j) {\n mat[i][j] += m[i][j];\n }\n }\n return *this;\n }\n Matrix& operator-=(const Matrix& m) {\n for (int i = 0; i < D; ++i) {\n for (int j = 0; j < D; ++j) {\n mat[i][j] -= m[i][j];\n }\n }\n return *this;\n }\n Matrix& operator*=(const Matrix& m) {\n M nmat;\n for (auto& v : nmat) v.fill(0);\n\n for (int i = 0; i < D; ++i) {\n for (int j = 0; j < D; ++j) {\n for (int k = 0; k < D; ++k) {\n nmat[i][j] += mat[i][k] * m[k][j];\n }\n }\n }\n mat = nmat;\n return *this;\n }\n\n // arithmetic with vector\n using Vec = Vector<T, D>;\n Vec operator*(const Vec& v) {\n Vec ret;\n for (int i = 0; i < D; ++i) {\n for (int j = 0; j < D; ++j) {\n ret[i] += mat[i][j] * v[j];\n }\n }\n return ret;\n }\n};\n\nusing mint = ac::modint1000000007;\nusing Vec = Vector<mint, 3>;\nusing Mat = Matrix<mint, 3>;\n\nmint calc(int n, int a) {\n Vec v; // p, q, psum\n v[0] = 1;\n\n Mat m;\n m[0][0] = a, m[0][1] = mint(a) * a - 1;\n m[1][0] = 1, m[1][1] = a;\n m[2][0] = 1, m[2][2] = 1;\n\n auto psum = (m.pow(n) * v)[2];\n return psum * 2 - n;\n}\n\nvoid solve() {\n int a, l, r;\n std::cin >> a >> l >> r;\n\n auto ans = calc(r + 1, a) - calc(l, a);\n std::cout << ans.val() << \"\\n\";\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n int q;\n std::cin >> q;\n while (q--) solve();\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3460,"score_of_the_acc":-0.6619,"final_rank":6},{"submission_id":"aoj_3162_4861056","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(1e9 + 7)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\ntemplate <class T>\nstruct Matrix {\n vector<vector<T>> A;\n Matrix() {}\n Matrix(size_t m, size_t n) : A(m, vector<T>(n, 0)) {}\n Matrix(size_t n) : A(n, vector<T>(n, 0)) {}\n size_t height() const { return (A.size()); }\n size_t width() const { return (A[0].size()); }\n inline const vector<T> &operator[](int k) const { return (A.at(k)); }\n inline vector<T> &operator[](int k) { return (A.at(k)); }\n static Matrix E(size_t n) {\n Matrix mat(n);\n for (int i = 0; i < n; ++i) mat[i][i] = 1;\n return (mat);\n }\n Matrix &operator+=(const Matrix &B) {\n size_t m = height(), n = width();\n assert(m == B.height() && n == B.width());\n for (int i = 0; i < m; ++i)\n for (int j = 0; j < n; ++j) (*this)[i][j] += B[i][j];\n return (*this);\n }\n Matrix &operator-=(const Matrix &B) {\n size_t m = height(), n = width();\n assert(m == B.height() && n == B.width());\n for (int i = 0; i < m; ++i)\n for (int j = 0; j < n; ++j) (*this)[i][j] -= B[i][j];\n return (*this);\n }\n Matrix &operator*=(const Matrix &B) {\n size_t m = height(), n = B.width(), p = width();\n assert(p == B.height());\n vector<vector<T>> C(m, vector<T>(n, 0));\n for (int i = 0; i < m; ++i)\n for (int k = 0; k < p; ++k) {\n T tmp = (*this)[i][k];\n for (int j = 0; j < n; ++j) C[i][j] += tmp * B[k][j];\n }\n A.swap(C);\n return (*this);\n }\n Matrix &operator^=(long long k) {\n Matrix B = Matrix::E(height());\n while (k) {\n if (k & 1) B *= *this;\n *this *= *this;\n k >>= 1;\n }\n A.swap(B.A);\n return (*this);\n }\n\n Matrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }\n Matrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }\n Matrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }\n Matrix operator^(const long long k) const { return (Matrix(*this) ^= k); }\n friend ostream &operator<<(ostream &os, Matrix &p) {\n size_t m = p.height(), n = p.width();\n for (int i = 0; i < m; i++) {\n os << \"[\";\n for (int j = 0; j < n; j++) {\n os << p[i][j] << (j + 1 == n ? \"]\\n\" : \",\");\n }\n }\n return (os);\n }\n};\n\nint q, a, l, r;\n\nModInt<> calc(int x);\n\nint main() {\n cin >> q;\n for (int i = 0; i < q; ++i) {\n cin >> a >> l >> r;\n cout << calc(r) - calc(l - 1) << endl;\n }\n return 0;\n}\n\nModInt<> calc(int x) {\n if (x < 0) return 0;\n if (a == 1) return x + 1;\n long long b = (long long)a * a - 1;\n Matrix<ModInt<>> mat(4, 4), vec(4, 1);\n mat[0][0] = mat[2][1] = mat[3][3] = vec[0][0] = vec[1][0] = vec[3][0] = 1;\n mat[0][3] = -1;\n mat[0][1] = 2 * a;\n mat[0][2] = 2 * b;\n mat[1][1] = mat[2][2] = a;\n mat[1][2] = b;\n return ((mat ^ x) * vec)[0][0];\n}","accuracy":1,"time_ms":180,"memory_kb":3456,"score_of_the_acc":-0.9739,"final_rank":15},{"submission_id":"aoj_3162_4835779","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2020.09.13 15:07:01 */\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region aliases\n\n#define rep(i, n) for(long long i = 0; i < (n); i++)\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bcnt(n) __builtin_popcountll(n)\n#define endk endl\n#define ednl endl\n#define enld endl\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vb = vector<bool>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing mll = map<long long, long long>;\nusing pll = pair<long long, long long>;\nusing qll = queue<long long>;\nusing sll = set<long long>;\nusing vpll = vector<pair<long long, long long>>;\ntemplate <class T = ll>\nusing V = vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\n//昇順pq(小さい方から取り出す)\ntemplate <class T = ll>\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\n//降順pq(大きい方から取り出す)\ntemplate <class T = ll>\nusing pqdn = priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\nlong long const dekai = 3e16;\nconst long double pi = acos(-1);\nconst char el = '\\n';\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\n\nconst int mod = 1000000007;\n// const int mod = 998244353;\n\n#pragma endregion\n\n#pragma region basic_procedure\n\ntemplate <class T>\ninline bool isin(T x, T lef, T rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { cout << (f ? \"Yes\" : \"No\") << \"\\n\"; }\nvoid No() { cout << \"No\\n\"; }\nvoid YES(bool f = 1) { cout << (f ? \"YES\" : \"NO\") << \"\\n\"; }\nvoid NO() { cout << \"NO\\n\"; }\ntemplate <class T>\nvoid drop(T answer) {\n\tcout << answer << \"\\n\";\n\texit(0);\n}\nvoid err() {\n\tcout << -1 << \"\\n\";\n\texit(0);\n}\n\nvector<long long> vin(long long n) { //整数n個の入力を受け取ってベクトルに突っ込んで返す\n\tvector<long long> v(n);\n\tfor(long long i = 0; i < n; i++) {\n\t\tcin >> v[i];\n\t}\n\treturn v;\n}\n\n//ベクトルの出力(検証済)\n// vectorの中身を出力する 答えの出力に利用可能\ntemplate <class T>\nvoid vout(vector<T> &v, bool tate = 0) {\n\tif(v.size() > 0) {\n\t\tfor(auto it = v.begin(); it < v.end(); it++) {\n\t\t\tcout << *it;\n\t\t\tif(it != v.end() - 1) {\n\t\t\t\tif(tate)\n\t\t\t\t\tcout << endl;\n\t\t\t\telse\n\t\t\t\t\tcout << \" \";\n\t\t\t}\n\t\t}\n\t}\n\tcout << endl;\n}\n\ntemplate <class T>\nvoid add(vector<T> &v, T val) {\t //ベクトルの各要素に加算\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\n// vectorの中身を数える map<要素,個数>を返す\ntemplate <class T>\nmap<T, long long> cntv(vector<T> v) {\n\tmap<T, long long> m;\n\tfor(auto &g : v) {\n\t\tif(m.count(g))\n\t\t\tm[g]++;\n\t\telse\n\t\t\tm[g] = 1;\n\t}\n\treturn m;\n}\n\n//配列圧縮(検証済)\n//{1,36,1,3,8,-2,-92}を\n//{2, 5,2,3,4, 1, 0}にする\ntemplate <class T>\nvector<long long> press(vector<T> &v) {\n\tlong long n = v.size();\n\tvector<long long> w(n);\n\tmap<T, long long> m;\n\tfor(T &p : v) m[p] = 0;\n\tlong long i = 0;\n\tfor(auto &p : m) {\n\t\tp.second = i;\n\t\ti++;\n\t}\n\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\n\treturn w;\n}\n\ntemplate <class T>\nT divup(T a, T b) {\n\t//端数繰りあがり割り算\n\tassert(b != 0);\n\tT x = abs(a);\n\tT y = abs(b);\n\tT z = (x + y - 1) / y;\n\tif((a < 0 && b > 0) || (a > 0 && b < 0))\n\t\treturn -z;\n\telse if(a == 0)\n\t\treturn 0;\n\telse\n\t\treturn z;\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\ntemplate <class T>\nint sgn(T x) {\t//符号関数\n\tif(x < 0) return -1;\n\tif(x == 0) return 0;\n\treturn 1;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\n// a * x % mod == __gcd(a,mod)なるxを返す\n// a が modの倍数でないことが条件\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tswap(a, b);\n\t\tu -= t * v;\n\t\tswap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\nvvll comb(100, vll(100, -1));\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\n\tassert(n < 100 && k < 100);\n\tif(n < k || k < 0 || n < 0) return 0;\n\tif(comb[n][k] != -1) return comb[n][k];\n\tll res;\n\tif(n - k < k)\n\t\tres = com(n, n - k);\n\telse if(k == 0)\n\t\tres = 1;\n\telse\n\t\tres = com(n - 1, k - 1) + com(n - 1, k);\n\tcomb[n][k] = res;\n\treturn res;\n}\n\n// nCk modを求める\nconst ll MAX = 5100000;\n// この値は求める二項計数の値に応じて変える\n// MAX=3*10^7のとき1900msほど、ほぼ比例\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid cominit() {\n\t// テーブルを作る前処理\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor(ll i = 2; i < MAX; i++) {\n\t\tfac[i] = fac[i - 1] * i % mod;\n\t\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\n\t\tfinv[i] = finv[i - 1] * inv[i] % mod;\n\t}\n}\nlong long commod(ll n, ll k) {\t// 二項係数計算\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\nlong long pmod(ll n, ll k) { //順列計算\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * finv[n - k] % mod;\n}\nlong long hmod(ll n, ll k) { // nHk計算\n\t// n個の区別しないoを区別するk個の箱に入れる方法の総数\n\t//(n+k-1)C(k-1)と等しい\n\treturn commod(n + k - 1, n);\n}\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tINPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tINPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n\ntemplate <class T>\nvoid scan(T &a) {\n\tcin >> a;\n}\ntemplate <class T>\nvoid scan(vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\ntemplate <class T, class L>\nvoid scan(pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\ntemplate <class T>\ninline void print(T x) {\n\tcout << x << '\\n';\n}\n\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tcerr << \", \";\n\tview(p.second);\n\tcerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(std::set<T> &s) {\n\tif(s.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tcerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tcerr << \", \";\n\t\tview(c.second);\n\t\tcerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tcerr << \"] : \";\n\t\tview(t.second);\n\t\tcerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tview(H);\n\tcerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tcerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tview(x); \\\n\t\tcerr << \"\\n\"; \\\n\t} while(0)\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\nstruct mint {\n\tlong long x;\n\tmint(long long x = 0) : x((x % mod + mod) % mod) {}\n\tmint operator-() const { return mint(-x); }\n\tmint &operator+=(const mint a) {\n\t\tif((x += a.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tmint &operator-=(const mint a) {\n\t\tif((x += mod - a.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tmint &operator*=(const mint a) {\n\t\t(x *= a.x) %= mod;\n\t\treturn *this;\n\t}\n\tmint operator+(const mint a) const { return mint(*this) += a; }\n\tmint operator-(const mint a) const { return mint(*this) -= a; }\n\tmint operator*(const mint a) const { return mint(*this) *= a; }\n\tmint pow(long long t) const {\n\t\tif(!t) return 1;\n\t\tmint a = pow(t >> 1);\n\t\ta *= a;\n\t\tif(t & 1) a *= *this;\n\t\treturn a;\n\t}\n\n\t// for prime mod\n\tmint inv() const { return pow(mod - 2); }\n\tmint &operator/=(const mint a) { return *this *= a.inv(); }\n\tmint operator/(const mint a) const { return mint(*this) /= a; }\n};\nostream &operator<<(ostream &os, const mint &a) { return os << a.x; }\n\ntemplate <class T, int a, int b = a>\nstruct matrix {\t // a * b 行列\n\tvector<vector<T>> mat;\n\tmatrix() : mat(a, vector<T>(b, (T)0)) {}\n\tmatrix(vector<vector<T>> vec) : mat(a, vector<T>(b)) {\n\t\tfor(int i = 0; i < a; i++) {\n\t\t\tfor(int j = 0; j < b; j++) {\n\t\t\t\tmat[i][j] = vec[i][j];\n\t\t\t}\n\t\t}\n\t}\n\tmatrix<T, a, b> &operator=(vector<vector<T>> vec) {\n\t\tfor(int i = 0; i < a; i++) {\n\t\t\tfor(int j = 0; j < b; j++) {\n\t\t\t\tmat[i][j] = vec[i][j];\n\t\t\t}\n\t\t}\n\t\treturn *this;\n\t}\n\tvector<T> &operator[](int row) { return mat[row]; }\n\n\tmatrix<T, a, b> operator-() const {\n\t\tauto m = *this;\n\t\tfor(int i = 0; i < a; i++) {\n\t\t\tfor(int j = 0; j < b; j++) {\n\t\t\t\tm.mat[i][j] *= -1;\n\t\t\t}\n\t\t}\n\t\treturn m;\n\t}\n\n\tmatrix<T, a, b> &operator+=(const matrix<T, a, b> other) {\n\t\tfor(int i = 0; i < a; i++) {\n\t\t\tfor(int j = 0; j < b; j++) {\n\t\t\t\tmat[i][j] += other.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn *this;\n\t}\n\tmatrix<T, a, b> operator+(matrix<T, a, b> other) {\n\t\tfor(int i = 0; i < a; i++) {\n\t\t\tfor(int j = 0; j < b; j++) {\n\t\t\t\tother.mat[i][j] += mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn other;\n\t}\n\tmatrix<T, a, b> &operator-=(const matrix<T, a, b> other) {\n\t\tfor(int i = 0; i < a; i++) {\n\t\t\tfor(int j = 0; j < b; j++) {\n\t\t\t\tmat[i][j] -= other.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn *this;\n\t}\n\tmatrix<T, a, b> operator-(matrix<T, a, b> other) {\n\t\tfor(int i = 0; i < a; i++) {\n\t\t\tfor(int j = 0; j < b; j++) {\n\t\t\t\tother.mat[i][j] = mat[i][j] - other.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn other;\n\t}\n\ttemplate <int c>\n\tmatrix<T, a, c> operator*(const matrix<T, b, c> other) {\n\t\tmatrix<T, a, c> res;\n\t\tfor(int i = 0; i < a; i++) {\n\t\t\tfor(int j = 0; j < c; j++) {\n\t\t\t\tfor(int k = 0; k < b; k++) {\n\t\t\t\t\tres.mat[i][j] += mat[i][k] * other.mat[k][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\tmatrix<T, a, b> &operator*=(const matrix<T, b, b> other) {\n\t\tmatrix<T, a, b> res;\n\t\tfor(int i = 0; i < a; i++) {\n\t\t\tfor(int j = 0; j < b; j++) {\n\t\t\t\tfor(int k = 0; k < b; k++) {\n\t\t\t\t\tres.mat[i][j] += mat[i][k] * other.mat[k][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn *this = res;\n\t}\n\ttemplate <class U>\n\tmatrix<T, a, a> pow(U n) {\t// n乗\n\t\tassert(a == b);\n\t\tmatrix<T, a, a> ret;\n\t\tret.unit();\n\t\tmatrix<T, a, a> m = *this;\n\t\twhile(n > 0) {\n\t\t\tif(n & 1) ret *= m;\n\t\t\tn /= 2;\n\t\t\tm *= m;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tvoid print() {\n\t\tfor(int i = 0; i < a; i++) {\n\t\t\tfor(int j = 0; j < b; j++) {\n\t\t\t\tcout << mat[i][j];\n\t\t\t\tcout << (j == b - 1 ? \"\\n\" : \" \");\n\t\t\t}\n\t\t}\n\t}\n\tvoid zero() { // 0行列\n\t\tfor(int i = 0; i < a; i++)\n\t\t\tfor(int j = 0; j < b; j++) mat[i][j] = 0;\n\t}\n\tvoid unit() { //単位行列\n\t\tfor(int i = 0; i < a; i++)\n\t\t\tfor(int j = 0; j < b; j++) mat[i][j] = (i == j ? 1 : 0);\n\t}\n};\n\ntemplate <class T, int a, int b>\nvoid view(matrix<T, a, b> mat) {\n\tview(mat.mat);\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tINT(q);\n\tvector<mint> ans(q);\n\n\trep(i, q) {\n\t\tINT(a, l, r);\n\t\tif(a == 1) {\n\t\t\tans[i] = r - l + 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\t// debug(a, l, r);\n\n\t\tmatrix<mint, 3, 3> mat;\n\t\tmat.mat = {{1, 1, 0}, {0, 2 * a, -1}, {0, 1, 0}};\n\n\t\tauto p = mat.pow(r);\n\n\t\tif(l >= 1) {\n\t\t\tauto rr = mat.pow(l - 1);\n\t\t\tdebug(p, rr);\n\t\t\tp -= rr;\n\t\t}\n\n\t\tmatrix<mint, 3, 1> t;\n\t\tt.mat = {{2}, {2 * a}, {2}};\n\t\tmatrix<mint, 3, 1> g = p * t;\n\n\t\t// debug(mat, g, t);\n\t\t// d//ump(p);\n\n\t\tans[i] = g[0][0] - (r - l + 1);\n\t}\n\tvout(ans, 1);\n\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":3616,"score_of_the_acc":-1.1557,"final_rank":20},{"submission_id":"aoj_3162_4835530","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <set>\n#include <tuple>\n#define mkp make_pair\n#define mkt make_tuple\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=1e9+7;\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\n\ntypedef vector<ll> vec;//ll?\ntypedef vector<vec> mat;\n\nmat mul(mat &A,mat &B){\n mat C(A.size(),vec(B[0].size()));\n for(int i=0;i<A.size();i++){\n for(int k=0;k<B.size();k++){\n for(int j=0;j<B[0].size();j++){\n C[i][j]=(C[i][j]+(A[i][k]*B[k][j])%MOD)%MOD;\n }\n }\n }\n return C;\n}\n\nmat pow(mat A,ll n){\n mat B(A.size(),vec(A.size()));\n for(int i=0;i<A.size();i++){\n B[i][i]=1;\n }\n while(n>0){\n if(n&1) B=mul(B,A);\n A=mul(A,A);\n n=(n>>1);\n }\n return B;\n}\n\nll solve(ll R,ll A){\n if(R==0) return 2;\n if(R==1) return (2*A+2)%MOD;\n\n mat B(3,vec(3,0));\n B[0][0]=2*A%MOD;B[0][1]=MOD-1;B[0][2]=0;\n B[1][0]=1;B[1][1]=0;B[1][2]=0;\n B[2][0]=2*A%MOD;B[2][1]=MOD-1;B[2][2]=1;\n\n mat C=pow(B,R-1);\n ll ans=(C[2][0]*2%MOD*A%MOD+C[2][1]*2%MOD+C[2][2]*(2*A%MOD+2)%MOD)%MOD;\n return ans;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int Q;\n cin>>Q;\n rep(q,Q){\n ll A,L,R;\n cin>>A>>L>>R;\n\n ll ans=solve(R,A);\n if(L-1>=0) ans=(ans-solve(L-1,A)+MOD)%MOD;\n ans=(ans-(R-L+1)+MOD)%MOD;\n cout<<ans<<\"\\n\";\n }\n\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":3216,"score_of_the_acc":-0.5761,"final_rank":4},{"submission_id":"aoj_3162_4835403","code_snippet":"#include<stdio.h>\n#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<utility>\n#include<map>\n#include<set>\n#include<queue>\n#include<stack>\n#include<functional>\n#include<math.h>\n#include<random>\n#include <bitset>\n#include <deque>\nusing namespace std;\n#define N (1000000000+7)\n//#define N 998244353\n#define INF 1e16\ntypedef long long ll;\ntypedef pair<int,int> P;\ntypedef pair<int,P> Q;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\nconst int inf = (int)1e9; \n \nll gcd(ll a, ll b) {\n\tif (b > a) {\n\t\tll tmp = b;\n\t\tb = a;\n\t\ta = tmp;\n\t}\n\tif (a%b == 0)return b;\n\telse return gcd(b, a%b);\n}\n\nmat mul(mat &A,mat &B){\n mat C(A.size(),vec(B[0].size()));\n for(int i=0;i<A.size();i++){\n for(int k=0;k<B.size();k++){\n for(int j=0;j<B[0].size();j++){\n ll t = (A[i][k]*B[k][j])%N;\n C[i][j] = (C[i][j]+t)%N;\n C[i][j] = (C[i][j]+N)%N;\n }\n }\n }\n return C;\n}\n\nmat Pow(mat A,ll n){\n mat B(A.size(),vec(A.size()));\n for(int i=0;i<A.size();i++)B[i][i]=1LL;\n while(n>0){\n if(n&1)B = mul(B,A);\n A = mul(A,A);\n n>>=1;\n }\n return B;\n}\n\nint main(void){\n\tint q;\n\tcin>>q;\n\twhile(q--){\n\t\tll a,l,r;\n\t\tcin>>a>>l>>r;\n\t\tmat A(2,vec(2));\n\t\tA[0][0] = (2*a)%N;\n\t\tA[0][1] = (-1+N)%N;\n\t\tA[1][0] = 1;\n\t\tif(l==r){\n\t\t\tA = Pow(A,r);\n\t\t\tll ans = (A[1][0]*2*a)%N;\n\t\t\tans = (ans+A[1][1]*2)%N;\n\t\t\tcout<<(ans-1+N)%N<<endl;\n\t\t}\n\t\telse{\n\t\t\tif(l==0){\n\t\t\t\tmat B(2*2,vec(2*2));\n\t\t\t\tfor(int i=0;i<2;i++){\n\t\t\t\t\tfor(int j=0;j<2;j++){\n\t\t\t\t\t\tB[i][j] = A[i][j];\n\t\t\t\t\t}\n\t\t\t\t\tB[2+i][i]=1;\n\t\t\t\t\tB[2+i][2+i]=1;\n\t\t\t\t}\n\t\t\t\tB = Pow(B,r+1);\n\t\t\t\tll ans = (B[2+1][0]*2*a)%N;\n\t\t\t\tans = (ans+B[2+1][1]*2)%N;\n\t\t\t\tans = ans-(r-l+1);\n\t\t\t\tans = (ans+N)%N;\n\t\t\t\tcout<<ans<<endl;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tmat Br(2*2,vec(2*2)),Bl(2*2,vec(2*2));\n\t\t\t\tfor(int i=0;i<2;i++){\n\t\t\t\t\tfor(int j=0;j<2;j++){\n\t\t\t\t\t\tBr[i][j] = A[i][j];\n\t\t\t\t\t\tBl[i][j] = A[i][j];\n\t\t\t\t\t}\n\t\t\t\t\tBr[2+i][i]=1;\n\t\t\t\t\tBr[2+i][2+i]=1;\n\t\t\t\t\tBl[2+i][i]=1;\n\t\t\t\t\tBl[2+i][2+i]=1;\n\t\t\t\t}\n\t\t\t\tBr = Pow(Br,r+1);\n\t\t\t\tBl = Pow(Bl,l);\n\t\t\t\tll ans1 = (Br[3][0]*2*a)%N;\n\t\t\t\tans1 = (ans1+Br[3][1]*2)%N;\n\t\t\t\tll ans2 = (Bl[3][0]*2*a)%N;\n\t\t\t\tans2 = (ans2+Bl[3][1]*2)%N;\n\t\t\t\tll ans = (ans1-ans2+N)%N;\n\t\t\t\tans = (ans-(r-l+1)+N)%N;\n\t\t\t\tcout<<ans<<endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":450,"memory_kb":3156,"score_of_the_acc":-1.1187,"final_rank":19},{"submission_id":"aoj_3162_4834939","code_snippet":"/**\n * author: otera \n**/\n#include<iostream>\n#include<string> \n#include<cstdio>\n#include<cstring>\n#include<vector>\n#include<cmath>\n#include<algorithm> \n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<deque>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\n#define int long long\ntypedef long long ll;\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\ntypedef long double ld;\nconst int inf=1e9+7;\nconst ll INF=1LL<<60 ;\nconst ll mod=1e9+7 ;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef complex<ld> Point;\nconst ld eps = 1e-8;\nconst ld pi = acos(-1.0);\ntypedef pair<int, int> P;\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define debug(x) cerr << #x << \" = \" << (x) << endl;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nmat mul(mat& A, mat& B) {\n mat C(A.size(), vec(B[0].size(), 0));\n for(int i = 0; i < A.size(); ++i) {\n for(int j = 0; j < B[0].size(); ++j) {\n for(int k = 0; k < B.size(); ++k) {\n C[i][j] = (C[i][j] + A[i][k] * B[k][j] % mod) % mod;\n }\n }\n }\n return C;\n}\n\nmat pow(mat A, ll n) {\n mat B(A.size(), vec(A.size(), 0));\n for(int i = 0; i < A.size(); ++i) {\n B[i][i] = 1LL;\n }\n while(n > 0) {\n if(n & 1) B = mul(B, A);\n A = mul(A, A);\n n >>= 1;\n }\n return B;\n}\n\nvoid solve() {\n\tint q; cin >> q;\n rep(_, q) {\n int a, l, r; cin >> a >> l >> r;\n if(a == 1) {\n cout << r - l + 1 << endl;\n continue;\n }\n mat A(3, vec(3, 0));\n A[0][0] = (2 * a + 1) % mod, A[0][1] = (- 2 * a - 1 + 2 * mod) % mod, A[0][2] = 1LL, A[1][0] = 1LL, A[2][1] = 1LL;\n ll sl = 0, sr = 0;\n if(l >= 2) {\n mat B = pow(A, l - 2);\n sl = (B[0][0] * ((2 * a + 2) % mod) % mod + B[0][1] * 2LL % mod) % mod;\n } else {\n if(l == 1) sl = 2;\n if(l == 0) sl = 0;\n }\n if(r + 1 >= 2) {\n mat B = pow(A, r + 1 - 2);\n sr = (B[0][0] * ((2 * a + 2) % mod) % mod + B[0][1] * 2LL % mod) % mod;\n } else {\n sr = 2;\n }\n cout << ((sr - sl + mod) % mod - (r - l + 1) + mod) % mod << endl;\n }\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//int t; cin >> t; rep(i, t)solve();\n\tsolve();\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":3212,"score_of_the_acc":-0.5926,"final_rank":5},{"submission_id":"aoj_3162_4834901","code_snippet":"#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n//#include <atcoder/all>\n//using namespace atcoder;\n//using mint = modint998244353;\n//using mint = modint1000000007;\n#include <bits/stdc++.h>\nusing namespace std;\n//#include <ext/pb_ds/assoc_container.hpp>\n//#include <ext/pb_ds/tree_policy.hpp>\n//using namespace __gnu_pbds;\n//using i128 = __int128_t;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pii = pair<int, int>;\nusing pll = pair<long long, long long>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\n#define all(x) (x).begin(),(x).end()\n#define SZ(x) ((int)(x).size())\nconstexpr char ln = '\\n';\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\ninline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}\ninline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\ninline int popcount(int x) {return __builtin_popcount(x);}\ninline int popcount(long long x) {return __builtin_popcountll(x);}\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\ninline void print() {cout << \"\\n\";}\ntemplate<class T>\ninline void print(const vector<T> &v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \" \";\n print();\n}\ntemplate<class T, class... Args>\ninline void print(const T &x, const Args &... args) {\n cout << x << \" \";\n print(args...);\n}\n#ifdef MINATO_LOCAL\n#define dump(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\ninline void debug() {cerr << endl;}\ntemplate<class T>\ninline void debug(const vector<T> &v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \" \";\n debug();\n}\ntemplate<class T, class... Args>\ninline void debug(const T &x, const Args &... args) {\n cerr << x << \" \";\n debug(args...);\n}\n#else\n#define dump(x) void(0)\ninline void debug() {}\ntemplate<class T> inline void debug(const vector<T> &v) {}\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\n#endif\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\ntemplate<typename T, int sz>\nstruct Matrix {\n \tarray<array<T, sz>, sz> A;\n\tint N;\n\n \tMatrix() : N(sz) {}\n \tMatrix(int N) : N(N) {}\n\n\tconst array<T, sz> &operator[](int k) const {return A[k];}\n \tarray<T, sz> &operator[](int k) {return A[k];}\n\n \tstatic Matrix I(int N) {\n \tMatrix<T, sz> mat(N);\n \tfor(int i = 0; i < N; i++) mat[i][i] = 1;\n \treturn mat;\n \t}\n\n \tMatrix &operator+=(const Matrix &B) {\n \tfor(int i = 0; i < N; i++) {\n \t for(int j = 0; j < N; j++) {\n \t (*this)[i][j] += B[i][j];\n }\n }\n \treturn *this;\n \t}\n\n \tMatrix &operator-=(const Matrix &B) {\n \tfor(int i = 0; i < N; i++) {\n \t\tfor(int j = 0; j < N; j++) {\n\t\t\t\t(*this)[i][j] -= B[i][j];\n\t\t\t}\n\t\t}\n \treturn *this;\n \t}\n\n Matrix &operator*=(const Matrix &B) {\n Matrix<T, sz> C(N);\n for(int i = 0; i < N; i++) {\n for(int k = 0; k < N; k++) {\n for(int j = 0; j < N; j++) {\n C[i][j] += (*this)[i][k] * B[k][j];\n }\n }\n }\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n swap(A[i][j],C.A[i][j]);\n }\n }\n return *this;\n }\n\n Matrix &operator^=(long long k) {\n Matrix<T, sz> B = Matrix<T, sz>::I(N);\n while(k) {\n if(k & 1) B *= *this;\n *this *= *this;\n k >>= 1;\n }\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n swap(A[i][j],B.A[i][j]);\n }\n }\n return *this;\n }\n\n Matrix operator+(const Matrix &B) const {return (Matrix(*this) += B);}\n Matrix operator-(const Matrix &B) const {return (Matrix(*this) -= B);}\n Matrix operator*(const Matrix &B) const {return (Matrix(*this) *= B);}\n Matrix operator^(const long long k) const {return (Matrix(*this) ^= k);}\n};\n\ntemplate <uint_fast64_t Modulus> \nstruct ModInt {\n using u64 = uint_fast64_t;\n\n u64 a;\n\n constexpr ModInt(const long long x = 0) noexcept : a(x >= 0 ? x % Modulus : (Modulus - (-x) % Modulus) % Modulus) {}\n constexpr u64 &value() noexcept {return a;}\n constexpr const u64 &value() const noexcept {return a;}\n constexpr ModInt operator+(const ModInt rhs) const noexcept {return ModInt(*this) += rhs;}\n constexpr ModInt operator-(const ModInt rhs) const noexcept {return ModInt(*this) -= rhs;}\n constexpr ModInt operator*(const ModInt rhs) const noexcept {return ModInt(*this) *= rhs;}\n constexpr ModInt operator/(const ModInt rhs) const noexcept {return ModInt(*this) /= rhs;}\n constexpr ModInt operator^(const long long rhs) const noexcept {return ModInt(*this) ^= rhs;}\n constexpr bool operator==(const ModInt &rhs) const noexcept {return a == rhs.a;}\n constexpr bool operator!=(const ModInt &rhs) const noexcept {return a != rhs.a;}\n constexpr ModInt &operator+=(const ModInt rhs) noexcept {\n a += rhs.a;\n if (a >= Modulus) {\n a -= Modulus;\n }\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt rhs) noexcept {\n if (a < rhs.a) {\n a += Modulus;\n }\n a -= rhs.a;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt rhs) noexcept {\n a = a * rhs.a % Modulus;\n return *this;\n }\n constexpr ModInt &operator/=(ModInt rhs) noexcept {\n u64 exp = Modulus - 2;\n while (exp) {\n if (exp&1) *this *= rhs;\n exp >>= 1;\n rhs *= rhs;\n }\n return *this;\n }\n constexpr ModInt &operator^=(long long exp) noexcept {\n ModInt rhs = a;\n a = 1;\n while (exp) {\n if (exp&1) *this *= rhs;\n exp >>= 1;\n rhs *= rhs;\n }\n return *this;\n }\n\n friend ostream &operator<<(ostream& os, const ModInt& rhs) noexcept {return os << rhs.a;}\n friend istream &operator>>(istream& is, ModInt& rhs) noexcept {long long a; is >> a; rhs = a; return is;}\n};\n\nconstexpr long long MOD = 1000000007;\n//constexpr long long MOD = 998244353;\n\nusing mint = ModInt<MOD>;\n\nint main() {\n Matrix<mint, 4> mat(4);\n int Q; cin >> Q;\n while(Q--) {\n ll a,l,r; cin >> a >> l >> r;\n if (a==1) {\n cout << r-l+1 << ln;\n continue;\n }\n mint root = a*a-1;\n rep(i,4) rep(j,4) mat[i][j] = 0;\n mat[0][0] = mat[2][1] = mat[3][3] = 1;\n mat[0][1] = a*2;\n mat[0][2] = root*2;\n mat[0][3] = -1;\n mat[1][1] = mat[2][2] = a;\n mat[1][2] = root;\n mat ^= r;\n mint ans = mat[0][0]+mat[0][1]+mat[0][3];\n //dump(ans);\n if (l) {\n rep(i,4) rep(j,4) mat[i][j] = 0;\n mat[0][0] = mat[2][1] = mat[3][3] = 1;\n mat[0][1] = a*2;\n mat[0][2] = root*2;\n mat[0][3] = -1;\n mat[1][1] = mat[2][2] = a;\n mat[1][2] = root;\n mat ^= (l-1);\n ans -= mat[0][0]+mat[0][1]+mat[0][3];\n }\n\n cout << ans << ln;\n }\n}","accuracy":1,"time_ms":60,"memory_kb":3452,"score_of_the_acc":-0.6949,"final_rank":8},{"submission_id":"aoj_3162_4834790","code_snippet":"#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\nusing ll = long long;\nconstexpr int INF = 0x3f3f3f3f;\nconstexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr double EPS = 1e-8;\nconstexpr int MOD = 1000000007;\n// constexpr int MOD = 998244353;\nconstexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\nconstexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\nstruct IOSetup {\n IOSetup() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n }\n} iosetup;\n\ntemplate <int MOD>\nstruct MInt {\n unsigned val;\n MInt(): val(0) {}\n MInt(long long x) : val(x >= 0 ? x % MOD : x % MOD + MOD) {}\n static int get_mod() { return MOD; }\n static void set_mod(int divisor) { assert(divisor == MOD); }\n MInt pow(long long exponent) const {\n MInt tmp = *this, res = 1;\n while (exponent > 0) {\n if (exponent & 1) res *= tmp;\n tmp *= tmp;\n exponent >>= 1;\n }\n return res;\n }\n MInt &operator+=(const MInt &x) { if((val += x.val) >= MOD) val -= MOD; return *this; }\n MInt &operator-=(const MInt &x) { if((val += MOD - x.val) >= MOD) val -= MOD; return *this; }\n MInt &operator*=(const MInt &x) { val = static_cast<unsigned long long>(val) * x.val % MOD; return *this; }\n MInt &operator/=(const MInt &x) {\n // assert(std::__gcd(static_cast<int>(x.val), MOD) == 1);\n unsigned a = x.val, b = MOD; int u = 1, v = 0;\n while (b) {\n unsigned tmp = a / b;\n std::swap(a -= tmp * b, b);\n std::swap(u -= tmp * v, v);\n }\n return *this *= u;\n }\n bool operator==(const MInt &x) const { return val == x.val; }\n bool operator!=(const MInt &x) const { return val != x.val; }\n bool operator<(const MInt &x) const { return val < x.val; }\n bool operator<=(const MInt &x) const { return val <= x.val; }\n bool operator>(const MInt &x) const { return val > x.val; }\n bool operator>=(const MInt &x) const { return val >= x.val; }\n MInt &operator++() { if (++val == MOD) val = 0; return *this; }\n MInt operator++(int) { MInt res = *this; ++*this; return res; }\n MInt &operator--() { val = (val == 0 ? MOD : val) - 1; return *this; }\n MInt operator--(int) { MInt res = *this; --*this; return res; }\n MInt operator+() const { return *this; }\n MInt operator-() const { return MInt(val ? MOD - val : 0); }\n MInt operator+(const MInt &x) const { return MInt(*this) += x; }\n MInt operator-(const MInt &x) const { return MInt(*this) -= x; }\n MInt operator*(const MInt &x) const { return MInt(*this) *= x; }\n MInt operator/(const MInt &x) const { return MInt(*this) /= x; }\n friend std::ostream &operator<<(std::ostream &os, const MInt &x) { return os << x.val; }\n friend std::istream &operator>>(std::istream &is, MInt &x) { long long val; is >> val; x = MInt(val); return is; }\n};\nnamespace std { template <int MOD> MInt<MOD> abs(const MInt<MOD> &x) { return x; } }\ntemplate <int MOD>\nstruct Combinatorics {\n using ModInt = MInt<MOD>;\n int val; // \"val!\" and \"mod\" must be disjoint.\n std::vector<ModInt> fact, fact_inv, inv;\n Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {\n fact[0] = 1;\n for (int i = 1; i <= val; ++i) fact[i] = fact[i - 1] * i;\n fact_inv[val] = ModInt(1) / fact[val];\n for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;\n for (int i = 1; i <= val; ++i) inv[i] = fact[i - 1] * fact_inv[i];\n }\n ModInt nCk(int n, int k) const {\n if (n < 0 || n < k || k < 0) return 0;\n assert(n <= val && k <= val);\n return fact[n] * fact_inv[k] * fact_inv[n - k];\n }\n ModInt nPk(int n, int k) const {\n if (n < 0 || n < k || k < 0) return 0;\n assert(n <= val);\n return fact[n] * fact_inv[n - k];\n }\n ModInt nHk(int n, int k) const {\n if (n < 0 || k < 0) return 0;\n return k == 0 ? 1 : nCk(n + k - 1, k);\n }\n};\nusing ModInt = MInt<MOD>;\n\ntemplate <typename T>\nstruct Matrix {\n Matrix(int m, int n, T val = 0) : dat(m, std::vector<T>(n, val)) {}\n\n int height() const { return dat.size(); }\n\n int width() const { return dat.front().size(); }\n\n Matrix pow(long long exponent) const {\n int n = height();\n Matrix<T> tmp = *this, res(n, n, 0);\n for (int i = 0; i < n; ++i) res[i][i] = 1;\n while (exponent > 0) {\n if (exponent & 1) res *= tmp;\n tmp *= tmp;\n exponent >>= 1;\n }\n return res;\n }\n\n inline const std::vector<T> &operator[](const int idx) const { return dat[idx]; }\n inline std::vector<T> &operator[](const int idx) { return dat[idx]; }\n\n Matrix &operator=(const Matrix &x) {\n int m = x.height(), n = x.width();\n dat.resize(m, std::vector<T>(n));\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] = x[i][j];\n return *this;\n }\n\n Matrix &operator+=(const Matrix &x) {\n int m = height(), n = width();\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] += x[i][j];\n return *this;\n }\n\n Matrix &operator-=(const Matrix &x) {\n int m = height(), n = width();\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] -= x[i][j];\n return *this;\n }\n\n Matrix &operator*=(const Matrix &x) {\n int m = height(), n = x.width(), l = width();\n std::vector<std::vector<T>> res(m, std::vector<T>(n, 0));\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) {\n for (int k = 0; k < l; ++k) res[i][j] += dat[i][k] * x[k][j];\n }\n std::swap(dat, res);\n return *this;\n }\n\n Matrix operator+(const Matrix &x) const { return Matrix(*this) += x; }\n\n Matrix operator-(const Matrix &x) const { return Matrix(*this) -= x; }\n\n Matrix operator*(const Matrix &x) const { return Matrix(*this) *= x; }\n\nprivate:\n std::vector<std::vector<T>> dat;\n};\n\nModInt solve(int a, int r) {\n if (r == -1) return 0;\n if (r == 0) return 2;\n Matrix<ModInt> m(3, 3), init(3, 1);\n m[0][0] = 1; m[0][1] = a * 2; m[0][2] = -1;\n m[1][1] = a * 2; m[1][2] = -1;\n m[2][1] = 1;\n init[0][0] = a * 2 + 2;\n init[1][0] = a * 2;\n init[2][0] = 2;\n return (m.pow(r - 1) * init)[0][0];\n}\n\nint main() {\n int q; cin >> q;\n while (q--) {\n int a, l, r; cin >> a >> l >> r;\n cout << solve(a, r) - solve(a, l - 1) - (r - l + 1) << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3452,"score_of_the_acc":-0.7858,"final_rank":10},{"submission_id":"aoj_3162_4834309","code_snippet":"#include<bits/stdc++.h>\n\nint main(){\n using namespace std;\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\n constexpr unsigned long MOD = 1000000007;\n constexpr unsigned long buf_size = 3UL << 18UL;\n char buffer[buf_size];\n fread(buffer, 1, buf_size, stdin);\n unsigned long tmp_buf = 0;\n const auto& read = [&tmp_buf, &buffer]{\n const auto& M_reread_from_stdin = [&]{\n ptrdiff_t len = buf_size - tmp_buf;\n if (len > tmp_buf) return;\n memcpy(buffer, buffer + tmp_buf, len);\n char* tmp = buffer + len;\n fread(tmp, 1, buf_size-len, stdin);\n tmp_buf = 0;\n };\n unsigned long ret;\n from_chars_result tmp{};\n do{\n if (__builtin_expect(buf_size <= tmp_buf + 32, 0))\n M_reread_from_stdin();\n tmp = from_chars(begin(buffer) + tmp_buf, end(buffer), ret);\n tmp_buf = tmp.ptr - buffer + 1;\n }while(tmp.ec != errc{});\n return ret;\n };\n const auto& scan = [scan_impl = [&read](auto& x) -> decltype(auto) { return x = read(); }](auto&...args){ tuple<decltype(args)...>{scan_impl(args)...}; };\n const unsigned long Q{read()};\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\n unsigned long r{b % MOD}, n{MOD - 2};\n while(n){\n if(n & 1)(r *= a) %= MOD;\n (a *= a) %= MOD;\n n >>= 1;\n }\n return r;\n };\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &scan, &a, &l, &r]{\n scan(a, l, r);\n ++r;\n if(a == 1)return r - l;\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\n ret.first %= MOD;\n ret.second %= MOD;\n return ret;\n };\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\n f_1e9_7_va ret{b}, al{a};\n while(n){\n if(n & 1)ret = mul(ret, al);\n al = mul(al, al);\n n >>= 1;\n }\n return ret;\n };\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\n };\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\n }() << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3716,"score_of_the_acc":-0.9938,"final_rank":16},{"submission_id":"aoj_3162_4834305","code_snippet":"#include<bits/stdc++.h>\n\nint main(){\n using namespace std;\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\n constexpr unsigned long MOD = 1000000007;\n constexpr unsigned long buf_size = 1UL << 20UL;\n char buffer[buf_size];\n fread(buffer, 1, buf_size, stdin);\n unsigned long tmp_buf = 0;\n const auto& read = [&tmp_buf, &buffer]{\n const auto& M_reread_from_stdin = [&]{\n ptrdiff_t len = buf_size - tmp_buf;\n if (len > tmp_buf) return;\n memcpy(buffer, buffer + tmp_buf, len);\n char* tmp = buffer + len;\n fread(tmp, 1, buf_size-len, stdin);\n tmp_buf = 0;\n };\n unsigned long ret;\n from_chars_result tmp{};\n do{\n if (__builtin_expect(buf_size <= tmp_buf + 32, 0))\n M_reread_from_stdin();\n tmp = from_chars(begin(buffer) + tmp_buf, end(buffer), ret);\n tmp_buf = tmp.ptr - buffer + 1;\n }while(tmp.ec != errc{});\n return ret;\n };\n const auto& scan = [scan_impl = [&read](auto& x) -> decltype(auto) { return x = read(); }](auto&...args){ tuple<decltype(args)...>{scan_impl(args)...}; };\n const unsigned long Q{read()};\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\n unsigned long r{b % MOD}, n{MOD - 2};\n while(n){\n if(n & 1)(r *= a) %= MOD;\n (a *= a) %= MOD;\n n >>= 1;\n }\n return r;\n };\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &scan, &a, &l, &r]{\n scan(a, l, r);\n ++r;\n if(a == 1)return r - l;\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\n ret.first %= MOD;\n ret.second %= MOD;\n return ret;\n };\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\n f_1e9_7_va ret{b}, al{a};\n while(n){\n if(n & 1)ret = mul(ret, al);\n al = mul(al, al);\n n >>= 1;\n }\n return ret;\n };\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\n };\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\n }() << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3648,"score_of_the_acc":-0.8875,"final_rank":11},{"submission_id":"aoj_3162_4834303","code_snippet":"#include<bits/stdc++.h>\n\nint main(){\n using namespace std;\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\n constexpr unsigned long MOD = 1000000007;\n constexpr unsigned long buf_size = 1UL << 17UL;\n char buffer[buf_size];\n fread(buffer, 1, buf_size, stdin);\n unsigned long tmp_buf = 0;\n const auto& read = [&tmp_buf, &buffer]{\n const auto& M_reread_from_stdin = [&]{\n ptrdiff_t len = buf_size - tmp_buf;\n if (len > tmp_buf) return;\n memcpy(buffer, buffer + tmp_buf, len);\n char* tmp = buffer + len;\n fread(tmp, 1, buf_size-len, stdin);\n tmp_buf = 0;\n };\n unsigned long ret;\n from_chars_result tmp{};\n do{\n if (__builtin_expect(buf_size <= tmp_buf + 20, 0))\n M_reread_from_stdin();\n tmp = from_chars(begin(buffer) + tmp_buf, end(buffer), ret);\n tmp_buf = tmp.ptr - buffer + 1;\n }while(tmp.ec != errc{});\n return ret;\n };\n const auto& scan = [scan_impl = [&read](auto& x) -> decltype(auto) { return x = read(); }](auto&...args){ tuple<decltype(args)...>{scan_impl(args)...}; };\n const unsigned long Q{read()};\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\n unsigned long r{b % MOD}, n{MOD - 2};\n while(n){\n if(n & 1)(r *= a) %= MOD;\n (a *= a) %= MOD;\n n >>= 1;\n }\n return r;\n };\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &scan, &a, &l, &r]{\n scan(a, l, r);\n ++r;\n if(a == 1)return r - l;\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\n ret.first %= MOD;\n ret.second %= MOD;\n return ret;\n };\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\n f_1e9_7_va ret{b}, al{a};\n while(n){\n if(n & 1)ret = mul(ret, al);\n al = mul(al, al);\n n >>= 1;\n }\n return ret;\n };\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\n };\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\n }() << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3540,"score_of_the_acc":-0.7188,"final_rank":9},{"submission_id":"aoj_3162_4834155","code_snippet":"#include<bits/stdc++.h>\n\nint main(){\n using namespace std;\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\n constexpr unsigned long MOD = 1000000007;\n char buffer[1UL << 19UL];\n fread(buffer, 1, size(buffer), stdin);\n unsigned long tmp_buf = 0;\n const auto& read = [&tmp_buf, &buffer]{\n unsigned long ret;\n from_chars_result tmp{};\n do{\n tmp = from_chars(begin(buffer) + tmp_buf, end(buffer), ret);\n tmp_buf = tmp.ptr - buffer + 1;\n }while(tmp.ec != errc{});\n return ret;\n };\n const auto& scan = [scan_impl = [&read](auto& x) -> decltype(auto) {\n return x = read();\n }](auto&...args){\n tuple<decltype(args)...>{scan_impl(args)...};\n };\n const unsigned long Q{read()};\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\n unsigned long r{b % MOD}, n{MOD - 2};\n while(n){\n if(n & 1)(r *= a) %= MOD;\n (a *= a) %= MOD;\n n >>= 1;\n }\n return r;\n };\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &scan, &a, &l, &r]{\n scan(a, l, r);\n ++r;\n if(a == 1)return r - l;\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\n ret.first %= MOD;\n ret.second %= MOD;\n return ret;\n };\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\n f_1e9_7_va ret{b}, al{a};\n while(n){\n if(n & 1)ret = mul(ret, al);\n al = mul(al, al);\n n >>= 1;\n }\n return ret;\n };\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\n };\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\n }() << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3716,"score_of_the_acc":-0.9938,"final_rank":16},{"submission_id":"aoj_3162_4834144","code_snippet":"#include<bits/stdc++.h>\n\nint main(){\n using namespace std;\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\n constexpr unsigned long MOD = 1000000007;\n char buffer[1UL << 19UL];\n fread(buffer, 1, size(buffer), stdin);\n unsigned long tmp_buf = 0;\n const auto& read = [&tmp_buf, &buffer]{\n unsigned long ret;\n from_chars_result tmp{};\n do{\n tmp = from_chars(begin(buffer) + tmp_buf, end(buffer), ret);\n tmp_buf = tmp.ptr - buffer + 1;\n }while(tmp.ec != errc{});\n return ret;\n };\n const auto& scan = [scan_impl = [&read](auto& x) -> auto {\n return x = read();\n }](auto&...args){\n [](auto... args) -> void {}(scan_impl(args)...);\n };\n const unsigned long Q{read()};\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\n unsigned long r{b % MOD}, n{MOD - 2};\n while(n){\n if(n & 1)(r *= a) %= MOD;\n (a *= a) %= MOD;\n n >>= 1;\n }\n return r;\n };\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &scan, &a, &l, &r]{\n scan(r, l, a);\n ++r;\n if(a == 1)return r - l;\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\n ret.first %= MOD;\n ret.second %= MOD;\n return ret;\n };\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\n f_1e9_7_va ret{b}, al{a};\n while(n){\n if(n & 1)ret = mul(ret, al);\n al = mul(al, al);\n n >>= 1;\n }\n return ret;\n };\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\n };\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\n }() << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3720,"score_of_the_acc":-1,"final_rank":18},{"submission_id":"aoj_3162_4834131","code_snippet":"#pragma region Macros\n#pragma GCC optimize(\"O3\")\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define pb push_back\n#define eb emplace_back\n#define vi vector<int>\n#define vll vector<ll>\n#define vpi vector<pii>\n#define vpll vector<pll>\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n#define fi first\n#define se second\n#define all(c) begin(c), end(c)\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\nusing namespace std;\nstring YES[2] = {\"NO\", \"YES\"};\nstring Yes[2] = {\"No\", \"Yes\"};\nstring yes[2] = {\"no\", \"yes\"};\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n#define si(c) (int)(c).size()\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\n scan(head);\n IN(tail...);\n}\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\nvi iota(int n) {\n vi a(n);\n iota(all(a), 0);\n return a;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n sort(all(y));\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\nint popcount(ll x) { return __builtin_popcountll(x); }\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n }\n} setup_io;\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return move(res);\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return move(res);\n}\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n for(auto &e : v) cout << e << \" \";\n cout << endl;\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n cout << \"(\" << p.fi << \", \" << p.se << \")\";\n return os;\n}\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\ntemplate <class A> string to_string(A v) {\n if(v.empty()) return \"{}\";\n string ret = \"{\";\n for(auto &x : v) ret += to_string(x) + \",\";\n ret.back() = '}';\n return ret;\n}\n\nvoid dump() { cerr << endl; }\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#define endl '\\n'\n#ifdef _LOCAL\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\n#define debug(x)\n#endif\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\n#pragma endregion\ntemplate <class T> struct Matrix {\n vector<vector<T>> A;\n\n Matrix() {}\n\n Matrix(size_t n, size_t m) : A(n, vector<T>(m, 0)) {}\n\n Matrix(size_t n) : A(n, vector<T>(n, 0)){};\n\n size_t height() const { return (A.size()); }\n\n size_t width() const { return (A[0].size()); }\n\n inline const vector<T> &operator[](int k) const { return (A.at(k)); }\n\n inline vector<T> &operator[](int k) { return (A.at(k)); }\n\n static Matrix I(size_t n) {\n Matrix mat(n);\n for(int i = 0; i < n; i++) mat[i][i] = 1;\n return (mat);\n }\n\n Matrix &operator+=(const Matrix &B) {\n size_t n = height(), m = width();\n assert(n == B.height() && m == B.width());\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++) (*this)[i][j] += B[i][j];\n return (*this);\n }\n\n Matrix &operator-=(const Matrix &B) {\n size_t n = height(), m = width();\n assert(n == B.height() && m == B.width());\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++) (*this)[i][j] -= B[i][j];\n return (*this);\n }\n\n Matrix &operator*=(const Matrix &B) {\n size_t n = height(), m = B.width(), p = width();\n assert(p == B.height());\n vector<vector<T>> C(n, vector<T>(m, 0));\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++)\n for(int k = 0; k < p; k++) C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);\n A.swap(C);\n return (*this);\n }\n\n Matrix &operator^=(long long k) {\n Matrix B = Matrix::I(height());\n while(k > 0) {\n if(k & 1) B *= *this;\n *this *= *this;\n k >>= 1LL;\n }\n A.swap(B.A);\n return (*this);\n }\n\n Matrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }\n\n Matrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }\n\n Matrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }\n\n Matrix operator^(const long long k) const { return (Matrix(*this) ^= k); }\n\n friend ostream &operator<<(ostream &os, Matrix &p) {\n size_t n = p.height(), m = p.width();\n for(int i = 0; i < n; i++) {\n os << \"[\";\n for(int j = 0; j < m; j++) { os << p[i][j] << (j + 1 == m ? \"]\\n\" : \",\"); }\n }\n return (os);\n }\n\n T determinant() {\n Matrix B(*this);\n assert(width() == height());\n T ret = 1;\n for(int i = 0; i < width(); i++) {\n int idx = -1;\n for(int j = i; j < width(); j++) {\n if(B[j][i] != 0) idx = j;\n }\n if(idx == -1) return (0);\n if(i != idx) {\n ret *= -1;\n swap(B[i], B[idx]);\n }\n ret *= B[i][i];\n T vv = B[i][i];\n for(int j = 0; j < width(); j++) { B[i][j] /= vv; }\n for(int j = i + 1; j < width(); j++) {\n T a = B[j][i];\n for(int k = 0; k < width(); k++) { B[j][k] -= B[i][k] * a; }\n }\n }\n return (ret);\n }\n};\nnamespace modular {\nconstexpr ll MOD = 1000000007;\nconst int MAXN = 1100000;\ntemplate <ll Modulus> class modint;\n#define mint modint<MOD>\n#define vmint vector<mint>\nvector<mint> Inv;\nmint inv(int x);\ntemplate <ll Modulus> class modint {\n\n public:\n static constexpr int mod() { return Modulus; }\n ll a;\n\n constexpr modint(const ll x = 0) noexcept : a(((x % Modulus) + Modulus) % Modulus) {}\n constexpr ll &value() noexcept { return a; }\n constexpr const ll &value() const noexcept { return a; }\n constexpr modint operator-() const noexcept { return modint() - *this; }\n constexpr modint operator+() const noexcept { return *this; }\n constexpr modint &operator++() noexcept {\n if(++a == MOD) a = 0;\n return *this;\n }\n constexpr modint &operator--() noexcept {\n if(!a) a = MOD;\n a--;\n return *this;\n }\n constexpr modint operator++(int) {\n modint res = *this;\n ++*this;\n return res;\n }\n constexpr modint operator--(int) {\n mint res = *this;\n --*this;\n return res;\n }\n constexpr modint &operator+=(const modint rhs) noexcept {\n a += rhs.a;\n if(a >= Modulus) { a -= Modulus; }\n return *this;\n }\n constexpr modint &operator-=(const modint rhs) noexcept {\n if(a < rhs.a) { a += Modulus; }\n a -= rhs.a;\n return *this;\n }\n constexpr modint &operator*=(const modint rhs) noexcept {\n a = a * rhs.a % Modulus;\n return *this;\n }\n constexpr modint &operator/=(const modint rhs) noexcept {\n a = a * (modular::inv(rhs.a)).a % Modulus;\n return *this;\n }\n constexpr modint pow(long long n) const noexcept {\n assert(n >= 0);\n modint x = *this, r = 1;\n while(n) {\n if(n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n constexpr modint inv() const noexcept { return pow(Modulus - 2); }\n constexpr friend modint operator+(const modint &lhs, const modint &rhs) { return modint(lhs) += modint(rhs); }\n constexpr friend modint operator-(const modint &lhs, const modint &rhs) { return modint(lhs) -= modint(rhs); }\n constexpr friend modint operator*(const modint &lhs, const modint &rhs) { return modint(lhs) *= modint(rhs); }\n constexpr friend modint operator/(const modint &lhs, const modint &rhs) { return modint(lhs) /= modint(rhs); }\n constexpr friend modint operator==(const modint &lhs, const modint &rhs) { return lhs.a == rhs.a; }\n constexpr friend modint operator!=(const modint &lhs, const modint &rhs) { return lhs.a != rhs.a; }\n // constexpr friend modint operator^=(const modint &lhs, const modint &rhs) { return modint(lhs) ^= modint(rhs); }\n};\nvmint Prd{1, 1}, Invprd{1, 1};\nmint inv(int n) {\n if(Inv.empty()) Inv.emplace_back(0), Inv.emplace_back(1);\n if(Inv.size() > n)\n return Inv[n];\n else {\n for(int i = Inv.size(); i <= n; ++i) Inv.emplace_back(Inv[MOD % i] * (-MOD / i));\n return Inv[n];\n }\n}\nmint prd(int n) {\n if(Prd.size() > n)\n return Prd[n];\n else\n for(int i = Prd.size(); i <= n; ++i) Prd.emplace_back(Prd[i - 1] * i);\n return Prd[n];\n}\nmint invprd(int n) {\n if(Invprd.size() > n)\n return Invprd[n];\n else\n for(int i = Invprd.size(); i <= n; ++i) Invprd.emplace_back(Invprd[i - 1] * inv(i));\n return Invprd[n];\n}\nmint modpow(ll a, ll n) { return mint(a).pow(n); }\nmint inv(mint a) { return inv(a.a); }\nmint invprd(mint a) { return invprd(a.a); }\nmint prd(mint a) { return prd(a.a); }\nmint modpow(mint a, ll n) { return modpow(a.a, n); }\nmint C(int a, int b) {\n if(a < 0 || b < 0) return 0;\n if(a < b) return 0;\n return prd(a) * invprd(b) * invprd(a - b);\n}\nmint P(int a, int b) {\n if(a < 0 || b < 0) return 0;\n if(a < b) return 0;\n return prd(a) * invprd(a - b);\n}\nostream &operator<<(ostream &os, mint a) {\n os << a.a;\n return os;\n}\nistream &operator>>(istream &is, mint &a) {\n ll x;\n is >> x;\n a = x;\n return is;\n}\nstruct modinfo {\n int mod, root;\n};\nconstexpr modinfo base0{1045430273, 3};\nconstexpr modinfo base1{1051721729, 6};\nconstexpr modinfo base2{1053818881, 7};\nusing mint0 = modint<base0.mod>;\nusing mint1 = modint<base1.mod>;\nusing mint2 = modint<base2.mod>;\nusing Poly = vmint;\ntemplate <int mod> void FMT(vector<modint<mod>> &f, bool inv = false) {\n using V = vector<modint<mod>>;\n static V g(30), ig(30);\n if(g.front().a == 0) {\n modint<mod> root = 2;\n while((root.pow((mod - 1) / 2)).a == 1) root += 1;\n rep(i, 30) g[i] = -(root.pow((mod - 1) >> (i + 2))), ig[i] = g[i].inv();\n }\n int n = size(f);\n if(!inv) {\n for(int m = n; m >>= 1;) {\n modint<mod> w = 1;\n for(int s = 0, k = 0; s < n; s += 2 * m) {\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\n auto x = f[i], y = f[j] * w;\n if(x.a >= mod) x.a -= mod;\n f[i].a = x.a + y.a, f[j].a = x.a + (mod - y.a);\n }\n w *= g[__builtin_ctz(++k)];\n }\n }\n } else {\n for(int m = 1; m < n; m *= 2) {\n modint<mod> w = 1;\n for(int s = 0, k = 0; s < n; s += 2 * m) {\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\n auto x = f[i], y = f[j];\n f[i] = x + y, f[j].a = x.a + (mod - y.a), f[j] *= w;\n }\n w *= ig[__builtin_ctz(++k)];\n }\n }\n }\n modint<mod> c;\n if(inv)\n c = modint<mod>(n).inv();\n else\n c = 1;\n for(auto &&e : f) e *= c;\n}\nPoly operator-(Poly f) {\n for(auto &&e : f) e = -e;\n return f;\n}\nPoly &operator+=(Poly &l, const Poly &r) {\n l.resize(max(l.size(), r.size()));\n rep(i, r.size()) l[i] += r[i];\n return l;\n}\nPoly operator+(Poly l, const Poly &r) { return l += r; }\nPoly &operator-=(Poly &l, const Poly &r) {\n l.resize(max(l.size(), r.size()));\n rep(i, r.size()) l[i] -= r[i];\n return l;\n}\nPoly operator-(Poly l, const Poly &r) { return l -= r; }\nPoly &operator<<=(Poly &f, size_t n) { return f.insert(f.begin(), n, 0), f; }\nPoly operator<<(Poly f, size_t n) { return f <<= n; }\nPoly &operator>>=(Poly &f, size_t n) { return f.erase(f.begin(), f.begin() + min(f.size(), n)), f; }\nPoly operator>>(Poly f, size_t n) { return f >>= n; }\n\nconstexpr int mod0 = 998244353, mod1 = 1300234241, mod2 = 1484783617;\nusing M0 = modint<mod0>;\nusing M1 = modint<mod1>;\nusing M2 = modint<mod2>;\n\ntemplate <int mod> void mul(vector<modint<mod>> &l, vector<modint<mod>> &r) {\n int n = size(l), m = size(r), sz = 1 << __lg(2 * (n + m - 1) - 1);\n l.resize(sz), FMT<mod>(l);\n r.resize(sz), FMT<mod>(r);\n rep(i, sz) l[i] *= r[i];\n FMT<mod>(l, true);\n l.resize(n + m - 1);\n}\nPoly operator*(const Poly &l, const Poly &r) {\n if(l.empty() or r.empty()) return Poly();\n int n = size(l), m = size(r), sz = 1 << __lg(2 * (n + m - 1) - 1);\n vector<M0> l0(n), r0(m);\n vector<M1> l1(n), r1(m);\n vector<M2> l2(n), r2(m);\n rep(i, n) l0[i] = l[i].a, l1[i] = l[i].a, l2[i] = l[i].a;\n rep(i, m) r0[i] = r[i].a, r1[i] = r[i].a, r2[i] = r[i].a;\n mul<mod0>(l0, r0), mul<mod1>(l1, r1), mul<mod2>(l2, r2);\n Poly res(n + m - 1);\n // garner\n static constexpr M1 inv0 = 613999507;\n static constexpr M2 inv1 = 1147332803, inv0m1 = 45381342;\n static constexpr mint m0 = mod0, m0m1 = m0 * mod1;\n rep(i, n + m - 1) {\n int y0 = l0[i].a;\n int y1 = (inv0 * (l1[i] - y0)).a;\n int y2 = (inv0m1 * (l2[i] - y0) - inv1 * y1).a;\n res[i] = m0 * y1 + m0m1 * y2 + y0;\n }\n return res;\n}\nPoly &operator*=(Poly &l, const Poly &r) { return l = l * r; }\nPoly integ(const Poly &f) {\n Poly res(f.size() + 1);\n for(int i = 1; i < (int)res.size(); ++i) res[i] = f[i - 1] / i;\n return res;\n}\n// Poly deriv(const Poly &f) {\n// if(f.size() == 0) return Poly();\n// Poly res(f.size() - 1);\n// rep(i, res.size()) res[i] = f[i + 1] * (i + 1);\n// return res;\n// }\nostream &operator<<(ostream &os, Poly a) {\n for(auto e : a) cout << e.a << \" \";\n return os;\n}\n} // namespace modular\nusing namespace modular;\n\nint main() {\n TEST {\n INT(_a, l, r);\n if(_a == 1) {\n cout << r - l + 1 << endl;\n continue;\n }\n mint a = _a;\n Matrix<mint> A(2);\n A[0][0] = A[1][1] = a;\n A[0][1] = (mint)a * a - 1;\n A[1][0] = 1;\n auto I = A.I(2);\n Matrix<mint> inv = I - A;\n swap(inv[0][0], inv[1][1]);\n inv[0][1] *= -1, inv[1][0] *= -1;\n Matrix<mint> x(2, 1);\n x[0][0] = 1;\n auto E = (I - A) * inv;\n auto f = [&](int k) -> mint {\n if(k == -1) return 0;\n return (((I - (A ^ (k + 1))) * inv) * x)[0][0] * modpow(1 - a.a, MOD - 2);\n };\n cout << f(r) - f(l - 1) - (r - l + 1) << endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3552,"score_of_the_acc":-0.8966,"final_rank":12},{"submission_id":"aoj_3162_4834055","code_snippet":"#include<bits/stdc++.h>\n\nint main(){\n using namespace std;\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\n constexpr unsigned long MOD = 1000000007;\n const unsigned long Q{[]{unsigned long ret; cin >> ret; return ret;}()};\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\n unsigned long r{b % MOD}, n{MOD - 2};\n while(n){\n if(n & 1)(r *= a) %= MOD;\n (a *= a) %= MOD;\n n >>= 1;\n }\n return r;\n };\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &a, &l, &r]{\n cin >> a >> l >> r;\n ++r;\n if(a == 1)return r - l;\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\n ret.first %= MOD;\n ret.second %= MOD;\n return ret;\n };\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\n f_1e9_7_va ret{b}, al{a};\n while(n){\n if(n & 1)ret = mul(ret, al);\n al = mul(al, al);\n n >>= 1;\n }\n return ret;\n };\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\n };\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\n }() << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3080,"score_of_the_acc":-0.0227,"final_rank":1},{"submission_id":"aoj_3162_4834036","code_snippet":"#include<bits/stdc++.h>\n\nint main(){\n using namespace std;\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\n constexpr unsigned long MOD = 1000000007;\n const unsigned long Q{[]{unsigned long ret; cin >> ret; return ret;}()};\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\n unsigned long r{b % MOD}, n{MOD - 2};\n while(n){\n if(n & 1)(r *= a) %= MOD;\n (a *= a) %= MOD;\n n >>= 1;\n }\n return r;\n };\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &a, &l, &r]{\n cin >> a >> l >> r;\n ++r;\n if(a == 1)return r - l;\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\n ret.first %= MOD;\n ret.second %= MOD;\n return ret;\n };\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\n f_1e9_7_va ret{b}, al{a};\n while(n){\n if(n & 1)ret = mul(ret, al);\n al = mul(al, al);\n n >>= 1;\n }\n return ret;\n };\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\n };\n unsigned long k{modinv(2 * a - 2, 1)}, m{(2 * MOD - 1 - k) % MOD};\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\n }() << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3416,"score_of_the_acc":-0.525,"final_rank":3},{"submission_id":"aoj_3162_4833942","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for (long long i = 0; i < (n); ++i)\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll,ll>;\nusing vec = vector<ll>;\nusing vecp = vector<P>;\nusing mat = vector<vec>;\nusing matp = vector<vecp>;\nconst ll MOD = 1e9+7;\nconst ll INF = 1e18;\n#define all(v) v.begin(), v.end()\n\nmat matmul(ll a,ll b,ll c,mat &A,mat &B){\n mat C(a,vec(c,0));\n rep(i,a)rep(j,c){\n rep(k,b){\n C.at(i).at(j)+=A.at(i).at(k)*B.at(k).at(j);\n }\n C.at(i).at(j)%=MOD;\n }\n return C;\n}\nmat matpow(mat A,ll n,ll k){\n if (n == 0){\n mat B(k,vec(k,0));\n rep(i,k){\n B.at(i).at(i)=1;\n }\n return B;\n }\n if (n == 1) return A;\n if (n % 2 == 1){\n mat t=matpow(A,n-1,k);\n return matmul(k,k,k,A,t);\n }\n mat t=matpow(A,n/2,k);\n return matmul(k,k,k,t,t);\n}\n\n\nint main(){\n ll Q;\n cin >> Q;\n rep(i,Q){\n ll a,r,l;\n cin >> a >> l >> r;\n if(a==1){\n cout << r-l+1 << endl;\n continue;\n }\n mat G(3,vec(3)),A(3,vec(1));\n A.at(0).at(0)=2*a+2;\n A.at(1).at(0)=2*a;\n A.at(2).at(0)=2;\n G.at(0).at(0)=1;\n G.at(0).at(1)=2*a;\n G.at(0).at(2)=-1;\n G.at(1).at(0)=0;\n G.at(1).at(1)=2*a;\n G.at(1).at(2)=-1;\n G.at(2).at(0)=0;\n G.at(2).at(1)=1;\n G.at(2).at(2)=0;\n ll R,L;\n if(r>=1){\n mat X=matpow(G,r-1,3);\n mat Y=matmul(3,3,1,X,A);\n R=Y.at(0).at(0);\n }else{\n R=2;\n }\n if(l>1){\n mat X=matpow(G,l-2,3);\n mat Y=matmul(3,3,1,X,A);\n L=Y.at(0).at(0);\n }else if(l==1){\n L=2;\n }else{\n L=0;\n }\n cout << (R-L-(r-l+1)+5*MOD)%MOD << endl;\n }\n \n \n \n}","accuracy":1,"time_ms":190,"memory_kb":3428,"score_of_the_acc":-0.9528,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_3162_9739986\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\ntypedef long long int ll;\\nconstexpr ll mod=1e9+7;\\n\\nstruct mat{\\n\\tll x[3][3];\\n\\tfriend mat operator*(mat &a,mat &b){\\n\\t\\tmat c;\\n\\t\\tfor(int i=0;i<3;i++){\\n\\t\\t\\tfor(int j=0;j<3;j++){\\n\\t\\t\\t\\tc.x[i][j]=0;\\n\\t\\t\\t\\tfor(int k=0;k<3;k++){\\n\\t\\t\\t\\t\\t(c.x[i][j]+=a.x[i][k]*b.x[k][j]%mod)%=mod;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn c;\\n\\t}\\n};\\n\\nmat x,res;\\n\\nll mod_pow(int n){\\n\\twhile(n){\\n\\t\\tif(n%2)res=x*res;\\n\\t\\tx=x*x;\\n\\t\\tn>>=1;\\n\\t}\\n\\treturn res.x[0][0];\\n}\\n\\nvoid init(ll a){\\n\\tfor(int i=0;i<3;i++)for(int j=0;j<3;j++)x.x[i][j]=res.x[i][j]=0;\\n\\tres.x[0][0]=2,res.x[1][0]=1;\\n\\tx.x[0][0]=1,x.x[0][1]=2*a,x.x[0][2]=2*(a*a-1);\\n\\tx.x[1][1]=a,x.x[1][2]=a*a-1;\\n\\tx.x[2][1]=1,x.x[2][2]=a;\\n\\tfor(int i=0;i<3;i++)for(int j=0;j<3;j++)x.x[i][j]%=mod;\\n\\treturn;\\n}\\n\\nll solve(int a,int l,int r){\\n\\tif(a==1)return (r-l+1);\\n\\tinit(a); ll R=mod_pow(r);\\n\\tinit(a); ll L=(l?mod_pow(l-1):0);\\n\\tll val=(R-L-(r-l+1))%mod;\\n\\treturn (val+mod)%mod;\\n}\\n\\nint main(){\\n\\tint q; cin >> q;\\n\\twhile(q--){\\n\\t\\tint a,l,r; cin >> a >> l >> r;\\n\\t\\tcout << solve(a,l,r) << \\\"\\\\n\\\";\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.6761,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3162_5128860\",\n \"code_snippet\": \"#line 1 \\\"a.cpp\\\"\\n#include<iostream>\\nusing namespace std;\\n#line 3 \\\"/home/kotatsugame/library/math/modint.cpp\\\"\\n#include<utility>\\ntemplate<int m>\\nstruct modint{\\n\\tunsigned int x;\\n\\tconstexpr modint()noexcept:x(){}\\n\\ttemplate<typename T>\\n\\tconstexpr modint(T x_)noexcept:x((x_%=m)<0?x_+m:x_){}\\n\\tconstexpr unsigned int val()const noexcept{return x;}\\n\\tconstexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}\\n\\tconstexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}\\n\\tconstexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}\\n\\tconstexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}\\n\\tconstexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}\\n\\tconstexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}\\n\\tconstexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}\\n\\tconstexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}\\n\\tconstexpr modint operator+()const noexcept{return*this;}\\n\\tconstexpr modint operator-()const noexcept{return modint()-*this;}\\n\\tconstexpr modint pow(long long n)const noexcept\\n\\t{\\n\\t\\tif(n<0)return pow(-n).inv();\\n\\t\\tmodint x=*this,r=1;\\n\\t\\tfor(;n;x*=x,n>>=1)if(n&1)r*=x;\\n\\t\\treturn r;\\n\\t}\\n\\tconstexpr modint inv()const noexcept\\n\\t{\\n\\t\\tint s=x,t=m,x=1,u=0;\\n\\t\\twhile(t)\\n\\t\\t{\\n\\t\\t\\tint k=s/t;\\n\\t\\t\\ts-=k*t;\\n\\t\\t\\tswap(s,t);\\n\\t\\t\\tx-=k*u;\\n\\t\\t\\tswap(x,u);\\n\\t\\t}\\n\\t\\treturn modint(x);\\n\\t}\\n\\tfriend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}\\n\\tfriend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}\\n\\tfriend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}\\n\\tfriend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}\\n\\tfriend constexpr bool operator==(const modint&a,const modint&b){return a.x==b.x;}\\n\\tfriend constexpr bool operator!=(const modint&a,const modint&b){return a.x!=b.x;}\\n\\tfriend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}\\n\\tfriend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}\\n};\\n#line 1 \\\"/home/kotatsugame/library/math/squarematrix.cpp\\\"\\n#include<array>\\ntemplate<typename T,unsigned int N>\\nstruct Matrix{\\n\\tarray<array<T,N>,N>dat;\\n\\tarray<T,N>&operator[](int i){return dat[i];}\\n\\tconst array<T,N>&operator[](int i)const{return dat[i];}\\n\\tstatic Matrix eye(){\\n\\t\\tMatrix res;\\n\\t\\tfor(int i=0;i<N;i++)res[i][i]=1;\\n\\t\\treturn res;\\n\\t}\\n\\tMatrix operator+(const Matrix&A)const{\\n\\t\\tMatrix res;\\n\\t\\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)\\n\\t\\t\\tres[i][j]=dat[i][j]+A[i][j];\\n\\t\\treturn res;\\n\\t}\\n\\tMatrix operator*(const Matrix&A)const{\\n\\t\\tMatrix res;\\n\\t\\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)for(int k=0;k<N;k++)\\n\\t\\t\\tres[i][j]+=dat[i][k]*A[k][j];\\n\\t\\treturn res;\\n\\t}\\n\\tMatrix pow(long long n)const{\\n\\t\\tMatrix a=*this,res=eye();\\n\\t\\tfor(;n;a=a*a,n>>=1)if(n&1)res=res*a;\\n\\t\\treturn res;\\n\\t}\\n};\\n#line 5 \\\"a.cpp\\\"\\nusing mint=modint<(int)1e9+7>;\\nusing mat=Matrix<mint,3>;\\nint Q,A;\\nmint f(int N)\\n{\\n\\tif(N<0)return 0;\\n\\tmat X;\\n\\tX[0][0]=1;\\n\\tX[0][1]=1;\\n\\tX[1][1]=2*A;\\n\\tX[1][2]=-1;\\n\\tX[2][1]=1;\\n\\tX=X.pow(N);\\n\\treturn X[0][0]*2+X[0][1]*2*A+X[0][2]*2-N-1;\\n}\\nmain()\\n{\\n\\tcin>>Q;\\n\\tfor(;Q--;)\\n\\t{\\n\\t\\tint L,R;\\n\\t\\tcin>>A>>L>>R;\\n\\t\\tcout<<f(R)-f(L-1)<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.1739,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3162_4867538\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<bits/stdc++.h>\\n// #include<ext/pb_ds/assoc_container.hpp>\\n// #include<ext/pb_ds/tree_policy.hpp>\\n// #include<ext/pb_ds/tag_and_trait.hpp>\\n// using namespace __gnu_pbds;\\n// #include<boost/multiprecision/cpp_int.hpp>\\n// namespace multiprecisioninteger = boost::multiprecision;\\n// using cint=multiprecisioninteger::cpp_int;\\nusing namespace std;\\nusing ll=long long;\\n#define double long double\\nusing datas=pair<ll,ll>;\\nusing ddatas=pair<double,double>;\\nusing tdata=pair<ll,datas>;\\nusing vec=vector<ll>;\\nusing mat=vector<vec>;\\nusing pvec=vector<datas>;\\nusing pmat=vector<pvec>;\\n// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;\\n#define For(i,a,b) for(i=a;i<(ll)b;++i)\\n#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)\\n#define rep(i,N) For(i,0,N)\\n#define rep1(i,N) For(i,1,N)\\n#define brep(i,N) bFor(i,N,0)\\n#define brep1(i,N) bFor(i,N,1)\\n#define all(v) (v).begin(),(v).end()\\n#define allr(v) (v).rbegin(),(v).rend()\\n#define vsort(v) sort(all(v))\\n#define vrsort(v) sort(allr(v))\\n#define endl \\\"\\\\n\\\"\\n#define eb emplace_back\\n#define print(v) cout<<v<<endl\\n#define printyes cout<<\\\"Yes\\\"<<endl\\n#define printno cout<<\\\"No\\\"<<endl\\n#define printYES cout<<\\\"YES\\\"<<endl\\n#define printNO cout<<\\\"NO\\\"<<endl\\n#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?\\\" \\\":\\\"\\\")<<outi;f=1;}cout<<endl;}while(0)\\n#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)\\nconst ll mod=1000000007;\\n// const ll mod=998244353;\\nconst ll inf=1LL<<60;\\nconst double PI = acos(-1);\\nconst double eps = 1e-9;\\ntemplate<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} \\ntemplate<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} \\n\\nvoid startupcpp(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout<<fixed<<setprecision(15);\\n}\\n\\ndouble distance(ddatas x,ddatas y){\\n double a=x.first-y.first,b=x.second-y.second;\\n return sqrt(a*a+b*b);\\n}\\n\\nll modinv(ll a,ll m=mod) {\\n ll b=m,u=1,v=0,t;\\n while(b){\\n t=a/b;\\n a-=t*b; swap(a,b);\\n u-=t*v; swap(u,v);\\n }\\n return (u+m)%m;\\n}\\n\\nll moddevide(ll a,ll b){return (a*modinv(b))%mod;}\\n\\nvec modncrlistp,modncrlistm;\\n\\nll modncr(ll n,ll r){\\n if(n<r)return 0;\\n ll i,size=modncrlistp.size();\\n if(size<=n){\\n modncrlistp.resize(n+1);\\n modncrlistm.resize(n+1);\\n if(!size){\\n modncrlistp[0]=modncrlistm[0]=1;\\n size++;\\n }\\n For(i,size,n+1){\\n modncrlistp[i]=modncrlistp[i-1]*i%mod;\\n modncrlistm[i]=modinv(modncrlistp[i]);\\n }\\n }\\n return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;\\n}\\n\\nll modpow(ll a,ll n,ll m=mod){\\n ll res=1;\\n while(n>0){\\n if(n&1)res=res*a%m;\\n a=a*a%m;\\n n>>=1;\\n }\\n return res;\\n}\\n\\nll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}\\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\\n\\nll countdigits(ll n){\\n ll ans=0;\\n while(n){n/=10;ans++;}\\n return ans;\\n}\\n\\nll sumdigits(ll n){\\n ll ans=0;\\n while(n){ans+=n%10;n/=10;}\\n return ans;\\n}\\nclass matrix{\\n mat a;\\n ll H,W;\\npublic:\\n matrix(mat& g):a(g){\\n H=g.size();\\n W=g[0].size();\\n }\\n matrix(ll i,ll j):a(i,vec(j,0)){H=i;W=j;}\\n matrix(ll n):a(n,vec(n,0)){H=W=n;}\\n inline vec& operator [](int k){\\n return a.at(k);\\n }\\n // matrix operator =(matrix b){\\n // this->a.swap(b->a);\\n // this->H=b.H;\\n // this->W=b.W;\\n // return (*this);\\n // }\\n matrix operator +=(matrix b){\\n ll i,j;\\n rep(i,this->H)rep(j,this->W)(*this)[i][j]+=b[i][j];\\n return (*this);\\n }\\n matrix operator -=(matrix b){\\n ll i,j;\\n rep(i,this->H)rep(j,this->W)(*this)[i][j]-=b[i][j];\\n return (*this);\\n }\\n matrix operator *=(matrix b){\\n ll i,j,k;\\n assert(this->W==b.H);\\n matrix c(this->H,b.W);\\n rep(i,this->H)rep(j,b.W){\\n c[i][j]=0;\\n rep(k,this->W)(c[i][j]+=(*this)[i][k]*b[k][j]%mod)%=mod;\\n }\\n (*this)=c;\\n return (*this);\\n }\\n matrix operator ^=(ll K){\\n assert(this->H==this->W);\\n matrix c(this->H);\\n ll i;\\n rep(i,this->H)c[i][i]=1;\\n if(K&1)c*=(*this);\\n while(K){\\n K>>=1;\\n (*this)*=(*this);\\n if(K&1)c*=(*this);\\n }\\n this->a.swap(c.a);\\n return (*this);\\n }\\n matrix operator +(matrix c){\\n return matrix(*this)+=c;\\n }\\n matrix operator -(matrix c){\\n return matrix(*this)-=c;\\n }\\n matrix operator *(matrix c){\\n return matrix(*this)*=c;\\n }\\n matrix operator ^(ll K){\\n return matrix(*this)^=K;\\n }\\n void out(){\\n for(auto x:a)output(x);\\n }\\n};\\n\\nint main(){\\n startupcpp();\\n int codeforces;cin>>codeforces;while(codeforces--){\\n ll i,j,a,l,r,ans;\\n cin>>a>>l>>r;\\n if(r==0){\\n print(1);\\n continue;\\n }\\n if(a==1){\\n print(r-l+1);\\n continue;\\n }\\n l+=ans=!l;\\n ans-=r-l+1;\\n matrix g(2),I(2),v(2,1);\\n I[0][0]=I[1][1]=1;\\n v[0][0]=-1;v[1][0]=1;\\n g[0][0]=2*a%mod;g[0][1]=-1;g[1][0]=1;g[1][1]=0;\\n auto xg=I-(g^(r-l+1));\\n auto ansg=(g^(l-1))*xg*v;\\n ans+=ansg[0][0];\\n ans%=mod;\\n if(ans<0)ans+=mod;\\n print(ans);\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.9597,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3162_4865597\",\n \"code_snippet\": \"#include <iostream>\\n#include <array>\\n\\n\\n#include <utility>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m < 2^31`\\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\nnamespace ac = atcoder;\\n\\ntemplate <class T, int D>\\nstruct Vector {\\n using V = std::array<T, D>;\\n\\n V vec;\\n\\n // constructor\\n Vector(T val = 0) { vec.fill(val); }\\n\\n // getter\\n T& operator[](int i) { return vec[i]; }\\n T operator[](int i) const { return vec[i]; }\\n typename V::iterator begin() { return vec.begin(); }\\n typename V::iterator end() { return vec.end(); }\\n\\n // arithmetic\\n Vector operator+(const Vector& v) const { return Vector(*this) += v; }\\n Vector operator-(const Vector& v) const { return Vector(*this) -= v; }\\n T operator*(const Vector& v) const {\\n T ret(0);\\n for (int i = 0; i < D; ++i) ret += vec[i] * v[i];\\n return ret;\\n }\\n\\n // compound assignment\\n Vector& operator+=(const Vector& v) {\\n for (int i = 0; i < D; ++i) vec[i] += v[i];\\n return *this;\\n }\\n Vector& operator-=(const Vector& v) {\\n for (int i = 0; i < D; ++i) vec[i] -= v[i];\\n return *this;\\n }\\n};\\n\\ntemplate <class T, int D>\\nstruct Matrix {\\n using M = std::array<std::array<T, D>, D>;\\n\\n M mat;\\n\\n // constructor\\n Matrix(T val = 0) {\\n for (auto& v : mat) v.fill(val);\\n }\\n\\n static Matrix id() {\\n Matrix m;\\n for (int i = 0; i < D; ++i) m[i][i] = 1;\\n return m;\\n }\\n\\n // getter\\n std::array<T, D>& operator[](int i) { return mat[i]; }\\n std::array<T, D> operator[](int i) const { return mat[i]; }\\n typename M::iterator begin() { return mat.begin(); }\\n typename M::iterator end() { return mat.end(); }\\n\\n // arithmetic\\n Matrix operator+(const Matrix& m) const { return Matrix(*this) += m; }\\n Matrix operator-(const Matrix& m) const { return Matrix(*this) -= m; }\\n Matrix operator*(const Matrix& m) const { return Matrix(*this) *= m; }\\n\\n template <class U>\\n Matrix pow(U k) {\\n Matrix ret = id();\\n Matrix a = *this;\\n\\n while (k > 0) {\\n if (k & 1) ret *= a;\\n a *= a;\\n k >>= 1;\\n }\\n return ret;\\n }\\n\\n // compound assignment\\n Matrix& operator+=(const Matrix& m) {\\n for (int i = 0; i < D; ++i) {\\n for (int j = 0; j < D; ++j) {\\n mat[i][j] += m[i][j];\\n }\\n }\\n return *this;\\n }\\n Matrix& operator-=(const Matrix& m) {\\n for (int i = 0; i < D; ++i) {\\n for (int j = 0; j < D; ++j) {\\n mat[i][j] -= m[i][j];\\n }\\n }\\n return *this;\\n }\\n Matrix& operator*=(const Matrix& m) {\\n M nmat;\\n for (auto& v : nmat) v.fill(0);\\n\\n for (int i = 0; i < D; ++i) {\\n for (int j = 0; j < D; ++j) {\\n for (int k = 0; k < D; ++k) {\\n nmat[i][j] += mat[i][k] * m[k][j];\\n }\\n }\\n }\\n mat = nmat;\\n return *this;\\n }\\n\\n // arithmetic with vector\\n using Vec = Vector<T, D>;\\n Vec operator*(const Vec& v) {\\n Vec ret;\\n for (int i = 0; i < D; ++i) {\\n for (int j = 0; j < D; ++j) {\\n ret[i] += mat[i][j] * v[j];\\n }\\n }\\n return ret;\\n }\\n};\\n\\nusing mint = ac::modint1000000007;\\nusing Vec = Vector<mint, 3>;\\nusing Mat = Matrix<mint, 3>;\\n\\nmint calc(int n, int a) {\\n Vec v; // p, q, psum\\n v[0] = 1;\\n\\n Mat m;\\n m[0][0] = a, m[0][1] = mint(a) * a - 1;\\n m[1][0] = 1, m[1][1] = a;\\n m[2][0] = 1, m[2][2] = 1;\\n\\n auto psum = (m.pow(n) * v)[2];\\n return psum * 2 - n;\\n}\\n\\nvoid solve() {\\n int a, l, r;\\n std::cin >> a >> l >> r;\\n\\n auto ans = calc(r + 1, a) - calc(l, a);\\n std::cout << ans.val() << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n int q;\\n std::cin >> q;\\n while (q--) solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.6619,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3162_4861056\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(1e9 + 7)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\ntemplate <class T>\\nstruct Matrix {\\n vector<vector<T>> A;\\n Matrix() {}\\n Matrix(size_t m, size_t n) : A(m, vector<T>(n, 0)) {}\\n Matrix(size_t n) : A(n, vector<T>(n, 0)) {}\\n size_t height() const { return (A.size()); }\\n size_t width() const { return (A[0].size()); }\\n inline const vector<T> &operator[](int k) const { return (A.at(k)); }\\n inline vector<T> &operator[](int k) { return (A.at(k)); }\\n static Matrix E(size_t n) {\\n Matrix mat(n);\\n for (int i = 0; i < n; ++i) mat[i][i] = 1;\\n return (mat);\\n }\\n Matrix &operator+=(const Matrix &B) {\\n size_t m = height(), n = width();\\n assert(m == B.height() && n == B.width());\\n for (int i = 0; i < m; ++i)\\n for (int j = 0; j < n; ++j) (*this)[i][j] += B[i][j];\\n return (*this);\\n }\\n Matrix &operator-=(const Matrix &B) {\\n size_t m = height(), n = width();\\n assert(m == B.height() && n == B.width());\\n for (int i = 0; i < m; ++i)\\n for (int j = 0; j < n; ++j) (*this)[i][j] -= B[i][j];\\n return (*this);\\n }\\n Matrix &operator*=(const Matrix &B) {\\n size_t m = height(), n = B.width(), p = width();\\n assert(p == B.height());\\n vector<vector<T>> C(m, vector<T>(n, 0));\\n for (int i = 0; i < m; ++i)\\n for (int k = 0; k < p; ++k) {\\n T tmp = (*this)[i][k];\\n for (int j = 0; j < n; ++j) C[i][j] += tmp * B[k][j];\\n }\\n A.swap(C);\\n return (*this);\\n }\\n Matrix &operator^=(long long k) {\\n Matrix B = Matrix::E(height());\\n while (k) {\\n if (k & 1) B *= *this;\\n *this *= *this;\\n k >>= 1;\\n }\\n A.swap(B.A);\\n return (*this);\\n }\\n\\n Matrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }\\n Matrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }\\n Matrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }\\n Matrix operator^(const long long k) const { return (Matrix(*this) ^= k); }\\n friend ostream &operator<<(ostream &os, Matrix &p) {\\n size_t m = p.height(), n = p.width();\\n for (int i = 0; i < m; i++) {\\n os << \\\"[\\\";\\n for (int j = 0; j < n; j++) {\\n os << p[i][j] << (j + 1 == n ? \\\"]\\\\n\\\" : \\\",\\\");\\n }\\n }\\n return (os);\\n }\\n};\\n\\nint q, a, l, r;\\n\\nModInt<> calc(int x);\\n\\nint main() {\\n cin >> q;\\n for (int i = 0; i < q; ++i) {\\n cin >> a >> l >> r;\\n cout << calc(r) - calc(l - 1) << endl;\\n }\\n return 0;\\n}\\n\\nModInt<> calc(int x) {\\n if (x < 0) return 0;\\n if (a == 1) return x + 1;\\n long long b = (long long)a * a - 1;\\n Matrix<ModInt<>> mat(4, 4), vec(4, 1);\\n mat[0][0] = mat[2][1] = mat[3][3] = vec[0][0] = vec[1][0] = vec[3][0] = 1;\\n mat[0][3] = -1;\\n mat[0][1] = 2 * a;\\n mat[0][2] = 2 * b;\\n mat[1][1] = mat[2][2] = a;\\n mat[1][2] = b;\\n return ((mat ^ x) * vec)[0][0];\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.9739,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3162_4835779\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2020.09.13 15:07:01 */\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region aliases\\n\\n#define rep(i, n) for(long long i = 0; i < (n); i++)\\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bcnt(n) __builtin_popcountll(n)\\n#define endk endl\\n#define ednl endl\\n#define enld endl\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vb = vector<bool>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing mll = map<long long, long long>;\\nusing pll = pair<long long, long long>;\\nusing qll = queue<long long>;\\nusing sll = set<long long>;\\nusing vpll = vector<pair<long long, long long>>;\\ntemplate <class T = ll>\\nusing V = vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\n//昇順pq(小さい方から取り出す)\\ntemplate <class T = ll>\\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\\n//降順pq(大きい方から取り出す)\\ntemplate <class T = ll>\\nusing pqdn = priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\\nlong long const dekai = 3e16;\\nconst long double pi = acos(-1);\\nconst char el = '\\\\n';\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\\n\\nconst int mod = 1000000007;\\n// const int mod = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_procedure\\n\\ntemplate <class T>\\ninline bool isin(T x, T lef, T rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { cout << (f ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"; }\\nvoid No() { cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { cout << (f ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"; }\\nvoid NO() { cout << \\\"NO\\\\n\\\"; }\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tcout << answer << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\nvoid err() {\\n\\tcout << -1 << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\n\\nvector<long long> vin(long long n) { //整数n個の入力を受け取ってベクトルに突っ込んで返す\\n\\tvector<long long> v(n);\\n\\tfor(long long i = 0; i < n; i++) {\\n\\t\\tcin >> v[i];\\n\\t}\\n\\treturn v;\\n}\\n\\n//ベクトルの出力(検証済)\\n// vectorの中身を出力する 答えの出力に利用可能\\ntemplate <class T>\\nvoid vout(vector<T> &v, bool tate = 0) {\\n\\tif(v.size() > 0) {\\n\\t\\tfor(auto it = v.begin(); it < v.end(); it++) {\\n\\t\\t\\tcout << *it;\\n\\t\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\t\\tif(tate)\\n\\t\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tcout << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << endl;\\n}\\n\\ntemplate <class T>\\nvoid add(vector<T> &v, T val) {\\t //ベクトルの各要素に加算\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\n// vectorの中身を数える map<要素,個数>を返す\\ntemplate <class T>\\nmap<T, long long> cntv(vector<T> v) {\\n\\tmap<T, long long> m;\\n\\tfor(auto &g : v) {\\n\\t\\tif(m.count(g))\\n\\t\\t\\tm[g]++;\\n\\t\\telse\\n\\t\\t\\tm[g] = 1;\\n\\t}\\n\\treturn m;\\n}\\n\\n//配列圧縮(検証済)\\n//{1,36,1,3,8,-2,-92}を\\n//{2, 5,2,3,4, 1, 0}にする\\ntemplate <class T>\\nvector<long long> press(vector<T> &v) {\\n\\tlong long n = v.size();\\n\\tvector<long long> w(n);\\n\\tmap<T, long long> m;\\n\\tfor(T &p : v) m[p] = 0;\\n\\tlong long i = 0;\\n\\tfor(auto &p : m) {\\n\\t\\tp.second = i;\\n\\t\\ti++;\\n\\t}\\n\\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\\n\\treturn w;\\n}\\n\\ntemplate <class T>\\nT divup(T a, T b) {\\n\\t//端数繰りあがり割り算\\n\\tassert(b != 0);\\n\\tT x = abs(a);\\n\\tT y = abs(b);\\n\\tT z = (x + y - 1) / y;\\n\\tif((a < 0 && b > 0) || (a > 0 && b < 0))\\n\\t\\treturn -z;\\n\\telse if(a == 0)\\n\\t\\treturn 0;\\n\\telse\\n\\t\\treturn z;\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\ntemplate <class T>\\nint sgn(T x) {\\t//符号関数\\n\\tif(x < 0) return -1;\\n\\tif(x == 0) return 0;\\n\\treturn 1;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\n// a * x % mod == __gcd(a,mod)なるxを返す\\n// a が modの倍数でないことが条件\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tswap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tswap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\nvvll comb(100, vll(100, -1));\\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\\n\\tassert(n < 100 && k < 100);\\n\\tif(n < k || k < 0 || n < 0) return 0;\\n\\tif(comb[n][k] != -1) return comb[n][k];\\n\\tll res;\\n\\tif(n - k < k)\\n\\t\\tres = com(n, n - k);\\n\\telse if(k == 0)\\n\\t\\tres = 1;\\n\\telse\\n\\t\\tres = com(n - 1, k - 1) + com(n - 1, k);\\n\\tcomb[n][k] = res;\\n\\treturn res;\\n}\\n\\n// nCk modを求める\\nconst ll MAX = 5100000;\\n// この値は求める二項計数の値に応じて変える\\n// MAX=3*10^7のとき1900msほど、ほぼ比例\\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\nvoid cominit() {\\n\\t// テーブルを作る前処理\\n\\tfac[0] = fac[1] = 1;\\n\\tfinv[0] = finv[1] = 1;\\n\\tinv[1] = 1;\\n\\tfor(ll i = 2; i < MAX; i++) {\\n\\t\\tfac[i] = fac[i - 1] * i % mod;\\n\\t\\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\\n\\t\\tfinv[i] = finv[i - 1] * inv[i] % mod;\\n\\t}\\n}\\nlong long commod(ll n, ll k) {\\t// 二項係数計算\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\nlong long pmod(ll n, ll k) { //順列計算\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * finv[n - k] % mod;\\n}\\nlong long hmod(ll n, ll k) { // nHk計算\\n\\t// n個の区別しないoを区別するk個の箱に入れる方法の総数\\n\\t//(n+k-1)C(k-1)と等しい\\n\\treturn commod(n + k - 1, n);\\n}\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tINPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tINPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tcin >> a;\\n}\\ntemplate <class T>\\nvoid scan(vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\ntemplate <class T, class L>\\nvoid scan(pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\ntemplate <class T>\\ninline void print(T x) {\\n\\tcout << x << '\\\\n';\\n}\\n\\ntemplate <typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tcerr << \\\", \\\";\\n\\tview(p.second);\\n\\tcerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tcerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tcerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tcerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tcerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tcerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tview(H);\\n\\tcerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tcerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tview(x); \\\\\\n\\t\\tcerr << \\\"\\\\n\\\"; \\\\\\n\\t} while(0)\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\nstruct mint {\\n\\tlong long x;\\n\\tmint(long long x = 0) : x((x % mod + mod) % mod) {}\\n\\tmint operator-() const { return mint(-x); }\\n\\tmint &operator+=(const mint a) {\\n\\t\\tif((x += a.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tmint &operator-=(const mint a) {\\n\\t\\tif((x += mod - a.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tmint &operator*=(const mint a) {\\n\\t\\t(x *= a.x) %= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tmint operator+(const mint a) const { return mint(*this) += a; }\\n\\tmint operator-(const mint a) const { return mint(*this) -= a; }\\n\\tmint operator*(const mint a) const { return mint(*this) *= a; }\\n\\tmint pow(long long t) const {\\n\\t\\tif(!t) return 1;\\n\\t\\tmint a = pow(t >> 1);\\n\\t\\ta *= a;\\n\\t\\tif(t & 1) a *= *this;\\n\\t\\treturn a;\\n\\t}\\n\\n\\t// for prime mod\\n\\tmint inv() const { return pow(mod - 2); }\\n\\tmint &operator/=(const mint a) { return *this *= a.inv(); }\\n\\tmint operator/(const mint a) const { return mint(*this) /= a; }\\n};\\nostream &operator<<(ostream &os, const mint &a) { return os << a.x; }\\n\\ntemplate <class T, int a, int b = a>\\nstruct matrix {\\t // a * b 行列\\n\\tvector<vector<T>> mat;\\n\\tmatrix() : mat(a, vector<T>(b, (T)0)) {}\\n\\tmatrix(vector<vector<T>> vec) : mat(a, vector<T>(b)) {\\n\\t\\tfor(int i = 0; i < a; i++) {\\n\\t\\t\\tfor(int j = 0; j < b; j++) {\\n\\t\\t\\t\\tmat[i][j] = vec[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tmatrix<T, a, b> &operator=(vector<vector<T>> vec) {\\n\\t\\tfor(int i = 0; i < a; i++) {\\n\\t\\t\\tfor(int j = 0; j < b; j++) {\\n\\t\\t\\t\\tmat[i][j] = vec[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\tvector<T> &operator[](int row) { return mat[row]; }\\n\\n\\tmatrix<T, a, b> operator-() const {\\n\\t\\tauto m = *this;\\n\\t\\tfor(int i = 0; i < a; i++) {\\n\\t\\t\\tfor(int j = 0; j < b; j++) {\\n\\t\\t\\t\\tm.mat[i][j] *= -1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn m;\\n\\t}\\n\\n\\tmatrix<T, a, b> &operator+=(const matrix<T, a, b> other) {\\n\\t\\tfor(int i = 0; i < a; i++) {\\n\\t\\t\\tfor(int j = 0; j < b; j++) {\\n\\t\\t\\t\\tmat[i][j] += other.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\tmatrix<T, a, b> operator+(matrix<T, a, b> other) {\\n\\t\\tfor(int i = 0; i < a; i++) {\\n\\t\\t\\tfor(int j = 0; j < b; j++) {\\n\\t\\t\\t\\tother.mat[i][j] += mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn other;\\n\\t}\\n\\tmatrix<T, a, b> &operator-=(const matrix<T, a, b> other) {\\n\\t\\tfor(int i = 0; i < a; i++) {\\n\\t\\t\\tfor(int j = 0; j < b; j++) {\\n\\t\\t\\t\\tmat[i][j] -= other.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\tmatrix<T, a, b> operator-(matrix<T, a, b> other) {\\n\\t\\tfor(int i = 0; i < a; i++) {\\n\\t\\t\\tfor(int j = 0; j < b; j++) {\\n\\t\\t\\t\\tother.mat[i][j] = mat[i][j] - other.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn other;\\n\\t}\\n\\ttemplate <int c>\\n\\tmatrix<T, a, c> operator*(const matrix<T, b, c> other) {\\n\\t\\tmatrix<T, a, c> res;\\n\\t\\tfor(int i = 0; i < a; i++) {\\n\\t\\t\\tfor(int j = 0; j < c; j++) {\\n\\t\\t\\t\\tfor(int k = 0; k < b; k++) {\\n\\t\\t\\t\\t\\tres.mat[i][j] += mat[i][k] * other.mat[k][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\tmatrix<T, a, b> &operator*=(const matrix<T, b, b> other) {\\n\\t\\tmatrix<T, a, b> res;\\n\\t\\tfor(int i = 0; i < a; i++) {\\n\\t\\t\\tfor(int j = 0; j < b; j++) {\\n\\t\\t\\t\\tfor(int k = 0; k < b; k++) {\\n\\t\\t\\t\\t\\tres.mat[i][j] += mat[i][k] * other.mat[k][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this = res;\\n\\t}\\n\\ttemplate <class U>\\n\\tmatrix<T, a, a> pow(U n) {\\t// n乗\\n\\t\\tassert(a == b);\\n\\t\\tmatrix<T, a, a> ret;\\n\\t\\tret.unit();\\n\\t\\tmatrix<T, a, a> m = *this;\\n\\t\\twhile(n > 0) {\\n\\t\\t\\tif(n & 1) ret *= m;\\n\\t\\t\\tn /= 2;\\n\\t\\t\\tm *= m;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tvoid print() {\\n\\t\\tfor(int i = 0; i < a; i++) {\\n\\t\\t\\tfor(int j = 0; j < b; j++) {\\n\\t\\t\\t\\tcout << mat[i][j];\\n\\t\\t\\t\\tcout << (j == b - 1 ? \\\"\\\\n\\\" : \\\" \\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvoid zero() { // 0行列\\n\\t\\tfor(int i = 0; i < a; i++)\\n\\t\\t\\tfor(int j = 0; j < b; j++) mat[i][j] = 0;\\n\\t}\\n\\tvoid unit() { //単位行列\\n\\t\\tfor(int i = 0; i < a; i++)\\n\\t\\t\\tfor(int j = 0; j < b; j++) mat[i][j] = (i == j ? 1 : 0);\\n\\t}\\n};\\n\\ntemplate <class T, int a, int b>\\nvoid view(matrix<T, a, b> mat) {\\n\\tview(mat.mat);\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\tcout << fixed << setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tINT(q);\\n\\tvector<mint> ans(q);\\n\\n\\trep(i, q) {\\n\\t\\tINT(a, l, r);\\n\\t\\tif(a == 1) {\\n\\t\\t\\tans[i] = r - l + 1;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\t// debug(a, l, r);\\n\\n\\t\\tmatrix<mint, 3, 3> mat;\\n\\t\\tmat.mat = {{1, 1, 0}, {0, 2 * a, -1}, {0, 1, 0}};\\n\\n\\t\\tauto p = mat.pow(r);\\n\\n\\t\\tif(l >= 1) {\\n\\t\\t\\tauto rr = mat.pow(l - 1);\\n\\t\\t\\tdebug(p, rr);\\n\\t\\t\\tp -= rr;\\n\\t\\t}\\n\\n\\t\\tmatrix<mint, 3, 1> t;\\n\\t\\tt.mat = {{2}, {2 * a}, {2}};\\n\\t\\tmatrix<mint, 3, 1> g = p * t;\\n\\n\\t\\t// debug(mat, g, t);\\n\\t\\t// d//ump(p);\\n\\n\\t\\tans[i] = g[0][0] - (r - l + 1);\\n\\t}\\n\\tvout(ans, 1);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3616,\n \"score_of_the_acc\": -1.1557,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3162_4835530\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <iomanip>\\n#include <set>\\n#include <tuple>\\n#define mkp make_pair\\n#define mkt make_tuple\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD=1e9+7;\\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\\n\\ntypedef vector<ll> vec;//ll?\\ntypedef vector<vec> mat;\\n\\nmat mul(mat &A,mat &B){\\n mat C(A.size(),vec(B[0].size()));\\n for(int i=0;i<A.size();i++){\\n for(int k=0;k<B.size();k++){\\n for(int j=0;j<B[0].size();j++){\\n C[i][j]=(C[i][j]+(A[i][k]*B[k][j])%MOD)%MOD;\\n }\\n }\\n }\\n return C;\\n}\\n\\nmat pow(mat A,ll n){\\n mat B(A.size(),vec(A.size()));\\n for(int i=0;i<A.size();i++){\\n B[i][i]=1;\\n }\\n while(n>0){\\n if(n&1) B=mul(B,A);\\n A=mul(A,A);\\n n=(n>>1);\\n }\\n return B;\\n}\\n\\nll solve(ll R,ll A){\\n if(R==0) return 2;\\n if(R==1) return (2*A+2)%MOD;\\n\\n mat B(3,vec(3,0));\\n B[0][0]=2*A%MOD;B[0][1]=MOD-1;B[0][2]=0;\\n B[1][0]=1;B[1][1]=0;B[1][2]=0;\\n B[2][0]=2*A%MOD;B[2][1]=MOD-1;B[2][2]=1;\\n\\n mat C=pow(B,R-1);\\n ll ans=(C[2][0]*2%MOD*A%MOD+C[2][1]*2%MOD+C[2][2]*(2*A%MOD+2)%MOD)%MOD;\\n return ans;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int Q;\\n cin>>Q;\\n rep(q,Q){\\n ll A,L,R;\\n cin>>A>>L>>R;\\n\\n ll ans=solve(R,A);\\n if(L-1>=0) ans=(ans-solve(L-1,A)+MOD)%MOD;\\n ans=(ans-(R-L+1)+MOD)%MOD;\\n cout<<ans<<\\\"\\\\n\\\";\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3216,\n \"score_of_the_acc\": -0.5761,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3162_4835403\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<utility>\\n#include<map>\\n#include<set>\\n#include<queue>\\n#include<stack>\\n#include<functional>\\n#include<math.h>\\n#include<random>\\n#include <bitset>\\n#include <deque>\\nusing namespace std;\\n#define N (1000000000+7)\\n//#define N 998244353\\n#define INF 1e16\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\ntypedef pair<int,P> Q;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\nconst int inf = (int)1e9; \\n \\nll gcd(ll a, ll b) {\\n\\tif (b > a) {\\n\\t\\tll tmp = b;\\n\\t\\tb = a;\\n\\t\\ta = tmp;\\n\\t}\\n\\tif (a%b == 0)return b;\\n\\telse return gcd(b, a%b);\\n}\\n\\nmat mul(mat &A,mat &B){\\n mat C(A.size(),vec(B[0].size()));\\n for(int i=0;i<A.size();i++){\\n for(int k=0;k<B.size();k++){\\n for(int j=0;j<B[0].size();j++){\\n ll t = (A[i][k]*B[k][j])%N;\\n C[i][j] = (C[i][j]+t)%N;\\n C[i][j] = (C[i][j]+N)%N;\\n }\\n }\\n }\\n return C;\\n}\\n\\nmat Pow(mat A,ll n){\\n mat B(A.size(),vec(A.size()));\\n for(int i=0;i<A.size();i++)B[i][i]=1LL;\\n while(n>0){\\n if(n&1)B = mul(B,A);\\n A = mul(A,A);\\n n>>=1;\\n }\\n return B;\\n}\\n\\nint main(void){\\n\\tint q;\\n\\tcin>>q;\\n\\twhile(q--){\\n\\t\\tll a,l,r;\\n\\t\\tcin>>a>>l>>r;\\n\\t\\tmat A(2,vec(2));\\n\\t\\tA[0][0] = (2*a)%N;\\n\\t\\tA[0][1] = (-1+N)%N;\\n\\t\\tA[1][0] = 1;\\n\\t\\tif(l==r){\\n\\t\\t\\tA = Pow(A,r);\\n\\t\\t\\tll ans = (A[1][0]*2*a)%N;\\n\\t\\t\\tans = (ans+A[1][1]*2)%N;\\n\\t\\t\\tcout<<(ans-1+N)%N<<endl;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tif(l==0){\\n\\t\\t\\t\\tmat B(2*2,vec(2*2));\\n\\t\\t\\t\\tfor(int i=0;i<2;i++){\\n\\t\\t\\t\\t\\tfor(int j=0;j<2;j++){\\n\\t\\t\\t\\t\\t\\tB[i][j] = A[i][j];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tB[2+i][i]=1;\\n\\t\\t\\t\\t\\tB[2+i][2+i]=1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tB = Pow(B,r+1);\\n\\t\\t\\t\\tll ans = (B[2+1][0]*2*a)%N;\\n\\t\\t\\t\\tans = (ans+B[2+1][1]*2)%N;\\n\\t\\t\\t\\tans = ans-(r-l+1);\\n\\t\\t\\t\\tans = (ans+N)%N;\\n\\t\\t\\t\\tcout<<ans<<endl;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tmat Br(2*2,vec(2*2)),Bl(2*2,vec(2*2));\\n\\t\\t\\t\\tfor(int i=0;i<2;i++){\\n\\t\\t\\t\\t\\tfor(int j=0;j<2;j++){\\n\\t\\t\\t\\t\\t\\tBr[i][j] = A[i][j];\\n\\t\\t\\t\\t\\t\\tBl[i][j] = A[i][j];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tBr[2+i][i]=1;\\n\\t\\t\\t\\t\\tBr[2+i][2+i]=1;\\n\\t\\t\\t\\t\\tBl[2+i][i]=1;\\n\\t\\t\\t\\t\\tBl[2+i][2+i]=1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tBr = Pow(Br,r+1);\\n\\t\\t\\t\\tBl = Pow(Bl,l);\\n\\t\\t\\t\\tll ans1 = (Br[3][0]*2*a)%N;\\n\\t\\t\\t\\tans1 = (ans1+Br[3][1]*2)%N;\\n\\t\\t\\t\\tll ans2 = (Bl[3][0]*2*a)%N;\\n\\t\\t\\t\\tans2 = (ans2+Bl[3][1]*2)%N;\\n\\t\\t\\t\\tll ans = (ans1-ans2+N)%N;\\n\\t\\t\\t\\tans = (ans-(r-l+1)+N)%N;\\n\\t\\t\\t\\tcout<<ans<<endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -1.1187,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3162_4834939\",\n \"code_snippet\": \"/**\\n * author: otera \\n**/\\n#include<iostream>\\n#include<string> \\n#include<cstdio>\\n#include<cstring>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm> \\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<deque>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\n#define int long long\\ntypedef long long ll;\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\ntypedef long double ld;\\nconst int inf=1e9+7;\\nconst ll INF=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-8;\\nconst ld pi = acos(-1.0);\\ntypedef pair<int, int> P;\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define pb push_back\\n#define debug(x) cerr << #x << \\\" = \\\" << (x) << endl;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n\\nmat mul(mat& A, mat& B) {\\n mat C(A.size(), vec(B[0].size(), 0));\\n for(int i = 0; i < A.size(); ++i) {\\n for(int j = 0; j < B[0].size(); ++j) {\\n for(int k = 0; k < B.size(); ++k) {\\n C[i][j] = (C[i][j] + A[i][k] * B[k][j] % mod) % mod;\\n }\\n }\\n }\\n return C;\\n}\\n\\nmat pow(mat A, ll n) {\\n mat B(A.size(), vec(A.size(), 0));\\n for(int i = 0; i < A.size(); ++i) {\\n B[i][i] = 1LL;\\n }\\n while(n > 0) {\\n if(n & 1) B = mul(B, A);\\n A = mul(A, A);\\n n >>= 1;\\n }\\n return B;\\n}\\n\\nvoid solve() {\\n\\tint q; cin >> q;\\n rep(_, q) {\\n int a, l, r; cin >> a >> l >> r;\\n if(a == 1) {\\n cout << r - l + 1 << endl;\\n continue;\\n }\\n mat A(3, vec(3, 0));\\n A[0][0] = (2 * a + 1) % mod, A[0][1] = (- 2 * a - 1 + 2 * mod) % mod, A[0][2] = 1LL, A[1][0] = 1LL, A[2][1] = 1LL;\\n ll sl = 0, sr = 0;\\n if(l >= 2) {\\n mat B = pow(A, l - 2);\\n sl = (B[0][0] * ((2 * a + 2) % mod) % mod + B[0][1] * 2LL % mod) % mod;\\n } else {\\n if(l == 1) sl = 2;\\n if(l == 0) sl = 0;\\n }\\n if(r + 1 >= 2) {\\n mat B = pow(A, r + 1 - 2);\\n sr = (B[0][0] * ((2 * a + 2) % mod) % mod + B[0][1] * 2LL % mod) % mod;\\n } else {\\n sr = 2;\\n }\\n cout << ((sr - sl + mod) % mod - (r - l + 1) + mod) % mod << endl;\\n }\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//int t; cin >> t; rep(i, t)solve();\\n\\tsolve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3212,\n \"score_of_the_acc\": -0.5926,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3162_4834901\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n//using mint = modint998244353;\\n//using mint = modint1000000007;\\n#include <bits/stdc++.h>\\nusing namespace std;\\n//#include <ext/pb_ds/assoc_container.hpp>\\n//#include <ext/pb_ds/tree_policy.hpp>\\n//using namespace __gnu_pbds;\\n//using i128 = __int128_t;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<long long, long long>;\\n#define rep(i, n) for(int i = 0; i < (n); ++i)\\n#define all(x) (x).begin(),(x).end()\\n#define SZ(x) ((int)(x).size())\\nconstexpr char ln = '\\\\n';\\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\\ninline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}\\ninline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}\\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\\ninline int popcount(int x) {return __builtin_popcount(x);}\\ninline int popcount(long long x) {return __builtin_popcountll(x);}\\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\\ninline void print() {cout << \\\"\\\\n\\\";}\\ntemplate<class T>\\ninline void print(const vector<T> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \\\" \\\";\\n print();\\n}\\ntemplate<class T, class... Args>\\ninline void print(const T &x, const Args &... args) {\\n cout << x << \\\" \\\";\\n print(args...);\\n}\\n#ifdef MINATO_LOCAL\\n#define dump(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\ninline void debug() {cerr << endl;}\\ntemplate<class T>\\ninline void debug(const vector<T> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \\\" \\\";\\n debug();\\n}\\ntemplate<class T, class... Args>\\ninline void debug(const T &x, const Args &... args) {\\n cerr << x << \\\" \\\";\\n debug(args...);\\n}\\n#else\\n#define dump(x) void(0)\\ninline void debug() {}\\ntemplate<class T> inline void debug(const vector<T> &v) {}\\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\\n#endif\\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\ntemplate<typename T, int sz>\\nstruct Matrix {\\n \\tarray<array<T, sz>, sz> A;\\n\\tint N;\\n\\n \\tMatrix() : N(sz) {}\\n \\tMatrix(int N) : N(N) {}\\n\\n\\tconst array<T, sz> &operator[](int k) const {return A[k];}\\n \\tarray<T, sz> &operator[](int k) {return A[k];}\\n\\n \\tstatic Matrix I(int N) {\\n \\tMatrix<T, sz> mat(N);\\n \\tfor(int i = 0; i < N; i++) mat[i][i] = 1;\\n \\treturn mat;\\n \\t}\\n\\n \\tMatrix &operator+=(const Matrix &B) {\\n \\tfor(int i = 0; i < N; i++) {\\n \\t for(int j = 0; j < N; j++) {\\n \\t (*this)[i][j] += B[i][j];\\n }\\n }\\n \\treturn *this;\\n \\t}\\n\\n \\tMatrix &operator-=(const Matrix &B) {\\n \\tfor(int i = 0; i < N; i++) {\\n \\t\\tfor(int j = 0; j < N; j++) {\\n\\t\\t\\t\\t(*this)[i][j] -= B[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n \\treturn *this;\\n \\t}\\n\\n Matrix &operator*=(const Matrix &B) {\\n Matrix<T, sz> C(N);\\n for(int i = 0; i < N; i++) {\\n for(int k = 0; k < N; k++) {\\n for(int j = 0; j < N; j++) {\\n C[i][j] += (*this)[i][k] * B[k][j];\\n }\\n }\\n }\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n swap(A[i][j],C.A[i][j]);\\n }\\n }\\n return *this;\\n }\\n\\n Matrix &operator^=(long long k) {\\n Matrix<T, sz> B = Matrix<T, sz>::I(N);\\n while(k) {\\n if(k & 1) B *= *this;\\n *this *= *this;\\n k >>= 1;\\n }\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n swap(A[i][j],B.A[i][j]);\\n }\\n }\\n return *this;\\n }\\n\\n Matrix operator+(const Matrix &B) const {return (Matrix(*this) += B);}\\n Matrix operator-(const Matrix &B) const {return (Matrix(*this) -= B);}\\n Matrix operator*(const Matrix &B) const {return (Matrix(*this) *= B);}\\n Matrix operator^(const long long k) const {return (Matrix(*this) ^= k);}\\n};\\n\\ntemplate <uint_fast64_t Modulus> \\nstruct ModInt {\\n using u64 = uint_fast64_t;\\n\\n u64 a;\\n\\n constexpr ModInt(const long long x = 0) noexcept : a(x >= 0 ? x % Modulus : (Modulus - (-x) % Modulus) % Modulus) {}\\n constexpr u64 &value() noexcept {return a;}\\n constexpr const u64 &value() const noexcept {return a;}\\n constexpr ModInt operator+(const ModInt rhs) const noexcept {return ModInt(*this) += rhs;}\\n constexpr ModInt operator-(const ModInt rhs) const noexcept {return ModInt(*this) -= rhs;}\\n constexpr ModInt operator*(const ModInt rhs) const noexcept {return ModInt(*this) *= rhs;}\\n constexpr ModInt operator/(const ModInt rhs) const noexcept {return ModInt(*this) /= rhs;}\\n constexpr ModInt operator^(const long long rhs) const noexcept {return ModInt(*this) ^= rhs;}\\n constexpr bool operator==(const ModInt &rhs) const noexcept {return a == rhs.a;}\\n constexpr bool operator!=(const ModInt &rhs) const noexcept {return a != rhs.a;}\\n constexpr ModInt &operator+=(const ModInt rhs) noexcept {\\n a += rhs.a;\\n if (a >= Modulus) {\\n a -= Modulus;\\n }\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt rhs) noexcept {\\n if (a < rhs.a) {\\n a += Modulus;\\n }\\n a -= rhs.a;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt rhs) noexcept {\\n a = a * rhs.a % Modulus;\\n return *this;\\n }\\n constexpr ModInt &operator/=(ModInt rhs) noexcept {\\n u64 exp = Modulus - 2;\\n while (exp) {\\n if (exp&1) *this *= rhs;\\n exp >>= 1;\\n rhs *= rhs;\\n }\\n return *this;\\n }\\n constexpr ModInt &operator^=(long long exp) noexcept {\\n ModInt rhs = a;\\n a = 1;\\n while (exp) {\\n if (exp&1) *this *= rhs;\\n exp >>= 1;\\n rhs *= rhs;\\n }\\n return *this;\\n }\\n\\n friend ostream &operator<<(ostream& os, const ModInt& rhs) noexcept {return os << rhs.a;}\\n friend istream &operator>>(istream& is, ModInt& rhs) noexcept {long long a; is >> a; rhs = a; return is;}\\n};\\n\\nconstexpr long long MOD = 1000000007;\\n//constexpr long long MOD = 998244353;\\n\\nusing mint = ModInt<MOD>;\\n\\nint main() {\\n Matrix<mint, 4> mat(4);\\n int Q; cin >> Q;\\n while(Q--) {\\n ll a,l,r; cin >> a >> l >> r;\\n if (a==1) {\\n cout << r-l+1 << ln;\\n continue;\\n }\\n mint root = a*a-1;\\n rep(i,4) rep(j,4) mat[i][j] = 0;\\n mat[0][0] = mat[2][1] = mat[3][3] = 1;\\n mat[0][1] = a*2;\\n mat[0][2] = root*2;\\n mat[0][3] = -1;\\n mat[1][1] = mat[2][2] = a;\\n mat[1][2] = root;\\n mat ^= r;\\n mint ans = mat[0][0]+mat[0][1]+mat[0][3];\\n //dump(ans);\\n if (l) {\\n rep(i,4) rep(j,4) mat[i][j] = 0;\\n mat[0][0] = mat[2][1] = mat[3][3] = 1;\\n mat[0][1] = a*2;\\n mat[0][2] = root*2;\\n mat[0][3] = -1;\\n mat[1][1] = mat[2][2] = a;\\n mat[1][2] = root;\\n mat ^= (l-1);\\n ans -= mat[0][0]+mat[0][1]+mat[0][3];\\n }\\n\\n cout << ans << ln;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3452,\n \"score_of_the_acc\": -0.6949,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3162_4834790\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(v) (v).begin(),(v).end()\\nusing ll = long long;\\nconstexpr int INF = 0x3f3f3f3f;\\nconstexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL;\\nconstexpr double EPS = 1e-8;\\nconstexpr int MOD = 1000000007;\\n// constexpr int MOD = 998244353;\\nconstexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\\nconstexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};\\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\\nstruct IOSetup {\\n IOSetup() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n }\\n} iosetup;\\n\\ntemplate <int MOD>\\nstruct MInt {\\n unsigned val;\\n MInt(): val(0) {}\\n MInt(long long x) : val(x >= 0 ? x % MOD : x % MOD + MOD) {}\\n static int get_mod() { return MOD; }\\n static void set_mod(int divisor) { assert(divisor == MOD); }\\n MInt pow(long long exponent) const {\\n MInt tmp = *this, res = 1;\\n while (exponent > 0) {\\n if (exponent & 1) res *= tmp;\\n tmp *= tmp;\\n exponent >>= 1;\\n }\\n return res;\\n }\\n MInt &operator+=(const MInt &x) { if((val += x.val) >= MOD) val -= MOD; return *this; }\\n MInt &operator-=(const MInt &x) { if((val += MOD - x.val) >= MOD) val -= MOD; return *this; }\\n MInt &operator*=(const MInt &x) { val = static_cast<unsigned long long>(val) * x.val % MOD; return *this; }\\n MInt &operator/=(const MInt &x) {\\n // assert(std::__gcd(static_cast<int>(x.val), MOD) == 1);\\n unsigned a = x.val, b = MOD; int u = 1, v = 0;\\n while (b) {\\n unsigned tmp = a / b;\\n std::swap(a -= tmp * b, b);\\n std::swap(u -= tmp * v, v);\\n }\\n return *this *= u;\\n }\\n bool operator==(const MInt &x) const { return val == x.val; }\\n bool operator!=(const MInt &x) const { return val != x.val; }\\n bool operator<(const MInt &x) const { return val < x.val; }\\n bool operator<=(const MInt &x) const { return val <= x.val; }\\n bool operator>(const MInt &x) const { return val > x.val; }\\n bool operator>=(const MInt &x) const { return val >= x.val; }\\n MInt &operator++() { if (++val == MOD) val = 0; return *this; }\\n MInt operator++(int) { MInt res = *this; ++*this; return res; }\\n MInt &operator--() { val = (val == 0 ? MOD : val) - 1; return *this; }\\n MInt operator--(int) { MInt res = *this; --*this; return res; }\\n MInt operator+() const { return *this; }\\n MInt operator-() const { return MInt(val ? MOD - val : 0); }\\n MInt operator+(const MInt &x) const { return MInt(*this) += x; }\\n MInt operator-(const MInt &x) const { return MInt(*this) -= x; }\\n MInt operator*(const MInt &x) const { return MInt(*this) *= x; }\\n MInt operator/(const MInt &x) const { return MInt(*this) /= x; }\\n friend std::ostream &operator<<(std::ostream &os, const MInt &x) { return os << x.val; }\\n friend std::istream &operator>>(std::istream &is, MInt &x) { long long val; is >> val; x = MInt(val); return is; }\\n};\\nnamespace std { template <int MOD> MInt<MOD> abs(const MInt<MOD> &x) { return x; } }\\ntemplate <int MOD>\\nstruct Combinatorics {\\n using ModInt = MInt<MOD>;\\n int val; // \\\"val!\\\" and \\\"mod\\\" must be disjoint.\\n std::vector<ModInt> fact, fact_inv, inv;\\n Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {\\n fact[0] = 1;\\n for (int i = 1; i <= val; ++i) fact[i] = fact[i - 1] * i;\\n fact_inv[val] = ModInt(1) / fact[val];\\n for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;\\n for (int i = 1; i <= val; ++i) inv[i] = fact[i - 1] * fact_inv[i];\\n }\\n ModInt nCk(int n, int k) const {\\n if (n < 0 || n < k || k < 0) return 0;\\n assert(n <= val && k <= val);\\n return fact[n] * fact_inv[k] * fact_inv[n - k];\\n }\\n ModInt nPk(int n, int k) const {\\n if (n < 0 || n < k || k < 0) return 0;\\n assert(n <= val);\\n return fact[n] * fact_inv[n - k];\\n }\\n ModInt nHk(int n, int k) const {\\n if (n < 0 || k < 0) return 0;\\n return k == 0 ? 1 : nCk(n + k - 1, k);\\n }\\n};\\nusing ModInt = MInt<MOD>;\\n\\ntemplate <typename T>\\nstruct Matrix {\\n Matrix(int m, int n, T val = 0) : dat(m, std::vector<T>(n, val)) {}\\n\\n int height() const { return dat.size(); }\\n\\n int width() const { return dat.front().size(); }\\n\\n Matrix pow(long long exponent) const {\\n int n = height();\\n Matrix<T> tmp = *this, res(n, n, 0);\\n for (int i = 0; i < n; ++i) res[i][i] = 1;\\n while (exponent > 0) {\\n if (exponent & 1) res *= tmp;\\n tmp *= tmp;\\n exponent >>= 1;\\n }\\n return res;\\n }\\n\\n inline const std::vector<T> &operator[](const int idx) const { return dat[idx]; }\\n inline std::vector<T> &operator[](const int idx) { return dat[idx]; }\\n\\n Matrix &operator=(const Matrix &x) {\\n int m = x.height(), n = x.width();\\n dat.resize(m, std::vector<T>(n));\\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] = x[i][j];\\n return *this;\\n }\\n\\n Matrix &operator+=(const Matrix &x) {\\n int m = height(), n = width();\\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] += x[i][j];\\n return *this;\\n }\\n\\n Matrix &operator-=(const Matrix &x) {\\n int m = height(), n = width();\\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] -= x[i][j];\\n return *this;\\n }\\n\\n Matrix &operator*=(const Matrix &x) {\\n int m = height(), n = x.width(), l = width();\\n std::vector<std::vector<T>> res(m, std::vector<T>(n, 0));\\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) {\\n for (int k = 0; k < l; ++k) res[i][j] += dat[i][k] * x[k][j];\\n }\\n std::swap(dat, res);\\n return *this;\\n }\\n\\n Matrix operator+(const Matrix &x) const { return Matrix(*this) += x; }\\n\\n Matrix operator-(const Matrix &x) const { return Matrix(*this) -= x; }\\n\\n Matrix operator*(const Matrix &x) const { return Matrix(*this) *= x; }\\n\\nprivate:\\n std::vector<std::vector<T>> dat;\\n};\\n\\nModInt solve(int a, int r) {\\n if (r == -1) return 0;\\n if (r == 0) return 2;\\n Matrix<ModInt> m(3, 3), init(3, 1);\\n m[0][0] = 1; m[0][1] = a * 2; m[0][2] = -1;\\n m[1][1] = a * 2; m[1][2] = -1;\\n m[2][1] = 1;\\n init[0][0] = a * 2 + 2;\\n init[1][0] = a * 2;\\n init[2][0] = 2;\\n return (m.pow(r - 1) * init)[0][0];\\n}\\n\\nint main() {\\n int q; cin >> q;\\n while (q--) {\\n int a, l, r; cin >> a >> l >> r;\\n cout << solve(a, r) - solve(a, l - 1) - (r - l + 1) << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3452,\n \"score_of_the_acc\": -0.7858,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3162_4834309\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nint main(){\\n using namespace std;\\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\\n constexpr unsigned long MOD = 1000000007;\\n constexpr unsigned long buf_size = 3UL << 18UL;\\n char buffer[buf_size];\\n fread(buffer, 1, buf_size, stdin);\\n unsigned long tmp_buf = 0;\\n const auto& read = [&tmp_buf, &buffer]{\\n const auto& M_reread_from_stdin = [&]{\\n ptrdiff_t len = buf_size - tmp_buf;\\n if (len > tmp_buf) return;\\n memcpy(buffer, buffer + tmp_buf, len);\\n char* tmp = buffer + len;\\n fread(tmp, 1, buf_size-len, stdin);\\n tmp_buf = 0;\\n };\\n unsigned long ret;\\n from_chars_result tmp{};\\n do{\\n if (__builtin_expect(buf_size <= tmp_buf + 32, 0))\\n M_reread_from_stdin();\\n tmp = from_chars(begin(buffer) + tmp_buf, end(buffer), ret);\\n tmp_buf = tmp.ptr - buffer + 1;\\n }while(tmp.ec != errc{});\\n return ret;\\n };\\n const auto& scan = [scan_impl = [&read](auto& x) -> decltype(auto) { return x = read(); }](auto&...args){ tuple<decltype(args)...>{scan_impl(args)...}; };\\n const unsigned long Q{read()};\\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\\n unsigned long r{b % MOD}, n{MOD - 2};\\n while(n){\\n if(n & 1)(r *= a) %= MOD;\\n (a *= a) %= MOD;\\n n >>= 1;\\n }\\n return r;\\n };\\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &scan, &a, &l, &r]{\\n scan(a, l, r);\\n ++r;\\n if(a == 1)return r - l;\\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\\n ret.first %= MOD;\\n ret.second %= MOD;\\n return ret;\\n };\\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\\n f_1e9_7_va ret{b}, al{a};\\n while(n){\\n if(n & 1)ret = mul(ret, al);\\n al = mul(al, al);\\n n >>= 1;\\n }\\n return ret;\\n };\\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\\n };\\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\\n }() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3716,\n \"score_of_the_acc\": -0.9938,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3162_4834305\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nint main(){\\n using namespace std;\\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\\n constexpr unsigned long MOD = 1000000007;\\n constexpr unsigned long buf_size = 1UL << 20UL;\\n char buffer[buf_size];\\n fread(buffer, 1, buf_size, stdin);\\n unsigned long tmp_buf = 0;\\n const auto& read = [&tmp_buf, &buffer]{\\n const auto& M_reread_from_stdin = [&]{\\n ptrdiff_t len = buf_size - tmp_buf;\\n if (len > tmp_buf) return;\\n memcpy(buffer, buffer + tmp_buf, len);\\n char* tmp = buffer + len;\\n fread(tmp, 1, buf_size-len, stdin);\\n tmp_buf = 0;\\n };\\n unsigned long ret;\\n from_chars_result tmp{};\\n do{\\n if (__builtin_expect(buf_size <= tmp_buf + 32, 0))\\n M_reread_from_stdin();\\n tmp = from_chars(begin(buffer) + tmp_buf, end(buffer), ret);\\n tmp_buf = tmp.ptr - buffer + 1;\\n }while(tmp.ec != errc{});\\n return ret;\\n };\\n const auto& scan = [scan_impl = [&read](auto& x) -> decltype(auto) { return x = read(); }](auto&...args){ tuple<decltype(args)...>{scan_impl(args)...}; };\\n const unsigned long Q{read()};\\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\\n unsigned long r{b % MOD}, n{MOD - 2};\\n while(n){\\n if(n & 1)(r *= a) %= MOD;\\n (a *= a) %= MOD;\\n n >>= 1;\\n }\\n return r;\\n };\\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &scan, &a, &l, &r]{\\n scan(a, l, r);\\n ++r;\\n if(a == 1)return r - l;\\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\\n ret.first %= MOD;\\n ret.second %= MOD;\\n return ret;\\n };\\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\\n f_1e9_7_va ret{b}, al{a};\\n while(n){\\n if(n & 1)ret = mul(ret, al);\\n al = mul(al, al);\\n n >>= 1;\\n }\\n return ret;\\n };\\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\\n };\\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\\n }() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3648,\n \"score_of_the_acc\": -0.8875,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3162_4834303\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nint main(){\\n using namespace std;\\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\\n constexpr unsigned long MOD = 1000000007;\\n constexpr unsigned long buf_size = 1UL << 17UL;\\n char buffer[buf_size];\\n fread(buffer, 1, buf_size, stdin);\\n unsigned long tmp_buf = 0;\\n const auto& read = [&tmp_buf, &buffer]{\\n const auto& M_reread_from_stdin = [&]{\\n ptrdiff_t len = buf_size - tmp_buf;\\n if (len > tmp_buf) return;\\n memcpy(buffer, buffer + tmp_buf, len);\\n char* tmp = buffer + len;\\n fread(tmp, 1, buf_size-len, stdin);\\n tmp_buf = 0;\\n };\\n unsigned long ret;\\n from_chars_result tmp{};\\n do{\\n if (__builtin_expect(buf_size <= tmp_buf + 20, 0))\\n M_reread_from_stdin();\\n tmp = from_chars(begin(buffer) + tmp_buf, end(buffer), ret);\\n tmp_buf = tmp.ptr - buffer + 1;\\n }while(tmp.ec != errc{});\\n return ret;\\n };\\n const auto& scan = [scan_impl = [&read](auto& x) -> decltype(auto) { return x = read(); }](auto&...args){ tuple<decltype(args)...>{scan_impl(args)...}; };\\n const unsigned long Q{read()};\\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\\n unsigned long r{b % MOD}, n{MOD - 2};\\n while(n){\\n if(n & 1)(r *= a) %= MOD;\\n (a *= a) %= MOD;\\n n >>= 1;\\n }\\n return r;\\n };\\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &scan, &a, &l, &r]{\\n scan(a, l, r);\\n ++r;\\n if(a == 1)return r - l;\\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\\n ret.first %= MOD;\\n ret.second %= MOD;\\n return ret;\\n };\\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\\n f_1e9_7_va ret{b}, al{a};\\n while(n){\\n if(n & 1)ret = mul(ret, al);\\n al = mul(al, al);\\n n >>= 1;\\n }\\n return ret;\\n };\\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\\n };\\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\\n }() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3540,\n \"score_of_the_acc\": -0.7188,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3162_4834155\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nint main(){\\n using namespace std;\\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\\n constexpr unsigned long MOD = 1000000007;\\n char buffer[1UL << 19UL];\\n fread(buffer, 1, size(buffer), stdin);\\n unsigned long tmp_buf = 0;\\n const auto& read = [&tmp_buf, &buffer]{\\n unsigned long ret;\\n from_chars_result tmp{};\\n do{\\n tmp = from_chars(begin(buffer) + tmp_buf, end(buffer), ret);\\n tmp_buf = tmp.ptr - buffer + 1;\\n }while(tmp.ec != errc{});\\n return ret;\\n };\\n const auto& scan = [scan_impl = [&read](auto& x) -> decltype(auto) {\\n return x = read();\\n }](auto&...args){\\n tuple<decltype(args)...>{scan_impl(args)...};\\n };\\n const unsigned long Q{read()};\\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\\n unsigned long r{b % MOD}, n{MOD - 2};\\n while(n){\\n if(n & 1)(r *= a) %= MOD;\\n (a *= a) %= MOD;\\n n >>= 1;\\n }\\n return r;\\n };\\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &scan, &a, &l, &r]{\\n scan(a, l, r);\\n ++r;\\n if(a == 1)return r - l;\\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\\n ret.first %= MOD;\\n ret.second %= MOD;\\n return ret;\\n };\\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\\n f_1e9_7_va ret{b}, al{a};\\n while(n){\\n if(n & 1)ret = mul(ret, al);\\n al = mul(al, al);\\n n >>= 1;\\n }\\n return ret;\\n };\\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\\n };\\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\\n }() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3716,\n \"score_of_the_acc\": -0.9938,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3162_4834144\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nint main(){\\n using namespace std;\\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\\n constexpr unsigned long MOD = 1000000007;\\n char buffer[1UL << 19UL];\\n fread(buffer, 1, size(buffer), stdin);\\n unsigned long tmp_buf = 0;\\n const auto& read = [&tmp_buf, &buffer]{\\n unsigned long ret;\\n from_chars_result tmp{};\\n do{\\n tmp = from_chars(begin(buffer) + tmp_buf, end(buffer), ret);\\n tmp_buf = tmp.ptr - buffer + 1;\\n }while(tmp.ec != errc{});\\n return ret;\\n };\\n const auto& scan = [scan_impl = [&read](auto& x) -> auto {\\n return x = read();\\n }](auto&...args){\\n [](auto... args) -> void {}(scan_impl(args)...);\\n };\\n const unsigned long Q{read()};\\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\\n unsigned long r{b % MOD}, n{MOD - 2};\\n while(n){\\n if(n & 1)(r *= a) %= MOD;\\n (a *= a) %= MOD;\\n n >>= 1;\\n }\\n return r;\\n };\\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &scan, &a, &l, &r]{\\n scan(r, l, a);\\n ++r;\\n if(a == 1)return r - l;\\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\\n ret.first %= MOD;\\n ret.second %= MOD;\\n return ret;\\n };\\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\\n f_1e9_7_va ret{b}, al{a};\\n while(n){\\n if(n & 1)ret = mul(ret, al);\\n al = mul(al, al);\\n n >>= 1;\\n }\\n return ret;\\n };\\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\\n };\\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\\n }() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -1,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3162_4834131\",\n \"code_snippet\": \"#pragma region Macros\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define ll long long\\n#define ld long double\\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vll vector<ll>\\n#define vpi vector<pii>\\n#define vpll vector<pll>\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n#define fi first\\n#define se second\\n#define all(c) begin(c), end(c)\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\nusing namespace std;\\nstring YES[2] = {\\\"NO\\\", \\\"YES\\\"};\\nstring Yes[2] = {\\\"No\\\", \\\"Yes\\\"};\\nstring yes[2] = {\\\"no\\\", \\\"yes\\\"};\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\n#define si(c) (int)(c).size()\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\\n scan(head);\\n IN(tail...);\\n}\\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\nvi iota(int n) {\\n vi a(n);\\n iota(all(a), 0);\\n return a;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n sort(all(y));\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\nint popcount(ll x) { return __builtin_popcountll(x); }\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(15);\\n }\\n} setup_io;\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return move(res);\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n cin >> a >> b >> c;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return move(res);\\n}\\n\\n#define i128 __int128_t\\n#define ull unsigned long long int\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n for(auto &e : v) cout << e << \\\" \\\";\\n cout << endl;\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n cout << \\\"(\\\" << p.fi << \\\", \\\" << p.se << \\\")\\\";\\n return os;\\n}\\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \\\"(\\\" + to_string(p.first) + \\\",\\\" + to_string(p.second) + \\\")\\\"; }\\ntemplate <class A> string to_string(A v) {\\n if(v.empty()) return \\\"{}\\\";\\n string ret = \\\"{\\\";\\n for(auto &x : v) ret += to_string(x) + \\\",\\\";\\n ret.back() = '}';\\n return ret;\\n}\\n\\nvoid dump() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\\n cerr << to_string(head) << \\\" \\\";\\n dump(tail...);\\n}\\n#define endl '\\\\n'\\n#ifdef _LOCAL\\n#undef endl\\n#define debug(x) \\\\\\n cout << #x << \\\": \\\"; \\\\\\n dump(x)\\n#else\\n#define debug(x)\\n#endif\\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\\n\\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\n#pragma endregion\\ntemplate <class T> struct Matrix {\\n vector<vector<T>> A;\\n\\n Matrix() {}\\n\\n Matrix(size_t n, size_t m) : A(n, vector<T>(m, 0)) {}\\n\\n Matrix(size_t n) : A(n, vector<T>(n, 0)){};\\n\\n size_t height() const { return (A.size()); }\\n\\n size_t width() const { return (A[0].size()); }\\n\\n inline const vector<T> &operator[](int k) const { return (A.at(k)); }\\n\\n inline vector<T> &operator[](int k) { return (A.at(k)); }\\n\\n static Matrix I(size_t n) {\\n Matrix mat(n);\\n for(int i = 0; i < n; i++) mat[i][i] = 1;\\n return (mat);\\n }\\n\\n Matrix &operator+=(const Matrix &B) {\\n size_t n = height(), m = width();\\n assert(n == B.height() && m == B.width());\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++) (*this)[i][j] += B[i][j];\\n return (*this);\\n }\\n\\n Matrix &operator-=(const Matrix &B) {\\n size_t n = height(), m = width();\\n assert(n == B.height() && m == B.width());\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++) (*this)[i][j] -= B[i][j];\\n return (*this);\\n }\\n\\n Matrix &operator*=(const Matrix &B) {\\n size_t n = height(), m = B.width(), p = width();\\n assert(p == B.height());\\n vector<vector<T>> C(n, vector<T>(m, 0));\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++)\\n for(int k = 0; k < p; k++) C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);\\n A.swap(C);\\n return (*this);\\n }\\n\\n Matrix &operator^=(long long k) {\\n Matrix B = Matrix::I(height());\\n while(k > 0) {\\n if(k & 1) B *= *this;\\n *this *= *this;\\n k >>= 1LL;\\n }\\n A.swap(B.A);\\n return (*this);\\n }\\n\\n Matrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }\\n\\n Matrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }\\n\\n Matrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }\\n\\n Matrix operator^(const long long k) const { return (Matrix(*this) ^= k); }\\n\\n friend ostream &operator<<(ostream &os, Matrix &p) {\\n size_t n = p.height(), m = p.width();\\n for(int i = 0; i < n; i++) {\\n os << \\\"[\\\";\\n for(int j = 0; j < m; j++) { os << p[i][j] << (j + 1 == m ? \\\"]\\\\n\\\" : \\\",\\\"); }\\n }\\n return (os);\\n }\\n\\n T determinant() {\\n Matrix B(*this);\\n assert(width() == height());\\n T ret = 1;\\n for(int i = 0; i < width(); i++) {\\n int idx = -1;\\n for(int j = i; j < width(); j++) {\\n if(B[j][i] != 0) idx = j;\\n }\\n if(idx == -1) return (0);\\n if(i != idx) {\\n ret *= -1;\\n swap(B[i], B[idx]);\\n }\\n ret *= B[i][i];\\n T vv = B[i][i];\\n for(int j = 0; j < width(); j++) { B[i][j] /= vv; }\\n for(int j = i + 1; j < width(); j++) {\\n T a = B[j][i];\\n for(int k = 0; k < width(); k++) { B[j][k] -= B[i][k] * a; }\\n }\\n }\\n return (ret);\\n }\\n};\\nnamespace modular {\\nconstexpr ll MOD = 1000000007;\\nconst int MAXN = 1100000;\\ntemplate <ll Modulus> class modint;\\n#define mint modint<MOD>\\n#define vmint vector<mint>\\nvector<mint> Inv;\\nmint inv(int x);\\ntemplate <ll Modulus> class modint {\\n\\n public:\\n static constexpr int mod() { return Modulus; }\\n ll a;\\n\\n constexpr modint(const ll x = 0) noexcept : a(((x % Modulus) + Modulus) % Modulus) {}\\n constexpr ll &value() noexcept { return a; }\\n constexpr const ll &value() const noexcept { return a; }\\n constexpr modint operator-() const noexcept { return modint() - *this; }\\n constexpr modint operator+() const noexcept { return *this; }\\n constexpr modint &operator++() noexcept {\\n if(++a == MOD) a = 0;\\n return *this;\\n }\\n constexpr modint &operator--() noexcept {\\n if(!a) a = MOD;\\n a--;\\n return *this;\\n }\\n constexpr modint operator++(int) {\\n modint res = *this;\\n ++*this;\\n return res;\\n }\\n constexpr modint operator--(int) {\\n mint res = *this;\\n --*this;\\n return res;\\n }\\n constexpr modint &operator+=(const modint rhs) noexcept {\\n a += rhs.a;\\n if(a >= Modulus) { a -= Modulus; }\\n return *this;\\n }\\n constexpr modint &operator-=(const modint rhs) noexcept {\\n if(a < rhs.a) { a += Modulus; }\\n a -= rhs.a;\\n return *this;\\n }\\n constexpr modint &operator*=(const modint rhs) noexcept {\\n a = a * rhs.a % Modulus;\\n return *this;\\n }\\n constexpr modint &operator/=(const modint rhs) noexcept {\\n a = a * (modular::inv(rhs.a)).a % Modulus;\\n return *this;\\n }\\n constexpr modint pow(long long n) const noexcept {\\n assert(n >= 0);\\n modint x = *this, r = 1;\\n while(n) {\\n if(n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n constexpr modint inv() const noexcept { return pow(Modulus - 2); }\\n constexpr friend modint operator+(const modint &lhs, const modint &rhs) { return modint(lhs) += modint(rhs); }\\n constexpr friend modint operator-(const modint &lhs, const modint &rhs) { return modint(lhs) -= modint(rhs); }\\n constexpr friend modint operator*(const modint &lhs, const modint &rhs) { return modint(lhs) *= modint(rhs); }\\n constexpr friend modint operator/(const modint &lhs, const modint &rhs) { return modint(lhs) /= modint(rhs); }\\n constexpr friend modint operator==(const modint &lhs, const modint &rhs) { return lhs.a == rhs.a; }\\n constexpr friend modint operator!=(const modint &lhs, const modint &rhs) { return lhs.a != rhs.a; }\\n // constexpr friend modint operator^=(const modint &lhs, const modint &rhs) { return modint(lhs) ^= modint(rhs); }\\n};\\nvmint Prd{1, 1}, Invprd{1, 1};\\nmint inv(int n) {\\n if(Inv.empty()) Inv.emplace_back(0), Inv.emplace_back(1);\\n if(Inv.size() > n)\\n return Inv[n];\\n else {\\n for(int i = Inv.size(); i <= n; ++i) Inv.emplace_back(Inv[MOD % i] * (-MOD / i));\\n return Inv[n];\\n }\\n}\\nmint prd(int n) {\\n if(Prd.size() > n)\\n return Prd[n];\\n else\\n for(int i = Prd.size(); i <= n; ++i) Prd.emplace_back(Prd[i - 1] * i);\\n return Prd[n];\\n}\\nmint invprd(int n) {\\n if(Invprd.size() > n)\\n return Invprd[n];\\n else\\n for(int i = Invprd.size(); i <= n; ++i) Invprd.emplace_back(Invprd[i - 1] * inv(i));\\n return Invprd[n];\\n}\\nmint modpow(ll a, ll n) { return mint(a).pow(n); }\\nmint inv(mint a) { return inv(a.a); }\\nmint invprd(mint a) { return invprd(a.a); }\\nmint prd(mint a) { return prd(a.a); }\\nmint modpow(mint a, ll n) { return modpow(a.a, n); }\\nmint C(int a, int b) {\\n if(a < 0 || b < 0) return 0;\\n if(a < b) return 0;\\n return prd(a) * invprd(b) * invprd(a - b);\\n}\\nmint P(int a, int b) {\\n if(a < 0 || b < 0) return 0;\\n if(a < b) return 0;\\n return prd(a) * invprd(a - b);\\n}\\nostream &operator<<(ostream &os, mint a) {\\n os << a.a;\\n return os;\\n}\\nistream &operator>>(istream &is, mint &a) {\\n ll x;\\n is >> x;\\n a = x;\\n return is;\\n}\\nstruct modinfo {\\n int mod, root;\\n};\\nconstexpr modinfo base0{1045430273, 3};\\nconstexpr modinfo base1{1051721729, 6};\\nconstexpr modinfo base2{1053818881, 7};\\nusing mint0 = modint<base0.mod>;\\nusing mint1 = modint<base1.mod>;\\nusing mint2 = modint<base2.mod>;\\nusing Poly = vmint;\\ntemplate <int mod> void FMT(vector<modint<mod>> &f, bool inv = false) {\\n using V = vector<modint<mod>>;\\n static V g(30), ig(30);\\n if(g.front().a == 0) {\\n modint<mod> root = 2;\\n while((root.pow((mod - 1) / 2)).a == 1) root += 1;\\n rep(i, 30) g[i] = -(root.pow((mod - 1) >> (i + 2))), ig[i] = g[i].inv();\\n }\\n int n = size(f);\\n if(!inv) {\\n for(int m = n; m >>= 1;) {\\n modint<mod> w = 1;\\n for(int s = 0, k = 0; s < n; s += 2 * m) {\\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\\n auto x = f[i], y = f[j] * w;\\n if(x.a >= mod) x.a -= mod;\\n f[i].a = x.a + y.a, f[j].a = x.a + (mod - y.a);\\n }\\n w *= g[__builtin_ctz(++k)];\\n }\\n }\\n } else {\\n for(int m = 1; m < n; m *= 2) {\\n modint<mod> w = 1;\\n for(int s = 0, k = 0; s < n; s += 2 * m) {\\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\\n auto x = f[i], y = f[j];\\n f[i] = x + y, f[j].a = x.a + (mod - y.a), f[j] *= w;\\n }\\n w *= ig[__builtin_ctz(++k)];\\n }\\n }\\n }\\n modint<mod> c;\\n if(inv)\\n c = modint<mod>(n).inv();\\n else\\n c = 1;\\n for(auto &&e : f) e *= c;\\n}\\nPoly operator-(Poly f) {\\n for(auto &&e : f) e = -e;\\n return f;\\n}\\nPoly &operator+=(Poly &l, const Poly &r) {\\n l.resize(max(l.size(), r.size()));\\n rep(i, r.size()) l[i] += r[i];\\n return l;\\n}\\nPoly operator+(Poly l, const Poly &r) { return l += r; }\\nPoly &operator-=(Poly &l, const Poly &r) {\\n l.resize(max(l.size(), r.size()));\\n rep(i, r.size()) l[i] -= r[i];\\n return l;\\n}\\nPoly operator-(Poly l, const Poly &r) { return l -= r; }\\nPoly &operator<<=(Poly &f, size_t n) { return f.insert(f.begin(), n, 0), f; }\\nPoly operator<<(Poly f, size_t n) { return f <<= n; }\\nPoly &operator>>=(Poly &f, size_t n) { return f.erase(f.begin(), f.begin() + min(f.size(), n)), f; }\\nPoly operator>>(Poly f, size_t n) { return f >>= n; }\\n\\nconstexpr int mod0 = 998244353, mod1 = 1300234241, mod2 = 1484783617;\\nusing M0 = modint<mod0>;\\nusing M1 = modint<mod1>;\\nusing M2 = modint<mod2>;\\n\\ntemplate <int mod> void mul(vector<modint<mod>> &l, vector<modint<mod>> &r) {\\n int n = size(l), m = size(r), sz = 1 << __lg(2 * (n + m - 1) - 1);\\n l.resize(sz), FMT<mod>(l);\\n r.resize(sz), FMT<mod>(r);\\n rep(i, sz) l[i] *= r[i];\\n FMT<mod>(l, true);\\n l.resize(n + m - 1);\\n}\\nPoly operator*(const Poly &l, const Poly &r) {\\n if(l.empty() or r.empty()) return Poly();\\n int n = size(l), m = size(r), sz = 1 << __lg(2 * (n + m - 1) - 1);\\n vector<M0> l0(n), r0(m);\\n vector<M1> l1(n), r1(m);\\n vector<M2> l2(n), r2(m);\\n rep(i, n) l0[i] = l[i].a, l1[i] = l[i].a, l2[i] = l[i].a;\\n rep(i, m) r0[i] = r[i].a, r1[i] = r[i].a, r2[i] = r[i].a;\\n mul<mod0>(l0, r0), mul<mod1>(l1, r1), mul<mod2>(l2, r2);\\n Poly res(n + m - 1);\\n // garner\\n static constexpr M1 inv0 = 613999507;\\n static constexpr M2 inv1 = 1147332803, inv0m1 = 45381342;\\n static constexpr mint m0 = mod0, m0m1 = m0 * mod1;\\n rep(i, n + m - 1) {\\n int y0 = l0[i].a;\\n int y1 = (inv0 * (l1[i] - y0)).a;\\n int y2 = (inv0m1 * (l2[i] - y0) - inv1 * y1).a;\\n res[i] = m0 * y1 + m0m1 * y2 + y0;\\n }\\n return res;\\n}\\nPoly &operator*=(Poly &l, const Poly &r) { return l = l * r; }\\nPoly integ(const Poly &f) {\\n Poly res(f.size() + 1);\\n for(int i = 1; i < (int)res.size(); ++i) res[i] = f[i - 1] / i;\\n return res;\\n}\\n// Poly deriv(const Poly &f) {\\n// if(f.size() == 0) return Poly();\\n// Poly res(f.size() - 1);\\n// rep(i, res.size()) res[i] = f[i + 1] * (i + 1);\\n// return res;\\n// }\\nostream &operator<<(ostream &os, Poly a) {\\n for(auto e : a) cout << e.a << \\\" \\\";\\n return os;\\n}\\n} // namespace modular\\nusing namespace modular;\\n\\nint main() {\\n TEST {\\n INT(_a, l, r);\\n if(_a == 1) {\\n cout << r - l + 1 << endl;\\n continue;\\n }\\n mint a = _a;\\n Matrix<mint> A(2);\\n A[0][0] = A[1][1] = a;\\n A[0][1] = (mint)a * a - 1;\\n A[1][0] = 1;\\n auto I = A.I(2);\\n Matrix<mint> inv = I - A;\\n swap(inv[0][0], inv[1][1]);\\n inv[0][1] *= -1, inv[1][0] *= -1;\\n Matrix<mint> x(2, 1);\\n x[0][0] = 1;\\n auto E = (I - A) * inv;\\n auto f = [&](int k) -> mint {\\n if(k == -1) return 0;\\n return (((I - (A ^ (k + 1))) * inv) * x)[0][0] * modpow(1 - a.a, MOD - 2);\\n };\\n cout << f(r) - f(l - 1) - (r - l + 1) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.8966,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3162_4834055\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nint main(){\\n using namespace std;\\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\\n constexpr unsigned long MOD = 1000000007;\\n const unsigned long Q{[]{unsigned long ret; cin >> ret; return ret;}()};\\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\\n unsigned long r{b % MOD}, n{MOD - 2};\\n while(n){\\n if(n & 1)(r *= a) %= MOD;\\n (a *= a) %= MOD;\\n n >>= 1;\\n }\\n return r;\\n };\\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &a, &l, &r]{\\n cin >> a >> l >> r;\\n ++r;\\n if(a == 1)return r - l;\\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\\n ret.first %= MOD;\\n ret.second %= MOD;\\n return ret;\\n };\\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\\n f_1e9_7_va ret{b}, al{a};\\n while(n){\\n if(n & 1)ret = mul(ret, al);\\n al = mul(al, al);\\n n >>= 1;\\n }\\n return ret;\\n };\\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\\n };\\n unsigned long k{modinv(2 * a - 2)}, m{(2 * MOD - 1 - k) % MOD};\\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\\n }() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": -0.0227,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3162_4834036\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nint main(){\\n using namespace std;\\n using f_1e9_7_va = pair<unsigned long, unsigned long>;\\n constexpr unsigned long MOD = 1000000007;\\n const unsigned long Q{[]{unsigned long ret; cin >> ret; return ret;}()};\\n const auto& modinv = [](unsigned long a, unsigned long b = 1) -> unsigned long {\\n unsigned long r{b % MOD}, n{MOD - 2};\\n while(n){\\n if(n & 1)(r *= a) %= MOD;\\n (a *= a) %= MOD;\\n n >>= 1;\\n }\\n return r;\\n };\\n for(unsigned long i{0}, a, l, r; i < Q; ++i)cout << [&modinv, &a, &l, &r]{\\n cin >> a >> l >> r;\\n ++r;\\n if(a == 1)return r - l;\\n const auto& mul = [&a](const f_1e9_7_va& x, const f_1e9_7_va& y) -> f_1e9_7_va {\\n f_1e9_7_va ret{x.first * y.first + MOD - x.second * y.second % MOD, x.first * y.second + x.second * y.first + 2 * a * x.second % MOD * y.second};\\n ret.first %= MOD;\\n ret.second %= MOD;\\n return ret;\\n };\\n const auto& modpow = [&mul](const f_1e9_7_va& a, unsigned long n, const f_1e9_7_va& b = {1, 0}) -> f_1e9_7_va {\\n f_1e9_7_va ret{b}, al{a};\\n while(n){\\n if(n & 1)ret = mul(ret, al);\\n al = mul(al, al);\\n n >>= 1;\\n }\\n return ret;\\n };\\n const auto& subtract = [](const f_1e9_7_va& a, const f_1e9_7_va& b) -> f_1e9_7_va {\\n return {(a.first + MOD - b.first) % MOD, (a.second + MOD - b.second) % MOD};\\n };\\n unsigned long k{modinv(2 * a - 2, 1)}, m{(2 * MOD - 1 - k) % MOD};\\n f_1e9_7_va tmp{m, k}, x{modpow({0, 1}, r, tmp)}, y{modpow({0, 1}, l, tmp)}, z{subtract(x, y)};\\n return (2 * (z.first + a * z.second) + l + MOD - r) % MOD;\\n }() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -0.525,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3162_4833942\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for (long long i = 0; i < (n); ++i)\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll,ll>;\\nusing vec = vector<ll>;\\nusing vecp = vector<P>;\\nusing mat = vector<vec>;\\nusing matp = vector<vecp>;\\nconst ll MOD = 1e9+7;\\nconst ll INF = 1e18;\\n#define all(v) v.begin(), v.end()\\n\\nmat matmul(ll a,ll b,ll c,mat &A,mat &B){\\n mat C(a,vec(c,0));\\n rep(i,a)rep(j,c){\\n rep(k,b){\\n C.at(i).at(j)+=A.at(i).at(k)*B.at(k).at(j);\\n }\\n C.at(i).at(j)%=MOD;\\n }\\n return C;\\n}\\nmat matpow(mat A,ll n,ll k){\\n if (n == 0){\\n mat B(k,vec(k,0));\\n rep(i,k){\\n B.at(i).at(i)=1;\\n }\\n return B;\\n }\\n if (n == 1) return A;\\n if (n % 2 == 1){\\n mat t=matpow(A,n-1,k);\\n return matmul(k,k,k,A,t);\\n }\\n mat t=matpow(A,n/2,k);\\n return matmul(k,k,k,t,t);\\n}\\n\\n\\nint main(){\\n ll Q;\\n cin >> Q;\\n rep(i,Q){\\n ll a,r,l;\\n cin >> a >> l >> r;\\n if(a==1){\\n cout << r-l+1 << endl;\\n continue;\\n }\\n mat G(3,vec(3)),A(3,vec(1));\\n A.at(0).at(0)=2*a+2;\\n A.at(1).at(0)=2*a;\\n A.at(2).at(0)=2;\\n G.at(0).at(0)=1;\\n G.at(0).at(1)=2*a;\\n G.at(0).at(2)=-1;\\n G.at(1).at(0)=0;\\n G.at(1).at(1)=2*a;\\n G.at(1).at(2)=-1;\\n G.at(2).at(0)=0;\\n G.at(2).at(1)=1;\\n G.at(2).at(2)=0;\\n ll R,L;\\n if(r>=1){\\n mat X=matpow(G,r-1,3);\\n mat Y=matmul(3,3,1,X,A);\\n R=Y.at(0).at(0);\\n }else{\\n R=2;\\n }\\n if(l>1){\\n mat X=matpow(G,l-2,3);\\n mat Y=matmul(3,3,1,X,A);\\n L=Y.at(0).at(0);\\n }else if(l==1){\\n L=2;\\n }else{\\n L=0;\\n }\\n cout << (R-L-(r-l+1)+5*MOD)%MOD << endl;\\n }\\n \\n \\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.9528,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1979,"cells":{"group_id":{"kind":"string","value":"aoj_3159_cpp"},"problem_description":{"kind":"string","value":"Problem I: Magical Matrix\nProblem\n魔女の紬さんは、$N × N$ のマス目を持っています。上から $i$ 行目、左から $j$ 行目のマスをマス $( i , j )$ と呼びます。\n$ N^2$ 個のマスのうち、 $M$ 個のマスには既に整数が書き込まれており、そのうち $i$ 個目はマス $( A_i , B_i )$ で、書き込まれている数は $C_i$ です。\n紬さんは、まだ数が書かれていないマス全てについて、それぞれ $0$ 以上 $2^K$ 未満の整数のうちいずれかを書き込むことが出来ます。\n全てのマスに整数が書き込まれた後、紬さんはマス目が $1 × 1$ となるまで魔法を連続して使います。 $1$ 回魔法が使われるごとに、紬さんの持っているマス目は以下のように変化します。\n紬さんが今持っているマス目が $L \\times L$ のマス目だとすると、$( L - 1 ) \\times ( L - 1 )$ のマス目に変化する。\n魔法が使われる前のマス目のマス $( i , j )$ に書かれている数を $X_{i,j}$ 、使われた後のマス目のマス $( i , j )$ に書かれている数を $Y_{i,j}$ とすると、\n$i + j$ が偶数の時、$Y_{i,j} = X_{i,j}$ ${\\rm or}$ $X_{i,j + 1}$ ${\\rm or}$ $X_{i + 1 ,j}$ ${\\rm or}$ $X_{ i\n + 1 , j + 1 }$\n$i + j$ が奇数の時、$Y_{i,j} = X_{i,j}$ ${\\rm and}$ $X_{i,j+1}$ ${\\rm and}$ $X_{i + 1 , j}$ ${\\rm and}$ $X_{\n i + 1 , j + 1 }$\nとなる。ただし、${\\rm or}$ , ${\\rm and}$ はそれぞれビットごとの論理和、論理積を表す。\n紬さんのお気に入りの整数は $F$ であり、マス目が $1 × 1$ になった時、ただ $1$ つ残るマスに書かれている数が $F$ となるようにしたいと思っています。\n数が書かれていないマス全てに整数を書き込むことによって生成することが可能な各マスの整数の配置であって、魔法が使われマス目が$1 × 1$ になった時にただ $1$ つ残る数が $F$\n となるようなものは全部で何通りあるでしょうか？\n答えは非常に大きくなることがあるので、$998244353$ で割ったあまりを求めてください。\nConstraints\n入力は以下の条件を満たす。\n$2 \\leq N \\leq 2020$\n$0 \\leq M \\leq \\min \\left(N^2,100000\\right)$\n$1 \\leq K \\leq 30$\n$0 \\leq F \\lt 2^K $\n$1 \\leq A_i,B_i \\leq N$\n$0 \\leq C_i \\lt 2^K$\n$i \\neq j $ ならば $A_i \\neq A_j$ または $B_i \\neq B_j$\n入力は全て整数である。\nInput\n入力は以下の形式で与えられる。\n$N$ $M$ $K$ $F$\n$A_1$ $B_1$ $C_1$\n$ \\vdots $\n$A_M$ $B_M$ $C_M$\nOutput\n数の書かれていないマス全てに整数を書き込むことにより生成できる各マスの整数の配置であり、\n 最終的にただ $1$ つ残る数が $F$ となるようなものの個数を $998244353$ で割ったあまりを出力してください。\n末尾に改行を出力するのを忘れないようにしてください。\nSample Input 1\n3 9 3 7\n1 1 7\n1 2 3\n1 3 4\n2 1 6\n2 2 2\n2 3 5\n3 1 3\n3 2 1\n3 3 4\nSample Output 1\n1\n既に全てのマス目に数が書き込まれているので、生成することが可能な整数の配置は $1$ 通りです。\nこのマス目が $1×1$ となるまでには $2$ 回魔法が使われ、マス目は次のように変化していきます。\n図の通り、このマス目について最後に残る数は $7$ なので、この配置は条件を満たします。\nよって、答えは $1$ 通りとなります。\nSample Input 2\n2 1 1 1\n1 1 1\nSample Output 2\n8\nこのケースでは、$1$ マスだけ既に書き込まれており、残りの $3$ マスについて自由に決めることが出来ます。\n $K = 1$ より各マスに書き込める整数は $0$ か $1$ の $2$ 通りであるので、生成可能な配置は全てで $2^3 = 8$ 通りです。\n これらの配置は全て条件を満たすので、答えは $8$ 通りとなります。\nSample Input 3\n418 10 21 2097151\n64 224 666666\n78 78 1531381\n160 90 53\n165 75 60\n321 321 1963935\n418 269 114\n314 159 265358\n271 82 818284\n141 42 1356237\n281 274 8620\nSample Output 3\n209645193\n$998244353$ で割った余りを求めてください。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3159_10093281","code_snippet":"// competitive-verifier: PROBLEM\n#include <cassert>\n#include <vector>\n#include <cstdint>\n#include <iostream>\n#include <type_traits>\n#include <utility>\nnamespace internal {\n// @param m `1 <= m`\n// @return x mod m\nconstexpr std::int64_t safe_mod(std::int64_t x, std::int64_t m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n std::uint64_t im;\n // @param m `1 <= m`\n explicit barrett(unsigned int m) : _m(m), im((std::uint64_t)(-1) / m + 1) {}\n // @return m\n unsigned int umod() const { return _m; }\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n std::uint64_t z = a;\n z *= b;\n std::uint64_t x = (std::uint64_t)(((__uint128_t)(z)*im) >> 64);\n std::uint64_t y = x * _m;\n return (unsigned int)(z - y + (z < y ? _m : 0));\n }\n};\nstruct montgomery {\n std::uint64_t _m;\n std::uint64_t im;\n std::uint64_t r2;\n // @param m `1 <= m`\n explicit constexpr montgomery(std::uint64_t m) : _m(m), im(m), r2(-__uint128_t(m) % m) {\n for (int i = 0; i < 5; ++i) im = im * (2 - _m * im);\n im = -im;\n }\n // @return m\n constexpr std::uint64_t umod() const { return _m; }\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n constexpr std::uint64_t mul(std::uint64_t a, std::uint64_t b) const { return mr(mr(a, b), r2); }\n constexpr std::uint64_t exp(std::uint64_t a, std::uint64_t b) const {\n std::uint64_t res = 1, p = mr(a, r2);\n while (b) {\n if (b & 1) res = mr(res, p);\n p = mr(p, p);\n b >>= 1;\n }\n return res;\n }\n constexpr bool same_pow(std::uint64_t x, int s, std::uint64_t n) const {\n x = mr(x, r2), n = mr(n, r2);\n for (int r = 0; r < s; r++) {\n if (x == n) return true;\n x = mr(x, x);\n }\n return false;\n }\n private:\n constexpr std::uint64_t mr(std::uint64_t x) const {\n return ((__uint128_t)(x * im) * _m + x) >> 64;\n }\n constexpr std::uint64_t mr(std::uint64_t a, std::uint64_t b) const {\n __uint128_t t = (__uint128_t)a * b;\n std::uint64_t inc = std::uint64_t(t) != 0;\n std::uint64_t x = t >> 64, y = ((__uint128_t)(a * b * im) * _m) >> 64;\n unsigned long long z = 0;\n bool f = __builtin_uaddll_overflow(x, y, &z);\n z += inc;\n return f ? z - _m : z;\n }\n};\nconstexpr bool is_SPRP32(std::uint32_t n, std::uint32_t a) {\n std::uint32_t d = n - 1, s = 0;\n while ((d & 1) == 0) ++s, d >>= 1;\n std::uint64_t cur = 1, pw = d;\n while (pw) {\n if (pw & 1) cur = (cur * a) % n;\n a = (std::uint64_t)a * a % n;\n pw >>= 1;\n }\n if (cur == 1) return true;\n for (std::uint32_t r = 0; r < s; r++) {\n if (cur == n - 1) return true;\n cur = cur * cur % n;\n }\n return false;\n}\n// given 2 <= n,a < 2^64, a prime, check whether n is a-SPRP\nconstexpr bool is_SPRP64(const montgomery &m, std::uint64_t a) {\n auto n = m.umod();\n if (n == a) return true;\n if (n % a == 0) return false;\n std::uint64_t d = n - 1;\n int s = 0;\n while ((d & 1) == 0) ++s, d >>= 1;\n std::uint64_t cur = m.exp(a, d);\n if (cur == 1) return true;\n return m.same_pow(cur, s, n - 1);\n}\nconstexpr bool is_prime_constexpr(std::uint64_t x) {\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\n if (x < 121) return (x > 1);\n montgomery m(x);\n constexpr std::uint64_t bases[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\n for (auto a : bases) {\n if (!is_SPRP64(m, a)) return false;\n }\n return true;\n}\nconstexpr bool is_prime_constexpr(std::int64_t x) {\n if (x < 0) return false;\n return is_prime_constexpr(std::uint64_t(x));\n}\nconstexpr bool is_prime_constexpr(std::uint32_t x) {\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\n if (x < 121) return (x > 1);\n std::uint64_t h = x;\n h = ((h >> 16) ^ h) * 0x45d9f3b;\n h = ((h >> 16) ^ h) * 0x45d9f3b;\n h = ((h >> 16) ^ h) & 255;\n constexpr uint16_t bases[] = {\n 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620, 560,\n 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028,\n 2213, 6219, 620, 3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113,\n 7061, 803, 1269, 3875, 422, 751, 580, 4729, 10239, 746, 2951, 556, 2206,\n 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,\n 15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903,\n 737, 1887, 7447, 1888, 2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41,\n 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352, 6435, 165, 1169, 3315,\n 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,\n 27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524,\n 3577, 236, 2360, 6146, 2850, 55637, 1753, 4178, 8466, 222, 2579, 2743, 2031,\n 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159, 1725, 3597, 3366, 14336,\n 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,\n 434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183,\n 8126, 1870, 3296, 7455, 8947, 25017, 541, 19115, 368, 566, 5674, 411, 522,\n 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007, 35201, 4706, 1152, 1785,\n 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,\n 4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816,\n 5197, 13330, 7054, 2818, 3199, 811, 922, 350, 7514, 4452, 3449, 2663, 4708,\n 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194};\n return is_SPRP32(x, bases[h]);\n}\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr std::int64_t pow_mod_constexpr(std::int64_t x, std::int64_t n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n std::uint64_t r = 1;\n std::uint64_t y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n std::int64_t d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr std::int64_t bases[3] = {2, 7, 61};\n for (std::int64_t a : bases) {\n std::int64_t t = d;\n std::int64_t y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) { return false; }\n }\n return true;\n}\ntemplate <int n>\nconstexpr bool is_prime = is_prime_constexpr(n);\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<std::int64_t, std::int64_t> inv_gcd(std::int64_t a, std::int64_t b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n std::int64_t s = b, t = a;\n std::int64_t m0 = 0, m1 = 1;\n while (t) {\n std::int64_t u = s / t;\n s -= t * u;\n m0 -= m1 * u;\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (std::int64_t)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) { x /= i; }\n }\n }\n if (x > 1) { divs[cnt++] = x; }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m>\nconstexpr int primitive_root = primitive_root_constexpr(m);\n} // namespace internal\n#include <numeric>\nnamespace internal {\ntemplate <class T>\nusing is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;\ntemplate <class T>\nusing is_integral =\n typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value, make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\ntemplate <class T>\nusing to_unsigned_t = typename to_unsigned<T>::type;\n} // namespace internal\nnamespace internal {\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\ntemplate <class T>\nusing is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T>\nusing is_modint_t = std::enable_if_t<is_modint<T>::value>;\n} // namespace internal\ntemplate <int m, std::enable_if_t<(1 <= m)> * = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n public:\n static constexpr int mod() { return m; }\n static constexpr mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n constexpr static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T> * = nullptr>\n constexpr static_modint(T v) : _v(0) {\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\n constexpr static_modint(T v) : _v(0) {\n _v = (unsigned int)(v % umod());\n }\n constexpr unsigned int val() const { return _v; }\n constexpr mint &operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n constexpr mint &operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n constexpr mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n constexpr mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n constexpr mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n constexpr mint &operator-=(const mint &rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n constexpr mint &operator*=(const mint &rhs) {\n std::uint64_t z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n constexpr mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n constexpr mint operator+() const { return *this; }\n constexpr mint operator-() const { return mint() - *this; }\n constexpr mint pow(std::int64_t n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n constexpr mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n friend constexpr mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\n friend constexpr mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\n friend constexpr mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\n friend constexpr mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\n friend constexpr bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\n friend constexpr bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\n std::int64_t t;\n is >> t;\n rhs = mint(t);\n return is;\n }\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\n return os << rhs._v;\n }\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\ntemplate <int id>\nstruct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n unsigned int val() const { return _v; }\n mint &operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint &operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint &operator-=(const mint &rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint &operator*=(const mint &rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n mint pow(std::int64_t n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\n friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\n friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\n friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\n friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\n friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\n std::int64_t t;\n is >> t;\n rhs = mint(t);\n return is;\n }\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\n return os << rhs._v;\n }\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id>\ninternal::barrett dynamic_modint<id>::bt(998244353);\nusing modint998 = static_modint<998244353>;\nusing modint107 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\nnamespace internal {\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\ntemplate <class>\nstruct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n} // namespace internal\ntemplate <class mint = modint998, internal::is_modint_t<mint> * = nullptr>\nstruct Combination {\n Combination() : _fact(), _finv() {}\n mint operator()(int n, int k) {\n if (n < k || n < 0 || k < 0) return 0;\n _init(n);\n return _fact[n] * _finv[k] * _finv[n - k];\n }\n mint fact(int x) {\n assert(x >= 0);\n _init(x);\n return _fact[x];\n }\n mint finv(int x) {\n assert(x >= 0);\n _init(x);\n return _finv[x];\n }\n mint naive(int n, int k) const {\n if (n < k || n < 0 || k < 0) return 0;\n if (n - k < k) k = n - k;\n mint res = 1;\n for (int i = 0; i < k; ++i) {\n res *= n - i;\n res /= i + 1;\n }\n return res;\n }\n mint permu(int n, int k) {\n if (n < k || n < 0 || k < 0) return 0;\n _init(n);\n return _fact[n] * _finv[n - k];\n }\n private:\n std::vector<mint> _fact, _finv;\n void _init(int n) {\n if ((int)_fact.size() > n) return;\n int m = _fact.size();\n _fact.resize(n + 1);\n for (int i = m; i <= n; ++i) {\n if (i == 0) _fact[i] = 1;\n else _fact[i] = _fact[i - 1] * i;\n }\n _finv.resize(n + 1);\n _finv[n] = _fact[n].inv();\n for (int i = n - 1; i >= m; --i) _finv[i] = _finv[i + 1] * (i + 1);\n }\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nCombination combi;\nusing Mint = modint998;\nint main(void) {\n int n, m, k, f;\n cin >> n >> m >> k >> f;\n vector<int> a(m), b(m), c(m);\n rep (i, m) cin >> a[i] >> b[i] >> c[i];\n int ans = 0;\n int cnt = n * 3 - 2;\n int rest = n * n - cnt;\n rep (i, m) {\n if (abs(a[i] - b[i]) <= 1) {\n ans = ans | c[i];\n --cnt;\n } else {\n --rest;\n }\n }\n if (ans & ~f) {\n co(0);\n return 0;\n }\n int p = 0;\n rep (i, k) p += f >> i & 1;\n if (ans == f) {\n co(Mint(2).pow(p).pow(cnt) * Mint(1 << k).pow(rest));\n } else {\n Mint s = 0;\n int q = 0;\n rep (i, k) q += ans >> i & 1;\n q = p - q;\n rep (i, q + 1) {\n if (i & 1) {\n s -= combi(q, i) * Mint(2).pow(p - i).pow(cnt);\n } else {\n s += combi(q, i) * Mint(2).pow(p - i).pow(cnt);\n }\n }\n co(s * Mint(1 << k).pow(rest));\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4388,"score_of_the_acc":-0.076,"final_rank":2},{"submission_id":"aoj_3159_10093277","code_snippet":"// competitive-verifier: PROBLEM\n#include <cassert>\n#include <vector>\n#include <cstdint>\n#include <iostream>\n#include <type_traits>\n#include <utility>\nnamespace internal {\n// @param m `1 <= m`\n// @return x mod m\nconstexpr std::int64_t safe_mod(std::int64_t x, std::int64_t m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n std::uint64_t im;\n // @param m `1 <= m`\n explicit barrett(unsigned int m) : _m(m), im((std::uint64_t)(-1) / m + 1) {}\n // @return m\n unsigned int umod() const { return _m; }\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n std::uint64_t z = a;\n z *= b;\n std::uint64_t x = (std::uint64_t)(((__uint128_t)(z)*im) >> 64);\n std::uint64_t y = x * _m;\n return (unsigned int)(z - y + (z < y ? _m : 0));\n }\n};\nstruct montgomery {\n std::uint64_t _m;\n std::uint64_t im;\n std::uint64_t r2;\n // @param m `1 <= m`\n explicit constexpr montgomery(std::uint64_t m) : _m(m), im(m), r2(-__uint128_t(m) % m) {\n for (int i = 0; i < 5; ++i) im = im * (2 - _m * im);\n im = -im;\n }\n // @return m\n constexpr std::uint64_t umod() const { return _m; }\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n constexpr std::uint64_t mul(std::uint64_t a, std::uint64_t b) const { return mr(mr(a, b), r2); }\n constexpr std::uint64_t exp(std::uint64_t a, std::uint64_t b) const {\n std::uint64_t res = 1, p = mr(a, r2);\n while (b) {\n if (b & 1) res = mr(res, p);\n p = mr(p, p);\n b >>= 1;\n }\n return res;\n }\n constexpr bool same_pow(std::uint64_t x, int s, std::uint64_t n) const {\n x = mr(x, r2), n = mr(n, r2);\n for (int r = 0; r < s; r++) {\n if (x == n) return true;\n x = mr(x, x);\n }\n return false;\n }\n private:\n constexpr std::uint64_t mr(std::uint64_t x) const {\n return ((__uint128_t)(x * im) * _m + x) >> 64;\n }\n constexpr std::uint64_t mr(std::uint64_t a, std::uint64_t b) const {\n __uint128_t t = (__uint128_t)a * b;\n std::uint64_t inc = std::uint64_t(t) != 0;\n std::uint64_t x = t >> 64, y = ((__uint128_t)(a * b * im) * _m) >> 64;\n unsigned long long z = 0;\n bool f = __builtin_uaddll_overflow(x, y, &z);\n z += inc;\n return f ? z - _m : z;\n }\n};\nconstexpr bool is_SPRP32(std::uint32_t n, std::uint32_t a) {\n std::uint32_t d = n - 1, s = 0;\n while ((d & 1) == 0) ++s, d >>= 1;\n std::uint64_t cur = 1, pw = d;\n while (pw) {\n if (pw & 1) cur = (cur * a) % n;\n a = (std::uint64_t)a * a % n;\n pw >>= 1;\n }\n if (cur == 1) return true;\n for (std::uint32_t r = 0; r < s; r++) {\n if (cur == n - 1) return true;\n cur = cur * cur % n;\n }\n return false;\n}\n// given 2 <= n,a < 2^64, a prime, check whether n is a-SPRP\nconstexpr bool is_SPRP64(const montgomery &m, std::uint64_t a) {\n auto n = m.umod();\n if (n == a) return true;\n if (n % a == 0) return false;\n std::uint64_t d = n - 1;\n int s = 0;\n while ((d & 1) == 0) ++s, d >>= 1;\n std::uint64_t cur = m.exp(a, d);\n if (cur == 1) return true;\n return m.same_pow(cur, s, n - 1);\n}\nconstexpr bool is_prime_constexpr(std::uint64_t x) {\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\n if (x < 121) return (x > 1);\n montgomery m(x);\n constexpr std::uint64_t bases[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\n for (auto a : bases) {\n if (!is_SPRP64(m, a)) return false;\n }\n return true;\n}\nconstexpr bool is_prime_constexpr(std::int64_t x) {\n if (x < 0) return false;\n return is_prime_constexpr(std::uint64_t(x));\n}\nconstexpr bool is_prime_constexpr(std::uint32_t x) {\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\n if (x < 121) return (x > 1);\n std::uint64_t h = x;\n h = ((h >> 16) ^ h) * 0x45d9f3b;\n h = ((h >> 16) ^ h) * 0x45d9f3b;\n h = ((h >> 16) ^ h) & 255;\n constexpr uint16_t bases[] = {\n 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620, 560,\n 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028,\n 2213, 6219, 620, 3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113,\n 7061, 803, 1269, 3875, 422, 751, 580, 4729, 10239, 746, 2951, 556, 2206,\n 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,\n 15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903,\n 737, 1887, 7447, 1888, 2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41,\n 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352, 6435, 165, 1169, 3315,\n 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,\n 27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524,\n 3577, 236, 2360, 6146, 2850, 55637, 1753, 4178, 8466, 222, 2579, 2743, 2031,\n 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159, 1725, 3597, 3366, 14336,\n 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,\n 434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183,\n 8126, 1870, 3296, 7455, 8947, 25017, 541, 19115, 368, 566, 5674, 411, 522,\n 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007, 35201, 4706, 1152, 1785,\n 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,\n 4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816,\n 5197, 13330, 7054, 2818, 3199, 811, 922, 350, 7514, 4452, 3449, 2663, 4708,\n 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194};\n return is_SPRP32(x, bases[h]);\n}\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr std::int64_t pow_mod_constexpr(std::int64_t x, std::int64_t n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n std::uint64_t r = 1;\n std::uint64_t y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n std::int64_t d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr std::int64_t bases[3] = {2, 7, 61};\n for (std::int64_t a : bases) {\n std::int64_t t = d;\n std::int64_t y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) { return false; }\n }\n return true;\n}\ntemplate <int n>\nconstexpr bool is_prime = is_prime_constexpr(n);\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<std::int64_t, std::int64_t> inv_gcd(std::int64_t a, std::int64_t b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n std::int64_t s = b, t = a;\n std::int64_t m0 = 0, m1 = 1;\n while (t) {\n std::int64_t u = s / t;\n s -= t * u;\n m0 -= m1 * u;\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (std::int64_t)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) { x /= i; }\n }\n }\n if (x > 1) { divs[cnt++] = x; }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m>\nconstexpr int primitive_root = primitive_root_constexpr(m);\n} // namespace internal\n#include <numeric>\nnamespace internal {\ntemplate <class T>\nusing is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;\ntemplate <class T>\nusing is_integral =\n typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type, std::false_type>::type;\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value, make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\ntemplate <class T>\nusing to_unsigned_t = typename to_unsigned<T>::type;\n} // namespace internal\nnamespace internal {\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\ntemplate <class T>\nusing is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T>\nusing is_modint_t = std::enable_if_t<is_modint<T>::value>;\n} // namespace internal\ntemplate <int m, std::enable_if_t<(1 <= m)> * = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n public:\n static constexpr int mod() { return m; }\n static constexpr mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n constexpr static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T> * = nullptr>\n constexpr static_modint(T v) : _v(0) {\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\n constexpr static_modint(T v) : _v(0) {\n _v = (unsigned int)(v % umod());\n }\n constexpr unsigned int val() const { return _v; }\n constexpr mint &operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n constexpr mint &operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n constexpr mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n constexpr mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n constexpr mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n constexpr mint &operator-=(const mint &rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n constexpr mint &operator*=(const mint &rhs) {\n std::uint64_t z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n constexpr mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n constexpr mint operator+() const { return *this; }\n constexpr mint operator-() const { return mint() - *this; }\n constexpr mint pow(std::int64_t n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n constexpr mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n friend constexpr mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\n friend constexpr mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\n friend constexpr mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\n friend constexpr mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\n friend constexpr bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\n friend constexpr bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\n std::int64_t t;\n is >> t;\n rhs = mint(t);\n return is;\n }\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\n return os << rhs._v;\n }\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\ntemplate <int id>\nstruct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n unsigned int val() const { return _v; }\n mint &operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint &operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint &operator-=(const mint &rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint &operator*=(const mint &rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n mint pow(std::int64_t n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\n friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\n friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\n friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\n friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\n friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\n std::int64_t t;\n is >> t;\n rhs = mint(t);\n return is;\n }\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\n return os << rhs._v;\n }\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id>\ninternal::barrett dynamic_modint<id>::bt(998244353);\nusing modint998 = static_modint<998244353>;\nusing modint107 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\nnamespace internal {\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\ntemplate <class>\nstruct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n} // namespace internal\ntemplate <class mint = modint998, internal::is_modint_t<mint> * = nullptr>\nstruct Combination {\n Combination() : _fact(), _finv() {}\n mint operator()(int n, int k) {\n if (n < k || n < 0 || k < 0) return 0;\n _init(n);\n return _fact[n] * _finv[k] * _finv[n - k];\n }\n mint fact(int x) {\n assert(x >= 0);\n _init(x);\n return _fact[x];\n }\n mint finv(int x) {\n assert(x >= 0);\n _init(x);\n return _finv[x];\n }\n mint naive(int n, int k) const {\n if (n < k || n < 0 || k < 0) return 0;\n if (n - k < k) k = n - k;\n mint res = 1;\n for (int i = 0; i < k; ++i) {\n res *= n - i;\n res /= i + 1;\n }\n return res;\n }\n mint permu(int n, int k) {\n if (n < k || n < 0 || k < 0) return 0;\n _init(n);\n return _fact[n] * _finv[n - k];\n }\n private:\n std::vector<mint> _fact, _finv;\n void _init(int n) {\n if ((int)_fact.size() > n) return;\n int m = _fact.size();\n _fact.resize(n + 1);\n for (int i = m; i <= n; ++i) {\n if (i == 0) _fact[i] = 1;\n else _fact[i] = _fact[i - 1] * i;\n }\n _finv.resize(n + 1);\n _finv[n] = _fact[n].inv();\n for (int i = n - 1; i >= m; --i) _finv[i] = _finv[i + 1] * (i + 1);\n }\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nCombination combi;\nusing Mint = modint998;\nint main(void) {\n int n, m, k, f;\n cin >> n >> m >> k >> f;\n vector<int> a(m), b(m), c(m);\n rep (i, m) cin >> a[i] >> b[i] >> c[i];\n int ans = 0;\n int cnt = n * 3 - 2;\n int rest = n * n - cnt;\n rep (i, m) {\n if (abs(a[i] - b[i]) <= 1) {\n ans = ans | c[i];\n --cnt;\n } else {\n --rest;\n }\n }\n if (ans & ~f) {\n co(0);\n return 0;\n }\n int p = 0;\n rep (i, k) p += f >> i & 1;\n if (ans == f) {\n co(Mint(2).pow(p).pow(cnt) * Mint(1 << k).pow(rest));\n } else {\n Mint s = 0;\n int q = 0;\n rep (i, k) q += ans >> i & 1;\n rep (i, q + 1) {\n if (i & 1) {\n s -= combi(q, i) * Mint(2).pow(p - i).pow(cnt);\n } else {\n s += combi(q, i) * Mint(2).pow(p - i).pow(cnt);\n }\n }\n co(s * Mint(1 << k).pow(rest));\n }\n return 0;\n}","accuracy":0.3026315789473684,"time_ms":10,"memory_kb":4128,"score_of_the_acc":-0.0609,"final_rank":12},{"submission_id":"aoj_3159_9737298","code_snippet":"#include <iostream>\n\nusing namespace std;\ntypedef long long ll;\nll mod = 998244353;\nll pw(ll a, ll x){\n ll ret = 1;\n while(x){\n if(x&1) (ret *= a) %= mod;\n (a *= a) %= mod; x /= 2;\n }\n return ret;\n}\n\nll a[100010],b[100010],c[100010];\nint main(){\n ll i,j,n,m,k,f; cin >> n >> m >> k >> f;\n for(i=0;i<m;i++) cin >> a[i] >> b[i] >> c[i];\n ll ans = 1;\n for(j=0;j<k;j++){\n ll res = n*n - 3*n + 2;\n int x = f&1;\n ll z = 1;\n for(i=0;i<m;i++){\n if(a[i] - b[i]>=-1 && a[i] - b[i]<=1){\n if((c[i]&1)==1) z *= 0;\n }else{\n res--;\n }\n c[i] /= 2;\n }\n (z *= pw(2,res)) %= mod;\n if(x==0) (ans *= z) %= mod;\n if(x==1) (ans *= (pw(2,n*n - m) + mod - z)%mod) %= mod;\n f /= 2;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":5700,"score_of_the_acc":-0.9525,"final_rank":7},{"submission_id":"aoj_3159_6304781","code_snippet":"#include <iostream>\n#include <unordered_map>\n#include <unordered_set>\n#include <set>\n#include <vector>\n#include <numeric>\n#include <algorithm>\n#include <queue>\n#include <string>\n#include <random>\n#include <array>\n#include <climits>\n#include <map>\n#include <cassert>\n#include <stack>\n#include <iomanip>\n#include <cfloat>\n#include <fstream>\n\nconstexpr int MOD = 998244353;\nlong long int pow_mod(long long int base, int exp) {\n\tlong long int result{ 1 };\n\tbase %= MOD;\n\twhile (exp > 0) {\n\t\tif (exp & 1) {\n\t\t\tresult = result * base % MOD;\n\t\t}\n\t\tbase = base * base % MOD;\n\t\texp >>= 1;\n\t}\n\treturn result;\n}\n\nint main() {\n\tint n, m, k, f; std::cin >> n >> m >> k >> f;\n\tstd::vector<std::tuple<int, int, int>> determined(m);\n\tfor (auto& [a, b, c] : determined) {\n\t\tstd::cin >> a >> b >> c; --a; --b;\n\t}\n\tstd::vector<std::vector<int>> state(n, std::vector<int>(n, -1));\n\tfor (const auto [a, b, c] : determined) {\n\t\tstate[a][b] = c;\n\t}\n\tconst int free_count = n * n - m;\n\tint free_on_diagonal{ 0 };\n\tfor (auto i = 0; i < n; ++i) {\n\t\tif (state[i][i] == -1) {\n\t\t\tfree_on_diagonal += 1;\n\t\t}\n\t\tif (i > 0) {\n\t\t\tif (state[i - 1][i] == -1) {\n\t\t\t\tfree_on_diagonal += 1;\n\t\t\t}\n\t\t\tif (state[i][i - 1] == -1) {\n\t\t\t\tfree_on_diagonal += 1;\n\t\t\t}\n\t\t}\n\t}\n\tlong long int result{ 1 };\n\tfor (auto d = 0; d < k; ++d) {\n\t\tbool has_one{ false };\n\t\tfor (auto i = 0; i < n; ++i) {\n\t\t\tif (state[i][i] >= 0) {\n\t\t\t\tif ((state[i][i] >> d) & 1) {\n\t\t\t\t\thas_one = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (i > 0) {\n\t\t\t\tif (state[i - 1][i] >= 0) {\n\t\t\t\t\tif ((state[i - 1][i] >> d) & 1) {\n\t\t\t\t\t\thas_one = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (state[i][i - 1] >= 0) {\n\t\t\t\t\tif ((state[i][i - 1] >> d) & 1) {\n\t\t\t\t\t\thas_one = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (has_one) {\n\t\t\tif ((f >> d) & 1) {\n\t\t\t\tresult = result * pow_mod(2, free_count) % MOD;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tresult = 0;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tif ((f >> d) & 1) {\n\t\t\t\tresult = result * (pow_mod(2, free_on_diagonal) - 1) % MOD * pow_mod(2, free_count - free_on_diagonal) % MOD;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tresult = result * pow_mod(2, free_count - free_on_diagonal) % MOD;\n\t\t\t}\n\t\t}\n\t}\n\tstd::cout << result << '\\n';\n}","accuracy":1,"time_ms":50,"memory_kb":20240,"score_of_the_acc":-1.8,"final_rank":10},{"submission_id":"aoj_3159_4905552","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\ntemplate <int mod>\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator-=(const ModInt &p) {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator*=(const ModInt &p) {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n bool operator==(const ModInt &p) const { return x == p.x; }\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\n\nconst int mod = 998244353;\nusing mint = ModInt<mod>;\n\nint main() {\n int n, m, k, f;\n cin >> n >> m >> k >> f;\n\n int ct = 0;\n rep(i, n) rep(j, n) {\n if (abs(i - j) <= 1) ++ct;\n }\n int nct = n * n - ct;\n\n bool ok = true;\n int dig_or = 0;\n rep(i, m) {\n int a, b, c;\n cin >> a >> b >> c;\n if (abs(a - b) <= 1) {\n --ct;\n dig_or |= c;\n if ((c | f) != f) ok = false;\n } else\n --nct;\n }\n if (ct == 0 && dig_or != f) ok = false;\n if (!ok) {\n cout << 0 << \"\\n\";\n return 0;\n }\n\n int p = __builtin_popcount(dig_or), q = __builtin_popcount(f);\n\n mint x = mint(1 << p).pow(ct);\n rep(i, q - p) x *= (mint(2).pow(ct) - 1);\n\n cout << x * mint(1 << k).pow(nct) << \"\\n\";\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3128,"score_of_the_acc":-1.0026,"final_rank":9},{"submission_id":"aoj_3159_4905517","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\ntemplate <int mod>\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator-=(const ModInt &p) {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator*=(const ModInt &p) {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n bool operator==(const ModInt &p) const { return x == p.x; }\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\n\nconst int mod = 998244353;\nusing mint = ModInt<mod>;\n\nint main() {\n int n, m, k, f;\n cin >> n >> m >> k >> f;\n\n int ct = 0;\n rep(i, n) rep(j, n) {\n if (abs(i - j) <= 1) ++ct;\n }\n int nct = n * n - ct;\n\n bool ok = true;\n int dig_or = 0;\n rep(i, m) {\n int a, b, c;\n cin >> a >> b >> c;\n --a;\n --b;\n if (abs(a - b) <= 1) {\n --ct;\n dig_or |= c;\n if ((c | f) != f) ok = false;\n } else\n --nct;\n }\n if (ct == 0 && dig_or != f) ok = false;\n if (!ok) {\n cout << 0 << \"\\n\";\n return 0;\n }\n\n mint x = mint(1 << (__builtin_popcount(f))).pow(ct);\n mint y = mint(1 << k).pow(nct);\n cout << x * y << \"\\n\";\n return 0;\n}","accuracy":0.3026315789473684,"time_ms":40,"memory_kb":3124,"score_of_the_acc":-0.6023,"final_rank":13},{"submission_id":"aoj_3159_4905501","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\ntemplate <int mod>\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator-=(const ModInt &p) {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator*=(const ModInt &p) {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n bool operator==(const ModInt &p) const { return x == p.x; }\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\n\nconst int mod = 998244353;\nusing mint = ModInt<mod>;\n\nint main() {\n int n, m, k, f;\n cin >> n >> m >> k >> f;\n\n int ct = 0;\n rep(i, n) rep(j, n) {\n if (abs(i - j) == 1) ++ct;\n }\n int nct = n * n - ct;\n\n bool ok = true;\n int dig_or = 0;\n rep(i, m) {\n int a, b, c;\n cin >> a >> b >> c;\n --a;\n --b;\n if (abs(a - b) == 1) {\n --ct;\n dig_or |= c;\n if ((c | f) != f) ok = false;\n } else\n --nct;\n }\n if (ct == 0 && dig_or != f) ok = false;\n if (!ok) {\n cout << 0 << \"\\n\";\n return 0;\n }\n\n mint x = mint(1 << (__builtin_popcount(f))).pow(ct);\n mint y = mint(1 << k).pow(nct);\n cout << x * y << \"\\n\";\n return 0;\n}","accuracy":0.3026315789473684,"time_ms":40,"memory_kb":3124,"score_of_the_acc":-0.6023,"final_rank":13},{"submission_id":"aoj_3159_4905498","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n// clang-format on\n\ntemplate <int mod>\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator-=(const ModInt &p) {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator*=(const ModInt &p) {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n bool operator==(const ModInt &p) const { return x == p.x; }\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\n\nconst int mod = 998244353;\nusing mint = ModInt<mod>;\n\nint main() {\n int n, m, k, f;\n cin >> n >> m >> k >> f;\n\n int ct = 0;\n rep(i, n) rep(j, n) {\n if (abs(i - j) == 1) ++ct;\n }\n int nct = n * n - ct;\n\n bool ok = true;\n rep(i, m) {\n int a, b, c;\n cin >> a >> b >> c;\n --a;\n --b;\n if (abs(a - b) == 1) {\n --ct;\n if ((c | f) != f) ok = false;\n } else\n --nct;\n }\n if (!ok) {\n dbg(\"NOT OK\");\n cout << 0 << \"\\n\";\n return 0;\n }\n\n mint x = mint(1 << (__builtin_popcount(f))).pow(ct);\n mint y = mint(1 << k).pow(nct);\n cout << x * y << \"\\n\";\n return 0;\n}","accuracy":0.039473684210526314,"time_ms":10,"memory_kb":3100,"score_of_the_acc":-0.0009,"final_rank":16},{"submission_id":"aoj_3159_4861052","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nint n, m, k, f, frees = 0;\nvector<int> cnt;\n\nModInt<> solve();\n\nint main() {\n cin >> n >> m >> k >> f;\n cnt.assign(k, 0);\n for (int i = 0; i < m; ++i) {\n int y, x, z;\n cin >> y >> x >> z;\n if (abs(y - x) <= 1)\n for (int j = 0; j < k; ++j) cnt[j] += z >> j & 1;\n else\n ++frees;\n }\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n ModInt<> res = ModInt<>(1 << k).pow(n * n - 3 * n + 2 - frees);\n m -= frees;\n for (int i = 0; i < k; ++i)\n if (f >> i & 1)\n res *= ModInt<>(2).pow(3 * n - 2 - m) - (cnt[i] == 0);\n else\n res *= cnt[i] == 0;\n return res;\n}","accuracy":1,"time_ms":40,"memory_kb":3436,"score_of_the_acc":-0.6205,"final_rank":4},{"submission_id":"aoj_3159_4835267","code_snippet":"#include <bits/stdc++.h>\n//#include <chrono>\n//#pragma GCC optimize(\"Ofast\")\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\n#define Rrep(i,n) Rreps(i,n,0)\n#define ALL(a) a.begin(), a.end()\n#define fi first\n#define se second\ntypedef long long ll;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nll N,M,H,W,Q,K,A,B;\nstring S;\ntypedef pair<ll, ll> P;\nconst ll INF = (1LL<<60);\n\ntemplate <unsigned long long mod > class modint{\npublic:\n ll x;\n constexpr modint(){x = 0;}\n constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}\n constexpr modint operator-(){\n return x == 0 ? 0 : mod - x;\n }\n constexpr modint& operator+=(const modint& a){\n if((x += a.x) >= mod) x -= mod;\n return *this;\n }\n constexpr modint operator+(const modint& a) const{\n return modint(*this) += a;\n }\n constexpr modint& operator-=(const modint& a){\n if((x -= a.x) < 0) x += mod;\n return *this;\n }\n constexpr modint operator-(const modint& a) const{\n return modint(*this) -= a;\n }\n constexpr modint& operator*=(const modint& a){\n (x *= a.x)%=mod;\n return *this;\n }\n constexpr modint operator*(const modint& a) const{\n return modint(*this) *= a;\n }\n constexpr modint pow(unsigned long long pw) const{\n modint res(1), comp(*this);\n while(pw){\n if(pw&1) res *= comp;\n comp *= comp;\n pw >>= 1;\n }\n return res;\n }\n //以下、modが素数のときのみ\n constexpr modint inv() const{\n return modint(*this).pow(mod - 2);\n }\n constexpr modint& operator/=(const modint &a){\n (x *= a.inv().x)%=mod;\n return *this;\n }\n constexpr modint operator/(const modint &a) const{\n return modint(*this) /= a;\n }\n};\n#define mod1 998244353\nusing mint = modint<mod1>;\n\nostream& operator<<(ostream& os, const mint& a){\n os << a.x;\n return os;\n}\nusing vm = vector<mint>;\n\nint main() {\n ll F;\n cin>>N>>M>>K>>F;\n ll or_sum(0), num_free((N - 1) * (N - 2)), num_care(N * 3 - 2);\n rep(i, M){\n ll C;\n cin>>A>>B>>C;\n if(abs(A - B) <= 1){\n or_sum |= C;\n --num_care;\n }else{\n --num_free;\n }\n }\n if((or_sum | F) != F){\n cout<<0<<endl;\n }else{\n mint res(1);\n rep(i, K){\n if((F>>i)&1) {\n if((or_sum>>i)&1) res *= mint(2).pow(num_care + num_free);\n else res *= (mint(2).pow(num_care) - 1) * mint(2).pow(num_free);\n }else{\n res *= mint(2).pow(num_free);\n }\n }\n cout<<res<<endl;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":3140,"score_of_the_acc":-0.8033,"final_rank":6},{"submission_id":"aoj_3159_4835264","code_snippet":"#include <bits/stdc++.h>\n//#include <chrono>\n//#pragma GCC optimize(\"Ofast\")\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\n#define Rrep(i,n) Rreps(i,n,0)\n#define ALL(a) a.begin(), a.end()\n#define fi first\n#define se second\ntypedef long long ll;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nll N,M,H,W,Q,K,A,B;\nstring S;\ntypedef pair<ll, ll> P;\nconst ll INF = (1LL<<60);\n\ntemplate <unsigned long long mod > class modint{\npublic:\n ll x;\n constexpr modint(){x = 0;}\n constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}\n constexpr modint operator-(){\n return x == 0 ? 0 : mod - x;\n }\n constexpr modint& operator+=(const modint& a){\n if((x += a.x) >= mod) x -= mod;\n return *this;\n }\n constexpr modint operator+(const modint& a) const{\n return modint(*this) += a;\n }\n constexpr modint& operator-=(const modint& a){\n if((x -= a.x) < 0) x += mod;\n return *this;\n }\n constexpr modint operator-(const modint& a) const{\n return modint(*this) -= a;\n }\n constexpr modint& operator*=(const modint& a){\n (x *= a.x)%=mod;\n return *this;\n }\n constexpr modint operator*(const modint& a) const{\n return modint(*this) *= a;\n }\n constexpr modint pow(unsigned long long pw) const{\n modint res(1), comp(*this);\n while(pw){\n if(pw&1) res *= comp;\n comp *= comp;\n pw >>= 1;\n }\n return res;\n }\n //以下、modが素数のときのみ\n constexpr modint inv() const{\n return modint(*this).pow(mod - 2);\n }\n constexpr modint& operator/=(const modint &a){\n (x *= a.inv().x)%=mod;\n return *this;\n }\n constexpr modint operator/(const modint &a) const{\n return modint(*this) /= a;\n }\n};\n#define mod1 998244353\nusing mint = modint<mod1>;\n\nostream& operator<<(ostream& os, const mint& a){\n os << a.x;\n return os;\n}\nusing vm = vector<mint>;\n\nint main() {\n ll F;\n cin>>N>>M>>K>>F;\n ll or_sum(0), num_free((N - 1) * (N - 2)), num_care(N * 3 - 2);\n rep(i, M){\n ll C;\n cin>>A>>B>>C;\n if(abs(A - B) <= 1){\n or_sum |= C;\n --num_care;\n }else{\n --num_free;\n }\n }\n if((or_sum | F) != F){\n cout<<0<<endl;\n }else{\n mint res(1);\n rep(i, K){\n if((F>>i)&1) {\n if((or_sum>>i)&1) res *= mint(2).pow(num_care + num_free);\n else res *= (mint(2).pow(num_care) - 1) * mint(2).pow(num_free);\n }\n }\n cout<<res<<endl;\n }\n}","accuracy":0.3026315789473684,"time_ms":40,"memory_kb":3140,"score_of_the_acc":-0.6033,"final_rank":15},{"submission_id":"aoj_3159_4834272","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\ntypedef long long int ll;\nconstexpr ll mod=998244353;\n\nll mod_pow(ll a,ll b){\n\ta%=mod;\n\tif(b==0)return 1;\n\tif(b==1)return a;\n\tll res=mod_pow(a,b/2)%mod;\n\tres*=res; res%=mod;\n\tif(b%2)res*=a;\n\treturn res%mod;\n}\n\nint main(){\n\tint n,m,k,f; cin >> n >> m >> k >> f;\n\tvector<bool> used(k,false);\n\tint cnt=3*n-2;\n\tfor(int i=0;i<m;i++){\n\t\tint a,b,c; cin >> a >> b >> c;\n\t\tif(abs(a-b)>1)continue;\n\t\tcnt--;\n\t\tfor(int j=0;j<k;j++){\n\t\t\tif((1<<j)&c)used[j]=1;\n\t\t}\n\t}\n\tll res=1;\n\tfor(int i=0;i<k;i++){\n\t\tif((1<<i)&f){\n\t\t\tif(used[i]) (res*=mod_pow(2,n*n-m))%=mod;\n\t\t\telse (res*=mod_pow(2,n*n-m)-mod_pow(2,n*n-m-cnt)+mod)%=mod;\n\t\t}\n\t\telse{\n\t\t\tif(used[i]) res=0;\n\t\t\telse (res*=mod_pow(2,n*n-m-cnt))%=mod;\n\t\t}\n\t}\n\tcout << res << \"\\n\";\n}","accuracy":1,"time_ms":60,"memory_kb":3084,"score_of_the_acc":-1,"final_rank":8},{"submission_id":"aoj_3159_4834126","code_snippet":"#pragma region Macros\n#pragma GCC optimize(\"O3\")\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define pb push_back\n#define eb emplace_back\n#define vi vector<int>\n#define vll vector<ll>\n#define vpi vector<pii>\n#define vpll vector<pll>\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n#define fi first\n#define se second\n#define all(c) begin(c), end(c)\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\nusing namespace std;\nstring YES[2] = {\"NO\", \"YES\"};\nstring Yes[2] = {\"No\", \"Yes\"};\nstring yes[2] = {\"no\", \"yes\"};\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n#define si(c) (int)(c).size()\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\n scan(head);\n IN(tail...);\n}\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\nvi iota(int n) {\n vi a(n);\n iota(all(a), 0);\n return a;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n sort(all(y));\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\nint popcount(ll x) { return __builtin_popcountll(x); }\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n }\n} setup_io;\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return move(res);\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return move(res);\n}\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n for(auto &e : v) cout << e << \" \";\n cout << endl;\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n cout << \"(\" << p.fi << \", \" << p.se << \")\";\n return os;\n}\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\ntemplate <class A> string to_string(A v) {\n if(v.empty()) return \"{}\";\n string ret = \"{\";\n for(auto &x : v) ret += to_string(x) + \",\";\n ret.back() = '}';\n return ret;\n}\n\nvoid dump() { cerr << endl; }\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#define endl '\\n'\n#ifdef _LOCAL\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\n#define debug(x)\n#endif\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\n#pragma endregion\nnamespace modular {\nconstexpr ll MOD = 998244353;\nconst int MAXN = 1100000;\ntemplate <ll Modulus> class modint {\n using u64 = ll;\n\n public:\n u64 a;\n\n constexpr modint(const u64 x = 0) noexcept : a(((x % Modulus) + Modulus) % Modulus) {}\n constexpr u64 &value() noexcept { return a; }\n constexpr const u64 &value() const noexcept { return a; }\n constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; }\n constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; }\n constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; }\n template <typename T> constexpr modint operator^(T rhs) const noexcept { return modint(*this) ^= rhs; }\n constexpr modint operator-() const noexcept { return modint() - *this; }\n constexpr modint &operator+=(const modint rhs) noexcept {\n a += rhs.a;\n if(a >= Modulus) { a -= Modulus; }\n return *this;\n }\n constexpr modint &operator-=(const modint rhs) noexcept {\n if(a < rhs.a) { a += Modulus; }\n a -= rhs.a;\n return *this;\n }\n constexpr modint &operator*=(const modint rhs) noexcept {\n a = a * rhs.a % Modulus;\n return *this;\n }\n constexpr bool operator==(const modint rhs) const noexcept { return a == rhs.a; }\n template <typename T> constexpr modint &operator^=(T n) noexcept {\n modint<Modulus> res = 1;\n modint<Modulus> x = a;\n while(n) {\n if(n & 1) res *= x;\n x *= x;\n n >>= 1;\n }\n a = res.a;\n return *this;\n }\n};\n#define mint modint<MOD>\n#define vmint vector<mint>\nvmint Inv{0, 1}, Prd{1, 1}, Invprd{1, 1};\nmint inv(int n) {\n if(n > MAXN) return mint(n) ^ (MOD - 2);\n if(Inv.size() > n)\n return Inv[n];\n else {\n for(int i = Inv.size(); i <= n; ++i) Inv.emplace_back(Inv[MOD % i] * (-MOD / i));\n return Inv[n];\n }\n}\nmint inv(mint x) { return inv(x.a); }\nmint prd(int n) {\n if(Prd.size() > n)\n return Prd[n];\n else\n for(int i = Prd.size(); i <= n; ++i) Prd.emplace_back(Prd[i - 1] * i);\n return Prd[n];\n}\nmint invprd(int n) {\n if(Invprd.size() > n)\n return Invprd[n];\n else\n for(int i = Invprd.size(); i <= n; ++i) Invprd.emplace_back(Invprd[i - 1] * inv(i));\n return Invprd[n];\n}\nmint modpow(ll a, ll n) {\n mint x = a;\n return x ^= n;\n}\nmint operator/(mint l, mint r) { return l * inv(r); }\nmint &operator/=(mint &l, mint r) { return l = l / r; }\nmint C(int a, int b) {\n if(a < 0 || b < 0) return 0;\n if(a < b) return 0;\n return prd(a) * invprd(b) * invprd(a - b);\n}\nmint P(int a, int b) {\n if(a < 0 || b < 0) return 0;\n if(a < b) return 0;\n return prd(a) * invprd(a - b);\n}\nostream &operator<<(ostream &os, mint a) {\n os << a.a;\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> a) {\n for(auto &e : a) os << e << \" \";\n return os;\n}\nmint operator*(ll x, mint y) { return y * x; }\nistream &operator>>(istream &is, mint &a) {\n ll x;\n is >> x;\n a = x;\n return is;\n}\nmint proot = 3;\n\nvoid FMT(vmint &f, const bool is_inv = false) {\n const int n = f.size();\n const mint root = is_inv ? inv(proot) : proot;\n vmint g(n);\n for(int b = n >> 1; b > 0; b >>= 1) {\n mint a = root ^ ((MOD - 1) / (n / b)), p = 1;\n for(int i = 0; i < n; i += b << 1) {\n rep(j, b) {\n f[i + j + b] *= p;\n g[(i >> 1) + j] = f[i + j] + f[i + b + j];\n g[(n >> 1) + (i >> 1) + j] = f[i + j] - f[i + b + j];\n }\n p *= a;\n }\n swap(f, g);\n }\n if(is_inv) rep(i, n) f[i] *= inv(n);\n}\n\nvmint mul(vmint x, const vmint &y) {\n int n = x.size() + y.size() - 1;\n int s = 1;\n while(s < n) s <<= 1;\n x.resize(s);\n FMT(x);\n vmint z(s);\n rep(i, y.size()) z[i] = y[i];\n FMT(z);\n rep(i, s) x[i] *= z[i];\n FMT(x, true);\n x.resize(n);\n return x;\n}\n\nusing Poly = vmint;\nPoly operator-(Poly f) {\n for(auto &&e : f) e = -e;\n return f;\n}\nPoly &operator+=(Poly &l, const Poly &r) {\n l.resize(max(l.size(), r.size()));\n rep(i, r.size()) l[i] += r[i];\n return l;\n}\nPoly operator+(Poly l, const Poly &r) { return l += r; }\nPoly &operator-=(Poly &l, const Poly &r) {\n l.resize(max(l.size(), r.size()));\n rep(i, r.size()) l[i] -= r[i];\n return l;\n}\nPoly operator-(Poly l, const Poly &r) { return l -= r; }\nPoly &operator<<=(Poly &f, size_t n) { return f.insert(f.begin(), n, 0), f; }\nPoly operator<<(Poly f, size_t n) { return f <<= n; }\nPoly &operator>>=(Poly &f, size_t n) { return f.erase(f.begin(), f.begin() + min(f.size(), n)), f; }\nPoly operator>>(Poly f, size_t n) { return f >>= n; }\nPoly operator*(const Poly &l, const Poly &r) { return mul(l, r); }\nPoly &operator*=(Poly &l, const Poly &r) { return l = l * r; }\nPoly inv(const Poly &f) {\n Poly g{1 / f[0]};\n while(g.size() < f.size()) {\n Poly x(f.begin(), f.begin() + min(f.size(), g.size() << 1)), y = g;\n x.resize(g.size() << 1), FMT(x);\n y.resize(g.size() << 1), FMT(y);\n rep(i, x.size()) x[i] *= y[i];\n FMT(x, true);\n x >>= g.size();\n x.resize(g.size() << 1), FMT(x);\n rep(i, x.size()) x[i] *= -y[i];\n FMT(x, true);\n g.insert(g.end(), x.begin(), x.begin() + g.size());\n }\n return Poly{begin(g), begin(g) + f.size()};\n}\nPoly integ(const Poly &f) {\n Poly res(f.size() + 1);\n for(int i = 1; i < (int)res.size(); ++i) res[i] = f[i - 1] / i;\n return res;\n}\nPoly deriv(const Poly &f) {\n if(f.size() == 0) return Poly();\n Poly res(f.size() - 1);\n rep(i, res.size()) res[i] = f[i + 1] * (i + 1);\n return res;\n}\nPoly log(const Poly &f) {\n Poly g = integ(inv(f) * deriv(f));\n return Poly{g.begin(), g.begin() + f.size()};\n}\nPoly exp(const Poly &f) {\n Poly g{1};\n while(g.size() < f.size()) {\n Poly x(f.begin(), f.begin() + min(f.size(), g.size() * 2));\n x[0] += 1;\n g.resize(2 * g.size());\n x -= log(g);\n x *= {g.begin(), g.begin() + g.size() / 2};\n rep2(i, g.size() / 2, min<int>(x.size(), g.size()) - 1) g[i] = x[i];\n }\n return {g.begin(), g.begin() + f.size()};\n}\n\n} // namespace modular\nusing namespace modular;\nint main() {\n INT(n, m, k, f);\n vi a(m), b(m), c(m);\n rep(i, m) cin >> a[i] >> b[i] >> c[i];\n mint ans = 1;\n int t = n + (n - 1) * 2;\n int s = 0;\n rep(i, m) if(abs(a[i] - b[i]) <= 1) s++;\n rep(i, k) {\n int cnt = 0;\n rep(j, m) {\n if(c[j] & 1 << i and abs(a[j] - b[j]) <= 1) cnt++;\n }\n if(f & 1 << i) {\n if(cnt)\n ans *= modpow(2, n * n - m);\n else\n ans *= modpow(2, n * n - t - (m - s)) * (modpow(2, t - s) - 1);\n } else {\n if(cnt)\n ans = 0;\n else {\n ans *= modpow(2, n * n - t - (m - s));\n }\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":4344,"score_of_the_acc":-0.0734,"final_rank":1},{"submission_id":"aoj_3159_4834120","code_snippet":"#include <bits/stdc++.h>\n#define be(v) (v).begin(),(v).end()\n#define pb(q) push_back(q)\ntypedef long long ll;\nusing namespace std;\nconst ll mod=998244353, INF=(1LL<<60);\n#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;\n\nlong long modpow(long long a, long long n) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n}\n\n\n///////modint\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\n mint operator+(const mint a) const { return mint(*this) += a;}\n mint operator-(const mint a) const { return mint(*this) -= a;}\n mint operator*(const mint a) const { return mint(*this) *= a;}\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\n // for prime mod\n mint inv() const { return pow(mod-2);}\n mint& operator/=(const mint a) { return *this *= a.inv();}\n mint operator/(const mint a) const { return mint(*this) /= a;}\n};\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\n\n\n\nint main() {\n cin.tie(0);\n cout.tie(0);\n ios::sync_with_stdio(false);\n ll n, m, k, f;\n cin >> n >> m >> k >> f;\n ll a, b, c;\n ll cnt = (n - 1) * 2 + n, maki = n * n - cnt;\n bool ok[k];\n memset(ok, 0, sizeof(ok));\n for(int i=0;i<m;i++){\n cin >> a >> b >> c;\n bool niko = (abs(a - b) <= 1);\n if(niko) cnt--;\n else maki--;\n for(int j=0;j<k;j++){\n if((c >> j & 1) && niko){\n ok[j] = true;\n }\n }\n }\n mint ans = mint(1);\n\n for(int i=0;i<k;i++){\n if(f >> i & 1){\n if(ok[i]){\n ans *= mint(modpow(2LL, cnt + maki));\n }else{\n ans *= mint(modpow(2LL, maki));\n ans *= mint(modpow(2LL, cnt) - 1);\n }\n }else{\n if(ok[i]){\n ans = mint(0);\n }else{\n ans *= mint(modpow(2LL, maki));\n }\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3208,"score_of_the_acc":-0.2072,"final_rank":3},{"submission_id":"aoj_3159_4834102","code_snippet":"#include <bits/stdc++.h>\n#define be(v) (v).begin(),(v).end()\n#define pb(q) push_back(q)\ntypedef long long ll;\nusing namespace std;\nconst ll mod=998244353, INF=(1LL<<60);\n#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;\n\nlong long modpow(long long a, long long n) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n}\n\n\n///////modint\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\n mint operator+(const mint a) const { return mint(*this) += a;}\n mint operator-(const mint a) const { return mint(*this) -= a;}\n mint operator*(const mint a) const { return mint(*this) *= a;}\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\n // for prime mod\n mint inv() const { return pow(mod-2);}\n mint& operator/=(const mint a) { return *this *= a.inv();}\n mint operator/(const mint a) const { return mint(*this) /= a;}\n};\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\n\n\n\nint main() {\n cin.tie(0);\n cout.tie(0);\n ios::sync_with_stdio(false);\n ll n, m, k, f;\n cin >> n >> m >> k >> f;\n ll a, b, c[m];\n ll cnt = (n - 1) * 2, maki = n * n - cnt;\n bool ok[k];\n memset(ok, 0, sizeof(ok));\n for(int i=0;i<m;i++){\n cin >> a >> b >> c[i];\n bool niko = (abs(a - b) <= 1);\n if(niko) cnt--;\n else maki--;\n for(int j=0;j<k;j++){\n if((c[i] >> j & 1) && niko){\n ok[j] = true;\n }\n }\n }\n mint ans = mint(1);\n\n for(int i=0;i<k;i++){\n if(f >> i & 1){\n if(ok[i]){\n ans *= mint(modpow(2LL, cnt + maki));\n }else{\n ans *= mint(modpow(2LL, maki));\n ans *= mint(modpow(2LL, cnt) - 1);\n }\n }else{\n if(ok[i]){\n ans = mint(0);\n }else{\n ans *= mint(modpow(2LL, maki));\n }\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":0.3026315789473684,"time_ms":10,"memory_kb":3844,"score_of_the_acc":-0.0443,"final_rank":11},{"submission_id":"aoj_3159_4833747","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef pair<int,int> P;\nint INF = 1e18;\nint mod = 998244353;\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nint mod_pow(int x,int y) {\n int res = 1;\n while(y > 0) {\n if(y%2) {\n res = res*x%mod;\n }\n x = x*x%mod;\n y/=2;\n }\n return res;\n}\nint fac[2500], finv[2500], inv[2500];\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < 2500; i++){\n fac[i] = fac[i - 1] * i % mod;\n inv[i] = mod - inv[mod%i] * (mod / i) % mod;\n finv[i] = finv[i - 1] * inv[i] % mod;\n }\n}\nint COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\nsigned main() {\n int N,M,K,F;\n cin >> N >> M >> K >> F;\n int X = 0;\n vector<bool>ok(35,true);\n for(int i = 0; i < 35; i++) {\n ok[i] = (1^(F >> i));\n if(1 & (F >> i)) {\n X++;\n }\n }\n COMinit();\n for(int i = 0; i < M; i++) {\n int a,b,c;\n cin >> a >> b >> c;\n for(int j = 0; j < 35; j++) {\n if(1 & (c >> j)) {\n if((F >> j) == 0) {\n cout << 0 << endl;\n return 0;\n }\n ok[j] = true;\n }\n }\n }\n int cnt = 0;\n for(int i = 0; i < 35; i++) {\n if(!ok[i]) {\n cnt++;\n }\n }\n int ng = 0;\n for(int i = 0; i < cnt; i++) {\n ng += mod_pow(2,X-cnt)*COM(cnt,i)%mod;\n ng %= mod;\n }\n cout << (mod_pow(mod_pow(2,X),N*N-M)+mod-ng)%mod << endl;\n}","accuracy":0.039473684210526314,"time_ms":10,"memory_kb":3152,"score_of_the_acc":-0.004,"final_rank":18},{"submission_id":"aoj_3159_4833737","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef pair<int,int> P;\nint INF = 1e18;\nint mod = 998244353;\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nint mod_pow(int x,int y) {\n int res = 1;\n while(y > 0) {\n if(y%2) {\n res = res*x%mod;\n }\n x = x*x%mod;\n y/=2;\n }\n return res;\n}\nint fac[2500], finv[2500], inv[2500];\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < 2500; i++){\n fac[i] = fac[i - 1] * i % mod;\n inv[i] = mod - inv[mod%i] * (mod / i) % mod;\n finv[i] = finv[i - 1] * inv[i] % mod;\n }\n}\nint COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\nsigned main() {\n int N,M,K,F;\n cin >> N >> M >> K >> F;\n int X = 0;\n vector<bool>ok(35,true);\n for(int i = 0; i < 35; i++) {\n ok[i] = (1^(F >> i));\n if(1 & (F >> i)) {\n X++;\n }\n }\n COMinit();\n for(int i = 0; i < M; i++) {\n int a,b,c;\n cin >> a >> b >> c;\n for(int j = 0; j < 35; j++) {\n if(1 & (c >> j)) {\n if((F >> j) == 0) {\n cout << 0 << endl;\n return 0;\n }\n ok[j] = true;\n }\n }\n }\n int cnt = 0;\n for(int i = 0; i < 35; i++) {\n if(!ok[i]) {\n cnt++;\n }\n }\n int ng = 0;\n for(int i = 0; i < cnt; i++) {\n if(i%2 == 0) {\n ng += mod_pow(2,X-cnt)*COM(cnt,i)%mod;\n }\n else {\n ng = (ng+mod-mod_pow(2,X-cnt)*COM(cnt,i))%mod;\n }\n }\n cout << (mod_pow(mod_pow(2,X),N*N-M)+mod-ng)%mod << endl;\n}","accuracy":0.039473684210526314,"time_ms":10,"memory_kb":3176,"score_of_the_acc":-0.0054,"final_rank":20},{"submission_id":"aoj_3159_4833736","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n\n#include <utility>\n\nnamespace atcoder {\n\n namespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\n constexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) { x += m; }\n return x;\n }\n\n// Fast moduler by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\n struct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m`\n barrett(unsigned int m) : _m(m), im((unsigned long long) (-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long) (((unsigned __int128) (z) * im) >> 64);\n#endif\n unsigned int v = (unsigned int) (z - x * _m);\n if (_m <= v) { v += _m; }\n return v;\n }\n };\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\n constexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) { return 0; }\n unsigned int _m = (unsigned int) (m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) { r = (r * y) % _m; }\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n }\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\n constexpr bool is_prime_constexpr(int n) {\n if (n <= 1) { return false; }\n if (n == 2 || n == 7 || n == 61) { return true; }\n if (n % 2 == 0) { return false; }\n long long d = n - 1;\n while (d % 2 == 0) { d /= 2; }\n for (long long a : {2, 7, 61}) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n }\n template<int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\n constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) { return {b, 0}; }\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) { m0 += b / s; }\n return {s, m0};\n }\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\n constexpr int primitive_root_constexpr(int m) {\n if (m == 2) { return 1; }\n if (m == 167772161) { return 3; }\n if (m == 469762049) { return 3; }\n if (m == 754974721) { return 11; }\n if (m == 998244353) { return 3; }\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) { x /= 2; }\n for (int i = 3; (long long) (i) * i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) { return g; }\n }\n }\n template<int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n } // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\n namespace internal {\n\n#ifndef _MSC_VER\n template<class T>\n using is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\n template<class T>\n using is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\n template<class T>\n using make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\n template<class T>\n using is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\n template<class T>\n using is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\n template<class T>\n using is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\n template<class T>\n using to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\n template <class T> using is_integral = typename std::is_integral<T>;\n\n template <class T>\n using is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\n template <class T>\n using is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\n template <class T>\n using to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\n template<class T>\n using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\n template<class T>\n using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\n template<class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n } // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\n namespace internal {\n\n struct modint_base {};\n struct static_modint_base : modint_base {};\n\n template<class T> using is_modint = std::is_base_of<modint_base, T>;\n template<class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n } // namespace internal\n\n template<int m, std::enable_if_t<(1 <= m)> * = nullptr>\n struct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template<class T, internal::is_signed_int_t<T> * = nullptr>\n static_modint(T v) {\n long long x = (long long) (v % (long long) (umod()));\n if (x < 0) { x += umod(); }\n _v = (unsigned int) (x);\n }\n template<class T, internal::is_unsigned_int_t<T> * = nullptr>\n static_modint(T v) {\n _v = (unsigned int) (v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int) (v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint &operator++() {\n _v++;\n if (_v == umod()) { _v = 0; }\n return *this;\n }\n mint &operator--() {\n if (_v == 0) { _v = umod(); }\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) { _v -= umod(); }\n return *this;\n }\n mint &operator-=(const mint &rhs) {\n _v -= rhs._v;\n if (_v >= umod()) { _v += umod(); }\n return *this;\n }\n mint &operator*=(const mint &rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int) (z % umod());\n return *this;\n }\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) { r *= x; }\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint &lhs, const mint &rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint &lhs, const mint &rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint &lhs, const mint &rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint &lhs, const mint &rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint &lhs, const mint &rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint &lhs, const mint &rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n };\n\n template<int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int) (bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template<class T, internal::is_signed_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n long long x = (long long) (v % (long long) (mod()));\n if (x < 0) { x += mod(); }\n _v = (unsigned int) (x);\n }\n template<class T, internal::is_unsigned_int_t<T> * = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int) (v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int) (v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint &operator++() {\n _v++;\n if (_v == umod()) { _v = 0; }\n return *this;\n }\n mint &operator--() {\n if (_v == 0) { _v = umod(); }\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint &operator+=(const mint &rhs) {\n _v += rhs._v;\n if (_v >= umod()) { _v -= umod(); }\n return *this;\n }\n mint &operator-=(const mint &rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) { _v -= umod(); }\n return *this;\n }\n mint &operator*=(const mint &rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) { r *= x; }\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint &lhs, const mint &rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint &lhs, const mint &rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint &lhs, const mint &rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint &lhs, const mint &rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint &lhs, const mint &rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint &lhs, const mint &rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n };\n template<int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n\n using modint998244353 = static_modint<998244353>;\n using modint1000000007 = static_modint<1000000007>;\n using modint = dynamic_modint<-1>;\n\n namespace internal {\n\n template<class T>\n using is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\n template<class T>\n using is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\n template<class> struct is_dynamic_modint : public std::false_type {};\n template<int id>\n struct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\n template<class T>\n using is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n } // namespace internal\n\n} // namespace atcoder\n\nusing namespace atcoder;\n\n#define int long long\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\n#define reps(i, n) for (int i = 1; i <= (int) (n); i++)\n#define all(x) (x).begin(), (x).end()\n#define uniq(x) (x).erase(unique(all(x)), (x).end())\n#define bit(n) (1LL << (n))\n#define dump(x) cerr << #x \" = \" << (x) << endl\nusing vint = vector<int>;\nusing vvint = vector<vint>;\nusing pint = pair<int, int>;\nusing vpint = vector<pint>;\ntemplate<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\nconstexpr double PI = 3.1415926535897932384626433832795028;\nconstexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};\nconstexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};\nint sign(int x) { return (x > 0) - (x < 0); }\nint gcd(int a, int b) {\n while (b) { swap(a %= b, b); }\n return a;\n}\nint lcm(int a, int b) { return a / gcd(a, b) * b; }\nint cdiv(int a, int b) { return (a - 1 + b) / b; }\ntemplate<typename T> void fin(T mes) {\n cout << mes << endl;\n exit(0);\n}\ntemplate<typename T> T sq(T x) { return x * x; }\ntemplate<typename T, typename U> bool chmax(T &a, const U &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<typename T, typename U> bool chmin(T &a, const U &b) {\n if (b < a) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\n os << \"(\" << rhs.first << \", \" << rhs.second << \")\";\n return os;\n}\ntemplate<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {\n os << \"{\";\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\n os << *itr << (next(itr) != rhs.end() ? \", \" : \"\");\n }\n os << \"}\";\n return os;\n}\ntemplate<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {\n os << \"{\";\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\n os << *itr << (next(itr) != rhs.end() ? \", \" : \"\");\n }\n os << \"}\";\n return os;\n}\ntemplate<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {\n os << \"{\";\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\n os << *itr << (next(itr) != rhs.end() ? \", \" : \"\");\n }\n os << \"}\";\n return os;\n}\ntemplate<typename T> ostream &operator<<(ostream &os, const multiset<T> &rhs) {\n os << \"{\";\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\n os << *itr << (next(itr) != rhs.end() ? \", \" : \"\");\n }\n os << \"}\";\n return os;\n}\ntemplate<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {\n os << \"{\";\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\n os << *itr << (next(itr) != rhs.end() ? \", \" : \"\");\n }\n os << \"}\";\n return os;\n}\nstruct setup {\n static constexpr int PREC = 20;\n setup() {\n cout << fixed << setprecision(PREC);\n cerr << fixed << setprecision(PREC);\n };\n} setup;\n\nusing mint = modint998244353;\n\nsigned main() {\n int N, M, K, F;\n cin >> N >> M >> K >> F;\n int x = 0, hasi = (N - 2) * (N - 1);\n int hoge = 0;\n rep(i, M) {\n int a, b, c;\n cin >> a >> b >> c;\n if (abs(a - b) > 1) {\n hoge++;\n continue;\n }\n x |= c;\n }\n M -= hoge;\n if (F != (F | x)) { fin(0); }\n int cnt = __builtin_popcountll(F ^ x);\n int p = __builtin_popcountll(x);\n fin((((mint(2).pow(hasi - hoge).pow(K)) * (mint(2).pow(N * N - hasi - M) - 1).pow(cnt))\n * (mint(2).pow(N * N - hasi - M).pow(p))).val());\n}","accuracy":1,"time_ms":40,"memory_kb":3464,"score_of_the_acc":-0.6221,"final_rank":5},{"submission_id":"aoj_3159_4833695","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef pair<int,int> P;\nint INF = 1e18;\nint mod = 998244353;\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nint mod_pow(int x,int y) {\n int res = 1;\n while(y > 0) {\n if(y%2) {\n res = res*x%mod;\n }\n x = x*x%mod;\n y/=2;\n }\n return res;\n}\nint fac[2500], finv[2500], inv[2500];\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < 2500; i++){\n fac[i] = fac[i - 1] * i % mod;\n inv[i] = mod - inv[mod%i] * (mod / i) % mod;\n finv[i] = finv[i - 1] * inv[i] % mod;\n }\n}\nint COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\nsigned main() {\n int N,M,K,F;\n cin >> N >> M >> K >> F;\n int X = 0;\n vector<bool>ok(35,true);\n for(int i = 0; i < 35; i++) {\n ok[i] = (1^(F >> i));\n if(1 & (F >> i)) {\n X++;\n }\n }\n COMinit();\n for(int i = 0; i < M; i++) {\n int a,b,c;\n cin >> a >> b >> c;\n for(int j = 0; j < 35; j++) {\n if(1 & (c >> j)) {\n if((F >> j) == 0) {\n cout << 0 << endl;\n return 0;\n }\n ok[j] = true;\n }\n }\n }\n int cnt = 0;\n for(int i = 0; i < 35; i++) {\n if(!ok[i]) {\n cnt++;\n }\n }\n int ng = 0;\n for(int i = 1; i <= cnt; i++) {\n if(i%2 == cnt%2) {\n ng += mod_pow(2,X-i)*COM(cnt,i)%mod;\n }\n else {\n ng = (ng+mod-mod_pow(2,X-i)*COM(cnt,i))%mod;\n }\n }\n cout << (mod_pow(mod_pow(2,X),N*N-M)+mod-ng)%mod << endl;\n}","accuracy":0.039473684210526314,"time_ms":10,"memory_kb":3140,"score_of_the_acc":-0.0033,"final_rank":17},{"submission_id":"aoj_3159_4833691","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef pair<int,int> P;\nint INF = 1e18;\nint mod = 998244353;\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nint mod_pow(int x,int y) {\n int res = 1;\n while(y > 0) {\n if(y%2) {\n res = res*x%mod;\n }\n x = x*x%mod;\n y/=2;\n }\n return res;\n}\nint fac[2500], finv[2500], inv[2500];\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < 2500; i++){\n fac[i] = fac[i - 1] * i % mod;\n inv[i] = mod - inv[mod%i] * (mod / i) % mod;\n finv[i] = finv[i - 1] * inv[i] % mod;\n }\n}\nint COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\nsigned main() {\n int N,M,K,F;\n cin >> N >> M >> K >> F;\n int X = 0;\n vector<bool>ok(35,true);\n for(int i = 0; i < 35; i++) {\n ok[i] = (1^(F >> i));\n if(1 & (F >> i)) {\n X++;\n }\n }\n COMinit();\n for(int i = 0; i < M; i++) {\n int a,b,c;\n cin >> a >> b >> c;\n for(int j = 0; j < 35; j++) {\n if(1 & (c >> j)) {\n if((F >> j) == 0) {\n cout << 0 << endl;\n return 0;\n }\n ok[j] = true;\n }\n }\n }\n int cnt = 0;\n for(int i = 0; i < 35; i++) {\n if(!ok[i]) {\n cnt++;\n }\n }\n int ng = 0;\n for(int i = 1; i <= cnt; i++) {\n if(i%2 == 1) {\n ng += mod_pow(2,X-i)*COM(cnt,i)%mod;\n }\n if(i%2 == 0) {\n ng = (ng+mod-mod_pow(2,X-i)*COM(cnt,i))%mod;\n }\n }\n cout << (mod_pow(mod_pow(2,X),N*N-M)+mod-ng)%mod << endl;\n}","accuracy":0.039473684210526314,"time_ms":10,"memory_kb":3156,"score_of_the_acc":-0.0042,"final_rank":19}],"string":"[\n {\n \"submission_id\": \"aoj_3159_10093281\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <cassert>\\n#include <vector>\\n#include <cstdint>\\n#include <iostream>\\n#include <type_traits>\\n#include <utility>\\nnamespace internal {\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr std::int64_t safe_mod(std::int64_t x, std::int64_t m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n std::uint64_t im;\\n // @param m `1 <= m`\\n explicit barrett(unsigned int m) : _m(m), im((std::uint64_t)(-1) / m + 1) {}\\n // @return m\\n unsigned int umod() const { return _m; }\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n std::uint64_t z = a;\\n z *= b;\\n std::uint64_t x = (std::uint64_t)(((__uint128_t)(z)*im) >> 64);\\n std::uint64_t y = x * _m;\\n return (unsigned int)(z - y + (z < y ? _m : 0));\\n }\\n};\\nstruct montgomery {\\n std::uint64_t _m;\\n std::uint64_t im;\\n std::uint64_t r2;\\n // @param m `1 <= m`\\n explicit constexpr montgomery(std::uint64_t m) : _m(m), im(m), r2(-__uint128_t(m) % m) {\\n for (int i = 0; i < 5; ++i) im = im * (2 - _m * im);\\n im = -im;\\n }\\n // @return m\\n constexpr std::uint64_t umod() const { return _m; }\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n constexpr std::uint64_t mul(std::uint64_t a, std::uint64_t b) const { return mr(mr(a, b), r2); }\\n constexpr std::uint64_t exp(std::uint64_t a, std::uint64_t b) const {\\n std::uint64_t res = 1, p = mr(a, r2);\\n while (b) {\\n if (b & 1) res = mr(res, p);\\n p = mr(p, p);\\n b >>= 1;\\n }\\n return res;\\n }\\n constexpr bool same_pow(std::uint64_t x, int s, std::uint64_t n) const {\\n x = mr(x, r2), n = mr(n, r2);\\n for (int r = 0; r < s; r++) {\\n if (x == n) return true;\\n x = mr(x, x);\\n }\\n return false;\\n }\\n private:\\n constexpr std::uint64_t mr(std::uint64_t x) const {\\n return ((__uint128_t)(x * im) * _m + x) >> 64;\\n }\\n constexpr std::uint64_t mr(std::uint64_t a, std::uint64_t b) const {\\n __uint128_t t = (__uint128_t)a * b;\\n std::uint64_t inc = std::uint64_t(t) != 0;\\n std::uint64_t x = t >> 64, y = ((__uint128_t)(a * b * im) * _m) >> 64;\\n unsigned long long z = 0;\\n bool f = __builtin_uaddll_overflow(x, y, &z);\\n z += inc;\\n return f ? z - _m : z;\\n }\\n};\\nconstexpr bool is_SPRP32(std::uint32_t n, std::uint32_t a) {\\n std::uint32_t d = n - 1, s = 0;\\n while ((d & 1) == 0) ++s, d >>= 1;\\n std::uint64_t cur = 1, pw = d;\\n while (pw) {\\n if (pw & 1) cur = (cur * a) % n;\\n a = (std::uint64_t)a * a % n;\\n pw >>= 1;\\n }\\n if (cur == 1) return true;\\n for (std::uint32_t r = 0; r < s; r++) {\\n if (cur == n - 1) return true;\\n cur = cur * cur % n;\\n }\\n return false;\\n}\\n// given 2 <= n,a < 2^64, a prime, check whether n is a-SPRP\\nconstexpr bool is_SPRP64(const montgomery &m, std::uint64_t a) {\\n auto n = m.umod();\\n if (n == a) return true;\\n if (n % a == 0) return false;\\n std::uint64_t d = n - 1;\\n int s = 0;\\n while ((d & 1) == 0) ++s, d >>= 1;\\n std::uint64_t cur = m.exp(a, d);\\n if (cur == 1) return true;\\n return m.same_pow(cur, s, n - 1);\\n}\\nconstexpr bool is_prime_constexpr(std::uint64_t x) {\\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\\n if (x < 121) return (x > 1);\\n montgomery m(x);\\n constexpr std::uint64_t bases[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\\n for (auto a : bases) {\\n if (!is_SPRP64(m, a)) return false;\\n }\\n return true;\\n}\\nconstexpr bool is_prime_constexpr(std::int64_t x) {\\n if (x < 0) return false;\\n return is_prime_constexpr(std::uint64_t(x));\\n}\\nconstexpr bool is_prime_constexpr(std::uint32_t x) {\\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\\n if (x < 121) return (x > 1);\\n std::uint64_t h = x;\\n h = ((h >> 16) ^ h) * 0x45d9f3b;\\n h = ((h >> 16) ^ h) * 0x45d9f3b;\\n h = ((h >> 16) ^ h) & 255;\\n constexpr uint16_t bases[] = {\\n 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620, 560,\\n 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028,\\n 2213, 6219, 620, 3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113,\\n 7061, 803, 1269, 3875, 422, 751, 580, 4729, 10239, 746, 2951, 556, 2206,\\n 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,\\n 15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903,\\n 737, 1887, 7447, 1888, 2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41,\\n 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352, 6435, 165, 1169, 3315,\\n 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,\\n 27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524,\\n 3577, 236, 2360, 6146, 2850, 55637, 1753, 4178, 8466, 222, 2579, 2743, 2031,\\n 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159, 1725, 3597, 3366, 14336,\\n 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,\\n 434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183,\\n 8126, 1870, 3296, 7455, 8947, 25017, 541, 19115, 368, 566, 5674, 411, 522,\\n 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007, 35201, 4706, 1152, 1785,\\n 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,\\n 4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816,\\n 5197, 13330, 7054, 2818, 3199, 811, 922, 350, 7514, 4452, 3449, 2663, 4708,\\n 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194};\\n return is_SPRP32(x, bases[h]);\\n}\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr std::int64_t pow_mod_constexpr(std::int64_t x, std::int64_t n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n std::uint64_t r = 1;\\n std::uint64_t y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n std::int64_t d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr std::int64_t bases[3] = {2, 7, 61};\\n for (std::int64_t a : bases) {\\n std::int64_t t = d;\\n std::int64_t y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) { return false; }\\n }\\n return true;\\n}\\ntemplate <int n>\\nconstexpr bool is_prime = is_prime_constexpr(n);\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<std::int64_t, std::int64_t> inv_gcd(std::int64_t a, std::int64_t b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n std::int64_t s = b, t = a;\\n std::int64_t m0 = 0, m1 = 1;\\n while (t) {\\n std::int64_t u = s / t;\\n s -= t * u;\\n m0 -= m1 * u;\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (std::int64_t)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) { x /= i; }\\n }\\n }\\n if (x > 1) { divs[cnt++] = x; }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m>\\nconstexpr int primitive_root = primitive_root_constexpr(m);\\n} // namespace internal\\n#include <numeric>\\nnamespace internal {\\ntemplate <class T>\\nusing is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;\\ntemplate <class T>\\nusing is_integral =\\n typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value, make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\ntemplate <class T>\\nusing to_unsigned_t = typename to_unsigned<T>::type;\\n} // namespace internal\\nnamespace internal {\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\ntemplate <class T>\\nusing is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T>\\nusing is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n} // namespace internal\\ntemplate <int m, std::enable_if_t<(1 <= m)> * = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n public:\\n static constexpr int mod() { return m; }\\n static constexpr mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n constexpr static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T> * = nullptr>\\n constexpr static_modint(T v) : _v(0) {\\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\\n constexpr static_modint(T v) : _v(0) {\\n _v = (unsigned int)(v % umod());\\n }\\n constexpr unsigned int val() const { return _v; }\\n constexpr mint &operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n constexpr mint &operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n constexpr mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n constexpr mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n constexpr mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n constexpr mint &operator-=(const mint &rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n constexpr mint &operator*=(const mint &rhs) {\\n std::uint64_t z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n constexpr mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n constexpr mint operator+() const { return *this; }\\n constexpr mint operator-() const { return mint() - *this; }\\n constexpr mint pow(std::int64_t n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n constexpr mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n friend constexpr mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\\n friend constexpr mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\\n friend constexpr mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\\n friend constexpr mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\\n friend constexpr bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\\n friend constexpr bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\\n std::int64_t t;\\n is >> t;\\n rhs = mint(t);\\n return is;\\n }\\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\\n return os << rhs._v;\\n }\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\ntemplate <int id>\\nstruct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n unsigned int val() const { return _v; }\\n mint &operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint &operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint &operator-=(const mint &rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint &operator*=(const mint &rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n mint pow(std::int64_t n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\\n friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\\n friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\\n friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\\n friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\\n friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\\n std::int64_t t;\\n is >> t;\\n rhs = mint(t);\\n return is;\\n }\\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\\n return os << rhs._v;\\n }\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id>\\ninternal::barrett dynamic_modint<id>::bt(998244353);\\nusing modint998 = static_modint<998244353>;\\nusing modint107 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\nnamespace internal {\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\ntemplate <class>\\nstruct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n} // namespace internal\\ntemplate <class mint = modint998, internal::is_modint_t<mint> * = nullptr>\\nstruct Combination {\\n Combination() : _fact(), _finv() {}\\n mint operator()(int n, int k) {\\n if (n < k || n < 0 || k < 0) return 0;\\n _init(n);\\n return _fact[n] * _finv[k] * _finv[n - k];\\n }\\n mint fact(int x) {\\n assert(x >= 0);\\n _init(x);\\n return _fact[x];\\n }\\n mint finv(int x) {\\n assert(x >= 0);\\n _init(x);\\n return _finv[x];\\n }\\n mint naive(int n, int k) const {\\n if (n < k || n < 0 || k < 0) return 0;\\n if (n - k < k) k = n - k;\\n mint res = 1;\\n for (int i = 0; i < k; ++i) {\\n res *= n - i;\\n res /= i + 1;\\n }\\n return res;\\n }\\n mint permu(int n, int k) {\\n if (n < k || n < 0 || k < 0) return 0;\\n _init(n);\\n return _fact[n] * _finv[n - k];\\n }\\n private:\\n std::vector<mint> _fact, _finv;\\n void _init(int n) {\\n if ((int)_fact.size() > n) return;\\n int m = _fact.size();\\n _fact.resize(n + 1);\\n for (int i = m; i <= n; ++i) {\\n if (i == 0) _fact[i] = 1;\\n else _fact[i] = _fact[i - 1] * i;\\n }\\n _finv.resize(n + 1);\\n _finv[n] = _fact[n].inv();\\n for (int i = n - 1; i >= m; --i) _finv[i] = _finv[i + 1] * (i + 1);\\n }\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nCombination combi;\\nusing Mint = modint998;\\nint main(void) {\\n int n, m, k, f;\\n cin >> n >> m >> k >> f;\\n vector<int> a(m), b(m), c(m);\\n rep (i, m) cin >> a[i] >> b[i] >> c[i];\\n int ans = 0;\\n int cnt = n * 3 - 2;\\n int rest = n * n - cnt;\\n rep (i, m) {\\n if (abs(a[i] - b[i]) <= 1) {\\n ans = ans | c[i];\\n --cnt;\\n } else {\\n --rest;\\n }\\n }\\n if (ans & ~f) {\\n co(0);\\n return 0;\\n }\\n int p = 0;\\n rep (i, k) p += f >> i & 1;\\n if (ans == f) {\\n co(Mint(2).pow(p).pow(cnt) * Mint(1 << k).pow(rest));\\n } else {\\n Mint s = 0;\\n int q = 0;\\n rep (i, k) q += ans >> i & 1;\\n q = p - q;\\n rep (i, q + 1) {\\n if (i & 1) {\\n s -= combi(q, i) * Mint(2).pow(p - i).pow(cnt);\\n } else {\\n s += combi(q, i) * Mint(2).pow(p - i).pow(cnt);\\n }\\n }\\n co(s * Mint(1 << k).pow(rest));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4388,\n \"score_of_the_acc\": -0.076,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3159_10093277\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <cassert>\\n#include <vector>\\n#include <cstdint>\\n#include <iostream>\\n#include <type_traits>\\n#include <utility>\\nnamespace internal {\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr std::int64_t safe_mod(std::int64_t x, std::int64_t m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n std::uint64_t im;\\n // @param m `1 <= m`\\n explicit barrett(unsigned int m) : _m(m), im((std::uint64_t)(-1) / m + 1) {}\\n // @return m\\n unsigned int umod() const { return _m; }\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n std::uint64_t z = a;\\n z *= b;\\n std::uint64_t x = (std::uint64_t)(((__uint128_t)(z)*im) >> 64);\\n std::uint64_t y = x * _m;\\n return (unsigned int)(z - y + (z < y ? _m : 0));\\n }\\n};\\nstruct montgomery {\\n std::uint64_t _m;\\n std::uint64_t im;\\n std::uint64_t r2;\\n // @param m `1 <= m`\\n explicit constexpr montgomery(std::uint64_t m) : _m(m), im(m), r2(-__uint128_t(m) % m) {\\n for (int i = 0; i < 5; ++i) im = im * (2 - _m * im);\\n im = -im;\\n }\\n // @return m\\n constexpr std::uint64_t umod() const { return _m; }\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n constexpr std::uint64_t mul(std::uint64_t a, std::uint64_t b) const { return mr(mr(a, b), r2); }\\n constexpr std::uint64_t exp(std::uint64_t a, std::uint64_t b) const {\\n std::uint64_t res = 1, p = mr(a, r2);\\n while (b) {\\n if (b & 1) res = mr(res, p);\\n p = mr(p, p);\\n b >>= 1;\\n }\\n return res;\\n }\\n constexpr bool same_pow(std::uint64_t x, int s, std::uint64_t n) const {\\n x = mr(x, r2), n = mr(n, r2);\\n for (int r = 0; r < s; r++) {\\n if (x == n) return true;\\n x = mr(x, x);\\n }\\n return false;\\n }\\n private:\\n constexpr std::uint64_t mr(std::uint64_t x) const {\\n return ((__uint128_t)(x * im) * _m + x) >> 64;\\n }\\n constexpr std::uint64_t mr(std::uint64_t a, std::uint64_t b) const {\\n __uint128_t t = (__uint128_t)a * b;\\n std::uint64_t inc = std::uint64_t(t) != 0;\\n std::uint64_t x = t >> 64, y = ((__uint128_t)(a * b * im) * _m) >> 64;\\n unsigned long long z = 0;\\n bool f = __builtin_uaddll_overflow(x, y, &z);\\n z += inc;\\n return f ? z - _m : z;\\n }\\n};\\nconstexpr bool is_SPRP32(std::uint32_t n, std::uint32_t a) {\\n std::uint32_t d = n - 1, s = 0;\\n while ((d & 1) == 0) ++s, d >>= 1;\\n std::uint64_t cur = 1, pw = d;\\n while (pw) {\\n if (pw & 1) cur = (cur * a) % n;\\n a = (std::uint64_t)a * a % n;\\n pw >>= 1;\\n }\\n if (cur == 1) return true;\\n for (std::uint32_t r = 0; r < s; r++) {\\n if (cur == n - 1) return true;\\n cur = cur * cur % n;\\n }\\n return false;\\n}\\n// given 2 <= n,a < 2^64, a prime, check whether n is a-SPRP\\nconstexpr bool is_SPRP64(const montgomery &m, std::uint64_t a) {\\n auto n = m.umod();\\n if (n == a) return true;\\n if (n % a == 0) return false;\\n std::uint64_t d = n - 1;\\n int s = 0;\\n while ((d & 1) == 0) ++s, d >>= 1;\\n std::uint64_t cur = m.exp(a, d);\\n if (cur == 1) return true;\\n return m.same_pow(cur, s, n - 1);\\n}\\nconstexpr bool is_prime_constexpr(std::uint64_t x) {\\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\\n if (x < 121) return (x > 1);\\n montgomery m(x);\\n constexpr std::uint64_t bases[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\\n for (auto a : bases) {\\n if (!is_SPRP64(m, a)) return false;\\n }\\n return true;\\n}\\nconstexpr bool is_prime_constexpr(std::int64_t x) {\\n if (x < 0) return false;\\n return is_prime_constexpr(std::uint64_t(x));\\n}\\nconstexpr bool is_prime_constexpr(std::uint32_t x) {\\n if (x == 2 || x == 3 || x == 5 || x == 7) return true;\\n if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\\n if (x < 121) return (x > 1);\\n std::uint64_t h = x;\\n h = ((h >> 16) ^ h) * 0x45d9f3b;\\n h = ((h >> 16) ^ h) * 0x45d9f3b;\\n h = ((h >> 16) ^ h) & 255;\\n constexpr uint16_t bases[] = {\\n 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620, 560,\\n 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028,\\n 2213, 6219, 620, 3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113,\\n 7061, 803, 1269, 3875, 422, 751, 580, 4729, 10239, 746, 2951, 556, 2206,\\n 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,\\n 15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903,\\n 737, 1887, 7447, 1888, 2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41,\\n 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352, 6435, 165, 1169, 3315,\\n 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,\\n 27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524,\\n 3577, 236, 2360, 6146, 2850, 55637, 1753, 4178, 8466, 222, 2579, 2743, 2031,\\n 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159, 1725, 3597, 3366, 14336,\\n 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,\\n 434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183,\\n 8126, 1870, 3296, 7455, 8947, 25017, 541, 19115, 368, 566, 5674, 411, 522,\\n 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007, 35201, 4706, 1152, 1785,\\n 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,\\n 4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816,\\n 5197, 13330, 7054, 2818, 3199, 811, 922, 350, 7514, 4452, 3449, 2663, 4708,\\n 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194};\\n return is_SPRP32(x, bases[h]);\\n}\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr std::int64_t pow_mod_constexpr(std::int64_t x, std::int64_t n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n std::uint64_t r = 1;\\n std::uint64_t y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n std::int64_t d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr std::int64_t bases[3] = {2, 7, 61};\\n for (std::int64_t a : bases) {\\n std::int64_t t = d;\\n std::int64_t y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) { return false; }\\n }\\n return true;\\n}\\ntemplate <int n>\\nconstexpr bool is_prime = is_prime_constexpr(n);\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<std::int64_t, std::int64_t> inv_gcd(std::int64_t a, std::int64_t b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n std::int64_t s = b, t = a;\\n std::int64_t m0 = 0, m1 = 1;\\n while (t) {\\n std::int64_t u = s / t;\\n s -= t * u;\\n m0 -= m1 * u;\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (std::int64_t)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) { x /= i; }\\n }\\n }\\n if (x > 1) { divs[cnt++] = x; }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m>\\nconstexpr int primitive_root = primitive_root_constexpr(m);\\n} // namespace internal\\n#include <numeric>\\nnamespace internal {\\ntemplate <class T>\\nusing is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;\\ntemplate <class T>\\nusing is_integral =\\n typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type, std::false_type>::type;\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value, make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\ntemplate <class T>\\nusing to_unsigned_t = typename to_unsigned<T>::type;\\n} // namespace internal\\nnamespace internal {\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\ntemplate <class T>\\nusing is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T>\\nusing is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n} // namespace internal\\ntemplate <int m, std::enable_if_t<(1 <= m)> * = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n public:\\n static constexpr int mod() { return m; }\\n static constexpr mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n constexpr static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T> * = nullptr>\\n constexpr static_modint(T v) : _v(0) {\\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\\n constexpr static_modint(T v) : _v(0) {\\n _v = (unsigned int)(v % umod());\\n }\\n constexpr unsigned int val() const { return _v; }\\n constexpr mint &operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n constexpr mint &operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n constexpr mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n constexpr mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n constexpr mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n constexpr mint &operator-=(const mint &rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n constexpr mint &operator*=(const mint &rhs) {\\n std::uint64_t z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n constexpr mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n constexpr mint operator+() const { return *this; }\\n constexpr mint operator-() const { return mint() - *this; }\\n constexpr mint pow(std::int64_t n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n constexpr mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n friend constexpr mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\\n friend constexpr mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\\n friend constexpr mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\\n friend constexpr mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\\n friend constexpr bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\\n friend constexpr bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\\n std::int64_t t;\\n is >> t;\\n rhs = mint(t);\\n return is;\\n }\\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\\n return os << rhs._v;\\n }\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\ntemplate <int id>\\nstruct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n std::int64_t x = (std::int64_t)(v % (std::int64_t)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n unsigned int val() const { return _v; }\\n mint &operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint &operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint &operator-=(const mint &rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint &operator*=(const mint &rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n mint pow(std::int64_t n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\\n friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\\n friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\\n friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\\n friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }\\n friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }\\n friend std::istream &operator>>(std::istream &is, mint &rhs) {\\n std::int64_t t;\\n is >> t;\\n rhs = mint(t);\\n return is;\\n }\\n friend constexpr std::ostream &operator<<(std::ostream &os, const mint &rhs) {\\n return os << rhs._v;\\n }\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id>\\ninternal::barrett dynamic_modint<id>::bt(998244353);\\nusing modint998 = static_modint<998244353>;\\nusing modint107 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\nnamespace internal {\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\ntemplate <class>\\nstruct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n} // namespace internal\\ntemplate <class mint = modint998, internal::is_modint_t<mint> * = nullptr>\\nstruct Combination {\\n Combination() : _fact(), _finv() {}\\n mint operator()(int n, int k) {\\n if (n < k || n < 0 || k < 0) return 0;\\n _init(n);\\n return _fact[n] * _finv[k] * _finv[n - k];\\n }\\n mint fact(int x) {\\n assert(x >= 0);\\n _init(x);\\n return _fact[x];\\n }\\n mint finv(int x) {\\n assert(x >= 0);\\n _init(x);\\n return _finv[x];\\n }\\n mint naive(int n, int k) const {\\n if (n < k || n < 0 || k < 0) return 0;\\n if (n - k < k) k = n - k;\\n mint res = 1;\\n for (int i = 0; i < k; ++i) {\\n res *= n - i;\\n res /= i + 1;\\n }\\n return res;\\n }\\n mint permu(int n, int k) {\\n if (n < k || n < 0 || k < 0) return 0;\\n _init(n);\\n return _fact[n] * _finv[n - k];\\n }\\n private:\\n std::vector<mint> _fact, _finv;\\n void _init(int n) {\\n if ((int)_fact.size() > n) return;\\n int m = _fact.size();\\n _fact.resize(n + 1);\\n for (int i = m; i <= n; ++i) {\\n if (i == 0) _fact[i] = 1;\\n else _fact[i] = _fact[i - 1] * i;\\n }\\n _finv.resize(n + 1);\\n _finv[n] = _fact[n].inv();\\n for (int i = n - 1; i >= m; --i) _finv[i] = _finv[i + 1] * (i + 1);\\n }\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nCombination combi;\\nusing Mint = modint998;\\nint main(void) {\\n int n, m, k, f;\\n cin >> n >> m >> k >> f;\\n vector<int> a(m), b(m), c(m);\\n rep (i, m) cin >> a[i] >> b[i] >> c[i];\\n int ans = 0;\\n int cnt = n * 3 - 2;\\n int rest = n * n - cnt;\\n rep (i, m) {\\n if (abs(a[i] - b[i]) <= 1) {\\n ans = ans | c[i];\\n --cnt;\\n } else {\\n --rest;\\n }\\n }\\n if (ans & ~f) {\\n co(0);\\n return 0;\\n }\\n int p = 0;\\n rep (i, k) p += f >> i & 1;\\n if (ans == f) {\\n co(Mint(2).pow(p).pow(cnt) * Mint(1 << k).pow(rest));\\n } else {\\n Mint s = 0;\\n int q = 0;\\n rep (i, k) q += ans >> i & 1;\\n rep (i, q + 1) {\\n if (i & 1) {\\n s -= combi(q, i) * Mint(2).pow(p - i).pow(cnt);\\n } else {\\n s += combi(q, i) * Mint(2).pow(p - i).pow(cnt);\\n }\\n }\\n co(s * Mint(1 << k).pow(rest));\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.3026315789473684,\n \"time_ms\": 10,\n \"memory_kb\": 4128,\n \"score_of_the_acc\": -0.0609,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3159_9737298\",\n \"code_snippet\": \"#include <iostream>\\n\\nusing namespace std;\\ntypedef long long ll;\\nll mod = 998244353;\\nll pw(ll a, ll x){\\n ll ret = 1;\\n while(x){\\n if(x&1) (ret *= a) %= mod;\\n (a *= a) %= mod; x /= 2;\\n }\\n return ret;\\n}\\n\\nll a[100010],b[100010],c[100010];\\nint main(){\\n ll i,j,n,m,k,f; cin >> n >> m >> k >> f;\\n for(i=0;i<m;i++) cin >> a[i] >> b[i] >> c[i];\\n ll ans = 1;\\n for(j=0;j<k;j++){\\n ll res = n*n - 3*n + 2;\\n int x = f&1;\\n ll z = 1;\\n for(i=0;i<m;i++){\\n if(a[i] - b[i]>=-1 && a[i] - b[i]<=1){\\n if((c[i]&1)==1) z *= 0;\\n }else{\\n res--;\\n }\\n c[i] /= 2;\\n }\\n (z *= pw(2,res)) %= mod;\\n if(x==0) (ans *= z) %= mod;\\n if(x==1) (ans *= (pw(2,n*n - m) + mod - z)%mod) %= mod;\\n f /= 2;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5700,\n \"score_of_the_acc\": -0.9525,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3159_6304781\",\n \"code_snippet\": \"#include <iostream>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <set>\\n#include <vector>\\n#include <numeric>\\n#include <algorithm>\\n#include <queue>\\n#include <string>\\n#include <random>\\n#include <array>\\n#include <climits>\\n#include <map>\\n#include <cassert>\\n#include <stack>\\n#include <iomanip>\\n#include <cfloat>\\n#include <fstream>\\n\\nconstexpr int MOD = 998244353;\\nlong long int pow_mod(long long int base, int exp) {\\n\\tlong long int result{ 1 };\\n\\tbase %= MOD;\\n\\twhile (exp > 0) {\\n\\t\\tif (exp & 1) {\\n\\t\\t\\tresult = result * base % MOD;\\n\\t\\t}\\n\\t\\tbase = base * base % MOD;\\n\\t\\texp >>= 1;\\n\\t}\\n\\treturn result;\\n}\\n\\nint main() {\\n\\tint n, m, k, f; std::cin >> n >> m >> k >> f;\\n\\tstd::vector<std::tuple<int, int, int>> determined(m);\\n\\tfor (auto& [a, b, c] : determined) {\\n\\t\\tstd::cin >> a >> b >> c; --a; --b;\\n\\t}\\n\\tstd::vector<std::vector<int>> state(n, std::vector<int>(n, -1));\\n\\tfor (const auto [a, b, c] : determined) {\\n\\t\\tstate[a][b] = c;\\n\\t}\\n\\tconst int free_count = n * n - m;\\n\\tint free_on_diagonal{ 0 };\\n\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\tif (state[i][i] == -1) {\\n\\t\\t\\tfree_on_diagonal += 1;\\n\\t\\t}\\n\\t\\tif (i > 0) {\\n\\t\\t\\tif (state[i - 1][i] == -1) {\\n\\t\\t\\t\\tfree_on_diagonal += 1;\\n\\t\\t\\t}\\n\\t\\t\\tif (state[i][i - 1] == -1) {\\n\\t\\t\\t\\tfree_on_diagonal += 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tlong long int result{ 1 };\\n\\tfor (auto d = 0; d < k; ++d) {\\n\\t\\tbool has_one{ false };\\n\\t\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\t\\tif (state[i][i] >= 0) {\\n\\t\\t\\t\\tif ((state[i][i] >> d) & 1) {\\n\\t\\t\\t\\t\\thas_one = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (i > 0) {\\n\\t\\t\\t\\tif (state[i - 1][i] >= 0) {\\n\\t\\t\\t\\t\\tif ((state[i - 1][i] >> d) & 1) {\\n\\t\\t\\t\\t\\t\\thas_one = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (state[i][i - 1] >= 0) {\\n\\t\\t\\t\\t\\tif ((state[i][i - 1] >> d) & 1) {\\n\\t\\t\\t\\t\\t\\thas_one = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (has_one) {\\n\\t\\t\\tif ((f >> d) & 1) {\\n\\t\\t\\t\\tresult = result * pow_mod(2, free_count) % MOD;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tresult = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif ((f >> d) & 1) {\\n\\t\\t\\t\\tresult = result * (pow_mod(2, free_on_diagonal) - 1) % MOD * pow_mod(2, free_count - free_on_diagonal) % MOD;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tresult = result * pow_mod(2, free_count - free_on_diagonal) % MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstd::cout << result << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 20240,\n \"score_of_the_acc\": -1.8,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3159_4905552\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\ntemplate <int mod>\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator-=(const ModInt &p) {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator*=(const ModInt &p) {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\n\\nconst int mod = 998244353;\\nusing mint = ModInt<mod>;\\n\\nint main() {\\n int n, m, k, f;\\n cin >> n >> m >> k >> f;\\n\\n int ct = 0;\\n rep(i, n) rep(j, n) {\\n if (abs(i - j) <= 1) ++ct;\\n }\\n int nct = n * n - ct;\\n\\n bool ok = true;\\n int dig_or = 0;\\n rep(i, m) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n if (abs(a - b) <= 1) {\\n --ct;\\n dig_or |= c;\\n if ((c | f) != f) ok = false;\\n } else\\n --nct;\\n }\\n if (ct == 0 && dig_or != f) ok = false;\\n if (!ok) {\\n cout << 0 << \\\"\\\\n\\\";\\n return 0;\\n }\\n\\n int p = __builtin_popcount(dig_or), q = __builtin_popcount(f);\\n\\n mint x = mint(1 << p).pow(ct);\\n rep(i, q - p) x *= (mint(2).pow(ct) - 1);\\n\\n cout << x * mint(1 << k).pow(nct) << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3128,\n \"score_of_the_acc\": -1.0026,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3159_4905517\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\ntemplate <int mod>\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator-=(const ModInt &p) {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator*=(const ModInt &p) {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\n\\nconst int mod = 998244353;\\nusing mint = ModInt<mod>;\\n\\nint main() {\\n int n, m, k, f;\\n cin >> n >> m >> k >> f;\\n\\n int ct = 0;\\n rep(i, n) rep(j, n) {\\n if (abs(i - j) <= 1) ++ct;\\n }\\n int nct = n * n - ct;\\n\\n bool ok = true;\\n int dig_or = 0;\\n rep(i, m) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n --a;\\n --b;\\n if (abs(a - b) <= 1) {\\n --ct;\\n dig_or |= c;\\n if ((c | f) != f) ok = false;\\n } else\\n --nct;\\n }\\n if (ct == 0 && dig_or != f) ok = false;\\n if (!ok) {\\n cout << 0 << \\\"\\\\n\\\";\\n return 0;\\n }\\n\\n mint x = mint(1 << (__builtin_popcount(f))).pow(ct);\\n mint y = mint(1 << k).pow(nct);\\n cout << x * y << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 0.3026315789473684,\n \"time_ms\": 40,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.6023,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3159_4905501\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\ntemplate <int mod>\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator-=(const ModInt &p) {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator*=(const ModInt &p) {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\n\\nconst int mod = 998244353;\\nusing mint = ModInt<mod>;\\n\\nint main() {\\n int n, m, k, f;\\n cin >> n >> m >> k >> f;\\n\\n int ct = 0;\\n rep(i, n) rep(j, n) {\\n if (abs(i - j) == 1) ++ct;\\n }\\n int nct = n * n - ct;\\n\\n bool ok = true;\\n int dig_or = 0;\\n rep(i, m) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n --a;\\n --b;\\n if (abs(a - b) == 1) {\\n --ct;\\n dig_or |= c;\\n if ((c | f) != f) ok = false;\\n } else\\n --nct;\\n }\\n if (ct == 0 && dig_or != f) ok = false;\\n if (!ok) {\\n cout << 0 << \\\"\\\\n\\\";\\n return 0;\\n }\\n\\n mint x = mint(1 << (__builtin_popcount(f))).pow(ct);\\n mint y = mint(1 << k).pow(nct);\\n cout << x * y << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 0.3026315789473684,\n \"time_ms\": 40,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.6023,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3159_4905498\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n// clang-format on\\n\\ntemplate <int mod>\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator-=(const ModInt &p) {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator*=(const ModInt &p) {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\n\\nconst int mod = 998244353;\\nusing mint = ModInt<mod>;\\n\\nint main() {\\n int n, m, k, f;\\n cin >> n >> m >> k >> f;\\n\\n int ct = 0;\\n rep(i, n) rep(j, n) {\\n if (abs(i - j) == 1) ++ct;\\n }\\n int nct = n * n - ct;\\n\\n bool ok = true;\\n rep(i, m) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n --a;\\n --b;\\n if (abs(a - b) == 1) {\\n --ct;\\n if ((c | f) != f) ok = false;\\n } else\\n --nct;\\n }\\n if (!ok) {\\n dbg(\\\"NOT OK\\\");\\n cout << 0 << \\\"\\\\n\\\";\\n return 0;\\n }\\n\\n mint x = mint(1 << (__builtin_popcount(f))).pow(ct);\\n mint y = mint(1 << k).pow(nct);\\n cout << x * y << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 0.039473684210526314,\n \"time_ms\": 10,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -0.0009,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3159_4861052\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nint n, m, k, f, frees = 0;\\nvector<int> cnt;\\n\\nModInt<> solve();\\n\\nint main() {\\n cin >> n >> m >> k >> f;\\n cnt.assign(k, 0);\\n for (int i = 0; i < m; ++i) {\\n int y, x, z;\\n cin >> y >> x >> z;\\n if (abs(y - x) <= 1)\\n for (int j = 0; j < k; ++j) cnt[j] += z >> j & 1;\\n else\\n ++frees;\\n }\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n ModInt<> res = ModInt<>(1 << k).pow(n * n - 3 * n + 2 - frees);\\n m -= frees;\\n for (int i = 0; i < k; ++i)\\n if (f >> i & 1)\\n res *= ModInt<>(2).pow(3 * n - 2 - m) - (cnt[i] == 0);\\n else\\n res *= cnt[i] == 0;\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.6205,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3159_4835267\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <chrono>\\n//#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\\n#define Rrep(i,n) Rreps(i,n,0)\\n#define ALL(a) a.begin(), a.end()\\n#define fi first\\n#define se second\\ntypedef long long ll;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n\\nll N,M,H,W,Q,K,A,B;\\nstring S;\\ntypedef pair<ll, ll> P;\\nconst ll INF = (1LL<<60);\\n\\ntemplate <unsigned long long mod > class modint{\\npublic:\\n ll x;\\n constexpr modint(){x = 0;}\\n constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}\\n constexpr modint operator-(){\\n return x == 0 ? 0 : mod - x;\\n }\\n constexpr modint& operator+=(const modint& a){\\n if((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr modint operator+(const modint& a) const{\\n return modint(*this) += a;\\n }\\n constexpr modint& operator-=(const modint& a){\\n if((x -= a.x) < 0) x += mod;\\n return *this;\\n }\\n constexpr modint operator-(const modint& a) const{\\n return modint(*this) -= a;\\n }\\n constexpr modint& operator*=(const modint& a){\\n (x *= a.x)%=mod;\\n return *this;\\n }\\n constexpr modint operator*(const modint& a) const{\\n return modint(*this) *= a;\\n }\\n constexpr modint pow(unsigned long long pw) const{\\n modint res(1), comp(*this);\\n while(pw){\\n if(pw&1) res *= comp;\\n comp *= comp;\\n pw >>= 1;\\n }\\n return res;\\n }\\n //以下、modが素数のときのみ\\n constexpr modint inv() const{\\n return modint(*this).pow(mod - 2);\\n }\\n constexpr modint& operator/=(const modint &a){\\n (x *= a.inv().x)%=mod;\\n return *this;\\n }\\n constexpr modint operator/(const modint &a) const{\\n return modint(*this) /= a;\\n }\\n};\\n#define mod1 998244353\\nusing mint = modint<mod1>;\\n\\nostream& operator<<(ostream& os, const mint& a){\\n os << a.x;\\n return os;\\n}\\nusing vm = vector<mint>;\\n\\nint main() {\\n ll F;\\n cin>>N>>M>>K>>F;\\n ll or_sum(0), num_free((N - 1) * (N - 2)), num_care(N * 3 - 2);\\n rep(i, M){\\n ll C;\\n cin>>A>>B>>C;\\n if(abs(A - B) <= 1){\\n or_sum |= C;\\n --num_care;\\n }else{\\n --num_free;\\n }\\n }\\n if((or_sum | F) != F){\\n cout<<0<<endl;\\n }else{\\n mint res(1);\\n rep(i, K){\\n if((F>>i)&1) {\\n if((or_sum>>i)&1) res *= mint(2).pow(num_care + num_free);\\n else res *= (mint(2).pow(num_care) - 1) * mint(2).pow(num_free);\\n }else{\\n res *= mint(2).pow(num_free);\\n }\\n }\\n cout<<res<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -0.8033,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3159_4835264\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <chrono>\\n//#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\\n#define Rrep(i,n) Rreps(i,n,0)\\n#define ALL(a) a.begin(), a.end()\\n#define fi first\\n#define se second\\ntypedef long long ll;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n\\nll N,M,H,W,Q,K,A,B;\\nstring S;\\ntypedef pair<ll, ll> P;\\nconst ll INF = (1LL<<60);\\n\\ntemplate <unsigned long long mod > class modint{\\npublic:\\n ll x;\\n constexpr modint(){x = 0;}\\n constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}\\n constexpr modint operator-(){\\n return x == 0 ? 0 : mod - x;\\n }\\n constexpr modint& operator+=(const modint& a){\\n if((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr modint operator+(const modint& a) const{\\n return modint(*this) += a;\\n }\\n constexpr modint& operator-=(const modint& a){\\n if((x -= a.x) < 0) x += mod;\\n return *this;\\n }\\n constexpr modint operator-(const modint& a) const{\\n return modint(*this) -= a;\\n }\\n constexpr modint& operator*=(const modint& a){\\n (x *= a.x)%=mod;\\n return *this;\\n }\\n constexpr modint operator*(const modint& a) const{\\n return modint(*this) *= a;\\n }\\n constexpr modint pow(unsigned long long pw) const{\\n modint res(1), comp(*this);\\n while(pw){\\n if(pw&1) res *= comp;\\n comp *= comp;\\n pw >>= 1;\\n }\\n return res;\\n }\\n //以下、modが素数のときのみ\\n constexpr modint inv() const{\\n return modint(*this).pow(mod - 2);\\n }\\n constexpr modint& operator/=(const modint &a){\\n (x *= a.inv().x)%=mod;\\n return *this;\\n }\\n constexpr modint operator/(const modint &a) const{\\n return modint(*this) /= a;\\n }\\n};\\n#define mod1 998244353\\nusing mint = modint<mod1>;\\n\\nostream& operator<<(ostream& os, const mint& a){\\n os << a.x;\\n return os;\\n}\\nusing vm = vector<mint>;\\n\\nint main() {\\n ll F;\\n cin>>N>>M>>K>>F;\\n ll or_sum(0), num_free((N - 1) * (N - 2)), num_care(N * 3 - 2);\\n rep(i, M){\\n ll C;\\n cin>>A>>B>>C;\\n if(abs(A - B) <= 1){\\n or_sum |= C;\\n --num_care;\\n }else{\\n --num_free;\\n }\\n }\\n if((or_sum | F) != F){\\n cout<<0<<endl;\\n }else{\\n mint res(1);\\n rep(i, K){\\n if((F>>i)&1) {\\n if((or_sum>>i)&1) res *= mint(2).pow(num_care + num_free);\\n else res *= (mint(2).pow(num_care) - 1) * mint(2).pow(num_free);\\n }\\n }\\n cout<<res<<endl;\\n }\\n}\",\n \"accuracy\": 0.3026315789473684,\n \"time_ms\": 40,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -0.6033,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3159_4834272\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\ntypedef long long int ll;\\nconstexpr ll mod=998244353;\\n\\nll mod_pow(ll a,ll b){\\n\\ta%=mod;\\n\\tif(b==0)return 1;\\n\\tif(b==1)return a;\\n\\tll res=mod_pow(a,b/2)%mod;\\n\\tres*=res; res%=mod;\\n\\tif(b%2)res*=a;\\n\\treturn res%mod;\\n}\\n\\nint main(){\\n\\tint n,m,k,f; cin >> n >> m >> k >> f;\\n\\tvector<bool> used(k,false);\\n\\tint cnt=3*n-2;\\n\\tfor(int i=0;i<m;i++){\\n\\t\\tint a,b,c; cin >> a >> b >> c;\\n\\t\\tif(abs(a-b)>1)continue;\\n\\t\\tcnt--;\\n\\t\\tfor(int j=0;j<k;j++){\\n\\t\\t\\tif((1<<j)&c)used[j]=1;\\n\\t\\t}\\n\\t}\\n\\tll res=1;\\n\\tfor(int i=0;i<k;i++){\\n\\t\\tif((1<<i)&f){\\n\\t\\t\\tif(used[i]) (res*=mod_pow(2,n*n-m))%=mod;\\n\\t\\t\\telse (res*=mod_pow(2,n*n-m)-mod_pow(2,n*n-m-cnt)+mod)%=mod;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tif(used[i]) res=0;\\n\\t\\t\\telse (res*=mod_pow(2,n*n-m-cnt))%=mod;\\n\\t\\t}\\n\\t}\\n\\tcout << res << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3084,\n \"score_of_the_acc\": -1,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3159_4834126\",\n \"code_snippet\": \"#pragma region Macros\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define ll long long\\n#define ld long double\\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vll vector<ll>\\n#define vpi vector<pii>\\n#define vpll vector<pll>\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n#define fi first\\n#define se second\\n#define all(c) begin(c), end(c)\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\nusing namespace std;\\nstring YES[2] = {\\\"NO\\\", \\\"YES\\\"};\\nstring Yes[2] = {\\\"No\\\", \\\"Yes\\\"};\\nstring yes[2] = {\\\"no\\\", \\\"yes\\\"};\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\n#define si(c) (int)(c).size()\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\\n scan(head);\\n IN(tail...);\\n}\\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\nvi iota(int n) {\\n vi a(n);\\n iota(all(a), 0);\\n return a;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n sort(all(y));\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\nint popcount(ll x) { return __builtin_popcountll(x); }\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(15);\\n }\\n} setup_io;\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return move(res);\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n cin >> a >> b >> c;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return move(res);\\n}\\n\\n#define i128 __int128_t\\n#define ull unsigned long long int\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n for(auto &e : v) cout << e << \\\" \\\";\\n cout << endl;\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n cout << \\\"(\\\" << p.fi << \\\", \\\" << p.se << \\\")\\\";\\n return os;\\n}\\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \\\"(\\\" + to_string(p.first) + \\\",\\\" + to_string(p.second) + \\\")\\\"; }\\ntemplate <class A> string to_string(A v) {\\n if(v.empty()) return \\\"{}\\\";\\n string ret = \\\"{\\\";\\n for(auto &x : v) ret += to_string(x) + \\\",\\\";\\n ret.back() = '}';\\n return ret;\\n}\\n\\nvoid dump() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\\n cerr << to_string(head) << \\\" \\\";\\n dump(tail...);\\n}\\n#define endl '\\\\n'\\n#ifdef _LOCAL\\n#undef endl\\n#define debug(x) \\\\\\n cout << #x << \\\": \\\"; \\\\\\n dump(x)\\n#else\\n#define debug(x)\\n#endif\\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\\n\\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\n#pragma endregion\\nnamespace modular {\\nconstexpr ll MOD = 998244353;\\nconst int MAXN = 1100000;\\ntemplate <ll Modulus> class modint {\\n using u64 = ll;\\n\\n public:\\n u64 a;\\n\\n constexpr modint(const u64 x = 0) noexcept : a(((x % Modulus) + Modulus) % Modulus) {}\\n constexpr u64 &value() noexcept { return a; }\\n constexpr const u64 &value() const noexcept { return a; }\\n constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; }\\n constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; }\\n constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; }\\n template <typename T> constexpr modint operator^(T rhs) const noexcept { return modint(*this) ^= rhs; }\\n constexpr modint operator-() const noexcept { return modint() - *this; }\\n constexpr modint &operator+=(const modint rhs) noexcept {\\n a += rhs.a;\\n if(a >= Modulus) { a -= Modulus; }\\n return *this;\\n }\\n constexpr modint &operator-=(const modint rhs) noexcept {\\n if(a < rhs.a) { a += Modulus; }\\n a -= rhs.a;\\n return *this;\\n }\\n constexpr modint &operator*=(const modint rhs) noexcept {\\n a = a * rhs.a % Modulus;\\n return *this;\\n }\\n constexpr bool operator==(const modint rhs) const noexcept { return a == rhs.a; }\\n template <typename T> constexpr modint &operator^=(T n) noexcept {\\n modint<Modulus> res = 1;\\n modint<Modulus> x = a;\\n while(n) {\\n if(n & 1) res *= x;\\n x *= x;\\n n >>= 1;\\n }\\n a = res.a;\\n return *this;\\n }\\n};\\n#define mint modint<MOD>\\n#define vmint vector<mint>\\nvmint Inv{0, 1}, Prd{1, 1}, Invprd{1, 1};\\nmint inv(int n) {\\n if(n > MAXN) return mint(n) ^ (MOD - 2);\\n if(Inv.size() > n)\\n return Inv[n];\\n else {\\n for(int i = Inv.size(); i <= n; ++i) Inv.emplace_back(Inv[MOD % i] * (-MOD / i));\\n return Inv[n];\\n }\\n}\\nmint inv(mint x) { return inv(x.a); }\\nmint prd(int n) {\\n if(Prd.size() > n)\\n return Prd[n];\\n else\\n for(int i = Prd.size(); i <= n; ++i) Prd.emplace_back(Prd[i - 1] * i);\\n return Prd[n];\\n}\\nmint invprd(int n) {\\n if(Invprd.size() > n)\\n return Invprd[n];\\n else\\n for(int i = Invprd.size(); i <= n; ++i) Invprd.emplace_back(Invprd[i - 1] * inv(i));\\n return Invprd[n];\\n}\\nmint modpow(ll a, ll n) {\\n mint x = a;\\n return x ^= n;\\n}\\nmint operator/(mint l, mint r) { return l * inv(r); }\\nmint &operator/=(mint &l, mint r) { return l = l / r; }\\nmint C(int a, int b) {\\n if(a < 0 || b < 0) return 0;\\n if(a < b) return 0;\\n return prd(a) * invprd(b) * invprd(a - b);\\n}\\nmint P(int a, int b) {\\n if(a < 0 || b < 0) return 0;\\n if(a < b) return 0;\\n return prd(a) * invprd(a - b);\\n}\\nostream &operator<<(ostream &os, mint a) {\\n os << a.a;\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> a) {\\n for(auto &e : a) os << e << \\\" \\\";\\n return os;\\n}\\nmint operator*(ll x, mint y) { return y * x; }\\nistream &operator>>(istream &is, mint &a) {\\n ll x;\\n is >> x;\\n a = x;\\n return is;\\n}\\nmint proot = 3;\\n\\nvoid FMT(vmint &f, const bool is_inv = false) {\\n const int n = f.size();\\n const mint root = is_inv ? inv(proot) : proot;\\n vmint g(n);\\n for(int b = n >> 1; b > 0; b >>= 1) {\\n mint a = root ^ ((MOD - 1) / (n / b)), p = 1;\\n for(int i = 0; i < n; i += b << 1) {\\n rep(j, b) {\\n f[i + j + b] *= p;\\n g[(i >> 1) + j] = f[i + j] + f[i + b + j];\\n g[(n >> 1) + (i >> 1) + j] = f[i + j] - f[i + b + j];\\n }\\n p *= a;\\n }\\n swap(f, g);\\n }\\n if(is_inv) rep(i, n) f[i] *= inv(n);\\n}\\n\\nvmint mul(vmint x, const vmint &y) {\\n int n = x.size() + y.size() - 1;\\n int s = 1;\\n while(s < n) s <<= 1;\\n x.resize(s);\\n FMT(x);\\n vmint z(s);\\n rep(i, y.size()) z[i] = y[i];\\n FMT(z);\\n rep(i, s) x[i] *= z[i];\\n FMT(x, true);\\n x.resize(n);\\n return x;\\n}\\n\\nusing Poly = vmint;\\nPoly operator-(Poly f) {\\n for(auto &&e : f) e = -e;\\n return f;\\n}\\nPoly &operator+=(Poly &l, const Poly &r) {\\n l.resize(max(l.size(), r.size()));\\n rep(i, r.size()) l[i] += r[i];\\n return l;\\n}\\nPoly operator+(Poly l, const Poly &r) { return l += r; }\\nPoly &operator-=(Poly &l, const Poly &r) {\\n l.resize(max(l.size(), r.size()));\\n rep(i, r.size()) l[i] -= r[i];\\n return l;\\n}\\nPoly operator-(Poly l, const Poly &r) { return l -= r; }\\nPoly &operator<<=(Poly &f, size_t n) { return f.insert(f.begin(), n, 0), f; }\\nPoly operator<<(Poly f, size_t n) { return f <<= n; }\\nPoly &operator>>=(Poly &f, size_t n) { return f.erase(f.begin(), f.begin() + min(f.size(), n)), f; }\\nPoly operator>>(Poly f, size_t n) { return f >>= n; }\\nPoly operator*(const Poly &l, const Poly &r) { return mul(l, r); }\\nPoly &operator*=(Poly &l, const Poly &r) { return l = l * r; }\\nPoly inv(const Poly &f) {\\n Poly g{1 / f[0]};\\n while(g.size() < f.size()) {\\n Poly x(f.begin(), f.begin() + min(f.size(), g.size() << 1)), y = g;\\n x.resize(g.size() << 1), FMT(x);\\n y.resize(g.size() << 1), FMT(y);\\n rep(i, x.size()) x[i] *= y[i];\\n FMT(x, true);\\n x >>= g.size();\\n x.resize(g.size() << 1), FMT(x);\\n rep(i, x.size()) x[i] *= -y[i];\\n FMT(x, true);\\n g.insert(g.end(), x.begin(), x.begin() + g.size());\\n }\\n return Poly{begin(g), begin(g) + f.size()};\\n}\\nPoly integ(const Poly &f) {\\n Poly res(f.size() + 1);\\n for(int i = 1; i < (int)res.size(); ++i) res[i] = f[i - 1] / i;\\n return res;\\n}\\nPoly deriv(const Poly &f) {\\n if(f.size() == 0) return Poly();\\n Poly res(f.size() - 1);\\n rep(i, res.size()) res[i] = f[i + 1] * (i + 1);\\n return res;\\n}\\nPoly log(const Poly &f) {\\n Poly g = integ(inv(f) * deriv(f));\\n return Poly{g.begin(), g.begin() + f.size()};\\n}\\nPoly exp(const Poly &f) {\\n Poly g{1};\\n while(g.size() < f.size()) {\\n Poly x(f.begin(), f.begin() + min(f.size(), g.size() * 2));\\n x[0] += 1;\\n g.resize(2 * g.size());\\n x -= log(g);\\n x *= {g.begin(), g.begin() + g.size() / 2};\\n rep2(i, g.size() / 2, min<int>(x.size(), g.size()) - 1) g[i] = x[i];\\n }\\n return {g.begin(), g.begin() + f.size()};\\n}\\n\\n} // namespace modular\\nusing namespace modular;\\nint main() {\\n INT(n, m, k, f);\\n vi a(m), b(m), c(m);\\n rep(i, m) cin >> a[i] >> b[i] >> c[i];\\n mint ans = 1;\\n int t = n + (n - 1) * 2;\\n int s = 0;\\n rep(i, m) if(abs(a[i] - b[i]) <= 1) s++;\\n rep(i, k) {\\n int cnt = 0;\\n rep(j, m) {\\n if(c[j] & 1 << i and abs(a[j] - b[j]) <= 1) cnt++;\\n }\\n if(f & 1 << i) {\\n if(cnt)\\n ans *= modpow(2, n * n - m);\\n else\\n ans *= modpow(2, n * n - t - (m - s)) * (modpow(2, t - s) - 1);\\n } else {\\n if(cnt)\\n ans = 0;\\n else {\\n ans *= modpow(2, n * n - t - (m - s));\\n }\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4344,\n \"score_of_the_acc\": -0.0734,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3159_4834120\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define be(v) (v).begin(),(v).end()\\n#define pb(q) push_back(q)\\ntypedef long long ll;\\nusing namespace std;\\nconst ll mod=998244353, INF=(1LL<<60);\\n#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;\\n\\nlong long modpow(long long a, long long n) {\\n long long res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a % mod;\\n a = a * a % mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\n\\n///////modint\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\\n mint operator+(const mint a) const { return mint(*this) += a;}\\n mint operator-(const mint a) const { return mint(*this) -= a;}\\n mint operator*(const mint a) const { return mint(*this) *= a;}\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\n // for prime mod\\n mint inv() const { return pow(mod-2);}\\n mint& operator/=(const mint a) { return *this *= a.inv();}\\n mint operator/(const mint a) const { return mint(*this) /= a;}\\n};\\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\\n\\n\\n\\nint main() {\\n cin.tie(0);\\n cout.tie(0);\\n ios::sync_with_stdio(false);\\n ll n, m, k, f;\\n cin >> n >> m >> k >> f;\\n ll a, b, c;\\n ll cnt = (n - 1) * 2 + n, maki = n * n - cnt;\\n bool ok[k];\\n memset(ok, 0, sizeof(ok));\\n for(int i=0;i<m;i++){\\n cin >> a >> b >> c;\\n bool niko = (abs(a - b) <= 1);\\n if(niko) cnt--;\\n else maki--;\\n for(int j=0;j<k;j++){\\n if((c >> j & 1) && niko){\\n ok[j] = true;\\n }\\n }\\n }\\n mint ans = mint(1);\\n\\n for(int i=0;i<k;i++){\\n if(f >> i & 1){\\n if(ok[i]){\\n ans *= mint(modpow(2LL, cnt + maki));\\n }else{\\n ans *= mint(modpow(2LL, maki));\\n ans *= mint(modpow(2LL, cnt) - 1);\\n }\\n }else{\\n if(ok[i]){\\n ans = mint(0);\\n }else{\\n ans *= mint(modpow(2LL, maki));\\n }\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3208,\n \"score_of_the_acc\": -0.2072,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3159_4834102\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define be(v) (v).begin(),(v).end()\\n#define pb(q) push_back(q)\\ntypedef long long ll;\\nusing namespace std;\\nconst ll mod=998244353, INF=(1LL<<60);\\n#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;\\n\\nlong long modpow(long long a, long long n) {\\n long long res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a % mod;\\n a = a * a % mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\n\\n///////modint\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\\n mint operator+(const mint a) const { return mint(*this) += a;}\\n mint operator-(const mint a) const { return mint(*this) -= a;}\\n mint operator*(const mint a) const { return mint(*this) *= a;}\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\n // for prime mod\\n mint inv() const { return pow(mod-2);}\\n mint& operator/=(const mint a) { return *this *= a.inv();}\\n mint operator/(const mint a) const { return mint(*this) /= a;}\\n};\\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\\n\\n\\n\\nint main() {\\n cin.tie(0);\\n cout.tie(0);\\n ios::sync_with_stdio(false);\\n ll n, m, k, f;\\n cin >> n >> m >> k >> f;\\n ll a, b, c[m];\\n ll cnt = (n - 1) * 2, maki = n * n - cnt;\\n bool ok[k];\\n memset(ok, 0, sizeof(ok));\\n for(int i=0;i<m;i++){\\n cin >> a >> b >> c[i];\\n bool niko = (abs(a - b) <= 1);\\n if(niko) cnt--;\\n else maki--;\\n for(int j=0;j<k;j++){\\n if((c[i] >> j & 1) && niko){\\n ok[j] = true;\\n }\\n }\\n }\\n mint ans = mint(1);\\n\\n for(int i=0;i<k;i++){\\n if(f >> i & 1){\\n if(ok[i]){\\n ans *= mint(modpow(2LL, cnt + maki));\\n }else{\\n ans *= mint(modpow(2LL, maki));\\n ans *= mint(modpow(2LL, cnt) - 1);\\n }\\n }else{\\n if(ok[i]){\\n ans = mint(0);\\n }else{\\n ans *= mint(modpow(2LL, maki));\\n }\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.3026315789473684,\n \"time_ms\": 10,\n \"memory_kb\": 3844,\n \"score_of_the_acc\": -0.0443,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3159_4833747\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\ntypedef pair<int,int> P;\\nint INF = 1e18;\\nint mod = 998244353;\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\nint mod_pow(int x,int y) {\\n int res = 1;\\n while(y > 0) {\\n if(y%2) {\\n res = res*x%mod;\\n }\\n x = x*x%mod;\\n y/=2;\\n }\\n return res;\\n}\\nint fac[2500], finv[2500], inv[2500];\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < 2500; i++){\\n fac[i] = fac[i - 1] * i % mod;\\n inv[i] = mod - inv[mod%i] * (mod / i) % mod;\\n finv[i] = finv[i - 1] * inv[i] % mod;\\n }\\n}\\nint COM(int n, int k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\nsigned main() {\\n int N,M,K,F;\\n cin >> N >> M >> K >> F;\\n int X = 0;\\n vector<bool>ok(35,true);\\n for(int i = 0; i < 35; i++) {\\n ok[i] = (1^(F >> i));\\n if(1 & (F >> i)) {\\n X++;\\n }\\n }\\n COMinit();\\n for(int i = 0; i < M; i++) {\\n int a,b,c;\\n cin >> a >> b >> c;\\n for(int j = 0; j < 35; j++) {\\n if(1 & (c >> j)) {\\n if((F >> j) == 0) {\\n cout << 0 << endl;\\n return 0;\\n }\\n ok[j] = true;\\n }\\n }\\n }\\n int cnt = 0;\\n for(int i = 0; i < 35; i++) {\\n if(!ok[i]) {\\n cnt++;\\n }\\n }\\n int ng = 0;\\n for(int i = 0; i < cnt; i++) {\\n ng += mod_pow(2,X-cnt)*COM(cnt,i)%mod;\\n ng %= mod;\\n }\\n cout << (mod_pow(mod_pow(2,X),N*N-M)+mod-ng)%mod << endl;\\n}\",\n \"accuracy\": 0.039473684210526314,\n \"time_ms\": 10,\n \"memory_kb\": 3152,\n \"score_of_the_acc\": -0.004,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3159_4833737\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\ntypedef pair<int,int> P;\\nint INF = 1e18;\\nint mod = 998244353;\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\nint mod_pow(int x,int y) {\\n int res = 1;\\n while(y > 0) {\\n if(y%2) {\\n res = res*x%mod;\\n }\\n x = x*x%mod;\\n y/=2;\\n }\\n return res;\\n}\\nint fac[2500], finv[2500], inv[2500];\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < 2500; i++){\\n fac[i] = fac[i - 1] * i % mod;\\n inv[i] = mod - inv[mod%i] * (mod / i) % mod;\\n finv[i] = finv[i - 1] * inv[i] % mod;\\n }\\n}\\nint COM(int n, int k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\nsigned main() {\\n int N,M,K,F;\\n cin >> N >> M >> K >> F;\\n int X = 0;\\n vector<bool>ok(35,true);\\n for(int i = 0; i < 35; i++) {\\n ok[i] = (1^(F >> i));\\n if(1 & (F >> i)) {\\n X++;\\n }\\n }\\n COMinit();\\n for(int i = 0; i < M; i++) {\\n int a,b,c;\\n cin >> a >> b >> c;\\n for(int j = 0; j < 35; j++) {\\n if(1 & (c >> j)) {\\n if((F >> j) == 0) {\\n cout << 0 << endl;\\n return 0;\\n }\\n ok[j] = true;\\n }\\n }\\n }\\n int cnt = 0;\\n for(int i = 0; i < 35; i++) {\\n if(!ok[i]) {\\n cnt++;\\n }\\n }\\n int ng = 0;\\n for(int i = 0; i < cnt; i++) {\\n if(i%2 == 0) {\\n ng += mod_pow(2,X-cnt)*COM(cnt,i)%mod;\\n }\\n else {\\n ng = (ng+mod-mod_pow(2,X-cnt)*COM(cnt,i))%mod;\\n }\\n }\\n cout << (mod_pow(mod_pow(2,X),N*N-M)+mod-ng)%mod << endl;\\n}\",\n \"accuracy\": 0.039473684210526314,\n \"time_ms\": 10,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.0054,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3159_4833736\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\n#include <utility>\\n\\nnamespace atcoder {\\n\\n namespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\n constexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) { x += m; }\\n return x;\\n }\\n\\n// Fast moduler by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\n struct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m`\\n barrett(unsigned int m) : _m(m), im((unsigned long long) (-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long) (((unsigned __int128) (z) * im) >> 64);\\n#endif\\n unsigned int v = (unsigned int) (z - x * _m);\\n if (_m <= v) { v += _m; }\\n return v;\\n }\\n };\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\n constexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) { return 0; }\\n unsigned int _m = (unsigned int) (m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) { r = (r * y) % _m; }\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n }\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\n constexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) { return false; }\\n if (n == 2 || n == 7 || n == 61) { return true; }\\n if (n % 2 == 0) { return false; }\\n long long d = n - 1;\\n while (d % 2 == 0) { d /= 2; }\\n for (long long a : {2, 7, 61}) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n }\\n template<int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\n constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) { return {b, 0}; }\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) { m0 += b / s; }\\n return {s, m0};\\n }\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\n constexpr int primitive_root_constexpr(int m) {\\n if (m == 2) { return 1; }\\n if (m == 167772161) { return 3; }\\n if (m == 469762049) { return 3; }\\n if (m == 754974721) { return 11; }\\n if (m == 998244353) { return 3; }\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) { x /= 2; }\\n for (int i = 3; (long long) (i) * i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) { return g; }\\n }\\n }\\n template<int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n } // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\n namespace internal {\\n\\n#ifndef _MSC_VER\\n template<class T>\\n using is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\n template<class T>\\n using is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\n template<class T>\\n using make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\n template<class T>\\n using is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\n template<class T>\\n using is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\n template<class T>\\n using is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\n template<class T>\\n using to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\n template <class T> using is_integral = typename std::is_integral<T>;\\n\\n template <class T>\\n using is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\n template <class T>\\n using is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\n template <class T>\\n using to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\n template<class T>\\n using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\n template<class T>\\n using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\n template<class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n } // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\n namespace internal {\\n\\n struct modint_base {};\\n struct static_modint_base : modint_base {};\\n\\n template<class T> using is_modint = std::is_base_of<modint_base, T>;\\n template<class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n } // namespace internal\\n\\n template<int m, std::enable_if_t<(1 <= m)> * = nullptr>\\n struct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template<class T, internal::is_signed_int_t<T> * = nullptr>\\n static_modint(T v) {\\n long long x = (long long) (v % (long long) (umod()));\\n if (x < 0) { x += umod(); }\\n _v = (unsigned int) (x);\\n }\\n template<class T, internal::is_unsigned_int_t<T> * = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int) (v % umod());\\n }\\n static_modint(bool v) { _v = ((unsigned int) (v) % umod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint &operator++() {\\n _v++;\\n if (_v == umod()) { _v = 0; }\\n return *this;\\n }\\n mint &operator--() {\\n if (_v == 0) { _v = umod(); }\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) { _v -= umod(); }\\n return *this;\\n }\\n mint &operator-=(const mint &rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) { _v += umod(); }\\n return *this;\\n }\\n mint &operator*=(const mint &rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int) (z % umod());\\n return *this;\\n }\\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) { r *= x; }\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint &lhs, const mint &rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint &lhs, const mint &rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint &lhs, const mint &rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint &lhs, const mint &rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint &lhs, const mint &rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint &lhs, const mint &rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n };\\n\\n template<int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int) (bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template<class T, internal::is_signed_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long) (v % (long long) (mod()));\\n if (x < 0) { x += mod(); }\\n _v = (unsigned int) (x);\\n }\\n template<class T, internal::is_unsigned_int_t<T> * = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int) (v % mod());\\n }\\n dynamic_modint(bool v) { _v = ((unsigned int) (v) % mod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint &operator++() {\\n _v++;\\n if (_v == umod()) { _v = 0; }\\n return *this;\\n }\\n mint &operator--() {\\n if (_v == 0) { _v = umod(); }\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint &operator+=(const mint &rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) { _v -= umod(); }\\n return *this;\\n }\\n mint &operator-=(const mint &rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) { _v -= umod(); }\\n return *this;\\n }\\n mint &operator*=(const mint &rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) { r *= x; }\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint &lhs, const mint &rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint &lhs, const mint &rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint &lhs, const mint &rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint &lhs, const mint &rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint &lhs, const mint &rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint &lhs, const mint &rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n };\\n template<int id> internal::barrett dynamic_modint<id>::bt = 998244353;\\n\\n using modint998244353 = static_modint<998244353>;\\n using modint1000000007 = static_modint<1000000007>;\\n using modint = dynamic_modint<-1>;\\n\\n namespace internal {\\n\\n template<class T>\\n using is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\n template<class T>\\n using is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\n template<class> struct is_dynamic_modint : public std::false_type {};\\n template<int id>\\n struct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\n template<class T>\\n using is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n } // namespace internal\\n\\n} // namespace atcoder\\n\\nusing namespace atcoder;\\n\\n#define int long long\\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\\n#define reps(i, n) for (int i = 1; i <= (int) (n); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define uniq(x) (x).erase(unique(all(x)), (x).end())\\n#define bit(n) (1LL << (n))\\n#define dump(x) cerr << #x \\\" = \\\" << (x) << endl\\nusing vint = vector<int>;\\nusing vvint = vector<vint>;\\nusing pint = pair<int, int>;\\nusing vpint = vector<pint>;\\ntemplate<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr double PI = 3.1415926535897932384626433832795028;\\nconstexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};\\nconstexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};\\nint sign(int x) { return (x > 0) - (x < 0); }\\nint gcd(int a, int b) {\\n while (b) { swap(a %= b, b); }\\n return a;\\n}\\nint lcm(int a, int b) { return a / gcd(a, b) * b; }\\nint cdiv(int a, int b) { return (a - 1 + b) / b; }\\ntemplate<typename T> void fin(T mes) {\\n cout << mes << endl;\\n exit(0);\\n}\\ntemplate<typename T> T sq(T x) { return x * x; }\\ntemplate<typename T, typename U> bool chmax(T &a, const U &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<typename T, typename U> bool chmin(T &a, const U &b) {\\n if (b < a) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\\n os << \\\"(\\\" << rhs.first << \\\", \\\" << rhs.second << \\\")\\\";\\n return os;\\n}\\ntemplate<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {\\n os << \\\"{\\\";\\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\\n os << *itr << (next(itr) != rhs.end() ? \\\", \\\" : \\\"\\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {\\n os << \\\"{\\\";\\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\\n os << *itr << (next(itr) != rhs.end() ? \\\", \\\" : \\\"\\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {\\n os << \\\"{\\\";\\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\\n os << *itr << (next(itr) != rhs.end() ? \\\", \\\" : \\\"\\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate<typename T> ostream &operator<<(ostream &os, const multiset<T> &rhs) {\\n os << \\\"{\\\";\\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\\n os << *itr << (next(itr) != rhs.end() ? \\\", \\\" : \\\"\\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {\\n os << \\\"{\\\";\\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\\n os << *itr << (next(itr) != rhs.end() ? \\\", \\\" : \\\"\\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\nstruct setup {\\n static constexpr int PREC = 20;\\n setup() {\\n cout << fixed << setprecision(PREC);\\n cerr << fixed << setprecision(PREC);\\n };\\n} setup;\\n\\nusing mint = modint998244353;\\n\\nsigned main() {\\n int N, M, K, F;\\n cin >> N >> M >> K >> F;\\n int x = 0, hasi = (N - 2) * (N - 1);\\n int hoge = 0;\\n rep(i, M) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n if (abs(a - b) > 1) {\\n hoge++;\\n continue;\\n }\\n x |= c;\\n }\\n M -= hoge;\\n if (F != (F | x)) { fin(0); }\\n int cnt = __builtin_popcountll(F ^ x);\\n int p = __builtin_popcountll(x);\\n fin((((mint(2).pow(hasi - hoge).pow(K)) * (mint(2).pow(N * N - hasi - M) - 1).pow(cnt))\\n * (mint(2).pow(N * N - hasi - M).pow(p))).val());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3464,\n \"score_of_the_acc\": -0.6221,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3159_4833695\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\ntypedef pair<int,int> P;\\nint INF = 1e18;\\nint mod = 998244353;\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\nint mod_pow(int x,int y) {\\n int res = 1;\\n while(y > 0) {\\n if(y%2) {\\n res = res*x%mod;\\n }\\n x = x*x%mod;\\n y/=2;\\n }\\n return res;\\n}\\nint fac[2500], finv[2500], inv[2500];\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < 2500; i++){\\n fac[i] = fac[i - 1] * i % mod;\\n inv[i] = mod - inv[mod%i] * (mod / i) % mod;\\n finv[i] = finv[i - 1] * inv[i] % mod;\\n }\\n}\\nint COM(int n, int k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\nsigned main() {\\n int N,M,K,F;\\n cin >> N >> M >> K >> F;\\n int X = 0;\\n vector<bool>ok(35,true);\\n for(int i = 0; i < 35; i++) {\\n ok[i] = (1^(F >> i));\\n if(1 & (F >> i)) {\\n X++;\\n }\\n }\\n COMinit();\\n for(int i = 0; i < M; i++) {\\n int a,b,c;\\n cin >> a >> b >> c;\\n for(int j = 0; j < 35; j++) {\\n if(1 & (c >> j)) {\\n if((F >> j) == 0) {\\n cout << 0 << endl;\\n return 0;\\n }\\n ok[j] = true;\\n }\\n }\\n }\\n int cnt = 0;\\n for(int i = 0; i < 35; i++) {\\n if(!ok[i]) {\\n cnt++;\\n }\\n }\\n int ng = 0;\\n for(int i = 1; i <= cnt; i++) {\\n if(i%2 == cnt%2) {\\n ng += mod_pow(2,X-i)*COM(cnt,i)%mod;\\n }\\n else {\\n ng = (ng+mod-mod_pow(2,X-i)*COM(cnt,i))%mod;\\n }\\n }\\n cout << (mod_pow(mod_pow(2,X),N*N-M)+mod-ng)%mod << endl;\\n}\",\n \"accuracy\": 0.039473684210526314,\n \"time_ms\": 10,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -0.0033,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3159_4833691\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\ntypedef pair<int,int> P;\\nint INF = 1e18;\\nint mod = 998244353;\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\nint mod_pow(int x,int y) {\\n int res = 1;\\n while(y > 0) {\\n if(y%2) {\\n res = res*x%mod;\\n }\\n x = x*x%mod;\\n y/=2;\\n }\\n return res;\\n}\\nint fac[2500], finv[2500], inv[2500];\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < 2500; i++){\\n fac[i] = fac[i - 1] * i % mod;\\n inv[i] = mod - inv[mod%i] * (mod / i) % mod;\\n finv[i] = finv[i - 1] * inv[i] % mod;\\n }\\n}\\nint COM(int n, int k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\nsigned main() {\\n int N,M,K,F;\\n cin >> N >> M >> K >> F;\\n int X = 0;\\n vector<bool>ok(35,true);\\n for(int i = 0; i < 35; i++) {\\n ok[i] = (1^(F >> i));\\n if(1 & (F >> i)) {\\n X++;\\n }\\n }\\n COMinit();\\n for(int i = 0; i < M; i++) {\\n int a,b,c;\\n cin >> a >> b >> c;\\n for(int j = 0; j < 35; j++) {\\n if(1 & (c >> j)) {\\n if((F >> j) == 0) {\\n cout << 0 << endl;\\n return 0;\\n }\\n ok[j] = true;\\n }\\n }\\n }\\n int cnt = 0;\\n for(int i = 0; i < 35; i++) {\\n if(!ok[i]) {\\n cnt++;\\n }\\n }\\n int ng = 0;\\n for(int i = 1; i <= cnt; i++) {\\n if(i%2 == 1) {\\n ng += mod_pow(2,X-i)*COM(cnt,i)%mod;\\n }\\n if(i%2 == 0) {\\n ng = (ng+mod-mod_pow(2,X-i)*COM(cnt,i))%mod;\\n }\\n }\\n cout << (mod_pow(mod_pow(2,X),N*N-M)+mod-ng)%mod << endl;\\n}\",\n \"accuracy\": 0.039473684210526314,\n \"time_ms\": 10,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -0.0042,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":1980,"cells":{"group_id":{"kind":"string","value":"aoj_3165_cpp"},"problem_description":{"kind":"string","value":"B: 三角形足し算\n問題\n長さ $N$ の数列 $A = (a_1, ..., a_N)$ があり、値は最初全て $0$ である。\n数列 $A$ に対して、以下で説明するクエリを $Q$ 回行う。\n二つの正整数 $l$, $k$ が与えられる。$0 \\leq i < k$ を満たす各整数 $i$ に対して $a_{l+i}$ に $i+1$ を加算する。\n$Q$ 回のクエリを順に処理した後の数列 $A$ を出力せよ。\n入力形式\n入力は $Q + 1$ 行で与えられる。\n$N$ $Q$\n$l_1$ $k_1$\n$l_2$ $k_2$\n...\n$l_Q$ $k_Q$\n$1$ 行目には、数列の長さ $N$ とクエリの数 $Q$ が空白区切りで与えられる。\n続く $Q$ 行には、各 $l$ と $k$ が空白区切りで与えられる。$l_i$ 及び $k_i$ はそれぞれ $i$ 番目のクエリの $l$ 及び $k$ を表す。\n制約\n入力は全て整数で与えられる\n$1 \\leq N \\leq 2 \\times 10^5$\n$1 \\leq Q \\leq 2 \\times 10^5$\n$2 \\leq l_i + k_i \\leq N + 1$ ($1\\leq i\\leq Q$)\n$1 \\leq l_i$ ($1\\leq i\\leq Q$)\n$1 \\leq k_i$ ($1\\leq i\\leq Q$)\n出力形式\nクエリを処理し終えた後の $A$ の各要素を、$1$ 番目から順番に半角スペース区切りで一行に出力せよ。\n入力例1\n4 1\n2 3\n出力例1\n0 1 2 3\nこのクエリにおいて、$A$ の添字 $2 \\leq i < 2+3$ の部分が変化する。\nまず $a_2$ に $1$ 加算する。\n次に $a_3$ に $2$ 加算する。\n最後に $a_4$ に $3$ 加算する。\n結果、できる数列は $(0, 1, 2, 3)$ である。\n入力例2\n8 3\n1 2\n2 4\n3 6\n出力例2\n1 3 3 5 7 4 5 6\n入力例3\n10 15\n1 2\n2 3\n3 2\n3 2\n3 2\n3 2\n3 2\n4 3\n5 3\n5 2\n5 2\n5 2\n7 2\n8 2\n9 2\n出力例3\n1 3 7 14 6 11 4 3 3 2\nここにそのような例を載せることはできませんが、オーバーフローには注意してください。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3165_10637653","code_snippet":"#pragma region Macros\n#include <bits/stdc++.h>\n\nusing namespace std;\nusing lint = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing int128 = __int128_t;\n#define all(x) (x).begin(), (x).end()\n#define EPS 1e-8\n#define uniqv(v) v.erase(unique(all(v)), v.end())\n#define OVERLOAD_REP(_1, _2, _3, name, ...) name\n#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))\n#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\n#define log(x) cout << x << endl\n#define logfixed(x) cout << fixed << setprecision(10) << x << endl;\n#define logy(bool) \\\n if (bool) { \\\n cout << \"Yes\" << endl; \\\n } else { \\\n cout << \"No\" << endl; \\\n }\n\nostream &operator<<(ostream &dest, __int128_t value) {\n ostream::sentry s(dest);\n if (s) {\n __uint128_t tmp = value < 0 ? -value : value;\n char buffer[128];\n char *d = end(buffer);\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n if (value < 0) {\n --d;\n *d = '-';\n }\n int len = end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(ios_base::badbit);\n }\n }\n return dest;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (int i = 0; i < (int)v.size(); i++) {\n os << v[i] << (i + 1 != (int)v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const set<T> &set_var) {\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end()) os << \" \";\n itr--;\n }\n return os;\n}\n\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << itr->first << \" -> \" << itr->second << \"\\n\";\n }\n return os;\n}\n\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &pair_var) {\n os << \"(\" << pair_var.first << \", \" << pair_var.second << \")\";\n return os;\n}\n\nvoid out() { cout << '\\n'; }\ntemplate <class T, class... Ts>\nvoid out(const T &a, const Ts &...b) {\n cout << a;\n (cout << ... << (cout << ' ', b));\n cout << '\\n';\n}\n\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (T &in : v) is >> in;\n return is;\n}\n\ninline void in(void) { return; }\ntemplate <typename First, typename... Rest>\nvoid in(First &first, Rest &...rest) {\n cin >> first;\n in(rest...);\n return;\n}\n\ntemplate <typename T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nvector<lint> dx8 = {1, 1, 0, -1, -1, -1, 0, 1};\nvector<lint> dy8 = {0, 1, 1, 1, 0, -1, -1, -1};\nvector<lint> dx4 = {1, 0, -1, 0};\nvector<lint> dy4 = {0, 1, 0, -1};\n\n#pragma endregion\n\ntemplate <class S,\n auto op,\n auto e,\n class F,\n auto mapping,\n auto composition,\n auto id>\nstruct lazy_segtree {\n private:\n unsigned int seg_bit_ceil(unsigned int n) {\n unsigned int x = 1;\n while (x < (unsigned int)(n)) x *= 2;\n return x;\n }\n\n public:\n static_assert(std::is_convertible_v<decltype(op), std::function<S(S, S)>>,\n \"op must work as S(S, S)\");\n static_assert(std::is_convertible_v<decltype(e), std::function<S()>>,\n \"e must work as S()\");\n static_assert(\n std::is_convertible_v<decltype(mapping), std::function<S(F, S)>>,\n \"mapping must work as F(F, S)\");\n static_assert(\n std::is_convertible_v<decltype(composition), std::function<F(F, F)>>,\n \"compostiion must work as F(F, F)\");\n static_assert(std::is_convertible_v<decltype(id), std::function<F()>>,\n \"id must work as F()\");\n lazy_segtree() : lazy_segtree(0) {}\n explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n explicit lazy_segtree(const std::vector<S> &v) : _n(int(v.size())) {\n size = (int)seg_bit_ceil((unsigned int)(_n));\n log = __builtin_ctz((unsigned int)size);\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)>\n int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G>\n int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)>\n int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G>\n int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\n\nclass RangeLinearAddRangeSum {\n private:\n static constexpr long long INF = 8e18;\n static constexpr int INFI = int(1e9) + 10;\n\n struct S {\n long long sum;\n int l, r;\n };\n struct F {\n long long a, b;\n };\n\n static S op(S a, S b) {\n return S{a.sum + b.sum, min(a.l, b.l), max(a.r, b.r)};\n }\n static S e() {\n return S{0, INFI, -INFI};\n }\n\n static S mapping(F f, S s) {\n return {s.sum + (f.a * (s.l + s.r - 1) + f.b * 2) * (s.r - s.l) / 2, s.l, s.r};\n }\n\n static F composition(F f, F g) {\n return {f.a + g.a, f.b + g.b};\n }\n\n static F id() {\n return F{0, 0};\n }\n\n lazy_segtree<S, op, e, F, mapping, composition, id> seg;\n\n public:\n RangeLinearAddRangeSum(const vector<long long> &v) {\n int n = int(v.size());\n vector<S> tmp(n);\n for (int i = 0; i < n; i++) {\n tmp[i].l = i;\n tmp[i].r = i + 1;\n tmp[i].sum = v[i];\n }\n seg = lazy_segtree<S, op, e, F, mapping, composition, id>(tmp);\n }\n\n void set(int i, S x) {\n seg.set(i, x);\n }\n S get(int i) {\n return seg.get(i);\n }\n S all_prod() {\n return seg.all_prod();\n }\n S prod(int l, int r) {\n return seg.prod(l, r);\n }\n void apply(int l, int r, F f) {\n seg.apply(l, r, F{f.a, f.b - f.a * get(l).l});\n }\n void apply(int i, F f) {\n seg.apply(i, F{f.a, f.b - f.a * get(i).l});\n }\n\n template <bool (*g)(S)>\n int max_right(int l) {\n return seg.max_right(l, [](S x) { return g(x); });\n }\n template <bool (*g)(S)>\n int min_left(int r) {\n return seg.min_left(r, [](S x) { return g(x); });\n }\n};\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n int n, q;\n in(n, q);\n vector<long long> v(n);\n RangeLinearAddRangeSum seg(v);\n\n rep(i, q) {\n int l, k;\n in(l, k);\n l--;\n seg.apply(l, l + k, {1, 1});\n }\n\n vector<long long> res(n);\n rep(i, n) {\n res[i] = seg.get(i).sum;\n }\n\n out(res);\n}","accuracy":1,"time_ms":150,"memory_kb":20168,"score_of_the_acc":-1.1462,"final_rank":16},{"submission_id":"aoj_3165_10114656","code_snippet":"#include <vector>\n#include <numeric>\n#include <algorithm>\n#include <functional>\n#include <cassert>\n#include <limits>\n\nconstexpr int bit_ceil_log(unsigned int n) {\n int x = 0;\n while ((1 << x) < (unsigned int)(n)) x++;\n return x;\n}\n\ntemplate <typename T>\nstruct linear_add_range_sum {\n private:\n struct node {\n T sum, lza, lzb;\n long long isum;\n int sz;\n node(int i = -1, T v = 0) : sum(v), lza(0), lzb(0), isum(i == -1 ? 0 : i), sz(i == -1 ? 0 : 1) {}\n };\n\n int _n, size, log;\n std::vector<node> nd;\n\n void all_apply(int k, T a, T b) {\n nd[k].sum += nd[k].isum * a + nd[k].sz * b;\n if (k < size) nd[k].lza += a, nd[k].lzb += b;\n }\n\n void push(int k) {\n all_apply(2 * k, nd[k].lza, nd[k].lzb);\n all_apply(2 * k + 1, nd[k].lza, nd[k].lzb);\n nd[k].lza = nd[k].lzb = 0;\n }\n\n void pull(int k) {\n nd[k].sum = nd[k * 2].sum + nd[k * 2 + 1].sum;\n }\n \n public:\n linear_add_range_sum() : linear_add_range_sum(0) {}\n linear_add_range_sum(int n) : linear_add_range_sum(std::vector<T>(n, 0)) {}\n linear_add_range_sum(const std::vector<T>& v) : _n(int(v.size())) {\n log = bit_ceil_log((unsigned int)_n);\n size = 1 << log;\n nd = std::vector<node>(2 * size);\n for (int i = 0; i < size; i++) nd[size + i] = node(i < _n ? i : -1, i < _n ? v[i] : 0);\n for (int i = size - 1; i >= 1; i--) {\n nd[i].sz = nd[2 * i].sz + nd[2 * i + 1].sz;\n nd[i].isum = nd[2 * i].isum + nd[2 * i + 1].isum;\n nd[i].sum = nd[2 * i].sum + nd[2 * i + 1].sum;\n }\n }\n \n void set(int p, T x) {\n assert(0 <= p && p < _n);\n int P = p;\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n nd[p] = node(P, x);\n for (int i = 1; i <= log; i++) pull(P >> i);\n }\n\n T get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n T a = 0, b = 0;\n for (int i = log; i >= 1; i--) a += nd[p >> i].lza, b += nd[p >> i].lzb;\n return nd[p].sum + nd[p].isum * a + b;\n }\n\n void apply(int l, int r, T a, T b) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n l += size;\n r += size;\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, a, b);\n if (r & 1) all_apply(--r, a, b);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) pull(l >> i);\n if (((r >> i) << i) != r) pull((r - 1) >> i);\n }\n }\n\n // [l, r)のsum\n T prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return 0;\n l += size;\n r += size;\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n T res = 0;\n while (l < r) {\n if (l & 1) res += nd[l++].sum;\n if (r & 1) res += nd[--r].sum;\n l >>= 1;\n r >>= 1;\n }\n return res;\n }\n};\n\n#include <iostream>\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n int N, Q;\n std::cin >> N >> Q;\n linear_add_range_sum<long long> seg(N);\n\n for (int i = 0; i < Q; i++) {\n int l, k;\n std::cin >> l >> k;\n l--;\n seg.apply(l, l + k, 1, -l + 1);\n }\n\n for (int i = 0; i < N; i++) {\n std::cout << seg.get(i) << (i + 1 == N ? \"\\n\" : \" \");\n }\n}","accuracy":1,"time_ms":70,"memory_kb":25164,"score_of_the_acc":-1.1471,"final_rank":17},{"submission_id":"aoj_3165_10071855","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<typename OpMonoid>\nstruct lazy_segtree {\n using S = typename OpMonoid::S;\n using F = typename OpMonoid::F;\n lazy_segtree() : lazy_segtree(0) {}\n lazy_segtree(int _n) : lazy_segtree(vector<S>(_n, OpMonoid::e())) {}\n lazy_segtree(const vector<S> &v) { init(v); }\n void set(const vector<S> &v) { init(v); }\n void set(int p, const S &x) {\n assert(0 <= p && p < n);\n p += sz;\n inner_push(p);\n d[p] = x;\n inner_update(p);\n }\n void apply(int p, const F &f) {\n assert(0 <= p && p < n);\n p += sz;\n inner_push(p);\n d[p] = OpMonoid::mapping(f, d[p]);\n inner_update(p);\n }\n void apply(int l, int r, const F &f) {\n assert(0 <= l && l <=r && r <= n);\n l += sz;\n r += sz;\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2, r = r2;\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n S get(int p) {\n assert(0 <= p && p < n);\n p += sz;\n inner_push(p);\n return d[p];\n }\n S prod(int l, int r) {\n assert(0 <= l && l <=r && r <= n);\n l += sz;\n r += sz;\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n S pl = OpMonoid::e(), pr = OpMonoid::e();\n while (l < r) {\n if (l & 1) pl = OpMonoid::op(pl, d[l++]);\n if (r & 1) pr = OpMonoid::op(d[--r], pr);\n l >>= 1;\n r >>= 1;\n }\n return OpMonoid::op(pl, pr);\n }\n S all_prod() const { return d[1]; }\nprivate:\n int n, log, sz;\n vector<S> d;\n vector<F> lz;\n void init(const vector<S> &v) {\n n = v.size();\n log = 1;\n while ((1 << log) < n) log++;\n sz = 1 << log;\n d = vector<S>(2 * sz, OpMonoid::e());\n lz = vector<F>(sz, OpMonoid::id());\n for (int i = 0; i < n; i++) d[i + sz] = v[i];\n for (int i = sz - 1; i >= 1; i--) update(i);\n }\n void update(int p) {\n d[p] = OpMonoid::op(d[2 * p], d[2 * p + 1]);\n }\n void all_apply(int p, const F &f) {\n d[p] = OpMonoid::mapping(f, d[p]);\n if (p < sz) lz[p] = OpMonoid::comp(f, lz[p]);\n }\n void push(int p) {\n all_apply(2 * p, lz[p]);\n all_apply(2 * p + 1, lz[p]);\n lz[p] = OpMonoid::id();\n }\n void inner_update(int p) {\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void inner_push(int p) {\n for (int i = log; i >= 1; i--) push(p >> i);\n }\n};\n\ntemplate<typename T>\nstruct range_arithmetic_add_range_sum {\n static constexpr int inf = numeric_limits<int>::max() / 2;\n struct S {\n T sm;\n int l, r;\n T sum() const { return sm; }\n S() : S(0, inf, -inf) {}\n S(T x, int p) : S(x, p, p + 1) {}\n S(T _sm, int _l, int _r) : sm(_sm), l(_l), r(_r) {}\n };\n static S op(const S&a, const S &b) {\n S c;\n c.sm = a.sum() + b.sum();\n c.l = min(a.l, b.l);\n c.r = max(a.r, b.r);\n return c;\n }\n static S e() {\n return S();\n }\n struct F {\n T a, b;\n F() : F(0, 0) {}\n F(T _a, T _b) : a(_a), b(_b) {}\n };\n static F comp(const F &f, const F &g) {\n return F(f.a + g.a, f.b + g.b);\n }\n static F id() {\n return F();\n }\n static S mapping(const F &f, const S &x) {\n S y;\n y.sm = x.sm + (f.a * (x.l + x.r - 1) + f.b * 2) * (x.r - x.l) / 2;\n y.l = x.l;\n y.r = x.r;\n return y;\n }\n};\n\nusing M = range_arithmetic_add_range_sum<long long>;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N, Q;\n cin >> N >> Q;\n lazy_segtree<M> seg(N);\n for (int i = 0; i < N; i++) {\n seg.set(i, M::S(0, i));\n }\n while (Q--) {\n int l, k;\n cin >> l >> k;\n l--;\n seg.apply(l, l + k, M::F(1, 1 - l));\n }\n for (int i = 0; i < N; i++) {\n cout << seg.get(i).sum() << \" \\n\"[i + 1 == N];\n }\n}","accuracy":1,"time_ms":150,"memory_kb":18556,"score_of_the_acc":-1.07,"final_rank":15},{"submission_id":"aoj_3165_9870270","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\nprefix sum for AP\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 1000000000;\n\nconst int MAX_N = 200000 + 5;\nstatic int64_t vect[MAX_N];\n\n//------------------------------------------------------------------------------\nvoid solve(int N)\n{\n //--------------------------------------------------------------------------\n // base cases:\n //--------------------------------------------------------------------------\n // init:\n //--------------------------------------------------------------------------\n // compute:\n for (int i=1; i<N+1; ++i) vect[i] += vect[i-1];\n for (int i=1; i<N+1; ++i) vect[i] += vect[i-1];\n\n for (int i=1; i<N; ++i) printf(\"%ld \", vect[i]);\n printf(\"%ld\\n\", vect[N]);\n}\n\n//------------------------------------------------------------------------------\nvoid test()\n{\n\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //test(); return 0;\n //DEBUG = true;\n //--------------------------------------------------------------------------\n int N, Q, K, L, num;\n num = scanf(\"%d %d \", &N, &Q);\n for (int i=0; i<N+5; ++i) vect[i] = 0;\n for (int q=0; q<Q; ++q)\n {\n num = scanf(\"%d %d \", &K, &L);\n vect[K]++;\n vect[K+L] -= L+1;\n vect[K+L+1] += L;\n }\n solve(N);\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":30,"memory_kb":5128,"score_of_the_acc":-0.0824,"final_rank":3},{"submission_id":"aoj_3165_9870265","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\nprefix sum for AP\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 1000000000;\n\nconst int MAX_N = 200000 + 5;\nstatic int vect[MAX_N];\n\n//------------------------------------------------------------------------------\nvoid solve(int N)\n{\n //--------------------------------------------------------------------------\n // base cases:\n //--------------------------------------------------------------------------\n // init:\n //--------------------------------------------------------------------------\n // compute:\n for (int i=1; i<N+1; ++i) vect[i] += vect[i-1];\n for (int i=1; i<N+1; ++i) vect[i] += vect[i-1];\n\n for (int i=1; i<N; ++i) printf(\"%d \", vect[i]);\n printf(\"%d\\n\", vect[N]);\n}\n\n//------------------------------------------------------------------------------\nvoid test()\n{\n\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //test(); return 0;\n //DEBUG = true;\n //--------------------------------------------------------------------------\n int N, Q, K, L, num;\n num = scanf(\"%d %d \", &N, &Q);\n for (int i=0; i<N+5; ++i) vect[i] = 0;\n for (int q=0; q<Q; ++q)\n {\n num = scanf(\"%d %d \", &K, &L);\n vect[K]++;\n vect[K+L] -= L+1;\n vect[K+L+1] += L;\n }\n solve(N);\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------","accuracy":0.38235294117647056,"time_ms":20,"memory_kb":4008,"score_of_the_acc":0,"final_rank":20},{"submission_id":"aoj_3165_8813212","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#pragma GCC target \"no-avx\"\n\n#if USE_MP\n#include <boost/multiprecision/cpp_int.hpp>\n#endif\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_set>\n#include <unordered_map>\n#include <vector>\n#if defined _DEBUG\n//#include \"TestCase.h\"\n//#include \"Util.h\"\n#endif\n\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef tuple<ll, ll, ll> tlll;\ntypedef tuple<int, int, int> tiii;\n\nusing ai2 = array<int, 2>;\nusing ai3 = array<int, 3>;\nusing ai4 = array<int, 4>;\nusing al2 = array<ll, 2>;\nusing al3 = array<ll, 3>;\nusing al4 = array<ll, 4>;\nusing ad2 = array<ld, 2>;\nusing ad3 = array<ld, 3>;\nusing ad4 = array<ld, 4>;\n\ninline void Yes(bool upper = false) { cout << (upper ? \"YES\" : \"Yes\") << \"\\n\"; }\ninline void No(bool upper = false) { cout << (upper ? \"NO\" : \"No\") << \"\\n\"; }\n\ninline ll DivCeil(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -(-nume / deno);\n\telse return (nume + deno - 1) / deno;\n}\ninline ll DivFloor(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -((-nume + deno - 1) / deno);\n\telse return nume / deno;\n}\ninline ll DivRound(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -((-nume + deno / 2) / deno);\n\telse return (nume + deno / 2) / deno;\n}\n\ntemplate <typename T, int S>\nauto MakeVecImpl(queue<int>& size, const T& ini)\n{\n\tif constexpr (S == 1)\n\t{\n\t\treturn vector<T>(size.front(), ini);\n\t}\n\telse\n\t{\n\t\tint fsize = size.front();\n\t\tsize.pop();\n\t\treturn vector(fsize, MakeVecImpl<T, S - 1>(size, ini));\n\t}\n}\n\ntemplate <typename T, int S>\nauto MakeVec(const array<int, S>& size, const T ini = T())\n{\n\tqueue<int> qsize;\n\tfor (const auto v : size) qsize.push(v);\n\treturn MakeVecImpl<T, S>(qsize, ini);\n}\nint d4[][2] =\n{\n\t{0,-1},\n\t{0,1},\n\t{-1,0},\n\t{1,0},\n};\nint d8[][2] =\n{\n\t{-1,-1},\n\t{0,-1},\n\t{1,-1},\n\n\t{-1,0},\n\t{1,0},\n\n\t{-1,1},\n\t{0,1},\n\t{1,1},\n};\nvector<array<int, 2>> Neighbor2(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tret.push_back({ y, x + 1 });\n\tret.push_back({ y + 1, x });\n\treturn ret;\n}\nvector<array<int, 2>> Neighbor4(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\tret.push_back({ y - 1, x });\n\tret.push_back({ y + 1, x });\n\treturn ret;\n}\nvector<array<int, 2>> Neighbor6(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tconst int ofs = (y & 1); // 1 - (y & 1); //\n\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\n\tret.push_back({ y - 1, x - 1 + ofs });\n\tret.push_back({ y - 1, x + ofs });\n\n\tret.push_back({ y + 1, x - 1 + ofs });\n\tret.push_back({ y + 1, x + ofs });\n\n\treturn ret;\n}\nvector<array<int, 2>> Neighbor8(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tret.push_back({ y - 1, x - 1 });\n\tret.push_back({ y - 1, x });\n\tret.push_back({ y - 1, x + 1 });\n\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\n\tret.push_back({ y + 1, x - 1 });\n\tret.push_back({ y + 1, x });\n\tret.push_back({ y + 1, x + 1 });\n\treturn ret;\n}\n\nvector<int> DecompDigit(ull val)\n{\n\tif (val == 0)\n\t\treturn { 0 };\n\n\tvector<int> ret;\n\twhile (val)\n\t{\n\t\tret.emplace_back(val % 10);\n\t\tval /= 10;\n\t}\n\treverse(ret.begin(), ret.end());\n\treturn ret;\n}\n\n\n#define PI 3.14'159'265'358'979l\nlong double R2D = 180 / PI;\nlong double D2R = PI / 180;\n\nstatic const ll Mod = 1'000'000'007;\nstatic const ll Mod9 = 998244353;// 1000000007;\nstatic const ll INF64 = 4'500000'000000'000000;// 10000000000000000;\nstatic const int INF32 = 2'000'000'000;\n\nrandom_device rd;\n//mt19937 mt(rd());\nmt19937 mt(0);\n#if USE_MP\nusing mpint = boost::multiprecision::cpp_int;\n#endif\n\nconst double EPS = 1e-10;\n\nstruct Solver\n{\n\tvoid Run()\n\t{\n\t\tint N, Q;\n\t\tcin >> N >> Q;\n\t\tvector<ll> A(N + 2);\n\t\twhile (Q--) {\n\t\t\tint l, k;\n\t\t\tcin >> l >> k;\n\t\t\tl--;\n\t\t\tA[l]++;\n\t\t\tA[l + k] -= k + 1;\n\t\t\tA[l + k + 1] += k;\n\t\t}\n\t\tfor (int i = 1; i < A.size(); i++) A[i] += A[i - 1];\n\t\tfor (int i = 1; i < A.size(); i++) A[i] += A[i - 1];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tif (i) cout << ' ';\n\t\t\tcout << A[i];\n\t\t}\n\t\tcout << \"\\n\";\n\t}\n};\n\nint main()\n{\n\tstd::cin.tie(nullptr); //★インタラクティブ注意★\n\tstd::ios_base::sync_with_stdio(false);\n\tint T = 1;\n\t//cin >> T;\n\twhile (T--)\n\t{\n\t\tSolver S;\n\t\tS.Run();\n\t}\n\n\treturn 0;\n}\n\n/// 値渡しになっていないか?\n/// 入力を全部読んでいるか? 途中でreturnしない\n/// 32bitで収まるか? 10^5数えるとき\n/// modは正しいか?\n/// multisetでcountしていないか?","accuracy":1,"time_ms":30,"memory_kb":4660,"score_of_the_acc":-0.0602,"final_rank":2},{"submission_id":"aoj_3165_8813205","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#pragma GCC target \"no-avx\"\n\n#if USE_MP\n#include <boost/multiprecision/cpp_int.hpp>\n#endif\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_set>\n#include <unordered_map>\n#include <vector>\n#if defined _DEBUG\n//#include \"TestCase.h\"\n//#include \"Util.h\"\n#endif\n\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef tuple<ll, ll, ll> tlll;\ntypedef tuple<int, int, int> tiii;\n\nusing ai2 = array<int, 2>;\nusing ai3 = array<int, 3>;\nusing ai4 = array<int, 4>;\nusing al2 = array<ll, 2>;\nusing al3 = array<ll, 3>;\nusing al4 = array<ll, 4>;\nusing ad2 = array<ld, 2>;\nusing ad3 = array<ld, 3>;\nusing ad4 = array<ld, 4>;\n\ninline void Yes(bool upper = false) { cout << (upper ? \"YES\" : \"Yes\") << \"\\n\"; }\ninline void No(bool upper = false) { cout << (upper ? \"NO\" : \"No\") << \"\\n\"; }\n\ninline ll DivCeil(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -(-nume / deno);\n\telse return (nume + deno - 1) / deno;\n}\ninline ll DivFloor(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -((-nume + deno - 1) / deno);\n\telse return nume / deno;\n}\ninline ll DivRound(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -((-nume + deno / 2) / deno);\n\telse return (nume + deno / 2) / deno;\n}\n\ntemplate <typename T, int S>\nauto MakeVecImpl(queue<int>& size, const T& ini)\n{\n\tif constexpr (S == 1)\n\t{\n\t\treturn vector<T>(size.front(), ini);\n\t}\n\telse\n\t{\n\t\tint fsize = size.front();\n\t\tsize.pop();\n\t\treturn vector(fsize, MakeVecImpl<T, S - 1>(size, ini));\n\t}\n}\n\ntemplate <typename T, int S>\nauto MakeVec(const array<int, S>& size, const T ini = T())\n{\n\tqueue<int> qsize;\n\tfor (const auto v : size) qsize.push(v);\n\treturn MakeVecImpl<T, S>(qsize, ini);\n}\nint d4[][2] =\n{\n\t{0,-1},\n\t{0,1},\n\t{-1,0},\n\t{1,0},\n};\nint d8[][2] =\n{\n\t{-1,-1},\n\t{0,-1},\n\t{1,-1},\n\n\t{-1,0},\n\t{1,0},\n\n\t{-1,1},\n\t{0,1},\n\t{1,1},\n};\nvector<array<int, 2>> Neighbor2(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tret.push_back({ y, x + 1 });\n\tret.push_back({ y + 1, x });\n\treturn ret;\n}\nvector<array<int, 2>> Neighbor4(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\tret.push_back({ y - 1, x });\n\tret.push_back({ y + 1, x });\n\treturn ret;\n}\nvector<array<int, 2>> Neighbor6(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tconst int ofs = (y & 1); // 1 - (y & 1); //\n\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\n\tret.push_back({ y - 1, x - 1 + ofs });\n\tret.push_back({ y - 1, x + ofs });\n\n\tret.push_back({ y + 1, x - 1 + ofs });\n\tret.push_back({ y + 1, x + ofs });\n\n\treturn ret;\n}\nvector<array<int, 2>> Neighbor8(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tret.push_back({ y - 1, x - 1 });\n\tret.push_back({ y - 1, x });\n\tret.push_back({ y - 1, x + 1 });\n\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\n\tret.push_back({ y + 1, x - 1 });\n\tret.push_back({ y + 1, x });\n\tret.push_back({ y + 1, x + 1 });\n\treturn ret;\n}\n\nvector<int> DecompDigit(ull val)\n{\n\tif (val == 0)\n\t\treturn { 0 };\n\n\tvector<int> ret;\n\twhile (val)\n\t{\n\t\tret.emplace_back(val % 10);\n\t\tval /= 10;\n\t}\n\treverse(ret.begin(), ret.end());\n\treturn ret;\n}\n\n\n#define PI 3.14'159'265'358'979l\nlong double R2D = 180 / PI;\nlong double D2R = PI / 180;\n\nstatic const ll Mod = 1'000'000'007;\nstatic const ll Mod9 = 998244353;// 1000000007;\nstatic const ll INF64 = 4'500000'000000'000000;// 10000000000000000;\nstatic const int INF32 = 2'000'000'000;\n\nrandom_device rd;\n//mt19937 mt(rd());\nmt19937 mt(0);\n#if USE_MP\nusing mpint = boost::multiprecision::cpp_int;\n#endif\n\nconst double EPS = 1e-10;\n\ntemplate <typename DATA, typename LAZY>\nstruct LazySegmentTree\n{\n\tLazySegmentTree(size_t size,\n\t\tDATA unit,\n\t\tLAZY identity,\n\t\tfunction<DATA(DATA, DATA)> dataMergeFunc,\n\t\tfunction<DATA(LAZY, DATA)> evaluationFunc,\n\t\tfunction<LAZY(LAZY, LAZY)> lazyMergeFunc\n\t) : e(unit),\n\t\tI(identity),\n\t\tmergeData(dataMergeFunc),\n\t\tevaluate(evaluationFunc),\n\t\tmergeLazy(lazyMergeFunc),\n\t\tNorg(size)\n\t{\n\t\t// 2べきのサイズを求める\n\t\tN = 1;\n\t\twhile (N < size) N <<= 1;\n\n\t\t// 領域確保\n\t\tdata.resize(2 * N - 1, e);\n\t\tlazy.resize(2 * N - 1, I);\n\n\t\t// 伝搬\n\t\tfor (int i = N - 2; i >= 0; i--)\n\t\t\tdata[i] = mergeData(data[i * 2 + 1], data[i * 2 + 2]);\n\t}\n\tLazySegmentTree(const vector<DATA>& vec,\n\t\tDATA unit,\n\t\tLAZY identity,\n\t\tfunction<DATA(DATA, DATA)> dataMergeFunc,\n\t\tfunction<DATA(LAZY, DATA)> evaluationFunc,\n\t\tfunction<LAZY(LAZY, LAZY)> lazyMergeFunc\n\t) : e(unit),\n\t\tI(identity),\n\t\tmergeData(dataMergeFunc),\n\t\tevaluate(evaluationFunc),\n\t\tmergeLazy(lazyMergeFunc),\n\t\tNorg(vec.size())\n\t{\n\t\t// 2べきのサイズを求める\n\t\tN = 1;\n\t\twhile (N < vec.size()) N <<= 1;\n\n\t\t// 領域確保\n\t\tdata.resize(2 * N - 1, e);\n\t\tlazy.resize(2 * N - 1, I);\n\n\t\t// vecをコピーして伝搬\n\t\tcopy(vec.begin(), vec.end(), data.begin() + N - 1);\n\t\tfor (int i = N - 2; i >= 0; i--)\n\t\t\tdata[i] = mergeData(data[i * 2 + 1], data[i * 2 + 2]);\n\t}\n\n\t// 区間評価\n\tDATA Fold(size_t l, size_t r)\n\t{\n\t\treturn Fold(l, r, 0, 0, N);\n\t}\n\n\t// 区間更新\n\tvoid Update(size_t l, size_t r, LAZY val)\n\t{\n\t\tUpdate(l, r, 0, 0, N, val);\n\t}\n\n#pragma region binary search\n\t// セグメント木上の二分探索\n\t// 区間[l, r)について、IsOKになる最大のrを求める\n\tsize_t MaxRight(size_t l, function<bool(DATA)> IsOK)\n\t{\n\t\tvector<bool> isEvaluated(data.size());\n\t\tauto LazyEvalToRoot = [this, &isEvaluated](size_t idx) {\t// 根に向かって未反映のノードを探し、自分まで辿る\n\t\t\tsize_t cur = idx;\n\t\t\tvector<size_t> target;\n\t\t\twhile (!isEvaluated[cur]) {\n\t\t\t\ttarget.emplace_back(cur);\n\t\t\t\tif (cur == 0) break;\n\t\t\t\tcur = (cur - 1) >> 1;\n\t\t\t}\n\t\t\tfor (int i = target.size() - 1; i >= 0; i--) {\n\t\t\t\tLazyEval(target[i]);\n\t\t\t\tisEvaluated[target[i]] = true;\n\t\t\t}\n\t\t\t};\n\n\t\t// [l, l+1)でも満たさない場合は即終了\n\t\tLazyEvalToRoot(l + N - 1);\n\t\tif (!IsOK(data[l + N - 1])) return l;\n\n\t\t// 二分探索\n\t\tsize_t maxR = N;\n\t\tsize_t curIdx = l + N - 1;\n\t\tsize_t curR = l + 1;\n\t\tDATA curVal = data[curIdx];\n\t\tDATA prvVal = e;\n\t\tsize_t step = 2;\n\n\t\tsize_t nxtR, nxtIdx;\n\t\tDATA nxtVal;\n\n\t\t// 葉から上へ\n\t\twhile (maxR > curR)\n\t\t{\n\t\t\t// 自分が左部分木なら[l, l+step)のstepを増やしていくイメージ\n\t\t\tif (IsLeft(curIdx))\n\t\t\t{\n\t\t\t\tnxtR = curR + step - (step >> 1);\n\t\t\t\tnxtIdx = (curIdx - 1) >> 1;\t// 親\n\t\t\t\tLazyEvalToRoot(nxtIdx);\n\t\t\t\tnxtVal = mergeData(prvVal, data[nxtIdx]);\n\t\t\t\tif (IsOK(nxtVal))\n\t\t\t\t{\n\t\t\t\t\tcurIdx = nxtIdx;\n\t\t\t\t\tcurR = nxtR;\n\t\t\t\t\t// prvValはまだ更新しない lが同じでstepが大きいものを試すため\n\t\t\t\t\tcurVal = nxtVal;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// 次のノードの左部分木から下りていく\n\t\t\t\t\tstep >>= 2;\n\t\t\t\t\tnxtR = curR + step;\n\t\t\t\t\tnxtIdx = (curIdx + 1) * 2 + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// 自分が右部分木なら[l, l+step)に[l+step, l+step*2)を継ぎ足すイメージ\n\t\t\telse\n\t\t\t{\n\t\t\t\tnxtR = curR + step;\n\t\t\t\tnxtIdx = (curIdx + 1) >> 1;\t// 隣の親\n\t\t\t\tLazyEvalToRoot(nxtIdx);\n\t\t\t\tnxtVal = mergeData(curVal, data[nxtIdx]);\n\t\t\t\tif (IsOK(nxtVal))\n\t\t\t\t{\n\t\t\t\t\tcurIdx = nxtIdx;\n\t\t\t\t\tcurR = nxtR;\n\t\t\t\t\tprvVal = curVal;\n\t\t\t\t\tcurVal = nxtVal;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// 次のノードからから下りていく\n\t\t\t\t\tstep >>= 1;\n\t\t\t\t\tnxtR = curR + step;\n\t\t\t\t\tnxtIdx = curIdx + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tstep <<= 1;\n\t\t}\n\t\t// OKのまま右端まで来てたら終了\n\t\tif (maxR == curR)\n\t\t\treturn min(curR, Norg);\n\n\t\t// 下へ(prv~はもう使わない)\n\t\twhile (nxtR > curR)\n\t\t{\n\t\t\tLazyEvalToRoot(nxtIdx);\n\t\t\tnxtVal = mergeData(curVal, data[nxtIdx]);\n\t\t\tif (IsOK(nxtVal))\n\t\t\t{\n\t\t\t\tcurIdx = nxtIdx;\n\t\t\t\tcurVal = nxtVal;\n\t\t\t\tcurR = nxtR;\n\n\t\t\t\t// 次のノードの左部分木へ\n\t\t\t\tstep >>= 1;\n\t\t\t\tnxtR = curR + step;\n\t\t\t\tnxtIdx = (curIdx + 1) * 2 + 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// 自分の左部分木へ\n\t\t\t\tstep >>= 1;\n\t\t\t\tnxtR = curR + step;\n\t\t\t\tnxtIdx = nxtIdx * 2 + 1;\n\t\t\t}\n\t\t}\n\t\treturn min(curR, Norg);\n\t}\n\n\t// セグメント木上の二分探索\n\t// 区間[l, r)について、IsOKになる最小のlを求める\n\tsize_t MinLeft(size_t r, function<bool(DATA)> IsOK)\n\t{\n\t\tr = min(r, Norg);\n\n\t\tvector<bool> isEvaluated(data.size());\n\t\tauto LazyEvalToRoot = [this, &isEvaluated](size_t idx) {\t// 根に向かって未反映のノードを探し、自分まで辿る\n\t\t\tsize_t cur = idx;\n\t\t\tvector<size_t> target;\n\t\t\twhile (!isEvaluated[cur]) {\n\t\t\t\ttarget.emplace_back(cur);\n\t\t\t\tif (cur == 0) break;\n\t\t\t\tcur = (cur - 1) >> 1;\n\t\t\t}\n\t\t\tfor (int i = target.size() - 1; i >= 0; i--) {\n\t\t\t\tLazyEval(target[i]);\n\t\t\t\tisEvaluated[target[i]] = true;\n\t\t\t}\n\t\t\t};\n\n\t\t// [r-1, r)でも満たさない場合は即終了\n\t\tLazyEvalToRoot(r - 1 + N - 1);\n\t\tif (!IsOK(data[r - 1 + N - 1])) return r;\n\n\t\t// 二分探索\n\t\tsize_t minL = 0;\n\t\tsize_t curIdx = r - 1 + N - 1;\n\t\tsize_t curL = r - 1;\n\t\tDATA curVal = data[curIdx];\n\t\tDATA prvVal = e;\n\t\tsize_t step = 2;\n\n\t\tsize_t nxtL, nxtIdx;\n\t\tDATA nxtVal;\n\n\t\t// 葉から上へ\n\t\twhile (minL < curL)\n\t\t{\n\t\t\t// 自分が右部分木なら[r-step, r)のstepを増やしていくイメージ\n\t\t\tif (IsRight(curIdx))\n\t\t\t{\n\t\t\t\tnxtL = curL - step + (step >> 1);\n\t\t\t\tnxtIdx = (curIdx - 1) >> 1;\t// 親\n\t\t\t\tLazyEvalToRoot(nxtIdx);\n\t\t\t\tnxtVal = mergeData(data[nxtIdx], prvVal);\n\t\t\t\tif (IsOK(nxtVal))\n\t\t\t\t{\n\t\t\t\t\tcurIdx = nxtIdx;\n\t\t\t\t\tcurL = nxtL;\n\t\t\t\t\t// prvValはまだ更新しない rが同じでstepが大きいものを試すため\n\t\t\t\t\tcurVal = nxtVal;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// 前のノードの右部分木から下りていく\n\t\t\t\t\tstep >>= 2;\n\t\t\t\t\tnxtL = curL - step;\n\t\t\t\t\tnxtIdx = (curIdx - 1) * 2 + 2;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// 自分が左部分木なら[r-step, r)に[r-step*2, r-step)を継ぎ足すイメージ\n\t\t\telse\n\t\t\t{\n\t\t\t\tnxtL = curL - step;\n\t\t\t\tnxtIdx = ((curIdx - 1) >> 1) - 1;\t// 隣の親\n\t\t\t\tLazyEvalToRoot(nxtIdx);\n\t\t\t\tnxtVal = mergeData(data[nxtIdx], curVal);\n\t\t\t\tif (IsOK(nxtVal))\n\t\t\t\t{\n\t\t\t\t\tcurIdx = nxtIdx;\n\t\t\t\t\tcurL = nxtL;\n\t\t\t\t\tprvVal = curVal;\n\t\t\t\t\tcurVal = nxtVal;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t// 前のノードからから下りていく\n\t\t\t\t\tstep >>= 1;\n\t\t\t\t\tnxtL = curL - step;\n\t\t\t\t\tnxtIdx = curIdx - 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tstep <<= 1;\n\t\t}\n\t\t// OKのまま左端まで来てたら終了\n\t\tif (minL == curL)\n\t\t\treturn minL;\n\n\t\t// 下へ(prv~はもう使わない)\n\t\twhile (nxtL < curL)\n\t\t{\n\t\t\tLazyEvalToRoot(nxtIdx);\n\t\t\tnxtVal = mergeData(curVal, data[nxtIdx]);\n\t\t\tif (IsOK(nxtVal))\n\t\t\t{\n\t\t\t\tcurIdx = nxtIdx;\n\t\t\t\tcurVal = nxtVal;\n\t\t\t\tcurL = nxtL;\n\n\t\t\t\t// 前のノードの右部分木へ\n\t\t\t\tstep >>= 1;\n\t\t\t\tnxtL = curL - step;\n\t\t\t\tnxtIdx = (curIdx - 1) * 2 + 2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// 自分の右部分木へ\n\t\t\t\tstep >>= 1;\n\t\t\t\tnxtL = curL - step;\n\t\t\t\tnxtIdx = nxtIdx * 2 + 2;\n\t\t\t}\n\t\t}\n\t\treturn curL;\n\t}\n#pragma endregion\nprivate:\n#pragma region primitive data\n\tsize_t N;\t\t\t\t\t\t\t\t// 2べき化したサイズ\t\n\tsize_t Norg;\t\t\t\t\t\t\t// 元のサイズ\n\tDATA e;\t\t\t\t\t\t\t\t\t// 実データの単位元\n\tLAZY I;\t\t\t\t\t\t\t\t\t// 遅延評価の恒等写像\n\tvector<DATA> data;\t\t\t\t\t\t// 実データ\n\tvector<LAZY> lazy;\t\t\t\t\t\t// 遅延評価値\n\tfunction<DATA(DATA, DATA)> mergeData;\t// 取得時のマージ演算\n\tfunction<DATA(LAZY, DATA)> evaluate;\t// lazy -> dataの反映\n\tfunction<LAZY(LAZY, LAZY)> mergeLazy;\t// lazyを下のlazyにマージする操作\n#pragma endregion\n\n#pragma region implementation\n\t// 区間評価(本体)\n\tDATA Fold(size_t queryL, size_t queryR,\n\t\tsize_t nodeIdx, size_t nodeL, size_t nodeR\n\t)\n\t{\n\t\t// 遅延評価\n\t\tLazyEval(nodeIdx);\n\n\t\t// かすりもしない\n\t\tif (queryL >= nodeR || queryR <= nodeL) return e;\n\n\t\t// 完全に覆われる\n\t\tif (queryL <= nodeL && queryR >= nodeR) return data[nodeIdx];\n\n\t\t// 部分的に覆われる\n\t\tsize_t nodeM = (nodeL + nodeR) / 2;\n\t\treturn mergeData(\n\t\t\tFold(queryL, queryR, 2 * nodeIdx + 1, nodeL, nodeM),\n\t\t\tFold(queryL, queryR, 2 * nodeIdx + 2, nodeM, nodeR)\n\t\t);\n\t}\n\n\t// 区間更新(本体)\n\tvoid Update(size_t queryL, size_t queryR,\n\t\tsize_t nodeIdx, size_t nodeL, size_t nodeR,\n\t\tLAZY val\n\t)\n\t{\n\t\tLazyEval(nodeIdx);\n\n\t\t// かすりもしない\n\t\tif (queryL >= nodeR || queryR <= nodeL) return;\n\n\t\t// 完全に覆われる\n\t\tif (queryL <= nodeL && queryR >= nodeR) {\n\t\t\tlazy[nodeIdx] = mergeLazy(val, lazy[nodeIdx]);\n\t\t\tLazyEval(nodeIdx);\n\t\t\treturn;\n\t\t}\n\n\t\t// 部分的に覆われる\n\t\tsize_t nodeM = (nodeL + nodeR) / 2;\n\t\tUpdate(queryL, queryR, 2 * nodeIdx + 1, nodeL, nodeM, val);\n\t\tUpdate(queryL, queryR, 2 * nodeIdx + 2, nodeM, nodeR, val);\n\t\tdata[nodeIdx] = mergeData(data[2 * nodeIdx + 1], data[2 * nodeIdx + 2]);\n\t}\n\n\t// 遅延評価\n\tvoid LazyEval(size_t idx)\n\t{\n\t\tdata[idx] = evaluate(lazy[idx], data[idx]);\n\n\t\t// 一段落とす\n\t\tif (idx < N - 1)\n\t\t{\n\t\t\tlazy[idx * 2 + 1] = mergeLazy(lazy[idx], lazy[idx * 2 + 1]);\n\t\t\tlazy[idx * 2 + 2] = mergeLazy(lazy[idx], lazy[idx * 2 + 2]);\n\t\t}\n\n\t\tlazy[idx] = I;\n\t}\n#pragma endregion\n\tinline bool IsLeft(size_t idx) const { return (idx & 1) == 1; }\n\tinline bool IsRight(size_t idx) const { return (idx & 1) == 0; }\n};\n\nstruct Data\n{\n\tll val;\n\tsize_t size;\n};\n\t\nusing Lazy = ll;\n\t\nData MergeData(Data a, Data b)\n{\n\treturn { a.val + b.val, a.size + b.size };\n}\n\t\nData Evaluate(Lazy l, Data a)\n{\n\ta.val += l * a.size;\n\treturn a;\n}\n\t\nLazy MergeLazy(Lazy a, Lazy b)\n{\n\treturn a + b;\n}\n\t \nconst Data unit{ 0, 1 };\nconst Lazy Identity = 0;\n\nstruct Solver\n{\n\tvoid Run()\n\t{\n\t\tint N, Q;\n\t\tcin >> N >> Q;\n\n\t\tLazySegmentTree<Data, Lazy> st(N+1, unit, Identity, MergeData, Evaluate, MergeLazy );\n\t\twhile (Q--) {\n\t\t\tint l, k;\n\t\t\tcin >> l >> k;\n\t\t\tl--;\n\t\t\tst.Update(l, l + k, 1);\n\t\t\tst.Update(l + k, l + k + 1, -k);\n\t\t}\n\n\t\tll a = 0;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\ta += st.Fold(i, i + 1).val;\n\t\t\tif (i)\n\t\t\t\tcout << ' ';\n\t\t\tcout << a;\n\t\t}\n\t\tcout << \"\\n\";\n\t}\n};\n\nint main()\n{\n\tstd::cin.tie(nullptr); //★インタラクティブ注意★\n\tstd::ios_base::sync_with_stdio(false);\n\tint T = 1;\n\t//cin >> T;\n\twhile (T--)\n\t{\n\t\tSolver S;\n\t\tS.Run();\n\t}\n\n\treturn 0;\n}\n\n/// 値渡しになっていないか?\n/// 入力を全部読んでいるか? 途中でreturnしない\n/// 32bitで収まるか? 10^5数えるとき\n/// modは正しいか?\n/// multisetでcountしていないか?","accuracy":1,"time_ms":360,"memory_kb":15496,"score_of_the_acc":-1.543,"final_rank":18},{"submission_id":"aoj_3165_8738135","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vl = vector<ll>;\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\n\ntemplate<typename T>\nstruct dualsegtree {\n \n dualsegtree(int siz, T _id) : id(_id) {\n n = 1;\n while(n < siz) n <<= 1;\n dat.resize(n*2, id);\n }\n\n private: \n\n \n int n;\n vector<T> dat;\n T id;\n \n\n void eval(int k, int len) {\n if(len == 1) return;\n dat[k << 1] = op(dat[k << 1], dat[k]);\n dat[(k << 1) + 1] = op(dat[(k << 1) + 1], dat[k]);\n dat[k] = id;\n }\n\n\n void update(int a, int b, T e, int l, int r, int k) {//[a, b) := 今見ている区間 [l, r) := クエリ区間\n eval(k, b-a);\n if(b <= l || r <= a) return;\n if(l <= a && b <= r) {\n dat[k] = op(dat[k], e);\n eval(k, b-a);\n return;\n }\n int mid = (a+b)>>1;\n update(a, mid, e, l, r, k<<1);\n update(mid, b, e, l, r, (k<<1)+1);\n }\n\n T query(int pos) {\n int a = 1;\n int b = n+1;\n int k = 1;\n while(1) {\n eval(k, b-a);\n if(b-a == 1) {\n return dat[k];\n }\n int mid = (a+b)>>1;\n if(mid <= pos) {\n k = (k << 1) + 1;\n a = mid;\n }\n else {\n k <<= 1;\n b = mid;\n } \n }\n }\n\n\n public: \n\n void set(int pos, T val) {\n dat[pos+n-1] = val;\n }\n\n void init() {\n\n }\n\n void change(int l, int r, T x) {\n update(1, n+1, x, l, r+1, 1);\n }\n\n T get(int pos) {\n return query(pos);\n }\n\n};\n\n\nstruct Monoid {\n ll a, d;\n Monoid():a(0), d(0){}\n Monoid(ll _a, ll _d) : a(_a), d(_d) {}\n friend Monoid op(const Monoid& l, const Monoid& r) {//monoid * monoid\n return Monoid(l.a + r.a, l.d + r.d);\n }\n\n};\nusing E = Monoid;\n\nMonoid id(0, 0);\n\nint main() {\n ll N, Q;\n cin >> N >> Q;\n dualsegtree<Monoid> seg(N+1, id);\n rep(i,1,N)seg.set(i, id);\n seg.init();\n rep(qi, 1, Q) {\n ll l, k;\n cin >> l >> k;\n seg.change(l, l + k - 1, Monoid(2-l, 1));\n }\n\n rep(i,1,N) {\n auto [a,d] = seg.get(i);\n cout << a + (i-1) * d;\n if(i != N) cout << \" \";}\n cout << endl;\n \n}","accuracy":1,"time_ms":150,"memory_kb":11316,"score_of_the_acc":-0.7278,"final_rank":11},{"submission_id":"aoj_3165_8738048","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vl = vector<ll>;\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\n\ntemplate<typename T>\nstruct dualsegtree {\n dualsegtree(int siz) {\n n = 1;\n while(n < siz) n <<= 1;\n dat.resize(n*2);\n }\n\n private: \n struct E {\n T a, d;\n E():a(0), d(0){}\n E(T _a, T _d) : a(_a), d(_d) {}\n };\n\n int n;\n vector<E> dat;\n E id = E(0, 0); \n\n E fe(const E& l, const E& r) {//作用素の合成\n return E(l.a + r.a, l.d + r.d);\n }\n\n\n void eval(int k, int len) {\n if(dat[k].a == 0 && dat[k].d == 0) return;\n if(len == 1) return;\n dat[k << 1] = fe(dat[k << 1], dat[k]);\n dat[(k << 1) + 1] = fe(dat[(k << 1) + 1], E(dat[k].a + (len >> 1) * dat[k].d, dat[k].d));\n dat[k] = id;\n }\n\n\n void update(int a, int b, E e, int l, int r, int k) {//[a, b) := 今見ている区間 [l, r) := クエリ区間\n eval(k, b-a);\n if(b <= l || r <= a) return;\n if(l <= a && b <= r) {\n dat[k] = fe(dat[k], e);\n eval(k, b-a);\n return;\n }\n int mid = (a+b)>>1;\n update(a, mid, e, l, r, k<<1);\n update(mid, b, E(e.a + (mid - a)*e.d, e.d), l, r, (k<<1)+1);\n }\n\n T query(int pos) {\n int a = 1;\n int b = n+1;\n int k = 1;\n while(1) {\n eval(k, b-a);\n if(b-a == 1) {\n return dat[k].a;\n }\n int mid = (a+b)>>1;\n if(mid <= pos) {\n k = (k << 1) + 1;\n a = mid;\n }\n else {\n k <<= 1;\n b = mid;\n } \n }\n }\n\n\n public: \n\n void set(int pos, T val) {\n dat[pos+n-1].a = val;\n }\n\n void init() {\n\n }\n\n void change(int l, int r, T a, T d) {\n if(l != 1) {\n a = a - (l-1) * d;\n update(1, n+1, E(-a, -d), 1, l, 1);//左端を1に合わせる為に、打ち消すaddをする。\n } \n update(1, n+1, E(a, d), 1, r+1, 1);\n }\n\n T get(int pos) {\n return query(pos);\n }\n\n};\n\n\nint main() {\n ll N, Q;\n cin >> N >> Q;\n dualsegtree<ll> seg(N+1);\n rep(i,1,N)seg.set(i, 0);\n seg.init();\n rep(qi, 1, Q) {\n ll l, k;\n cin >> l >> k;\n seg.change(l, l + k - 1, 1, 1);\n }\n\n rep(i,1,N) {cout << seg.get(i);if(i != N) cout << \" \";}\n cout << endl;\n \n}","accuracy":1,"time_ms":160,"memory_kb":11320,"score_of_the_acc":-0.7574,"final_rank":12},{"submission_id":"aoj_3165_8730817","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N, Q;\n cin >> N >> Q;\n vll A(N, 0);\n vll B(N,0);\n rep(i, Q) {\n ll L, K;\n cin >> L >> K;\n L--;\n A[L]++;\n if (L + K < N){\n A[L + K]--;\n B[L+K]-=K;\n }\n }\n rep(i, N - 1)A[i + 1] += A[i];\n rep(i,N)A[i]+=B[i];\n rep(i, N - 1)A[i + 1] += A[i];\n rep(i,N)cout<<A[i]<<\" \\n\"[i==N-1];\n}","accuracy":1,"time_ms":30,"memory_kb":6248,"score_of_the_acc":-0.1353,"final_rank":5},{"submission_id":"aoj_3165_7976044","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n, q;\n cin >> n >> q;\n vector<long long> imos_range(n + 2), imos_l_sum(n + 2);\n for (int i = 0; i < q; i++) {\n int l, k;\n cin >> l >> k;\n imos_range[l]++;\n imos_range[l + k]--;\n imos_l_sum[l] += l;\n imos_l_sum[l + k] -= l;\n }\n for (int i = 1; i <= n; i++) {\n imos_range[i] += imos_range[i - 1];\n imos_l_sum[i] += imos_l_sum[i - 1];\n cout << imos_range[i] * (i + 1) - imos_l_sum[i];\n if (i < n) cout << ' ';\n }\n cout << '\\n';\n}","accuracy":1,"time_ms":70,"memory_kb":6284,"score_of_the_acc":-0.2546,"final_rank":9},{"submission_id":"aoj_3165_7975323","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef unsigned uint;\ntypedef long long ll;\ntypedef long long lint;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\ntypedef char chr;\ntypedef string str;\n\n#define REP(i, n) for (int i=0;i<(int)n;i++)\n#define ALL(x) x.begin() x.begin()\n#define SEP \" \"\n#define YES cout << \"Yes\" << endl\n#define NO cout << \"NO\" << endl\n#define OUT(x) cout << x << endl\n#define OUTF(x) cout << fixed << setprecision(10) << x << endl\n#define SIZE(v) v.size()\n#define PB push_back\n#define MP make_pair\n#define MT make_typle\n\nconst double pi = 3.141592653589793238;\n\nconst int large_a = 65;\nconst int small_a = 97;\n\nconst int INF = 2147483647;\nconst int INT_INF = 2147483647;\n\nconst int dy[4] = {-1, 0, 1, 0};\nconst int dx[4] = {0, 1, 0, -1};\n\ntemplate<class T> inline void print_vec(const vector<T>& v) {\n\tint last = SIZE(v);\n\tREP(i, last) {\n\t\tcout << v[i];\n\t\tif(i != last-1) cout << SEP;\n\t}\n\tcout << endl;\n}\n\nint main() {\n\tint n,q;\n\tcin >> n >> q;\n\tvector<ll> v(n+2),b(n+2);\n\tfor(int i=0;i<q;i++){\n\t\tint l,k;\n\t\tcin >> l >> k;\n\t\tv[l]++;\n\t\tv[l+k]--;\n\t\tb[l]-=l-1;\n\t\tb[l+k]+=l-1;\n\t}\n\tfor(int i=1;i<n+1;i++){\n\t\tv[i]+=v[i-1];\n\t\tb[i]+=b[i-1];\n\t}\n\tfor(int i=1;i<n+1;i++){\n\t\tv[i]*=i;\n\t}\n\tfor(int i=1;i<n;i++){\n\t\tcout << v[i]+b[i] << \" \";\n\t}\n\tcout << v[n]+b[n] << endl;\n\n\n}","accuracy":1,"time_ms":70,"memory_kb":6244,"score_of_the_acc":-0.2527,"final_rank":7},{"submission_id":"aoj_3165_7975209","code_snippet":"#include<cstdio>\n#include<iostream>\nusing namespace std;\n\nunsigned long long ans[200002];\nunsigned long long dp[200002];\n\nint main(){\n unsigned long long n,q,i,j;\n unsigned long long l,k;\n\n scanf(\"%llu %llu\", &n, &q);\n \n for(i=1;i<=n;i++){\n ans[i] = 0;\n dp[i] = 0;\n }\n\n for(i=0;i<q;i++){\n scanf(\"%llu %llu\", &l, &k);\n dp[l-1] += -1;\n dp[l+k-1] += 1;\n ans[l+k-1] += k;\n }\n\n for(i=n;i>=2;i--){\n if(dp[i]==0)continue;\n \n dp[i-1] = dp[i-1] + dp[i];\n ans[i-1] = (ans[i] - dp[i]) + ans[i-1];\n }\n \n for(i=1;i<=n;i++){\n printf(\"%llu\", ans[i]);\n if(i!=n){\n printf(\" \");\n }\n }\n printf(\"\\n\");\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":6348,"score_of_the_acc":-0.14,"final_rank":6},{"submission_id":"aoj_3165_7974994","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\nconst int mod = 998244353;\nconst int inf = (1<<30);\n\nconst int dy[4] = {-1,0,0,1};\nconst int dx[4] = {0,-1,1,0};\n\nint main(){\n int n,q;cin>>n>>q;\n vector<pair<long long,long long>> A(n+2);\n vector<long long> D(n+2);\n for(int i = 0; q > i; i++){\n long long l,k;cin>>l>>k;\n l--;\n A[l].first++;\n A[l+k].second+=k; \n D[l+k]++;\n }\n long long nw = 0;\n long long ans = 0;\n for(int i = 0; n > i; i++){\n if(A[i].first){\n nw += A[i].first; \n }\n if(A[i].second){\n ans -= A[i].second;\n nw -= D[i];\n }\n ans += nw;\n cout << ans<< \" \\n\"[i+1==n];\n }\n \n}","accuracy":1,"time_ms":70,"memory_kb":7828,"score_of_the_acc":-0.3276,"final_rank":10},{"submission_id":"aoj_3165_7974968","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n int n, q;\n cin >> n >> q;\n vector<long long> imos(n + 2, 0), ans(n + 2, 0);\n for (int i = 0; i < q; i++) {\n int l, k;\n cin >> l >> k;\n imos[l]++;\n imos[l + k]--;\n ans[l + k] -= k;\n }\n for (int i = 0; i < n; i++) {\n imos[i + 1] += imos[i];\n }\n for (int i = 0; i < n; i++) {\n ans[i + 1] += ans[i] + imos[i + 1];\n }\n for (int i = 0; i < n; i++) {\n cout << ans[i + 1];\n if (i < n - 1) cout << ' ';\n }\n cout << '\\n';\n}","accuracy":1,"time_ms":70,"memory_kb":6252,"score_of_the_acc":-0.2531,"final_rank":8},{"submission_id":"aoj_3165_7009756","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3165.cc: Triangle Addition\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 200000;\n\n/* typedef */\n\ntypedef long long ll;\n\ntemplate <typename T>\nstruct SegTreeSumDelay {\n int e2;\n vector<T> nodes, das, dbs;\n vector<int> ls;\n T defv;\n SegTreeSumDelay() {}\n\n void init(int n, T _defv) {\n defv = _defv;\n for (e2 = 1; e2 < n; e2 <<= 1);\n nodes.assign(e2 * 2, defv);\n das.assign(e2 * 2, 0);\n dbs.assign(e2 * 2, 0);\n ls.assign(e2 * 2, 1);\n for (int j = e2 - 2; j >= 0; j--) ls[j] = ls[j * 2 + 1] + ls[j * 2 + 2];\n }\n\n T &geti(int i) { return nodes[e2 - 1 + i]; }\n void seti(int i, T v) { geti(i) = v; }\n\n void setall() {\n for (int j = e2 - 2; j >= 0; j--)\n nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];\n }\n\n T __sigma(T a, T b, int dx) {\n // sigma_{x=0}^(dx-1) (ax+b)\n return a * dx * (dx - 1) / 2 + b * dx;\n }\n\n void __update(int k) {\n if (das[k] > 0 || dbs[k] > 0) {\n int k0 = k * 2 + 1, k1 = k0 + 1;\n ll a = das[k], b0 = dbs[k], b1 = b0 + a * ls[k0];\n nodes[k0] += __sigma(a, b0, ls[k0]);\n nodes[k1] += __sigma(a, b1, ls[k1]);\n das[k0] += a, das[k1] += a;\n dbs[k0] += b0, dbs[k1] += b1;\n das[k] = dbs[k] = 0;\n }\n }\n\n void updateall() {\n for (int j = 0; j < e2 - 1; j++) __update(j);\n }\n\n void add_range(int r0, int r1, T v, int k, int i0, int i1) {\n if (r1 <= i0 || i1 <= r0) return;\n if (r0 <= i0 && i1 <= r1) {\n T b = v + (i0 - r0);\n nodes[k] += __sigma(1, b, ls[k]);\n das[k]++, dbs[k] += b;\n return;\n }\n\n __update(k);\n\n int im = (i0 + i1) / 2;\n int k0 = k * 2 + 1, k1 = k0 + 1;\n add_range(r0, r1, v, k0, i0, im);\n add_range(r0, r1, v, k1, im, i1);\n nodes[k] = nodes[k0] + nodes[k1];\n }\n void add_range(int r0, int r1, T v) { add_range(r0, r1, v, 0, 0, e2); }\n};\n\n/* global variables */\n\nSegTreeSumDelay<ll> st;\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, qn;\n scanf(\"%d%d\", &n, &qn);\n\n st.init(n, 0);\n\n while (qn--) {\n int l, k;\n scanf(\"%d%d\", &l, &k), l--;\n st.add_range(l, l + k, 1);\n }\n\n st.updateall();\n\n for (int i = 0; i < n; i++)\n printf(\"%lld%c\", st.geti(i), (i + 1 < n) ? ' ' : '\\n');\n\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":16924,"score_of_the_acc":-0.9635,"final_rank":13},{"submission_id":"aoj_3165_6928534","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=9167167167167167167;\nconst int INF=2100000000;\nconst ll mod=998244353;\n#define rep(i,a) for (ll i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\t//cin>>t;\n\trep(i,t) solve();\n}\n\nvoid solve(){\n\tint N,Q;\n\tcin>>N>>Q;\n\tvector<ll> A(N+3),B(N+3);\n\trep(i,Q){\n\t\tint l,k;\n\t\tcin>>l>>k;\n\t\tB[l]++;\n\t\tB[l+k]-=k+1;\n\t\tB[l+k+1]+=k;\n\t}\n\trep(i,N){\n\t\tif(i) cout<<\" \";\n\t\tB[i+1]+=B[i];\n\t\tA[i+1]=B[i+1]+A[i];\n\t\tcout<<A[i+1];\n\t}\n\tcout<<\"\\n\";\n}","accuracy":1,"time_ms":20,"memory_kb":6272,"score_of_the_acc":-0.107,"final_rank":4},{"submission_id":"aoj_3165_6451223","code_snippet":"#include <bits/stdc++.h>\nusing namespace std ;\ntypedef long long ll ;\ntypedef long double ld ;\ntypedef pair<ll,ll> P ;\ntypedef tuple<ll,ll,ll> TP ;\n#define chmin(a,b) a = min(a,b)\n#define chmax(a,b) a = max(a,b)\n#define bit_count(x) __builtin_popcountll(x)\n#define gcd(a,b) __gcd(a,b)\n#define lcm(a,b) a / gcd(a,b) * b\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\n#define rrep(i,a,b) for(int i = a ; i < b ; i++)\n#define endl \"\\n\"\n\ntemplate<typename S , typename M>\nstruct LazySegmentTree{\n private :\n int n , _n ;\n using FS = function<S(S,S)> ;\n using FM = function<M(M,M)> ;\n using FA = function<S(S,M)> ;\n FS fs ;\n FM fm ;\n FA fa ;\n S es ;\n M em ;\n vector<S> dat ;\n vector<M> lazy ;\n \n // 各セグメントに左端値, 右端値を持たせる\n void build(){\n int id = 0 ;\n for(int i = n ; i > 0 ; i = i / 2){\n for(int j = 0 ; j < n ; j += i){\n dat[id].lef = j ;\n dat[id].rig = j + i ;\n id++ ;\n }\n }\n }\n void eval(int k , int l , int r){\n if(lazy[k] == em) return ;\n int len = (r - l) / 2 ;\n if(k < n - 1) {\n lazy[2 * k + 1] = fm(lazy[2 * k + 1] , {lazy[k].a,lazy[k].b}) ;\n lazy[2 * k + 2] = fm(lazy[2 * k + 2] , {lazy[k].a,lazy[k].a*len+lazy[k].b}) ;\n }\n dat[k] = fa(dat[k],lazy[k]) ;\n lazy[k] = em ;\n }\n void apply(int a , int b , int k , int l , int r , M x){\n eval(k,l,r) ;\n if(r <= a || b <= l) return ;\n if(a <= l && r <= b) {\n lazy[k] = fm(lazy[k],{x.a,x.a*(l-a)+x.b}) ;\n eval(k,l,r) ;\n return ;\n }\n apply(a,b,2*k+1,l,(l+r)/2,x) ;\n apply(a,b,2*k+2,(l+r)/2,r,x) ;\n dat[k] = fs(dat[2*k+1],dat[2*k+2]) ;\n }\n S prod(int a , int b , int k , int l , int r) {\n eval(k,l,r) ;\n if(r <= a || b <= l) return es ;\n if(a <= l && r <= b) return dat[k] ;\n S lef = prod(a,b,2*k+1,l,(l+r)/2) ;\n S rig = prod(a,b,2*k+2,(l+r)/2,r) ;\n return fs(lef,rig) ;\n }\n \n public :\n LazySegmentTree(int n_ , FS fs_ , S es_ , S ee_ , FM fm_ , M em_ , FA fa_) : fs(fs_) , fm(fm_) , fa(fa_) , es(es_) , em(em_) {\n _n = n_ ;\n n = 1 ;\n while(n_ > n) n *= 2 ;\n dat.resize(2 * n - 1,ee_) ;\n lazy.resize(2 * n - 1,em) ;\n build() ;\n }\n void apply(int a , int b , M x) { apply(a,b,0,0,n,x) ; }\n S prod(int a , int b) { return prod(a,b,0,0,n) ; }\n};\n\nnamespace monoid{\n ll linf = 1e16 ;\n int inf = 1e8 ;\n\n // モノイド\n struct S{\n ll sum ;\n int lef , rig ;\n };\n\n // S*S->Sにおける演算の定義\n function<S(S,S)> fs = [](S x , S y) -> S {\n return S{\n x.sum + y.sum,\n x.lef,\n y.rig\n };\n };\n \n // Sの単位元\n S es = {0,inf,-inf} ;\n\n // Sの初期化単位元\n S ee = {0,0,0} ;\n\n // 作用モノイド\n struct M{\n ll a , b ;\n bool operator == (M x) { return a == x.a && b == x.b ; }\n };\n\n // M*M->Mにおける演算の定義1\n function<M(M,M)> fm = [](M x , M y) -> M {\n return M{\n x.a + y.a,\n x.b + y.b\n };\n };\n\n // Mの単位元\n M em = {0,0} ;\n\n // S*M->Sにおける演算の定義\n function<S(S,M)> fa = [](S x , M y) -> S {\n int len = (x.rig - x.lef) ;\n int lef = x.lef ;\n return S{\n x.sum + len * (len - 1) / 2 * y.a + len * y.b ,\n x.lef,\n x.rig,\n };\n };\n};\nusing namespace monoid ;\n\n// default\n// S : sum(区間和) , lef(区間左端値), rig(区間右端値) \n// M : (a,b) -> ax + b のモノイド\n// apply: 区間等差数列加算\n// prod : sum(区間和), min(区間最小値), max(区間最大値)\n\nint n , q ;\n\nint main(){\n cin >> n >> q ;\n LazySegmentTree<S,M> segtree(n,fs,es,ee,fm,em,fa) ;\n rep(i,q){\n int l , r ;\n cin >> l >> r ;\n l-- ;\n segtree.apply(l,l+r,{1,1}) ;\n }\n rep(i,n) {\n if(i == n - 1) cout << segtree.prod(i,i+1).sum << endl ;\n else cout << segtree.prod(i,i+1).sum << \" \" ;\n }\n}","accuracy":1,"time_ms":310,"memory_kb":19608,"score_of_the_acc":-1.5903,"final_rank":19},{"submission_id":"aoj_3165_6422580","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#define CONSTANTS\n// #define CAST_MINT_TO_LL\n#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr long long INF = 1e18;\n// constexpr long long INF = LONG_LONG_MAX;\nconstexpr int MOD = 1000000007;\n// constexpr int MOD = 998244353;\nconstexpr long double EPS = 1e-10;\nconstexpr long double PI = M_PI;\n\nusing ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; using pii = pair<int, int>; using pli = pair<ll, int>; using pil = pair<int, ll>; using vvl = vector<vector<ll>>; using vvi = vector<vector<int>>; using vvpll = vector<vector<pll>>; using vvpli = vector<vector<pli>>; using vvpil = vector<vector<pil>>;\n#define name4(i, a, b, c, d, e, ...) e\n#define rep(...) name4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rep1(i, a) for (ll i = 0, _aa = a; i < _aa; i++)\n#define rep2(i, a, b) for (ll i = a, _bb = b; i < _bb; i++)\n#define rep3(i, a, b, c) for (ll i = a, _bb = b; (c > 0 && a <= i && i < _bb) or (c < 0 && a >= i && i > _bb); i += c)\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\n#define pb push_back\n#define eb emplace_back\n#define mkp make_pair\n#define ALL(A) A.begin(), A.end()\n#define UNIQUE(A) sort(ALL(A)), A.erase(unique(ALL(A)), A.end())\n#define elif else if\n#define tostr to_string\n#ifndef CONSTANTS\nconstexpr ll INF = 1e18; constexpr int MOD = 1000000007; constexpr ld EPS = 1e-10; constexpr ld PI = M_PI;\n#endif\ntemplate<int mod> struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator++() { x++; if (x == mod) x = 0; return *this; } ModInt &operator--() { if (x == 0) x = mod; x--; return *this; } ModInt &operator+=(const ModInt &p) { if((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int) (1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inv(); return *this; } ModInt operator++(int) { ModInt result = *this; ++*this; return result; } ModInt operator--(int) { ModInt result = *this; --*this; return result; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inv() const { int a = x, b = mod, u = 1, v = 0, t; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } static int get_mod() { return mod; }\n#ifdef CAST_MINT_TO_LL\noperator ll() const { return x; }\n#endif\n}; using mint = ModInt<MOD>;\ntemplate<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); } template<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); } template<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N, vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }\ntemplate<typename T=ll> vector<T> LIST(ll N) { vector<T> A(N); rep(i, N) { cin >> A[i]; } return A; }\nvoid print() { cout << '\\n'; } template<typename T> void print(T out) { cout << out << '\\n'; } template<typename T1, typename T2> void print(const pair<T1, T2> &p) { cout << p.first << ' ' << p.second << '\\n'; } template<typename T1, typename T2, typename T3> void print(const tuple<T1, T2, T3> &tp) { cout << get<0>(tp) << ' ' << get<1>(tp) << ' ' << get<2>(tp) << '\\n'; } template<typename T1, typename T2, typename T3, typename T4> void print(const tuple<T1, T2, T3, T4> &tp) { cout << get<0>(tp) << ' ' << get<1>(tp) << ' ' << get<2>(tp) << ' ' << get<3>(tp) << '\\n'; } template<typename T1, typename T2> void print(const vector<pair<T1, T2>> &V) { for (auto& p : V) print(p); } template<typename T> void print(const vector<T> &V) { rep(i, V.size()) { cout << V[i]; if (i != V.size()-1) cout << ' '; } cout << '\\n'; } template<typename T, size_t SZ> void print(const array<T, SZ> &arr) { rep(i, arr.size()) { cout << arr[i]; if (i != arr.size()-1) cout << ' '; } cout << '\\n'; } template<typename T, size_t SZ> void print(const vector<array<T, SZ>> &V) { for (auto& arr : V) print(arr); } template<typename T> void print(const deque<T> &que) { vector<T> V(ALL(que)); print(V); } template<typename T> void print(const set<T> &se) { vector<T> V(ALL(se)); print(V); }\n#define debug(x) (cout << #x << \": \", print(x));\nvoid Yes() { print(\"Yes\"); } void No() { print(\"No\"); } void YES() { print(\"YES\"); } void NO() { print(\"NO\"); }\nll toint(string s) { assert(s.size() < 20); ll res = 0; for (char &c : s) { res *= 10; res += c - '0'; } return res; } int toint(char num) { return num - '0'; }\nchar tochar(int num) { return '0' + num; }\ntemplate<typename T> T ceil(T a, T b) { if (a >= 0) return (a+b-1) / b; else return a / b; }\ntemplate<typename T> T modulo(T a, T b) { return ((a % b) + b) % b; }\ntemplate<typename T> pair<T, T> divmod(T a, T b) { T d = a / b; T m = a % b; return {d, m}; }\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\ntemplate<typename T> T sum(const vector<T> &A) { return accumulate(ALL(A), (T)0); } template<typename key, typename val> val sum(const map<key, val> &mp) { val res = 0; for (auto& [k, v] : mp) res += v; return res; }\ntemplate<typename T> T min(const vector<T> &A) { return *min_element(ALL(A)); } template<typename key, typename val> val min(const map<key, val> &mp) { val res = numeric_limits<val>::max(); for (auto& [k, v] : mp) chmin(res, v); return res; }\ntemplate<typename T> T max(const vector<T> &A) { return *max_element(ALL(A)); } template<typename key, typename val> val max(const map<key, val> &mp) { val res = numeric_limits<val>::min(); for (auto& [k, v] : mp) chmax(res, v); return res; }\nll pow(ll x, ll n) { ll res = 1; rep(_, n) res *= x; return res; } ll pow(int x, ll n) { return pow((ll)x, n); } ll pow(ll x, int n) { return pow(x, (ll)n); } ll pow(int x, int n) { return pow((ll)x, (ll)n); } ll pow(ll x, ll n, int mod) { x %= mod; ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }\nint popcount(ll S) { return __builtin_popcountll(S); }\nint bit_length(ll x) { return x != 0 ? floor(log2((ld)x))+1 : 0; }\ntemplate<typename T> int bisect_left(const vector<T> &A, T val, int lo=0) { return lower_bound(A.begin()+lo, A.end(), val) - A.begin(); } template<typename T> int bisect_right(const vector<T> &A, T val, int lo=0) { return upper_bound(A.begin()+lo, A.end(), val) - A.begin(); }\ntemplate<typename T> map<T, ll> Counter(const vector<T> &A) { map<T, ll> res; for (T a : A) { res[a]++; } return res; } template<typename T> vector<ll> Counter(const vector<T> &A, int mx) { vector<ll> res(mx+1); for (T a : A) { res[a]++; } return res; } map<char, ll> Counter(const string &S) { map<char, ll> res; for (char c : S) { res[c]++; } return res; }\ntemplate<typename F> ll bisearch_min(ll mn, ll mx, const F &func) { ll ok = mx; ll ng = mn; while (ng+1 < ok) { ll mid = (ok+ng) / 2; if (func(mid)) { ok = mid; } else { ng = mid; } } return ok; } template<typename F> ll bisearch_max(ll mn, ll mx, const F &func) { ll ok = mn; ll ng = mx; while (ok+1 < ng) { ll mid = (ok+ng) / 2; if (func(mid)) { ok = mid; } else { ng = mid; } } return ok; }\ntemplate<typename T1, typename T2> pair<vector<T1>, vector<T2>> zip(const vector<pair<T1, T2>> &A) { int N = A.size(); pair<vector<T1>, vector<T2>> res = {vector<T1>(N), vector<T2>(N)}; rep(i, N) { res.first[i] = A[i].first; res.second[i] = A[i].second; } return res; } template<typename T1, typename T2, typename T3> tuple<vector<T1>, vector<T2>, vector<T3>> zip(const vector<tuple<T1, T2, T3>> &A) { int N = A.size(); tuple<vector<T1>, vector<T2>, vector<T3>> res = {vector<T1>(N), vector<T2>(N), vector<T3>(N)}; rep(i, N) { get<0>(res)[i] = get<0>(A[i]); get<1>(res)[i] = get<1>(A[i]); get<2>(res)[i] = get<2>(A[i]); } return res; }\ntemplate<typename T> struct Compress { int N; vector<T> dat; Compress(vector<T> A) { sort(A.begin(), A.end()); A.erase(unique(A.begin(), A.end()), A.end()); N = A.size(); dat = A; } int zip(T x) { return bisect_left(dat, x); } T unzip(int x) { return dat[x]; } int operator[](T x) { return zip(x); } int size() { return dat.size(); } vector<ll> zip(const vector<T> &A) { int M = A.size(); vector<ll> res(M); rep(i, M) res[i] = zip(A[i]); return res; } };\ntemplate<typename T> vector<pair<T, int>> RLE(const vector<T> &A) { if (A.empty()) return {}; int N = A.size(); vector<pair<T, int>> res; T cur = A[0]; int cnt = 1; rep(i, 1, N) { if (A[i] == A[i-1]) { cnt++; } else { res.pb({cur, cnt}); cnt = 1; cur = A[i]; } } res.pb({cur, cnt}); return res; } vector<pair<char, int>> RLE(const string &S) { if (S.empty()) return {}; int N = S.size(); vector<pair<char, int>> res; char cur = S[0]; int cnt = 1; rep(i, 1, N) { if (S[i] == S[i-1]) { cnt++; } else { res.pb({cur, cnt}); cnt = 1; cur = S[i]; } } res.pb({cur, cnt}); return res; }\ntemplate<typename T> bool mul_overflow(T x, T y) { T z; return __builtin_mul_overflow(x, y, &z); }\nvector<ll> split(const string &S, char separator) { int N = S.size(); vector<ll> res; string cur; rep(i, N) { if (S[i] == separator) { res.eb(toint(cur)); cur = \"\"; } else { cur += S[i]; } } if (cur.size()) res.eb(toint(cur)); return res; }\nstring to_string(const string &S) { return S; } string to_string(char c) { return {c}; }\ntemplate<typename T> string join(const vector<T> &A, char separator=0) { int N = A.size(); string res; rep(i, N) { res += tostr(A[i]); if (separator != 0 and i != N-1) res += separator; } return res; }\ntemplate<typename T> vector<T> sorted(vector<T> A, bool reverse=false) { sort(ALL(A)); if (reverse) std::reverse(ALL(A)); return A; } string sorted(string S, bool reverse=false) { sort(ALL(S)); if (reverse) std::reverse(ALL(S)); return S; }\ntemplate<typename T> vector<T> reversed(vector<T> A) { reverse(ALL(A)); return A; } string reversed(string S) { reverse(ALL(S)); return S; }\ntemplate<typename Mint> struct ModTools { int MAX; vector<Mint> _fact, _factinv, inv; ModTools(int mx) : MAX(++mx) { _fact.resize(MAX); _factinv.resize(MAX); inv.resize(MAX); _fact[0] = _fact[1] = 1; rep(i, 2, MAX) { _fact[i] = _fact[i-1]*(Mint)i; } _factinv[MAX-1] = (Mint)1/_fact[MAX-1]; rep(i, MAX-2, -1, -1) { _factinv[i] = _factinv[i+1]*(Mint)(i+1); } rep(i, MAX-1, 0, -1) { inv[i] = _factinv[i]*_fact[i-1]; } } Mint div(Mint a, int b) { return a*inv[b]; } Mint fact(int x) { assert(x < MAX); return _fact[x]; } Mint factinv(int x) { assert(x < MAX); return _factinv[x]; } Mint nCr(int n, int r) { if (n < r or r < 0) return 0; r = min(r, n-r); Mint num = _fact[n]; Mint den = _factinv[r] * _factinv[n-r]; return num * den; } Mint nHr(int n, int r) { assert(r+n-1 < MAX); return nCr(r+n-1, r); } Mint nPr(int n, int r) { if (n < r or r < 0) return 0; return _fact[n] * _factinv[n-r]; } Mint double_factorial(int n) { if (n%2 == 0) { int k = n/2; return Mint(2).pow(k)*fact(k); } else { int k = (n+1)/2; return fact(2*k)/Mint(2).pow(k)/fact(k); } } };\ntemplate<typename T> vector<vector<T>> permutations(const vector<T> &A, int N=-1) { if (N == -1) N = A.size(); int M = A.size(); assert(N <= M); vector<vector<T>> comb; rep(bit, 1<<M) { if (popcount(bit) != N) continue; vector<T> res; rep(i, M) { if (bit>>i & 1) { res.pb(A[i]); } } comb.pb(res); } vector<vector<T>> res; for (auto &perm : comb) { sort(ALL(perm)); do { res.pb(perm); } while (next_permutation(ALL(perm))); } return res; }\ntemplate<typename T> vector<vector<T>> combinations(const vector<T> &A, int N) { int M = A.size(); vector<vector<T>> res; auto rec = [&](auto&& f, vector<T> &cur, ll x, ll n) -> void { if (n == N) { res.pb(cur); return; } rep(i, x, M) { cur.pb(A[i]); f(f, cur, i+1, n+1); cur.pop_back(); } }; vector<T> cur; rec(rec, cur, 0, 0); return res; }\nll nC2(ll n) { if (n < 2) return 0; return n*(n-1)/2; }\ntemplate<typename T> T factorial(int x) { T res = 1; for (int i=1; i<=x; i++) res *= i; return res; }\nstruct UnionFind { int n, groupcnt; vector<int> par, rank, sz; vector<bool> tree; UnionFind(int n) : n(n) { par.assign(n, 0); rank.assign(n, 0); sz.assign(n, 1); tree.assign(n, true); rep(i, n) par[i] = i; groupcnt = n; } UnionFind() {} void resize(int _n) { n = _n; par.assign(n, 0); rank.assign(n, 0); sz.assign(n, 1); tree.assign(n, true); rep(i, n) par[i] = i; groupcnt = n; } int find(int x) { if (par[x] == x) { return x; } else { par[x] = find(par[x]); return par[x]; } } int merge(int a, int b) { int x = find(a); int y = find(b); if (x == y) { tree[x] = false; return x; } if (!tree[x] or !tree[y]) { tree[x] = tree[y] = false; } groupcnt--; if (rank[x] < rank[y]) { par[x] = y; sz[y] += sz[x]; return y; } else { par[y] = x; sz[x] += sz[y]; if (rank[x] == rank[y]) { rank[x]++; } return x; } } bool same(int a, int b) { return find(a) == find(b); } ll size(int x) { return sz[find(x)]; } int size() { return groupcnt; } bool is_tree(int x) { return tree[find(x)]; } set<int> get_roots() { set<int> res; rep(i, n) { res.insert(find(i)); } return res; } };\nconst vector<pii> dir4 = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};\n#define directions dir4\nll gridtoid(ll i, ll j, ll W) { return i*W+j; }\npll idtogrid(ll id, ll W) { return divmod(id, W); }\ntemplate<typename _Key, typename _Tp> struct defaultdict : map<_Key, _Tp> { const _Tp init; defaultdict() : init(_Tp()) {}; defaultdict(_Tp init) : init(init) {} _Tp& operator[](const _Key& k) { if (this->count(k)) { return map<_Key, _Tp>::operator[](k); } else { return map<_Key, _Tp>::operator[](k) = init; } } _Tp& operator[](_Key&& k) { if (this->count(k)) { return map<_Key, _Tp>::operator[](k); } else { return map<_Key, _Tp>::operator[](k) = init; } } };\nll gcd(ll a, ll b) { return __gcd(a, b); } template<typename T> T gcd(const vector<T> &A) { T res = 0; for (auto a : A) res = gcd(res, a); return res; }\nll lcm(ll x, ll y) { return x/gcd(x, y)*y; } template<typename T> T lcm(const vector<T> &A) { T res = 1; for (auto a : A) res = lcm(res, a); return res; }\ntemplate<typename T> vector<pair<T, int>> factorize(T n) { vector<pair<T, int>> ret; for (T i=2; i*i<=n; i++) { int cnt = 0; while (n % i == 0) { n /= i; cnt++; } if (cnt) ret.emplace_back(i, cnt); } if (n > 1) ret.emplace_back(n, 1); return ret; }\ntemplate<typename T> vector<T> divisors(T n) { vector<T> res; for (T i=1; i*i<=n; i++) { if (n%i == 0) { res.eb(i); if (n/i != i) res.eb(n/i); } } return res; }\nll isqrt(ll n, bool ceil=false) { ll ok = 0; ll ng = 3037000500; while (ng - ok > 1) { ll m = ok + (ng - ok) / 2; if (m * m <= n) { ok = m; } else { ng = m; } } if (ceil and ok*ok != n) ok++; return ok; }\ntemplate<typename T> struct Accumulate { vector<T> acc; int N; Accumulate(int N) : N(N) { acc.resize(N); } Accumulate(const vector<T> &A) : N(A.size()), acc(A) { build(); } void set(int i, T a) { acc[i] = a; } void add(int i, T a) { acc[i] += a; } void build() { rep(i, N-1) { acc[i+1] += acc[i]; } acc.insert(acc.begin(), 0); } T query(int l, int r) { assert(0 <= l and l <= N and 0 <= r and r <= N); return acc[r]-acc[l]; } T get(int i) { return query(i, i+1); } T operator[](int i) { return query(i, i+1); } ll bisearch_fore(int l, int r, ll x) { if (l > r) return -1; ll l_sm = query(0, l); int ok = r + 1; int ng = l - 1; while (ng+1 < ok) { int mid = (ok+ng) / 2; if (query(0, mid+1) - l_sm >= x) { ok = mid; } else { ng = mid; } } if (ok != r+1) { return ok; } else { return -1; } } ll bisearch_back(int l, int r, ll x) { if (l > r) return -1; ll r_sm = query(0, r+1); int ok = l - 1; int ng = r + 1; while (ok+1 < ng) { int mid = (ok+ng) / 2; if (r_sm - query(0, mid) >= x) { ok = mid; } else { ng = mid; } } if (ok != l-1) { return ok; } else { return -1; } } };\ntemplate<typename T> struct BIT { int sz; vector<T> tree; BIT(int n) { n++; sz = 1; while (sz < n) { sz *= 2; } tree.resize(sz); } T sum(int i) { T s = 0; i++; while (i > 0) { s += tree[i-1]; i -= i & -i; } return s; } void add(int i, T x) { i++; while (i <= sz) { tree[i-1] += x; i += i & -i; } } T query(int l, int r) { return sum(r-1) - sum(l-1); } T get(int i) { return query(i, i+1); } void update(int i, T x) { add(i, x - get(i)); } T operator[](int i) { return query(i, i+1); } void print(int n) { rep(i, n) { cout << query(i, i+1); if (i == n-1) cout << endl; else cout << ' '; } } ll bisearch_fore(int l, int r, ll x) { if (l > r) return -1; ll l_sm = sum(l-1); int ok = r + 1; int ng = l - 1; while (ng+1 < ok) { int mid = (ok+ng) / 2; if (sum(mid) - l_sm >= x) { ok = mid; } else { ng = mid; } } if (ok != r+1) { return ok; } else { return -1; } } ll bisearch_back(int l, int r, ll x) { if (l > r) return -1; ll r_sm = sum(r); int ok = l - 1; int ng = r + 1; while (ok+1 < ng) { int mid = (ok+ng) / 2; if (r_sm - sum(mid-1) >= x) { ok = mid; } else { ng = mid; } } if (ok != l-1) { return ok; } else { return -1; } } };\ntemplate<typename Monoid, typename F> struct SegmentTree { int sz; vector<Monoid> seg; const F f; const Monoid M1; SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) { sz = 1; while(sz < n) sz <<= 1; seg.assign(2 * sz, M1); } SegmentTree(const F f, const Monoid &M1) : f(f), M1(M1) {} void resize(int n) { sz = 1; while(sz < n) sz <<= 1; seg.resize(2 * sz, M1); } void clear() { seg.clear(); } void set(int k, const Monoid &x) { seg[k+sz] = x; } void build() { for(int k = sz - 1; k > 0; k--) { seg[k] = f(seg[2*k], seg[2*k+1]); } } void build(const vector<Monoid> &A) { int n = A.size(); resize(n); rep(i, n) set(i, A[i]); build(); } void update(int k, const Monoid &x) { k += sz; seg[k] = x; while(k >>= 1) { seg[k] = f(seg[2*k], seg[2*k+1]); } } Monoid query(int a, int b) { Monoid L = M1, R = M1; for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) { if(a & 1) L = f(L, seg[a++]); if(b & 1) R = f(seg[--b], R); } return f(L, R); } Monoid operator[](const int &k) const { return seg[k+sz]; } Monoid all() { return seg[1]; } void print(int n) { for (int i=0; i<n; i++) { cout << query(i, i+1); if (i == n-1) cout << endl; else cout << ' '; } } template<typename C> int find_subtree(int a, const C &check, Monoid &M, bool type) { while(a < sz) { Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]); if(check(nxt)) a = 2 * a + type; else M = nxt, a = 2 * a + 1 - type; } return a - sz; } template<typename C> int find_first(int a, const C &check) { Monoid L = M1; if(a <= 0) { if(check(f(L, seg[1]))) return find_subtree(1, check, L, false); return -1; } int b = sz; for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) { if(a & 1) { Monoid nxt = f(L, seg[a]); if(check(nxt)) return find_subtree(a, check, L, false); L = nxt; ++a; } } return -1; } template<typename C> int find_last(int b, const C &check) { Monoid R = M1; if(b >= sz) { if(check(f(seg[1], R))) return find_subtree(1, check, R, true); return -1; } int a = sz; for(b += sz; a < b; a >>= 1, b >>= 1) { if(b & 1) { Monoid nxt = f(seg[--b], R); if(check(nxt)) return find_subtree(b, check, R, true); R = nxt; } } return -1; } }; template<typename Monoid, typename F> SegmentTree<Monoid, F> get_segment_tree(int N, const F& f, const Monoid& M1) { return {N, f, M1}; } template<typename Monoid, typename F> SegmentTree<Monoid, F> get_segment_tree(const F& f, const Monoid& M1) { return {f, M1}; }\nconst string digits = \"0123456789\";\nconst string ascii_lowercase = \"abcdefghijklmnopqrstuvwxyz\";\nconst string ascii_uppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nstring zfill(string str, int len) { string zeros; int n = str.size(); rep(i, len-n) zeros += '0'; return zeros+str; }\nstring bin(ll x) { string res; while (x) { if (x & 1) { res += '1'; } else { res += '0'; } x >>= 1; } reverse(ALL(res)); if (res == \"\") res += '0'; return res; }\n\nvoid solve() {\n ll N, Q;\n cin >> N >> Q;\n \n vector<ll> imos(N);\n rep(i, Q) {\n ll l, k;\n cin >> l >> k;\n l--;\n ll r = l + k;\n imos[l]++;\n if (r < N) {\n imos[r] -= r - l + 1;\n }\n if (r+1 < N) {\n imos[r+1] += r - l;\n }\n }\n\n rep(_, 2) {\n rep(i, 1, N) {\n imos[i] += imos[i-1];\n }\n }\n print(imos);\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n\n // single test case\n solve();\n\n // multi test cases\n // int T;\n // cin >> T;\n // while (T--) solve();\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4572,"score_of_the_acc":-0.0561,"final_rank":1},{"submission_id":"aoj_3165_5941369","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing pii = pair<int, int>;\nusing vvl = vector<vector<ll>>;\nusing vvi = vector<vector<int>>;\nusing vvpll = vector<vector<pll>>;\n#define name4(i, a, b, c, d, e, ...) e\n#define rep(...) name4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rep1(i, a) for (ll i = 0, _aa = a; i < _aa; i++)\n#define rep2(i, a, b) for (ll i = a, _bb = b; i < _bb; i++)\n#define rep3(i, a, b, c) for (ll i = a, _bb = b; (c > 0 && a <= i && i < _bb) or (c < 0 && a >= i && i > _bb); i += c)\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\n#define pb push_back\n#define eb emplace_back\n#define mkp make_pair\n#define ALL(A) A.begin(), A.end()\n#define UNIQUE(A) sort(ALL(A)), A.erase(unique(ALL(A)), A.end())\n#define elif else if\n#define tostr to_string\nconstexpr ll INF = 1e18;\n// constexpr ll INF = LONG_LONG_MAX;\nconstexpr int MOD = 1000000007;\n// constexpr int MOD = 998244353;\n\ntemplate<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); }\ntemplate<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); }\ntemplate<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N, vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }\n\ntemplate<typename T=ll> vector<T> LIST(ll N) { vector<T> A(N); rep(i, N) cin >> A[i]; return A; }\n\nvoid print() { cout << '\\n'; }\ntemplate<typename T> void print(T out) { cout << out << '\\n'; }\ntemplate<typename T1, typename T2> void print(pair<T1, T2> out) { cout << out.first << ' ' << out.second << '\\n'; }\ntemplate<typename T> void print(const vector<T> &A) { rep(i, A.size()) { cout << A[i]; if (i != A.size()-1) cout << ' '; } cout << '\\n'; }\ntemplate<typename T> void print(const deque<T> &A) { vector<T> V(A.begin(), A.end()); print(V); }\ntemplate<typename T> void print(const set<T> &S) { vector<T> A(S.begin(), S.end()); print(A); }\n#define debug(x) (cout << #x << \": \", print(x));\n\nvoid Yes() { print(\"Yes\"); }\nvoid No() { print(\"No\"); }\nvoid YES() { print(\"YES\"); }\nvoid NO() { print(\"NO\"); }\n\n// from common.cpp\nll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; }\nint toint(char num) { return num - '0'; }\nchar tochar(int num) { return '0' + num; }\nll floor(ll a, ll b) { if (a < 0) return (a-b+1) / b; else return a / b; }\nll ceil(ll a, ll b) { if (a >= 0) return (a+b-1) / b; else return a / b; }\nll modulo(ll a, ll b) { return ((a % b) + b) % b; }\ntemplate<typename T> pll divmod(ll a, T b) { ll d = a / b; ll m = a % b; return {d, m}; }\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\ntemplate<typename T> T sum(const vector<T> &A) { T res = 0; for (T a: A) res += a; return res; }\ntemplate<typename key, typename val> val sum(const map<key, val> &mp) { val res = 0; for (auto [k, v] : mp) res += v; return res; }\ntemplate<typename T> T max(const vector<T> &A) { return *max_element(ALL(A)); }\ntemplate<typename T> T min(const vector<T> &A) { return *min_element(ALL(A)); }\nll pow(int x, int n) { ll res = 1; rep(_, n) res *= x; return res; }\nll pow(int x, ll n) { ll res = 1; rep(_, n) res *= x; return res; }\nll pow(ll x, int n) { ll res = 1; rep(_, n) res *= x; return res; }\nll pow(ll x, ll n) { ll res = 1; rep(_, n) res *= x; return res; }\nll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }\nint popcount(ll S) { return __builtin_popcountll(S); }\nint bit_length(ll x) { return x != 0 ? floor(log2((ld)x))+1 : 0; }\ntemplate<typename T> int bisect_left(const vector<T> &A, T val, int lo=0) { return lower_bound(A.begin()+lo, A.end(), val) - A.begin(); }\ntemplate<typename T> int bisect_right(const vector<T> &A, T val, int lo=0) { return upper_bound(A.begin()+lo, A.end(), val) - A.begin(); }\ntemplate<typename T> map<T, ll> Counter(const vector<T> &A) { map<T, ll> res; for (T a : A) res[a]++; return res; }\ntemplate<typename T> vector<ll> Counter(const vector<T> &A, T mx) { vector<ll> res(mx+1); for (T a : A) { res[a]++; } return res; }\nmap<char, ll> Counter(const string &S) { map<char, ll> res; for (char c : S) res[c]++; return res; }\ntemplate<typename F> ll bisearch_min(ll mn, ll mx, const F &func) { ll ok = mx, ng = mn; while (ng+1 < ok) { ll mid = (ok+ng) / 2; if (func(mid)) ok = mid; else ng = mid; } return ok; }\ntemplate<typename F> ll bisearch_max(ll mn, ll mx, const F &func) { ll ok = mn, ng = mx; while (ok+1 < ng) { ll mid = (ok+ng) / 2; if (func(mid)) ok = mid; else ng = mid; } return ok; }\ntemplate<typename T1, typename T2> pair<vector<T1>, vector<T2>> zip(const vector<pair<T1, T2>> &A) { ll N = A.size(); pair<vector<T1>, vector<T2>> res = {vector<T1>(N), vector<T2>(N)}; rep(i, N) { res.first[i] = A[i].first; res.second[i] = A[i].second; } return res; }\ntemplate<typename T1, typename T2, typename T3> tuple<vector<T1>, vector<T2>, vector<T3>> zip(const vector<tuple<T1, T2, T3>> &A) { int N = A.size(); tuple<vector<T1>, vector<T2>, vector<T3>> res = {vector<T1>(N), vector<T2>(N), vector<T3>(N)}; rep(i, N) { get<0>(res)[i] = get<0>(A[i]); get<1>(res)[i] = get<1>(A[i]); get<2>(res)[i] = get<2>(A[i]); } return res; }\ntemplate<typename T> struct Compress { int N; vector<T> dat; Compress(vector<T> A) { sort(A.begin(), A.end()); A.erase(unique(A.begin(), A.end()), A.end()); N = A.size(); dat = A; } int zip(T x) { return bisect_left(dat, x); } T unzip(int x) { return dat[x]; } int operator[](T x) { return zip(x); } int size() { return dat.size(); } vector<T> zip(const vector<T> &A) { int M = A.size(); vector<T> res(M); rep(i, M) res[i] = zip(A[i]); return res; } };\ntemplate<typename T> vector<pair<T, int>> RLE(const vector<T> &A) { if (A.empty()) return {}; int N = A.size(); vector<pair<T, int>> res; T cur = A[0]; int cnt = 1; rep(i, 1, N) { if (A[i] == A[i-1]) { cnt++; } else { res.pb({cur, cnt}); cnt = 1; cur = A[i]; } } res.pb({cur, cnt}); return res; }\nvector<pair<char, int>> RLE(const string &S) { if (S.empty()) return {}; int N = S.size(); vector<pair<char, int>> res; char cur = S[0]; int cnt = 1; rep(i, 1, N) { if (S[i] == S[i-1]) { cnt++; } else { res.pb({cur, cnt}); cnt = 1; cur = S[i]; } } res.pb({cur, cnt}); return res; }\nbool mul_overflow(ll x, ll y) { ll z; return __builtin_mul_overflow(x, y, &z); }\nvector<ll> split(const string &S, char separator) { int N = S.size(); vector<ll> res; string cur; rep(i, N) { if (S[i] == separator) { res.eb(toint(cur)); cur = \"\"; } else { cur += S[i]; } } if (cur.size()) res.eb(toint(cur)); return res; }\nstring to_string(const string &S) { return S; }\nstring to_string(char c) { return {c}; }\ntemplate<typename T> string join(const vector<T> &A, char separator=0) { int N = A.size(); string res; rep(i, N) { res += tostr(A[i]); if (separator != 0 and i != N-1) res += separator; } return res; }\n\n// from combinatorics.cpp\ntemplate<int mod> struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int) (1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } static int get_mod() { return mod; } };\nusing mint = ModInt<MOD>;\ntemplate<typename T=mint> struct ModTools { int MAX; vector<T> fact, factinv; ModTools() {}; ModTools(int mx) { build(mx); } void build(int mx) { MAX = ++mx; fact.resize(MAX); factinv.resize(MAX); fact[0] = fact[1] = 1; rep(i, 2, MAX) { fact[i] = fact[i-1] * i; } factinv[MAX-1] = (T)1 / fact[MAX-1]; rep(i, MAX-2, -1, -1) { factinv[i] = factinv[i+1] * (i+1); } } T factorial(int x) { return fact[x]; } T inverse(int x) { return factinv[x]; } T nCr(int n, int r) { if (n < r or r < 0) return 0; r = min(r, n-r); T num = fact[n]; T den = factinv[r] * factinv[n-r]; return num * den; } T nHr(int n, int r) { return nCr(r+n-1, r); } T nPr(int n, int r) { if (n < r or r < 0) return 0; return fact[n] * factinv[n-r]; } };\ntemplate<typename T> vector<vector<T>> permutations(const vector<T> &A, int N=-1) { if (N == -1) N = A.size(); int M = A.size(); vector<vector<T>> comb; rep(bit, 1<<M) { if (popcount(bit) != N) continue; vector<T> res; rep(i, M) { if (bit>>i & 1) { res.pb(A[i]); } } comb.pb(res); } vector<vector<T>> res; for (auto &perm : comb) { sort(ALL(perm)); do { res.pb(perm); } while (next_permutation(ALL(perm))); } return res; }\ntemplate<typename T> vector<vector<T>> combinations(const vector<T> &A, int N) { int M = A.size(); vector<vector<T>> res; auto rec = [&](auto&& f, vector<T> &cur, ll x, ll n) -> void { if (n == N) { res.pb(cur); return; } rep(i, x, M) { cur.pb(A[i]); f(f, cur, i+1, n+1); cur.pop_back(); } }; vector<T> cur; rec(rec, cur, 0, 0); return res; }\ntemplate<typename T> T factorial(T x) { T res = 1; for (T i=1; i<=x; i++) res *= i; return res; }\n\n// from graph.cpp\nstruct UnionFind { int n, groupcnt; vector<int> par, rank, sz; vector<bool> tree; UnionFind(int n) : n(n) { par.resize(n); rank.resize(n); sz.resize(n, 1); tree.resize(n, 1); rep(i, n) par[i] = i; groupcnt = n; } UnionFind() {} void resize(int _n) { n = _n; par.resize(n); rank.resize(n); sz.resize(n, 1); rep(i, n) par[i] = i; groupcnt = n; } int find(int x) { if (par[x] == x) { return x; } else { par[x] = find(par[x]); return par[x]; } } int merge(int a, int b) { int x = find(a); int y = find(b); if (x == y) { tree[x] = false; return x; } if (!tree[x] or !tree[y]) { tree[x] = tree[y] = false; } groupcnt--; if (rank[x] < rank[y]) { par[x] = y; sz[y] += sz[x]; return y; } else { par[y] = x; sz[x] += sz[y]; if (rank[x] == rank[y]) { rank[x]++; } return x; } } bool same(int a, int b) { return find(a) == find(b); } ll size(int x) { return sz[find(x)]; } int size() { return groupcnt; } bool is_tree(int x) { return tree[find(x)]; } set<int> get_roots() { set<int> res; rep(i, n) { res.insert(find(i)); } return res; } };\n\n// from grid.cpp\nconst vector<pii> directions = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};\nll gridtoid(ll i, ll j, ll W) { return i*W+j; }\npll idtogrid(ll id, ll W) { return divmod(id, W); }\ntemplate<typename T> vector<vector<T>> transpose(const vector<vector<T>> &grid) { int H = grid.size(); int W = grid[0].size(); auto res = list2d(W, H, (T)0); rep(i, H) { rep(j, W) { res[j][i] = grid[i][j]; } } return res; }\nvector<string> transpose(const vector<string> &grid) { int H = grid.size(); int W = grid[0].size(); vector<string> res(W, string(H, '*')); rep(i, H) { rep(j, W) { res[j][i] = grid[i][j]; } } return res; }\nvector<string> rot90(const vector<string> &grid) { int H = grid.size(); int W = grid[0].size(); vector<string> res(W, string(H, '*')); rep(i, H) { rep(j, W) { res[j][H-i-1] = grid[i][j]; } } return res; }\n\n// from mystl.cpp\ntemplate<typename _Key, typename _Tp, typename _Compare=less<_Key>, typename _Alloc=allocator<pair<const _Key, _Tp>>> struct defaultdict : public map<_Key, _Tp, _Compare, _Alloc> { const _Tp init; defaultdict() : init(_Tp()) {}; defaultdict(_Tp init) : init(init) {} _Tp& operator[](const _Key& k) { if (this->count(k)) { return map<_Key, _Tp, _Compare, _Alloc>::operator[](k); } else { return map<_Key, _Tp, _Compare, _Alloc>::operator[](k) = init; } } _Tp& operator[](_Key&& k) { if (this->count(k)) { return map<_Key, _Tp, _Compare, _Alloc>::operator[](k); } else { return map<_Key, _Tp, _Compare, _Alloc>::operator[](k) = init; } } };\ntemplate<typename _Key, typename _Compare=less<_Key>, typename _Alloc=allocator<_Key>> struct my_set : public set<_Key, _Compare, _Alloc> { _Key front() { return *this->begin(); } _Key pop_front() { auto res = this->front(); this->erase(this->begin()); return res; } _Key back() { return *this->rbegin(); } _Key pop_back() { auto res = this->back(); this->erase(prev(this->end())); return res; } };\ntemplate<typename _Key, typename _Compare=less<_Key>, typename _Alloc=allocator<_Key>> struct my_multiset : public multiset<_Key, _Compare, _Alloc> { _Key front() { return *this->begin(); } _Key pop_front() { auto res = this->front(); this->erase(this->begin()); return res; } _Key back() { return *this->rbegin(); } _Key pop_back() { auto res = this->back(); this->erase(prev(this->end())); return res; } };\ntemplate<typename _Tp, typename _Sequence=vector<_Tp>, typename _Compare=less<typename _Sequence::value_type>> struct my_priority_queue : public priority_queue<_Tp, _Sequence, _Compare> { _Tp pop() { auto res = this->top(); priority_queue<_Tp, _Sequence, _Compare>::pop(); return res; } };\ntemplate<typename _Tp, typename _Sequence=deque<_Tp>> struct my_queue : public queue<_Tp, _Sequence> { _Tp pop() { auto res = this->front(); queue<_Tp, _Sequence>::pop(); return res; } };\ntemplate<typename _Tp, typename _Alloc=std::allocator<_Tp>> struct my_deque : public deque<_Tp, _Alloc> { _Tp pop_front() { auto res = this->front(); deque<_Tp, _Alloc>::pop_front(); return res; } _Tp pop_back() { auto res = this->back(); deque<_Tp, _Alloc>::pop_back(); return res; } };\n\n// from numbers.cpp\nll gcd(ll a, ll b) { return __gcd(a, b); }\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\ntemplate<typename T> vector<pair<T, int>> factorize(T n) { vector<pair<T, int>> ret; for(T i=2; i*i<=n; i++) { int cnt = 0; while(n % i == 0) { n /= i; cnt++; } if(cnt) ret.emplace_back(i, cnt); } if(n > 1) ret.emplace_back(n, 1); return ret; }\nvector<ll> divisors(ll n) { vector<ll> res; for (ll i=1; i*i<=n; i++) { if (n%i == 0) { res.pb(i); if (n/i != i) res.pb(n/i); } } return res; }\nll ntod(string S, ll n) { ll res = 0, k = 1; reverse(ALL(S)); for (char &c : S) { res += k*toint(c); k *= n; } return res; }\nstring dton(ll num, ll n, char base='0') { string res; while (abs(num) > 0) { ll m = num % abs(n); num -= m; res += base+m; num /= n; } reverse(ALL(res)); if (res != \"\") { return res; } else { return res+base; } }\nll isqrt(ll n, bool ceil=false) { ll ok = 0; ll ng = 3037000500; while (ng - ok > 1) { ll m = ok + (ng - ok) / 2; if (m * m <= n) { ok = m; } else { ng = m; } } if (ceil and ok*ok != n) ok++; return ok; }\nll digit_sum(ll n) { ll res = 0; while (n > 0) { res += n % 10; n /= 10; } return res; }\nll digit_sum(string S) { ll res = 0; rep(i, S.size()) { res += toint(S[i]); } return res; }\n\n// from segment.cpp\ntemplate<typename T> struct Accumulate { vector<T> acc; int N; Accumulate() {} Accumulate(int N) : N(N) { acc.resize(N); } Accumulate(const vector<T> &A) { N = A.size(); acc = A; build(); } void set(int i, T a) { acc[i] = a; } void build() { rep(i, N-1) { acc[i+1] += acc[i]; } acc.insert(acc.begin(), 0); } T query(int l, int r) { assert(0 <= l and l <= N and 0 <= r and r <= N); return acc[r]-acc[l]; } T get(int i) { return query(i, i+1); } T operator[](int i){ return query(i, i+1); } ll bisearch_fore(int l, int r, ll x) { if (l > r) return -1; ll l_sm = query(0, l); int ok = r + 1; int ng = l - 1; while (ng+1 < ok) { int mid = (ok+ng) / 2; if (query(0, mid+1) - l_sm >= x) { ok = mid; } else { ng = mid; } } if (ok != r+1) { return ok; } else { return -1; } } ll bisearch_back(int l, int r, ll x) { if (l > r) return -1; ll r_sm = query(0, r+1); int ok = l - 1; int ng = r + 1; while (ok+1 < ng) { int mid = (ok+ng) / 2; if (r_sm - query(0, mid) >= x) { ok = mid; } else { ng = mid; } } if (ok != l-1) { return ok; } else { return -1; } } };\ntemplate<typename T> struct BIT { int sz; vector<T> tree; BIT(int n) { n++; sz = 1; while (sz < n) { sz *= 2; } tree.resize(sz); } T sum(int i) { T s = 0; i++; while (i > 0) { s += tree[i-1]; i -= i & -i; } return s; } void add(int i, T x) { i++; while (i <= sz) { tree[i-1] += x; i += i & -i; } } T query(int l, int r) { return sum(r-1) - sum(l-1); } T get(int i) { return query(i, i+1); } void update(int i, T x) { add(i, x - get(i)); } T operator[](int i) { return query(i, i+1); } void print(int n) { rep(i, n) { cout << query(i, i+1); if (i == n-1) cout << endl; else cout << ' '; } } ll bisearch_fore(int l, int r, ll x) { if (l > r) return -1; ll l_sm = sum(l-1); int ok = r + 1; int ng = l - 1; while (ng+1 < ok) { int mid = (ok+ng) / 2; if (sum(mid) - l_sm >= x) { ok = mid; } else { ng = mid; } } if (ok != r+1) { return ok; } else { return -1; } } ll bisearch_back(int l, int r, ll x) { if (l > r) return -1; ll r_sm = sum(r); int ok = l - 1; int ng = r + 1; while (ok+1 < ng) { int mid = (ok+ng) / 2; if (r_sm - sum(mid-1) >= x) { ok = mid; } else { ng = mid; } } if (ok != l-1) { return ok; } else { return -1; } } };\ntemplate<typename Monoid, typename F> struct SegmentTree { int sz; vector<Monoid> seg; const F f; const Monoid M1; SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) { sz = 1; while(sz < n) sz <<= 1; seg.assign(2 * sz, M1); } SegmentTree(const F f, const Monoid &M1) : f(f), M1(M1) {} void resize(int n) { sz = 1; while(sz < n) sz <<= 1; seg.resize(2 * sz, M1); } void clear() { seg.clear(); } void set(int k, const Monoid &x) { seg[k+sz] = x; } void build() { for(int k = sz - 1; k > 0; k--) { seg[k] = f(seg[2*k], seg[2*k+1]); } } void build(const vector<Monoid> &A) { int n = A.size(); resize(n); rep(i, 0, n) set(i, A[i]); build(); } void update(int k, const Monoid &x) { k += sz; seg[k] = x; while(k >>= 1) { seg[k] = f(seg[2*k], seg[2*k+1]); } } Monoid query(int a, int b) { Monoid L = M1, R = M1; for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) { if(a & 1) L = f(L, seg[a++]); if(b & 1) R = f(seg[--b], R); } return f(L, R); } Monoid operator[](const int &k) const { return seg[k+sz]; } Monoid all() { return seg[1]; } void print(int n) { rep(i, n) { cout << query(i, i+1); if (i == n-1) cout << endl; else cout << ' '; } } template<typename C> int find_subtree(int a, const C &check, Monoid &M, bool type) { while(a < sz) { Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]); if(check(nxt)) a = 2 * a + type; else M = nxt, a = 2 * a + 1 - type; } return a - sz; } template<typename C> int find_first(int a, const C &check) { Monoid L = M1; if(a <= 0) { if(check(f(L, seg[1]))) return find_subtree(1, check, L, false); return -1; } int b = sz; for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) { if(a & 1) { Monoid nxt = f(L, seg[a]); if(check(nxt)) return find_subtree(a, check, L, false); L = nxt; ++a; } } return -1; } template<typename C> int find_last(int b, const C &check) { Monoid R = M1; if(b >= sz) { if(check(f(seg[1], R))) return find_subtree(1, check, R, true); return -1; } int a = sz; for(b += sz; a < b; a >>= 1, b >>= 1) { if(b & 1) { Monoid nxt = f(seg[--b], R); if(check(nxt)) return find_subtree(b, check, R, true); R = nxt; } } return -1; } }; template<typename Monoid, typename F> SegmentTree<Monoid, F> get_segment_tree(int N, const F& f, const Monoid& M1) { return {N, f, M1}; } template<typename Monoid, typename F> SegmentTree<Monoid, F> get_segment_tree(const F& f, const Monoid& M1) { return {f, M1}; }\n\n// from strings.cpp\nconst string digits = \"0123456789\";\nconst string ascii_lowercase = \"abcdefghijklmnopqrstuvwxyz\";\nconst string ascii_uppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\nstring replace(string str, const string& replace, const string& with) { if(!replace.empty()) { size_t pos = 0; while ((pos = str.find(replace, pos)) != string::npos) { str.replace(pos, replace.length(), with); pos += with.length(); } } return str; }\nstring zfill(string str, int len) { string zeros; int n = str.size(); rep(i, len-n) zeros += '0'; return zeros+str; }\nstring bin(ll x) { string res; while (x) { if (x & 1) res += '1'; else res += '0'; x >>= 1; } reverse(ALL(res)); if(res == \"\") res += '0'; return res; }\n\n// 遅延評価セグメント木\ntemplate<typename F, typename G, typename H, typename Monoid, typename OperatorMonoid>\nstruct LazySegmentTree {\n int sz, height;\n vector<Monoid> data;\n vector<OperatorMonoid> lazy;\n const F f;\n const G g;\n const H h;\n const Monoid M1;\n const OperatorMonoid OM0;\n\n LazySegmentTree(int n, const F f, const G g, const H h,\n const Monoid &M1, const OperatorMonoid OM0)\n : f(f), g(g), h(h), M1(M1), OM0(OM0) {\n sz = 1;\n height = 0;\n while(sz < n) sz <<= 1, height++;\n data.assign(2 * sz, M1);\n lazy.assign(2 * sz, OM0);\n }\n\n LazySegmentTree(const F f, const G g, const H h,\n const Monoid &M1, const OperatorMonoid OM0)\n : f(f), g(g), h(h), M1(M1), OM0(OM0) {}\n\n void set(int k, const Monoid &x) {\n data[k + sz] = x;\n }\n\n void build() {\n for(int k = sz - 1; k > 0; k--) {\n data[k] = f(data[2 * k + 0], data[2 * k + 1]);\n }\n }\n\n void build(const vector<Monoid> &A) {\n int n = A.size();\n sz = 1;\n height = 0;\n while(sz < n) sz <<= 1, height++;\n data.assign(2 * sz, M1);\n lazy.assign(2 * sz, OM0);\n rep(i, n) set(i, A[i]);\n build();\n }\n\n inline void propagate(int k) {\n if(lazy[k] == OM0) return;\n lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);\n lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);\n data[k] = apply(k);\n lazy[k] = OM0;\n }\n\n inline Monoid apply(int k) {\n return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);\n }\n\n inline void recalc(int k) {\n while(k >>= 1) data[k] = f(apply(2 * k + 0), apply(2 * k + 1));\n }\n\n inline void thrust(int k) {\n for(int i = height; i > 0; i--) propagate(k >> i);\n }\n\n void update(int a, int b, const OperatorMonoid &x) {\n if(a >= b) return;\n thrust(a += sz);\n thrust(b += sz - 1);\n for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\n if(l & 1) lazy[l] = h(lazy[l], x), ++l;\n if(r & 1) --r, lazy[r] = h(lazy[r], x);\n }\n recalc(a);\n recalc(b);\n }\n\n Monoid query(int a, int b) {\n if(a >= b) return M1;\n thrust(a += sz);\n thrust(b += sz - 1);\n Monoid L = M1, R = M1;\n for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\n if(l & 1) L = f(L, apply(l++));\n if(r & 1) R = f(apply(--r), R);\n }\n return f(L, R);\n }\n\n Monoid operator[](const int &k) {\n return query(k, k + 1);\n }\n\n void update(int i, const OperatorMonoid &x) {\n update(i, i+1, x);\n }\n\n template<typename P=ll>\n void print(int n) {\n rep(i, n) {\n cout << (P)query(i, i+1);\n if (i == n-1) cout << '\\n';\n else cout << ' ';\n }\n }\n\n template<typename C>\n int find_subtree(int a, const C &check, Monoid &M, bool type) {\n while(a < sz) {\n propagate(a);\n Monoid nxt = type ? f(apply(2 * a + type), M) : f(M, apply(2 * a + type));\n if(check(nxt)) a = 2 * a + type;\n else M = nxt, a = 2 * a + 1 - type;\n }\n return a - sz;\n }\n\n // 区間[a,N)でcheckの条件を満たすような最小位置を返す(なければ-1)\n template<typename C>\n int find_first(int a, const C &check) {\n Monoid L = M1;\n if(a <= 0) {\n if(check(f(L, apply(1)))) return find_subtree(1, check, L, false);\n return -1;\n }\n thrust(a + sz);\n int b = sz;\n for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n if(a & 1) {\n Monoid nxt = f(L, apply(a));\n if(check(nxt)) return find_subtree(a, check, L, false);\n L = nxt;\n ++a;\n }\n }\n return -1;\n }\n\n // 区間[0,b)でcheckの条件を満たすような最大位置を返す(なければ-1)\n template<typename C>\n int find_last(int b, const C &check) {\n Monoid R = M1;\n if(b >= sz) {\n if(check(f(apply(1), R))) return find_subtree(1, check, R, true);\n return -1;\n }\n thrust(b + sz - 1);\n int a = sz;\n for(b += sz; a < b; a >>= 1, b >>= 1) {\n if(b & 1) {\n Monoid nxt = f(apply(--b), R);\n if(check(nxt)) return find_subtree(b, check, R, true);\n R = nxt;\n }\n }\n return -1;\n }\n};\n\ntemplate<typename F, typename G, typename H, typename T, typename E>\nLazySegmentTree<F, G, H, T, E> get_lazy_segment_tree(const F& f, const G& g, const H& h, const T& ti, const E& ei) {\n return {f, g, h, ti, ei};\n}\n\ntemplate<typename F, typename G, typename H, typename T, typename E>\nLazySegmentTree<F, G, H, T, E> get_lazy_segment_tree(int N, const F& f, const G& g, const H& h, const T& ti, const E& ei) {\n return {N, f, g, h, ti, ei};\n}\n\n// 区間和取得・区間等差数列加算\n// 参考：https://opt-cp.com/lazysegtree-practice/\nstruct Node {\n ll val, left;\n operator ll() const { return val; }\n};\nstruct Func {\n ll cnt, sub;\n bool operator==(const Func &f) const {\n return cnt == f.cnt and sub == f.sub;\n }\n};\nauto f = [](const Node &a, const Node &b) -> Node { \n return { a.val+b.val, min(a.left, b.left) };\n};\nauto g = [](const Node &a, const Func &b) -> Node {\n return { a.val+b.cnt*a.left+b.sub, a.left }; \n};\nauto h = [](const Func &a, const Func &b) -> Func {\n return { a.cnt+b.cnt, a.sub+b.sub };\n};\nconst Node T = {0, INF};\nconst Func E = {0, 0};\n\nvoid solve() {\n ll N, Q;\n cin >> N >> Q;\n\n auto seg = get_lazy_segment_tree(N, f, g, h, T, E);\n const ll a = 1, d = 1;\n rep(i, N) {\n // 数列の先頭を初項0とした公差dの等差数列でleftを初期化\n seg.set(i, {0, i*d});\n }\n seg.build();\n rep(_, Q) {\n ll l, k;\n cin >> l >> k;\n l--;\n ll r = l+k;\n // seg.print(N);\n // 位置lを初項aとした公差dの等差数列を[l,r)に加算\n seg.update(l, r, {1, a-l*d});\n }\n seg.print(N);\n // print(seg.query(0, 3));\n // print(seg.query(6, 10));\n // print(seg.query(5, 7));\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n\n // single test case\n solve();\n\n // multi test cases\n // int T;\n // cin >> T;\n // while (T--) solve();\n\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":19572,"score_of_the_acc":-1.0298,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_3165_10637653\",\n \"code_snippet\": \"#pragma region Macros\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing lint = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing int128 = __int128_t;\\n#define all(x) (x).begin(), (x).end()\\n#define EPS 1e-8\\n#define uniqv(v) v.erase(unique(all(v)), v.end())\\n#define OVERLOAD_REP(_1, _2, _3, name, ...) name\\n#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))\\n#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))\\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\\n#define log(x) cout << x << endl\\n#define logfixed(x) cout << fixed << setprecision(10) << x << endl;\\n#define logy(bool) \\\\\\n if (bool) { \\\\\\n cout << \\\"Yes\\\" << endl; \\\\\\n } else { \\\\\\n cout << \\\"No\\\" << endl; \\\\\\n }\\n\\nostream &operator<<(ostream &dest, __int128_t value) {\\n ostream::sentry s(dest);\\n if (s) {\\n __uint128_t tmp = value < 0 ? -value : value;\\n char buffer[128];\\n char *d = end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[tmp % 10];\\n tmp /= 10;\\n } while (tmp != 0);\\n if (value < 0) {\\n --d;\\n *d = '-';\\n }\\n int len = end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n for (int i = 0; i < (int)v.size(); i++) {\\n os << v[i] << (i + 1 != (int)v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const set<T> &set_var) {\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end()) os << \\\" \\\";\\n itr--;\\n }\\n return os;\\n}\\n\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << itr->first << \\\" -> \\\" << itr->second << \\\"\\\\n\\\";\\n }\\n return os;\\n}\\n\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const pair<T, U> &pair_var) {\\n os << \\\"(\\\" << pair_var.first << \\\", \\\" << pair_var.second << \\\")\\\";\\n return os;\\n}\\n\\nvoid out() { cout << '\\\\n'; }\\ntemplate <class T, class... Ts>\\nvoid out(const T &a, const Ts &...b) {\\n cout << a;\\n (cout << ... << (cout << ' ', b));\\n cout << '\\\\n';\\n}\\n\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v) {\\n for (T &in : v) is >> in;\\n return is;\\n}\\n\\ninline void in(void) { return; }\\ntemplate <typename First, typename... Rest>\\nvoid in(First &first, Rest &...rest) {\\n cin >> first;\\n in(rest...);\\n return;\\n}\\n\\ntemplate <typename T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nvector<lint> dx8 = {1, 1, 0, -1, -1, -1, 0, 1};\\nvector<lint> dy8 = {0, 1, 1, 1, 0, -1, -1, -1};\\nvector<lint> dx4 = {1, 0, -1, 0};\\nvector<lint> dy4 = {0, 1, 0, -1};\\n\\n#pragma endregion\\n\\ntemplate <class S,\\n auto op,\\n auto e,\\n class F,\\n auto mapping,\\n auto composition,\\n auto id>\\nstruct lazy_segtree {\\n private:\\n unsigned int seg_bit_ceil(unsigned int n) {\\n unsigned int x = 1;\\n while (x < (unsigned int)(n)) x *= 2;\\n return x;\\n }\\n\\n public:\\n static_assert(std::is_convertible_v<decltype(op), std::function<S(S, S)>>,\\n \\\"op must work as S(S, S)\\\");\\n static_assert(std::is_convertible_v<decltype(e), std::function<S()>>,\\n \\\"e must work as S()\\\");\\n static_assert(\\n std::is_convertible_v<decltype(mapping), std::function<S(F, S)>>,\\n \\\"mapping must work as F(F, S)\\\");\\n static_assert(\\n std::is_convertible_v<decltype(composition), std::function<F(F, F)>>,\\n \\\"compostiion must work as F(F, F)\\\");\\n static_assert(std::is_convertible_v<decltype(id), std::function<F()>>,\\n \\\"id must work as F()\\\");\\n lazy_segtree() : lazy_segtree(0) {}\\n explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\\n explicit lazy_segtree(const std::vector<S> &v) : _n(int(v.size())) {\\n size = (int)seg_bit_ceil((unsigned int)(_n));\\n log = __builtin_ctz((unsigned int)size);\\n d = std::vector<S>(2 * size, e());\\n lz = std::vector<F>(size, id());\\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\\n for (int i = size - 1; i >= 1; i--) {\\n update(i);\\n }\\n }\\n\\n void set(int p, S x) {\\n assert(0 <= p && p < _n);\\n p += size;\\n for (int i = log; i >= 1; i--) push(p >> i);\\n d[p] = x;\\n for (int i = 1; i <= log; i++) update(p >> i);\\n }\\n\\n S get(int p) {\\n assert(0 <= p && p < _n);\\n p += size;\\n for (int i = log; i >= 1; i--) push(p >> i);\\n return d[p];\\n }\\n\\n S prod(int l, int r) {\\n assert(0 <= l && l <= r && r <= _n);\\n if (l == r) return e();\\n\\n l += size;\\n r += size;\\n\\n for (int i = log; i >= 1; i--) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n\\n S sml = e(), smr = e();\\n while (l < r) {\\n if (l & 1) sml = op(sml, d[l++]);\\n if (r & 1) smr = op(d[--r], smr);\\n l >>= 1;\\n r >>= 1;\\n }\\n\\n return op(sml, smr);\\n }\\n\\n S all_prod() { return d[1]; }\\n\\n void apply(int p, F f) {\\n assert(0 <= p && p < _n);\\n p += size;\\n for (int i = log; i >= 1; i--) push(p >> i);\\n d[p] = mapping(f, d[p]);\\n for (int i = 1; i <= log; i++) update(p >> i);\\n }\\n void apply(int l, int r, F f) {\\n assert(0 <= l && l <= r && r <= _n);\\n if (l == r) return;\\n\\n l += size;\\n r += size;\\n\\n for (int i = log; i >= 1; i--) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n\\n {\\n int l2 = l, r2 = r;\\n while (l < r) {\\n if (l & 1) all_apply(l++, f);\\n if (r & 1) all_apply(--r, f);\\n l >>= 1;\\n r >>= 1;\\n }\\n l = l2;\\n r = r2;\\n }\\n\\n for (int i = 1; i <= log; i++) {\\n if (((l >> i) << i) != l) update(l >> i);\\n if (((r >> i) << i) != r) update((r - 1) >> i);\\n }\\n }\\n\\n template <bool (*g)(S)>\\n int max_right(int l) {\\n return max_right(l, [](S x) { return g(x); });\\n }\\n template <class G>\\n int max_right(int l, G g) {\\n assert(0 <= l && l <= _n);\\n assert(g(e()));\\n if (l == _n) return _n;\\n l += size;\\n for (int i = log; i >= 1; i--) push(l >> i);\\n S sm = e();\\n do {\\n while (l % 2 == 0) l >>= 1;\\n if (!g(op(sm, d[l]))) {\\n while (l < size) {\\n push(l);\\n l = (2 * l);\\n if (g(op(sm, d[l]))) {\\n sm = op(sm, d[l]);\\n l++;\\n }\\n }\\n return l - size;\\n }\\n sm = op(sm, d[l]);\\n l++;\\n } while ((l & -l) != l);\\n return _n;\\n }\\n\\n template <bool (*g)(S)>\\n int min_left(int r) {\\n return min_left(r, [](S x) { return g(x); });\\n }\\n template <class G>\\n int min_left(int r, G g) {\\n assert(0 <= r && r <= _n);\\n assert(g(e()));\\n if (r == 0) return 0;\\n r += size;\\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\\n S sm = e();\\n do {\\n r--;\\n while (r > 1 && (r % 2)) r >>= 1;\\n if (!g(op(d[r], sm))) {\\n while (r < size) {\\n push(r);\\n r = (2 * r + 1);\\n if (g(op(d[r], sm))) {\\n sm = op(d[r], sm);\\n r--;\\n }\\n }\\n return r + 1 - size;\\n }\\n sm = op(d[r], sm);\\n } while ((r & -r) != r);\\n return 0;\\n }\\n\\n private:\\n int _n, size, log;\\n std::vector<S> d;\\n std::vector<F> lz;\\n\\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\\n void all_apply(int k, F f) {\\n d[k] = mapping(f, d[k]);\\n if (k < size) lz[k] = composition(f, lz[k]);\\n }\\n void push(int k) {\\n all_apply(2 * k, lz[k]);\\n all_apply(2 * k + 1, lz[k]);\\n lz[k] = id();\\n }\\n};\\n\\nclass RangeLinearAddRangeSum {\\n private:\\n static constexpr long long INF = 8e18;\\n static constexpr int INFI = int(1e9) + 10;\\n\\n struct S {\\n long long sum;\\n int l, r;\\n };\\n struct F {\\n long long a, b;\\n };\\n\\n static S op(S a, S b) {\\n return S{a.sum + b.sum, min(a.l, b.l), max(a.r, b.r)};\\n }\\n static S e() {\\n return S{0, INFI, -INFI};\\n }\\n\\n static S mapping(F f, S s) {\\n return {s.sum + (f.a * (s.l + s.r - 1) + f.b * 2) * (s.r - s.l) / 2, s.l, s.r};\\n }\\n\\n static F composition(F f, F g) {\\n return {f.a + g.a, f.b + g.b};\\n }\\n\\n static F id() {\\n return F{0, 0};\\n }\\n\\n lazy_segtree<S, op, e, F, mapping, composition, id> seg;\\n\\n public:\\n RangeLinearAddRangeSum(const vector<long long> &v) {\\n int n = int(v.size());\\n vector<S> tmp(n);\\n for (int i = 0; i < n; i++) {\\n tmp[i].l = i;\\n tmp[i].r = i + 1;\\n tmp[i].sum = v[i];\\n }\\n seg = lazy_segtree<S, op, e, F, mapping, composition, id>(tmp);\\n }\\n\\n void set(int i, S x) {\\n seg.set(i, x);\\n }\\n S get(int i) {\\n return seg.get(i);\\n }\\n S all_prod() {\\n return seg.all_prod();\\n }\\n S prod(int l, int r) {\\n return seg.prod(l, r);\\n }\\n void apply(int l, int r, F f) {\\n seg.apply(l, r, F{f.a, f.b - f.a * get(l).l});\\n }\\n void apply(int i, F f) {\\n seg.apply(i, F{f.a, f.b - f.a * get(i).l});\\n }\\n\\n template <bool (*g)(S)>\\n int max_right(int l) {\\n return seg.max_right(l, [](S x) { return g(x); });\\n }\\n template <bool (*g)(S)>\\n int min_left(int r) {\\n return seg.min_left(r, [](S x) { return g(x); });\\n }\\n};\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n int n, q;\\n in(n, q);\\n vector<long long> v(n);\\n RangeLinearAddRangeSum seg(v);\\n\\n rep(i, q) {\\n int l, k;\\n in(l, k);\\n l--;\\n seg.apply(l, l + k, {1, 1});\\n }\\n\\n vector<long long> res(n);\\n rep(i, n) {\\n res[i] = seg.get(i).sum;\\n }\\n\\n out(res);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 20168,\n \"score_of_the_acc\": -1.1462,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3165_10114656\",\n \"code_snippet\": \"#include <vector>\\n#include <numeric>\\n#include <algorithm>\\n#include <functional>\\n#include <cassert>\\n#include <limits>\\n\\nconstexpr int bit_ceil_log(unsigned int n) {\\n int x = 0;\\n while ((1 << x) < (unsigned int)(n)) x++;\\n return x;\\n}\\n\\ntemplate <typename T>\\nstruct linear_add_range_sum {\\n private:\\n struct node {\\n T sum, lza, lzb;\\n long long isum;\\n int sz;\\n node(int i = -1, T v = 0) : sum(v), lza(0), lzb(0), isum(i == -1 ? 0 : i), sz(i == -1 ? 0 : 1) {}\\n };\\n\\n int _n, size, log;\\n std::vector<node> nd;\\n\\n void all_apply(int k, T a, T b) {\\n nd[k].sum += nd[k].isum * a + nd[k].sz * b;\\n if (k < size) nd[k].lza += a, nd[k].lzb += b;\\n }\\n\\n void push(int k) {\\n all_apply(2 * k, nd[k].lza, nd[k].lzb);\\n all_apply(2 * k + 1, nd[k].lza, nd[k].lzb);\\n nd[k].lza = nd[k].lzb = 0;\\n }\\n\\n void pull(int k) {\\n nd[k].sum = nd[k * 2].sum + nd[k * 2 + 1].sum;\\n }\\n \\n public:\\n linear_add_range_sum() : linear_add_range_sum(0) {}\\n linear_add_range_sum(int n) : linear_add_range_sum(std::vector<T>(n, 0)) {}\\n linear_add_range_sum(const std::vector<T>& v) : _n(int(v.size())) {\\n log = bit_ceil_log((unsigned int)_n);\\n size = 1 << log;\\n nd = std::vector<node>(2 * size);\\n for (int i = 0; i < size; i++) nd[size + i] = node(i < _n ? i : -1, i < _n ? v[i] : 0);\\n for (int i = size - 1; i >= 1; i--) {\\n nd[i].sz = nd[2 * i].sz + nd[2 * i + 1].sz;\\n nd[i].isum = nd[2 * i].isum + nd[2 * i + 1].isum;\\n nd[i].sum = nd[2 * i].sum + nd[2 * i + 1].sum;\\n }\\n }\\n \\n void set(int p, T x) {\\n assert(0 <= p && p < _n);\\n int P = p;\\n p += size;\\n for (int i = log; i >= 1; i--) push(p >> i);\\n nd[p] = node(P, x);\\n for (int i = 1; i <= log; i++) pull(P >> i);\\n }\\n\\n T get(int p) {\\n assert(0 <= p && p < _n);\\n p += size;\\n T a = 0, b = 0;\\n for (int i = log; i >= 1; i--) a += nd[p >> i].lza, b += nd[p >> i].lzb;\\n return nd[p].sum + nd[p].isum * a + b;\\n }\\n\\n void apply(int l, int r, T a, T b) {\\n assert(0 <= l && l <= r && r <= _n);\\n if (l == r) return;\\n l += size;\\n r += size;\\n {\\n int l2 = l, r2 = r;\\n while (l < r) {\\n if (l & 1) all_apply(l++, a, b);\\n if (r & 1) all_apply(--r, a, b);\\n l >>= 1;\\n r >>= 1;\\n }\\n l = l2;\\n r = r2;\\n }\\n for (int i = 1; i <= log; i++) {\\n if (((l >> i) << i) != l) pull(l >> i);\\n if (((r >> i) << i) != r) pull((r - 1) >> i);\\n }\\n }\\n\\n // [l, r)のsum\\n T prod(int l, int r) {\\n assert(0 <= l && l <= r && r <= _n);\\n if (l == r) return 0;\\n l += size;\\n r += size;\\n for (int i = log; i >= 1; i--) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n T res = 0;\\n while (l < r) {\\n if (l & 1) res += nd[l++].sum;\\n if (r & 1) res += nd[--r].sum;\\n l >>= 1;\\n r >>= 1;\\n }\\n return res;\\n }\\n};\\n\\n#include <iostream>\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n int N, Q;\\n std::cin >> N >> Q;\\n linear_add_range_sum<long long> seg(N);\\n\\n for (int i = 0; i < Q; i++) {\\n int l, k;\\n std::cin >> l >> k;\\n l--;\\n seg.apply(l, l + k, 1, -l + 1);\\n }\\n\\n for (int i = 0; i < N; i++) {\\n std::cout << seg.get(i) << (i + 1 == N ? \\\"\\\\n\\\" : \\\" \\\");\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 25164,\n \"score_of_the_acc\": -1.1471,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3165_10071855\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<typename OpMonoid>\\nstruct lazy_segtree {\\n using S = typename OpMonoid::S;\\n using F = typename OpMonoid::F;\\n lazy_segtree() : lazy_segtree(0) {}\\n lazy_segtree(int _n) : lazy_segtree(vector<S>(_n, OpMonoid::e())) {}\\n lazy_segtree(const vector<S> &v) { init(v); }\\n void set(const vector<S> &v) { init(v); }\\n void set(int p, const S &x) {\\n assert(0 <= p && p < n);\\n p += sz;\\n inner_push(p);\\n d[p] = x;\\n inner_update(p);\\n }\\n void apply(int p, const F &f) {\\n assert(0 <= p && p < n);\\n p += sz;\\n inner_push(p);\\n d[p] = OpMonoid::mapping(f, d[p]);\\n inner_update(p);\\n }\\n void apply(int l, int r, const F &f) {\\n assert(0 <= l && l <=r && r <= n);\\n l += sz;\\n r += sz;\\n for (int i = log; i >= 1; i--) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n int l2 = l, r2 = r;\\n while (l < r) {\\n if (l & 1) all_apply(l++, f);\\n if (r & 1) all_apply(--r, f);\\n l >>= 1;\\n r >>= 1;\\n }\\n l = l2, r = r2;\\n for (int i = 1; i <= log; i++) {\\n if (((l >> i) << i) != l) update(l >> i);\\n if (((r >> i) << i) != r) update((r - 1) >> i);\\n }\\n }\\n S get(int p) {\\n assert(0 <= p && p < n);\\n p += sz;\\n inner_push(p);\\n return d[p];\\n }\\n S prod(int l, int r) {\\n assert(0 <= l && l <=r && r <= n);\\n l += sz;\\n r += sz;\\n for (int i = log; i >= 1; i--) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n S pl = OpMonoid::e(), pr = OpMonoid::e();\\n while (l < r) {\\n if (l & 1) pl = OpMonoid::op(pl, d[l++]);\\n if (r & 1) pr = OpMonoid::op(d[--r], pr);\\n l >>= 1;\\n r >>= 1;\\n }\\n return OpMonoid::op(pl, pr);\\n }\\n S all_prod() const { return d[1]; }\\nprivate:\\n int n, log, sz;\\n vector<S> d;\\n vector<F> lz;\\n void init(const vector<S> &v) {\\n n = v.size();\\n log = 1;\\n while ((1 << log) < n) log++;\\n sz = 1 << log;\\n d = vector<S>(2 * sz, OpMonoid::e());\\n lz = vector<F>(sz, OpMonoid::id());\\n for (int i = 0; i < n; i++) d[i + sz] = v[i];\\n for (int i = sz - 1; i >= 1; i--) update(i);\\n }\\n void update(int p) {\\n d[p] = OpMonoid::op(d[2 * p], d[2 * p + 1]);\\n }\\n void all_apply(int p, const F &f) {\\n d[p] = OpMonoid::mapping(f, d[p]);\\n if (p < sz) lz[p] = OpMonoid::comp(f, lz[p]);\\n }\\n void push(int p) {\\n all_apply(2 * p, lz[p]);\\n all_apply(2 * p + 1, lz[p]);\\n lz[p] = OpMonoid::id();\\n }\\n void inner_update(int p) {\\n for (int i = 1; i <= log; i++) update(p >> i);\\n }\\n void inner_push(int p) {\\n for (int i = log; i >= 1; i--) push(p >> i);\\n }\\n};\\n\\ntemplate<typename T>\\nstruct range_arithmetic_add_range_sum {\\n static constexpr int inf = numeric_limits<int>::max() / 2;\\n struct S {\\n T sm;\\n int l, r;\\n T sum() const { return sm; }\\n S() : S(0, inf, -inf) {}\\n S(T x, int p) : S(x, p, p + 1) {}\\n S(T _sm, int _l, int _r) : sm(_sm), l(_l), r(_r) {}\\n };\\n static S op(const S&a, const S &b) {\\n S c;\\n c.sm = a.sum() + b.sum();\\n c.l = min(a.l, b.l);\\n c.r = max(a.r, b.r);\\n return c;\\n }\\n static S e() {\\n return S();\\n }\\n struct F {\\n T a, b;\\n F() : F(0, 0) {}\\n F(T _a, T _b) : a(_a), b(_b) {}\\n };\\n static F comp(const F &f, const F &g) {\\n return F(f.a + g.a, f.b + g.b);\\n }\\n static F id() {\\n return F();\\n }\\n static S mapping(const F &f, const S &x) {\\n S y;\\n y.sm = x.sm + (f.a * (x.l + x.r - 1) + f.b * 2) * (x.r - x.l) / 2;\\n y.l = x.l;\\n y.r = x.r;\\n return y;\\n }\\n};\\n\\nusing M = range_arithmetic_add_range_sum<long long>;\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int N, Q;\\n cin >> N >> Q;\\n lazy_segtree<M> seg(N);\\n for (int i = 0; i < N; i++) {\\n seg.set(i, M::S(0, i));\\n }\\n while (Q--) {\\n int l, k;\\n cin >> l >> k;\\n l--;\\n seg.apply(l, l + k, M::F(1, 1 - l));\\n }\\n for (int i = 0; i < N; i++) {\\n cout << seg.get(i).sum() << \\\" \\\\n\\\"[i + 1 == N];\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 18556,\n \"score_of_the_acc\": -1.07,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3165_9870270\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n/*\\nprefix sum for AP\\n*/\\n\\n\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\nconst int INF = 1000000000;\\n\\nconst int MAX_N = 200000 + 5;\\nstatic int64_t vect[MAX_N];\\n\\n//------------------------------------------------------------------------------\\nvoid solve(int N)\\n{\\n //--------------------------------------------------------------------------\\n // base cases:\\n //--------------------------------------------------------------------------\\n // init:\\n //--------------------------------------------------------------------------\\n // compute:\\n for (int i=1; i<N+1; ++i) vect[i] += vect[i-1];\\n for (int i=1; i<N+1; ++i) vect[i] += vect[i-1];\\n\\n for (int i=1; i<N; ++i) printf(\\\"%ld \\\", vect[i]);\\n printf(\\\"%ld\\\\n\\\", vect[N]);\\n}\\n\\n//------------------------------------------------------------------------------\\nvoid test()\\n{\\n\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //test(); return 0;\\n //DEBUG = true;\\n //--------------------------------------------------------------------------\\n int N, Q, K, L, num;\\n num = scanf(\\\"%d %d \\\", &N, &Q);\\n for (int i=0; i<N+5; ++i) vect[i] = 0;\\n for (int q=0; q<Q; ++q)\\n {\\n num = scanf(\\\"%d %d \\\", &K, &L);\\n vect[K]++;\\n vect[K+L] -= L+1;\\n vect[K+L+1] += L;\\n }\\n solve(N);\\n //--------------------------------------------------------------------------\\n return 0;\\n}\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5128,\n \"score_of_the_acc\": -0.0824,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3165_9870265\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n/*\\nprefix sum for AP\\n*/\\n\\n\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\nconst int INF = 1000000000;\\n\\nconst int MAX_N = 200000 + 5;\\nstatic int vect[MAX_N];\\n\\n//------------------------------------------------------------------------------\\nvoid solve(int N)\\n{\\n //--------------------------------------------------------------------------\\n // base cases:\\n //--------------------------------------------------------------------------\\n // init:\\n //--------------------------------------------------------------------------\\n // compute:\\n for (int i=1; i<N+1; ++i) vect[i] += vect[i-1];\\n for (int i=1; i<N+1; ++i) vect[i] += vect[i-1];\\n\\n for (int i=1; i<N; ++i) printf(\\\"%d \\\", vect[i]);\\n printf(\\\"%d\\\\n\\\", vect[N]);\\n}\\n\\n//------------------------------------------------------------------------------\\nvoid test()\\n{\\n\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //test(); return 0;\\n //DEBUG = true;\\n //--------------------------------------------------------------------------\\n int N, Q, K, L, num;\\n num = scanf(\\\"%d %d \\\", &N, &Q);\\n for (int i=0; i<N+5; ++i) vect[i] = 0;\\n for (int q=0; q<Q; ++q)\\n {\\n num = scanf(\\\"%d %d \\\", &K, &L);\\n vect[K]++;\\n vect[K+L] -= L+1;\\n vect[K+L+1] += L;\\n }\\n solve(N);\\n //--------------------------------------------------------------------------\\n return 0;\\n}\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 0.38235294117647056,\n \"time_ms\": 20,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": 0,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3165_8813212\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#pragma GCC target \\\"no-avx\\\"\\n\\n#if USE_MP\\n#include <boost/multiprecision/cpp_int.hpp>\\n#endif\\n#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <memory>\\n#include <numeric>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <vector>\\n#if defined _DEBUG\\n//#include \\\"TestCase.h\\\"\\n//#include \\\"Util.h\\\"\\n#endif\\n\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef tuple<ll, ll, ll> tlll;\\ntypedef tuple<int, int, int> tiii;\\n\\nusing ai2 = array<int, 2>;\\nusing ai3 = array<int, 3>;\\nusing ai4 = array<int, 4>;\\nusing al2 = array<ll, 2>;\\nusing al3 = array<ll, 3>;\\nusing al4 = array<ll, 4>;\\nusing ad2 = array<ld, 2>;\\nusing ad3 = array<ld, 3>;\\nusing ad4 = array<ld, 4>;\\n\\ninline void Yes(bool upper = false) { cout << (upper ? \\\"YES\\\" : \\\"Yes\\\") << \\\"\\\\n\\\"; }\\ninline void No(bool upper = false) { cout << (upper ? \\\"NO\\\" : \\\"No\\\") << \\\"\\\\n\\\"; }\\n\\ninline ll DivCeil(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -(-nume / deno);\\n\\telse return (nume + deno - 1) / deno;\\n}\\ninline ll DivFloor(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -((-nume + deno - 1) / deno);\\n\\telse return nume / deno;\\n}\\ninline ll DivRound(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -((-nume + deno / 2) / deno);\\n\\telse return (nume + deno / 2) / deno;\\n}\\n\\ntemplate <typename T, int S>\\nauto MakeVecImpl(queue<int>& size, const T& ini)\\n{\\n\\tif constexpr (S == 1)\\n\\t{\\n\\t\\treturn vector<T>(size.front(), ini);\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tint fsize = size.front();\\n\\t\\tsize.pop();\\n\\t\\treturn vector(fsize, MakeVecImpl<T, S - 1>(size, ini));\\n\\t}\\n}\\n\\ntemplate <typename T, int S>\\nauto MakeVec(const array<int, S>& size, const T ini = T())\\n{\\n\\tqueue<int> qsize;\\n\\tfor (const auto v : size) qsize.push(v);\\n\\treturn MakeVecImpl<T, S>(qsize, ini);\\n}\\nint d4[][2] =\\n{\\n\\t{0,-1},\\n\\t{0,1},\\n\\t{-1,0},\\n\\t{1,0},\\n};\\nint d8[][2] =\\n{\\n\\t{-1,-1},\\n\\t{0,-1},\\n\\t{1,-1},\\n\\n\\t{-1,0},\\n\\t{1,0},\\n\\n\\t{-1,1},\\n\\t{0,1},\\n\\t{1,1},\\n};\\nvector<array<int, 2>> Neighbor2(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tret.push_back({ y, x + 1 });\\n\\tret.push_back({ y + 1, x });\\n\\treturn ret;\\n}\\nvector<array<int, 2>> Neighbor4(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\tret.push_back({ y - 1, x });\\n\\tret.push_back({ y + 1, x });\\n\\treturn ret;\\n}\\nvector<array<int, 2>> Neighbor6(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tconst int ofs = (y & 1); // 1 - (y & 1); //\\n\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\n\\tret.push_back({ y - 1, x - 1 + ofs });\\n\\tret.push_back({ y - 1, x + ofs });\\n\\n\\tret.push_back({ y + 1, x - 1 + ofs });\\n\\tret.push_back({ y + 1, x + ofs });\\n\\n\\treturn ret;\\n}\\nvector<array<int, 2>> Neighbor8(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tret.push_back({ y - 1, x - 1 });\\n\\tret.push_back({ y - 1, x });\\n\\tret.push_back({ y - 1, x + 1 });\\n\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\n\\tret.push_back({ y + 1, x - 1 });\\n\\tret.push_back({ y + 1, x });\\n\\tret.push_back({ y + 1, x + 1 });\\n\\treturn ret;\\n}\\n\\nvector<int> DecompDigit(ull val)\\n{\\n\\tif (val == 0)\\n\\t\\treturn { 0 };\\n\\n\\tvector<int> ret;\\n\\twhile (val)\\n\\t{\\n\\t\\tret.emplace_back(val % 10);\\n\\t\\tval /= 10;\\n\\t}\\n\\treverse(ret.begin(), ret.end());\\n\\treturn ret;\\n}\\n\\n\\n#define PI 3.14'159'265'358'979l\\nlong double R2D = 180 / PI;\\nlong double D2R = PI / 180;\\n\\nstatic const ll Mod = 1'000'000'007;\\nstatic const ll Mod9 = 998244353;// 1000000007;\\nstatic const ll INF64 = 4'500000'000000'000000;// 10000000000000000;\\nstatic const int INF32 = 2'000'000'000;\\n\\nrandom_device rd;\\n//mt19937 mt(rd());\\nmt19937 mt(0);\\n#if USE_MP\\nusing mpint = boost::multiprecision::cpp_int;\\n#endif\\n\\nconst double EPS = 1e-10;\\n\\nstruct Solver\\n{\\n\\tvoid Run()\\n\\t{\\n\\t\\tint N, Q;\\n\\t\\tcin >> N >> Q;\\n\\t\\tvector<ll> A(N + 2);\\n\\t\\twhile (Q--) {\\n\\t\\t\\tint l, k;\\n\\t\\t\\tcin >> l >> k;\\n\\t\\t\\tl--;\\n\\t\\t\\tA[l]++;\\n\\t\\t\\tA[l + k] -= k + 1;\\n\\t\\t\\tA[l + k + 1] += k;\\n\\t\\t}\\n\\t\\tfor (int i = 1; i < A.size(); i++) A[i] += A[i - 1];\\n\\t\\tfor (int i = 1; i < A.size(); i++) A[i] += A[i - 1];\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tif (i) cout << ' ';\\n\\t\\t\\tcout << A[i];\\n\\t\\t}\\n\\t\\tcout << \\\"\\\\n\\\";\\n\\t}\\n};\\n\\nint main()\\n{\\n\\tstd::cin.tie(nullptr); //★インタラクティブ注意★\\n\\tstd::ios_base::sync_with_stdio(false);\\n\\tint T = 1;\\n\\t//cin >> T;\\n\\twhile (T--)\\n\\t{\\n\\t\\tSolver S;\\n\\t\\tS.Run();\\n\\t}\\n\\n\\treturn 0;\\n}\\n\\n/// 値渡しになっていないか?\\n/// 入力を全部読んでいるか? 途中でreturnしない\\n/// 32bitで収まるか? 10^5数えるとき\\n/// modは正しいか?\\n/// multisetでcountしていないか?\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4660,\n \"score_of_the_acc\": -0.0602,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3165_8813205\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#pragma GCC target \\\"no-avx\\\"\\n\\n#if USE_MP\\n#include <boost/multiprecision/cpp_int.hpp>\\n#endif\\n#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <memory>\\n#include <numeric>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <vector>\\n#if defined _DEBUG\\n//#include \\\"TestCase.h\\\"\\n//#include \\\"Util.h\\\"\\n#endif\\n\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef tuple<ll, ll, ll> tlll;\\ntypedef tuple<int, int, int> tiii;\\n\\nusing ai2 = array<int, 2>;\\nusing ai3 = array<int, 3>;\\nusing ai4 = array<int, 4>;\\nusing al2 = array<ll, 2>;\\nusing al3 = array<ll, 3>;\\nusing al4 = array<ll, 4>;\\nusing ad2 = array<ld, 2>;\\nusing ad3 = array<ld, 3>;\\nusing ad4 = array<ld, 4>;\\n\\ninline void Yes(bool upper = false) { cout << (upper ? \\\"YES\\\" : \\\"Yes\\\") << \\\"\\\\n\\\"; }\\ninline void No(bool upper = false) { cout << (upper ? \\\"NO\\\" : \\\"No\\\") << \\\"\\\\n\\\"; }\\n\\ninline ll DivCeil(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -(-nume / deno);\\n\\telse return (nume + deno - 1) / deno;\\n}\\ninline ll DivFloor(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -((-nume + deno - 1) / deno);\\n\\telse return nume / deno;\\n}\\ninline ll DivRound(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -((-nume + deno / 2) / deno);\\n\\telse return (nume + deno / 2) / deno;\\n}\\n\\ntemplate <typename T, int S>\\nauto MakeVecImpl(queue<int>& size, const T& ini)\\n{\\n\\tif constexpr (S == 1)\\n\\t{\\n\\t\\treturn vector<T>(size.front(), ini);\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tint fsize = size.front();\\n\\t\\tsize.pop();\\n\\t\\treturn vector(fsize, MakeVecImpl<T, S - 1>(size, ini));\\n\\t}\\n}\\n\\ntemplate <typename T, int S>\\nauto MakeVec(const array<int, S>& size, const T ini = T())\\n{\\n\\tqueue<int> qsize;\\n\\tfor (const auto v : size) qsize.push(v);\\n\\treturn MakeVecImpl<T, S>(qsize, ini);\\n}\\nint d4[][2] =\\n{\\n\\t{0,-1},\\n\\t{0,1},\\n\\t{-1,0},\\n\\t{1,0},\\n};\\nint d8[][2] =\\n{\\n\\t{-1,-1},\\n\\t{0,-1},\\n\\t{1,-1},\\n\\n\\t{-1,0},\\n\\t{1,0},\\n\\n\\t{-1,1},\\n\\t{0,1},\\n\\t{1,1},\\n};\\nvector<array<int, 2>> Neighbor2(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tret.push_back({ y, x + 1 });\\n\\tret.push_back({ y + 1, x });\\n\\treturn ret;\\n}\\nvector<array<int, 2>> Neighbor4(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\tret.push_back({ y - 1, x });\\n\\tret.push_back({ y + 1, x });\\n\\treturn ret;\\n}\\nvector<array<int, 2>> Neighbor6(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tconst int ofs = (y & 1); // 1 - (y & 1); //\\n\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\n\\tret.push_back({ y - 1, x - 1 + ofs });\\n\\tret.push_back({ y - 1, x + ofs });\\n\\n\\tret.push_back({ y + 1, x - 1 + ofs });\\n\\tret.push_back({ y + 1, x + ofs });\\n\\n\\treturn ret;\\n}\\nvector<array<int, 2>> Neighbor8(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tret.push_back({ y - 1, x - 1 });\\n\\tret.push_back({ y - 1, x });\\n\\tret.push_back({ y - 1, x + 1 });\\n\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\n\\tret.push_back({ y + 1, x - 1 });\\n\\tret.push_back({ y + 1, x });\\n\\tret.push_back({ y + 1, x + 1 });\\n\\treturn ret;\\n}\\n\\nvector<int> DecompDigit(ull val)\\n{\\n\\tif (val == 0)\\n\\t\\treturn { 0 };\\n\\n\\tvector<int> ret;\\n\\twhile (val)\\n\\t{\\n\\t\\tret.emplace_back(val % 10);\\n\\t\\tval /= 10;\\n\\t}\\n\\treverse(ret.begin(), ret.end());\\n\\treturn ret;\\n}\\n\\n\\n#define PI 3.14'159'265'358'979l\\nlong double R2D = 180 / PI;\\nlong double D2R = PI / 180;\\n\\nstatic const ll Mod = 1'000'000'007;\\nstatic const ll Mod9 = 998244353;// 1000000007;\\nstatic const ll INF64 = 4'500000'000000'000000;// 10000000000000000;\\nstatic const int INF32 = 2'000'000'000;\\n\\nrandom_device rd;\\n//mt19937 mt(rd());\\nmt19937 mt(0);\\n#if USE_MP\\nusing mpint = boost::multiprecision::cpp_int;\\n#endif\\n\\nconst double EPS = 1e-10;\\n\\ntemplate <typename DATA, typename LAZY>\\nstruct LazySegmentTree\\n{\\n\\tLazySegmentTree(size_t size,\\n\\t\\tDATA unit,\\n\\t\\tLAZY identity,\\n\\t\\tfunction<DATA(DATA, DATA)> dataMergeFunc,\\n\\t\\tfunction<DATA(LAZY, DATA)> evaluationFunc,\\n\\t\\tfunction<LAZY(LAZY, LAZY)> lazyMergeFunc\\n\\t) : e(unit),\\n\\t\\tI(identity),\\n\\t\\tmergeData(dataMergeFunc),\\n\\t\\tevaluate(evaluationFunc),\\n\\t\\tmergeLazy(lazyMergeFunc),\\n\\t\\tNorg(size)\\n\\t{\\n\\t\\t// 2べきのサイズを求める\\n\\t\\tN = 1;\\n\\t\\twhile (N < size) N <<= 1;\\n\\n\\t\\t// 領域確保\\n\\t\\tdata.resize(2 * N - 1, e);\\n\\t\\tlazy.resize(2 * N - 1, I);\\n\\n\\t\\t// 伝搬\\n\\t\\tfor (int i = N - 2; i >= 0; i--)\\n\\t\\t\\tdata[i] = mergeData(data[i * 2 + 1], data[i * 2 + 2]);\\n\\t}\\n\\tLazySegmentTree(const vector<DATA>& vec,\\n\\t\\tDATA unit,\\n\\t\\tLAZY identity,\\n\\t\\tfunction<DATA(DATA, DATA)> dataMergeFunc,\\n\\t\\tfunction<DATA(LAZY, DATA)> evaluationFunc,\\n\\t\\tfunction<LAZY(LAZY, LAZY)> lazyMergeFunc\\n\\t) : e(unit),\\n\\t\\tI(identity),\\n\\t\\tmergeData(dataMergeFunc),\\n\\t\\tevaluate(evaluationFunc),\\n\\t\\tmergeLazy(lazyMergeFunc),\\n\\t\\tNorg(vec.size())\\n\\t{\\n\\t\\t// 2べきのサイズを求める\\n\\t\\tN = 1;\\n\\t\\twhile (N < vec.size()) N <<= 1;\\n\\n\\t\\t// 領域確保\\n\\t\\tdata.resize(2 * N - 1, e);\\n\\t\\tlazy.resize(2 * N - 1, I);\\n\\n\\t\\t// vecをコピーして伝搬\\n\\t\\tcopy(vec.begin(), vec.end(), data.begin() + N - 1);\\n\\t\\tfor (int i = N - 2; i >= 0; i--)\\n\\t\\t\\tdata[i] = mergeData(data[i * 2 + 1], data[i * 2 + 2]);\\n\\t}\\n\\n\\t// 区間評価\\n\\tDATA Fold(size_t l, size_t r)\\n\\t{\\n\\t\\treturn Fold(l, r, 0, 0, N);\\n\\t}\\n\\n\\t// 区間更新\\n\\tvoid Update(size_t l, size_t r, LAZY val)\\n\\t{\\n\\t\\tUpdate(l, r, 0, 0, N, val);\\n\\t}\\n\\n#pragma region binary search\\n\\t// セグメント木上の二分探索\\n\\t// 区間[l, r)について、IsOKになる最大のrを求める\\n\\tsize_t MaxRight(size_t l, function<bool(DATA)> IsOK)\\n\\t{\\n\\t\\tvector<bool> isEvaluated(data.size());\\n\\t\\tauto LazyEvalToRoot = [this, &isEvaluated](size_t idx) {\\t// 根に向かって未反映のノードを探し、自分まで辿る\\n\\t\\t\\tsize_t cur = idx;\\n\\t\\t\\tvector<size_t> target;\\n\\t\\t\\twhile (!isEvaluated[cur]) {\\n\\t\\t\\t\\ttarget.emplace_back(cur);\\n\\t\\t\\t\\tif (cur == 0) break;\\n\\t\\t\\t\\tcur = (cur - 1) >> 1;\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = target.size() - 1; i >= 0; i--) {\\n\\t\\t\\t\\tLazyEval(target[i]);\\n\\t\\t\\t\\tisEvaluated[target[i]] = true;\\n\\t\\t\\t}\\n\\t\\t\\t};\\n\\n\\t\\t// [l, l+1)でも満たさない場合は即終了\\n\\t\\tLazyEvalToRoot(l + N - 1);\\n\\t\\tif (!IsOK(data[l + N - 1])) return l;\\n\\n\\t\\t// 二分探索\\n\\t\\tsize_t maxR = N;\\n\\t\\tsize_t curIdx = l + N - 1;\\n\\t\\tsize_t curR = l + 1;\\n\\t\\tDATA curVal = data[curIdx];\\n\\t\\tDATA prvVal = e;\\n\\t\\tsize_t step = 2;\\n\\n\\t\\tsize_t nxtR, nxtIdx;\\n\\t\\tDATA nxtVal;\\n\\n\\t\\t// 葉から上へ\\n\\t\\twhile (maxR > curR)\\n\\t\\t{\\n\\t\\t\\t// 自分が左部分木なら[l, l+step)のstepを増やしていくイメージ\\n\\t\\t\\tif (IsLeft(curIdx))\\n\\t\\t\\t{\\n\\t\\t\\t\\tnxtR = curR + step - (step >> 1);\\n\\t\\t\\t\\tnxtIdx = (curIdx - 1) >> 1;\\t// 親\\n\\t\\t\\t\\tLazyEvalToRoot(nxtIdx);\\n\\t\\t\\t\\tnxtVal = mergeData(prvVal, data[nxtIdx]);\\n\\t\\t\\t\\tif (IsOK(nxtVal))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcurIdx = nxtIdx;\\n\\t\\t\\t\\t\\tcurR = nxtR;\\n\\t\\t\\t\\t\\t// prvValはまだ更新しない lが同じでstepが大きいものを試すため\\n\\t\\t\\t\\t\\tcurVal = nxtVal;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t// 次のノードの左部分木から下りていく\\n\\t\\t\\t\\t\\tstep >>= 2;\\n\\t\\t\\t\\t\\tnxtR = curR + step;\\n\\t\\t\\t\\t\\tnxtIdx = (curIdx + 1) * 2 + 1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// 自分が右部分木なら[l, l+step)に[l+step, l+step*2)を継ぎ足すイメージ\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tnxtR = curR + step;\\n\\t\\t\\t\\tnxtIdx = (curIdx + 1) >> 1;\\t// 隣の親\\n\\t\\t\\t\\tLazyEvalToRoot(nxtIdx);\\n\\t\\t\\t\\tnxtVal = mergeData(curVal, data[nxtIdx]);\\n\\t\\t\\t\\tif (IsOK(nxtVal))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcurIdx = nxtIdx;\\n\\t\\t\\t\\t\\tcurR = nxtR;\\n\\t\\t\\t\\t\\tprvVal = curVal;\\n\\t\\t\\t\\t\\tcurVal = nxtVal;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t// 次のノードからから下りていく\\n\\t\\t\\t\\t\\tstep >>= 1;\\n\\t\\t\\t\\t\\tnxtR = curR + step;\\n\\t\\t\\t\\t\\tnxtIdx = curIdx + 1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\tstep <<= 1;\\n\\t\\t}\\n\\t\\t// OKのまま右端まで来てたら終了\\n\\t\\tif (maxR == curR)\\n\\t\\t\\treturn min(curR, Norg);\\n\\n\\t\\t// 下へ(prv~はもう使わない)\\n\\t\\twhile (nxtR > curR)\\n\\t\\t{\\n\\t\\t\\tLazyEvalToRoot(nxtIdx);\\n\\t\\t\\tnxtVal = mergeData(curVal, data[nxtIdx]);\\n\\t\\t\\tif (IsOK(nxtVal))\\n\\t\\t\\t{\\n\\t\\t\\t\\tcurIdx = nxtIdx;\\n\\t\\t\\t\\tcurVal = nxtVal;\\n\\t\\t\\t\\tcurR = nxtR;\\n\\n\\t\\t\\t\\t// 次のノードの左部分木へ\\n\\t\\t\\t\\tstep >>= 1;\\n\\t\\t\\t\\tnxtR = curR + step;\\n\\t\\t\\t\\tnxtIdx = (curIdx + 1) * 2 + 1;\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\t// 自分の左部分木へ\\n\\t\\t\\t\\tstep >>= 1;\\n\\t\\t\\t\\tnxtR = curR + step;\\n\\t\\t\\t\\tnxtIdx = nxtIdx * 2 + 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn min(curR, Norg);\\n\\t}\\n\\n\\t// セグメント木上の二分探索\\n\\t// 区間[l, r)について、IsOKになる最小のlを求める\\n\\tsize_t MinLeft(size_t r, function<bool(DATA)> IsOK)\\n\\t{\\n\\t\\tr = min(r, Norg);\\n\\n\\t\\tvector<bool> isEvaluated(data.size());\\n\\t\\tauto LazyEvalToRoot = [this, &isEvaluated](size_t idx) {\\t// 根に向かって未反映のノードを探し、自分まで辿る\\n\\t\\t\\tsize_t cur = idx;\\n\\t\\t\\tvector<size_t> target;\\n\\t\\t\\twhile (!isEvaluated[cur]) {\\n\\t\\t\\t\\ttarget.emplace_back(cur);\\n\\t\\t\\t\\tif (cur == 0) break;\\n\\t\\t\\t\\tcur = (cur - 1) >> 1;\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = target.size() - 1; i >= 0; i--) {\\n\\t\\t\\t\\tLazyEval(target[i]);\\n\\t\\t\\t\\tisEvaluated[target[i]] = true;\\n\\t\\t\\t}\\n\\t\\t\\t};\\n\\n\\t\\t// [r-1, r)でも満たさない場合は即終了\\n\\t\\tLazyEvalToRoot(r - 1 + N - 1);\\n\\t\\tif (!IsOK(data[r - 1 + N - 1])) return r;\\n\\n\\t\\t// 二分探索\\n\\t\\tsize_t minL = 0;\\n\\t\\tsize_t curIdx = r - 1 + N - 1;\\n\\t\\tsize_t curL = r - 1;\\n\\t\\tDATA curVal = data[curIdx];\\n\\t\\tDATA prvVal = e;\\n\\t\\tsize_t step = 2;\\n\\n\\t\\tsize_t nxtL, nxtIdx;\\n\\t\\tDATA nxtVal;\\n\\n\\t\\t// 葉から上へ\\n\\t\\twhile (minL < curL)\\n\\t\\t{\\n\\t\\t\\t// 自分が右部分木なら[r-step, r)のstepを増やしていくイメージ\\n\\t\\t\\tif (IsRight(curIdx))\\n\\t\\t\\t{\\n\\t\\t\\t\\tnxtL = curL - step + (step >> 1);\\n\\t\\t\\t\\tnxtIdx = (curIdx - 1) >> 1;\\t// 親\\n\\t\\t\\t\\tLazyEvalToRoot(nxtIdx);\\n\\t\\t\\t\\tnxtVal = mergeData(data[nxtIdx], prvVal);\\n\\t\\t\\t\\tif (IsOK(nxtVal))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcurIdx = nxtIdx;\\n\\t\\t\\t\\t\\tcurL = nxtL;\\n\\t\\t\\t\\t\\t// prvValはまだ更新しない rが同じでstepが大きいものを試すため\\n\\t\\t\\t\\t\\tcurVal = nxtVal;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t// 前のノードの右部分木から下りていく\\n\\t\\t\\t\\t\\tstep >>= 2;\\n\\t\\t\\t\\t\\tnxtL = curL - step;\\n\\t\\t\\t\\t\\tnxtIdx = (curIdx - 1) * 2 + 2;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// 自分が左部分木なら[r-step, r)に[r-step*2, r-step)を継ぎ足すイメージ\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tnxtL = curL - step;\\n\\t\\t\\t\\tnxtIdx = ((curIdx - 1) >> 1) - 1;\\t// 隣の親\\n\\t\\t\\t\\tLazyEvalToRoot(nxtIdx);\\n\\t\\t\\t\\tnxtVal = mergeData(data[nxtIdx], curVal);\\n\\t\\t\\t\\tif (IsOK(nxtVal))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcurIdx = nxtIdx;\\n\\t\\t\\t\\t\\tcurL = nxtL;\\n\\t\\t\\t\\t\\tprvVal = curVal;\\n\\t\\t\\t\\t\\tcurVal = nxtVal;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t// 前のノードからから下りていく\\n\\t\\t\\t\\t\\tstep >>= 1;\\n\\t\\t\\t\\t\\tnxtL = curL - step;\\n\\t\\t\\t\\t\\tnxtIdx = curIdx - 1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\tstep <<= 1;\\n\\t\\t}\\n\\t\\t// OKのまま左端まで来てたら終了\\n\\t\\tif (minL == curL)\\n\\t\\t\\treturn minL;\\n\\n\\t\\t// 下へ(prv~はもう使わない)\\n\\t\\twhile (nxtL < curL)\\n\\t\\t{\\n\\t\\t\\tLazyEvalToRoot(nxtIdx);\\n\\t\\t\\tnxtVal = mergeData(curVal, data[nxtIdx]);\\n\\t\\t\\tif (IsOK(nxtVal))\\n\\t\\t\\t{\\n\\t\\t\\t\\tcurIdx = nxtIdx;\\n\\t\\t\\t\\tcurVal = nxtVal;\\n\\t\\t\\t\\tcurL = nxtL;\\n\\n\\t\\t\\t\\t// 前のノードの右部分木へ\\n\\t\\t\\t\\tstep >>= 1;\\n\\t\\t\\t\\tnxtL = curL - step;\\n\\t\\t\\t\\tnxtIdx = (curIdx - 1) * 2 + 2;\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\t// 自分の右部分木へ\\n\\t\\t\\t\\tstep >>= 1;\\n\\t\\t\\t\\tnxtL = curL - step;\\n\\t\\t\\t\\tnxtIdx = nxtIdx * 2 + 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn curL;\\n\\t}\\n#pragma endregion\\nprivate:\\n#pragma region primitive data\\n\\tsize_t N;\\t\\t\\t\\t\\t\\t\\t\\t// 2べき化したサイズ\\t\\n\\tsize_t Norg;\\t\\t\\t\\t\\t\\t\\t// 元のサイズ\\n\\tDATA e;\\t\\t\\t\\t\\t\\t\\t\\t\\t// 実データの単位元\\n\\tLAZY I;\\t\\t\\t\\t\\t\\t\\t\\t\\t// 遅延評価の恒等写像\\n\\tvector<DATA> data;\\t\\t\\t\\t\\t\\t// 実データ\\n\\tvector<LAZY> lazy;\\t\\t\\t\\t\\t\\t// 遅延評価値\\n\\tfunction<DATA(DATA, DATA)> mergeData;\\t// 取得時のマージ演算\\n\\tfunction<DATA(LAZY, DATA)> evaluate;\\t// lazy -> dataの反映\\n\\tfunction<LAZY(LAZY, LAZY)> mergeLazy;\\t// lazyを下のlazyにマージする操作\\n#pragma endregion\\n\\n#pragma region implementation\\n\\t// 区間評価(本体)\\n\\tDATA Fold(size_t queryL, size_t queryR,\\n\\t\\tsize_t nodeIdx, size_t nodeL, size_t nodeR\\n\\t)\\n\\t{\\n\\t\\t// 遅延評価\\n\\t\\tLazyEval(nodeIdx);\\n\\n\\t\\t// かすりもしない\\n\\t\\tif (queryL >= nodeR || queryR <= nodeL) return e;\\n\\n\\t\\t// 完全に覆われる\\n\\t\\tif (queryL <= nodeL && queryR >= nodeR) return data[nodeIdx];\\n\\n\\t\\t// 部分的に覆われる\\n\\t\\tsize_t nodeM = (nodeL + nodeR) / 2;\\n\\t\\treturn mergeData(\\n\\t\\t\\tFold(queryL, queryR, 2 * nodeIdx + 1, nodeL, nodeM),\\n\\t\\t\\tFold(queryL, queryR, 2 * nodeIdx + 2, nodeM, nodeR)\\n\\t\\t);\\n\\t}\\n\\n\\t// 区間更新(本体)\\n\\tvoid Update(size_t queryL, size_t queryR,\\n\\t\\tsize_t nodeIdx, size_t nodeL, size_t nodeR,\\n\\t\\tLAZY val\\n\\t)\\n\\t{\\n\\t\\tLazyEval(nodeIdx);\\n\\n\\t\\t// かすりもしない\\n\\t\\tif (queryL >= nodeR || queryR <= nodeL) return;\\n\\n\\t\\t// 完全に覆われる\\n\\t\\tif (queryL <= nodeL && queryR >= nodeR) {\\n\\t\\t\\tlazy[nodeIdx] = mergeLazy(val, lazy[nodeIdx]);\\n\\t\\t\\tLazyEval(nodeIdx);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\t// 部分的に覆われる\\n\\t\\tsize_t nodeM = (nodeL + nodeR) / 2;\\n\\t\\tUpdate(queryL, queryR, 2 * nodeIdx + 1, nodeL, nodeM, val);\\n\\t\\tUpdate(queryL, queryR, 2 * nodeIdx + 2, nodeM, nodeR, val);\\n\\t\\tdata[nodeIdx] = mergeData(data[2 * nodeIdx + 1], data[2 * nodeIdx + 2]);\\n\\t}\\n\\n\\t// 遅延評価\\n\\tvoid LazyEval(size_t idx)\\n\\t{\\n\\t\\tdata[idx] = evaluate(lazy[idx], data[idx]);\\n\\n\\t\\t// 一段落とす\\n\\t\\tif (idx < N - 1)\\n\\t\\t{\\n\\t\\t\\tlazy[idx * 2 + 1] = mergeLazy(lazy[idx], lazy[idx * 2 + 1]);\\n\\t\\t\\tlazy[idx * 2 + 2] = mergeLazy(lazy[idx], lazy[idx * 2 + 2]);\\n\\t\\t}\\n\\n\\t\\tlazy[idx] = I;\\n\\t}\\n#pragma endregion\\n\\tinline bool IsLeft(size_t idx) const { return (idx & 1) == 1; }\\n\\tinline bool IsRight(size_t idx) const { return (idx & 1) == 0; }\\n};\\n\\nstruct Data\\n{\\n\\tll val;\\n\\tsize_t size;\\n};\\n\\t\\nusing Lazy = ll;\\n\\t\\nData MergeData(Data a, Data b)\\n{\\n\\treturn { a.val + b.val, a.size + b.size };\\n}\\n\\t\\nData Evaluate(Lazy l, Data a)\\n{\\n\\ta.val += l * a.size;\\n\\treturn a;\\n}\\n\\t\\nLazy MergeLazy(Lazy a, Lazy b)\\n{\\n\\treturn a + b;\\n}\\n\\t \\nconst Data unit{ 0, 1 };\\nconst Lazy Identity = 0;\\n\\nstruct Solver\\n{\\n\\tvoid Run()\\n\\t{\\n\\t\\tint N, Q;\\n\\t\\tcin >> N >> Q;\\n\\n\\t\\tLazySegmentTree<Data, Lazy> st(N+1, unit, Identity, MergeData, Evaluate, MergeLazy );\\n\\t\\twhile (Q--) {\\n\\t\\t\\tint l, k;\\n\\t\\t\\tcin >> l >> k;\\n\\t\\t\\tl--;\\n\\t\\t\\tst.Update(l, l + k, 1);\\n\\t\\t\\tst.Update(l + k, l + k + 1, -k);\\n\\t\\t}\\n\\n\\t\\tll a = 0;\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\ta += st.Fold(i, i + 1).val;\\n\\t\\t\\tif (i)\\n\\t\\t\\t\\tcout << ' ';\\n\\t\\t\\tcout << a;\\n\\t\\t}\\n\\t\\tcout << \\\"\\\\n\\\";\\n\\t}\\n};\\n\\nint main()\\n{\\n\\tstd::cin.tie(nullptr); //★インタラクティブ注意★\\n\\tstd::ios_base::sync_with_stdio(false);\\n\\tint T = 1;\\n\\t//cin >> T;\\n\\twhile (T--)\\n\\t{\\n\\t\\tSolver S;\\n\\t\\tS.Run();\\n\\t}\\n\\n\\treturn 0;\\n}\\n\\n/// 値渡しになっていないか?\\n/// 入力を全部読んでいるか? 途中でreturnしない\\n/// 32bitで収まるか? 10^5数えるとき\\n/// modは正しいか?\\n/// multisetでcountしていないか?\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 15496,\n \"score_of_the_acc\": -1.543,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3165_8738135\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vl = vector<ll>;\\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\\n\\ntemplate<typename T>\\nstruct dualsegtree {\\n \\n dualsegtree(int siz, T _id) : id(_id) {\\n n = 1;\\n while(n < siz) n <<= 1;\\n dat.resize(n*2, id);\\n }\\n\\n private: \\n\\n \\n int n;\\n vector<T> dat;\\n T id;\\n \\n\\n void eval(int k, int len) {\\n if(len == 1) return;\\n dat[k << 1] = op(dat[k << 1], dat[k]);\\n dat[(k << 1) + 1] = op(dat[(k << 1) + 1], dat[k]);\\n dat[k] = id;\\n }\\n\\n\\n void update(int a, int b, T e, int l, int r, int k) {//[a, b) := 今見ている区間 [l, r) := クエリ区間\\n eval(k, b-a);\\n if(b <= l || r <= a) return;\\n if(l <= a && b <= r) {\\n dat[k] = op(dat[k], e);\\n eval(k, b-a);\\n return;\\n }\\n int mid = (a+b)>>1;\\n update(a, mid, e, l, r, k<<1);\\n update(mid, b, e, l, r, (k<<1)+1);\\n }\\n\\n T query(int pos) {\\n int a = 1;\\n int b = n+1;\\n int k = 1;\\n while(1) {\\n eval(k, b-a);\\n if(b-a == 1) {\\n return dat[k];\\n }\\n int mid = (a+b)>>1;\\n if(mid <= pos) {\\n k = (k << 1) + 1;\\n a = mid;\\n }\\n else {\\n k <<= 1;\\n b = mid;\\n } \\n }\\n }\\n\\n\\n public: \\n\\n void set(int pos, T val) {\\n dat[pos+n-1] = val;\\n }\\n\\n void init() {\\n\\n }\\n\\n void change(int l, int r, T x) {\\n update(1, n+1, x, l, r+1, 1);\\n }\\n\\n T get(int pos) {\\n return query(pos);\\n }\\n\\n};\\n\\n\\nstruct Monoid {\\n ll a, d;\\n Monoid():a(0), d(0){}\\n Monoid(ll _a, ll _d) : a(_a), d(_d) {}\\n friend Monoid op(const Monoid& l, const Monoid& r) {//monoid * monoid\\n return Monoid(l.a + r.a, l.d + r.d);\\n }\\n\\n};\\nusing E = Monoid;\\n\\nMonoid id(0, 0);\\n\\nint main() {\\n ll N, Q;\\n cin >> N >> Q;\\n dualsegtree<Monoid> seg(N+1, id);\\n rep(i,1,N)seg.set(i, id);\\n seg.init();\\n rep(qi, 1, Q) {\\n ll l, k;\\n cin >> l >> k;\\n seg.change(l, l + k - 1, Monoid(2-l, 1));\\n }\\n\\n rep(i,1,N) {\\n auto [a,d] = seg.get(i);\\n cout << a + (i-1) * d;\\n if(i != N) cout << \\\" \\\";}\\n cout << endl;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 11316,\n \"score_of_the_acc\": -0.7278,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3165_8738048\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vl = vector<ll>;\\n#define rep(i, s, f) for(long long i = s; i <= f; i++)\\n\\ntemplate<typename T>\\nstruct dualsegtree {\\n dualsegtree(int siz) {\\n n = 1;\\n while(n < siz) n <<= 1;\\n dat.resize(n*2);\\n }\\n\\n private: \\n struct E {\\n T a, d;\\n E():a(0), d(0){}\\n E(T _a, T _d) : a(_a), d(_d) {}\\n };\\n\\n int n;\\n vector<E> dat;\\n E id = E(0, 0); \\n\\n E fe(const E& l, const E& r) {//作用素の合成\\n return E(l.a + r.a, l.d + r.d);\\n }\\n\\n\\n void eval(int k, int len) {\\n if(dat[k].a == 0 && dat[k].d == 0) return;\\n if(len == 1) return;\\n dat[k << 1] = fe(dat[k << 1], dat[k]);\\n dat[(k << 1) + 1] = fe(dat[(k << 1) + 1], E(dat[k].a + (len >> 1) * dat[k].d, dat[k].d));\\n dat[k] = id;\\n }\\n\\n\\n void update(int a, int b, E e, int l, int r, int k) {//[a, b) := 今見ている区間 [l, r) := クエリ区間\\n eval(k, b-a);\\n if(b <= l || r <= a) return;\\n if(l <= a && b <= r) {\\n dat[k] = fe(dat[k], e);\\n eval(k, b-a);\\n return;\\n }\\n int mid = (a+b)>>1;\\n update(a, mid, e, l, r, k<<1);\\n update(mid, b, E(e.a + (mid - a)*e.d, e.d), l, r, (k<<1)+1);\\n }\\n\\n T query(int pos) {\\n int a = 1;\\n int b = n+1;\\n int k = 1;\\n while(1) {\\n eval(k, b-a);\\n if(b-a == 1) {\\n return dat[k].a;\\n }\\n int mid = (a+b)>>1;\\n if(mid <= pos) {\\n k = (k << 1) + 1;\\n a = mid;\\n }\\n else {\\n k <<= 1;\\n b = mid;\\n } \\n }\\n }\\n\\n\\n public: \\n\\n void set(int pos, T val) {\\n dat[pos+n-1].a = val;\\n }\\n\\n void init() {\\n\\n }\\n\\n void change(int l, int r, T a, T d) {\\n if(l != 1) {\\n a = a - (l-1) * d;\\n update(1, n+1, E(-a, -d), 1, l, 1);//左端を1に合わせる為に、打ち消すaddをする。\\n } \\n update(1, n+1, E(a, d), 1, r+1, 1);\\n }\\n\\n T get(int pos) {\\n return query(pos);\\n }\\n\\n};\\n\\n\\nint main() {\\n ll N, Q;\\n cin >> N >> Q;\\n dualsegtree<ll> seg(N+1);\\n rep(i,1,N)seg.set(i, 0);\\n seg.init();\\n rep(qi, 1, Q) {\\n ll l, k;\\n cin >> l >> k;\\n seg.change(l, l + k - 1, 1, 1);\\n }\\n\\n rep(i,1,N) {cout << seg.get(i);if(i != N) cout << \\\" \\\";}\\n cout << endl;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 11320,\n \"score_of_the_acc\": -0.7574,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3165_8730817\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n ll N, Q;\\n cin >> N >> Q;\\n vll A(N, 0);\\n vll B(N,0);\\n rep(i, Q) {\\n ll L, K;\\n cin >> L >> K;\\n L--;\\n A[L]++;\\n if (L + K < N){\\n A[L + K]--;\\n B[L+K]-=K;\\n }\\n }\\n rep(i, N - 1)A[i + 1] += A[i];\\n rep(i,N)A[i]+=B[i];\\n rep(i, N - 1)A[i + 1] += A[i];\\n rep(i,N)cout<<A[i]<<\\\" \\\\n\\\"[i==N-1];\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6248,\n \"score_of_the_acc\": -0.1353,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3165_7976044\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int n, q;\\n cin >> n >> q;\\n vector<long long> imos_range(n + 2), imos_l_sum(n + 2);\\n for (int i = 0; i < q; i++) {\\n int l, k;\\n cin >> l >> k;\\n imos_range[l]++;\\n imos_range[l + k]--;\\n imos_l_sum[l] += l;\\n imos_l_sum[l + k] -= l;\\n }\\n for (int i = 1; i <= n; i++) {\\n imos_range[i] += imos_range[i - 1];\\n imos_l_sum[i] += imos_l_sum[i - 1];\\n cout << imos_range[i] * (i + 1) - imos_l_sum[i];\\n if (i < n) cout << ' ';\\n }\\n cout << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 6284,\n \"score_of_the_acc\": -0.2546,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3165_7975323\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef unsigned uint;\\ntypedef long long ll;\\ntypedef long long lint;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n\\ntypedef char chr;\\ntypedef string str;\\n\\n#define REP(i, n) for (int i=0;i<(int)n;i++)\\n#define ALL(x) x.begin() x.begin()\\n#define SEP \\\" \\\"\\n#define YES cout << \\\"Yes\\\" << endl\\n#define NO cout << \\\"NO\\\" << endl\\n#define OUT(x) cout << x << endl\\n#define OUTF(x) cout << fixed << setprecision(10) << x << endl\\n#define SIZE(v) v.size()\\n#define PB push_back\\n#define MP make_pair\\n#define MT make_typle\\n\\nconst double pi = 3.141592653589793238;\\n\\nconst int large_a = 65;\\nconst int small_a = 97;\\n\\nconst int INF = 2147483647;\\nconst int INT_INF = 2147483647;\\n\\nconst int dy[4] = {-1, 0, 1, 0};\\nconst int dx[4] = {0, 1, 0, -1};\\n\\ntemplate<class T> inline void print_vec(const vector<T>& v) {\\n\\tint last = SIZE(v);\\n\\tREP(i, last) {\\n\\t\\tcout << v[i];\\n\\t\\tif(i != last-1) cout << SEP;\\n\\t}\\n\\tcout << endl;\\n}\\n\\nint main() {\\n\\tint n,q;\\n\\tcin >> n >> q;\\n\\tvector<ll> v(n+2),b(n+2);\\n\\tfor(int i=0;i<q;i++){\\n\\t\\tint l,k;\\n\\t\\tcin >> l >> k;\\n\\t\\tv[l]++;\\n\\t\\tv[l+k]--;\\n\\t\\tb[l]-=l-1;\\n\\t\\tb[l+k]+=l-1;\\n\\t}\\n\\tfor(int i=1;i<n+1;i++){\\n\\t\\tv[i]+=v[i-1];\\n\\t\\tb[i]+=b[i-1];\\n\\t}\\n\\tfor(int i=1;i<n+1;i++){\\n\\t\\tv[i]*=i;\\n\\t}\\n\\tfor(int i=1;i<n;i++){\\n\\t\\tcout << v[i]+b[i] << \\\" \\\";\\n\\t}\\n\\tcout << v[n]+b[n] << endl;\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 6244,\n \"score_of_the_acc\": -0.2527,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3165_7975209\",\n \"code_snippet\": \"#include<cstdio>\\n#include<iostream>\\nusing namespace std;\\n\\nunsigned long long ans[200002];\\nunsigned long long dp[200002];\\n\\nint main(){\\n unsigned long long n,q,i,j;\\n unsigned long long l,k;\\n\\n scanf(\\\"%llu %llu\\\", &n, &q);\\n \\n for(i=1;i<=n;i++){\\n ans[i] = 0;\\n dp[i] = 0;\\n }\\n\\n for(i=0;i<q;i++){\\n scanf(\\\"%llu %llu\\\", &l, &k);\\n dp[l-1] += -1;\\n dp[l+k-1] += 1;\\n ans[l+k-1] += k;\\n }\\n\\n for(i=n;i>=2;i--){\\n if(dp[i]==0)continue;\\n \\n dp[i-1] = dp[i-1] + dp[i];\\n ans[i-1] = (ans[i] - dp[i]) + ans[i-1];\\n }\\n \\n for(i=1;i<=n;i++){\\n printf(\\\"%llu\\\", ans[i]);\\n if(i!=n){\\n printf(\\\" \\\");\\n }\\n }\\n printf(\\\"\\\\n\\\");\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6348,\n \"score_of_the_acc\": -0.14,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3165_7974994\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\nconst int mod = 998244353;\\nconst int inf = (1<<30);\\n\\nconst int dy[4] = {-1,0,0,1};\\nconst int dx[4] = {0,-1,1,0};\\n\\nint main(){\\n int n,q;cin>>n>>q;\\n vector<pair<long long,long long>> A(n+2);\\n vector<long long> D(n+2);\\n for(int i = 0; q > i; i++){\\n long long l,k;cin>>l>>k;\\n l--;\\n A[l].first++;\\n A[l+k].second+=k; \\n D[l+k]++;\\n }\\n long long nw = 0;\\n long long ans = 0;\\n for(int i = 0; n > i; i++){\\n if(A[i].first){\\n nw += A[i].first; \\n }\\n if(A[i].second){\\n ans -= A[i].second;\\n nw -= D[i];\\n }\\n ans += nw;\\n cout << ans<< \\\" \\\\n\\\"[i+1==n];\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 7828,\n \"score_of_the_acc\": -0.3276,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3165_7974968\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n int n, q;\\n cin >> n >> q;\\n vector<long long> imos(n + 2, 0), ans(n + 2, 0);\\n for (int i = 0; i < q; i++) {\\n int l, k;\\n cin >> l >> k;\\n imos[l]++;\\n imos[l + k]--;\\n ans[l + k] -= k;\\n }\\n for (int i = 0; i < n; i++) {\\n imos[i + 1] += imos[i];\\n }\\n for (int i = 0; i < n; i++) {\\n ans[i + 1] += ans[i] + imos[i + 1];\\n }\\n for (int i = 0; i < n; i++) {\\n cout << ans[i + 1];\\n if (i < n - 1) cout << ' ';\\n }\\n cout << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 6252,\n \"score_of_the_acc\": -0.2531,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3165_7009756\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3165.cc: Triangle Addition\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 200000;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\n\\ntemplate <typename T>\\nstruct SegTreeSumDelay {\\n int e2;\\n vector<T> nodes, das, dbs;\\n vector<int> ls;\\n T defv;\\n SegTreeSumDelay() {}\\n\\n void init(int n, T _defv) {\\n defv = _defv;\\n for (e2 = 1; e2 < n; e2 <<= 1);\\n nodes.assign(e2 * 2, defv);\\n das.assign(e2 * 2, 0);\\n dbs.assign(e2 * 2, 0);\\n ls.assign(e2 * 2, 1);\\n for (int j = e2 - 2; j >= 0; j--) ls[j] = ls[j * 2 + 1] + ls[j * 2 + 2];\\n }\\n\\n T &geti(int i) { return nodes[e2 - 1 + i]; }\\n void seti(int i, T v) { geti(i) = v; }\\n\\n void setall() {\\n for (int j = e2 - 2; j >= 0; j--)\\n nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];\\n }\\n\\n T __sigma(T a, T b, int dx) {\\n // sigma_{x=0}^(dx-1) (ax+b)\\n return a * dx * (dx - 1) / 2 + b * dx;\\n }\\n\\n void __update(int k) {\\n if (das[k] > 0 || dbs[k] > 0) {\\n int k0 = k * 2 + 1, k1 = k0 + 1;\\n ll a = das[k], b0 = dbs[k], b1 = b0 + a * ls[k0];\\n nodes[k0] += __sigma(a, b0, ls[k0]);\\n nodes[k1] += __sigma(a, b1, ls[k1]);\\n das[k0] += a, das[k1] += a;\\n dbs[k0] += b0, dbs[k1] += b1;\\n das[k] = dbs[k] = 0;\\n }\\n }\\n\\n void updateall() {\\n for (int j = 0; j < e2 - 1; j++) __update(j);\\n }\\n\\n void add_range(int r0, int r1, T v, int k, int i0, int i1) {\\n if (r1 <= i0 || i1 <= r0) return;\\n if (r0 <= i0 && i1 <= r1) {\\n T b = v + (i0 - r0);\\n nodes[k] += __sigma(1, b, ls[k]);\\n das[k]++, dbs[k] += b;\\n return;\\n }\\n\\n __update(k);\\n\\n int im = (i0 + i1) / 2;\\n int k0 = k * 2 + 1, k1 = k0 + 1;\\n add_range(r0, r1, v, k0, i0, im);\\n add_range(r0, r1, v, k1, im, i1);\\n nodes[k] = nodes[k0] + nodes[k1];\\n }\\n void add_range(int r0, int r1, T v) { add_range(r0, r1, v, 0, 0, e2); }\\n};\\n\\n/* global variables */\\n\\nSegTreeSumDelay<ll> st;\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, qn;\\n scanf(\\\"%d%d\\\", &n, &qn);\\n\\n st.init(n, 0);\\n\\n while (qn--) {\\n int l, k;\\n scanf(\\\"%d%d\\\", &l, &k), l--;\\n st.add_range(l, l + k, 1);\\n }\\n\\n st.updateall();\\n\\n for (int i = 0; i < n; i++)\\n printf(\\\"%lld%c\\\", st.geti(i), (i + 1 < n) ? ' ' : '\\\\n');\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 16924,\n \"score_of_the_acc\": -0.9635,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3165_6928534\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=9167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (ll i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tint t=1;\\n\\t//cin>>t;\\n\\trep(i,t) solve();\\n}\\n\\nvoid solve(){\\n\\tint N,Q;\\n\\tcin>>N>>Q;\\n\\tvector<ll> A(N+3),B(N+3);\\n\\trep(i,Q){\\n\\t\\tint l,k;\\n\\t\\tcin>>l>>k;\\n\\t\\tB[l]++;\\n\\t\\tB[l+k]-=k+1;\\n\\t\\tB[l+k+1]+=k;\\n\\t}\\n\\trep(i,N){\\n\\t\\tif(i) cout<<\\\" \\\";\\n\\t\\tB[i+1]+=B[i];\\n\\t\\tA[i+1]=B[i+1]+A[i];\\n\\t\\tcout<<A[i+1];\\n\\t}\\n\\tcout<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6272,\n \"score_of_the_acc\": -0.107,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3165_6451223\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std ;\\ntypedef long long ll ;\\ntypedef long double ld ;\\ntypedef pair<ll,ll> P ;\\ntypedef tuple<ll,ll,ll> TP ;\\n#define chmin(a,b) a = min(a,b)\\n#define chmax(a,b) a = max(a,b)\\n#define bit_count(x) __builtin_popcountll(x)\\n#define gcd(a,b) __gcd(a,b)\\n#define lcm(a,b) a / gcd(a,b) * b\\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\\n#define rrep(i,a,b) for(int i = a ; i < b ; i++)\\n#define endl \\\"\\\\n\\\"\\n\\ntemplate<typename S , typename M>\\nstruct LazySegmentTree{\\n private :\\n int n , _n ;\\n using FS = function<S(S,S)> ;\\n using FM = function<M(M,M)> ;\\n using FA = function<S(S,M)> ;\\n FS fs ;\\n FM fm ;\\n FA fa ;\\n S es ;\\n M em ;\\n vector<S> dat ;\\n vector<M> lazy ;\\n \\n // 各セグメントに左端値, 右端値を持たせる\\n void build(){\\n int id = 0 ;\\n for(int i = n ; i > 0 ; i = i / 2){\\n for(int j = 0 ; j < n ; j += i){\\n dat[id].lef = j ;\\n dat[id].rig = j + i ;\\n id++ ;\\n }\\n }\\n }\\n void eval(int k , int l , int r){\\n if(lazy[k] == em) return ;\\n int len = (r - l) / 2 ;\\n if(k < n - 1) {\\n lazy[2 * k + 1] = fm(lazy[2 * k + 1] , {lazy[k].a,lazy[k].b}) ;\\n lazy[2 * k + 2] = fm(lazy[2 * k + 2] , {lazy[k].a,lazy[k].a*len+lazy[k].b}) ;\\n }\\n dat[k] = fa(dat[k],lazy[k]) ;\\n lazy[k] = em ;\\n }\\n void apply(int a , int b , int k , int l , int r , M x){\\n eval(k,l,r) ;\\n if(r <= a || b <= l) return ;\\n if(a <= l && r <= b) {\\n lazy[k] = fm(lazy[k],{x.a,x.a*(l-a)+x.b}) ;\\n eval(k,l,r) ;\\n return ;\\n }\\n apply(a,b,2*k+1,l,(l+r)/2,x) ;\\n apply(a,b,2*k+2,(l+r)/2,r,x) ;\\n dat[k] = fs(dat[2*k+1],dat[2*k+2]) ;\\n }\\n S prod(int a , int b , int k , int l , int r) {\\n eval(k,l,r) ;\\n if(r <= a || b <= l) return es ;\\n if(a <= l && r <= b) return dat[k] ;\\n S lef = prod(a,b,2*k+1,l,(l+r)/2) ;\\n S rig = prod(a,b,2*k+2,(l+r)/2,r) ;\\n return fs(lef,rig) ;\\n }\\n \\n public :\\n LazySegmentTree(int n_ , FS fs_ , S es_ , S ee_ , FM fm_ , M em_ , FA fa_) : fs(fs_) , fm(fm_) , fa(fa_) , es(es_) , em(em_) {\\n _n = n_ ;\\n n = 1 ;\\n while(n_ > n) n *= 2 ;\\n dat.resize(2 * n - 1,ee_) ;\\n lazy.resize(2 * n - 1,em) ;\\n build() ;\\n }\\n void apply(int a , int b , M x) { apply(a,b,0,0,n,x) ; }\\n S prod(int a , int b) { return prod(a,b,0,0,n) ; }\\n};\\n\\nnamespace monoid{\\n ll linf = 1e16 ;\\n int inf = 1e8 ;\\n\\n // モノイド\\n struct S{\\n ll sum ;\\n int lef , rig ;\\n };\\n\\n // S*S->Sにおける演算の定義\\n function<S(S,S)> fs = [](S x , S y) -> S {\\n return S{\\n x.sum + y.sum,\\n x.lef,\\n y.rig\\n };\\n };\\n \\n // Sの単位元\\n S es = {0,inf,-inf} ;\\n\\n // Sの初期化単位元\\n S ee = {0,0,0} ;\\n\\n // 作用モノイド\\n struct M{\\n ll a , b ;\\n bool operator == (M x) { return a == x.a && b == x.b ; }\\n };\\n\\n // M*M->Mにおける演算の定義1\\n function<M(M,M)> fm = [](M x , M y) -> M {\\n return M{\\n x.a + y.a,\\n x.b + y.b\\n };\\n };\\n\\n // Mの単位元\\n M em = {0,0} ;\\n\\n // S*M->Sにおける演算の定義\\n function<S(S,M)> fa = [](S x , M y) -> S {\\n int len = (x.rig - x.lef) ;\\n int lef = x.lef ;\\n return S{\\n x.sum + len * (len - 1) / 2 * y.a + len * y.b ,\\n x.lef,\\n x.rig,\\n };\\n };\\n};\\nusing namespace monoid ;\\n\\n// default\\n// S : sum(区間和) , lef(区間左端値), rig(区間右端値) \\n// M : (a,b) -> ax + b のモノイド\\n// apply: 区間等差数列加算\\n// prod : sum(区間和), min(区間最小値), max(区間最大値)\\n\\nint n , q ;\\n\\nint main(){\\n cin >> n >> q ;\\n LazySegmentTree<S,M> segtree(n,fs,es,ee,fm,em,fa) ;\\n rep(i,q){\\n int l , r ;\\n cin >> l >> r ;\\n l-- ;\\n segtree.apply(l,l+r,{1,1}) ;\\n }\\n rep(i,n) {\\n if(i == n - 1) cout << segtree.prod(i,i+1).sum << endl ;\\n else cout << segtree.prod(i,i+1).sum << \\\" \\\" ;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 19608,\n \"score_of_the_acc\": -1.5903,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3165_6422580\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#define CONSTANTS\\n// #define CAST_MINT_TO_LL\\n#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconstexpr long long INF = 1e18;\\n// constexpr long long INF = LONG_LONG_MAX;\\nconstexpr int MOD = 1000000007;\\n// constexpr int MOD = 998244353;\\nconstexpr long double EPS = 1e-10;\\nconstexpr long double PI = M_PI;\\n\\nusing ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; using pii = pair<int, int>; using pli = pair<ll, int>; using pil = pair<int, ll>; using vvl = vector<vector<ll>>; using vvi = vector<vector<int>>; using vvpll = vector<vector<pll>>; using vvpli = vector<vector<pli>>; using vvpil = vector<vector<pil>>;\\n#define name4(i, a, b, c, d, e, ...) e\\n#define rep(...) name4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\\n#define rep1(i, a) for (ll i = 0, _aa = a; i < _aa; i++)\\n#define rep2(i, a, b) for (ll i = a, _bb = b; i < _bb; i++)\\n#define rep3(i, a, b, c) for (ll i = a, _bb = b; (c > 0 && a <= i && i < _bb) or (c < 0 && a >= i && i > _bb); i += c)\\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\\n#define pb push_back\\n#define eb emplace_back\\n#define mkp make_pair\\n#define ALL(A) A.begin(), A.end()\\n#define UNIQUE(A) sort(ALL(A)), A.erase(unique(ALL(A)), A.end())\\n#define elif else if\\n#define tostr to_string\\n#ifndef CONSTANTS\\nconstexpr ll INF = 1e18; constexpr int MOD = 1000000007; constexpr ld EPS = 1e-10; constexpr ld PI = M_PI;\\n#endif\\ntemplate<int mod> struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator++() { x++; if (x == mod) x = 0; return *this; } ModInt &operator--() { if (x == 0) x = mod; x--; return *this; } ModInt &operator+=(const ModInt &p) { if((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int) (1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inv(); return *this; } ModInt operator++(int) { ModInt result = *this; ++*this; return result; } ModInt operator--(int) { ModInt result = *this; --*this; return result; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inv() const { int a = x, b = mod, u = 1, v = 0, t; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } static int get_mod() { return mod; }\\n#ifdef CAST_MINT_TO_LL\\noperator ll() const { return x; }\\n#endif\\n}; using mint = ModInt<MOD>;\\ntemplate<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); } template<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); } template<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N, vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }\\ntemplate<typename T=ll> vector<T> LIST(ll N) { vector<T> A(N); rep(i, N) { cin >> A[i]; } return A; }\\nvoid print() { cout << '\\\\n'; } template<typename T> void print(T out) { cout << out << '\\\\n'; } template<typename T1, typename T2> void print(const pair<T1, T2> &p) { cout << p.first << ' ' << p.second << '\\\\n'; } template<typename T1, typename T2, typename T3> void print(const tuple<T1, T2, T3> &tp) { cout << get<0>(tp) << ' ' << get<1>(tp) << ' ' << get<2>(tp) << '\\\\n'; } template<typename T1, typename T2, typename T3, typename T4> void print(const tuple<T1, T2, T3, T4> &tp) { cout << get<0>(tp) << ' ' << get<1>(tp) << ' ' << get<2>(tp) << ' ' << get<3>(tp) << '\\\\n'; } template<typename T1, typename T2> void print(const vector<pair<T1, T2>> &V) { for (auto& p : V) print(p); } template<typename T> void print(const vector<T> &V) { rep(i, V.size()) { cout << V[i]; if (i != V.size()-1) cout << ' '; } cout << '\\\\n'; } template<typename T, size_t SZ> void print(const array<T, SZ> &arr) { rep(i, arr.size()) { cout << arr[i]; if (i != arr.size()-1) cout << ' '; } cout << '\\\\n'; } template<typename T, size_t SZ> void print(const vector<array<T, SZ>> &V) { for (auto& arr : V) print(arr); } template<typename T> void print(const deque<T> &que) { vector<T> V(ALL(que)); print(V); } template<typename T> void print(const set<T> &se) { vector<T> V(ALL(se)); print(V); }\\n#define debug(x) (cout << #x << \\\": \\\", print(x));\\nvoid Yes() { print(\\\"Yes\\\"); } void No() { print(\\\"No\\\"); } void YES() { print(\\\"YES\\\"); } void NO() { print(\\\"NO\\\"); }\\nll toint(string s) { assert(s.size() < 20); ll res = 0; for (char &c : s) { res *= 10; res += c - '0'; } return res; } int toint(char num) { return num - '0'; }\\nchar tochar(int num) { return '0' + num; }\\ntemplate<typename T> T ceil(T a, T b) { if (a >= 0) return (a+b-1) / b; else return a / b; }\\ntemplate<typename T> T modulo(T a, T b) { return ((a % b) + b) % b; }\\ntemplate<typename T> pair<T, T> divmod(T a, T b) { T d = a / b; T m = a % b; return {d, m}; }\\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\\ntemplate<typename T> T sum(const vector<T> &A) { return accumulate(ALL(A), (T)0); } template<typename key, typename val> val sum(const map<key, val> &mp) { val res = 0; for (auto& [k, v] : mp) res += v; return res; }\\ntemplate<typename T> T min(const vector<T> &A) { return *min_element(ALL(A)); } template<typename key, typename val> val min(const map<key, val> &mp) { val res = numeric_limits<val>::max(); for (auto& [k, v] : mp) chmin(res, v); return res; }\\ntemplate<typename T> T max(const vector<T> &A) { return *max_element(ALL(A)); } template<typename key, typename val> val max(const map<key, val> &mp) { val res = numeric_limits<val>::min(); for (auto& [k, v] : mp) chmax(res, v); return res; }\\nll pow(ll x, ll n) { ll res = 1; rep(_, n) res *= x; return res; } ll pow(int x, ll n) { return pow((ll)x, n); } ll pow(ll x, int n) { return pow(x, (ll)n); } ll pow(int x, int n) { return pow((ll)x, (ll)n); } ll pow(ll x, ll n, int mod) { x %= mod; ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }\\nint popcount(ll S) { return __builtin_popcountll(S); }\\nint bit_length(ll x) { return x != 0 ? floor(log2((ld)x))+1 : 0; }\\ntemplate<typename T> int bisect_left(const vector<T> &A, T val, int lo=0) { return lower_bound(A.begin()+lo, A.end(), val) - A.begin(); } template<typename T> int bisect_right(const vector<T> &A, T val, int lo=0) { return upper_bound(A.begin()+lo, A.end(), val) - A.begin(); }\\ntemplate<typename T> map<T, ll> Counter(const vector<T> &A) { map<T, ll> res; for (T a : A) { res[a]++; } return res; } template<typename T> vector<ll> Counter(const vector<T> &A, int mx) { vector<ll> res(mx+1); for (T a : A) { res[a]++; } return res; } map<char, ll> Counter(const string &S) { map<char, ll> res; for (char c : S) { res[c]++; } return res; }\\ntemplate<typename F> ll bisearch_min(ll mn, ll mx, const F &func) { ll ok = mx; ll ng = mn; while (ng+1 < ok) { ll mid = (ok+ng) / 2; if (func(mid)) { ok = mid; } else { ng = mid; } } return ok; } template<typename F> ll bisearch_max(ll mn, ll mx, const F &func) { ll ok = mn; ll ng = mx; while (ok+1 < ng) { ll mid = (ok+ng) / 2; if (func(mid)) { ok = mid; } else { ng = mid; } } return ok; }\\ntemplate<typename T1, typename T2> pair<vector<T1>, vector<T2>> zip(const vector<pair<T1, T2>> &A) { int N = A.size(); pair<vector<T1>, vector<T2>> res = {vector<T1>(N), vector<T2>(N)}; rep(i, N) { res.first[i] = A[i].first; res.second[i] = A[i].second; } return res; } template<typename T1, typename T2, typename T3> tuple<vector<T1>, vector<T2>, vector<T3>> zip(const vector<tuple<T1, T2, T3>> &A) { int N = A.size(); tuple<vector<T1>, vector<T2>, vector<T3>> res = {vector<T1>(N), vector<T2>(N), vector<T3>(N)}; rep(i, N) { get<0>(res)[i] = get<0>(A[i]); get<1>(res)[i] = get<1>(A[i]); get<2>(res)[i] = get<2>(A[i]); } return res; }\\ntemplate<typename T> struct Compress { int N; vector<T> dat; Compress(vector<T> A) { sort(A.begin(), A.end()); A.erase(unique(A.begin(), A.end()), A.end()); N = A.size(); dat = A; } int zip(T x) { return bisect_left(dat, x); } T unzip(int x) { return dat[x]; } int operator[](T x) { return zip(x); } int size() { return dat.size(); } vector<ll> zip(const vector<T> &A) { int M = A.size(); vector<ll> res(M); rep(i, M) res[i] = zip(A[i]); return res; } };\\ntemplate<typename T> vector<pair<T, int>> RLE(const vector<T> &A) { if (A.empty()) return {}; int N = A.size(); vector<pair<T, int>> res; T cur = A[0]; int cnt = 1; rep(i, 1, N) { if (A[i] == A[i-1]) { cnt++; } else { res.pb({cur, cnt}); cnt = 1; cur = A[i]; } } res.pb({cur, cnt}); return res; } vector<pair<char, int>> RLE(const string &S) { if (S.empty()) return {}; int N = S.size(); vector<pair<char, int>> res; char cur = S[0]; int cnt = 1; rep(i, 1, N) { if (S[i] == S[i-1]) { cnt++; } else { res.pb({cur, cnt}); cnt = 1; cur = S[i]; } } res.pb({cur, cnt}); return res; }\\ntemplate<typename T> bool mul_overflow(T x, T y) { T z; return __builtin_mul_overflow(x, y, &z); }\\nvector<ll> split(const string &S, char separator) { int N = S.size(); vector<ll> res; string cur; rep(i, N) { if (S[i] == separator) { res.eb(toint(cur)); cur = \\\"\\\"; } else { cur += S[i]; } } if (cur.size()) res.eb(toint(cur)); return res; }\\nstring to_string(const string &S) { return S; } string to_string(char c) { return {c}; }\\ntemplate<typename T> string join(const vector<T> &A, char separator=0) { int N = A.size(); string res; rep(i, N) { res += tostr(A[i]); if (separator != 0 and i != N-1) res += separator; } return res; }\\ntemplate<typename T> vector<T> sorted(vector<T> A, bool reverse=false) { sort(ALL(A)); if (reverse) std::reverse(ALL(A)); return A; } string sorted(string S, bool reverse=false) { sort(ALL(S)); if (reverse) std::reverse(ALL(S)); return S; }\\ntemplate<typename T> vector<T> reversed(vector<T> A) { reverse(ALL(A)); return A; } string reversed(string S) { reverse(ALL(S)); return S; }\\ntemplate<typename Mint> struct ModTools { int MAX; vector<Mint> _fact, _factinv, inv; ModTools(int mx) : MAX(++mx) { _fact.resize(MAX); _factinv.resize(MAX); inv.resize(MAX); _fact[0] = _fact[1] = 1; rep(i, 2, MAX) { _fact[i] = _fact[i-1]*(Mint)i; } _factinv[MAX-1] = (Mint)1/_fact[MAX-1]; rep(i, MAX-2, -1, -1) { _factinv[i] = _factinv[i+1]*(Mint)(i+1); } rep(i, MAX-1, 0, -1) { inv[i] = _factinv[i]*_fact[i-1]; } } Mint div(Mint a, int b) { return a*inv[b]; } Mint fact(int x) { assert(x < MAX); return _fact[x]; } Mint factinv(int x) { assert(x < MAX); return _factinv[x]; } Mint nCr(int n, int r) { if (n < r or r < 0) return 0; r = min(r, n-r); Mint num = _fact[n]; Mint den = _factinv[r] * _factinv[n-r]; return num * den; } Mint nHr(int n, int r) { assert(r+n-1 < MAX); return nCr(r+n-1, r); } Mint nPr(int n, int r) { if (n < r or r < 0) return 0; return _fact[n] * _factinv[n-r]; } Mint double_factorial(int n) { if (n%2 == 0) { int k = n/2; return Mint(2).pow(k)*fact(k); } else { int k = (n+1)/2; return fact(2*k)/Mint(2).pow(k)/fact(k); } } };\\ntemplate<typename T> vector<vector<T>> permutations(const vector<T> &A, int N=-1) { if (N == -1) N = A.size(); int M = A.size(); assert(N <= M); vector<vector<T>> comb; rep(bit, 1<<M) { if (popcount(bit) != N) continue; vector<T> res; rep(i, M) { if (bit>>i & 1) { res.pb(A[i]); } } comb.pb(res); } vector<vector<T>> res; for (auto &perm : comb) { sort(ALL(perm)); do { res.pb(perm); } while (next_permutation(ALL(perm))); } return res; }\\ntemplate<typename T> vector<vector<T>> combinations(const vector<T> &A, int N) { int M = A.size(); vector<vector<T>> res; auto rec = [&](auto&& f, vector<T> &cur, ll x, ll n) -> void { if (n == N) { res.pb(cur); return; } rep(i, x, M) { cur.pb(A[i]); f(f, cur, i+1, n+1); cur.pop_back(); } }; vector<T> cur; rec(rec, cur, 0, 0); return res; }\\nll nC2(ll n) { if (n < 2) return 0; return n*(n-1)/2; }\\ntemplate<typename T> T factorial(int x) { T res = 1; for (int i=1; i<=x; i++) res *= i; return res; }\\nstruct UnionFind { int n, groupcnt; vector<int> par, rank, sz; vector<bool> tree; UnionFind(int n) : n(n) { par.assign(n, 0); rank.assign(n, 0); sz.assign(n, 1); tree.assign(n, true); rep(i, n) par[i] = i; groupcnt = n; } UnionFind() {} void resize(int _n) { n = _n; par.assign(n, 0); rank.assign(n, 0); sz.assign(n, 1); tree.assign(n, true); rep(i, n) par[i] = i; groupcnt = n; } int find(int x) { if (par[x] == x) { return x; } else { par[x] = find(par[x]); return par[x]; } } int merge(int a, int b) { int x = find(a); int y = find(b); if (x == y) { tree[x] = false; return x; } if (!tree[x] or !tree[y]) { tree[x] = tree[y] = false; } groupcnt--; if (rank[x] < rank[y]) { par[x] = y; sz[y] += sz[x]; return y; } else { par[y] = x; sz[x] += sz[y]; if (rank[x] == rank[y]) { rank[x]++; } return x; } } bool same(int a, int b) { return find(a) == find(b); } ll size(int x) { return sz[find(x)]; } int size() { return groupcnt; } bool is_tree(int x) { return tree[find(x)]; } set<int> get_roots() { set<int> res; rep(i, n) { res.insert(find(i)); } return res; } };\\nconst vector<pii> dir4 = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};\\n#define directions dir4\\nll gridtoid(ll i, ll j, ll W) { return i*W+j; }\\npll idtogrid(ll id, ll W) { return divmod(id, W); }\\ntemplate<typename _Key, typename _Tp> struct defaultdict : map<_Key, _Tp> { const _Tp init; defaultdict() : init(_Tp()) {}; defaultdict(_Tp init) : init(init) {} _Tp& operator[](const _Key& k) { if (this->count(k)) { return map<_Key, _Tp>::operator[](k); } else { return map<_Key, _Tp>::operator[](k) = init; } } _Tp& operator[](_Key&& k) { if (this->count(k)) { return map<_Key, _Tp>::operator[](k); } else { return map<_Key, _Tp>::operator[](k) = init; } } };\\nll gcd(ll a, ll b) { return __gcd(a, b); } template<typename T> T gcd(const vector<T> &A) { T res = 0; for (auto a : A) res = gcd(res, a); return res; }\\nll lcm(ll x, ll y) { return x/gcd(x, y)*y; } template<typename T> T lcm(const vector<T> &A) { T res = 1; for (auto a : A) res = lcm(res, a); return res; }\\ntemplate<typename T> vector<pair<T, int>> factorize(T n) { vector<pair<T, int>> ret; for (T i=2; i*i<=n; i++) { int cnt = 0; while (n % i == 0) { n /= i; cnt++; } if (cnt) ret.emplace_back(i, cnt); } if (n > 1) ret.emplace_back(n, 1); return ret; }\\ntemplate<typename T> vector<T> divisors(T n) { vector<T> res; for (T i=1; i*i<=n; i++) { if (n%i == 0) { res.eb(i); if (n/i != i) res.eb(n/i); } } return res; }\\nll isqrt(ll n, bool ceil=false) { ll ok = 0; ll ng = 3037000500; while (ng - ok > 1) { ll m = ok + (ng - ok) / 2; if (m * m <= n) { ok = m; } else { ng = m; } } if (ceil and ok*ok != n) ok++; return ok; }\\ntemplate<typename T> struct Accumulate { vector<T> acc; int N; Accumulate(int N) : N(N) { acc.resize(N); } Accumulate(const vector<T> &A) : N(A.size()), acc(A) { build(); } void set(int i, T a) { acc[i] = a; } void add(int i, T a) { acc[i] += a; } void build() { rep(i, N-1) { acc[i+1] += acc[i]; } acc.insert(acc.begin(), 0); } T query(int l, int r) { assert(0 <= l and l <= N and 0 <= r and r <= N); return acc[r]-acc[l]; } T get(int i) { return query(i, i+1); } T operator[](int i) { return query(i, i+1); } ll bisearch_fore(int l, int r, ll x) { if (l > r) return -1; ll l_sm = query(0, l); int ok = r + 1; int ng = l - 1; while (ng+1 < ok) { int mid = (ok+ng) / 2; if (query(0, mid+1) - l_sm >= x) { ok = mid; } else { ng = mid; } } if (ok != r+1) { return ok; } else { return -1; } } ll bisearch_back(int l, int r, ll x) { if (l > r) return -1; ll r_sm = query(0, r+1); int ok = l - 1; int ng = r + 1; while (ok+1 < ng) { int mid = (ok+ng) / 2; if (r_sm - query(0, mid) >= x) { ok = mid; } else { ng = mid; } } if (ok != l-1) { return ok; } else { return -1; } } };\\ntemplate<typename T> struct BIT { int sz; vector<T> tree; BIT(int n) { n++; sz = 1; while (sz < n) { sz *= 2; } tree.resize(sz); } T sum(int i) { T s = 0; i++; while (i > 0) { s += tree[i-1]; i -= i & -i; } return s; } void add(int i, T x) { i++; while (i <= sz) { tree[i-1] += x; i += i & -i; } } T query(int l, int r) { return sum(r-1) - sum(l-1); } T get(int i) { return query(i, i+1); } void update(int i, T x) { add(i, x - get(i)); } T operator[](int i) { return query(i, i+1); } void print(int n) { rep(i, n) { cout << query(i, i+1); if (i == n-1) cout << endl; else cout << ' '; } } ll bisearch_fore(int l, int r, ll x) { if (l > r) return -1; ll l_sm = sum(l-1); int ok = r + 1; int ng = l - 1; while (ng+1 < ok) { int mid = (ok+ng) / 2; if (sum(mid) - l_sm >= x) { ok = mid; } else { ng = mid; } } if (ok != r+1) { return ok; } else { return -1; } } ll bisearch_back(int l, int r, ll x) { if (l > r) return -1; ll r_sm = sum(r); int ok = l - 1; int ng = r + 1; while (ok+1 < ng) { int mid = (ok+ng) / 2; if (r_sm - sum(mid-1) >= x) { ok = mid; } else { ng = mid; } } if (ok != l-1) { return ok; } else { return -1; } } };\\ntemplate<typename Monoid, typename F> struct SegmentTree { int sz; vector<Monoid> seg; const F f; const Monoid M1; SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) { sz = 1; while(sz < n) sz <<= 1; seg.assign(2 * sz, M1); } SegmentTree(const F f, const Monoid &M1) : f(f), M1(M1) {} void resize(int n) { sz = 1; while(sz < n) sz <<= 1; seg.resize(2 * sz, M1); } void clear() { seg.clear(); } void set(int k, const Monoid &x) { seg[k+sz] = x; } void build() { for(int k = sz - 1; k > 0; k--) { seg[k] = f(seg[2*k], seg[2*k+1]); } } void build(const vector<Monoid> &A) { int n = A.size(); resize(n); rep(i, n) set(i, A[i]); build(); } void update(int k, const Monoid &x) { k += sz; seg[k] = x; while(k >>= 1) { seg[k] = f(seg[2*k], seg[2*k+1]); } } Monoid query(int a, int b) { Monoid L = M1, R = M1; for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) { if(a & 1) L = f(L, seg[a++]); if(b & 1) R = f(seg[--b], R); } return f(L, R); } Monoid operator[](const int &k) const { return seg[k+sz]; } Monoid all() { return seg[1]; } void print(int n) { for (int i=0; i<n; i++) { cout << query(i, i+1); if (i == n-1) cout << endl; else cout << ' '; } } template<typename C> int find_subtree(int a, const C &check, Monoid &M, bool type) { while(a < sz) { Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]); if(check(nxt)) a = 2 * a + type; else M = nxt, a = 2 * a + 1 - type; } return a - sz; } template<typename C> int find_first(int a, const C &check) { Monoid L = M1; if(a <= 0) { if(check(f(L, seg[1]))) return find_subtree(1, check, L, false); return -1; } int b = sz; for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) { if(a & 1) { Monoid nxt = f(L, seg[a]); if(check(nxt)) return find_subtree(a, check, L, false); L = nxt; ++a; } } return -1; } template<typename C> int find_last(int b, const C &check) { Monoid R = M1; if(b >= sz) { if(check(f(seg[1], R))) return find_subtree(1, check, R, true); return -1; } int a = sz; for(b += sz; a < b; a >>= 1, b >>= 1) { if(b & 1) { Monoid nxt = f(seg[--b], R); if(check(nxt)) return find_subtree(b, check, R, true); R = nxt; } } return -1; } }; template<typename Monoid, typename F> SegmentTree<Monoid, F> get_segment_tree(int N, const F& f, const Monoid& M1) { return {N, f, M1}; } template<typename Monoid, typename F> SegmentTree<Monoid, F> get_segment_tree(const F& f, const Monoid& M1) { return {f, M1}; }\\nconst string digits = \\\"0123456789\\\";\\nconst string ascii_lowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string ascii_uppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nstring zfill(string str, int len) { string zeros; int n = str.size(); rep(i, len-n) zeros += '0'; return zeros+str; }\\nstring bin(ll x) { string res; while (x) { if (x & 1) { res += '1'; } else { res += '0'; } x >>= 1; } reverse(ALL(res)); if (res == \\\"\\\") res += '0'; return res; }\\n\\nvoid solve() {\\n ll N, Q;\\n cin >> N >> Q;\\n \\n vector<ll> imos(N);\\n rep(i, Q) {\\n ll l, k;\\n cin >> l >> k;\\n l--;\\n ll r = l + k;\\n imos[l]++;\\n if (r < N) {\\n imos[r] -= r - l + 1;\\n }\\n if (r+1 < N) {\\n imos[r+1] += r - l;\\n }\\n }\\n\\n rep(_, 2) {\\n rep(i, 1, N) {\\n imos[i] += imos[i-1];\\n }\\n }\\n print(imos);\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n\\n // single test case\\n solve();\\n\\n // multi test cases\\n // int T;\\n // cin >> T;\\n // while (T--) solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4572,\n \"score_of_the_acc\": -0.0561,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3165_5941369\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing pii = pair<int, int>;\\nusing vvl = vector<vector<ll>>;\\nusing vvi = vector<vector<int>>;\\nusing vvpll = vector<vector<pll>>;\\n#define name4(i, a, b, c, d, e, ...) e\\n#define rep(...) name4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\\n#define rep1(i, a) for (ll i = 0, _aa = a; i < _aa; i++)\\n#define rep2(i, a, b) for (ll i = a, _bb = b; i < _bb; i++)\\n#define rep3(i, a, b, c) for (ll i = a, _bb = b; (c > 0 && a <= i && i < _bb) or (c < 0 && a >= i && i > _bb); i += c)\\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\\n#define pb push_back\\n#define eb emplace_back\\n#define mkp make_pair\\n#define ALL(A) A.begin(), A.end()\\n#define UNIQUE(A) sort(ALL(A)), A.erase(unique(ALL(A)), A.end())\\n#define elif else if\\n#define tostr to_string\\nconstexpr ll INF = 1e18;\\n// constexpr ll INF = LONG_LONG_MAX;\\nconstexpr int MOD = 1000000007;\\n// constexpr int MOD = 998244353;\\n\\ntemplate<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); }\\ntemplate<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); }\\ntemplate<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N, vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }\\n\\ntemplate<typename T=ll> vector<T> LIST(ll N) { vector<T> A(N); rep(i, N) cin >> A[i]; return A; }\\n\\nvoid print() { cout << '\\\\n'; }\\ntemplate<typename T> void print(T out) { cout << out << '\\\\n'; }\\ntemplate<typename T1, typename T2> void print(pair<T1, T2> out) { cout << out.first << ' ' << out.second << '\\\\n'; }\\ntemplate<typename T> void print(const vector<T> &A) { rep(i, A.size()) { cout << A[i]; if (i != A.size()-1) cout << ' '; } cout << '\\\\n'; }\\ntemplate<typename T> void print(const deque<T> &A) { vector<T> V(A.begin(), A.end()); print(V); }\\ntemplate<typename T> void print(const set<T> &S) { vector<T> A(S.begin(), S.end()); print(A); }\\n#define debug(x) (cout << #x << \\\": \\\", print(x));\\n\\nvoid Yes() { print(\\\"Yes\\\"); }\\nvoid No() { print(\\\"No\\\"); }\\nvoid YES() { print(\\\"YES\\\"); }\\nvoid NO() { print(\\\"NO\\\"); }\\n\\n// from common.cpp\\nll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; }\\nint toint(char num) { return num - '0'; }\\nchar tochar(int num) { return '0' + num; }\\nll floor(ll a, ll b) { if (a < 0) return (a-b+1) / b; else return a / b; }\\nll ceil(ll a, ll b) { if (a >= 0) return (a+b-1) / b; else return a / b; }\\nll modulo(ll a, ll b) { return ((a % b) + b) % b; }\\ntemplate<typename T> pll divmod(ll a, T b) { ll d = a / b; ll m = a % b; return {d, m}; }\\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\\ntemplate<typename T> T sum(const vector<T> &A) { T res = 0; for (T a: A) res += a; return res; }\\ntemplate<typename key, typename val> val sum(const map<key, val> &mp) { val res = 0; for (auto [k, v] : mp) res += v; return res; }\\ntemplate<typename T> T max(const vector<T> &A) { return *max_element(ALL(A)); }\\ntemplate<typename T> T min(const vector<T> &A) { return *min_element(ALL(A)); }\\nll pow(int x, int n) { ll res = 1; rep(_, n) res *= x; return res; }\\nll pow(int x, ll n) { ll res = 1; rep(_, n) res *= x; return res; }\\nll pow(ll x, int n) { ll res = 1; rep(_, n) res *= x; return res; }\\nll pow(ll x, ll n) { ll res = 1; rep(_, n) res *= x; return res; }\\nll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }\\nint popcount(ll S) { return __builtin_popcountll(S); }\\nint bit_length(ll x) { return x != 0 ? floor(log2((ld)x))+1 : 0; }\\ntemplate<typename T> int bisect_left(const vector<T> &A, T val, int lo=0) { return lower_bound(A.begin()+lo, A.end(), val) - A.begin(); }\\ntemplate<typename T> int bisect_right(const vector<T> &A, T val, int lo=0) { return upper_bound(A.begin()+lo, A.end(), val) - A.begin(); }\\ntemplate<typename T> map<T, ll> Counter(const vector<T> &A) { map<T, ll> res; for (T a : A) res[a]++; return res; }\\ntemplate<typename T> vector<ll> Counter(const vector<T> &A, T mx) { vector<ll> res(mx+1); for (T a : A) { res[a]++; } return res; }\\nmap<char, ll> Counter(const string &S) { map<char, ll> res; for (char c : S) res[c]++; return res; }\\ntemplate<typename F> ll bisearch_min(ll mn, ll mx, const F &func) { ll ok = mx, ng = mn; while (ng+1 < ok) { ll mid = (ok+ng) / 2; if (func(mid)) ok = mid; else ng = mid; } return ok; }\\ntemplate<typename F> ll bisearch_max(ll mn, ll mx, const F &func) { ll ok = mn, ng = mx; while (ok+1 < ng) { ll mid = (ok+ng) / 2; if (func(mid)) ok = mid; else ng = mid; } return ok; }\\ntemplate<typename T1, typename T2> pair<vector<T1>, vector<T2>> zip(const vector<pair<T1, T2>> &A) { ll N = A.size(); pair<vector<T1>, vector<T2>> res = {vector<T1>(N), vector<T2>(N)}; rep(i, N) { res.first[i] = A[i].first; res.second[i] = A[i].second; } return res; }\\ntemplate<typename T1, typename T2, typename T3> tuple<vector<T1>, vector<T2>, vector<T3>> zip(const vector<tuple<T1, T2, T3>> &A) { int N = A.size(); tuple<vector<T1>, vector<T2>, vector<T3>> res = {vector<T1>(N), vector<T2>(N), vector<T3>(N)}; rep(i, N) { get<0>(res)[i] = get<0>(A[i]); get<1>(res)[i] = get<1>(A[i]); get<2>(res)[i] = get<2>(A[i]); } return res; }\\ntemplate<typename T> struct Compress { int N; vector<T> dat; Compress(vector<T> A) { sort(A.begin(), A.end()); A.erase(unique(A.begin(), A.end()), A.end()); N = A.size(); dat = A; } int zip(T x) { return bisect_left(dat, x); } T unzip(int x) { return dat[x]; } int operator[](T x) { return zip(x); } int size() { return dat.size(); } vector<T> zip(const vector<T> &A) { int M = A.size(); vector<T> res(M); rep(i, M) res[i] = zip(A[i]); return res; } };\\ntemplate<typename T> vector<pair<T, int>> RLE(const vector<T> &A) { if (A.empty()) return {}; int N = A.size(); vector<pair<T, int>> res; T cur = A[0]; int cnt = 1; rep(i, 1, N) { if (A[i] == A[i-1]) { cnt++; } else { res.pb({cur, cnt}); cnt = 1; cur = A[i]; } } res.pb({cur, cnt}); return res; }\\nvector<pair<char, int>> RLE(const string &S) { if (S.empty()) return {}; int N = S.size(); vector<pair<char, int>> res; char cur = S[0]; int cnt = 1; rep(i, 1, N) { if (S[i] == S[i-1]) { cnt++; } else { res.pb({cur, cnt}); cnt = 1; cur = S[i]; } } res.pb({cur, cnt}); return res; }\\nbool mul_overflow(ll x, ll y) { ll z; return __builtin_mul_overflow(x, y, &z); }\\nvector<ll> split(const string &S, char separator) { int N = S.size(); vector<ll> res; string cur; rep(i, N) { if (S[i] == separator) { res.eb(toint(cur)); cur = \\\"\\\"; } else { cur += S[i]; } } if (cur.size()) res.eb(toint(cur)); return res; }\\nstring to_string(const string &S) { return S; }\\nstring to_string(char c) { return {c}; }\\ntemplate<typename T> string join(const vector<T> &A, char separator=0) { int N = A.size(); string res; rep(i, N) { res += tostr(A[i]); if (separator != 0 and i != N-1) res += separator; } return res; }\\n\\n// from combinatorics.cpp\\ntemplate<int mod> struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int) (1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } static int get_mod() { return mod; } };\\nusing mint = ModInt<MOD>;\\ntemplate<typename T=mint> struct ModTools { int MAX; vector<T> fact, factinv; ModTools() {}; ModTools(int mx) { build(mx); } void build(int mx) { MAX = ++mx; fact.resize(MAX); factinv.resize(MAX); fact[0] = fact[1] = 1; rep(i, 2, MAX) { fact[i] = fact[i-1] * i; } factinv[MAX-1] = (T)1 / fact[MAX-1]; rep(i, MAX-2, -1, -1) { factinv[i] = factinv[i+1] * (i+1); } } T factorial(int x) { return fact[x]; } T inverse(int x) { return factinv[x]; } T nCr(int n, int r) { if (n < r or r < 0) return 0; r = min(r, n-r); T num = fact[n]; T den = factinv[r] * factinv[n-r]; return num * den; } T nHr(int n, int r) { return nCr(r+n-1, r); } T nPr(int n, int r) { if (n < r or r < 0) return 0; return fact[n] * factinv[n-r]; } };\\ntemplate<typename T> vector<vector<T>> permutations(const vector<T> &A, int N=-1) { if (N == -1) N = A.size(); int M = A.size(); vector<vector<T>> comb; rep(bit, 1<<M) { if (popcount(bit) != N) continue; vector<T> res; rep(i, M) { if (bit>>i & 1) { res.pb(A[i]); } } comb.pb(res); } vector<vector<T>> res; for (auto &perm : comb) { sort(ALL(perm)); do { res.pb(perm); } while (next_permutation(ALL(perm))); } return res; }\\ntemplate<typename T> vector<vector<T>> combinations(const vector<T> &A, int N) { int M = A.size(); vector<vector<T>> res; auto rec = [&](auto&& f, vector<T> &cur, ll x, ll n) -> void { if (n == N) { res.pb(cur); return; } rep(i, x, M) { cur.pb(A[i]); f(f, cur, i+1, n+1); cur.pop_back(); } }; vector<T> cur; rec(rec, cur, 0, 0); return res; }\\ntemplate<typename T> T factorial(T x) { T res = 1; for (T i=1; i<=x; i++) res *= i; return res; }\\n\\n// from graph.cpp\\nstruct UnionFind { int n, groupcnt; vector<int> par, rank, sz; vector<bool> tree; UnionFind(int n) : n(n) { par.resize(n); rank.resize(n); sz.resize(n, 1); tree.resize(n, 1); rep(i, n) par[i] = i; groupcnt = n; } UnionFind() {} void resize(int _n) { n = _n; par.resize(n); rank.resize(n); sz.resize(n, 1); rep(i, n) par[i] = i; groupcnt = n; } int find(int x) { if (par[x] == x) { return x; } else { par[x] = find(par[x]); return par[x]; } } int merge(int a, int b) { int x = find(a); int y = find(b); if (x == y) { tree[x] = false; return x; } if (!tree[x] or !tree[y]) { tree[x] = tree[y] = false; } groupcnt--; if (rank[x] < rank[y]) { par[x] = y; sz[y] += sz[x]; return y; } else { par[y] = x; sz[x] += sz[y]; if (rank[x] == rank[y]) { rank[x]++; } return x; } } bool same(int a, int b) { return find(a) == find(b); } ll size(int x) { return sz[find(x)]; } int size() { return groupcnt; } bool is_tree(int x) { return tree[find(x)]; } set<int> get_roots() { set<int> res; rep(i, n) { res.insert(find(i)); } return res; } };\\n\\n// from grid.cpp\\nconst vector<pii> directions = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};\\nll gridtoid(ll i, ll j, ll W) { return i*W+j; }\\npll idtogrid(ll id, ll W) { return divmod(id, W); }\\ntemplate<typename T> vector<vector<T>> transpose(const vector<vector<T>> &grid) { int H = grid.size(); int W = grid[0].size(); auto res = list2d(W, H, (T)0); rep(i, H) { rep(j, W) { res[j][i] = grid[i][j]; } } return res; }\\nvector<string> transpose(const vector<string> &grid) { int H = grid.size(); int W = grid[0].size(); vector<string> res(W, string(H, '*')); rep(i, H) { rep(j, W) { res[j][i] = grid[i][j]; } } return res; }\\nvector<string> rot90(const vector<string> &grid) { int H = grid.size(); int W = grid[0].size(); vector<string> res(W, string(H, '*')); rep(i, H) { rep(j, W) { res[j][H-i-1] = grid[i][j]; } } return res; }\\n\\n// from mystl.cpp\\ntemplate<typename _Key, typename _Tp, typename _Compare=less<_Key>, typename _Alloc=allocator<pair<const _Key, _Tp>>> struct defaultdict : public map<_Key, _Tp, _Compare, _Alloc> { const _Tp init; defaultdict() : init(_Tp()) {}; defaultdict(_Tp init) : init(init) {} _Tp& operator[](const _Key& k) { if (this->count(k)) { return map<_Key, _Tp, _Compare, _Alloc>::operator[](k); } else { return map<_Key, _Tp, _Compare, _Alloc>::operator[](k) = init; } } _Tp& operator[](_Key&& k) { if (this->count(k)) { return map<_Key, _Tp, _Compare, _Alloc>::operator[](k); } else { return map<_Key, _Tp, _Compare, _Alloc>::operator[](k) = init; } } };\\ntemplate<typename _Key, typename _Compare=less<_Key>, typename _Alloc=allocator<_Key>> struct my_set : public set<_Key, _Compare, _Alloc> { _Key front() { return *this->begin(); } _Key pop_front() { auto res = this->front(); this->erase(this->begin()); return res; } _Key back() { return *this->rbegin(); } _Key pop_back() { auto res = this->back(); this->erase(prev(this->end())); return res; } };\\ntemplate<typename _Key, typename _Compare=less<_Key>, typename _Alloc=allocator<_Key>> struct my_multiset : public multiset<_Key, _Compare, _Alloc> { _Key front() { return *this->begin(); } _Key pop_front() { auto res = this->front(); this->erase(this->begin()); return res; } _Key back() { return *this->rbegin(); } _Key pop_back() { auto res = this->back(); this->erase(prev(this->end())); return res; } };\\ntemplate<typename _Tp, typename _Sequence=vector<_Tp>, typename _Compare=less<typename _Sequence::value_type>> struct my_priority_queue : public priority_queue<_Tp, _Sequence, _Compare> { _Tp pop() { auto res = this->top(); priority_queue<_Tp, _Sequence, _Compare>::pop(); return res; } };\\ntemplate<typename _Tp, typename _Sequence=deque<_Tp>> struct my_queue : public queue<_Tp, _Sequence> { _Tp pop() { auto res = this->front(); queue<_Tp, _Sequence>::pop(); return res; } };\\ntemplate<typename _Tp, typename _Alloc=std::allocator<_Tp>> struct my_deque : public deque<_Tp, _Alloc> { _Tp pop_front() { auto res = this->front(); deque<_Tp, _Alloc>::pop_front(); return res; } _Tp pop_back() { auto res = this->back(); deque<_Tp, _Alloc>::pop_back(); return res; } };\\n\\n// from numbers.cpp\\nll gcd(ll a, ll b) { return __gcd(a, b); }\\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\\ntemplate<typename T> vector<pair<T, int>> factorize(T n) { vector<pair<T, int>> ret; for(T i=2; i*i<=n; i++) { int cnt = 0; while(n % i == 0) { n /= i; cnt++; } if(cnt) ret.emplace_back(i, cnt); } if(n > 1) ret.emplace_back(n, 1); return ret; }\\nvector<ll> divisors(ll n) { vector<ll> res; for (ll i=1; i*i<=n; i++) { if (n%i == 0) { res.pb(i); if (n/i != i) res.pb(n/i); } } return res; }\\nll ntod(string S, ll n) { ll res = 0, k = 1; reverse(ALL(S)); for (char &c : S) { res += k*toint(c); k *= n; } return res; }\\nstring dton(ll num, ll n, char base='0') { string res; while (abs(num) > 0) { ll m = num % abs(n); num -= m; res += base+m; num /= n; } reverse(ALL(res)); if (res != \\\"\\\") { return res; } else { return res+base; } }\\nll isqrt(ll n, bool ceil=false) { ll ok = 0; ll ng = 3037000500; while (ng - ok > 1) { ll m = ok + (ng - ok) / 2; if (m * m <= n) { ok = m; } else { ng = m; } } if (ceil and ok*ok != n) ok++; return ok; }\\nll digit_sum(ll n) { ll res = 0; while (n > 0) { res += n % 10; n /= 10; } return res; }\\nll digit_sum(string S) { ll res = 0; rep(i, S.size()) { res += toint(S[i]); } return res; }\\n\\n// from segment.cpp\\ntemplate<typename T> struct Accumulate { vector<T> acc; int N; Accumulate() {} Accumulate(int N) : N(N) { acc.resize(N); } Accumulate(const vector<T> &A) { N = A.size(); acc = A; build(); } void set(int i, T a) { acc[i] = a; } void build() { rep(i, N-1) { acc[i+1] += acc[i]; } acc.insert(acc.begin(), 0); } T query(int l, int r) { assert(0 <= l and l <= N and 0 <= r and r <= N); return acc[r]-acc[l]; } T get(int i) { return query(i, i+1); } T operator[](int i){ return query(i, i+1); } ll bisearch_fore(int l, int r, ll x) { if (l > r) return -1; ll l_sm = query(0, l); int ok = r + 1; int ng = l - 1; while (ng+1 < ok) { int mid = (ok+ng) / 2; if (query(0, mid+1) - l_sm >= x) { ok = mid; } else { ng = mid; } } if (ok != r+1) { return ok; } else { return -1; } } ll bisearch_back(int l, int r, ll x) { if (l > r) return -1; ll r_sm = query(0, r+1); int ok = l - 1; int ng = r + 1; while (ok+1 < ng) { int mid = (ok+ng) / 2; if (r_sm - query(0, mid) >= x) { ok = mid; } else { ng = mid; } } if (ok != l-1) { return ok; } else { return -1; } } };\\ntemplate<typename T> struct BIT { int sz; vector<T> tree; BIT(int n) { n++; sz = 1; while (sz < n) { sz *= 2; } tree.resize(sz); } T sum(int i) { T s = 0; i++; while (i > 0) { s += tree[i-1]; i -= i & -i; } return s; } void add(int i, T x) { i++; while (i <= sz) { tree[i-1] += x; i += i & -i; } } T query(int l, int r) { return sum(r-1) - sum(l-1); } T get(int i) { return query(i, i+1); } void update(int i, T x) { add(i, x - get(i)); } T operator[](int i) { return query(i, i+1); } void print(int n) { rep(i, n) { cout << query(i, i+1); if (i == n-1) cout << endl; else cout << ' '; } } ll bisearch_fore(int l, int r, ll x) { if (l > r) return -1; ll l_sm = sum(l-1); int ok = r + 1; int ng = l - 1; while (ng+1 < ok) { int mid = (ok+ng) / 2; if (sum(mid) - l_sm >= x) { ok = mid; } else { ng = mid; } } if (ok != r+1) { return ok; } else { return -1; } } ll bisearch_back(int l, int r, ll x) { if (l > r) return -1; ll r_sm = sum(r); int ok = l - 1; int ng = r + 1; while (ok+1 < ng) { int mid = (ok+ng) / 2; if (r_sm - sum(mid-1) >= x) { ok = mid; } else { ng = mid; } } if (ok != l-1) { return ok; } else { return -1; } } };\\ntemplate<typename Monoid, typename F> struct SegmentTree { int sz; vector<Monoid> seg; const F f; const Monoid M1; SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) { sz = 1; while(sz < n) sz <<= 1; seg.assign(2 * sz, M1); } SegmentTree(const F f, const Monoid &M1) : f(f), M1(M1) {} void resize(int n) { sz = 1; while(sz < n) sz <<= 1; seg.resize(2 * sz, M1); } void clear() { seg.clear(); } void set(int k, const Monoid &x) { seg[k+sz] = x; } void build() { for(int k = sz - 1; k > 0; k--) { seg[k] = f(seg[2*k], seg[2*k+1]); } } void build(const vector<Monoid> &A) { int n = A.size(); resize(n); rep(i, 0, n) set(i, A[i]); build(); } void update(int k, const Monoid &x) { k += sz; seg[k] = x; while(k >>= 1) { seg[k] = f(seg[2*k], seg[2*k+1]); } } Monoid query(int a, int b) { Monoid L = M1, R = M1; for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) { if(a & 1) L = f(L, seg[a++]); if(b & 1) R = f(seg[--b], R); } return f(L, R); } Monoid operator[](const int &k) const { return seg[k+sz]; } Monoid all() { return seg[1]; } void print(int n) { rep(i, n) { cout << query(i, i+1); if (i == n-1) cout << endl; else cout << ' '; } } template<typename C> int find_subtree(int a, const C &check, Monoid &M, bool type) { while(a < sz) { Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]); if(check(nxt)) a = 2 * a + type; else M = nxt, a = 2 * a + 1 - type; } return a - sz; } template<typename C> int find_first(int a, const C &check) { Monoid L = M1; if(a <= 0) { if(check(f(L, seg[1]))) return find_subtree(1, check, L, false); return -1; } int b = sz; for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) { if(a & 1) { Monoid nxt = f(L, seg[a]); if(check(nxt)) return find_subtree(a, check, L, false); L = nxt; ++a; } } return -1; } template<typename C> int find_last(int b, const C &check) { Monoid R = M1; if(b >= sz) { if(check(f(seg[1], R))) return find_subtree(1, check, R, true); return -1; } int a = sz; for(b += sz; a < b; a >>= 1, b >>= 1) { if(b & 1) { Monoid nxt = f(seg[--b], R); if(check(nxt)) return find_subtree(b, check, R, true); R = nxt; } } return -1; } }; template<typename Monoid, typename F> SegmentTree<Monoid, F> get_segment_tree(int N, const F& f, const Monoid& M1) { return {N, f, M1}; } template<typename Monoid, typename F> SegmentTree<Monoid, F> get_segment_tree(const F& f, const Monoid& M1) { return {f, M1}; }\\n\\n// from strings.cpp\\nconst string digits = \\\"0123456789\\\";\\nconst string ascii_lowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string ascii_uppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\\nstring replace(string str, const string& replace, const string& with) { if(!replace.empty()) { size_t pos = 0; while ((pos = str.find(replace, pos)) != string::npos) { str.replace(pos, replace.length(), with); pos += with.length(); } } return str; }\\nstring zfill(string str, int len) { string zeros; int n = str.size(); rep(i, len-n) zeros += '0'; return zeros+str; }\\nstring bin(ll x) { string res; while (x) { if (x & 1) res += '1'; else res += '0'; x >>= 1; } reverse(ALL(res)); if(res == \\\"\\\") res += '0'; return res; }\\n\\n// 遅延評価セグメント木\\ntemplate<typename F, typename G, typename H, typename Monoid, typename OperatorMonoid>\\nstruct LazySegmentTree {\\n int sz, height;\\n vector<Monoid> data;\\n vector<OperatorMonoid> lazy;\\n const F f;\\n const G g;\\n const H h;\\n const Monoid M1;\\n const OperatorMonoid OM0;\\n\\n LazySegmentTree(int n, const F f, const G g, const H h,\\n const Monoid &M1, const OperatorMonoid OM0)\\n : f(f), g(g), h(h), M1(M1), OM0(OM0) {\\n sz = 1;\\n height = 0;\\n while(sz < n) sz <<= 1, height++;\\n data.assign(2 * sz, M1);\\n lazy.assign(2 * sz, OM0);\\n }\\n\\n LazySegmentTree(const F f, const G g, const H h,\\n const Monoid &M1, const OperatorMonoid OM0)\\n : f(f), g(g), h(h), M1(M1), OM0(OM0) {}\\n\\n void set(int k, const Monoid &x) {\\n data[k + sz] = x;\\n }\\n\\n void build() {\\n for(int k = sz - 1; k > 0; k--) {\\n data[k] = f(data[2 * k + 0], data[2 * k + 1]);\\n }\\n }\\n\\n void build(const vector<Monoid> &A) {\\n int n = A.size();\\n sz = 1;\\n height = 0;\\n while(sz < n) sz <<= 1, height++;\\n data.assign(2 * sz, M1);\\n lazy.assign(2 * sz, OM0);\\n rep(i, n) set(i, A[i]);\\n build();\\n }\\n\\n inline void propagate(int k) {\\n if(lazy[k] == OM0) return;\\n lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);\\n lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);\\n data[k] = apply(k);\\n lazy[k] = OM0;\\n }\\n\\n inline Monoid apply(int k) {\\n return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);\\n }\\n\\n inline void recalc(int k) {\\n while(k >>= 1) data[k] = f(apply(2 * k + 0), apply(2 * k + 1));\\n }\\n\\n inline void thrust(int k) {\\n for(int i = height; i > 0; i--) propagate(k >> i);\\n }\\n\\n void update(int a, int b, const OperatorMonoid &x) {\\n if(a >= b) return;\\n thrust(a += sz);\\n thrust(b += sz - 1);\\n for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\\n if(l & 1) lazy[l] = h(lazy[l], x), ++l;\\n if(r & 1) --r, lazy[r] = h(lazy[r], x);\\n }\\n recalc(a);\\n recalc(b);\\n }\\n\\n Monoid query(int a, int b) {\\n if(a >= b) return M1;\\n thrust(a += sz);\\n thrust(b += sz - 1);\\n Monoid L = M1, R = M1;\\n for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\\n if(l & 1) L = f(L, apply(l++));\\n if(r & 1) R = f(apply(--r), R);\\n }\\n return f(L, R);\\n }\\n\\n Monoid operator[](const int &k) {\\n return query(k, k + 1);\\n }\\n\\n void update(int i, const OperatorMonoid &x) {\\n update(i, i+1, x);\\n }\\n\\n template<typename P=ll>\\n void print(int n) {\\n rep(i, n) {\\n cout << (P)query(i, i+1);\\n if (i == n-1) cout << '\\\\n';\\n else cout << ' ';\\n }\\n }\\n\\n template<typename C>\\n int find_subtree(int a, const C &check, Monoid &M, bool type) {\\n while(a < sz) {\\n propagate(a);\\n Monoid nxt = type ? f(apply(2 * a + type), M) : f(M, apply(2 * a + type));\\n if(check(nxt)) a = 2 * a + type;\\n else M = nxt, a = 2 * a + 1 - type;\\n }\\n return a - sz;\\n }\\n\\n // 区間[a,N)でcheckの条件を満たすような最小位置を返す(なければ-1)\\n template<typename C>\\n int find_first(int a, const C &check) {\\n Monoid L = M1;\\n if(a <= 0) {\\n if(check(f(L, apply(1)))) return find_subtree(1, check, L, false);\\n return -1;\\n }\\n thrust(a + sz);\\n int b = sz;\\n for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n if(a & 1) {\\n Monoid nxt = f(L, apply(a));\\n if(check(nxt)) return find_subtree(a, check, L, false);\\n L = nxt;\\n ++a;\\n }\\n }\\n return -1;\\n }\\n\\n // 区間[0,b)でcheckの条件を満たすような最大位置を返す(なければ-1)\\n template<typename C>\\n int find_last(int b, const C &check) {\\n Monoid R = M1;\\n if(b >= sz) {\\n if(check(f(apply(1), R))) return find_subtree(1, check, R, true);\\n return -1;\\n }\\n thrust(b + sz - 1);\\n int a = sz;\\n for(b += sz; a < b; a >>= 1, b >>= 1) {\\n if(b & 1) {\\n Monoid nxt = f(apply(--b), R);\\n if(check(nxt)) return find_subtree(b, check, R, true);\\n R = nxt;\\n }\\n }\\n return -1;\\n }\\n};\\n\\ntemplate<typename F, typename G, typename H, typename T, typename E>\\nLazySegmentTree<F, G, H, T, E> get_lazy_segment_tree(const F& f, const G& g, const H& h, const T& ti, const E& ei) {\\n return {f, g, h, ti, ei};\\n}\\n\\ntemplate<typename F, typename G, typename H, typename T, typename E>\\nLazySegmentTree<F, G, H, T, E> get_lazy_segment_tree(int N, const F& f, const G& g, const H& h, const T& ti, const E& ei) {\\n return {N, f, g, h, ti, ei};\\n}\\n\\n// 区間和取得・区間等差数列加算\\n// 参考：https://opt-cp.com/lazysegtree-practice/\\nstruct Node {\\n ll val, left;\\n operator ll() const { return val; }\\n};\\nstruct Func {\\n ll cnt, sub;\\n bool operator==(const Func &f) const {\\n return cnt == f.cnt and sub == f.sub;\\n }\\n};\\nauto f = [](const Node &a, const Node &b) -> Node { \\n return { a.val+b.val, min(a.left, b.left) };\\n};\\nauto g = [](const Node &a, const Func &b) -> Node {\\n return { a.val+b.cnt*a.left+b.sub, a.left }; \\n};\\nauto h = [](const Func &a, const Func &b) -> Func {\\n return { a.cnt+b.cnt, a.sub+b.sub };\\n};\\nconst Node T = {0, INF};\\nconst Func E = {0, 0};\\n\\nvoid solve() {\\n ll N, Q;\\n cin >> N >> Q;\\n\\n auto seg = get_lazy_segment_tree(N, f, g, h, T, E);\\n const ll a = 1, d = 1;\\n rep(i, N) {\\n // 数列の先頭を初項0とした公差dの等差数列でleftを初期化\\n seg.set(i, {0, i*d});\\n }\\n seg.build();\\n rep(_, Q) {\\n ll l, k;\\n cin >> l >> k;\\n l--;\\n ll r = l+k;\\n // seg.print(N);\\n // 位置lを初項aとした公差dの等差数列を[l,r)に加算\\n seg.update(l, r, {1, a-l*d});\\n }\\n seg.print(N);\\n // print(seg.query(0, 3));\\n // print(seg.query(6, 10));\\n // print(seg.query(5, 7));\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n\\n // single test case\\n solve();\\n\\n // multi test cases\\n // int T;\\n // cin >> T;\\n // while (T--) solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 19572,\n \"score_of_the_acc\": -1.0298,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1981,"cells":{"group_id":{"kind":"string","value":"aoj_3166_cpp"},"problem_description":{"kind":"string","value":"C: Not Found\n問題\n文字\n0\n,\n1\nからなる長さ $n$ の相異なる文字列が $m$ 個与えられるので、以下の条件をすべて満たす文字列 $t$ を構築せよ。\n$t$ は\n0\n,\n1\n,\n*\nのみからなる長さ $n$ の文字列である\n$t$ に含まれる\n0\nと\n1\nの個数の合計は $20$ 以下である\n$t$ 中の文字\n*\nを\n0\nまたは\n1\nにどのように置き換えても、全ての $1 \\leq i \\leq m$ に対して，与えられた $i$ 番目の文字列 $s_i$ と $t$ が一致することはない\n入力形式\n$n$ $m$\n$s_1$\n...\n$s_m$\n制約\n$1 \\leq n$\n$1 \\leq m < 2^n$\n$n \\times m \\leq 2500000$\n$|s_i| = n$ ($1 \\leq i \\leq m$)\n$s_i \\neq s_j$ ($1 \\leq i < j \\leq m$)\n$s_i$ は\n0\n,\n1\nのみからなる ($1 \\leq i \\leq m$)\n出力形式\n条件を満たす文字列を一行に出力せよ。条件を満たすものであれば何を出力しても構わない。条件を満たす文字列が存在しない場合は\nhokudai\nと出力せよ。\n入力例1\n3 2\n101\n000\n出力例1\n*1*\n各\n*\nを\n0\nとみても\n1\nとみても\n101\nや\n000\nに一致することはありません。\n入力例2\n2 3\n11\n10\n00\n出力例2\n01"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3166_10760316","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 2500005\n#define MAX 20\n\nint N,M;\nint POW[MAX+1];\nbool check[SIZE][2],used[1<<20];\nstring line[SIZE];\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i <= MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < 2; k++){\n\t\t\tcheck[i][k] = false;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tcin >> line[i];\n\t\tfor(int k = 0; k < line[i].length(); k++){\n\t\t\tcheck[k][line[i][k]-'0'] = true;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < 2; k++){\n\t\t\tif(!check[i][k]){\n\t\t\t\tfor(int a = 0; a < i; a++){\n\t\t\t\t\tprintf(\"*\");\n\t\t\t\t}\n\t\t\t\tprintf(\"%d\",k);\n\t\t\t\tfor(int a = i+1; a < N; a++){\n\t\t\t\t\tprintf(\"*\");\n\t\t\t\t}\n\t\t\t\tprintf(\"\\n\");\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < POW[min(MAX,N)]; i++){\n\n\t\tused[i] = false;\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tint tmp = 0;\n\t\tfor(int k = 0; k < min(MAX,N); k++){\n\n\t\t\ttmp = 2*tmp+(line[i][k]-'0');\n\t\t}\n\t\tused[tmp] = true;\n\t}\n\n\tfor(int i = 0; i < POW[min(MAX,N)]; i++){\n\t\tif(!used[i]){\n\n\t\t\tint tmp = i;\n\t\t\tfor(int k = min(MAX,N)-1; k >= 0; k--){\n\t\t\t\tif(POW[k] <= tmp){\n\t\t\t\t\ttmp -= POW[k];\n\t\t\t\t\tprintf(\"1\");\n\n\t\t\t\t}else{\n\n\t\t\t\t\tprintf(\"0\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(MAX < N){\n\t\t\t\tint diff = N-MAX;\n\t\t\t\tfor(int a = 0; a < diff; a++){\n\t\t\t\t\tprintf(\"*\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tprintf(\"hokudai\\n\");\n\n\treturn 0;\n}","accuracy":0.036585365853658534,"time_ms":50,"memory_kb":91288,"score_of_the_acc":-1.0851,"final_rank":19},{"submission_id":"aoj_3166_8730834","code_snippet":"#include <bits/stdc++.h>\n//#include<atcoder/modint>\n//using namespace atcoder;\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\nll modPow(long long a, long long n, long long p) {\n if (n == 0) return 1; // 0乗にも対応する場合\n if (n == 1) return a % p;\n if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;\n long long t = modPow(a, n / 2, p);\n return (t * t) % p;\n}\nll cnt = 0;\nll gcd(ll(a), ll(b)) {\n cnt++;\n if (a == 0)return b;\n if (b == 0)return a;\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\nll sqrtz(ll N) {\n ll L = 0;\n ll R = sqrt(N) + 10000;\n while (abs(R - L) > 1) {\n ll mid = (R + L) / 2;\n if (mid * mid <= N)L = mid;\n else R = mid;\n }\n return L;\n}\n\nusing LD = long double;\n\n/*\nusing mint = modint1000000007;\nusing vm = vector<mint>;\nusing vvm = vector<vm>;\nusing vvvm = vector<vvm>;\n\n\nvector<mint> fact, factinv, inv;\nconst ll mod = 1e9+7;\nvoid prenCkModp(ll n) {\n fact.resize(n + 5);\n factinv.resize(n + 5);\n inv.resize(n + 5);\n fact[0] = fact[1] = 1;\n factinv[0] = factinv[1] = 1;\n inv[1] = 1;\n for (ll i = 2; i < n + 5; i++) {\n fact[i] = (fact[i - 1] * i);\n inv[i] = (mod - ((inv[mod % i] * (mod / i))));\n factinv[i] = (factinv[i - 1] * inv[i]);\n }\n}\nmint nCk(ll n, ll k) {\n if (n < k || k < 0) return 0;\n return (fact[n] * ((factinv[k] * factinv[n - k])));\n}\n*/\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N,M;\n cin>>N>>M;\n vector<string> S(M);\n rep(i,M)cin>>S[i];\n vector<bool> L(M,1);\n ll t=N;\n rep(i,min(ll(20),N)){\n vll A(2,0);\n rep(m,M){\n if(!L[m])continue;\n A[S[m][i]-'0']++;\n }\n char p=(A[0]<A[1]?'0':'1');\n cout<<p;\n rep(m,M){\n if(L[m]&&S[m][i]!=p)L[m]=0;\n }\n t--;\n }\n rep(i,t)cout<<\"*\";\n cout<<endl;\n}","accuracy":1,"time_ms":30,"memory_kb":11228,"score_of_the_acc":-0.104,"final_rank":6},{"submission_id":"aoj_3166_7975102","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N, M; cin >> N >> M;\n vector<string> S(M);\n for(int i = 0; i < M; i++) cin >> S[i];\n\n sort(S.begin(), S.end());\n\n string t;\n int L = 0, R = M;\n for(int i = 0; i < 20; i++){\n if(i >= N) break;\n int num0 = 0, num1 = 0;\n int mid = R;\n for(int j = L; j < R; j++){\n if(S[j][i] == '0') num0++;\n else{\n mid = min(mid, j);\n num1++;\n }\n }\n\n if(num0 <= num1){\n t += '0';\n R = mid;\n }\n else{\n t += '1';\n L = mid;\n }\n }\n\n while(t.size() < size_t(N)) t += '*';\n cout << t << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":13612,"score_of_the_acc":-0.1745,"final_rank":8},{"submission_id":"aoj_3166_7009771","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3166.cc: Not Found\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_NM = 2500000;\nconst int MAX_L = 20;\nconst int LBITS = 1 << MAX_L;\n\n/* typedef */\n\n/* global variables */\n\nchar s[MAX_NM + 4];\nbool used[LBITS];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m;\n scanf(\"%d%d\", &n, &m);\n for (int i = 0; i < m; i++) scanf(\"%s\", s + i * n);\n //puts(s);\n\n int l = min(n, MAX_L), lbits = 1 << l;\n\n for (int i = 0; i < m; i++) {\n char *t = s + i * n;\n int bits = 0;\n for (int j = 0; j < l; j++) bits = (bits << 1) | (t[j] - '0');\n used[bits] = true;\n }\n\n for (int bits = 0; bits < lbits; bits++)\n if (! used[bits]) {\n for (int i = 0; i < l; i++)\n\tputchar('0' + ((bits >> (l - 1 - i)) & 1));\n for (int i = l; i < n; i++) putchar('*');\n putchar('\\n');\n break;\n }\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5984,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_3166_6928559","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=9167167167167167167;\nconst int INF=2100000000;\nconst ll mod=998244353;\n#define rep(i,a) for (ll i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\t//cin>>t;\n\trep(i,t) solve();\n}\n\nvoid solve(){\n\tint n,m;\n\tcin>>n>>m;\n\tint x=0;\n\twhile((1<<x)<=m) x++;\n\tassert(x<=20);\n\tvector<bool> p((1<<x));\n\trep(i,m){\n\t\tstring S;\n\t\tcin>>S;\n\t\tint tmp=0;\n\t\trep(j,x){\n\t\t\tif(S[j]=='1') tmp+=(1<<j);\n\t\t}\n\t\tp[tmp]=1;\n\t}\n\trep(i,(1<<x)){\n\t\tif(p[i]) continue;\n\t\tstring ans;\n\t\tint D=i;\n\t\trep(j,x) ans+=(char)(D%2+'0'),D/=2;\n\t\trep(j,n-x) ans+='*';\n\t\tcout<<ans<<\"\\n\";\n\t\treturn;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":10820,"score_of_the_acc":-0.0567,"final_rank":2},{"submission_id":"aoj_3166_5145183","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n int n,m;\n cin >> n >> m;\n vector<string> s(m);\n for(int i=0; i<m; i++){\n cin >> s[i];\n }\n vector<bool> used(m, false);\n string ans = \"\";\n int rem = m;\n for(int i=0; i<n; i++){\n int count[2] = {};\n for(int j=0; j<m; j++){\n if(!used[j]) count[s[j][i]-'0']++;\n }\n char c = (count[0] < count[1])? '0': '1';\n ans += c;\n for(int j=0; j<m; j++){\n if(!used[j] and s[j][i] != c){\n used[j] = true;\n rem--;\n }\n }\n if(rem == 0){\n break;\n }\n }\n if(rem > 0){\n cout << \"hokudai\" << endl;\n }else{\n cout << ans << string(n-(int)ans.length(), '*') << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":11196,"score_of_the_acc":-0.1249,"final_rank":7},{"submission_id":"aoj_3166_5067037","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\nnamespace CharacterClass {\n\tconstexpr string_view\n\t digit = \"0123456789\",\n\t xdigit = \"0123456789ABCDEFabcdef\", lower = \"abcdefghijklmnopqrstuvwxyz\",\n\t upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n\t alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t alnum = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t word = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\",\n\t punct = R\"(!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~)\",\n\t graph =\n\t R\"(!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t print =\n\t R\"( !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t blank = \" \\t\", space = \" \\t\\n\\r\\f\\v\";\n} // namespace CharacterClass\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Output {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid put(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(bool v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(vector<bool>::reference v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid put(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid put(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid put(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void put(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\n\t\tput(v.first);\n\t\tput(D.d);\n\t\tput(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) put(D.d);\n\t\t\tput(*i);\n\t\t}\n\t}\n\ttemplate <class T> void put(const vector<T>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void put(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) put(D.l);\n\t\t\tput(v[i]);\n\t\t}\n\t}\n\n\tOutput() = default;\n\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tOutput& operator()() {\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Output& operator()(H&& h) {\n\t\tput(h);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\n\t\tput(h);\n\t\tput(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tOutput& range(const InputIterator& begin, const InputIterator& end) {\n\t\tput_range(begin, end);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Output& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tOutput& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tOutput& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tOutput& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tOutput& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 7 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T = long long> constexpr T TEN(size_t n) {\n\tT result = 1;\n\tfor (size_t i = 0; i < n; ++i) result *= 10;\n\treturn result;\n}\ntemplate <class T, class U,\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr auto div_ceil(T n, U m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> constexpr T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> constexpr T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T, class U, class V>\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\n\treturn lower <= v && v < upper;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\nconstexpr bool is_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> constexpr T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T> constexpr int BIT(T x, int i) {\n\treturn (x & (1 << i)) ? 1 : 0;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Pow(T a, U n) {\n\tassert(n >= 0);\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Powmod(T a, U n, T mod) {\n\tassert(n >= 0);\n\tif (a > mod) a %= mod;\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 2 \"a.cpp\"\n\nint main() {\n\tini(n, m);\n\tVS s = in[m];\n\n\tint len = min(20, n);\n\tVB flag(1 << len);\n\trep(i, m) {\n\t\tint val = stoi(s[i].substr(0, len), nullptr, 2);\n\t\tflag[val] = true;\n\t}\n\trep(i, 1 << len) {\n\t\tif (!flag[i]) {\n\t\t\tstring ans;\n\t\t\trep(d, len) ans += BIT(i, len - 1 - d) + '0';\n\t\t\tans += string(n - len, '*');\n\t\t\tout.exit(ans);\n\t\t}\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":11484,"score_of_the_acc":-0.0645,"final_rank":3},{"submission_id":"aoj_3166_4982541","code_snippet":"#define MOD_TYPE 2\n\n#pragma region Macros\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#if 0\n#include <boost/multiprecision/cpp_int.hpp>\n#include <boost/multiprecision/cpp_dec_float.hpp>\nusing Int = boost::multiprecision::cpp_int;\nusing lld = boost::multiprecision::cpp_dec_float_100;\n#endif\n#if 0\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#endif\nusing ll = long long int;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pld = pair<ld, ld>;\ntemplate <typename Q_type>\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\n\nconstexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);\nconstexpr int INF = (int)1e9 + 10;\nconstexpr ll LINF = (ll)4e18;\nconstexpr double PI = acos(-1.0);\nconstexpr double EPS = 1e-7;\nconstexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};\nconstexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};\n\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\n#define rep(i, n) REP(i, 0, n)\n#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)\n#define repi(i, n) REPI(i, 0, n)\n#define MP make_pair\n#define MT make_tuple\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << \"\\n\"\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << \"\\n\"\n#define possible(n) cout << ((n) ? \"possible\" : \"impossible\") << \"\\n\"\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << \"\\n\"\n#define all(v) v.begin(), v.end()\n#define NP(v) next_permutation(all(v))\n#define dbg(x) cerr << #x << \":\" << x << \"\\n\";\n\nstruct io_init\n{\n io_init()\n {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << setprecision(30) << setiosflags(ios::fixed);\n };\n} io_init;\ntemplate <typename T>\ninline bool chmin(T &a, T b)\n{\n if (a > b)\n {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\ninline bool chmax(T &a, T b)\n{\n if (a < b)\n {\n a = b;\n return true;\n }\n return false;\n}\ninline ll CEIL(ll a, ll b)\n{\n return (a + b - 1) / b;\n}\ntemplate <typename A, size_t N, typename T>\ninline void Fill(A (&array)[N], const T &val)\n{\n fill((T *)array, (T *)(array + N), val);\n}\ntemplate <typename T, typename U>\nconstexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept\n{\n is >> p.first >> p.second;\n return is;\n}\ntemplate <typename T, typename U>\nconstexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept\n{\n os << p.first << \" \" << p.second;\n return os;\n}\n#pragma endregion\n\nvoid solve()\n{\n int n, m;\n cin >> n >> m;\n assert(m < (1 << 20));\n if (m >= (1 << 20))\n {\n cout << \"hokudai\\n\";\n return;\n }\n vector<string> s(m);\n rep(i, m) cin >> s[i];\n string t;\n vector<int> idx(m);\n iota(all(idx), 0);\n rep(j, min(20, n))\n {\n vector<int> v[2];\n for (auto i : idx)\n {\n v[s[i][j] == '1'].push_back(i);\n }\n if (v[0].size() <= v[1].size())\n {\n t.push_back('0');\n idx = move(v[0]);\n }\n else\n {\n t.push_back('1');\n idx = move(v[1]);\n }\n }\n while (t.length() < n)\n t.push_back('*');\n assert(t.length() == n);\n cout << t << \"\\n\";\n}\n\nint main()\n{\n solve();\n}","accuracy":1,"time_ms":10,"memory_kb":12336,"score_of_the_acc":-0.0745,"final_rank":4},{"submission_id":"aoj_3166_4964091","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint dx[] = {1, 0, -1, 0};\nint dy[] = {0, 1, 0, -1};\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<string> s(m);\n for (int i = 0; i < m; i++) cin >> s[i];\n\n string ans = \"\";\n vector<int> flag(m, true);\n for (int i = 0; i < n; i++) {\n if (i >= 20) {\n ans += \"*\";\n continue;\n }\n int cnt0 = 0;\n int rest = 0;\n for (int j = 0; j < m; j++) {\n if (!flag[j]) continue;\n rest++;\n if (s[j][i] == '0') cnt0++;\n }\n int cnt1 = rest - cnt0;\n if (cnt0 < cnt1)\n ans += \"0\";\n else\n ans += \"1\";\n\n vector<string> news;\n for (int j = 0; j < m; j++) {\n if (!flag[j]) continue;\n if (cnt0 < cnt1 && s[j][i] == '1' || cnt0 >= cnt1 && s[j][i] == '0') {\n flag[j] = false;\n }\n }\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":12200,"score_of_the_acc":-0.2218,"final_rank":9},{"submission_id":"aoj_3166_4964088","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint dx[] = {1, 0, -1, 0};\nint dy[] = {0, 1, 0, -1};\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<string> s(m);\n for(int i=0;i<m;i++) cin>>s[i];\n\n string ans = \"\";\n vector<int> flag(m,true);\n for(int i=0;i<n;i++){\n if(i>=20) {\n ans+=\"*\";\n continue;\n }\n int cnt0 = 0;\n int rest = 0;\n for(int j=0;j<m;j++){\n if(!flag[j]) continue;\n rest++;\n if(s[j][i] == '0') cnt0++;\n }\n int cnt1 = rest - cnt0;\n if(cnt0<cnt1) ans+=\"0\";\n else ans+=\"1\";\n \n vector<string> news;\n for(int j=0;j<m;j++){\n if(!flag[j]) continue;\n if(cnt0<cnt1 && s[j][i]=='0' || cnt0>=cnt1 && s[j][i]=='1') {\n flag[j] = false;\n }\n }\n }\n\n cout<<ans<<endl;\n\n return 0;\n}","accuracy":0.14634146341463414,"time_ms":60,"memory_kb":11456,"score_of_the_acc":-0.1705,"final_rank":17},{"submission_id":"aoj_3166_4964086","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint dx[] = {1, 0, -1, 0};\nint dy[] = {0, 1, 0, -1};\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<string> s(m);\n for(int i=0;i<m;i++) cin>>s[i];\n\n string ans = \"\";\n vector<int> flag(n,true);\n for(int i=0;i<n;i++){\n if(i>=20) {\n ans+=\"*\";\n continue;\n }\n int cnt0 = 0;\n int rest = 0;\n for(int j=0;j<m;j++){\n if(!flag[i]) continue;\n rest++;\n if(s[j][i] == '0') cnt0++;\n }\n int cnt1 = rest - cnt0;\n if(cnt0<cnt1) ans+=\"0\";\n else ans+=\"1\";\n \n vector<string> news;\n for(int j=0;j<m;j++){\n if(!flag[j]) continue;\n if(cnt0<cnt1 && s[j][i]=='0' || cnt0>=cnt1 && s[j][i]=='1') {\n flag[j] = false;\n }\n }\n }\n\n cout<<ans<<endl;\n\n return 0;\n}","accuracy":0.14634146341463414,"time_ms":60,"memory_kb":21056,"score_of_the_acc":-0.2831,"final_rank":18},{"submission_id":"aoj_3166_4944240","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 2500005\n#define MAX 22\n\nint N,M;\nint POW[MAX+1];\nbool check[SIZE][2],used[1<<22];\nstring line[SIZE];\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i <= MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < 2; k++){\n\t\t\tcheck[i][k] = false;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tcin >> line[i];\n\t\tfor(int k = 0; k < line[i].length(); k++){\n\t\t\tcheck[k][line[i][k]-'0'] = true;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < 2; k++){\n\t\t\tif(!check[i][k]){\n\t\t\t\tfor(int a = 0; a < i; a++){\n\t\t\t\t\tprintf(\"*\");\n\t\t\t\t}\n\t\t\t\tprintf(\"%d\",k);\n\t\t\t\tfor(int a = i+1; a < N; a++){\n\t\t\t\t\tprintf(\"*\");\n\t\t\t\t}\n\t\t\t\tprintf(\"\\n\");\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < POW[min(MAX,N)]; i++){\n\n\t\tused[i] = false;\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tint tmp = 0;\n\t\tfor(int k = 0; k < min(MAX,N); k++){\n\n\t\t\ttmp = 2*tmp+(line[i][k]-'0');\n\t\t}\n\t\tused[tmp] = true;\n\t}\n\n\tfor(int i = 0; i < POW[min(MAX,N)]; i++){\n\t\tif(!used[i]){\n\n\t\t\tint tmp = i;\n\t\t\tfor(int k = min(MAX,N)-1; k >= 0; k--){\n\t\t\t\tif(POW[k] <= tmp){\n\t\t\t\t\ttmp -= POW[k];\n\t\t\t\t\tprintf(\"1\");\n\n\t\t\t\t}else{\n\n\t\t\t\t\tprintf(\"0\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(MAX < N){\n\t\t\t\tint diff = N-MAX;\n\t\t\t\tfor(int a = 0; a < diff; a++){\n\t\t\t\t\tprintf(\"*\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tprintf(\"hokudai\\n\");\n\n\treturn 0;\n}","accuracy":0.24390243902439024,"time_ms":60,"memory_kb":31312,"score_of_the_acc":-0.4033,"final_rank":14},{"submission_id":"aoj_3166_4944218","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 2500005\n#define MAX 27\n\nint N,M;\nint POW[MAX+1];\nbool check[SIZE][2],used[1<<27];\nstring line[SIZE];\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i <= MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < 2; k++){\n\t\t\tcheck[i][k] = false;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tcin >> line[i];\n\t\tfor(int k = 0; k < line[i].length(); k++){\n\t\t\tcheck[k][line[i][k]-'0'] = true;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < 2; k++){\n\t\t\tif(!check[i][k]){\n\t\t\t\tfor(int a = 0; a < i; a++){\n\t\t\t\t\tprintf(\"*\");\n\t\t\t\t}\n\t\t\t\tprintf(\"%d\",k);\n\t\t\t\tfor(int a = i+1; a < N; a++){\n\t\t\t\t\tprintf(\"*\");\n\t\t\t\t}\n\t\t\t\tprintf(\"\\n\");\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < POW[N]; i++){\n\n\t\tused[i] = false;\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tint tmp = 0;\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\ttmp = 2*tmp+(line[i][k]-'0');\n\t\t}\n\t\tused[tmp] = true;\n\t}\n\n\tfor(int i = 0; i < POW[N]; i++){\n\t\tif(!used[i]){\n\n\t\t\tint tmp = i;\n\t\t\tfor(int k = N-1; k >= 0; k--){\n\t\t\t\tif(POW[k] <= tmp){\n\t\t\t\t\ttmp -= POW[k];\n\t\t\t\t\tprintf(\"1\");\n\n\t\t\t\t}else{\n\n\t\t\t\t\tprintf(\"0\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tprintf(\"hokudai\\n\");\n\n\treturn 0;\n}","accuracy":0.24390243902439024,"time_ms":60,"memory_kb":57668,"score_of_the_acc":-0.7123,"final_rank":15},{"submission_id":"aoj_3166_4944196","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 2500005\n#define MAX 22\n\nint N,M;\nint POW[MAX+1];\nbool check[SIZE][2],used[1<<22];\nstring line[SIZE];\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i <= MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < 2; k++){\n\t\t\tcheck[i][k] = false;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tcin >> line[i];\n\t\tfor(int k = 0; k < line[i].length(); k++){\n\t\t\tcheck[k][line[i][k]-'0'] = true;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < 2; k++){\n\t\t\tif(!check[i][k]){\n\t\t\t\tfor(int a = 0; a < i; a++){\n\t\t\t\t\tprintf(\"*\");\n\t\t\t\t}\n\t\t\t\tprintf(\"%d\",k);\n\t\t\t\tfor(int a = i+1; a < N; a++){\n\t\t\t\t\tprintf(\"*\");\n\t\t\t\t}\n\t\t\t\tprintf(\"\\n\");\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < POW[N]; i++){\n\n\t\tused[i] = false;\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tint tmp = 0;\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\ttmp = 2*tmp+(line[i][k]-'0');\n\t\t}\n\t\tused[tmp] = true;\n\t}\n\n\tfor(int i = 0; i < POW[N]; i++){\n\t\tif(!used[i]){\n\n\t\t\tint tmp = i;\n\t\t\tfor(int k = N-1; k >= 0; k--){\n\t\t\t\tif(POW[k] <= tmp){\n\t\t\t\t\ttmp -= POW[k];\n\t\t\t\t\tprintf(\"1\");\n\n\t\t\t\t}else{\n\n\t\t\t\t\tprintf(\"0\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tprintf(\"hokudai\\n\");\n\n\treturn 0;\n}","accuracy":0.24390243902439024,"time_ms":60,"memory_kb":31308,"score_of_the_acc":-0.4033,"final_rank":13},{"submission_id":"aoj_3166_4894854","code_snippet":"#ifdef ONLINE_JUDGE\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing pii = pair<int, int>;\nusing pll = pair<long long, long long>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\n#define all(x) (x).begin(),(x).end()\nconstexpr char ln = '\\n';\nistream& operator>>(istream& is, __int128_t &x) {\n x = 0;\n string s;\n is >> s;\n int n = int(s.size()), it = 0;\n if (s[0] == '-') it++;\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\n if (s[0] == '-') x = -x;\n return is;\n}\nostream& operator<<(ostream& os, __int128_t x) {\n if (x == 0) return os << 0;\n if (x < 0) os << '-', x = -x;\n deque<int> deq;\n while (x) deq.emplace_front(x % 10), x /= 10;\n for (int e : deq) os << e;\n return os;\n}\ntemplate<class T1, class T2>\nostream& operator<<(ostream& os, const pair<T1, T2>& p) {\n return os << \"(\" << p.first << \", \" << p.second << \")\";\n}\ntemplate<class T> \nostream& operator<<(ostream& os, const vector<T>& v) {\n os << \"[\";\n for(auto e : v) os << e << \", \";\n return os << \"]\";\n}\ntemplate<class Container> inline int SZ(Container& v) {return int(v.size());}\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\ninline int topbit(int x) {return x == 0 ? -1 : 31 - __builtin_clz(x);}\ninline int topbit(long long x) {return x == 0 ? -1 : 63 - __builtin_clzll(x);}\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\ninline int popcount(int x) {return __builtin_popcount(x);}\ninline int popcount(long long x) {return __builtin_popcountll(x);}\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\ninline constexpr long long TEN(int x) {return x == 0 ? 1 : TEN(x-1) * 10;}\nnamespace detail {\n template<typename Tp, int Nb>\n auto make_vector(vector<int>& sizes, Tp const& x) {\n if constexpr (Nb == 1) {\n return vector(sizes[0], x);\n } else {\n int size = sizes[Nb-1];\n sizes.pop_back();\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\n }\n }\n}\ntemplate<typename Tp, int Nb>\nauto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {\n vector<int> s(Nb);\n for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];\n return detail::make_vector<Tp, Nb>(s, x);\n}\ninline void print() {cout << \"\\n\";}\ntemplate<class T>\ninline void print(const vector<T>& v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \" \";\n print();\n}\ntemplate<class T, class... Args>\ninline void print(const T &x, const Args &... args) {\n cout << x << \" \";\n print(args...);\n}\n#ifdef MINATO_LOCAL\n#define dump(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\ninline void debug() {cerr << endl;}\ntemplate<class T>\ninline void debug(const vector<T> &v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \" \";\n debug();\n}\ntemplate<class T, class... Args>\ninline void debug(const T &x, const Args &... args) {\n cerr << x << \" \";\n debug(args...);\n}\n#else\n#define dump(x) void(0)\ninline void debug() {}\ntemplate<class T> inline void debug(const vector<T> &v) {}\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\n#endif\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\nint main() {\n int N,M; cin >> N >> M;\n vector<string> S(M);\n rep(i,M) cin >> S[i];\n\n int K = min(N,20);\n vector<bool> seen(1<<K);\n rep(i,M) {\n int a = 0;\n rep(j,K) {\n if (S[i][j]=='1') a |= (1<<j);\n }\n seen[a] = 1;\n }\n\n rep(i,1<<K) {\n if (!seen[i]) {\n string ans = \"\";\n rep(bit,K) {\n if (kthbit(i,bit)) ans += '1';\n else ans += '0';\n }\n while (int(ans.size()) < N) ans += '*';\n cout << ans << ln;\n return 0;\n }\n }\n\n cout << \"hokudai\" << ln;\n}","accuracy":1,"time_ms":10,"memory_kb":13764,"score_of_the_acc":-0.0912,"final_rank":5},{"submission_id":"aoj_3166_4894851","code_snippet":"#ifdef ONLINE_JUDGE\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing pii = pair<int, int>;\nusing pll = pair<long long, long long>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\n#define all(x) (x).begin(),(x).end()\nconstexpr char ln = '\\n';\nistream& operator>>(istream& is, __int128_t &x) {\n x = 0;\n string s;\n is >> s;\n int n = int(s.size()), it = 0;\n if (s[0] == '-') it++;\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\n if (s[0] == '-') x = -x;\n return is;\n}\nostream& operator<<(ostream& os, __int128_t x) {\n if (x == 0) return os << 0;\n if (x < 0) os << '-', x = -x;\n deque<int> deq;\n while (x) deq.emplace_front(x % 10), x /= 10;\n for (int e : deq) os << e;\n return os;\n}\ntemplate<class T1, class T2>\nostream& operator<<(ostream& os, const pair<T1, T2>& p) {\n return os << \"(\" << p.first << \", \" << p.second << \")\";\n}\ntemplate<class T> \nostream& operator<<(ostream& os, const vector<T>& v) {\n os << \"[\";\n for(auto e : v) os << e << \", \";\n return os << \"]\";\n}\ntemplate<class Container> inline int SZ(Container& v) {return int(v.size());}\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\ninline int topbit(int x) {return x == 0 ? -1 : 31 - __builtin_clz(x);}\ninline int topbit(long long x) {return x == 0 ? -1 : 63 - __builtin_clzll(x);}\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\ninline int popcount(int x) {return __builtin_popcount(x);}\ninline int popcount(long long x) {return __builtin_popcountll(x);}\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\ninline constexpr long long TEN(int x) {return x == 0 ? 1 : TEN(x-1) * 10;}\nnamespace detail {\n template<typename Tp, int Nb>\n auto make_vector(vector<int>& sizes, Tp const& x) {\n if constexpr (Nb == 1) {\n return vector(sizes[0], x);\n } else {\n int size = sizes[Nb-1];\n sizes.pop_back();\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\n }\n }\n}\ntemplate<typename Tp, int Nb>\nauto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {\n vector<int> s(Nb);\n for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];\n return detail::make_vector<Tp, Nb>(s, x);\n}\ninline void print() {cout << \"\\n\";}\ntemplate<class T>\ninline void print(const vector<T>& v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \" \";\n print();\n}\ntemplate<class T, class... Args>\ninline void print(const T &x, const Args &... args) {\n cout << x << \" \";\n print(args...);\n}\n#ifdef MINATO_LOCAL\n#define dump(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\ninline void debug() {cerr << endl;}\ntemplate<class T>\ninline void debug(const vector<T> &v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \" \";\n debug();\n}\ntemplate<class T, class... Args>\ninline void debug(const T &x, const Args &... args) {\n cerr << x << \" \";\n debug(args...);\n}\n#else\n#define dump(x) void(0)\ninline void debug() {}\ntemplate<class T> inline void debug(const vector<T> &v) {}\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\n#endif\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\nint main() {\n int N,M; cin >> N >> M;\n vector<string> S(M);\n rep(i,N) cin >> S[i];\n\n int K = min(N,20);\n vector<bool> seen(1<<K);\n rep(i,M) {\n int a = 0;\n rep(j,K) {\n if (S[i][j]=='1') a |= (1<<j);\n }\n seen[a] = 1;\n }\n\n rep(i,1<<K) {\n if (!seen[i]) {\n string ans = \"\";\n rep(bit,K) {\n if (kthbit(i,bit)) ans += '1';\n else ans += '0';\n }\n while (int(ans.size()) < N) ans += '*';\n cout << ans << ln;\n return 0;\n }\n }\n\n cout << \"hokudai\" << ln;\n}","accuracy":0.14634146341463414,"time_ms":10,"memory_kb":14344,"score_of_the_acc":-0.098,"final_rank":16},{"submission_id":"aoj_3166_4880263","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M; // 長さ N、M 個\n vector<string> fi(M);\n for (int i = 0; i < M; ++i) cin >> fi[i];\n \n int len = min(20, N);\n set<string> se;\n for (int i = 0; i < M; ++i) se.insert(fi[i].substr(0, len));\n string res = \"\";\n for (int bit = 0; bit < (1<<len); ++bit) {\n string ans = \"\";\n for (int i = 0; i < len; ++i) {\n if (bit & (1<<i)) ans += \"1\";\n else ans += \"0\";\n }\n if (!se.count(ans)) res = ans;\n }\n if (res == \"\") cout << \"hokudai\" << endl;\n else cout << res + string(N - len, '*') << endl;\n}","accuracy":1,"time_ms":480,"memory_kb":22340,"score_of_the_acc":-1.1917,"final_rank":11},{"submission_id":"aoj_3166_4879977","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <limits>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <vector>\n#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))\n#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))\n#define sz(x) int(x.size())\nusing namespace std;\ntemplate <class T>\nvoid setmax(T &a, T const &b) {\n if (a < b) a = b;\n}\n\ntemplate <class T>\nvoid setmin(T &a, T const &b) {\n if (a > b) a = b;\n}\n\ntemplate <typename T, typename X>\nauto vectors(T a, X x) { return vector<T>(x, a); }\n\ntemplate <typename T, typename X, typename Y, typename... Zs>\nauto vectors(T a, X x, Y y, Zs... zs) {\n auto cont = vectors(a, y, zs...);\n return vector<decltype(cont)>(x, cont);\n}\n\n// N >= 20なら、\n// m <= 125000\n// また、0と1のどちらかを20個ならべる通りは2^20 = 1048576通り\n// 2^20 > mになるので、先頭20個のパターンをすべて調べて、\n// 使われていない並びをtの先頭20文字に使って、他は'*'\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector<string> S(M);\n repeat(i, M) cin >> S[i];\n int L = min(20, N);\n vector<bool> used(1 << L);\n for (int i = 0; i < M; ++i) {\n int v = 0;\n for (int j = 0; j < L; ++j) {\n if (S[i][j] == '1') {\n v |= 1 << j;\n }\n }\n used[v] = true;\n }\n int last = -1;\n for (int i = 0; i < (1 << L); ++i) {\n if (used[i]) continue;\n last = i;\n }\n string ans(N, '*');\n for (int i = 0; i < L; ++i) {\n if ((last >> i) & 1) {\n ans[i] = '1';\n } else {\n ans[i] = '0';\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":11860,"score_of_the_acc":-0.2391,"final_rank":10},{"submission_id":"aoj_3166_4879452","code_snippet":"// n <= 20\n// bool used[1<<n]\n// s_i = 1010...01 -> 数字200489\n// used[s_i] = true\n// used[x] = falseになってるやつ出力\n\n// n > 20\n// 文字列tに'*'を含める必要あり\n// 2^n > 2^20 = 1048576\n// m > 2500000/20 = 125000\n// 2^n > m therfore かならず条件満たす出力はだせる？\n// 文字列tの中で\n// '*'をどこにするか\n// '1', '0'をどこにするか\n// m個の文字列{s_i}のj文字目を見て行って、\n// すべて'0' -> tのj文字目を'1'にして、他は'*'\n// '1' -> '0'にして、他は'*'\n\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate<typename T>\nT sz(T& x){return x.size(); }\n\nstring i2bit(int n, int keta) {\n string s = \"\";\n while(n > 0) {\n if(n & 1) s += '1';\n else s += '0';\n n >>= 1;\n }\n while(s.size() < keta) s += '0';\n reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<string> vs(m);\n for(int i = 0; i < m; ++i) {\n cin >> vs[i];\n }\n if(n <= 20) {\n vector<bool> used(1<<n);\n for(string& s : vs) {\n int num = stoi(s, nullptr, 2);\n //cout << num << endl;\n used[num] = true;\n }\n for(int i = 0; i < (1<<n); ++i) {\n if(!used[i]) {\n cout << i2bit(i, n) << endl;\n return 0;\n }\n }\n } else {\n // n > 20\n string t(n, '*');\n for(int i = 0; i < n; ++i){\n int num0 = 0;\n for(int j = 0; j < m; ++j) {\n if(vs[j][i] == '0') ++num0;\n }\n if(num0 == m) {\n t[i] = '1';\n cout << t << endl;\n return 0;\n } else if(num0 == 0) {\n t[i] = '0';\n cout << t << endl;\n return 0;\n }\n }\n cout << \"hokudai\" << endl;\n }\n return 0;\n}","accuracy":0.24390243902439024,"time_ms":40,"memory_kb":7820,"score_of_the_acc":-0.0854,"final_rank":12},{"submission_id":"aoj_3166_4879447","code_snippet":"// n <= 20\n// bool used[1<<n]\n// s_i = 1010...01 -> 数字200489\n// used[s_i] = true\n// used[x] = falseになってるやつ出力\n\n// n > 20\n// 文字列tに'*'を含める必要あり\n// 2^n > 2^20 = 1048576\n// m > 2500000/20 = 125000\n// 2^n > m therfore かならず条件満たす出力はだせる？\n// 文字列tの中で\n// '*'をどこにするか\n// '1', '0'をどこにするか\n// m個の文字列{s_i}のj文字目を見て行って、\n// すべて'0' -> tのj文字目を'1'にして、他は'*'\n// '1' -> '0'にして、他は'*'\n\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate<typename T>\nT sz(T& x){return x.size(); }\n\nstring i2bit(int n, int keta) {\n string s = \"\";\n while(n > 0) {\n if(n & 1) s += '1';\n else s += '0';\n n >>= 1;\n }\n while(s.size() < keta) s += '0';\n reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<string> vs(m);\n for(int i = 0; i < m; ++i) {\n cin >> vs[i];\n }\n if(n <= 20) {\n vector<bool> used(1<<n);\n for(string& s : vs) {\n int num = stoi(s, nullptr, 2);\n //cout << num << endl;\n used[num] = true;\n }\n for(int i = 0; i < (1<<n); ++i) {\n if(!used[i]) {\n cout << i2bit(i, n) << endl;\n return 0;\n }\n }\n } else {\n // n > 20\n string t(n, '*');\n for(int i = 0; i < n; ++i){\n int num0 = 0;\n for(int j = 0; j < m; ++j) {\n if(vs[j][i] == '0') ++num0;\n }\n if(num0 == m) {\n t[i] = '0';\n cout << t << endl;\n return 0;\n } else if(num0 == 0) {\n t[i] = '1';\n cout << t << endl;\n return 0;\n }\n }\n cout << \"hokudai\" << endl;\n }\n return 0;\n}","accuracy":0.024390243902439025,"time_ms":40,"memory_kb":7740,"score_of_the_acc":-0.0844,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_3166_10760316\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 2500005\\n#define MAX 20\\n\\nint N,M;\\nint POW[MAX+1];\\nbool check[SIZE][2],used[1<<20];\\nstring line[SIZE];\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i <= MAX; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < 2; k++){\\n\\t\\t\\tcheck[i][k] = false;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tcin >> line[i];\\n\\t\\tfor(int k = 0; k < line[i].length(); k++){\\n\\t\\t\\tcheck[k][line[i][k]-'0'] = true;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < 2; k++){\\n\\t\\t\\tif(!check[i][k]){\\n\\t\\t\\t\\tfor(int a = 0; a < i; a++){\\n\\t\\t\\t\\t\\tprintf(\\\"*\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"%d\\\",k);\\n\\t\\t\\t\\tfor(int a = i+1; a < N; a++){\\n\\t\\t\\t\\t\\tprintf(\\\"*\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < POW[min(MAX,N)]; i++){\\n\\n\\t\\tused[i] = false;\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tint tmp = 0;\\n\\t\\tfor(int k = 0; k < min(MAX,N); k++){\\n\\n\\t\\t\\ttmp = 2*tmp+(line[i][k]-'0');\\n\\t\\t}\\n\\t\\tused[tmp] = true;\\n\\t}\\n\\n\\tfor(int i = 0; i < POW[min(MAX,N)]; i++){\\n\\t\\tif(!used[i]){\\n\\n\\t\\t\\tint tmp = i;\\n\\t\\t\\tfor(int k = min(MAX,N)-1; k >= 0; k--){\\n\\t\\t\\t\\tif(POW[k] <= tmp){\\n\\t\\t\\t\\t\\ttmp -= POW[k];\\n\\t\\t\\t\\t\\tprintf(\\\"1\\\");\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tprintf(\\\"0\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(MAX < N){\\n\\t\\t\\t\\tint diff = N-MAX;\\n\\t\\t\\t\\tfor(int a = 0; a < diff; a++){\\n\\t\\t\\t\\t\\tprintf(\\\"*\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"hokudai\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.036585365853658534,\n \"time_ms\": 50,\n \"memory_kb\": 91288,\n \"score_of_the_acc\": -1.0851,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3166_8730834\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include<atcoder/modint>\\n//using namespace atcoder;\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\nusing vd = vector<double>;\\nusing vvd = vector<vd>;\\nusing vvvd = vector<vvd>;\\n#define all(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\ntemplate<class T>\\nbool chmax(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\ntemplate<class T>\\nbool chmin(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p > q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\nll modPow(long long a, long long n, long long p) {\\n if (n == 0) return 1; // 0乗にも対応する場合\\n if (n == 1) return a % p;\\n if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;\\n long long t = modPow(a, n / 2, p);\\n return (t * t) % p;\\n}\\nll cnt = 0;\\nll gcd(ll(a), ll(b)) {\\n cnt++;\\n if (a == 0)return b;\\n if (b == 0)return a;\\n ll c = a;\\n while (a % b != 0) {\\n c = a % b;\\n a = b;\\n b = c;\\n }\\n return b;\\n}\\nll sqrtz(ll N) {\\n ll L = 0;\\n ll R = sqrt(N) + 10000;\\n while (abs(R - L) > 1) {\\n ll mid = (R + L) / 2;\\n if (mid * mid <= N)L = mid;\\n else R = mid;\\n }\\n return L;\\n}\\n\\nusing LD = long double;\\n\\n/*\\nusing mint = modint1000000007;\\nusing vm = vector<mint>;\\nusing vvm = vector<vm>;\\nusing vvvm = vector<vvm>;\\n\\n\\nvector<mint> fact, factinv, inv;\\nconst ll mod = 1e9+7;\\nvoid prenCkModp(ll n) {\\n fact.resize(n + 5);\\n factinv.resize(n + 5);\\n inv.resize(n + 5);\\n fact[0] = fact[1] = 1;\\n factinv[0] = factinv[1] = 1;\\n inv[1] = 1;\\n for (ll i = 2; i < n + 5; i++) {\\n fact[i] = (fact[i - 1] * i);\\n inv[i] = (mod - ((inv[mod % i] * (mod / i))));\\n factinv[i] = (factinv[i - 1] * inv[i]);\\n }\\n}\\nmint nCk(ll n, ll k) {\\n if (n < k || k < 0) return 0;\\n return (fact[n] * ((factinv[k] * factinv[n - k])));\\n}\\n*/\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n ll N,M;\\n cin>>N>>M;\\n vector<string> S(M);\\n rep(i,M)cin>>S[i];\\n vector<bool> L(M,1);\\n ll t=N;\\n rep(i,min(ll(20),N)){\\n vll A(2,0);\\n rep(m,M){\\n if(!L[m])continue;\\n A[S[m][i]-'0']++;\\n }\\n char p=(A[0]<A[1]?'0':'1');\\n cout<<p;\\n rep(m,M){\\n if(L[m]&&S[m][i]!=p)L[m]=0;\\n }\\n t--;\\n }\\n rep(i,t)cout<<\\\"*\\\";\\n cout<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 11228,\n \"score_of_the_acc\": -0.104,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3166_7975102\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n int N, M; cin >> N >> M;\\n vector<string> S(M);\\n for(int i = 0; i < M; i++) cin >> S[i];\\n\\n sort(S.begin(), S.end());\\n\\n string t;\\n int L = 0, R = M;\\n for(int i = 0; i < 20; i++){\\n if(i >= N) break;\\n int num0 = 0, num1 = 0;\\n int mid = R;\\n for(int j = L; j < R; j++){\\n if(S[j][i] == '0') num0++;\\n else{\\n mid = min(mid, j);\\n num1++;\\n }\\n }\\n\\n if(num0 <= num1){\\n t += '0';\\n R = mid;\\n }\\n else{\\n t += '1';\\n L = mid;\\n }\\n }\\n\\n while(t.size() < size_t(N)) t += '*';\\n cout << t << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 13612,\n \"score_of_the_acc\": -0.1745,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3166_7009771\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3166.cc: Not Found\\n */\\n\\n#include<cstdio>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_NM = 2500000;\\nconst int MAX_L = 20;\\nconst int LBITS = 1 << MAX_L;\\n\\n/* typedef */\\n\\n/* global variables */\\n\\nchar s[MAX_NM + 4];\\nbool used[LBITS];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, m;\\n scanf(\\\"%d%d\\\", &n, &m);\\n for (int i = 0; i < m; i++) scanf(\\\"%s\\\", s + i * n);\\n //puts(s);\\n\\n int l = min(n, MAX_L), lbits = 1 << l;\\n\\n for (int i = 0; i < m; i++) {\\n char *t = s + i * n;\\n int bits = 0;\\n for (int j = 0; j < l; j++) bits = (bits << 1) | (t[j] - '0');\\n used[bits] = true;\\n }\\n\\n for (int bits = 0; bits < lbits; bits++)\\n if (! used[bits]) {\\n for (int i = 0; i < l; i++)\\n\\tputchar('0' + ((bits >> (l - 1 - i)) & 1));\\n for (int i = l; i < n; i++) putchar('*');\\n putchar('\\\\n');\\n break;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5984,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3166_6928559\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=9167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (ll i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tint t=1;\\n\\t//cin>>t;\\n\\trep(i,t) solve();\\n}\\n\\nvoid solve(){\\n\\tint n,m;\\n\\tcin>>n>>m;\\n\\tint x=0;\\n\\twhile((1<<x)<=m) x++;\\n\\tassert(x<=20);\\n\\tvector<bool> p((1<<x));\\n\\trep(i,m){\\n\\t\\tstring S;\\n\\t\\tcin>>S;\\n\\t\\tint tmp=0;\\n\\t\\trep(j,x){\\n\\t\\t\\tif(S[j]=='1') tmp+=(1<<j);\\n\\t\\t}\\n\\t\\tp[tmp]=1;\\n\\t}\\n\\trep(i,(1<<x)){\\n\\t\\tif(p[i]) continue;\\n\\t\\tstring ans;\\n\\t\\tint D=i;\\n\\t\\trep(j,x) ans+=(char)(D%2+'0'),D/=2;\\n\\t\\trep(j,n-x) ans+='*';\\n\\t\\tcout<<ans<<\\\"\\\\n\\\";\\n\\t\\treturn;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 10820,\n \"score_of_the_acc\": -0.0567,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3166_5145183\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nint main(){\\n int n,m;\\n cin >> n >> m;\\n vector<string> s(m);\\n for(int i=0; i<m; i++){\\n cin >> s[i];\\n }\\n vector<bool> used(m, false);\\n string ans = \\\"\\\";\\n int rem = m;\\n for(int i=0; i<n; i++){\\n int count[2] = {};\\n for(int j=0; j<m; j++){\\n if(!used[j]) count[s[j][i]-'0']++;\\n }\\n char c = (count[0] < count[1])? '0': '1';\\n ans += c;\\n for(int j=0; j<m; j++){\\n if(!used[j] and s[j][i] != c){\\n used[j] = true;\\n rem--;\\n }\\n }\\n if(rem == 0){\\n break;\\n }\\n }\\n if(rem > 0){\\n cout << \\\"hokudai\\\" << endl;\\n }else{\\n cout << ans << string(n-(int)ans.length(), '*') << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 11196,\n \"score_of_the_acc\": -0.1249,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3166_5067037\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\nnamespace CharacterClass {\\n\\tconstexpr string_view\\n\\t digit = \\\"0123456789\\\",\\n\\t xdigit = \\\"0123456789ABCDEFabcdef\\\", lower = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n\\t upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n\\t alpha = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t alnum = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t word = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\\\",\\n\\t punct = R\\\"(!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~)\\\",\\n\\t graph =\\n\\t R\\\"(!\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t print =\\n\\t R\\\"( !\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t blank = \\\" \\\\t\\\", space = \\\" \\\\t\\\\n\\\\r\\\\f\\\\v\\\";\\n} // namespace CharacterClass\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Output {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid put(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(bool v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(vector<bool>::reference v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid put(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid put(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid put(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void put(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\\n\\t\\tput(v.first);\\n\\t\\tput(D.d);\\n\\t\\tput(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) put(D.d);\\n\\t\\t\\tput(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void put(const vector<T>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void put(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) put(D.l);\\n\\t\\t\\tput(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tOutput() = default;\\n\\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tOutput& operator()() {\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Output& operator()(H&& h) {\\n\\t\\tput(h);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\\n\\t\\tput(h);\\n\\t\\tput(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tOutput& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tput_range(begin, end);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Output& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tOutput& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 7 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T = long long> constexpr T TEN(size_t n) {\\n\\tT result = 1;\\n\\tfor (size_t i = 0; i < n; ++i) result *= 10;\\n\\treturn result;\\n}\\ntemplate <class T, class U,\\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr auto div_ceil(T n, U m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> constexpr T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> constexpr T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T, class U, class V>\\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\\n\\treturn lower <= v && v < upper;\\n}\\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\\nconstexpr bool is_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> constexpr T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T> constexpr int BIT(T x, int i) {\\n\\treturn (x & (1 << i)) ? 1 : 0;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Pow(T a, U n) {\\n\\tassert(n >= 0);\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Powmod(T a, U n, T mod) {\\n\\tassert(n >= 0);\\n\\tif (a > mod) a %= mod;\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 2 \\\"a.cpp\\\"\\n\\nint main() {\\n\\tini(n, m);\\n\\tVS s = in[m];\\n\\n\\tint len = min(20, n);\\n\\tVB flag(1 << len);\\n\\trep(i, m) {\\n\\t\\tint val = stoi(s[i].substr(0, len), nullptr, 2);\\n\\t\\tflag[val] = true;\\n\\t}\\n\\trep(i, 1 << len) {\\n\\t\\tif (!flag[i]) {\\n\\t\\t\\tstring ans;\\n\\t\\t\\trep(d, len) ans += BIT(i, len - 1 - d) + '0';\\n\\t\\t\\tans += string(n - len, '*');\\n\\t\\t\\tout.exit(ans);\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 11484,\n \"score_of_the_acc\": -0.0645,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3166_4982541\",\n \"code_snippet\": \"#define MOD_TYPE 2\\n\\n#pragma region Macros\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#if 0\\n#include <boost/multiprecision/cpp_int.hpp>\\n#include <boost/multiprecision/cpp_dec_float.hpp>\\nusing Int = boost::multiprecision::cpp_int;\\nusing lld = boost::multiprecision::cpp_dec_float_100;\\n#endif\\n#if 0\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\nusing ll = long long int;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pld = pair<ld, ld>;\\ntemplate <typename Q_type>\\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\\n\\nconstexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);\\nconstexpr int INF = (int)1e9 + 10;\\nconstexpr ll LINF = (ll)4e18;\\nconstexpr double PI = acos(-1.0);\\nconstexpr double EPS = 1e-7;\\nconstexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};\\nconstexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};\\n\\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\\n#define rep(i, n) REP(i, 0, n)\\n#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)\\n#define repi(i, n) REPI(i, 0, n)\\n#define MP make_pair\\n#define MT make_tuple\\n#define YES(n) cout << ((n) ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"\\n#define Yes(n) cout << ((n) ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"\\n#define possible(n) cout << ((n) ? \\\"possible\\\" : \\\"impossible\\\") << \\\"\\\\n\\\"\\n#define Possible(n) cout << ((n) ? \\\"Possible\\\" : \\\"Impossible\\\") << \\\"\\\\n\\\"\\n#define all(v) v.begin(), v.end()\\n#define NP(v) next_permutation(all(v))\\n#define dbg(x) cerr << #x << \\\":\\\" << x << \\\"\\\\n\\\";\\n\\nstruct io_init\\n{\\n io_init()\\n {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << setprecision(30) << setiosflags(ios::fixed);\\n };\\n} io_init;\\ntemplate <typename T>\\ninline bool chmin(T &a, T b)\\n{\\n if (a > b)\\n {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\ninline bool chmax(T &a, T b)\\n{\\n if (a < b)\\n {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ninline ll CEIL(ll a, ll b)\\n{\\n return (a + b - 1) / b;\\n}\\ntemplate <typename A, size_t N, typename T>\\ninline void Fill(A (&array)[N], const T &val)\\n{\\n fill((T *)array, (T *)(array + N), val);\\n}\\ntemplate <typename T, typename U>\\nconstexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept\\n{\\n is >> p.first >> p.second;\\n return is;\\n}\\ntemplate <typename T, typename U>\\nconstexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept\\n{\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n#pragma endregion\\n\\nvoid solve()\\n{\\n int n, m;\\n cin >> n >> m;\\n assert(m < (1 << 20));\\n if (m >= (1 << 20))\\n {\\n cout << \\\"hokudai\\\\n\\\";\\n return;\\n }\\n vector<string> s(m);\\n rep(i, m) cin >> s[i];\\n string t;\\n vector<int> idx(m);\\n iota(all(idx), 0);\\n rep(j, min(20, n))\\n {\\n vector<int> v[2];\\n for (auto i : idx)\\n {\\n v[s[i][j] == '1'].push_back(i);\\n }\\n if (v[0].size() <= v[1].size())\\n {\\n t.push_back('0');\\n idx = move(v[0]);\\n }\\n else\\n {\\n t.push_back('1');\\n idx = move(v[1]);\\n }\\n }\\n while (t.length() < n)\\n t.push_back('*');\\n assert(t.length() == n);\\n cout << t << \\\"\\\\n\\\";\\n}\\n\\nint main()\\n{\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 12336,\n \"score_of_the_acc\": -0.0745,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3166_4964091\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint dx[] = {1, 0, -1, 0};\\nint dy[] = {0, 1, 0, -1};\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n vector<string> s(m);\\n for (int i = 0; i < m; i++) cin >> s[i];\\n\\n string ans = \\\"\\\";\\n vector<int> flag(m, true);\\n for (int i = 0; i < n; i++) {\\n if (i >= 20) {\\n ans += \\\"*\\\";\\n continue;\\n }\\n int cnt0 = 0;\\n int rest = 0;\\n for (int j = 0; j < m; j++) {\\n if (!flag[j]) continue;\\n rest++;\\n if (s[j][i] == '0') cnt0++;\\n }\\n int cnt1 = rest - cnt0;\\n if (cnt0 < cnt1)\\n ans += \\\"0\\\";\\n else\\n ans += \\\"1\\\";\\n\\n vector<string> news;\\n for (int j = 0; j < m; j++) {\\n if (!flag[j]) continue;\\n if (cnt0 < cnt1 && s[j][i] == '1' || cnt0 >= cnt1 && s[j][i] == '0') {\\n flag[j] = false;\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 12200,\n \"score_of_the_acc\": -0.2218,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3166_4964088\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint dx[] = {1, 0, -1, 0};\\nint dy[] = {0, 1, 0, -1};\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n vector<string> s(m);\\n for(int i=0;i<m;i++) cin>>s[i];\\n\\n string ans = \\\"\\\";\\n vector<int> flag(m,true);\\n for(int i=0;i<n;i++){\\n if(i>=20) {\\n ans+=\\\"*\\\";\\n continue;\\n }\\n int cnt0 = 0;\\n int rest = 0;\\n for(int j=0;j<m;j++){\\n if(!flag[j]) continue;\\n rest++;\\n if(s[j][i] == '0') cnt0++;\\n }\\n int cnt1 = rest - cnt0;\\n if(cnt0<cnt1) ans+=\\\"0\\\";\\n else ans+=\\\"1\\\";\\n \\n vector<string> news;\\n for(int j=0;j<m;j++){\\n if(!flag[j]) continue;\\n if(cnt0<cnt1 && s[j][i]=='0' || cnt0>=cnt1 && s[j][i]=='1') {\\n flag[j] = false;\\n }\\n }\\n }\\n\\n cout<<ans<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.14634146341463414,\n \"time_ms\": 60,\n \"memory_kb\": 11456,\n \"score_of_the_acc\": -0.1705,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3166_4964086\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint dx[] = {1, 0, -1, 0};\\nint dy[] = {0, 1, 0, -1};\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n vector<string> s(m);\\n for(int i=0;i<m;i++) cin>>s[i];\\n\\n string ans = \\\"\\\";\\n vector<int> flag(n,true);\\n for(int i=0;i<n;i++){\\n if(i>=20) {\\n ans+=\\\"*\\\";\\n continue;\\n }\\n int cnt0 = 0;\\n int rest = 0;\\n for(int j=0;j<m;j++){\\n if(!flag[i]) continue;\\n rest++;\\n if(s[j][i] == '0') cnt0++;\\n }\\n int cnt1 = rest - cnt0;\\n if(cnt0<cnt1) ans+=\\\"0\\\";\\n else ans+=\\\"1\\\";\\n \\n vector<string> news;\\n for(int j=0;j<m;j++){\\n if(!flag[j]) continue;\\n if(cnt0<cnt1 && s[j][i]=='0' || cnt0>=cnt1 && s[j][i]=='1') {\\n flag[j] = false;\\n }\\n }\\n }\\n\\n cout<<ans<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.14634146341463414,\n \"time_ms\": 60,\n \"memory_kb\": 21056,\n \"score_of_the_acc\": -0.2831,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3166_4944240\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 2500005\\n#define MAX 22\\n\\nint N,M;\\nint POW[MAX+1];\\nbool check[SIZE][2],used[1<<22];\\nstring line[SIZE];\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i <= MAX; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < 2; k++){\\n\\t\\t\\tcheck[i][k] = false;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tcin >> line[i];\\n\\t\\tfor(int k = 0; k < line[i].length(); k++){\\n\\t\\t\\tcheck[k][line[i][k]-'0'] = true;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < 2; k++){\\n\\t\\t\\tif(!check[i][k]){\\n\\t\\t\\t\\tfor(int a = 0; a < i; a++){\\n\\t\\t\\t\\t\\tprintf(\\\"*\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"%d\\\",k);\\n\\t\\t\\t\\tfor(int a = i+1; a < N; a++){\\n\\t\\t\\t\\t\\tprintf(\\\"*\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < POW[min(MAX,N)]; i++){\\n\\n\\t\\tused[i] = false;\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tint tmp = 0;\\n\\t\\tfor(int k = 0; k < min(MAX,N); k++){\\n\\n\\t\\t\\ttmp = 2*tmp+(line[i][k]-'0');\\n\\t\\t}\\n\\t\\tused[tmp] = true;\\n\\t}\\n\\n\\tfor(int i = 0; i < POW[min(MAX,N)]; i++){\\n\\t\\tif(!used[i]){\\n\\n\\t\\t\\tint tmp = i;\\n\\t\\t\\tfor(int k = min(MAX,N)-1; k >= 0; k--){\\n\\t\\t\\t\\tif(POW[k] <= tmp){\\n\\t\\t\\t\\t\\ttmp -= POW[k];\\n\\t\\t\\t\\t\\tprintf(\\\"1\\\");\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tprintf(\\\"0\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(MAX < N){\\n\\t\\t\\t\\tint diff = N-MAX;\\n\\t\\t\\t\\tfor(int a = 0; a < diff; a++){\\n\\t\\t\\t\\t\\tprintf(\\\"*\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"hokudai\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.24390243902439024,\n \"time_ms\": 60,\n \"memory_kb\": 31312,\n \"score_of_the_acc\": -0.4033,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3166_4944218\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 2500005\\n#define MAX 27\\n\\nint N,M;\\nint POW[MAX+1];\\nbool check[SIZE][2],used[1<<27];\\nstring line[SIZE];\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i <= MAX; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < 2; k++){\\n\\t\\t\\tcheck[i][k] = false;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tcin >> line[i];\\n\\t\\tfor(int k = 0; k < line[i].length(); k++){\\n\\t\\t\\tcheck[k][line[i][k]-'0'] = true;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < 2; k++){\\n\\t\\t\\tif(!check[i][k]){\\n\\t\\t\\t\\tfor(int a = 0; a < i; a++){\\n\\t\\t\\t\\t\\tprintf(\\\"*\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"%d\\\",k);\\n\\t\\t\\t\\tfor(int a = i+1; a < N; a++){\\n\\t\\t\\t\\t\\tprintf(\\\"*\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < POW[N]; i++){\\n\\n\\t\\tused[i] = false;\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tint tmp = 0;\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\ttmp = 2*tmp+(line[i][k]-'0');\\n\\t\\t}\\n\\t\\tused[tmp] = true;\\n\\t}\\n\\n\\tfor(int i = 0; i < POW[N]; i++){\\n\\t\\tif(!used[i]){\\n\\n\\t\\t\\tint tmp = i;\\n\\t\\t\\tfor(int k = N-1; k >= 0; k--){\\n\\t\\t\\t\\tif(POW[k] <= tmp){\\n\\t\\t\\t\\t\\ttmp -= POW[k];\\n\\t\\t\\t\\t\\tprintf(\\\"1\\\");\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tprintf(\\\"0\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"hokudai\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.24390243902439024,\n \"time_ms\": 60,\n \"memory_kb\": 57668,\n \"score_of_the_acc\": -0.7123,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3166_4944196\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 2500005\\n#define MAX 22\\n\\nint N,M;\\nint POW[MAX+1];\\nbool check[SIZE][2],used[1<<22];\\nstring line[SIZE];\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i <= MAX; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < 2; k++){\\n\\t\\t\\tcheck[i][k] = false;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tcin >> line[i];\\n\\t\\tfor(int k = 0; k < line[i].length(); k++){\\n\\t\\t\\tcheck[k][line[i][k]-'0'] = true;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < 2; k++){\\n\\t\\t\\tif(!check[i][k]){\\n\\t\\t\\t\\tfor(int a = 0; a < i; a++){\\n\\t\\t\\t\\t\\tprintf(\\\"*\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"%d\\\",k);\\n\\t\\t\\t\\tfor(int a = i+1; a < N; a++){\\n\\t\\t\\t\\t\\tprintf(\\\"*\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < POW[N]; i++){\\n\\n\\t\\tused[i] = false;\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tint tmp = 0;\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\ttmp = 2*tmp+(line[i][k]-'0');\\n\\t\\t}\\n\\t\\tused[tmp] = true;\\n\\t}\\n\\n\\tfor(int i = 0; i < POW[N]; i++){\\n\\t\\tif(!used[i]){\\n\\n\\t\\t\\tint tmp = i;\\n\\t\\t\\tfor(int k = N-1; k >= 0; k--){\\n\\t\\t\\t\\tif(POW[k] <= tmp){\\n\\t\\t\\t\\t\\ttmp -= POW[k];\\n\\t\\t\\t\\t\\tprintf(\\\"1\\\");\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tprintf(\\\"0\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"hokudai\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.24390243902439024,\n \"time_ms\": 60,\n \"memory_kb\": 31308,\n \"score_of_the_acc\": -0.4033,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3166_4894854\",\n \"code_snippet\": \"#ifdef ONLINE_JUDGE\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<long long, long long>;\\n#define rep(i, n) for(int i = 0; i < (n); ++i)\\n#define all(x) (x).begin(),(x).end()\\nconstexpr char ln = '\\\\n';\\nistream& operator>>(istream& is, __int128_t &x) {\\n x = 0;\\n string s;\\n is >> s;\\n int n = int(s.size()), it = 0;\\n if (s[0] == '-') it++;\\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\\n if (s[0] == '-') x = -x;\\n return is;\\n}\\nostream& operator<<(ostream& os, __int128_t x) {\\n if (x == 0) return os << 0;\\n if (x < 0) os << '-', x = -x;\\n deque<int> deq;\\n while (x) deq.emplace_front(x % 10), x /= 10;\\n for (int e : deq) os << e;\\n return os;\\n}\\ntemplate<class T1, class T2>\\nostream& operator<<(ostream& os, const pair<T1, T2>& p) {\\n return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n}\\ntemplate<class T> \\nostream& operator<<(ostream& os, const vector<T>& v) {\\n os << \\\"[\\\";\\n for(auto e : v) os << e << \\\", \\\";\\n return os << \\\"]\\\";\\n}\\ntemplate<class Container> inline int SZ(Container& v) {return int(v.size());}\\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\\ninline int topbit(int x) {return x == 0 ? -1 : 31 - __builtin_clz(x);}\\ninline int topbit(long long x) {return x == 0 ? -1 : 63 - __builtin_clzll(x);}\\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\\ninline int popcount(int x) {return __builtin_popcount(x);}\\ninline int popcount(long long x) {return __builtin_popcountll(x);}\\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\\ninline constexpr long long TEN(int x) {return x == 0 ? 1 : TEN(x-1) * 10;}\\nnamespace detail {\\n template<typename Tp, int Nb>\\n auto make_vector(vector<int>& sizes, Tp const& x) {\\n if constexpr (Nb == 1) {\\n return vector(sizes[0], x);\\n } else {\\n int size = sizes[Nb-1];\\n sizes.pop_back();\\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\\n }\\n }\\n}\\ntemplate<typename Tp, int Nb>\\nauto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {\\n vector<int> s(Nb);\\n for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];\\n return detail::make_vector<Tp, Nb>(s, x);\\n}\\ninline void print() {cout << \\\"\\\\n\\\";}\\ntemplate<class T>\\ninline void print(const vector<T>& v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \\\" \\\";\\n print();\\n}\\ntemplate<class T, class... Args>\\ninline void print(const T &x, const Args &... args) {\\n cout << x << \\\" \\\";\\n print(args...);\\n}\\n#ifdef MINATO_LOCAL\\n#define dump(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\ninline void debug() {cerr << endl;}\\ntemplate<class T>\\ninline void debug(const vector<T> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \\\" \\\";\\n debug();\\n}\\ntemplate<class T, class... Args>\\ninline void debug(const T &x, const Args &... args) {\\n cerr << x << \\\" \\\";\\n debug(args...);\\n}\\n#else\\n#define dump(x) void(0)\\ninline void debug() {}\\ntemplate<class T> inline void debug(const vector<T> &v) {}\\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\\n#endif\\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\nint main() {\\n int N,M; cin >> N >> M;\\n vector<string> S(M);\\n rep(i,M) cin >> S[i];\\n\\n int K = min(N,20);\\n vector<bool> seen(1<<K);\\n rep(i,M) {\\n int a = 0;\\n rep(j,K) {\\n if (S[i][j]=='1') a |= (1<<j);\\n }\\n seen[a] = 1;\\n }\\n\\n rep(i,1<<K) {\\n if (!seen[i]) {\\n string ans = \\\"\\\";\\n rep(bit,K) {\\n if (kthbit(i,bit)) ans += '1';\\n else ans += '0';\\n }\\n while (int(ans.size()) < N) ans += '*';\\n cout << ans << ln;\\n return 0;\\n }\\n }\\n\\n cout << \\\"hokudai\\\" << ln;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 13764,\n \"score_of_the_acc\": -0.0912,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3166_4894851\",\n \"code_snippet\": \"#ifdef ONLINE_JUDGE\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<long long, long long>;\\n#define rep(i, n) for(int i = 0; i < (n); ++i)\\n#define all(x) (x).begin(),(x).end()\\nconstexpr char ln = '\\\\n';\\nistream& operator>>(istream& is, __int128_t &x) {\\n x = 0;\\n string s;\\n is >> s;\\n int n = int(s.size()), it = 0;\\n if (s[0] == '-') it++;\\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\\n if (s[0] == '-') x = -x;\\n return is;\\n}\\nostream& operator<<(ostream& os, __int128_t x) {\\n if (x == 0) return os << 0;\\n if (x < 0) os << '-', x = -x;\\n deque<int> deq;\\n while (x) deq.emplace_front(x % 10), x /= 10;\\n for (int e : deq) os << e;\\n return os;\\n}\\ntemplate<class T1, class T2>\\nostream& operator<<(ostream& os, const pair<T1, T2>& p) {\\n return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n}\\ntemplate<class T> \\nostream& operator<<(ostream& os, const vector<T>& v) {\\n os << \\\"[\\\";\\n for(auto e : v) os << e << \\\", \\\";\\n return os << \\\"]\\\";\\n}\\ntemplate<class Container> inline int SZ(Container& v) {return int(v.size());}\\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\\ninline int topbit(int x) {return x == 0 ? -1 : 31 - __builtin_clz(x);}\\ninline int topbit(long long x) {return x == 0 ? -1 : 63 - __builtin_clzll(x);}\\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\\ninline int popcount(int x) {return __builtin_popcount(x);}\\ninline int popcount(long long x) {return __builtin_popcountll(x);}\\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\\ninline constexpr long long TEN(int x) {return x == 0 ? 1 : TEN(x-1) * 10;}\\nnamespace detail {\\n template<typename Tp, int Nb>\\n auto make_vector(vector<int>& sizes, Tp const& x) {\\n if constexpr (Nb == 1) {\\n return vector(sizes[0], x);\\n } else {\\n int size = sizes[Nb-1];\\n sizes.pop_back();\\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\\n }\\n }\\n}\\ntemplate<typename Tp, int Nb>\\nauto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {\\n vector<int> s(Nb);\\n for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];\\n return detail::make_vector<Tp, Nb>(s, x);\\n}\\ninline void print() {cout << \\\"\\\\n\\\";}\\ntemplate<class T>\\ninline void print(const vector<T>& v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \\\" \\\";\\n print();\\n}\\ntemplate<class T, class... Args>\\ninline void print(const T &x, const Args &... args) {\\n cout << x << \\\" \\\";\\n print(args...);\\n}\\n#ifdef MINATO_LOCAL\\n#define dump(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\ninline void debug() {cerr << endl;}\\ntemplate<class T>\\ninline void debug(const vector<T> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \\\" \\\";\\n debug();\\n}\\ntemplate<class T, class... Args>\\ninline void debug(const T &x, const Args &... args) {\\n cerr << x << \\\" \\\";\\n debug(args...);\\n}\\n#else\\n#define dump(x) void(0)\\ninline void debug() {}\\ntemplate<class T> inline void debug(const vector<T> &v) {}\\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\\n#endif\\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\nint main() {\\n int N,M; cin >> N >> M;\\n vector<string> S(M);\\n rep(i,N) cin >> S[i];\\n\\n int K = min(N,20);\\n vector<bool> seen(1<<K);\\n rep(i,M) {\\n int a = 0;\\n rep(j,K) {\\n if (S[i][j]=='1') a |= (1<<j);\\n }\\n seen[a] = 1;\\n }\\n\\n rep(i,1<<K) {\\n if (!seen[i]) {\\n string ans = \\\"\\\";\\n rep(bit,K) {\\n if (kthbit(i,bit)) ans += '1';\\n else ans += '0';\\n }\\n while (int(ans.size()) < N) ans += '*';\\n cout << ans << ln;\\n return 0;\\n }\\n }\\n\\n cout << \\\"hokudai\\\" << ln;\\n}\",\n \"accuracy\": 0.14634146341463414,\n \"time_ms\": 10,\n \"memory_kb\": 14344,\n \"score_of_the_acc\": -0.098,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3166_4880263\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int N, M;\\n cin >> N >> M; // 長さ N、M 個\\n vector<string> fi(M);\\n for (int i = 0; i < M; ++i) cin >> fi[i];\\n \\n int len = min(20, N);\\n set<string> se;\\n for (int i = 0; i < M; ++i) se.insert(fi[i].substr(0, len));\\n string res = \\\"\\\";\\n for (int bit = 0; bit < (1<<len); ++bit) {\\n string ans = \\\"\\\";\\n for (int i = 0; i < len; ++i) {\\n if (bit & (1<<i)) ans += \\\"1\\\";\\n else ans += \\\"0\\\";\\n }\\n if (!se.count(ans)) res = ans;\\n }\\n if (res == \\\"\\\") cout << \\\"hokudai\\\" << endl;\\n else cout << res + string(N - len, '*') << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 22340,\n \"score_of_the_acc\": -1.1917,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3166_4879977\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cmath>\\n#include <cstring>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <limits>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <vector>\\n#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))\\n#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))\\n#define sz(x) int(x.size())\\nusing namespace std;\\ntemplate <class T>\\nvoid setmax(T &a, T const &b) {\\n if (a < b) a = b;\\n}\\n\\ntemplate <class T>\\nvoid setmin(T &a, T const &b) {\\n if (a > b) a = b;\\n}\\n\\ntemplate <typename T, typename X>\\nauto vectors(T a, X x) { return vector<T>(x, a); }\\n\\ntemplate <typename T, typename X, typename Y, typename... Zs>\\nauto vectors(T a, X x, Y y, Zs... zs) {\\n auto cont = vectors(a, y, zs...);\\n return vector<decltype(cont)>(x, cont);\\n}\\n\\n// N >= 20なら、\\n// m <= 125000\\n// また、0と1のどちらかを20個ならべる通りは2^20 = 1048576通り\\n// 2^20 > mになるので、先頭20個のパターンをすべて調べて、\\n// 使われていない並びをtの先頭20文字に使って、他は'*'\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n vector<string> S(M);\\n repeat(i, M) cin >> S[i];\\n int L = min(20, N);\\n vector<bool> used(1 << L);\\n for (int i = 0; i < M; ++i) {\\n int v = 0;\\n for (int j = 0; j < L; ++j) {\\n if (S[i][j] == '1') {\\n v |= 1 << j;\\n }\\n }\\n used[v] = true;\\n }\\n int last = -1;\\n for (int i = 0; i < (1 << L); ++i) {\\n if (used[i]) continue;\\n last = i;\\n }\\n string ans(N, '*');\\n for (int i = 0; i < L; ++i) {\\n if ((last >> i) & 1) {\\n ans[i] = '1';\\n } else {\\n ans[i] = '0';\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 11860,\n \"score_of_the_acc\": -0.2391,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3166_4879452\",\n \"code_snippet\": \"// n <= 20\\n// bool used[1<<n]\\n// s_i = 1010...01 -> 数字200489\\n// used[s_i] = true\\n// used[x] = falseになってるやつ出力\\n\\n// n > 20\\n// 文字列tに'*'を含める必要あり\\n// 2^n > 2^20 = 1048576\\n// m > 2500000/20 = 125000\\n// 2^n > m therfore かならず条件満たす出力はだせる？\\n// 文字列tの中で\\n// '*'をどこにするか\\n// '1', '0'をどこにするか\\n// m個の文字列{s_i}のj文字目を見て行って、\\n// すべて'0' -> tのj文字目を'1'にして、他は'*'\\n// '1' -> '0'にして、他は'*'\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<typename T>\\nT sz(T& x){return x.size(); }\\n\\nstring i2bit(int n, int keta) {\\n string s = \\\"\\\";\\n while(n > 0) {\\n if(n & 1) s += '1';\\n else s += '0';\\n n >>= 1;\\n }\\n while(s.size() < keta) s += '0';\\n reverse(s.begin(), s.end());\\n return s;\\n}\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n vector<string> vs(m);\\n for(int i = 0; i < m; ++i) {\\n cin >> vs[i];\\n }\\n if(n <= 20) {\\n vector<bool> used(1<<n);\\n for(string& s : vs) {\\n int num = stoi(s, nullptr, 2);\\n //cout << num << endl;\\n used[num] = true;\\n }\\n for(int i = 0; i < (1<<n); ++i) {\\n if(!used[i]) {\\n cout << i2bit(i, n) << endl;\\n return 0;\\n }\\n }\\n } else {\\n // n > 20\\n string t(n, '*');\\n for(int i = 0; i < n; ++i){\\n int num0 = 0;\\n for(int j = 0; j < m; ++j) {\\n if(vs[j][i] == '0') ++num0;\\n }\\n if(num0 == m) {\\n t[i] = '1';\\n cout << t << endl;\\n return 0;\\n } else if(num0 == 0) {\\n t[i] = '0';\\n cout << t << endl;\\n return 0;\\n }\\n }\\n cout << \\\"hokudai\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.24390243902439024,\n \"time_ms\": 40,\n \"memory_kb\": 7820,\n \"score_of_the_acc\": -0.0854,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3166_4879447\",\n \"code_snippet\": \"// n <= 20\\n// bool used[1<<n]\\n// s_i = 1010...01 -> 数字200489\\n// used[s_i] = true\\n// used[x] = falseになってるやつ出力\\n\\n// n > 20\\n// 文字列tに'*'を含める必要あり\\n// 2^n > 2^20 = 1048576\\n// m > 2500000/20 = 125000\\n// 2^n > m therfore かならず条件満たす出力はだせる？\\n// 文字列tの中で\\n// '*'をどこにするか\\n// '1', '0'をどこにするか\\n// m個の文字列{s_i}のj文字目を見て行って、\\n// すべて'0' -> tのj文字目を'1'にして、他は'*'\\n// '1' -> '0'にして、他は'*'\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<typename T>\\nT sz(T& x){return x.size(); }\\n\\nstring i2bit(int n, int keta) {\\n string s = \\\"\\\";\\n while(n > 0) {\\n if(n & 1) s += '1';\\n else s += '0';\\n n >>= 1;\\n }\\n while(s.size() < keta) s += '0';\\n reverse(s.begin(), s.end());\\n return s;\\n}\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n vector<string> vs(m);\\n for(int i = 0; i < m; ++i) {\\n cin >> vs[i];\\n }\\n if(n <= 20) {\\n vector<bool> used(1<<n);\\n for(string& s : vs) {\\n int num = stoi(s, nullptr, 2);\\n //cout << num << endl;\\n used[num] = true;\\n }\\n for(int i = 0; i < (1<<n); ++i) {\\n if(!used[i]) {\\n cout << i2bit(i, n) << endl;\\n return 0;\\n }\\n }\\n } else {\\n // n > 20\\n string t(n, '*');\\n for(int i = 0; i < n; ++i){\\n int num0 = 0;\\n for(int j = 0; j < m; ++j) {\\n if(vs[j][i] == '0') ++num0;\\n }\\n if(num0 == m) {\\n t[i] = '0';\\n cout << t << endl;\\n return 0;\\n } else if(num0 == 0) {\\n t[i] = '1';\\n cout << t << endl;\\n return 0;\\n }\\n }\\n cout << \\\"hokudai\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.024390243902439025,\n \"time_ms\": 40,\n \"memory_kb\": 7740,\n \"score_of_the_acc\": -0.0844,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1982,"cells":{"group_id":{"kind":"string","value":"aoj_3167_cpp"},"problem_description":{"kind":"string","value":"D: Many Points\n問題\n二次元平面上に $N$ 個の点があります。それぞれには $1$ から $N$ までの番号がついており、$i$ 番目の点 $p_i$ の座標は $(x_i, y_i)$ です。異なる番号がつけられた二つの点が重なることはありません。\nあなたはこれらの $N$ 個の点全てからのユークリッド距離が等しい直線 $L$ を引きたいです。より形式的には、点 $p_i$ と直線 $L$ との距離を $d(p_i, L)$ と表記するとき、$d(p_1, L) = d(p_2, L) = \\ldots = d(p_N, L)$ となる直線 $L$ を求めたいです。\nしかし、そのような直線が常に存在するわけではありません。\n$T$ 個のテストケースに対して、条件を満たす直線が存在するか判定してください。\n入力形式\n入力は複数のテストケースからなります。$1$ 行目にはテストケースの数 $T$ が与えられます。\n各テストケースの形式は以下の通りです。\n$N$\n$x_1$ $y_1$\n$x_2$ $y_2$\n...\n$x_N$ $y_N$\n制約\n入力は全て整数で与えられる\n$1 \\leq T \\leq 30$\n$1 \\leq N \\leq 2 \\times 10^4$\n$-10^9 \\leq x_i, y_i \\leq 10^9$\n$i \\neq j$ ならば $x_i \\neq x_j$ または $y_i \\neq y_j$ が成り立つ\n出力形式\n$T$ 行出力してください。$i$ 行目には $i$ 番目のテストケースに対する出力をしてください。\n条件を満たす直線が存在する場合は\nYes\n、存在しない場合は\nNo\nと出力してください。\n入力例1\n2\n3\n-1 -1\n1 -1\n1 1\n5\n-1 -1\n1 -1\n1 1\n-1 1\n0 0\n出力例1\nYes\nNo\nこの入力の 1 つ目のテストケースでは直線 $x = 0$ や $y = 0$ が条件を満たします。\n2 つ目のテストケースでは条件を満たす直線は存在しません。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3167_10760592","code_snippet":"// AOJ #3167 Many Points\n// 2025.4.7\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Couts(const string &s) { for (char c : s) pc(c); pc('\\n'); }\n\nstruct P { ll x, y; };\nP diff(const P &p, const P &q) { return {q.x - p.x, q.y - p.y}; }\nll cross(ll ax, ll ay, ll bx, ll by) { return ax * by - ay * bx; }\n\nint main(){\n int T = Cin();\n while(T--){\n int n = Cin();\n vector<P> pts(n);\n for (int i=0; i<n; i++) pts[i].x = Cin(), pts[i].y = Cin();\n if(n <= 2) { Couts(\"Yes\"); continue; }\n\n bool col = true;\n P d0 = diff(pts[0], pts[1]);\n for (int i=2; i<n; i++){\n P d1 = diff(pts[0], pts[i]);\n if(cross(d0.x, d0.y, d1.x, d1.y) != 0){\n col = false;\n break;\n }\n }\n if(col) { Couts(\"Yes\"); continue; }\n\n bool ok = false;\n int lim = min(n, 10);\n for (int i = 0; i < lim && !ok; i++){\n for (int j = i+1; j < lim && !ok; j++){\n ll dx = pts[j].x - pts[i].x;\n ll dy = pts[j].y - pts[i].y;\n for (int k = 0; k < 2 && !ok; k++){\n ll cx, cy;\n if(k == 0){ cx = dx; cy = dy; }\n else { cx = dy; cy = -dx; }\n if(cx == 0 && cy == 0) continue;\n unordered_set<ll> S;\n S.reserve(n*2);\n for(auto &p : pts){\n ll f = cx * p.x + cy * p.y;\n S.insert(f);\n if(S.size() > 2) break;\n }\n if(S.size() <= 2){\n ok = true;\n break;\n }\n }\n }\n }\n Couts(ok? \"Yes\": \"No\");\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3968,"score_of_the_acc":-0.3268,"final_rank":2},{"submission_id":"aoj_3167_7975392","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\nconst int mod = 998244353;\nconst int inf = (1<<30);\n\nconst int dy[4] = {-1,0,0,1};\nconst int dx[4] = {0,-1,1,0};\n\n#define double long double\n#define equals(a,b) (fabs((a)-(b)) < EPS)\n\nnamespace geometry {\n const double EPS = 1e-10;\n const double PI = asinl(1) * 2;\n\n struct Point {\n double x,y;\n Point(){}\n Point(double x, double y):x(x),y(y){}\n Point operator+(Point p) {return Point(x+p.x,y+p.y);}\n Point operator-(Point p) {return Point(x-p.x,y-p.y);}\n Point operator*(double k) {return Point(x*k,y*k);}\n Point operator/(double k) {return Point(x/k,y/k);}\n double norm() {return x*x+y*y;}\n double abs() {return sqrt(norm());}\n\n bool operator<(const Point &p) const {\n return x!=p.x ? x<p.x : x<p.y;\n }\n\n bool operator==(const Point &p) const {\n return fabs(x-p.x) < EPS and fabs(y-p.y) < EPS;\n }\n };\n\n struct Segment {\n Point p1, p2;\n Segment() {}\n Segment(Point p1, Point p2):p1(p1),p2(p2){}\n };\n\n // using Line = Segment;\n typedef Segment Line;\n\n double norm(Point a) {\n return a.x*a.x+a.y*a.y;\n }\n\n double abs(Point a) {\n return sqrt(norm(a));\n }\n\n double dot(Point a, Point b) {\n return a.x*b.x+a.y*b.y;\n }\n\n double cross(Point a, Point b) {\n return a.x*b.y-a.y*b.x;\n }\n\n bool isParallel(Point a, Point b) {\n return equals(cross(a,b), 0.0);\n }\n\n bool isParallel(Point a1, Point a2, Point b1, Point b2) {\n return isParallel(a1-a2,b1-b2);\n }\n\n bool isParallel(Line l1, Line l2) {\n return equals(cross(l1.p2-l1.p1,l2.p2-l2.p1), 0.0);\n }\n\n // COUNTER CLOCKWISE\n static const int CCW_COUNTER_CLOCKWISE = 1;\n static const int CCW_CLOCKWISE = -1;\n static const int CCW_ONLINE_BACK = 2;\n static const int CCW_ONLINE_FRONT = -2;\n static const int CCW_ON_SEGMENT = 0;\n\n int ccw(Point p0, Point p1, Point p2) {\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS) return CCW_COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS) return CCW_CLOCKWISE;\n if(dot(a,b) < -EPS) return CCW_ONLINE_BACK;\n if(a.norm() < b.norm()) return CCW_ONLINE_FRONT;\n return CCW_ON_SEGMENT;\n }\n}\nusing namespace geometry;\n\nnamespace geometry {\n ostream &operator<<(ostream &os, Point p) {\n os<<fixed<<setprecision(12)<<p.x<<\" \"<<p.y;\n return os;\n }\n}\n\nbool on_line(int ccw_result) {\n return ccw_result == CCW_ONLINE_BACK or ccw_result == CCW_ONLINE_FRONT or ccw_result == CCW_ON_SEGMENT;\n}\n\nbool is_all_points_on_line(const vector<Point> &ps, Line l) {\n for(const auto &p:ps) {\n if(not on_line(ccw(l.p1, l.p2, p))) {\n return false;\n }\n }\n return true;\n}\n\nbool on_lines( Line l1, Line l2, Point p) {\n return on_line(ccw(l1.p1, l1.p2, p)) or on_line(ccw(l2.p1, l2.p2, p));\n}\n\npair<Line, bool> find_line(Line l1, const vector<Point> &ps, int used1, int used2) {\n bool found_p = false, found_l2 = false;\n Point p;\n Line l2;\n for(int i=0;i<(int)(ps.size());i++) {\n if(i==used1 or i==used2) {\n continue;\n }\n\n if (not on_line(ccw(l1.p1, l1.p2, ps[i]))) {\n if (found_p) {\n l2 = Line(p, ps[i]);\n found_l2 = true;\n break;\n }\n p = ps[i];\n found_p = true;\n }\n }\n\n return {l2, found_l2};\n}\n\npair<Point, int> find_point(Line l, const vector<Point> &ps) {\n for(int i=0;i<(int)(ps.size()); i++) {\n const auto &p = ps[i];\n\n if (not on_line(ccw(l.p1, l.p2, p))) {\n return {p, i};\n }\n }\n return {Point(), -1};\n}\n\nbool is_only_point_not_on_line(Line l, const vector<Point> &ps) {\n auto [p, p_idx] = find_point(l, ps);\n for(int i=p_idx+1;i<(int)(ps.size());i++) {\n const auto &p = ps[i];\n\n if (not on_line(ccw(l.p1, l.p2, p))) {\n return false;\n }\n }\n return true;\n}\n\nbool solve() {\n int n;\n cin >> n;\n\n vector<Point> ps(n);\n rep(i, n) {\n cin >> ps[i].x >> ps[i].y;\n }\n\n if (n <= 3) {\n cout << \"Yes\\n\";\n return true;\n }\n\n if (is_all_points_on_line(ps, Line(ps[0], ps[1]))) {\n cout << \"Yes\\n\";\n return true;\n }\n\n if (is_only_point_not_on_line(Line(ps[0], ps[1]), ps)) {\n cout << \"Yes\\n\";\n return true;\n }\n\n Line l1 = Line(ps[0], ps[1]);\n\n auto [p, p_idx] = find_point(l1, ps);\n\n {\n Line l1 = Line(ps[0], ps[1]);\n\n auto [l2, found_l2] = find_line(l1, ps, 0, 1);\n\n assert(found_l2);\n\n if (isParallel(l1, l2)) {\n bool all_points_on_line = true;\n\n for (auto p: ps) {\n if(not on_lines(l1, l2, p)) {\n all_points_on_line = false;\n break;\n }\n }\n\n if (all_points_on_line) {\n cout << \"Yes\\n\";\n return true;\n }\n }\n }\n\n {\n Line l1 = Line(ps[0], ps[p_idx]);\n\n auto [l2, found_l2] = find_line(l1, ps, 0, p_idx);\n\n assert(found_l2);\n\n if (isParallel(l1, l2)) {\n bool all_points_on_line = true;\n\n for (auto p: ps) {\n if(not on_lines(l1, l2, p)) {\n all_points_on_line = false;\n break;\n }\n }\n\n if (all_points_on_line) {\n cout << \"Yes\\n\";\n return true;\n }\n }\n }\n\n {\n Line l1 = Line(ps[1], ps[p_idx]);\n\n auto [l2, found_l2] = find_line(l1, ps, 1, p_idx);\n\n assert(found_l2);\n\n if (isParallel(l1, l2)) {\n bool all_points_on_line = true;\n\n for (auto p: ps) {\n if(not on_lines(l1, l2, p)) {\n all_points_on_line = false;\n break;\n }\n }\n\n if (all_points_on_line) {\n cout << \"Yes\\n\";\n return true;\n }\n }\n }\n\n cout << \"No\\n\";\n\n return true;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int t;\n cin >> t;\n\n rep(_, t) {\n solve();\n }\n}","accuracy":1,"time_ms":220,"memory_kb":4200,"score_of_the_acc":-0.6887,"final_rank":7},{"submission_id":"aoj_3167_7975389","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\nconst int mod = 998244353;\nconst int inf = (1<<30);\n\nconst int dy[4] = {-1,0,0,1};\nconst int dx[4] = {0,-1,1,0};\n\n#define equals(a,b) (fabs((a)-(b)) < EPS)\n\nnamespace geometry {\n const double EPS = 1e-10;\n const double PI = asinl(1) * 2;\n\n struct Point {\n double x,y;\n Point(){}\n Point(double x, double y):x(x),y(y){}\n Point operator+(Point p) {return Point(x+p.x,y+p.y);}\n Point operator-(Point p) {return Point(x-p.x,y-p.y);}\n Point operator*(double k) {return Point(x*k,y*k);}\n Point operator/(double k) {return Point(x/k,y/k);}\n double norm() {return x*x+y*y;}\n double abs() {return sqrt(norm());}\n\n bool operator<(const Point &p) const {\n return x!=p.x ? x<p.x : x<p.y;\n }\n\n bool operator==(const Point &p) const {\n return fabs(x-p.x) < EPS and fabs(y-p.y) < EPS;\n }\n };\n\n struct Segment {\n Point p1, p2;\n Segment() {}\n Segment(Point p1, Point p2):p1(p1),p2(p2){}\n };\n\n // using Line = Segment;\n typedef Segment Line;\n\n double norm(Point a) {\n return a.x*a.x+a.y*a.y;\n }\n\n double abs(Point a) {\n return sqrt(norm(a));\n }\n\n double dot(Point a, Point b) {\n return a.x*b.x+a.y*b.y;\n }\n\n double cross(Point a, Point b) {\n return a.x*b.y-a.y*b.x;\n }\n\n bool isParallel(Point a, Point b) {\n return equals(cross(a,b), 0.0);\n }\n\n bool isParallel(Point a1, Point a2, Point b1, Point b2) {\n return isParallel(a1-a2,b1-b2);\n }\n\n bool isParallel(Line l1, Line l2) {\n return equals(cross(l1.p2-l1.p1,l2.p2-l2.p1), 0.0);\n }\n\n // COUNTER CLOCKWISE\n static const int CCW_COUNTER_CLOCKWISE = 1;\n static const int CCW_CLOCKWISE = -1;\n static const int CCW_ONLINE_BACK = 2;\n static const int CCW_ONLINE_FRONT = -2;\n static const int CCW_ON_SEGMENT = 0;\n\n int ccw(Point p0, Point p1, Point p2) {\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS) return CCW_COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS) return CCW_CLOCKWISE;\n if(dot(a,b) < -EPS) return CCW_ONLINE_BACK;\n if(a.norm() < b.norm()) return CCW_ONLINE_FRONT;\n return CCW_ON_SEGMENT;\n }\n}\nusing namespace geometry;\n\nnamespace geometry {\n ostream &operator<<(ostream &os, Point p) {\n os<<fixed<<setprecision(12)<<p.x<<\" \"<<p.y;\n return os;\n }\n}\n\nbool on_line(int ccw_result) {\n return ccw_result == CCW_ONLINE_BACK or ccw_result == CCW_ONLINE_FRONT or ccw_result == CCW_ON_SEGMENT;\n}\n\nbool is_all_points_on_line(const vector<Point> &ps, Line l) {\n for(const auto &p:ps) {\n if(not on_line(ccw(l.p1, l.p2, p))) {\n return false;\n }\n }\n return true;\n}\n\nbool on_lines( Line l1, Line l2, Point p) {\n return on_line(ccw(l1.p1, l1.p2, p)) or on_line(ccw(l2.p1, l2.p2, p));\n}\n\npair<Line, bool> find_line(Line l1, const vector<Point> &ps, int used1, int used2) {\n bool found_p = false, found_l2 = false;\n Point p;\n Line l2;\n for(int i=0;i<(int)(ps.size());i++) {\n if(i==used1 or i==used2) {\n continue;\n }\n\n if (not on_line(ccw(l1.p1, l1.p2, ps[i]))) {\n if (found_p) {\n l2 = Line(p, ps[i]);\n found_l2 = true;\n break;\n }\n p = ps[i];\n found_p = true;\n }\n }\n\n return {l2, found_l2};\n}\n\npair<Point, int> find_point(Line l, const vector<Point> &ps) {\n for(int i=0;i<(int)(ps.size()); i++) {\n const auto &p = ps[i];\n\n if (not on_line(ccw(l.p1, l.p2, p))) {\n return {p, i};\n }\n }\n return {Point(), -1};\n}\n\nbool is_only_point_not_on_line(Line l, const vector<Point> &ps) {\n auto [p, p_idx] = find_point(l, ps);\n for(int i=p_idx+1;i<(int)(ps.size());i++) {\n const auto &p = ps[i];\n\n if (not on_line(ccw(l.p1, l.p2, p))) {\n return false;\n }\n }\n return true;\n}\n\nbool solve() {\n int n;\n cin >> n;\n\n vector<Point> ps(n);\n rep(i, n) {\n cin >> ps[i].x >> ps[i].y;\n }\n\n if (n <= 3) {\n cout << \"Yes\\n\";\n return true;\n }\n\n if (is_all_points_on_line(ps, Line(ps[0], ps[1]))) {\n cout << \"Yes\\n\";\n return true;\n }\n\n if (is_only_point_not_on_line(Line(ps[0], ps[1]), ps)) {\n cout << \"Yes\\n\";\n return true;\n }\n\n Line l1 = Line(ps[0], ps[1]);\n\n auto [p, p_idx] = find_point(l1, ps);\n\n {\n Line l1 = Line(ps[0], ps[1]);\n\n auto [l2, found_l2] = find_line(l1, ps, 0, 1);\n\n assert(found_l2);\n\n if (isParallel(l1, l2)) {\n bool all_points_on_line = true;\n\n for (auto p: ps) {\n if(not on_lines(l1, l2, p)) {\n all_points_on_line = false;\n break;\n }\n }\n\n if (all_points_on_line) {\n cout << \"Yes\\n\";\n return true;\n }\n }\n }\n\n {\n Line l1 = Line(ps[0], ps[p_idx]);\n\n auto [l2, found_l2] = find_line(l1, ps, 0, p_idx);\n\n assert(found_l2);\n\n if (isParallel(l1, l2)) {\n bool all_points_on_line = true;\n\n for (auto p: ps) {\n if(not on_lines(l1, l2, p)) {\n all_points_on_line = false;\n break;\n }\n }\n\n if (all_points_on_line) {\n cout << \"Yes\\n\";\n return true;\n }\n }\n }\n\n {\n Line l1 = Line(ps[1], ps[p_idx]);\n\n auto [l2, found_l2] = find_line(l1, ps, 1, p_idx);\n\n assert(found_l2);\n\n if (isParallel(l1, l2)) {\n bool all_points_on_line = true;\n\n for (auto p: ps) {\n if(not on_lines(l1, l2, p)) {\n all_points_on_line = false;\n break;\n }\n }\n\n if (all_points_on_line) {\n cout << \"Yes\\n\";\n return true;\n }\n }\n }\n\n cout << \"No\\n\";\n\n return true;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int t;\n cin >> t;\n\n rep(_, t) {\n solve();\n }\n}","accuracy":0.8846153846153846,"time_ms":210,"memory_kb":3844,"score_of_the_acc":-0.5299,"final_rank":16},{"submission_id":"aoj_3167_7975343","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n//using ll = long long;\n\nusing Real = long double;\n\nconst Real EPS = 1e-13;\nconst string Yes = \"Yes\";\nconst string No = \"No\";\n\nstruct Point{\n Real x, y;\n Point(){}\n Point(Real a, Real b){\n x = a;\n y = b;\n }\n};\n\n// ax + by + c = 0\nstruct Line{\n Real a, b, c;\n Line(){}\n Line(Real x0, Real y0, Real x1, Real y1){\n a = -(y1 - y0);\n b = x1 - x0;\n c = -y0 * (x1 - x0) + x0 * (y1 - y0);\n }\n};\n\nReal dist2(Point p, Line l){\n Real res = fabsl(l.a * p.x + l.b * p.y + l.c);\n res *= res;\n res /= (l.a * l.a + l.b * l.b);\n return res;\n}\n\nbool equal(Real a, Real b){\n return fabsl(a - b) <= EPS; \n}\n\nint main() {\n int T; cin >> T;\n while(T--){\n int N; cin >> N;\n vector<Point> P(N);\n for(int i= 0; i < N; i++) cin >> P[i].x >> P[i].y;\n\n if(N <= 2){\n cout << Yes << endl;\n continue;\n }\n\n Line line(P[0].x, P[0].y, P[1].x, P[1].y);\n int idx = -1;\n for(int i = 2; i < N; i++){\n if(!equal(0.0, dist2(P[i], line))){\n idx = i;\n break;\n }\n }\n\n if(idx == -1){\n cout << Yes << endl;\n continue;\n }\n\n vector<Point> Ps(3);\n Ps[0] = P[0];\n Ps[1] = P[1];\n Ps[2] = P[idx];\n //for(int i = 0; i < 3; i++) cerr << Ps[i].x << Ps[i].y << endl;\n\n Point mid01((Ps[0].x + Ps[1].x) / 2, (Ps[0].y + Ps[1].y) / 2);\n Point mid12((Ps[1].x + Ps[2].x) / 2, (Ps[1].y + Ps[2].y) / 2);\n Point mid20((Ps[2].x + Ps[0].x) / 2, (Ps[2].y + Ps[0].y) / 2);\n //cerr << mid01.x << \" \" << mid01.y << endl;\n //cerr << mid12.x << \" \" << mid12.y << endl;\n //cerr << mid20.x << \" \" << mid20.y << endl;\n \n vector<Line> ls(3);\n ls[0] = Line(mid01.x, mid01.y, mid12.x, mid12.y);\n assert(equal(dist2(Ps[0], ls[0]), dist2(Ps[1], ls[0])));\n assert(equal(dist2(Ps[0], ls[0]), dist2(Ps[2], ls[0])));\n\n ls[1] = Line(mid12.x, mid12.y, mid20.x, mid20.y);\n assert(equal(dist2(Ps[0], ls[1]), dist2(Ps[1], ls[1])));\n assert(equal(dist2(Ps[0], ls[1]), dist2(Ps[2], ls[1])));\n\n ls[2] = Line(mid20.x, mid20.y, mid01.x, mid01.y);\n assert(equal(dist2(Ps[0], ls[2]), dist2(Ps[1], ls[2])));\n assert(equal(dist2(Ps[0], ls[2]), dist2(Ps[2], ls[2])));\n\n //ll tmp = fabsl(dist2(P[0], );\n bool isok = 0;\n for(int i = 0; i < 3; i++){\n Real tmp = fabsl(dist2(P[0], ls[i]));\n bool flag = 1;\n for(int j = 0; j < N; j++){\n if(!equal(fabsl(dist2(P[j], ls[i])), tmp)){\n flag = 0;\n break;\n }\n }\n if(flag) isok = 1;\n }\n\n if(isok) cout << Yes << endl;\n else cout << No << endl;\n\n }\n}","accuracy":1,"time_ms":390,"memory_kb":4264,"score_of_the_acc":-0.9542,"final_rank":9},{"submission_id":"aoj_3167_7009838","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3167.cc: Many Points\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 20000;\n\n/* typedef */\n\ntypedef long long ll;\n\ntemplate <typename T>\nstruct Pt {\n T x, y;\n Pt() {}\n Pt(T _x, T _y) : x(_x), y(_y) {}\n Pt(const Pt<T> &p) : x(p.x), y(p.y) {}\n\n Pt<T> operator+(const Pt<T> p) const { return Pt<T>(x + p.x, y + p.y); }\n Pt<T> operator-() const { return Pt<T>(-x, -y); }\n Pt<T> operator-(const Pt<T> p) const { return Pt<T>(x - p.x, y - p.y); }\n Pt<T> operator*(T t) const { return Pt<T>(x * t, y * t); }\n Pt<T> operator/(T t) const { return Pt<T>(x / t, y / t); }\n T dot(Pt<T> v) const { return x * v.x + y * v.y; }\n T cross(Pt<T> v) const { return x * v.y - y * v.x; }\n T d2() { return x * x + y * y; }\n\n Pt<T> rot90() { return Pt<T>(-y, x); }\n\n bool operator==(const Pt<T> pt) const { return x == pt.x && y == pt.y; }\n bool operator<(const Pt<T> &pt) const {\n return x < pt.x || (x == pt.x && y < pt.y);\n }\n};\n\ntypedef Pt<ll> pt;\ntypedef vector<pt> vpt;\n\n/* global variables */\n\npt ps[MAX_N];\n\n/* subroutines */\n\n// convex_hull()\n// make a convex_hull 'chs' from a set of points 'ps'\n// Note: ps must be sorted, and must contain at least 2 points\nvoid convex_hull(const int n, const pt ps[], vpt& chs) {\n vpt lhs, uhs;\n\n lhs.push_back(ps[0]);\n lhs.push_back(ps[1]);\n for (int i = 2; i < n; i++) {\n while (lhs.size() >= 2) {\n int ln = lhs.size();\n pt &lh0 = lhs[ln - 2], &lh1 = lhs[ln - 1];\n if ((lh1 - lh0).cross(ps[i] - lh1) > 0) break;\n lhs.pop_back();\n }\n lhs.push_back(ps[i]);\n }\n\n uhs.push_back(ps[n - 1]);\n uhs.push_back(ps[n - 2]);\n for (int i = n - 3; i >= 0; i--) {\n while (uhs.size() >= 2) {\n int un = uhs.size();\n pt &uh0 = uhs[un - 2], &uh1 = uhs[un - 1];\n if ((uh1 - uh0).cross(ps[i] - uh1) > 0) break;\n uhs.pop_back();\n }\n uhs.push_back(ps[i]);\n }\n\n lhs.pop_back();\n uhs.pop_back();\n\n chs.clear();\n chs.reserve(lhs.size() + uhs.size());\n chs.assign(lhs.begin(), lhs.end());\n chs.insert(chs.end(), uhs.begin(), uhs.end());\n}\n\n/* main */\n\nint main() {\n //freopen(\"input.txt\", \"r\", stdin);\n //freopen(\"output.txt\", \"w\", stdout);\n\n int tn;\n scanf(\"%d\", &tn);\n\n for (int ti = 0; ti < tn; ti++) {\n int n;\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++)\n scanf(\"%lld%lld\", &ps[i].x, &ps[i].y);\n\n if (ti == -1) {\n printf(\"%d\\n\", n);\n for (int i = 0; i < n; i++) printf(\"%lld,%lld\\n\", ps[i].x, ps[i].y);\n }\n\n if (n <= 2) { puts(\"Yes\"); continue; }\n\n sort(ps, ps + n);\n vpt chs;\n convex_hull(n, ps, chs);\n int chn = chs.size();\n //printf(\"chs=%d\\n\", chn);\n\n if (chn <= 2)\n puts(\"Yes\");\n else if (chn == 3) {\n bool ok = false;\n for (int i = 0; ! ok && i < 3; i++) {\n\tpt p0 = chs[i], p1 = chs[(i + 1) % 3], p2 = chs[(i + 2) % 3];\n\tpt v(p2 - p1);\n\n\tok = true;\n\tfor (int j = 0; ok && j < n; j++)\n\t ok = (ps[j] == p0 || v.cross(ps[j] - p1) == 0);\n }\n\n if (ok) puts(\"Yes\");\n else puts(\"No\");\n }\n else if (chn == 4) {\n bool ok = false;\n for (int i = 0; ! ok && i < 2; i++) {\n\tpt p0 = chs[i], p1 = chs[(i + 1) % 4];\n\tpt p2 = chs[(i + 2) % 4], p3 = chs[(i + 3) % 4];\n\tpt v0(p1 - p0), v1(p3 - p2);\n\n\tif (v0.cross(v1) != 0) continue;\n\n\tok = true;\n\tfor (int j = 0; ok && j < n; j++)\n\t ok = (v0.cross(ps[j] - p0) == 0 || v1.cross(ps[j] - p2) == 0);\n }\n\n if (ok) puts(\"Yes\");\n else puts(\"No\");\n }\n else\n puts(\"No\");\n }\n\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":3220,"score_of_the_acc":-0.1354,"final_rank":1},{"submission_id":"aoj_3167_7009834","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3167.cc: Many Points\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 20000;\n\n/* typedef */\n\ntypedef long long ll;\n\ntemplate <typename T>\nstruct Pt {\n T x, y;\n Pt() {}\n Pt(T _x, T _y) : x(_x), y(_y) {}\n Pt(const Pt<T> &p) : x(p.x), y(p.y) {}\n\n Pt<T> operator+(const Pt<T> p) const { return Pt<T>(x + p.x, y + p.y); }\n Pt<T> operator-() const { return Pt<T>(-x, -y); }\n Pt<T> operator-(const Pt<T> p) const { return Pt<T>(x - p.x, y - p.y); }\n Pt<T> operator*(T t) const { return Pt<T>(x * t, y * t); }\n Pt<T> operator/(T t) const { return Pt<T>(x / t, y / t); }\n T dot(Pt<T> v) const { return x * v.x + y * v.y; }\n T cross(Pt<T> v) const { return x * v.y - y * v.x; }\n T d2() { return x * x + y * y; }\n\n Pt<T> rot90() { return Pt<T>(-y, x); }\n\n bool operator==(const Pt<T> pt) const { return x == pt.x && y == pt.y; }\n bool operator<(const Pt<T> &pt) const {\n return x < pt.x || (x == pt.x && y < pt.y);\n }\n};\n\ntypedef Pt<ll> pt;\ntypedef vector<pt> vpt;\n\n/* global variables */\n\npt ps[MAX_N];\n\n/* subroutines */\n\n// convex_hull()\n// make a convex_hull 'chs' from a set of points 'ps'\n// Note: ps must be sorted, and must contain at least 2 points\nvoid convex_hull(const int n, const pt ps[], vpt& chs) {\n vpt lhs, uhs;\n\n lhs.push_back(ps[0]);\n lhs.push_back(ps[1]);\n for (int i = 2; i < n; i++) {\n while (lhs.size() >= 2) {\n int ln = lhs.size();\n pt &lh0 = lhs[ln - 2], &lh1 = lhs[ln - 1];\n if ((lh1 - lh0).cross(ps[i] - lh1) > 0) break;\n lhs.pop_back();\n }\n lhs.push_back(ps[i]);\n }\n\n uhs.push_back(ps[n - 1]);\n uhs.push_back(ps[n - 2]);\n for (int i = n - 3; i >= 0; i--) {\n while (uhs.size() >= 2) {\n int un = uhs.size();\n pt &uh0 = uhs[un - 2], &uh1 = uhs[un - 1];\n if ((uh1 - uh0).cross(ps[i] - uh1) > 0) break;\n uhs.pop_back();\n }\n uhs.push_back(ps[i]);\n }\n\n lhs.pop_back();\n uhs.pop_back();\n\n chs.clear();\n chs.reserve(lhs.size() + uhs.size());\n chs.assign(lhs.begin(), lhs.end());\n chs.insert(chs.end(), uhs.begin(), uhs.end());\n}\n\n/* main */\n\nint main() {\n //freopen(\"input.txt\", \"r\", stdin);\n //freopen(\"output.txt\", \"w\", stdout);\n\n int tn;\n scanf(\"%d\", &tn);\n\n while (tn--) {\n int n;\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++)\n scanf(\"%lld%lld\", &ps[i].x, &ps[i].y);\n\n if (n <= 2) { puts(\"Yes\"); continue; }\n\n sort(ps, ps + n);\n vpt chs;\n convex_hull(n, ps, chs);\n int chn = chs.size();\n //printf(\"chs=%d\\n\", chn);\n\n if (chn <= 2)\n puts(\"Yes\");\n else if (chn == 3) {\n bool ok = false;\n for (int i = 0; ! ok && i < 3; i++) {\n\tpt p0 = chs[i], p1 = chs[(i + 1) % 3], p2 = chs[(i + 2) % 3];\n\tpt v(p2 - p1);\n\n\tok = true;\n\tfor (int j = 0; ok && j < n; j++)\n\t ok = (ps[j] == p0 || v.cross(ps[j] - p1) == 0);\n }\n\n if (ok) puts(\"Yes\");\n else puts(\"No\");\n }\n else if (chn == 4) {\n bool ok = false;\n for (int i = 0; ! ok && i < 2; i++) {\n\tpt p0 = chs[i], p1 = chs[(i + 1) % 4];\n\tpt p2 = chs[(i + 2) % 4], p3 = chs[(i + 3) % 4];\n\tpt v0(p1 - p0), v1(p3 - p2);\n\n\tok = true;\n\tfor (int j = 0; ok && j < n; j++)\n\t ok = (v0.cross(ps[j] - p0) == 0 || v1.cross(ps[j] - p2) == 0);\n }\n\n if (ok) puts(\"Yes\");\n else puts(\"No\");\n }\n else\n puts(\"No\");\n }\n\n return 0;\n}","accuracy":0.8846153846153846,"time_ms":110,"memory_kb":3164,"score_of_the_acc":-0.1127,"final_rank":15},{"submission_id":"aoj_3167_6928919","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=9167167167167167167;\nconst int INF=100000000;\nconst ll mod=998244353;\n#define rep(i,a) for (ll i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\n\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\tcin>>t;\n\trep(i,t) solve();\n}\n\nvoid solve(){\n\tint N;\n\tcin>>N;\n\tvector<pair<ll,ll>> p(N);\n\trep(i,N) cin>>p[i].first>>p[i].second;\n\tif(N<4){\n\t\tcout<<\"Yes\\n\";\n\t\treturn;\n\t}\n\tauto f=[](vector<pair<ll,ll>> pos,pair<ll,ll> A,pair<ll,ll> B)->bool{\n\t\tint n=pos.size();\n\t\tll X=A.second-B.second;\n\t\tll Y=B.first-A.first;\n\t\tset<ll> s;\n\t\trep(i,n) s.insert(X*pos[i].first+Y*pos[i].second);\n\t\treturn (int)s.size()<=2;\n\t};\n\tyneos(f(p,p[0],p[1])||f(p,p[0],p[2])||f(p,p[1],p[2]));\n}","accuracy":1,"time_ms":210,"memory_kb":5624,"score_of_the_acc":-1.2535,"final_rank":10},{"submission_id":"aoj_3167_5145361","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nusing lli = long long int;\nusing Point = pair<lli, lli>;\n\nlli gcd(lli a, lli b){\n if(a%b==0) return b;\n return gcd(b,a%b);\n}\nPoint operator +(const Point& a, const Point& b){\n return Point(a.first +b.first, a.second +b.second);\n}\nPoint operator -(const Point& a, const Point& b){\n return Point(a.first -b.first, a.second -b.second);\n}\nPoint reduce(Point p){\n if(p.first == 0){\n if(p.second == 0) return Point(0, 0);\n return Point(0, 1);\n }\n if(p.second == 0){\n return Point(1, 0);\n }\n if(p.first < 0){\n p.first = -p.first;\n p.second = -p.second;\n }\n lli d = gcd(p.first, abs(p.second));\n return Point(p.first/d, p.second/d);\n}\n\nint main(){\n int t;\n cin >> t;\n for(int rep=0; rep<t; rep++){\n int n;\n cin >> n;\n vector<Point> p(n);\n for(int i=0; i<n; i++){\n cin >> p[i].first >> p[i].second;\n }\n\n if(n <= 2){\n cout << \"Yes\" << endl;\n continue;\n }\n\n bool ok = false;\n for(int d=0; d<3; d++){\n Point dir = reduce(p[d] -p[(d+1)%3]);\n vector<Point> rem;\n for(int i=0; i<n; i++){\n if(i == d) continue;\n if(reduce(p[i] -p[d]) != dir){\n rem.push_back(p[i]);\n }\n }\n if(rem.size() < 2u){\n ok = true;\n break;\n }\n int count = 0;\n for(int i=1; i<(int)rem.size(); i++){\n if(reduce(rem[i] -rem[0]) != dir){\n count++;\n }\n }\n if(count == 0){\n ok = true;\n break;\n }\n }\n if(ok){\n cout << \"Yes\" << endl;\n }else{\n cout << \"No\" << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":630,"memory_kb":4244,"score_of_the_acc":-1.2841,"final_rank":12},{"submission_id":"aoj_3167_5145291","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\n#include <limits>\nusing namespace std;\n\nconst double EPS = 1e-6;\nconst double INF = 1e12;\nconst double PI = acos(-1);\nconst double NaN = std::numeric_limits<double>::quiet_NaN();\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\nstruct P{\n double X;\n double Y;\n P(double x=0.0, double y=0.0): X(x),Y(y){}\n\n inline const P inv() const { return P(X/(X*X+Y*Y), -Y/(X*X+Y*Y)); }\n inline const P operator -() const { return P(-X, -Y); }\n inline const P operator +(const P& a) const { return P(X+a.X, Y+a.Y); }\n inline const P operator -(const P& a) const { return P(X-a.X, Y-a.Y); }\n inline const P operator *(const P& a) const { return P(X*a.X -Y*a.Y, X*a.Y +Y*a.X); }\n inline const P operator /(const P& a) const { return *this *a.inv(); }\n inline const P operator *(const double& c) const { return P(c*X, c*Y); }\n inline const P operator /(const double& c) const { return P(X/c, Y/c); }\n\n inline P& operator +=(const P& a){ X+=a.X; Y+=a.Y; return *this; }\n inline P& operator -=(const P& a){ X-=a.X; Y-=a.Y; return *this; }\n inline P& operator *=(const P& a){ double nX=X*a.X-Y*a.Y; Y=X*a.Y+Y*a.X; X=nX; return *this; }\n inline P& operator /=(const P& a){ double d=a.X*a.X+a.Y*a.Y; double nX=(X*a.X+Y*a.Y)/d; Y=(-X*a.Y+Y*a.X)/d; X=nX; return *this; }\n inline P& operator *=(const double& c){ X*=c; Y*=c; return *this; }\n inline P& operator /=(const double& c){ X/=c; Y/=c; return *this; }\n\n inline bool operator ==(const P& a) const { return EQ(X,a.X) and EQ(Y,a.Y); }\n inline bool operator !=(const P& a) const { return !(*this==a); }\n inline bool operator <(const P& a) const { return !EQ(X,a.X)? X<a.X: Y+EPS<a.Y; }\n inline bool operator <=(const P& a) const { return *this<a or *this==a; }\n inline bool operator >(const P& a) const { return !(*this<=a); }\n inline bool operator >=(const P& a) const { return !(*this<a); }\n};\nP operator *(const double& c, const P& p){ return P(c*p.X, c*p.Y); }\ndouble norm(const P& a){ return a.X*a.X +a.Y*a.Y; }\ndouble abs(const P& a){ return sqrt(a.X*a.X +a.Y*a.Y); }\ndouble arg(const P& a){ return atan2(a.X, a.Y); }\ndouble dot(const P& a, const P& b){ return a.X*b.X +a.Y*b.Y; }\ndouble cross(const P& a, const P& b){ return a.X*b.Y -a.Y*b.X; }\nstd::ostream& operator <<(std::ostream& lhs, const P& rhs){\n lhs << \"(\" << rhs.X << \", \" << rhs.Y << \")\";\n return lhs;\n}\n\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\n\ndouble distanceLP(const L &l, const P &p) {\n return abs(cross(l[1]-l[0], p-l[0])) /abs(l[1]-l[0]);\n}\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\n\nint main(){\n int t;\n cin >> t;\n for(int rep=0; rep<t; rep++){\n int n;\n cin >> n;\n vector<P> p(n);\n for(int i=0; i<n; i++){\n cin >> p[i].X >> p[i].Y;\n }\n\n if(n <= 2){\n cout << \"Yes\" << endl;\n continue;\n }\n\n bool ok = false;\n for(int d=0; d<3; d++){\n L line(p[d], p[(d+1)%3]);\n vector<P> rem;\n for(int i=0; i<n; i++){\n if(abs(distanceLP(line, p[i]) > EPS)){\n rem.push_back(p[i]);\n }\n }\n if(rem.size() < 2u){\n ok = true;\n break;\n }\n L nline(rem[0], rem[1]);\n if(!isParallel(line, nline)){\n continue;\n }\n int count = 0;\n for(P v: rem){\n if(abs(distanceLP(nline, v) > EPS)){\n count++;\n }\n }\n if(count == 0){\n ok = true;\n break;\n }\n }\n if(ok){\n cout << \"Yes\" << endl;\n }else{\n cout << \"No\" << endl;\n }\n }\n return 0;\n}","accuracy":0.8846153846153846,"time_ms":400,"memory_kb":4280,"score_of_the_acc":-0.9748,"final_rank":18},{"submission_id":"aoj_3167_5067302","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template_no_Ruby.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\nnamespace CharacterClass {\n\tconstexpr string_view\n\t digit = \"0123456789\",\n\t xdigit = \"0123456789ABCDEFabcdef\", lower = \"abcdefghijklmnopqrstuvwxyz\",\n\t upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n\t alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t alnum = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t word = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\",\n\t punct = R\"(!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~)\",\n\t graph =\n\t R\"(!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t print =\n\t R\"( !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t blank = \" \\t\", space = \" \\t\\n\\r\\f\\v\";\n} // namespace CharacterClass\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Output {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid put(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(bool v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(vector<bool>::reference v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid put(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid put(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid put(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void put(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\n\t\tput(v.first);\n\t\tput(D.d);\n\t\tput(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) put(D.d);\n\t\t\tput(*i);\n\t\t}\n\t}\n\ttemplate <class T> void put(const vector<T>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void put(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) put(D.l);\n\t\t\tput(v[i]);\n\t\t}\n\t}\n\n\tOutput() = default;\n\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tOutput& operator()() {\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Output& operator()(H&& h) {\n\t\tput(h);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\n\t\tput(h);\n\t\tput(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tOutput& range(const InputIterator& begin, const InputIterator& end) {\n\t\tput_range(begin, end);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Output& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tOutput& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tOutput& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tOutput& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tOutput& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 7 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T = long long> constexpr T TEN(size_t n) {\n\tT result = 1;\n\tfor (size_t i = 0; i < n; ++i) result *= 10;\n\treturn result;\n}\ntemplate <class T, class U,\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr auto div_ceil(T n, U m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> constexpr T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> constexpr T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T, class U, class V>\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\n\treturn lower <= v && v < upper;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\nconstexpr bool is_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> constexpr T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T> constexpr int BIT(T x, int i) {\n\treturn (x & (1 << i)) ? 1 : 0;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Pow(T a, U n) {\n\tassert(n >= 0);\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Powmod(T a, U n, T mod) {\n\tassert(n >= 0);\n\tif (a > mod) a %= mod;\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 7 \"/home/yuruhiya/programming/library/template/template_no_Ruby.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 5 \"/home/yuruhiya/programming/library/Utility/Pair.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Pair {\n\tusing value_type = T;\n\tstatic constexpr bool cmp_x(const Pair<value_type>& p1, const Pair<value_type>& p2) {\n\t\treturn p1.xy() < p2.xy();\n\t}\n\tstatic constexpr bool cmp_y(const Pair<value_type>& p1, const Pair<value_type>& p2) {\n\t\treturn p1.yx() < p2.yx();\n\t}\n\tstatic constexpr value_type get_x(const Pair<value_type>& p) {\n\t\treturn p.x;\n\t}\n\tstatic constexpr value_type get_y(const Pair<value_type>& p) {\n\t\treturn p.y;\n\t}\n\n\tvalue_type x, y;\n\tconstexpr Pair() : x(), y() {}\n\tconstexpr Pair(value_type _x, value_type _y) : x(_x), y(_y) {}\n\tconstexpr Pair(const pair<value_type, value_type>& xy) : x(xy.first), y(xy.second) {}\n\tconstexpr Pair(const tuple<value_type, value_type>& xy)\n\t : x(get<0>(xy)), y(get<0>(xy)) {}\n\tconstexpr Pair operator+() const {\n\t\treturn *this;\n\t}\n\tconstexpr Pair operator-() const {\n\t\treturn {-x, -y};\n\t}\n\tconstexpr Pair operator+(const Pair& p) const {\n\t\treturn Pair(*this) += p;\n\t}\n\tconstexpr Pair operator-(const Pair& p) const {\n\t\treturn Pair(*this) -= p;\n\t}\n\tconstexpr Pair operator*(const Pair& p) const {\n\t\treturn Pair(*this) *= p;\n\t}\n\tconstexpr Pair operator/(const Pair& p) const {\n\t\treturn Pair(*this) /= p;\n\t}\n\tconstexpr Pair operator%(const Pair& p) const {\n\t\treturn Pair(*this) %= p;\n\t}\n\tconstexpr Pair operator+(value_type n) const {\n\t\treturn Pair(*this) += n;\n\t}\n\tconstexpr Pair operator-(value_type n) const {\n\t\treturn Pair(*this) -= n;\n\t}\n\tconstexpr Pair operator*(value_type n) const {\n\t\treturn Pair(*this) *= n;\n\t}\n\tconstexpr Pair operator/(value_type n) const {\n\t\treturn Pair(*this) /= n;\n\t}\n\tconstexpr Pair operator%(value_type n) const {\n\t\treturn Pair(*this) %= n;\n\t}\n\tconstexpr Pair& operator+=(const Pair& p) {\n\t\tx += p.x;\n\t\ty += p.y;\n\t\treturn *this;\n\t}\n\tconstexpr Pair& operator-=(const Pair& p) {\n\t\tx -= p.x;\n\t\ty -= p.y;\n\t\treturn *this;\n\t}\n\tconstexpr Pair& operator*=(const Pair& p) {\n\t\tx *= p.x;\n\t\ty *= p.y;\n\t\treturn *this;\n\t}\n\tconstexpr Pair& operator/=(const Pair& p) {\n\t\tx /= p.x;\n\t\ty /= p.y;\n\t\treturn *this;\n\t}\n\tconstexpr Pair& operator%=(const Pair& p) {\n\t\tx %= p.x;\n\t\ty %= p.y;\n\t\treturn *this;\n\t}\n\tconstexpr Pair& operator+=(value_type n) {\n\t\tx += n;\n\t\ty += n;\n\t\treturn *this;\n\t}\n\tconstexpr Pair& operator-=(value_type n) {\n\t\tx -= n;\n\t\ty -= n;\n\t\treturn *this;\n\t}\n\tconstexpr Pair& operator*=(value_type n) {\n\t\tx *= n;\n\t\ty *= n;\n\t\treturn *this;\n\t}\n\tconstexpr Pair& operator/=(value_type n) {\n\t\tx /= n;\n\t\ty /= n;\n\t\treturn *this;\n\t}\n\tconstexpr Pair& operator%=(value_type n) {\n\t\tx %= n;\n\t\ty %= n;\n\t\treturn *this;\n\t}\n\tconstexpr bool operator==(const Pair& p) const {\n\t\treturn x == p.x && y == p.y;\n\t}\n\tconstexpr bool operator!=(const Pair& p) const {\n\t\treturn x != p.x || y != p.y;\n\t}\n\tconstexpr bool operator<(const Pair& p) const {\n\t\treturn x < p.x || (!(p.x < x) && y < p.y);\n\t}\n\tconstexpr bool operator>(const Pair& p) const {\n\t\treturn p < *this;\n\t}\n\tconstexpr bool operator<=(const Pair& p) const {\n\t\treturn !(p < *this);\n\t}\n\tconstexpr bool operator>=(const Pair& p) const {\n\t\treturn !(*this < p);\n\t}\n\tconstexpr value_type operator[](size_t i) const {\n\t\tassert(0 <= i && i < 2);\n\t\treturn i == 0 ? x : y;\n\t}\n\tconstexpr pair<value_type, value_type> to_pair() const {\n\t\treturn {x, y};\n\t}\n\tconstexpr tuple<value_type, value_type> to_tuple() const {\n\t\treturn {x, y};\n\t}\n\tconstexpr Pair xy() const {\n\t\treturn {x, y};\n\t}\n\tconstexpr Pair yx() const {\n\t\treturn {y, x};\n\t}\n\tconstexpr operator tuple<value_type&, value_type&>() {\n\t\treturn tuple<value_type&, value_type&>(x, y);\n\t}\n\tfriend ostream& operator<<(ostream& os, const Pair& p) {\n\t\treturn os << p.x << ' ' << p.y;\n\t}\n\tfriend istream& operator>>(istream& is, Pair& p) {\n\t\treturn is >> p.x >> p.y;\n\t}\n};\nnamespace std {\n\ttemplate <class T> struct tuple_size<Pair<T>> : integral_constant<size_t, 2> {};\n\ttemplate <size_t N, class T> struct tuple_element<N, Pair<T>> { using type = T; };\n} // namespace std\ntemplate <size_t N, class T> T get(const Pair<T>& p) {\n\treturn N == 0 ? p.x : p.y;\n}\n#line 3 \"b.cpp\"\n\nvoid solve() {\n\tusing P = Pair<ll>;\n\n\tini(n);\n\tvector<P> p = in[n];\n\tif (n <= 3) {\n\t\tout(true);\n\t\treturn;\n\t}\n\n\tauto check = [&](P a) {\n\t\tvector<P> remain;\n\t\tFOR(i, 1, n) {\n\t\t\tP b = p[0] - p[i];\n\t\t\tif (a.x * b.y - a.y * b.x != 0) {\n\t\t\t\tremain.push_back(p[i]);\n\t\t\t}\n\t\t}\n\t\tFOR(i, 1, sz(remain)) {\n\t\t\tP b = remain[0] - remain[i];\n\t\t\tif (a.x * b.y - a.y * b.x != 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t};\n\n\tout(check(p[0] - p[1]) || check(p[0] - p[2]) || check(p[1] - p[2]));\n}\n\nint main() {\n\tfor (int t = in; t--;) {\n\t\tsolve();\n\t}\n}","accuracy":1,"time_ms":280,"memory_kb":4300,"score_of_the_acc":-0.8139,"final_rank":8},{"submission_id":"aoj_3167_4965075","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 20005\n\nstruct Point{\n\n\tll x,y;\n};\n\nstruct Info{\n\tbool operator==(const struct Info &arg) const{\n\n\t\tif(bunbo == 0 && arg.bunbo == 0){ //★★★注意★★★\n\n\t\t\treturn true;\n\t\t}\n\n\t\treturn bunshi == arg.bunshi && bunbo == arg.bunbo;\n\t}\n\n\tll bunshi,bunbo;\n};\n\nint N;\nPoint point[SIZE];\n\nll gcd(ll x,ll y){\n\n\tx = abs(x);\n\ty = abs(y);\n\n\tif(x < y){\n\t\tswap(x,y);\n\t}\n\tif(y == 0){\n\t\treturn x;\n\t}else{\n\t\treturn gcd(y,x%y);\n\t}\n}\n\nInfo calc_slope(int a,int b){\n\n\tInfo ret;\n\tret.bunbo = point[a].x-point[b].x;\n\tret.bunshi = point[a].y-point[b].y;\n\tll common = gcd(ret.bunbo,ret.bunshi);\n\n\tret.bunbo /= common;\n\tret.bunshi /= common;\n\n\tif(ret.bunbo < 0){\n\t\tret.bunshi *= -1;\n\t\tret.bunbo *= -1;\n\t}\n\treturn ret;\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lld %lld\",&point[i].x,&point[i].y);\n\t}\n\tif(N <= 3){\n\n\t\tprintf(\"Yes\\n\");\n\t\treturn;\n\t}\n\n\tint tmp_index = -1;\n\tInfo base_info = calc_slope(0,1);\n\n\tfor(int i = 2; i < N; i++){\n\n\t\tInfo tmp_info = calc_slope(0,i);\n\t\tif(tmp_info.bunbo != base_info.bunbo || (tmp_info.bunbo != 0 && tmp_info.bunshi != base_info.bunshi)){\n\n\t\t\ttmp_index = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif(tmp_index == -1){ //全て同一直線上\n\n\t\tprintf(\"Yes\\n\");\n\t\treturn;\n\t}\n\n\tInfo work_info1,work_info2;\n\n\tfor(int loop = 0; loop < 3; loop++){\n\n\t\tswitch(loop){\n\t\tcase 0: //0,1基準\n\t\t\tbase_info = calc_slope(0,1);\n\t\t\tbreak;\n\t\tcase 1: //1,tmp_index基準\n\t\t\tbase_info = calc_slope(1,tmp_index);\n\t\t\tbreak;\n\t\tcase 2: //tmp_index,0基準\n\t\t\tbase_info = calc_slope(tmp_index,0);\n\t\t\tbreak;\n\t\t}\n\n\t\tbool FLG = true;\n\n\t\tfor(int i = 2; i < N; i++){\n\t\t\tif(i == tmp_index)continue;\n\n\t\t\tbool tmp_FLG = false;\n\n\t\t\tswitch(loop){\n\t\t\tcase 0: //0,1基準\n\n\t\t\t\twork_info1 = calc_slope(i,tmp_index);\n\t\t\t\twork_info2 = calc_slope(i,0);\n\n\t\t\t\tbreak;\n\t\t\tcase 1: //1,tmp_index基準\n\n\t\t\t\twork_info1 = calc_slope(i,0);\n\t\t\t\twork_info2 = calc_slope(i,1);\n\n\t\t\t\tbreak;\n\t\t\tcase 2: //tmp_index,0基準\n\n\t\t\t\twork_info1 = calc_slope(i,1);\n\t\t\t\twork_info2 = calc_slope(i,tmp_index);\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif(base_info == work_info1 || base_info == work_info2){\n\n\t\t\t\ttmp_FLG = true;\n\t\t\t}\n\n\t\t\tif(!tmp_FLG){\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(FLG){\n\t\t\tprintf(\"Yes\\n\");\n\t\t\treturn;\n\t\t}\n\t}\n\n\n\tprintf(\"No\\n\");\n}\n\n\nint main(){\n\n\tint num_case;\n\tscanf(\"%d\",&num_case);\n\n\tfor(int loop = 0; loop < num_case; loop++){\n\t\tscanf(\"%d\",&N);\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":230,"memory_kb":3476,"score_of_the_acc":-0.4085,"final_rank":3},{"submission_id":"aoj_3167_4965072","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 20005\n\nstruct Point{\n\n\tll x,y;\n};\n\nstruct Info{\n\tbool operator==(const struct Info &arg) const{\n\n\t\tif(bunbo == 0 && arg.bunbo == 0){\n\n\t\t\treturn true;\n\t\t}\n\n\t\treturn bunshi == arg.bunshi && bunbo == arg.bunbo;\n\t}\n\n\tll bunshi,bunbo;\n};\n\nint N;\nPoint point[SIZE];\n\nll gcd(ll x,ll y){\n\n\tx = abs(x);\n\ty = abs(y);\n\n\tif(x < y){\n\t\tswap(x,y);\n\t}\n\tif(y == 0){\n\t\treturn x;\n\t}else{\n\t\treturn gcd(y,x%y);\n\t}\n}\n\nInfo calc_slope(int a,int b){\n\n\tInfo ret;\n\tret.bunbo = point[a].x-point[b].x;\n\tret.bunshi = point[a].y-point[b].y;\n\tll common = gcd(ret.bunbo,ret.bunshi);\n\n\tret.bunbo /= common;\n\tret.bunshi /= common;\n\n\tif(ret.bunbo < 0){\n\t\tret.bunshi *= -1;\n\t\tret.bunbo *= -1;\n\t}\n\treturn ret;\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lld %lld\",&point[i].x,&point[i].y);\n\t}\n\tif(N <= 3){\n\n\t\tprintf(\"Yes\\n\");\n\t\treturn;\n\t}\n\n\tint tmp_index = -1;\n\tInfo base_info = calc_slope(0,1);\n\n\tfor(int i = 2; i < N; i++){\n\n\t\tInfo tmp_info = calc_slope(0,i);\n\t\tif(tmp_info.bunbo != base_info.bunbo || (tmp_info.bunbo != 0 && tmp_info.bunshi != base_info.bunshi)){\n\n\t\t\ttmp_index = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif(tmp_index == -1){ //全て同一直線上\n\n\t\tprintf(\"Yes\\n\");\n\t\treturn;\n\t}\n\n\tInfo work_info1,work_info2;\n\n\t//printf(\"tmp_index:%d\\n\",tmp_index);\n\n\tfor(int loop = 0; loop < 3; loop++){\n\n\t\tswitch(loop){\n\t\tcase 0: //0,1基準\n\t\t\tbase_info = calc_slope(0,1);\n\t\t\tbreak;\n\t\tcase 1: //1,tmp_index基準\n\t\t\tbase_info = calc_slope(1,tmp_index);\n\t\t\tbreak;\n\t\tcase 2: //tmp_index,0基準\n\t\t\tbase_info = calc_slope(tmp_index,0);\n\t\t\tbreak;\n\t\t}\n\n\t\tbool FLG = true;\n\n\t\tfor(int i = 2; i < N; i++){\n\t\t\tif(i == tmp_index)continue;\n\n\t\t\tbool tmp_FLG = false;\n\n\t\t\tswitch(loop){\n\t\t\tcase 0: //0,1基準\n\n\t\t\t\twork_info1 = calc_slope(i,tmp_index);\n\t\t\t\twork_info2 = calc_slope(i,0);\n\n\t\t\t\tbreak;\n\t\t\tcase 1: //1,tmp_index基準\n\n\t\t\t\twork_info1 = calc_slope(i,0);\n\t\t\t\twork_info2 = calc_slope(i,1);\n\n\t\t\t\tbreak;\n\t\t\tcase 2: //tmp_index,0基準\n\n\t\t\t\twork_info1 = calc_slope(i,1);\n\t\t\t\twork_info2 = calc_slope(i,tmp_index);\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif(base_info == work_info1 || base_info == work_info2){\n\n\t\t\t\ttmp_FLG = true;\n\t\t\t}\n\n\t\t\tif(!tmp_FLG){\n\t\t\t\t/*printf(\"loop:%d\\n\",loop);\n\n\t\t\t\tprintf(\"base bunbo:%lld bunshi:%lld\\n\",base_info.bunbo,base_info.bunshi);\n\t\t\t\tprintf(\"work1: bunbo:%lld bunshi:%lld\\n\",work_info1.bunbo,work_info1.bunshi);\n\t\t\t\tprintf(\"work2: bunbo:%lld bunshi:%lld\\n\",work_info2.bunbo,work_info2.bunshi);*/\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(FLG){\n\t\t\tprintf(\"Yes\\n\");\n\t\t\treturn;\n\t\t}\n\t}\n\n\n\tprintf(\"No\\n\");\n}\n\n\nint main(){\n\n\tint num_case;\n\tscanf(\"%d\",&num_case);\n\n\tfor(int loop = 0; loop < num_case; loop++){\n\t\tscanf(\"%d\",&N);\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":230,"memory_kb":3480,"score_of_the_acc":-0.4101,"final_rank":4},{"submission_id":"aoj_3167_4964153","code_snippet":"#include <random>\n#include \"bits/stdc++.h\"\n//#include <atcoder/all>\n\nusing namespace std;\n// using namespace atcoder;\n\nusing ld = long double;\nusing Point = std::complex<ld>;\n\nconst ld eps = 1e-9, pi = acos(-1.0);\n\nnamespace std {\nbool operator<(const Point &lhs, const Point &rhs) {\n if (lhs.real() < rhs.real() - eps) return true;\n if (lhs.real() > rhs.real() + eps) return false;\n return lhs.imag() < rhs.imag();\n}\n} // namespace std\n\nPoint input_point() {\n ld x, y;\n std::cin >> x >> y;\n return Point(x, y);\n}\n\nbool eq(ld a, ld b) { return (abs(a - b) < eps); }\n\nld dot(Point a, Point b) { return real(conj(a) * b); }\n\nld cross(Point a, Point b) { return imag(conj(a) * b); }\n\n// CCW::counter clockwise\nint ccw(Point a, Point b, Point c) {\n b -= a;\n c -= a;\n if (cross(b, c) > eps) return 1; // a,b,c : counter-clockwise\n if (cross(b, c) < -eps) return -1; // a,b,c : clockwise\n if (dot(b, c) < 0) return 2; // c,a,b : on a line\n if (norm(b) < norm(c)) return -2; // a,b,c : on a line\n return 0; // a,c,b : on a line\n}\n\nclass Line {\n public:\n Point a, b;\n Line() : a(Point(0, 0)), b(Point(0, 0)) {}\n Line(Point a, Point b) : a(a), b(b) {}\n};\n\nld dot(Line l, Line m) { return dot((l.a - l.b), (m.a - m.b)); }\n\n// l:line, m:line が交点を持つか\nbool isis_ll(Line l, Line m) { return !eq(cross(l.b - l.a, m.b - m.a), 0); }\n\n// l:line, s:segment\nbool isis_ls(Line l, Line s) {\n return isis_ll(l, s) &&\n (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// s:segment, t:segment\nbool isis_ss(Line s, Line t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// p が l:line 上に存在するか\nbool isis_lp(Line l, Point p) { return (abs(cross(l.b - p, l.a - p)) < eps); }\n\ntemplate <typename T>\nvoid printv(const vector<T> &v) {\n int sz = v.size();\n for (int i = 0; i < sz; i++) {\n cout << v[i] << \" \\n\"[i == sz - 1];\n }\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n auto output_answer = [](bool f) { cout << (f ? \"Yes\" : \"No\") << endl; };\n int t;\n cin >> t;\n while (t--) {\n int n;\n cin >> n;\n vector<Point> ps(n);\n for (int i = 0; i < n; i++) {\n ps[i] = input_point();\n }\n if (n <= 3) {\n output_answer(true);\n continue;\n }\n auto check = [&](Point p1, Point p2) {\n Line l1 = Line(p1, p2);\n vector<Point> not_ls;\n for (int i = 0; i < n; i++) {\n if (!isis_lp(l1, ps[i])) not_ls.emplace_back(ps[i]);\n }\n if (not_ls.size() <= 1) {\n return true;\n }\n Line l2 = Line(not_ls[0], not_ls[1]);\n bool ok = !isis_ll(l1, l2);\n for (auto p : not_ls) {\n if (!isis_lp(l2, p)) ok = false;\n }\n return ok;\n };\n {\n // 全て一直線上 / p[0], p[1] が同じ側\n auto ok = check(ps[0], ps[1]);\n if (ok) {\n output_answer(ok);\n continue;\n }\n }\n // p[0], p[1] が反対側\n {\n // p[0], p[2] が同じ側\n auto ok = check(ps[0], ps[2]);\n if (ok) {\n output_answer(ok);\n continue;\n }\n }\n {\n // p[1], p[2] が同じ側\n auto ok = check(ps[1], ps[2]);\n if (ok) {\n output_answer(ok);\n continue;\n }\n }\n output_answer(false);\n }\n}","accuracy":1,"time_ms":260,"memory_kb":5560,"score_of_the_acc":-1.2979,"final_rank":13},{"submission_id":"aoj_3167_4894938","code_snippet":"#ifdef ONLINE_JUDGE\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing pii = pair<int, int>;\nusing pll = pair<long long, long long>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\n#define all(x) (x).begin(),(x).end()\nconstexpr char ln = '\\n';\nistream& operator>>(istream& is, __int128_t &x) {\n x = 0;\n string s;\n is >> s;\n int n = int(s.size()), it = 0;\n if (s[0] == '-') it++;\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\n if (s[0] == '-') x = -x;\n return is;\n}\nostream& operator<<(ostream& os, __int128_t x) {\n if (x == 0) return os << 0;\n if (x < 0) os << '-', x = -x;\n deque<int> deq;\n while (x) deq.emplace_front(x % 10), x /= 10;\n for (int e : deq) os << e;\n return os;\n}\ntemplate<class T1, class T2>\nostream& operator<<(ostream& os, const pair<T1, T2>& p) {\n return os << \"(\" << p.first << \", \" << p.second << \")\";\n}\ntemplate<class T> \nostream& operator<<(ostream& os, const vector<T>& v) {\n os << \"[\";\n for(auto e : v) os << e << \", \";\n return os << \"]\";\n}\ntemplate<class Container> inline int SZ(Container& v) {return int(v.size());}\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\ninline int topbit(int x) {return x == 0 ? -1 : 31 - __builtin_clz(x);}\ninline int topbit(long long x) {return x == 0 ? -1 : 63 - __builtin_clzll(x);}\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\ninline int popcount(int x) {return __builtin_popcount(x);}\ninline int popcount(long long x) {return __builtin_popcountll(x);}\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\ninline constexpr long long TEN(int x) {return x == 0 ? 1 : TEN(x-1) * 10;}\nnamespace detail {\n template<typename Tp, int Nb>\n auto make_vector(vector<int>& sizes, Tp const& x) {\n if constexpr (Nb == 1) {\n return vector(sizes[0], x);\n } else {\n int size = sizes[Nb-1];\n sizes.pop_back();\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\n }\n }\n}\ntemplate<typename Tp, int Nb>\nauto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {\n vector<int> s(Nb);\n for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];\n return detail::make_vector<Tp, Nb>(s, x);\n}\ninline void print() {cout << \"\\n\";}\ntemplate<class T>\ninline void print(const vector<T>& v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \" \";\n print();\n}\ntemplate<class T, class... Args>\ninline void print(const T &x, const Args &... args) {\n cout << x << \" \";\n print(args...);\n}\n#ifdef MINATO_LOCAL\n#define dump(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\ninline void debug() {cerr << endl;}\ntemplate<class T>\ninline void debug(const vector<T> &v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \" \";\n debug();\n}\ntemplate<class T, class... Args>\ninline void debug(const T &x, const Args &... args) {\n cerr << x << \" \";\n debug(args...);\n}\n#else\n#define dump(x) void(0)\ninline void debug() {}\ntemplate<class T> inline void debug(const vector<T> &v) {}\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\n#endif\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\n// 精度が足りないときはlong double\nusing DD = long double;\nconstexpr DD EPS = 1e-11;\nconst DD PI = acos(DD(-1));\ninline int sgn(DD a) {return (a < -EPS) ? -1 : (a > EPS) ? 1 : 0;}\n\n//点\nstruct Point {\n DD x, y;\n Point (DD x = 0, DD y = 0): x(x), y(y) {}\n\n Point operator+(const Point &p) const { return Point(*this) += p;}\n Point operator-(const Point &p) const { return Point(*this) -= p;}\n Point operator*(const Point &p) const { return Point(*this) *= p;}\n Point operator*(DD a) const { return Point(*this) *= a;}\n Point operator/(DD a) const { return Point(*this) /= a;}\n Point& operator+=(const Point &p) { x += p.x; y += p.y; return *this;}\n Point& operator-=(const Point &p) { x -= p.x; y -= p.y; return *this;}\n Point& operator*=(const Point &p) { DD u = x*p.x - y*p.y; DD v = x*p.y + y*p.x; x = u; y = v; return *this;}\n Point& operator*=(DD a) { x *= a; y *= a; return *this;}\n Point& operator/=(DD a) { x /= a; y /= a; return *this;}\n bool operator==(const Point &p) const { return !sgn(x - p.x) && !sgn(y - p.y);}\n bool operator!=(const Point &p) const { return sgn(x - p.x) || sgn(y - p.y);}\n bool operator<(const Point &p) const {\n if (sgn(x - p.x)) return sgn(x - p.x) < 0;\n return sgn(y - p.y) < 0;\n }\n friend istream& operator>>(istream& is, Point& p) { is >> p.x >> p.y; return is;}\n friend ostream& operator<<(ostream& os, const Point& p) { os << p.x << \" \" << p.y; return os;}\n\n DD norm() { return x*x + y*y;}\n DD abs() { return sqrt(norm());}\n DD arg() { return atan2(y,x);}\n};\n\n//ベクトル\nusing Vector = Point;\n\ninline DD norm(const Vector &a) { return a.x * a.x + a.y * a.y;}\ninline DD abs(const Vector &a) { return sqrt(norm(a));}\ninline DD dot(const Vector &a, const Vector &b) { return a.x * b.x + a.y * b.y;}\ninline DD cross(const Vector &a, const Vector &b) { return a.x * b.y - a.y * b.x;}\ninline Point rot(const Point &p, DD ang) { return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\ninline Point rot90(const Point &p) { return Point(-p.y, p.x);}\ninline DD arg(const Vector &p) { return atan2(p.y, p.x);}\ninline Vector polar(DD a, DD r) { return Point(cos(r) * a, sin(r) * a);}\n//象限\nint ort(const Point &a) {\n if (sgn(norm(a))) {\n if (sgn(a.y) > 0) return sgn(a.x) > 0 ? 1 : 2;\n return sgn(a.x) > 0 ? 4 : 3;\n }\n return 0;\n}\nbool xsort(const Point &a, const Point &b) {\n if (sgn(a.x - b.x)) return sgn(a.x - b.x) < 0;\n return sgn(a.y - b.y) < 0;\n}\nbool ysort(const Point &a, const Point &b) {\n if (sgn(a.y - b.y)) return sgn(a.y - b.y) < 0;\n return sgn(a.x - b.x) < 0;\n}\n\nbool argsortcross(const Point &a, const Point &b) {\n int ao = ort(a), bo = ort(b);\n if (ao != bo) return ao < bo;\n return sgn(cross(a,b)) > 0;\n}\n\nbool argsortatan2(const Point &a, const Point &b) {\n return sgn(atan2(b.y, b.x) - atan2(a.y, a.x)) > 0;\n}\n\n//線分\nstruct Segment {\n Point p1,p2;\n Segment() {};\n Segment(Point p1, Point p2) : p1(p1),p2(p2) {}\n};\n\n//直線\nusing Line = Segment;\n\n// 円\nstruct Circle {\n Point c;\n DD r;\n Circle(){}\n Circle(Point c, DD r): c(c), r(r) {}\n friend istream& operator >>(istream& is, Circle& C) { is >> C.c >> C.r; return is;}\n friend ostream& operator <<(ostream& os, const Circle& C) { os << C.c << \" \" << C.r; return os;}\n};\n\n//多角形\nusing Polygon = vector<Point>;\n\n//点の進行方向\nint ccw(const Point &p0, const Point &p1, const Point &p2) {\n Vector a = p1 - p0;\n Vector b = p2 - p0;\n if (sgn(cross(a,b)) > 0) return 1; //p0,p1から見てp2は左側(反時計回り)\n if (sgn(cross(a,b)) < 0) return -1; //p0,p1から見てp2は右側(時計回り)\n if (sgn(dot(a,b)) < 0) return 2; //p2-p0-p1の順に一直線上\n if (sgn(norm(b) - norm(a)) > 0) return -2; //p0-p1-p2の順に一直線上\n return 0; //p0-p2-p1の順に一直線上\n}\n\n//直線の交差判定 交差する場合1, 平行な場合0, 同一直線のとき-1\nint intersectLP(const Vector &a, const Vector &b) {\n if (sgn(cross(a,b))) return 1;\n if (sgn(dot(a,b))) return 0;\n return -1;\n} \nint intersectLP(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return intersectLP(p2-p1,p4-p3);}\nint intersectLP(const Line &l1, const Line &l2) {return intersectLP(l1.p1,l1.p2,l2.p1,l2.p2);}\n\n//直線の平行判定\nbool isParallel(const Vector &a, Vector &b) {return intersectLP(a,b) <= 0;}\nbool isParallel(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return intersectLP(p1,p2,p3,p4) <= 0;}\nbool isParallel(const Line &l1, const Line &l2) {return intersectLP(l1,l2) <= 0;}\n\n//直線の直交判定\nbool isOrthogonal(const Vector &a, const Vector &b) {return !sgn(dot(a,b));}\nbool isOrthogonal(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return isOrthogonal(p2-p1,p4-p3);}\nbool isOrthogonal(const Line &l1, const Line &l2) {return isOrthogonal(l1.p1,l1.p2,l2.p1,l2.p2);}\n\n//線分の交差判定\nbool intersectSP(const Point &p1, const Point &p2, const Point &p3, const Point &p4) { return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 && ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);}\nbool intersectSP(const Segment &s1, const Segment &s2) { return intersectSP(s1.p1, s1.p2, s2.p1, s2.p2);}\n\n//直線と線分の交差判定\nbool intersectLSP(const Line &l, const Segment &s) {return ccw(l.p1,l.p2,s.p1)*ccw(l.p1,l.p2,s.p2) <= 0;}\n\n//直線と直線の交点\nPoint getCrossPointLP(const Line &l1, const Line &l2) {\n assert(intersectLP(l1,l2)==1);\n return l1.p1 + (l1.p2-l1.p1)*cross(l2.p1-l1.p1,l2.p2-l2.p1)/cross(l1.p2-l1.p1,l2.p2-l2.p1);\n}\n\n//線分と線分の交点\nPoint getCrossPointSP(const Segment &s1, const Segment &s2) {\n assert(intersectSP(s1,s2));\n return getCrossPointLP(s1,s2);\n}\n\n//射影\nPoint project(const Segment &s, const Point &p) {\n Vector base = s.p2 - s.p1;\n DD r = dot(p - s.p1, base) / norm(base);\n return s.p1 + base * r;\n}\n\n//線対称\nPoint reflect(const Segment &s, const Point &p) {return p + (project(s,p) - p) * 2;}\n\n//点と直線の距離\nDD getDistanceLP(const Line &l, const Point &p) { return abs(cross(l.p2 - l.p1,p - l.p1) / abs(l.p2 - l.p1));}\n\n//点と線分の距離\nDD getDistanceSP(const Segment &s, const Point &p) {\n if (sgn(dot(s.p2 - s.p1,p - s.p1)) < 0) return abs(p - s.p1);\n if (sgn(dot(s.p1 - s.p2,p - s.p2)) < 0) return abs(p - s.p2);\n return getDistanceLP(s, p);\n}\n\n//直線と直線の距離\nDD getDistanceLP(const Line &l1, const Line &l2) {\n if (intersectLP(l1,l2)) return 0;\n return getDistanceLP(l1,l2.p1);\n}\n\n//直線と線分の距離\nDD getDistanceLSP(const Line &l, const Segment &s) {\n if (intersectLSP(l,s)) return 0;\n return min(getDistanceLP(l,s.p1),getDistanceLP(l,s.p2));\n}\n\n//線分と線分の距離\nDD getDistanceSP(const Segment &s1, const Segment &s2) {\n if (intersectSP(s1, s2)) return 0;\n return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2), getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});\n}\n\n//円と直線の交差判定\nbool intersectLP(const Circle &c, const Line &l) { return sgn(getDistanceLP(l, c.c) - c.r) <= 0;}\n//円と線分の交差判定\nbool intersectSP(const Circle &c, const Segment &s) {\n return sgn(getDistanceSP(s,c.c) - c.r) <= 0 && sgn(max(abs(s.p1 - c.c),abs(s.p2 - c.c)) - c.r) >= 0;\n}\n//円と円の交差判定\nint intersect(const Circle &c1, const Circle &c2) {\n if (sgn(abs(c1.c - c2.c) - (c1.r + c2.r)) > 0) return 4; //2つの円が離れている場合\n if (!sgn(abs(c1.c - c2.c) - (c1.r + c2.r))) return 3; //2つの円が外接する場合\n if (sgn(fabs(c1.r - c2.r) - abs(c1.c - c2.c)) > 0) return 0; //一方がもう一方を内包する場合\n if (!sgn(fabs(c1.r - c2.r) - abs(c1.c - c2.c))) return 1; //2つの円が内接する場合\n return 2; //2つの円が交わる場合\n}\n\n//円と直線の交点\npair<Point, Point> getCrossPoints(const Circle &c, const Line &l) {\n assert(intersectLP(c,l));\n Vector pr = project(l, c.c);\n Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);\n DD base = sqrt(c.r * c.r - norm(pr - c.c));\n return make_pair(pr + e * base, pr - e * base);\n}\n\n//円と円の交点\npair<Point, Point> getCrossPoints(const Circle &c1, const Circle &c2) {\n assert(intersect(c1, c2));\n DD d = abs(c1.c - c2.c);\n DD a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (c1.r * d * 2));\n DD t = arg(c2.c - c1.c);\n return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));\n}\n\n//点pを通る円の接線\npair<Line, Line> tangent(const Circle &c, const Point &p) {\n assert(sgn(abs(c.c - p) - c.r) >= 0);\n if (!sgn(abs(c.c - p) - c.r)) {\n Point q = rot90(c.c - p);\n return pair<Line, Line>(Line(p,p+q), Line(p,p+q));\n } \n Circle c2=Circle(p,sqrt(norm(c.c-p)-c.r*c.r));\n auto q = getCrossPoints(c,c2);\n return pair<Line, Line>(Line(p,q.first), Line(p,q.second));\n}\n\n//多角形の面積\nDD area(const Polygon &g) {\n const int N = g.size();\n DD ret = 0;\n for (int i = 0; i < N; ++i) {\n ret += cross(g[i],g[(i+1)%N]);\n }\n return fabs(ret)/2;\n}\n\n//凸性判定\nbool isConvex(const Polygon &g) {\n const int N = g.size();\n for (int i = 0; i < N; ++i) {\n if (ccw(g[i],g[(i+1)%N],g[(i+2)%N]) == -1) return 0;\n }\n return 1;\n}\n\n// 多角形-点の包含判定\nint containment(const Polygon &g, const Point &p) {\n const int N = g.size();\n DD ang = 0;\n for (int i = 0; i < N; i++) {\n if (!ccw(g[i],g[(i+1)%N],p)) return 1; // pがgの辺上に存在する\n ang += atan2(cross(g[(i+1)%N] - p, g[i] - p), dot(g[(i+1)%N] - p, g[i] - p));\n }\n if (sgn(ang)) return 2; // pがgに含まれる\n return 0; // pがgに含まれない\n}\n\n//凸包\nPolygon andrewScan(Polygon s) {\n Polygon u,l;\n const int N = s.size();\n if (N < 3) return s;\n sort(s.begin(), s.end(), xsort);\n u.emplace_back(s[0]);\n u.emplace_back(s[1]);\n l.emplace_back(s[N-1]);\n l.emplace_back(s[N-2]);\n \n for (int i = 2; i < s.size(); ++i) {\n // 凸包上の点も含めるなら ccw() == 1 含めないなら ccw() != -1\n for (int n = u.size(); n >= 2 && ccw(u[n-2],u[n-1],s[i]) != -1; --n) {\n u.pop_back();\n }\n u.emplace_back(s[i]);\n }\n\n for (int i = N - 3; i >= 0; --i) {\n // 凸包上の点も含めるなら ccw() == 1 含めないなら ccw() != -1\n for (int n = l.size(); n >= 2 && ccw(l[n-2], l[n-1], s[i]) != -1; --n) {\n l.pop_back();\n }\n l.emplace_back(s[i]);\n }\n\n reverse(l.begin(), l.end());\n for (int i = u.size() - 2; i >= 1; --i) l.emplace_back(u[i]);\n\n return l;\n}\n\n//最遠点対\nDD farthestpointpair(const Polygon &g) {\n const int N = g.size();\n if (N == 2) return abs(g[1] - g[0]);\n int i = 0, j = 0;\n for (int k = 0; k < N; ++k) {\n if (g[k].y > g[i].y) i = k;\n if (g[k].y < g[j].y) j = k;\n }\n\n DD ret = 0;\n int si = i, sj = j;\n while (i != sj || j != si) {\n ret = max(ret, abs(g[i]-g[j]));\n if (sgn(cross(g[(i+1)%N] - g[i], g[(j+1)%N] - g[j])) < 0) {\n ++i;\n if (i == N) i = 0;\n } else {\n ++j;\n if (j == N) j = 0;\n }\n }\n\n return ret;\n}\n\nvoid solve() {\n int N; cin >> N;\n Polygon P(N);\n rep(i,N) cin >> P[i];\n\n if (N <= 2) {\n cout << \"Yes\" << ln;\n return;\n }\n\n vector<pii> arr = {pii(0,1),pii(1,2),pii(2,0)};\n for (auto &[a,b] : arr) {\n Line l = Line(P[a],P[b]);\n Polygon Q;\n rep(i,N) {\n if (sgn(getDistanceLP(l,P[i])) == 0) continue;\n Q.emplace_back(P[i]);\n }\n if (int(Q.size()) <= 1) {\n cout << \"Yes\" << ln;\n return;\n }\n Line s = Line(Q[0],Q[1]);\n if (intersectLP(l,s)) continue;\n bool ok = true;\n for (auto &p : Q) {\n if (sgn(getDistanceLP(s,p))) ok = false; \n }\n if (ok) {\n cout << \"Yes\" << ln;\n return;\n }\n }\n\n cout << \"No\" << ln;\n}\n\nint main() {\n int Q; cin >> Q;\n while (Q--) {\n solve();\n }\n}","accuracy":1,"time_ms":240,"memory_kb":5532,"score_of_the_acc":-1.2584,"final_rank":11},{"submission_id":"aoj_3167_4894931","code_snippet":"#ifdef ONLINE_JUDGE\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing pii = pair<int, int>;\nusing pll = pair<long long, long long>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\n#define all(x) (x).begin(),(x).end()\nconstexpr char ln = '\\n';\nistream& operator>>(istream& is, __int128_t &x) {\n x = 0;\n string s;\n is >> s;\n int n = int(s.size()), it = 0;\n if (s[0] == '-') it++;\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\n if (s[0] == '-') x = -x;\n return is;\n}\nostream& operator<<(ostream& os, __int128_t x) {\n if (x == 0) return os << 0;\n if (x < 0) os << '-', x = -x;\n deque<int> deq;\n while (x) deq.emplace_front(x % 10), x /= 10;\n for (int e : deq) os << e;\n return os;\n}\ntemplate<class T1, class T2>\nostream& operator<<(ostream& os, const pair<T1, T2>& p) {\n return os << \"(\" << p.first << \", \" << p.second << \")\";\n}\ntemplate<class T> \nostream& operator<<(ostream& os, const vector<T>& v) {\n os << \"[\";\n for(auto e : v) os << e << \", \";\n return os << \"]\";\n}\ntemplate<class Container> inline int SZ(Container& v) {return int(v.size());}\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\ninline int topbit(int x) {return x == 0 ? -1 : 31 - __builtin_clz(x);}\ninline int topbit(long long x) {return x == 0 ? -1 : 63 - __builtin_clzll(x);}\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\ninline int popcount(int x) {return __builtin_popcount(x);}\ninline int popcount(long long x) {return __builtin_popcountll(x);}\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\ninline constexpr long long TEN(int x) {return x == 0 ? 1 : TEN(x-1) * 10;}\nnamespace detail {\n template<typename Tp, int Nb>\n auto make_vector(vector<int>& sizes, Tp const& x) {\n if constexpr (Nb == 1) {\n return vector(sizes[0], x);\n } else {\n int size = sizes[Nb-1];\n sizes.pop_back();\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\n }\n }\n}\ntemplate<typename Tp, int Nb>\nauto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {\n vector<int> s(Nb);\n for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];\n return detail::make_vector<Tp, Nb>(s, x);\n}\ninline void print() {cout << \"\\n\";}\ntemplate<class T>\ninline void print(const vector<T>& v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \" \";\n print();\n}\ntemplate<class T, class... Args>\ninline void print(const T &x, const Args &... args) {\n cout << x << \" \";\n print(args...);\n}\n#ifdef MINATO_LOCAL\n#define dump(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\ninline void debug() {cerr << endl;}\ntemplate<class T>\ninline void debug(const vector<T> &v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \" \";\n debug();\n}\ntemplate<class T, class... Args>\ninline void debug(const T &x, const Args &... args) {\n cerr << x << \" \";\n debug(args...);\n}\n#else\n#define dump(x) void(0)\ninline void debug() {}\ntemplate<class T> inline void debug(const vector<T> &v) {}\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\n#endif\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\n// 精度が足りないときはlong double\nusing DD = double;\nconstexpr DD EPS = 1e-11;\nconst DD PI = acos(DD(-1));\ninline int sgn(DD a) {return (a < -EPS) ? -1 : (a > EPS) ? 1 : 0;}\n\n//点\nstruct Point {\n DD x, y;\n Point (DD x = 0, DD y = 0): x(x), y(y) {}\n\n Point operator+(const Point &p) const { return Point(*this) += p;}\n Point operator-(const Point &p) const { return Point(*this) -= p;}\n Point operator*(const Point &p) const { return Point(*this) *= p;}\n Point operator*(DD a) const { return Point(*this) *= a;}\n Point operator/(DD a) const { return Point(*this) /= a;}\n Point& operator+=(const Point &p) { x += p.x; y += p.y; return *this;}\n Point& operator-=(const Point &p) { x -= p.x; y -= p.y; return *this;}\n Point& operator*=(const Point &p) { DD u = x*p.x - y*p.y; DD v = x*p.y + y*p.x; x = u; y = v; return *this;}\n Point& operator*=(DD a) { x *= a; y *= a; return *this;}\n Point& operator/=(DD a) { x /= a; y /= a; return *this;}\n bool operator==(const Point &p) const { return !sgn(x - p.x) && !sgn(y - p.y);}\n bool operator!=(const Point &p) const { return sgn(x - p.x) || sgn(y - p.y);}\n bool operator<(const Point &p) const {\n if (sgn(x - p.x)) return sgn(x - p.x) < 0;\n return sgn(y - p.y) < 0;\n }\n friend istream& operator>>(istream& is, Point& p) { is >> p.x >> p.y; return is;}\n friend ostream& operator<<(ostream& os, const Point& p) { os << p.x << \" \" << p.y; return os;}\n\n DD norm() { return x*x + y*y;}\n DD abs() { return sqrt(norm());}\n DD arg() { return atan2(y,x);}\n};\n\n//ベクトル\nusing Vector = Point;\n\ninline DD norm(const Vector &a) { return a.x * a.x + a.y * a.y;}\ninline DD abs(const Vector &a) { return sqrt(norm(a));}\ninline DD dot(const Vector &a, const Vector &b) { return a.x * b.x + a.y * b.y;}\ninline DD cross(const Vector &a, const Vector &b) { return a.x * b.y - a.y * b.x;}\ninline Point rot(const Point &p, DD ang) { return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\ninline Point rot90(const Point &p) { return Point(-p.y, p.x);}\ninline DD arg(const Vector &p) { return atan2(p.y, p.x);}\ninline Vector polar(DD a, DD r) { return Point(cos(r) * a, sin(r) * a);}\n//象限\nint ort(const Point &a) {\n if (sgn(norm(a))) {\n if (sgn(a.y) > 0) return sgn(a.x) > 0 ? 1 : 2;\n return sgn(a.x) > 0 ? 4 : 3;\n }\n return 0;\n}\nbool xsort(const Point &a, const Point &b) {\n if (sgn(a.x - b.x)) return sgn(a.x - b.x) < 0;\n return sgn(a.y - b.y) < 0;\n}\nbool ysort(const Point &a, const Point &b) {\n if (sgn(a.y - b.y)) return sgn(a.y - b.y) < 0;\n return sgn(a.x - b.x) < 0;\n}\n\nbool argsortcross(const Point &a, const Point &b) {\n int ao = ort(a), bo = ort(b);\n if (ao != bo) return ao < bo;\n return sgn(cross(a,b)) > 0;\n}\n\nbool argsortatan2(const Point &a, const Point &b) {\n return sgn(atan2(b.y, b.x) - atan2(a.y, a.x)) > 0;\n}\n\n//線分\nstruct Segment {\n Point p1,p2;\n Segment() {};\n Segment(Point p1, Point p2) : p1(p1),p2(p2) {}\n};\n\n//直線\nusing Line = Segment;\n\n// 円\nstruct Circle {\n Point c;\n DD r;\n Circle(){}\n Circle(Point c, DD r): c(c), r(r) {}\n friend istream& operator >>(istream& is, Circle& C) { is >> C.c >> C.r; return is;}\n friend ostream& operator <<(ostream& os, const Circle& C) { os << C.c << \" \" << C.r; return os;}\n};\n\n//多角形\nusing Polygon = vector<Point>;\n\n//点の進行方向\nint ccw(const Point &p0, const Point &p1, const Point &p2) {\n Vector a = p1 - p0;\n Vector b = p2 - p0;\n if (sgn(cross(a,b)) > 0) return 1; //p0,p1から見てp2は左側(反時計回り)\n if (sgn(cross(a,b)) < 0) return -1; //p0,p1から見てp2は右側(時計回り)\n if (sgn(dot(a,b)) < 0) return 2; //p2-p0-p1の順に一直線上\n if (sgn(norm(b) - norm(a)) > 0) return -2; //p0-p1-p2の順に一直線上\n return 0; //p0-p2-p1の順に一直線上\n}\n\n//直線の交差判定 交差する場合1, 平行な場合0, 同一直線のとき-1\nint intersectLP(const Vector &a, const Vector &b) {\n if (sgn(cross(a,b))) return 1;\n if (sgn(dot(a,b))) return 0;\n return -1;\n} \nint intersectLP(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return intersectLP(p2-p1,p4-p3);}\nint intersectLP(const Line &l1, const Line &l2) {return intersectLP(l1.p1,l1.p2,l2.p1,l2.p2);}\n\n//直線の平行判定\nbool isParallel(const Vector &a, Vector &b) {return intersectLP(a,b) <= 0;}\nbool isParallel(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return intersectLP(p1,p2,p3,p4) <= 0;}\nbool isParallel(const Line &l1, const Line &l2) {return intersectLP(l1,l2) <= 0;}\n\n//直線の直交判定\nbool isOrthogonal(const Vector &a, const Vector &b) {return !sgn(dot(a,b));}\nbool isOrthogonal(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return isOrthogonal(p2-p1,p4-p3);}\nbool isOrthogonal(const Line &l1, const Line &l2) {return isOrthogonal(l1.p1,l1.p2,l2.p1,l2.p2);}\n\n//線分の交差判定\nbool intersectSP(const Point &p1, const Point &p2, const Point &p3, const Point &p4) { return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 && ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);}\nbool intersectSP(const Segment &s1, const Segment &s2) { return intersectSP(s1.p1, s1.p2, s2.p1, s2.p2);}\n\n//直線と線分の交差判定\nbool intersectLSP(const Line &l, const Segment &s) {return ccw(l.p1,l.p2,s.p1)*ccw(l.p1,l.p2,s.p2) <= 0;}\n\n//直線と直線の交点\nPoint getCrossPointLP(const Line &l1, const Line &l2) {\n assert(intersectLP(l1,l2)==1);\n return l1.p1 + (l1.p2-l1.p1)*cross(l2.p1-l1.p1,l2.p2-l2.p1)/cross(l1.p2-l1.p1,l2.p2-l2.p1);\n}\n\n//線分と線分の交点\nPoint getCrossPointSP(const Segment &s1, const Segment &s2) {\n assert(intersectSP(s1,s2));\n return getCrossPointLP(s1,s2);\n}\n\n//射影\nPoint project(const Segment &s, const Point &p) {\n Vector base = s.p2 - s.p1;\n DD r = dot(p - s.p1, base) / norm(base);\n return s.p1 + base * r;\n}\n\n//線対称\nPoint reflect(const Segment &s, const Point &p) {return p + (project(s,p) - p) * 2;}\n\n//点と直線の距離\nDD getDistanceLP(const Line &l, const Point &p) { return abs(cross(l.p2 - l.p1,p - l.p1) / abs(l.p2 - l.p1));}\n\n//点と線分の距離\nDD getDistanceSP(const Segment &s, const Point &p) {\n if (sgn(dot(s.p2 - s.p1,p - s.p1)) < 0) return abs(p - s.p1);\n if (sgn(dot(s.p1 - s.p2,p - s.p2)) < 0) return abs(p - s.p2);\n return getDistanceLP(s, p);\n}\n\n//直線と直線の距離\nDD getDistanceLP(const Line &l1, const Line &l2) {\n if (intersectLP(l1,l2)) return 0;\n return getDistanceLP(l1,l2.p1);\n}\n\n//直線と線分の距離\nDD getDistanceLSP(const Line &l, const Segment &s) {\n if (intersectLSP(l,s)) return 0;\n return min(getDistanceLP(l,s.p1),getDistanceLP(l,s.p2));\n}\n\n//線分と線分の距離\nDD getDistanceSP(const Segment &s1, const Segment &s2) {\n if (intersectSP(s1, s2)) return 0;\n return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2), getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});\n}\n\n//円と直線の交差判定\nbool intersectLP(const Circle &c, const Line &l) { return sgn(getDistanceLP(l, c.c) - c.r) <= 0;}\n//円と線分の交差判定\nbool intersectSP(const Circle &c, const Segment &s) {\n return sgn(getDistanceSP(s,c.c) - c.r) <= 0 && sgn(max(abs(s.p1 - c.c),abs(s.p2 - c.c)) - c.r) >= 0;\n}\n//円と円の交差判定\nint intersect(const Circle &c1, const Circle &c2) {\n if (sgn(abs(c1.c - c2.c) - (c1.r + c2.r)) > 0) return 4; //2つの円が離れている場合\n if (!sgn(abs(c1.c - c2.c) - (c1.r + c2.r))) return 3; //2つの円が外接する場合\n if (sgn(fabs(c1.r - c2.r) - abs(c1.c - c2.c)) > 0) return 0; //一方がもう一方を内包する場合\n if (!sgn(fabs(c1.r - c2.r) - abs(c1.c - c2.c))) return 1; //2つの円が内接する場合\n return 2; //2つの円が交わる場合\n}\n\n//円と直線の交点\npair<Point, Point> getCrossPoints(const Circle &c, const Line &l) {\n assert(intersectLP(c,l));\n Vector pr = project(l, c.c);\n Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);\n DD base = sqrt(c.r * c.r - norm(pr - c.c));\n return make_pair(pr + e * base, pr - e * base);\n}\n\n//円と円の交点\npair<Point, Point> getCrossPoints(const Circle &c1, const Circle &c2) {\n assert(intersect(c1, c2));\n DD d = abs(c1.c - c2.c);\n DD a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (c1.r * d * 2));\n DD t = arg(c2.c - c1.c);\n return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));\n}\n\n//点pを通る円の接線\npair<Line, Line> tangent(const Circle &c, const Point &p) {\n assert(sgn(abs(c.c - p) - c.r) >= 0);\n if (!sgn(abs(c.c - p) - c.r)) {\n Point q = rot90(c.c - p);\n return pair<Line, Line>(Line(p,p+q), Line(p,p+q));\n } \n Circle c2=Circle(p,sqrt(norm(c.c-p)-c.r*c.r));\n auto q = getCrossPoints(c,c2);\n return pair<Line, Line>(Line(p,q.first), Line(p,q.second));\n}\n\n//多角形の面積\nDD area(const Polygon &g) {\n const int N = g.size();\n DD ret = 0;\n for (int i = 0; i < N; ++i) {\n ret += cross(g[i],g[(i+1)%N]);\n }\n return fabs(ret)/2;\n}\n\n//凸性判定\nbool isConvex(const Polygon &g) {\n const int N = g.size();\n for (int i = 0; i < N; ++i) {\n if (ccw(g[i],g[(i+1)%N],g[(i+2)%N]) == -1) return 0;\n }\n return 1;\n}\n\n// 多角形-点の包含判定\nint containment(const Polygon &g, const Point &p) {\n const int N = g.size();\n DD ang = 0;\n for (int i = 0; i < N; i++) {\n if (!ccw(g[i],g[(i+1)%N],p)) return 1; // pがgの辺上に存在する\n ang += atan2(cross(g[(i+1)%N] - p, g[i] - p), dot(g[(i+1)%N] - p, g[i] - p));\n }\n if (sgn(ang)) return 2; // pがgに含まれる\n return 0; // pがgに含まれない\n}\n\n//凸包\nPolygon andrewScan(Polygon s) {\n Polygon u,l;\n const int N = s.size();\n if (N < 3) return s;\n sort(s.begin(), s.end(), xsort);\n u.emplace_back(s[0]);\n u.emplace_back(s[1]);\n l.emplace_back(s[N-1]);\n l.emplace_back(s[N-2]);\n \n for (int i = 2; i < s.size(); ++i) {\n // 凸包上の点も含めるなら ccw() == 1 含めないなら ccw() != -1\n for (int n = u.size(); n >= 2 && ccw(u[n-2],u[n-1],s[i]) != -1; --n) {\n u.pop_back();\n }\n u.emplace_back(s[i]);\n }\n\n for (int i = N - 3; i >= 0; --i) {\n // 凸包上の点も含めるなら ccw() == 1 含めないなら ccw() != -1\n for (int n = l.size(); n >= 2 && ccw(l[n-2], l[n-1], s[i]) != -1; --n) {\n l.pop_back();\n }\n l.emplace_back(s[i]);\n }\n\n reverse(l.begin(), l.end());\n for (int i = u.size() - 2; i >= 1; --i) l.emplace_back(u[i]);\n\n return l;\n}\n\n//最遠点対\nDD farthestpointpair(const Polygon &g) {\n const int N = g.size();\n if (N == 2) return abs(g[1] - g[0]);\n int i = 0, j = 0;\n for (int k = 0; k < N; ++k) {\n if (g[k].y > g[i].y) i = k;\n if (g[k].y < g[j].y) j = k;\n }\n\n DD ret = 0;\n int si = i, sj = j;\n while (i != sj || j != si) {\n ret = max(ret, abs(g[i]-g[j]));\n if (sgn(cross(g[(i+1)%N] - g[i], g[(j+1)%N] - g[j])) < 0) {\n ++i;\n if (i == N) i = 0;\n } else {\n ++j;\n if (j == N) j = 0;\n }\n }\n\n return ret;\n}\n\nvoid solve() {\n int N; cin >> N;\n Polygon P(N);\n rep(i,N) cin >> P[i];\n\n if (N <= 2) {\n cout << \"Yes\" << ln;\n return;\n }\n\n vector<pii> arr = {pii(0,1),pii(1,2),pii(2,0)};\n for (auto &[a,b] : arr) {\n Line l = Line(P[a],P[b]);\n Polygon Q;\n rep(i,N) {\n if (sgn(getDistanceLP(l,P[i])) == 0) continue;\n Q.emplace_back(P[i]);\n }\n if (int(Q.size()) <= 1) {\n cout << \"Yes\" << ln;\n return;\n }\n Line s = Line(Q[0],Q[1]);\n if (intersectLP(l,s)) continue;\n bool ok = true;\n for (auto &p : Q) {\n if (sgn(getDistanceLP(s,p))) ok = false; \n }\n if (ok) {\n cout << \"Yes\" << ln;\n return;\n }\n }\n\n cout << \"No\" << ln;\n}\n\nint main() {\n int Q; cin >> Q;\n while (Q--) {\n solve();\n }\n}","accuracy":0.8846153846153846,"time_ms":230,"memory_kb":4312,"score_of_the_acc":-0.7484,"final_rank":17},{"submission_id":"aoj_3167_4880252","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nbool isheiko(long long dx1, long long dy1, long long dx2, long long dy2) {\n return dx1 * dy2 == dy1 * dx2;\n}\n\nbool solve(const vector<long long> &x, const vector<long long> &y) {\n int N = (int)x.size();\n if (N <= 3) return true;\n int k = -1;\n for (int i = 2; i < N; ++i) {\n if (!isheiko(x[i]-x[0], y[i]-y[0], x[1]-x[0], y[1]-y[0])) k = i;\n }\n if (k == -1) return true;\n\n vector<long long> ax = {x[0], x[1], x[k]}, ay = {y[0], y[1], y[k]};\n for (int iter = 0; iter < 3; ++iter) {\n long long dx = ax[(iter+2)%3] - ax[(iter+1)%3];\n long long dy = ay[(iter+2)%3] - ay[(iter+1)%3];\n bool ok = true;\n for (int i = 0; i < N; ++i) {\n if (!isheiko(x[i]-ax[iter], y[i]-ay[iter], dx, dy) &&\n !isheiko(x[i]-ax[(iter+1)%3], y[i]-ay[(iter+1)%3], dx, dy))\n ok = false;\n }\n if (ok) return true;\n }\n return false;\n}\n\nint main() {\n int T; cin >> T;\n while (T--) {\n int N; cin >> N;\n vector<long long> x(N), y(N);\n for (int i = 0; i < N; ++i) cin >> x[i] >> y[i];\n if (solve(x, y)) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n }\n}","accuracy":1,"time_ms":390,"memory_kb":3396,"score_of_the_acc":-0.6014,"final_rank":6},{"submission_id":"aoj_3167_4880049","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <limits>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <vector>\n#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))\n#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))\n#define sz(x) int(x.size())\nusing namespace std;\ntemplate <class T>\nvoid setmax(T &a, T const &b) {\n if (a < b) a = b;\n}\n\ntemplate <class T>\nvoid setmin(T &a, T const &b) {\n if (a > b) a = b;\n}\n\ntemplate <typename T, typename X>\nauto vectors(T a, X x) { return vector<T>(x, a); }\n\ntemplate <typename T, typename X, typename Y, typename... Zs>\nauto vectors(T a, X x, Y y, Zs... zs) {\n auto cont = vectors(a, y, zs...);\n return vector<decltype(cont)>(x, cont);\n}\n\ntemplate <typename T>\nT cross(T a, T b, T c, T d) {\n return a * d - b * c;\n}\n\nint main() {\n int T;\n cin >> T;\n vector<int> gp(20010);\n while (T--) {\n int N;\n cin >> N;\n vector<long long> x(N), y(N);\n repeat(i, N) cin >> x[i] >> y[i];\n if (N <= 3) {\n cout << \"Yes\" << endl;\n continue;\n }\n bool flg = false;\n repeat(i, 3) {\n repeat(j, N) gp[j] = 0;\n // 方向ベクトル i -> (i + 1)%3\n int f1 = i;\n int t1 = (i + 1) % 3;\n int num1 = 2, num2 = 0;\n gp[f1] = gp[t1] = 1;\n repeat(j, N) {\n if (gp[j]) continue;\n // (x[t1] - x[f1], y[t1] - y[f1]) cross (x[j] - x[f1], y[j] - y[f1])\n if (cross(x[t1] - x[f1], y[t1] - y[f1], x[j] - x[f1], y[j] - y[f1]) == 0LL) {\n gp[j] = 1;\n ++num1;\n }\n }\n int f2 = -1;\n int t2 = -1;\n repeat(j, N) {\n if (gp[j]) continue;\n if (f2 == -1) {\n f2 = j;\n gp[j] = 2;\n ++num2;\n } else if (t2 == -1) {\n t2 = j;\n gp[j] = 2;\n ++num2;\n } else {\n assert(f2 != -1 && t2 != -1);\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[t1] - x[f1], y[t1] - y[f1]) != 0LL) {\n break;\n }\n // (x[t2] - x[f2], y[t2] - y[f2]) cross (x[j] - x[f2], y[j] - y[f2])\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[j] - x[f2], y[j] - y[f2]) == 0LL) {\n gp[j] = 2;\n ++num2;\n }\n }\n }\n if (num1 + num2 == N) {\n if (t2 == -1 || f2 == -1) {\n flg = true;\n break;\n }\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[t1] - x[f1], y[t1] - y[f1]) == 0LL) {\n flg = true;\n break;\n }\n }\n }\n if (flg)\n cout << \"Yes\" << endl;\n else\n cout << \"No\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":340,"memory_kb":3440,"score_of_the_acc":-0.5488,"final_rank":5},{"submission_id":"aoj_3167_4880045","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <limits>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <vector>\n#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))\n#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))\n#define sz(x) int(x.size())\nusing namespace std;\ntemplate <class T>\nvoid setmax(T &a, T const &b) {\n if (a < b) a = b;\n}\n\ntemplate <class T>\nvoid setmin(T &a, T const &b) {\n if (a > b) a = b;\n}\n\ntemplate <typename T, typename X>\nauto vectors(T a, X x) { return vector<T>(x, a); }\n\ntemplate <typename T, typename X, typename Y, typename... Zs>\nauto vectors(T a, X x, Y y, Zs... zs) {\n auto cont = vectors(a, y, zs...);\n return vector<decltype(cont)>(x, cont);\n}\n\ntemplate <typename T>\nT cross(T a, T b, T c, T d) {\n return a * d - b * c;\n}\n\nint main() {\n int T;\n cin >> T;\n vector<int> gp(20010);\n while (T--) {\n int N;\n cin >> N;\n vector<long long> x(N), y(N);\n repeat(i, N) cin >> x[i] >> y[i];\n if (N <= 3) {\n cout << \"Yes\" << endl;\n continue;\n }\n bool flg = false;\n repeat(i, 3) {\n repeat(j, N) gp[j] = 0;\n // 方向ベクトル i -> (i + 1)%3\n int f1 = i;\n int t1 = (i + 1) % 3;\n int num1 = 2, num2 = 0;\n gp[f1] = gp[t1] = 1;\n repeat(j, N) {\n if (gp[j]) continue;\n // (x[t1] - x[f1], y[t1] - y[f1]) cross (x[j] - x[f1], y[j] - y[f1])\n if (cross(x[t1] - x[f1], y[t1] - y[f1], x[j] - x[f1], y[j] - y[f1]) == 0LL) {\n gp[j] = 1;\n ++num1;\n }\n }\n int f2 = -1;\n int t2 = -1;\n repeat(j, N) {\n if (gp[j]) continue;\n if (f2 == -1) {\n f2 = j;\n gp[j] = 2;\n ++num2;\n } else if (t2 == -1) {\n t2 = j;\n gp[j] = 2;\n ++num2;\n } else {\n assert(f2 != -1 && t2 != -1);\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[t1] - x[f1], y[t1] - y[f1]) != 0LL) {\n break;\n }\n // (x[t2] - x[f2], y[t2] - y[f2]) cross (x[j] - x[f2], y[j] - y[f2])\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[j] - x[f2], y[j] - y[f2]) == 0LL) {\n gp[j] = 2;\n ++num2;\n }\n }\n }\n if (num1 + num2 == N) {\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[t1] - x[f1], y[t1] - y[f1]) == 0LL) {\n flg = true;\n }\n }\n }\n if (flg)\n cout << \"Yes\" << endl;\n else\n cout << \"No\" << endl;\n }\n return 0;\n}","accuracy":0.7692307692307693,"time_ms":340,"memory_kb":3464,"score_of_the_acc":-0.5586,"final_rank":20},{"submission_id":"aoj_3167_4877418","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\nvector<string> ans;\nstruct Q{int s,b;};\nvoid update(Q &a){\n if(a.b==0&&a.s==0)return;\n int g=__gcd(abs(a.b),abs(a.s));\n a.b/=g;a.s/=g;\n if(a.b<0)a.s*=-1,a.b*=-1;\n if(a.b==0)a.s=abs(a.s);\n}\nbool same(Q &a,Q &b){\n update(a);update(b);\n return a.s==b.s&&a.b==b.b;\n}\n\nstring solve(){\n int n;cin>>n;\n vector<int> x(n),y(n);\n for(int i=0;i<n;i++)cin>>x[i]>>y[i];\n set<int> S;for(int p:x)S.insert(p);if(S.size()<=2)return \"Yes\";\n for(int _=0;_<1000;_++){\n int s=rand()%n,t=rand()%n;\n while(x[s]==x[t])(++t)%=n;\n //cout<<x[s]<<\" \"<<y[s]<<\" \"<<x[t]<<\" \"<<y[t]<<endl;\n Q slope={y[s]-y[t],x[s]-x[t]};update(slope);\n Q se1,se2;\n se2={0,0};update(se2);//cout<<\"SSS\"<<se2.b<<\" \"<<se2.s<<endl;\n se1={x[s]*y[t]-x[t]*y[s],x[s]-x[t]};update(se1);\n int out=0;\n for(int i=0;i<n&&!out;i++){\n Q tmp={slope.b*y[i]-slope.s*x[i],slope.b};update(tmp);\n if(same(tmp,se1)||same(tmp,se2))continue;\n if(!se2.s&&!se2.b)se2=tmp;\n else out=1;\n }\n //if(!out)cout<<x[s]<<\" \"<<y[s]<<\" \"<<x[t]<<\" \"<<y[t]<<\" \"<<se1.b<<\" \"<<se1.s<<\" \"<<se2.b<<\" \"<<se2.s<<endl;\n if(!out)return \"Yes\";\n }\n return \"No\";\n}\n\nsigned main(){\n int t;cin>>t;\n while(t--)ans.push_back(solve());\n for(auto p:ans)cout<<p<<endl;\n}","accuracy":1,"time_ms":740,"memory_kb":4500,"score_of_the_acc":-1.5431,"final_rank":14},{"submission_id":"aoj_3167_4877374","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ld=long double;\nstruct line{ld a,b;};//y=ax+b\n\nbool same(ld x,ld y){\n return abs(x-y)<1e-1;\n}\n\nline f(ld x1,ld y1,ld x2,ld y2){//2点を通る直線\n return {(y1-y2)/(x1-x2),(y2*x1-y1*x2)/(x1-x2)};\n}\nline g(ld x1,ld y1,ld x2,ld y2,ld x3,ld y3){\n ld a=f(x2,y2,x3,y3).a;\n return {a,(y1+y2)/2.0-a*(x1+x2)/2.0};\n}\n\nld d(line A,ld x,ld y){//直線と点の距離\n return abs(A.a*x-y+A.b)/sqrt(A.a*A.a+1.0);\n}\n\nbool check1(vector<ld> &x,vector<ld> &y){\n line a=f((x[1]+x[2])/2.0,(y[1]+y[2])/2.0,(x[0]+x[2])/2.0,(y[0]+y[2])/2.0);\n ld D=d(a,x[0],y[0]);\n for(int i=0;i<x.size();i++)if(!same(d(a,x[i],y[i]),D))return false;\n return true;\n}\n\nbool check2(vector<ld> &x,vector<ld> &y){\n line a=g(x[0],y[0],x[2],y[2],x[1],y[1]);\n ld D=d(a,x[0],y[0]);\n for(int i=0;i<x.size();i++)if(!same(d(a,x[i],y[i]),D))return false;\n return true;\n}\n\nstring solve(){\n int n;cin>>n;\n vector<ld> x(n),y(n);\n for(int i=0;i<n;i++)cin>>x[i]>>y[i];\n if(n<=3)return \"Yes\";\n\n set<int> XX;\n for(ld p:x)XX.insert(round(p));\n if(XX.size()<=2)return \"Yes\";\n\n int cnt=0;\n\n AHAHA:\n assert(++cnt<=1000);\n for(int i=2;i<n&&same(x[0],x[1]);i++)\n if(!same(x[i],x[0])){\n swap(x[i],x[1]);\n swap(y[i],y[1]);\n }\n for(int i=3;i<n&&(same(x[0],x[2])||same(x[1],x[2]));i++)\n if(!same(x[i],x[0])&&!same(x[i],x[1])){\n swap(x[i],x[2]);\n swap(y[i],y[2]);\n }\n\n line A=f(x[0],y[0],x[1],y[1]);\n bool F=true;\n for(int i=2;i<n;i++)\n if(!same(A.a*x[i]+A.b,y[i])){\n F=false;\n if(!same(x[0],x[i])&&!same(x[1],x[i])){\n swap(x[i],x[2]);\n swap(y[i],y[2]);\n }\n }\n if(F)return \"Yes\";\n if(same(A.a*x[2]+A.b,y[2])){\n int aa=rand()%(n-2)+2,bb=rand()%(n-2)+2;\n swap(x[0],x[aa]);swap(y[0],y[aa]);\n swap(x[1],x[bb]);swap(y[1],y[bb]);\n goto AHAHA;\n }\n\n if(check1(x,y)||check2(x,y))return \"Yes\";\n swap(x[2],x[1]);swap(y[2],y[1]);\n if(check1(x,y)||check2(x,y))return \"Yes\";\n swap(x[2],x[0]);swap(y[2],y[0]);\n if(check1(x,y)||check2(x,y))return \"Yes\";\n return \"No\";\n}\n\nint main(){\n int t;cin>>t;\n vector<string> ans;\n while(t--)ans.push_back(solve());\n for(string p:ans)cout<<p<<endl;\n}","accuracy":0.8846153846153846,"time_ms":710,"memory_kb":5148,"score_of_the_acc":-1.7643,"final_rank":19}],"string":"[\n {\n \"submission_id\": \"aoj_3167_10760592\",\n \"code_snippet\": \"// AOJ #3167 Many Points\\n// 2025.4.7\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() {\\n\\tint n = 0; int c = gc();\\n\\tif (c == '-') {\\tc = gc();\\n\\t\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\t\\treturn -n;\\n\\t}\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nvoid Couts(const string &s) { for (char c : s) pc(c); pc('\\\\n'); }\\n\\nstruct P { ll x, y; };\\nP diff(const P &p, const P &q) { return {q.x - p.x, q.y - p.y}; }\\nll cross(ll ax, ll ay, ll bx, ll by) { return ax * by - ay * bx; }\\n\\nint main(){\\n int T = Cin();\\n while(T--){\\n int n = Cin();\\n vector<P> pts(n);\\n for (int i=0; i<n; i++) pts[i].x = Cin(), pts[i].y = Cin();\\n if(n <= 2) { Couts(\\\"Yes\\\"); continue; }\\n\\n bool col = true;\\n P d0 = diff(pts[0], pts[1]);\\n for (int i=2; i<n; i++){\\n P d1 = diff(pts[0], pts[i]);\\n if(cross(d0.x, d0.y, d1.x, d1.y) != 0){\\n col = false;\\n break;\\n }\\n }\\n if(col) { Couts(\\\"Yes\\\"); continue; }\\n\\n bool ok = false;\\n int lim = min(n, 10);\\n for (int i = 0; i < lim && !ok; i++){\\n for (int j = i+1; j < lim && !ok; j++){\\n ll dx = pts[j].x - pts[i].x;\\n ll dy = pts[j].y - pts[i].y;\\n for (int k = 0; k < 2 && !ok; k++){\\n ll cx, cy;\\n if(k == 0){ cx = dx; cy = dy; }\\n else { cx = dy; cy = -dx; }\\n if(cx == 0 && cy == 0) continue;\\n unordered_set<ll> S;\\n S.reserve(n*2);\\n for(auto &p : pts){\\n ll f = cx * p.x + cy * p.y;\\n S.insert(f);\\n if(S.size() > 2) break;\\n }\\n if(S.size() <= 2){\\n ok = true;\\n break;\\n }\\n }\\n }\\n }\\n Couts(ok? \\\"Yes\\\": \\\"No\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.3268,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3167_7975392\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\nconst int mod = 998244353;\\nconst int inf = (1<<30);\\n\\nconst int dy[4] = {-1,0,0,1};\\nconst int dx[4] = {0,-1,1,0};\\n\\n#define double long double\\n#define equals(a,b) (fabs((a)-(b)) < EPS)\\n\\nnamespace geometry {\\n const double EPS = 1e-10;\\n const double PI = asinl(1) * 2;\\n\\n struct Point {\\n double x,y;\\n Point(){}\\n Point(double x, double y):x(x),y(y){}\\n Point operator+(Point p) {return Point(x+p.x,y+p.y);}\\n Point operator-(Point p) {return Point(x-p.x,y-p.y);}\\n Point operator*(double k) {return Point(x*k,y*k);}\\n Point operator/(double k) {return Point(x/k,y/k);}\\n double norm() {return x*x+y*y;}\\n double abs() {return sqrt(norm());}\\n\\n bool operator<(const Point &p) const {\\n return x!=p.x ? x<p.x : x<p.y;\\n }\\n\\n bool operator==(const Point &p) const {\\n return fabs(x-p.x) < EPS and fabs(y-p.y) < EPS;\\n }\\n };\\n\\n struct Segment {\\n Point p1, p2;\\n Segment() {}\\n Segment(Point p1, Point p2):p1(p1),p2(p2){}\\n };\\n\\n // using Line = Segment;\\n typedef Segment Line;\\n\\n double norm(Point a) {\\n return a.x*a.x+a.y*a.y;\\n }\\n\\n double abs(Point a) {\\n return sqrt(norm(a));\\n }\\n\\n double dot(Point a, Point b) {\\n return a.x*b.x+a.y*b.y;\\n }\\n\\n double cross(Point a, Point b) {\\n return a.x*b.y-a.y*b.x;\\n }\\n\\n bool isParallel(Point a, Point b) {\\n return equals(cross(a,b), 0.0);\\n }\\n\\n bool isParallel(Point a1, Point a2, Point b1, Point b2) {\\n return isParallel(a1-a2,b1-b2);\\n }\\n\\n bool isParallel(Line l1, Line l2) {\\n return equals(cross(l1.p2-l1.p1,l2.p2-l2.p1), 0.0);\\n }\\n\\n // COUNTER CLOCKWISE\\n static const int CCW_COUNTER_CLOCKWISE = 1;\\n static const int CCW_CLOCKWISE = -1;\\n static const int CCW_ONLINE_BACK = 2;\\n static const int CCW_ONLINE_FRONT = -2;\\n static const int CCW_ON_SEGMENT = 0;\\n\\n int ccw(Point p0, Point p1, Point p2) {\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS) return CCW_COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS) return CCW_CLOCKWISE;\\n if(dot(a,b) < -EPS) return CCW_ONLINE_BACK;\\n if(a.norm() < b.norm()) return CCW_ONLINE_FRONT;\\n return CCW_ON_SEGMENT;\\n }\\n}\\nusing namespace geometry;\\n\\nnamespace geometry {\\n ostream &operator<<(ostream &os, Point p) {\\n os<<fixed<<setprecision(12)<<p.x<<\\\" \\\"<<p.y;\\n return os;\\n }\\n}\\n\\nbool on_line(int ccw_result) {\\n return ccw_result == CCW_ONLINE_BACK or ccw_result == CCW_ONLINE_FRONT or ccw_result == CCW_ON_SEGMENT;\\n}\\n\\nbool is_all_points_on_line(const vector<Point> &ps, Line l) {\\n for(const auto &p:ps) {\\n if(not on_line(ccw(l.p1, l.p2, p))) {\\n return false;\\n }\\n }\\n return true;\\n}\\n\\nbool on_lines( Line l1, Line l2, Point p) {\\n return on_line(ccw(l1.p1, l1.p2, p)) or on_line(ccw(l2.p1, l2.p2, p));\\n}\\n\\npair<Line, bool> find_line(Line l1, const vector<Point> &ps, int used1, int used2) {\\n bool found_p = false, found_l2 = false;\\n Point p;\\n Line l2;\\n for(int i=0;i<(int)(ps.size());i++) {\\n if(i==used1 or i==used2) {\\n continue;\\n }\\n\\n if (not on_line(ccw(l1.p1, l1.p2, ps[i]))) {\\n if (found_p) {\\n l2 = Line(p, ps[i]);\\n found_l2 = true;\\n break;\\n }\\n p = ps[i];\\n found_p = true;\\n }\\n }\\n\\n return {l2, found_l2};\\n}\\n\\npair<Point, int> find_point(Line l, const vector<Point> &ps) {\\n for(int i=0;i<(int)(ps.size()); i++) {\\n const auto &p = ps[i];\\n\\n if (not on_line(ccw(l.p1, l.p2, p))) {\\n return {p, i};\\n }\\n }\\n return {Point(), -1};\\n}\\n\\nbool is_only_point_not_on_line(Line l, const vector<Point> &ps) {\\n auto [p, p_idx] = find_point(l, ps);\\n for(int i=p_idx+1;i<(int)(ps.size());i++) {\\n const auto &p = ps[i];\\n\\n if (not on_line(ccw(l.p1, l.p2, p))) {\\n return false;\\n }\\n }\\n return true;\\n}\\n\\nbool solve() {\\n int n;\\n cin >> n;\\n\\n vector<Point> ps(n);\\n rep(i, n) {\\n cin >> ps[i].x >> ps[i].y;\\n }\\n\\n if (n <= 3) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n\\n if (is_all_points_on_line(ps, Line(ps[0], ps[1]))) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n\\n if (is_only_point_not_on_line(Line(ps[0], ps[1]), ps)) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n\\n Line l1 = Line(ps[0], ps[1]);\\n\\n auto [p, p_idx] = find_point(l1, ps);\\n\\n {\\n Line l1 = Line(ps[0], ps[1]);\\n\\n auto [l2, found_l2] = find_line(l1, ps, 0, 1);\\n\\n assert(found_l2);\\n\\n if (isParallel(l1, l2)) {\\n bool all_points_on_line = true;\\n\\n for (auto p: ps) {\\n if(not on_lines(l1, l2, p)) {\\n all_points_on_line = false;\\n break;\\n }\\n }\\n\\n if (all_points_on_line) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n }\\n }\\n\\n {\\n Line l1 = Line(ps[0], ps[p_idx]);\\n\\n auto [l2, found_l2] = find_line(l1, ps, 0, p_idx);\\n\\n assert(found_l2);\\n\\n if (isParallel(l1, l2)) {\\n bool all_points_on_line = true;\\n\\n for (auto p: ps) {\\n if(not on_lines(l1, l2, p)) {\\n all_points_on_line = false;\\n break;\\n }\\n }\\n\\n if (all_points_on_line) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n }\\n }\\n\\n {\\n Line l1 = Line(ps[1], ps[p_idx]);\\n\\n auto [l2, found_l2] = find_line(l1, ps, 1, p_idx);\\n\\n assert(found_l2);\\n\\n if (isParallel(l1, l2)) {\\n bool all_points_on_line = true;\\n\\n for (auto p: ps) {\\n if(not on_lines(l1, l2, p)) {\\n all_points_on_line = false;\\n break;\\n }\\n }\\n\\n if (all_points_on_line) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n }\\n }\\n\\n cout << \\\"No\\\\n\\\";\\n\\n return true;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int t;\\n cin >> t;\\n\\n rep(_, t) {\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 4200,\n \"score_of_the_acc\": -0.6887,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3167_7975389\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\nconst int mod = 998244353;\\nconst int inf = (1<<30);\\n\\nconst int dy[4] = {-1,0,0,1};\\nconst int dx[4] = {0,-1,1,0};\\n\\n#define equals(a,b) (fabs((a)-(b)) < EPS)\\n\\nnamespace geometry {\\n const double EPS = 1e-10;\\n const double PI = asinl(1) * 2;\\n\\n struct Point {\\n double x,y;\\n Point(){}\\n Point(double x, double y):x(x),y(y){}\\n Point operator+(Point p) {return Point(x+p.x,y+p.y);}\\n Point operator-(Point p) {return Point(x-p.x,y-p.y);}\\n Point operator*(double k) {return Point(x*k,y*k);}\\n Point operator/(double k) {return Point(x/k,y/k);}\\n double norm() {return x*x+y*y;}\\n double abs() {return sqrt(norm());}\\n\\n bool operator<(const Point &p) const {\\n return x!=p.x ? x<p.x : x<p.y;\\n }\\n\\n bool operator==(const Point &p) const {\\n return fabs(x-p.x) < EPS and fabs(y-p.y) < EPS;\\n }\\n };\\n\\n struct Segment {\\n Point p1, p2;\\n Segment() {}\\n Segment(Point p1, Point p2):p1(p1),p2(p2){}\\n };\\n\\n // using Line = Segment;\\n typedef Segment Line;\\n\\n double norm(Point a) {\\n return a.x*a.x+a.y*a.y;\\n }\\n\\n double abs(Point a) {\\n return sqrt(norm(a));\\n }\\n\\n double dot(Point a, Point b) {\\n return a.x*b.x+a.y*b.y;\\n }\\n\\n double cross(Point a, Point b) {\\n return a.x*b.y-a.y*b.x;\\n }\\n\\n bool isParallel(Point a, Point b) {\\n return equals(cross(a,b), 0.0);\\n }\\n\\n bool isParallel(Point a1, Point a2, Point b1, Point b2) {\\n return isParallel(a1-a2,b1-b2);\\n }\\n\\n bool isParallel(Line l1, Line l2) {\\n return equals(cross(l1.p2-l1.p1,l2.p2-l2.p1), 0.0);\\n }\\n\\n // COUNTER CLOCKWISE\\n static const int CCW_COUNTER_CLOCKWISE = 1;\\n static const int CCW_CLOCKWISE = -1;\\n static const int CCW_ONLINE_BACK = 2;\\n static const int CCW_ONLINE_FRONT = -2;\\n static const int CCW_ON_SEGMENT = 0;\\n\\n int ccw(Point p0, Point p1, Point p2) {\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS) return CCW_COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS) return CCW_CLOCKWISE;\\n if(dot(a,b) < -EPS) return CCW_ONLINE_BACK;\\n if(a.norm() < b.norm()) return CCW_ONLINE_FRONT;\\n return CCW_ON_SEGMENT;\\n }\\n}\\nusing namespace geometry;\\n\\nnamespace geometry {\\n ostream &operator<<(ostream &os, Point p) {\\n os<<fixed<<setprecision(12)<<p.x<<\\\" \\\"<<p.y;\\n return os;\\n }\\n}\\n\\nbool on_line(int ccw_result) {\\n return ccw_result == CCW_ONLINE_BACK or ccw_result == CCW_ONLINE_FRONT or ccw_result == CCW_ON_SEGMENT;\\n}\\n\\nbool is_all_points_on_line(const vector<Point> &ps, Line l) {\\n for(const auto &p:ps) {\\n if(not on_line(ccw(l.p1, l.p2, p))) {\\n return false;\\n }\\n }\\n return true;\\n}\\n\\nbool on_lines( Line l1, Line l2, Point p) {\\n return on_line(ccw(l1.p1, l1.p2, p)) or on_line(ccw(l2.p1, l2.p2, p));\\n}\\n\\npair<Line, bool> find_line(Line l1, const vector<Point> &ps, int used1, int used2) {\\n bool found_p = false, found_l2 = false;\\n Point p;\\n Line l2;\\n for(int i=0;i<(int)(ps.size());i++) {\\n if(i==used1 or i==used2) {\\n continue;\\n }\\n\\n if (not on_line(ccw(l1.p1, l1.p2, ps[i]))) {\\n if (found_p) {\\n l2 = Line(p, ps[i]);\\n found_l2 = true;\\n break;\\n }\\n p = ps[i];\\n found_p = true;\\n }\\n }\\n\\n return {l2, found_l2};\\n}\\n\\npair<Point, int> find_point(Line l, const vector<Point> &ps) {\\n for(int i=0;i<(int)(ps.size()); i++) {\\n const auto &p = ps[i];\\n\\n if (not on_line(ccw(l.p1, l.p2, p))) {\\n return {p, i};\\n }\\n }\\n return {Point(), -1};\\n}\\n\\nbool is_only_point_not_on_line(Line l, const vector<Point> &ps) {\\n auto [p, p_idx] = find_point(l, ps);\\n for(int i=p_idx+1;i<(int)(ps.size());i++) {\\n const auto &p = ps[i];\\n\\n if (not on_line(ccw(l.p1, l.p2, p))) {\\n return false;\\n }\\n }\\n return true;\\n}\\n\\nbool solve() {\\n int n;\\n cin >> n;\\n\\n vector<Point> ps(n);\\n rep(i, n) {\\n cin >> ps[i].x >> ps[i].y;\\n }\\n\\n if (n <= 3) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n\\n if (is_all_points_on_line(ps, Line(ps[0], ps[1]))) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n\\n if (is_only_point_not_on_line(Line(ps[0], ps[1]), ps)) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n\\n Line l1 = Line(ps[0], ps[1]);\\n\\n auto [p, p_idx] = find_point(l1, ps);\\n\\n {\\n Line l1 = Line(ps[0], ps[1]);\\n\\n auto [l2, found_l2] = find_line(l1, ps, 0, 1);\\n\\n assert(found_l2);\\n\\n if (isParallel(l1, l2)) {\\n bool all_points_on_line = true;\\n\\n for (auto p: ps) {\\n if(not on_lines(l1, l2, p)) {\\n all_points_on_line = false;\\n break;\\n }\\n }\\n\\n if (all_points_on_line) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n }\\n }\\n\\n {\\n Line l1 = Line(ps[0], ps[p_idx]);\\n\\n auto [l2, found_l2] = find_line(l1, ps, 0, p_idx);\\n\\n assert(found_l2);\\n\\n if (isParallel(l1, l2)) {\\n bool all_points_on_line = true;\\n\\n for (auto p: ps) {\\n if(not on_lines(l1, l2, p)) {\\n all_points_on_line = false;\\n break;\\n }\\n }\\n\\n if (all_points_on_line) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n }\\n }\\n\\n {\\n Line l1 = Line(ps[1], ps[p_idx]);\\n\\n auto [l2, found_l2] = find_line(l1, ps, 1, p_idx);\\n\\n assert(found_l2);\\n\\n if (isParallel(l1, l2)) {\\n bool all_points_on_line = true;\\n\\n for (auto p: ps) {\\n if(not on_lines(l1, l2, p)) {\\n all_points_on_line = false;\\n break;\\n }\\n }\\n\\n if (all_points_on_line) {\\n cout << \\\"Yes\\\\n\\\";\\n return true;\\n }\\n }\\n }\\n\\n cout << \\\"No\\\\n\\\";\\n\\n return true;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int t;\\n cin >> t;\\n\\n rep(_, t) {\\n solve();\\n }\\n}\",\n \"accuracy\": 0.8846153846153846,\n \"time_ms\": 210,\n \"memory_kb\": 3844,\n \"score_of_the_acc\": -0.5299,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3167_7975343\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n//using ll = long long;\\n\\nusing Real = long double;\\n\\nconst Real EPS = 1e-13;\\nconst string Yes = \\\"Yes\\\";\\nconst string No = \\\"No\\\";\\n\\nstruct Point{\\n Real x, y;\\n Point(){}\\n Point(Real a, Real b){\\n x = a;\\n y = b;\\n }\\n};\\n\\n// ax + by + c = 0\\nstruct Line{\\n Real a, b, c;\\n Line(){}\\n Line(Real x0, Real y0, Real x1, Real y1){\\n a = -(y1 - y0);\\n b = x1 - x0;\\n c = -y0 * (x1 - x0) + x0 * (y1 - y0);\\n }\\n};\\n\\nReal dist2(Point p, Line l){\\n Real res = fabsl(l.a * p.x + l.b * p.y + l.c);\\n res *= res;\\n res /= (l.a * l.a + l.b * l.b);\\n return res;\\n}\\n\\nbool equal(Real a, Real b){\\n return fabsl(a - b) <= EPS; \\n}\\n\\nint main() {\\n int T; cin >> T;\\n while(T--){\\n int N; cin >> N;\\n vector<Point> P(N);\\n for(int i= 0; i < N; i++) cin >> P[i].x >> P[i].y;\\n\\n if(N <= 2){\\n cout << Yes << endl;\\n continue;\\n }\\n\\n Line line(P[0].x, P[0].y, P[1].x, P[1].y);\\n int idx = -1;\\n for(int i = 2; i < N; i++){\\n if(!equal(0.0, dist2(P[i], line))){\\n idx = i;\\n break;\\n }\\n }\\n\\n if(idx == -1){\\n cout << Yes << endl;\\n continue;\\n }\\n\\n vector<Point> Ps(3);\\n Ps[0] = P[0];\\n Ps[1] = P[1];\\n Ps[2] = P[idx];\\n //for(int i = 0; i < 3; i++) cerr << Ps[i].x << Ps[i].y << endl;\\n\\n Point mid01((Ps[0].x + Ps[1].x) / 2, (Ps[0].y + Ps[1].y) / 2);\\n Point mid12((Ps[1].x + Ps[2].x) / 2, (Ps[1].y + Ps[2].y) / 2);\\n Point mid20((Ps[2].x + Ps[0].x) / 2, (Ps[2].y + Ps[0].y) / 2);\\n //cerr << mid01.x << \\\" \\\" << mid01.y << endl;\\n //cerr << mid12.x << \\\" \\\" << mid12.y << endl;\\n //cerr << mid20.x << \\\" \\\" << mid20.y << endl;\\n \\n vector<Line> ls(3);\\n ls[0] = Line(mid01.x, mid01.y, mid12.x, mid12.y);\\n assert(equal(dist2(Ps[0], ls[0]), dist2(Ps[1], ls[0])));\\n assert(equal(dist2(Ps[0], ls[0]), dist2(Ps[2], ls[0])));\\n\\n ls[1] = Line(mid12.x, mid12.y, mid20.x, mid20.y);\\n assert(equal(dist2(Ps[0], ls[1]), dist2(Ps[1], ls[1])));\\n assert(equal(dist2(Ps[0], ls[1]), dist2(Ps[2], ls[1])));\\n\\n ls[2] = Line(mid20.x, mid20.y, mid01.x, mid01.y);\\n assert(equal(dist2(Ps[0], ls[2]), dist2(Ps[1], ls[2])));\\n assert(equal(dist2(Ps[0], ls[2]), dist2(Ps[2], ls[2])));\\n\\n //ll tmp = fabsl(dist2(P[0], );\\n bool isok = 0;\\n for(int i = 0; i < 3; i++){\\n Real tmp = fabsl(dist2(P[0], ls[i]));\\n bool flag = 1;\\n for(int j = 0; j < N; j++){\\n if(!equal(fabsl(dist2(P[j], ls[i])), tmp)){\\n flag = 0;\\n break;\\n }\\n }\\n if(flag) isok = 1;\\n }\\n\\n if(isok) cout << Yes << endl;\\n else cout << No << endl;\\n\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 4264,\n \"score_of_the_acc\": -0.9542,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3167_7009838\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3167.cc: Many Points\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 20000;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\n\\ntemplate <typename T>\\nstruct Pt {\\n T x, y;\\n Pt() {}\\n Pt(T _x, T _y) : x(_x), y(_y) {}\\n Pt(const Pt<T> &p) : x(p.x), y(p.y) {}\\n\\n Pt<T> operator+(const Pt<T> p) const { return Pt<T>(x + p.x, y + p.y); }\\n Pt<T> operator-() const { return Pt<T>(-x, -y); }\\n Pt<T> operator-(const Pt<T> p) const { return Pt<T>(x - p.x, y - p.y); }\\n Pt<T> operator*(T t) const { return Pt<T>(x * t, y * t); }\\n Pt<T> operator/(T t) const { return Pt<T>(x / t, y / t); }\\n T dot(Pt<T> v) const { return x * v.x + y * v.y; }\\n T cross(Pt<T> v) const { return x * v.y - y * v.x; }\\n T d2() { return x * x + y * y; }\\n\\n Pt<T> rot90() { return Pt<T>(-y, x); }\\n\\n bool operator==(const Pt<T> pt) const { return x == pt.x && y == pt.y; }\\n bool operator<(const Pt<T> &pt) const {\\n return x < pt.x || (x == pt.x && y < pt.y);\\n }\\n};\\n\\ntypedef Pt<ll> pt;\\ntypedef vector<pt> vpt;\\n\\n/* global variables */\\n\\npt ps[MAX_N];\\n\\n/* subroutines */\\n\\n// convex_hull()\\n// make a convex_hull 'chs' from a set of points 'ps'\\n// Note: ps must be sorted, and must contain at least 2 points\\nvoid convex_hull(const int n, const pt ps[], vpt& chs) {\\n vpt lhs, uhs;\\n\\n lhs.push_back(ps[0]);\\n lhs.push_back(ps[1]);\\n for (int i = 2; i < n; i++) {\\n while (lhs.size() >= 2) {\\n int ln = lhs.size();\\n pt &lh0 = lhs[ln - 2], &lh1 = lhs[ln - 1];\\n if ((lh1 - lh0).cross(ps[i] - lh1) > 0) break;\\n lhs.pop_back();\\n }\\n lhs.push_back(ps[i]);\\n }\\n\\n uhs.push_back(ps[n - 1]);\\n uhs.push_back(ps[n - 2]);\\n for (int i = n - 3; i >= 0; i--) {\\n while (uhs.size() >= 2) {\\n int un = uhs.size();\\n pt &uh0 = uhs[un - 2], &uh1 = uhs[un - 1];\\n if ((uh1 - uh0).cross(ps[i] - uh1) > 0) break;\\n uhs.pop_back();\\n }\\n uhs.push_back(ps[i]);\\n }\\n\\n lhs.pop_back();\\n uhs.pop_back();\\n\\n chs.clear();\\n chs.reserve(lhs.size() + uhs.size());\\n chs.assign(lhs.begin(), lhs.end());\\n chs.insert(chs.end(), uhs.begin(), uhs.end());\\n}\\n\\n/* main */\\n\\nint main() {\\n //freopen(\\\"input.txt\\\", \\\"r\\\", stdin);\\n //freopen(\\\"output.txt\\\", \\\"w\\\", stdout);\\n\\n int tn;\\n scanf(\\\"%d\\\", &tn);\\n\\n for (int ti = 0; ti < tn; ti++) {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n for (int i = 0; i < n; i++)\\n scanf(\\\"%lld%lld\\\", &ps[i].x, &ps[i].y);\\n\\n if (ti == -1) {\\n printf(\\\"%d\\\\n\\\", n);\\n for (int i = 0; i < n; i++) printf(\\\"%lld,%lld\\\\n\\\", ps[i].x, ps[i].y);\\n }\\n\\n if (n <= 2) { puts(\\\"Yes\\\"); continue; }\\n\\n sort(ps, ps + n);\\n vpt chs;\\n convex_hull(n, ps, chs);\\n int chn = chs.size();\\n //printf(\\\"chs=%d\\\\n\\\", chn);\\n\\n if (chn <= 2)\\n puts(\\\"Yes\\\");\\n else if (chn == 3) {\\n bool ok = false;\\n for (int i = 0; ! ok && i < 3; i++) {\\n\\tpt p0 = chs[i], p1 = chs[(i + 1) % 3], p2 = chs[(i + 2) % 3];\\n\\tpt v(p2 - p1);\\n\\n\\tok = true;\\n\\tfor (int j = 0; ok && j < n; j++)\\n\\t ok = (ps[j] == p0 || v.cross(ps[j] - p1) == 0);\\n }\\n\\n if (ok) puts(\\\"Yes\\\");\\n else puts(\\\"No\\\");\\n }\\n else if (chn == 4) {\\n bool ok = false;\\n for (int i = 0; ! ok && i < 2; i++) {\\n\\tpt p0 = chs[i], p1 = chs[(i + 1) % 4];\\n\\tpt p2 = chs[(i + 2) % 4], p3 = chs[(i + 3) % 4];\\n\\tpt v0(p1 - p0), v1(p3 - p2);\\n\\n\\tif (v0.cross(v1) != 0) continue;\\n\\n\\tok = true;\\n\\tfor (int j = 0; ok && j < n; j++)\\n\\t ok = (v0.cross(ps[j] - p0) == 0 || v1.cross(ps[j] - p2) == 0);\\n }\\n\\n if (ok) puts(\\\"Yes\\\");\\n else puts(\\\"No\\\");\\n }\\n else\\n puts(\\\"No\\\");\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.1354,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3167_7009834\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3167.cc: Many Points\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 20000;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\n\\ntemplate <typename T>\\nstruct Pt {\\n T x, y;\\n Pt() {}\\n Pt(T _x, T _y) : x(_x), y(_y) {}\\n Pt(const Pt<T> &p) : x(p.x), y(p.y) {}\\n\\n Pt<T> operator+(const Pt<T> p) const { return Pt<T>(x + p.x, y + p.y); }\\n Pt<T> operator-() const { return Pt<T>(-x, -y); }\\n Pt<T> operator-(const Pt<T> p) const { return Pt<T>(x - p.x, y - p.y); }\\n Pt<T> operator*(T t) const { return Pt<T>(x * t, y * t); }\\n Pt<T> operator/(T t) const { return Pt<T>(x / t, y / t); }\\n T dot(Pt<T> v) const { return x * v.x + y * v.y; }\\n T cross(Pt<T> v) const { return x * v.y - y * v.x; }\\n T d2() { return x * x + y * y; }\\n\\n Pt<T> rot90() { return Pt<T>(-y, x); }\\n\\n bool operator==(const Pt<T> pt) const { return x == pt.x && y == pt.y; }\\n bool operator<(const Pt<T> &pt) const {\\n return x < pt.x || (x == pt.x && y < pt.y);\\n }\\n};\\n\\ntypedef Pt<ll> pt;\\ntypedef vector<pt> vpt;\\n\\n/* global variables */\\n\\npt ps[MAX_N];\\n\\n/* subroutines */\\n\\n// convex_hull()\\n// make a convex_hull 'chs' from a set of points 'ps'\\n// Note: ps must be sorted, and must contain at least 2 points\\nvoid convex_hull(const int n, const pt ps[], vpt& chs) {\\n vpt lhs, uhs;\\n\\n lhs.push_back(ps[0]);\\n lhs.push_back(ps[1]);\\n for (int i = 2; i < n; i++) {\\n while (lhs.size() >= 2) {\\n int ln = lhs.size();\\n pt &lh0 = lhs[ln - 2], &lh1 = lhs[ln - 1];\\n if ((lh1 - lh0).cross(ps[i] - lh1) > 0) break;\\n lhs.pop_back();\\n }\\n lhs.push_back(ps[i]);\\n }\\n\\n uhs.push_back(ps[n - 1]);\\n uhs.push_back(ps[n - 2]);\\n for (int i = n - 3; i >= 0; i--) {\\n while (uhs.size() >= 2) {\\n int un = uhs.size();\\n pt &uh0 = uhs[un - 2], &uh1 = uhs[un - 1];\\n if ((uh1 - uh0).cross(ps[i] - uh1) > 0) break;\\n uhs.pop_back();\\n }\\n uhs.push_back(ps[i]);\\n }\\n\\n lhs.pop_back();\\n uhs.pop_back();\\n\\n chs.clear();\\n chs.reserve(lhs.size() + uhs.size());\\n chs.assign(lhs.begin(), lhs.end());\\n chs.insert(chs.end(), uhs.begin(), uhs.end());\\n}\\n\\n/* main */\\n\\nint main() {\\n //freopen(\\\"input.txt\\\", \\\"r\\\", stdin);\\n //freopen(\\\"output.txt\\\", \\\"w\\\", stdout);\\n\\n int tn;\\n scanf(\\\"%d\\\", &tn);\\n\\n while (tn--) {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n for (int i = 0; i < n; i++)\\n scanf(\\\"%lld%lld\\\", &ps[i].x, &ps[i].y);\\n\\n if (n <= 2) { puts(\\\"Yes\\\"); continue; }\\n\\n sort(ps, ps + n);\\n vpt chs;\\n convex_hull(n, ps, chs);\\n int chn = chs.size();\\n //printf(\\\"chs=%d\\\\n\\\", chn);\\n\\n if (chn <= 2)\\n puts(\\\"Yes\\\");\\n else if (chn == 3) {\\n bool ok = false;\\n for (int i = 0; ! ok && i < 3; i++) {\\n\\tpt p0 = chs[i], p1 = chs[(i + 1) % 3], p2 = chs[(i + 2) % 3];\\n\\tpt v(p2 - p1);\\n\\n\\tok = true;\\n\\tfor (int j = 0; ok && j < n; j++)\\n\\t ok = (ps[j] == p0 || v.cross(ps[j] - p1) == 0);\\n }\\n\\n if (ok) puts(\\\"Yes\\\");\\n else puts(\\\"No\\\");\\n }\\n else if (chn == 4) {\\n bool ok = false;\\n for (int i = 0; ! ok && i < 2; i++) {\\n\\tpt p0 = chs[i], p1 = chs[(i + 1) % 4];\\n\\tpt p2 = chs[(i + 2) % 4], p3 = chs[(i + 3) % 4];\\n\\tpt v0(p1 - p0), v1(p3 - p2);\\n\\n\\tok = true;\\n\\tfor (int j = 0; ok && j < n; j++)\\n\\t ok = (v0.cross(ps[j] - p0) == 0 || v1.cross(ps[j] - p2) == 0);\\n }\\n\\n if (ok) puts(\\\"Yes\\\");\\n else puts(\\\"No\\\");\\n }\\n else\\n puts(\\\"No\\\");\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.8846153846153846,\n \"time_ms\": 110,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -0.1127,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3167_6928919\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=9167167167167167167;\\nconst int INF=100000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (ll i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\n\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tint t=1;\\n\\tcin>>t;\\n\\trep(i,t) solve();\\n}\\n\\nvoid solve(){\\n\\tint N;\\n\\tcin>>N;\\n\\tvector<pair<ll,ll>> p(N);\\n\\trep(i,N) cin>>p[i].first>>p[i].second;\\n\\tif(N<4){\\n\\t\\tcout<<\\\"Yes\\\\n\\\";\\n\\t\\treturn;\\n\\t}\\n\\tauto f=[](vector<pair<ll,ll>> pos,pair<ll,ll> A,pair<ll,ll> B)->bool{\\n\\t\\tint n=pos.size();\\n\\t\\tll X=A.second-B.second;\\n\\t\\tll Y=B.first-A.first;\\n\\t\\tset<ll> s;\\n\\t\\trep(i,n) s.insert(X*pos[i].first+Y*pos[i].second);\\n\\t\\treturn (int)s.size()<=2;\\n\\t};\\n\\tyneos(f(p,p[0],p[1])||f(p,p[0],p[2])||f(p,p[1],p[2]));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 5624,\n \"score_of_the_acc\": -1.2535,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3167_5145361\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\nusing lli = long long int;\\nusing Point = pair<lli, lli>;\\n\\nlli gcd(lli a, lli b){\\n if(a%b==0) return b;\\n return gcd(b,a%b);\\n}\\nPoint operator +(const Point& a, const Point& b){\\n return Point(a.first +b.first, a.second +b.second);\\n}\\nPoint operator -(const Point& a, const Point& b){\\n return Point(a.first -b.first, a.second -b.second);\\n}\\nPoint reduce(Point p){\\n if(p.first == 0){\\n if(p.second == 0) return Point(0, 0);\\n return Point(0, 1);\\n }\\n if(p.second == 0){\\n return Point(1, 0);\\n }\\n if(p.first < 0){\\n p.first = -p.first;\\n p.second = -p.second;\\n }\\n lli d = gcd(p.first, abs(p.second));\\n return Point(p.first/d, p.second/d);\\n}\\n\\nint main(){\\n int t;\\n cin >> t;\\n for(int rep=0; rep<t; rep++){\\n int n;\\n cin >> n;\\n vector<Point> p(n);\\n for(int i=0; i<n; i++){\\n cin >> p[i].first >> p[i].second;\\n }\\n\\n if(n <= 2){\\n cout << \\\"Yes\\\" << endl;\\n continue;\\n }\\n\\n bool ok = false;\\n for(int d=0; d<3; d++){\\n Point dir = reduce(p[d] -p[(d+1)%3]);\\n vector<Point> rem;\\n for(int i=0; i<n; i++){\\n if(i == d) continue;\\n if(reduce(p[i] -p[d]) != dir){\\n rem.push_back(p[i]);\\n }\\n }\\n if(rem.size() < 2u){\\n ok = true;\\n break;\\n }\\n int count = 0;\\n for(int i=1; i<(int)rem.size(); i++){\\n if(reduce(rem[i] -rem[0]) != dir){\\n count++;\\n }\\n }\\n if(count == 0){\\n ok = true;\\n break;\\n }\\n }\\n if(ok){\\n cout << \\\"Yes\\\" << endl;\\n }else{\\n cout << \\\"No\\\" << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 4244,\n \"score_of_the_acc\": -1.2841,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3167_5145291\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\n#include <limits>\\nusing namespace std;\\n\\nconst double EPS = 1e-6;\\nconst double INF = 1e12;\\nconst double PI = acos(-1);\\nconst double NaN = std::numeric_limits<double>::quiet_NaN();\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n\\nstruct P{\\n double X;\\n double Y;\\n P(double x=0.0, double y=0.0): X(x),Y(y){}\\n\\n inline const P inv() const { return P(X/(X*X+Y*Y), -Y/(X*X+Y*Y)); }\\n inline const P operator -() const { return P(-X, -Y); }\\n inline const P operator +(const P& a) const { return P(X+a.X, Y+a.Y); }\\n inline const P operator -(const P& a) const { return P(X-a.X, Y-a.Y); }\\n inline const P operator *(const P& a) const { return P(X*a.X -Y*a.Y, X*a.Y +Y*a.X); }\\n inline const P operator /(const P& a) const { return *this *a.inv(); }\\n inline const P operator *(const double& c) const { return P(c*X, c*Y); }\\n inline const P operator /(const double& c) const { return P(X/c, Y/c); }\\n\\n inline P& operator +=(const P& a){ X+=a.X; Y+=a.Y; return *this; }\\n inline P& operator -=(const P& a){ X-=a.X; Y-=a.Y; return *this; }\\n inline P& operator *=(const P& a){ double nX=X*a.X-Y*a.Y; Y=X*a.Y+Y*a.X; X=nX; return *this; }\\n inline P& operator /=(const P& a){ double d=a.X*a.X+a.Y*a.Y; double nX=(X*a.X+Y*a.Y)/d; Y=(-X*a.Y+Y*a.X)/d; X=nX; return *this; }\\n inline P& operator *=(const double& c){ X*=c; Y*=c; return *this; }\\n inline P& operator /=(const double& c){ X/=c; Y/=c; return *this; }\\n\\n inline bool operator ==(const P& a) const { return EQ(X,a.X) and EQ(Y,a.Y); }\\n inline bool operator !=(const P& a) const { return !(*this==a); }\\n inline bool operator <(const P& a) const { return !EQ(X,a.X)? X<a.X: Y+EPS<a.Y; }\\n inline bool operator <=(const P& a) const { return *this<a or *this==a; }\\n inline bool operator >(const P& a) const { return !(*this<=a); }\\n inline bool operator >=(const P& a) const { return !(*this<a); }\\n};\\nP operator *(const double& c, const P& p){ return P(c*p.X, c*p.Y); }\\ndouble norm(const P& a){ return a.X*a.X +a.Y*a.Y; }\\ndouble abs(const P& a){ return sqrt(a.X*a.X +a.Y*a.Y); }\\ndouble arg(const P& a){ return atan2(a.X, a.Y); }\\ndouble dot(const P& a, const P& b){ return a.X*b.X +a.Y*b.Y; }\\ndouble cross(const P& a, const P& b){ return a.X*b.Y -a.Y*b.X; }\\nstd::ostream& operator <<(std::ostream& lhs, const P& rhs){\\n lhs << \\\"(\\\" << rhs.X << \\\", \\\" << rhs.Y << \\\")\\\";\\n return lhs;\\n}\\n\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\n\\ndouble distanceLP(const L &l, const P &p) {\\n return abs(cross(l[1]-l[0], p-l[0])) /abs(l[1]-l[0]);\\n}\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\n\\nint main(){\\n int t;\\n cin >> t;\\n for(int rep=0; rep<t; rep++){\\n int n;\\n cin >> n;\\n vector<P> p(n);\\n for(int i=0; i<n; i++){\\n cin >> p[i].X >> p[i].Y;\\n }\\n\\n if(n <= 2){\\n cout << \\\"Yes\\\" << endl;\\n continue;\\n }\\n\\n bool ok = false;\\n for(int d=0; d<3; d++){\\n L line(p[d], p[(d+1)%3]);\\n vector<P> rem;\\n for(int i=0; i<n; i++){\\n if(abs(distanceLP(line, p[i]) > EPS)){\\n rem.push_back(p[i]);\\n }\\n }\\n if(rem.size() < 2u){\\n ok = true;\\n break;\\n }\\n L nline(rem[0], rem[1]);\\n if(!isParallel(line, nline)){\\n continue;\\n }\\n int count = 0;\\n for(P v: rem){\\n if(abs(distanceLP(nline, v) > EPS)){\\n count++;\\n }\\n }\\n if(count == 0){\\n ok = true;\\n break;\\n }\\n }\\n if(ok){\\n cout << \\\"Yes\\\" << endl;\\n }else{\\n cout << \\\"No\\\" << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.8846153846153846,\n \"time_ms\": 400,\n \"memory_kb\": 4280,\n \"score_of_the_acc\": -0.9748,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3167_5067302\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template_no_Ruby.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\nnamespace CharacterClass {\\n\\tconstexpr string_view\\n\\t digit = \\\"0123456789\\\",\\n\\t xdigit = \\\"0123456789ABCDEFabcdef\\\", lower = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n\\t upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n\\t alpha = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t alnum = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t word = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\\\",\\n\\t punct = R\\\"(!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~)\\\",\\n\\t graph =\\n\\t R\\\"(!\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t print =\\n\\t R\\\"( !\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t blank = \\\" \\\\t\\\", space = \\\" \\\\t\\\\n\\\\r\\\\f\\\\v\\\";\\n} // namespace CharacterClass\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Output {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid put(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(bool v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(vector<bool>::reference v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid put(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid put(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid put(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void put(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\\n\\t\\tput(v.first);\\n\\t\\tput(D.d);\\n\\t\\tput(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) put(D.d);\\n\\t\\t\\tput(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void put(const vector<T>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void put(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) put(D.l);\\n\\t\\t\\tput(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tOutput() = default;\\n\\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tOutput& operator()() {\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Output& operator()(H&& h) {\\n\\t\\tput(h);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\\n\\t\\tput(h);\\n\\t\\tput(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tOutput& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tput_range(begin, end);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Output& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tOutput& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 7 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T = long long> constexpr T TEN(size_t n) {\\n\\tT result = 1;\\n\\tfor (size_t i = 0; i < n; ++i) result *= 10;\\n\\treturn result;\\n}\\ntemplate <class T, class U,\\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr auto div_ceil(T n, U m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> constexpr T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> constexpr T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T, class U, class V>\\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\\n\\treturn lower <= v && v < upper;\\n}\\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\\nconstexpr bool is_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> constexpr T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T> constexpr int BIT(T x, int i) {\\n\\treturn (x & (1 << i)) ? 1 : 0;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Pow(T a, U n) {\\n\\tassert(n >= 0);\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Powmod(T a, U n, T mod) {\\n\\tassert(n >= 0);\\n\\tif (a > mod) a %= mod;\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 7 \\\"/home/yuruhiya/programming/library/template/template_no_Ruby.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 5 \\\"/home/yuruhiya/programming/library/Utility/Pair.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Pair {\\n\\tusing value_type = T;\\n\\tstatic constexpr bool cmp_x(const Pair<value_type>& p1, const Pair<value_type>& p2) {\\n\\t\\treturn p1.xy() < p2.xy();\\n\\t}\\n\\tstatic constexpr bool cmp_y(const Pair<value_type>& p1, const Pair<value_type>& p2) {\\n\\t\\treturn p1.yx() < p2.yx();\\n\\t}\\n\\tstatic constexpr value_type get_x(const Pair<value_type>& p) {\\n\\t\\treturn p.x;\\n\\t}\\n\\tstatic constexpr value_type get_y(const Pair<value_type>& p) {\\n\\t\\treturn p.y;\\n\\t}\\n\\n\\tvalue_type x, y;\\n\\tconstexpr Pair() : x(), y() {}\\n\\tconstexpr Pair(value_type _x, value_type _y) : x(_x), y(_y) {}\\n\\tconstexpr Pair(const pair<value_type, value_type>& xy) : x(xy.first), y(xy.second) {}\\n\\tconstexpr Pair(const tuple<value_type, value_type>& xy)\\n\\t : x(get<0>(xy)), y(get<0>(xy)) {}\\n\\tconstexpr Pair operator+() const {\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Pair operator-() const {\\n\\t\\treturn {-x, -y};\\n\\t}\\n\\tconstexpr Pair operator+(const Pair& p) const {\\n\\t\\treturn Pair(*this) += p;\\n\\t}\\n\\tconstexpr Pair operator-(const Pair& p) const {\\n\\t\\treturn Pair(*this) -= p;\\n\\t}\\n\\tconstexpr Pair operator*(const Pair& p) const {\\n\\t\\treturn Pair(*this) *= p;\\n\\t}\\n\\tconstexpr Pair operator/(const Pair& p) const {\\n\\t\\treturn Pair(*this) /= p;\\n\\t}\\n\\tconstexpr Pair operator%(const Pair& p) const {\\n\\t\\treturn Pair(*this) %= p;\\n\\t}\\n\\tconstexpr Pair operator+(value_type n) const {\\n\\t\\treturn Pair(*this) += n;\\n\\t}\\n\\tconstexpr Pair operator-(value_type n) const {\\n\\t\\treturn Pair(*this) -= n;\\n\\t}\\n\\tconstexpr Pair operator*(value_type n) const {\\n\\t\\treturn Pair(*this) *= n;\\n\\t}\\n\\tconstexpr Pair operator/(value_type n) const {\\n\\t\\treturn Pair(*this) /= n;\\n\\t}\\n\\tconstexpr Pair operator%(value_type n) const {\\n\\t\\treturn Pair(*this) %= n;\\n\\t}\\n\\tconstexpr Pair& operator+=(const Pair& p) {\\n\\t\\tx += p.x;\\n\\t\\ty += p.y;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Pair& operator-=(const Pair& p) {\\n\\t\\tx -= p.x;\\n\\t\\ty -= p.y;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Pair& operator*=(const Pair& p) {\\n\\t\\tx *= p.x;\\n\\t\\ty *= p.y;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Pair& operator/=(const Pair& p) {\\n\\t\\tx /= p.x;\\n\\t\\ty /= p.y;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Pair& operator%=(const Pair& p) {\\n\\t\\tx %= p.x;\\n\\t\\ty %= p.y;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Pair& operator+=(value_type n) {\\n\\t\\tx += n;\\n\\t\\ty += n;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Pair& operator-=(value_type n) {\\n\\t\\tx -= n;\\n\\t\\ty -= n;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Pair& operator*=(value_type n) {\\n\\t\\tx *= n;\\n\\t\\ty *= n;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Pair& operator/=(value_type n) {\\n\\t\\tx /= n;\\n\\t\\ty /= n;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Pair& operator%=(value_type n) {\\n\\t\\tx %= n;\\n\\t\\ty %= n;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr bool operator==(const Pair& p) const {\\n\\t\\treturn x == p.x && y == p.y;\\n\\t}\\n\\tconstexpr bool operator!=(const Pair& p) const {\\n\\t\\treturn x != p.x || y != p.y;\\n\\t}\\n\\tconstexpr bool operator<(const Pair& p) const {\\n\\t\\treturn x < p.x || (!(p.x < x) && y < p.y);\\n\\t}\\n\\tconstexpr bool operator>(const Pair& p) const {\\n\\t\\treturn p < *this;\\n\\t}\\n\\tconstexpr bool operator<=(const Pair& p) const {\\n\\t\\treturn !(p < *this);\\n\\t}\\n\\tconstexpr bool operator>=(const Pair& p) const {\\n\\t\\treturn !(*this < p);\\n\\t}\\n\\tconstexpr value_type operator[](size_t i) const {\\n\\t\\tassert(0 <= i && i < 2);\\n\\t\\treturn i == 0 ? x : y;\\n\\t}\\n\\tconstexpr pair<value_type, value_type> to_pair() const {\\n\\t\\treturn {x, y};\\n\\t}\\n\\tconstexpr tuple<value_type, value_type> to_tuple() const {\\n\\t\\treturn {x, y};\\n\\t}\\n\\tconstexpr Pair xy() const {\\n\\t\\treturn {x, y};\\n\\t}\\n\\tconstexpr Pair yx() const {\\n\\t\\treturn {y, x};\\n\\t}\\n\\tconstexpr operator tuple<value_type&, value_type&>() {\\n\\t\\treturn tuple<value_type&, value_type&>(x, y);\\n\\t}\\n\\tfriend ostream& operator<<(ostream& os, const Pair& p) {\\n\\t\\treturn os << p.x << ' ' << p.y;\\n\\t}\\n\\tfriend istream& operator>>(istream& is, Pair& p) {\\n\\t\\treturn is >> p.x >> p.y;\\n\\t}\\n};\\nnamespace std {\\n\\ttemplate <class T> struct tuple_size<Pair<T>> : integral_constant<size_t, 2> {};\\n\\ttemplate <size_t N, class T> struct tuple_element<N, Pair<T>> { using type = T; };\\n} // namespace std\\ntemplate <size_t N, class T> T get(const Pair<T>& p) {\\n\\treturn N == 0 ? p.x : p.y;\\n}\\n#line 3 \\\"b.cpp\\\"\\n\\nvoid solve() {\\n\\tusing P = Pair<ll>;\\n\\n\\tini(n);\\n\\tvector<P> p = in[n];\\n\\tif (n <= 3) {\\n\\t\\tout(true);\\n\\t\\treturn;\\n\\t}\\n\\n\\tauto check = [&](P a) {\\n\\t\\tvector<P> remain;\\n\\t\\tFOR(i, 1, n) {\\n\\t\\t\\tP b = p[0] - p[i];\\n\\t\\t\\tif (a.x * b.y - a.y * b.x != 0) {\\n\\t\\t\\t\\tremain.push_back(p[i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tFOR(i, 1, sz(remain)) {\\n\\t\\t\\tP b = remain[0] - remain[i];\\n\\t\\t\\tif (a.x * b.y - a.y * b.x != 0) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn true;\\n\\t};\\n\\n\\tout(check(p[0] - p[1]) || check(p[0] - p[2]) || check(p[1] - p[2]));\\n}\\n\\nint main() {\\n\\tfor (int t = in; t--;) {\\n\\t\\tsolve();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 4300,\n \"score_of_the_acc\": -0.8139,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3167_4965075\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 20005\\n\\nstruct Point{\\n\\n\\tll x,y;\\n};\\n\\nstruct Info{\\n\\tbool operator==(const struct Info &arg) const{\\n\\n\\t\\tif(bunbo == 0 && arg.bunbo == 0){ //★★★注意★★★\\n\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\n\\t\\treturn bunshi == arg.bunshi && bunbo == arg.bunbo;\\n\\t}\\n\\n\\tll bunshi,bunbo;\\n};\\n\\nint N;\\nPoint point[SIZE];\\n\\nll gcd(ll x,ll y){\\n\\n\\tx = abs(x);\\n\\ty = abs(y);\\n\\n\\tif(x < y){\\n\\t\\tswap(x,y);\\n\\t}\\n\\tif(y == 0){\\n\\t\\treturn x;\\n\\t}else{\\n\\t\\treturn gcd(y,x%y);\\n\\t}\\n}\\n\\nInfo calc_slope(int a,int b){\\n\\n\\tInfo ret;\\n\\tret.bunbo = point[a].x-point[b].x;\\n\\tret.bunshi = point[a].y-point[b].y;\\n\\tll common = gcd(ret.bunbo,ret.bunshi);\\n\\n\\tret.bunbo /= common;\\n\\tret.bunshi /= common;\\n\\n\\tif(ret.bunbo < 0){\\n\\t\\tret.bunshi *= -1;\\n\\t\\tret.bunbo *= -1;\\n\\t}\\n\\treturn ret;\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lld %lld\\\",&point[i].x,&point[i].y);\\n\\t}\\n\\tif(N <= 3){\\n\\n\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tint tmp_index = -1;\\n\\tInfo base_info = calc_slope(0,1);\\n\\n\\tfor(int i = 2; i < N; i++){\\n\\n\\t\\tInfo tmp_info = calc_slope(0,i);\\n\\t\\tif(tmp_info.bunbo != base_info.bunbo || (tmp_info.bunbo != 0 && tmp_info.bunshi != base_info.bunshi)){\\n\\n\\t\\t\\ttmp_index = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tif(tmp_index == -1){ //全て同一直線上\\n\\n\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tInfo work_info1,work_info2;\\n\\n\\tfor(int loop = 0; loop < 3; loop++){\\n\\n\\t\\tswitch(loop){\\n\\t\\tcase 0: //0,1基準\\n\\t\\t\\tbase_info = calc_slope(0,1);\\n\\t\\t\\tbreak;\\n\\t\\tcase 1: //1,tmp_index基準\\n\\t\\t\\tbase_info = calc_slope(1,tmp_index);\\n\\t\\t\\tbreak;\\n\\t\\tcase 2: //tmp_index,0基準\\n\\t\\t\\tbase_info = calc_slope(tmp_index,0);\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tbool FLG = true;\\n\\n\\t\\tfor(int i = 2; i < N; i++){\\n\\t\\t\\tif(i == tmp_index)continue;\\n\\n\\t\\t\\tbool tmp_FLG = false;\\n\\n\\t\\t\\tswitch(loop){\\n\\t\\t\\tcase 0: //0,1基準\\n\\n\\t\\t\\t\\twork_info1 = calc_slope(i,tmp_index);\\n\\t\\t\\t\\twork_info2 = calc_slope(i,0);\\n\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 1: //1,tmp_index基準\\n\\n\\t\\t\\t\\twork_info1 = calc_slope(i,0);\\n\\t\\t\\t\\twork_info2 = calc_slope(i,1);\\n\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 2: //tmp_index,0基準\\n\\n\\t\\t\\t\\twork_info1 = calc_slope(i,1);\\n\\t\\t\\t\\twork_info2 = calc_slope(i,tmp_index);\\n\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(base_info == work_info1 || base_info == work_info2){\\n\\n\\t\\t\\t\\ttmp_FLG = true;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(!tmp_FLG){\\n\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(FLG){\\n\\t\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\n\\n\\tprintf(\\\"No\\\\n\\\");\\n}\\n\\n\\nint main(){\\n\\n\\tint num_case;\\n\\tscanf(\\\"%d\\\",&num_case);\\n\\n\\tfor(int loop = 0; loop < num_case; loop++){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.4085,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3167_4965072\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 20005\\n\\nstruct Point{\\n\\n\\tll x,y;\\n};\\n\\nstruct Info{\\n\\tbool operator==(const struct Info &arg) const{\\n\\n\\t\\tif(bunbo == 0 && arg.bunbo == 0){\\n\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\n\\t\\treturn bunshi == arg.bunshi && bunbo == arg.bunbo;\\n\\t}\\n\\n\\tll bunshi,bunbo;\\n};\\n\\nint N;\\nPoint point[SIZE];\\n\\nll gcd(ll x,ll y){\\n\\n\\tx = abs(x);\\n\\ty = abs(y);\\n\\n\\tif(x < y){\\n\\t\\tswap(x,y);\\n\\t}\\n\\tif(y == 0){\\n\\t\\treturn x;\\n\\t}else{\\n\\t\\treturn gcd(y,x%y);\\n\\t}\\n}\\n\\nInfo calc_slope(int a,int b){\\n\\n\\tInfo ret;\\n\\tret.bunbo = point[a].x-point[b].x;\\n\\tret.bunshi = point[a].y-point[b].y;\\n\\tll common = gcd(ret.bunbo,ret.bunshi);\\n\\n\\tret.bunbo /= common;\\n\\tret.bunshi /= common;\\n\\n\\tif(ret.bunbo < 0){\\n\\t\\tret.bunshi *= -1;\\n\\t\\tret.bunbo *= -1;\\n\\t}\\n\\treturn ret;\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lld %lld\\\",&point[i].x,&point[i].y);\\n\\t}\\n\\tif(N <= 3){\\n\\n\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tint tmp_index = -1;\\n\\tInfo base_info = calc_slope(0,1);\\n\\n\\tfor(int i = 2; i < N; i++){\\n\\n\\t\\tInfo tmp_info = calc_slope(0,i);\\n\\t\\tif(tmp_info.bunbo != base_info.bunbo || (tmp_info.bunbo != 0 && tmp_info.bunshi != base_info.bunshi)){\\n\\n\\t\\t\\ttmp_index = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tif(tmp_index == -1){ //全て同一直線上\\n\\n\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tInfo work_info1,work_info2;\\n\\n\\t//printf(\\\"tmp_index:%d\\\\n\\\",tmp_index);\\n\\n\\tfor(int loop = 0; loop < 3; loop++){\\n\\n\\t\\tswitch(loop){\\n\\t\\tcase 0: //0,1基準\\n\\t\\t\\tbase_info = calc_slope(0,1);\\n\\t\\t\\tbreak;\\n\\t\\tcase 1: //1,tmp_index基準\\n\\t\\t\\tbase_info = calc_slope(1,tmp_index);\\n\\t\\t\\tbreak;\\n\\t\\tcase 2: //tmp_index,0基準\\n\\t\\t\\tbase_info = calc_slope(tmp_index,0);\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tbool FLG = true;\\n\\n\\t\\tfor(int i = 2; i < N; i++){\\n\\t\\t\\tif(i == tmp_index)continue;\\n\\n\\t\\t\\tbool tmp_FLG = false;\\n\\n\\t\\t\\tswitch(loop){\\n\\t\\t\\tcase 0: //0,1基準\\n\\n\\t\\t\\t\\twork_info1 = calc_slope(i,tmp_index);\\n\\t\\t\\t\\twork_info2 = calc_slope(i,0);\\n\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 1: //1,tmp_index基準\\n\\n\\t\\t\\t\\twork_info1 = calc_slope(i,0);\\n\\t\\t\\t\\twork_info2 = calc_slope(i,1);\\n\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 2: //tmp_index,0基準\\n\\n\\t\\t\\t\\twork_info1 = calc_slope(i,1);\\n\\t\\t\\t\\twork_info2 = calc_slope(i,tmp_index);\\n\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(base_info == work_info1 || base_info == work_info2){\\n\\n\\t\\t\\t\\ttmp_FLG = true;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(!tmp_FLG){\\n\\t\\t\\t\\t/*printf(\\\"loop:%d\\\\n\\\",loop);\\n\\n\\t\\t\\t\\tprintf(\\\"base bunbo:%lld bunshi:%lld\\\\n\\\",base_info.bunbo,base_info.bunshi);\\n\\t\\t\\t\\tprintf(\\\"work1: bunbo:%lld bunshi:%lld\\\\n\\\",work_info1.bunbo,work_info1.bunshi);\\n\\t\\t\\t\\tprintf(\\\"work2: bunbo:%lld bunshi:%lld\\\\n\\\",work_info2.bunbo,work_info2.bunshi);*/\\n\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(FLG){\\n\\t\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\n\\n\\tprintf(\\\"No\\\\n\\\");\\n}\\n\\n\\nint main(){\\n\\n\\tint num_case;\\n\\tscanf(\\\"%d\\\",&num_case);\\n\\n\\tfor(int loop = 0; loop < num_case; loop++){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.4101,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3167_4964153\",\n \"code_snippet\": \"#include <random>\\n#include \\\"bits/stdc++.h\\\"\\n//#include <atcoder/all>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n\\nusing ld = long double;\\nusing Point = std::complex<ld>;\\n\\nconst ld eps = 1e-9, pi = acos(-1.0);\\n\\nnamespace std {\\nbool operator<(const Point &lhs, const Point &rhs) {\\n if (lhs.real() < rhs.real() - eps) return true;\\n if (lhs.real() > rhs.real() + eps) return false;\\n return lhs.imag() < rhs.imag();\\n}\\n} // namespace std\\n\\nPoint input_point() {\\n ld x, y;\\n std::cin >> x >> y;\\n return Point(x, y);\\n}\\n\\nbool eq(ld a, ld b) { return (abs(a - b) < eps); }\\n\\nld dot(Point a, Point b) { return real(conj(a) * b); }\\n\\nld cross(Point a, Point b) { return imag(conj(a) * b); }\\n\\n// CCW::counter clockwise\\nint ccw(Point a, Point b, Point c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > eps) return 1; // a,b,c : counter-clockwise\\n if (cross(b, c) < -eps) return -1; // a,b,c : clockwise\\n if (dot(b, c) < 0) return 2; // c,a,b : on a line\\n if (norm(b) < norm(c)) return -2; // a,b,c : on a line\\n return 0; // a,c,b : on a line\\n}\\n\\nclass Line {\\n public:\\n Point a, b;\\n Line() : a(Point(0, 0)), b(Point(0, 0)) {}\\n Line(Point a, Point b) : a(a), b(b) {}\\n};\\n\\nld dot(Line l, Line m) { return dot((l.a - l.b), (m.a - m.b)); }\\n\\n// l:line, m:line が交点を持つか\\nbool isis_ll(Line l, Line m) { return !eq(cross(l.b - l.a, m.b - m.a), 0); }\\n\\n// l:line, s:segment\\nbool isis_ls(Line l, Line s) {\\n return isis_ll(l, s) &&\\n (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// s:segment, t:segment\\nbool isis_ss(Line s, Line t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// p が l:line 上に存在するか\\nbool isis_lp(Line l, Point p) { return (abs(cross(l.b - p, l.a - p)) < eps); }\\n\\ntemplate <typename T>\\nvoid printv(const vector<T> &v) {\\n int sz = v.size();\\n for (int i = 0; i < sz; i++) {\\n cout << v[i] << \\\" \\\\n\\\"[i == sz - 1];\\n }\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n auto output_answer = [](bool f) { cout << (f ? \\\"Yes\\\" : \\\"No\\\") << endl; };\\n int t;\\n cin >> t;\\n while (t--) {\\n int n;\\n cin >> n;\\n vector<Point> ps(n);\\n for (int i = 0; i < n; i++) {\\n ps[i] = input_point();\\n }\\n if (n <= 3) {\\n output_answer(true);\\n continue;\\n }\\n auto check = [&](Point p1, Point p2) {\\n Line l1 = Line(p1, p2);\\n vector<Point> not_ls;\\n for (int i = 0; i < n; i++) {\\n if (!isis_lp(l1, ps[i])) not_ls.emplace_back(ps[i]);\\n }\\n if (not_ls.size() <= 1) {\\n return true;\\n }\\n Line l2 = Line(not_ls[0], not_ls[1]);\\n bool ok = !isis_ll(l1, l2);\\n for (auto p : not_ls) {\\n if (!isis_lp(l2, p)) ok = false;\\n }\\n return ok;\\n };\\n {\\n // 全て一直線上 / p[0], p[1] が同じ側\\n auto ok = check(ps[0], ps[1]);\\n if (ok) {\\n output_answer(ok);\\n continue;\\n }\\n }\\n // p[0], p[1] が反対側\\n {\\n // p[0], p[2] が同じ側\\n auto ok = check(ps[0], ps[2]);\\n if (ok) {\\n output_answer(ok);\\n continue;\\n }\\n }\\n {\\n // p[1], p[2] が同じ側\\n auto ok = check(ps[1], ps[2]);\\n if (ok) {\\n output_answer(ok);\\n continue;\\n }\\n }\\n output_answer(false);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 5560,\n \"score_of_the_acc\": -1.2979,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3167_4894938\",\n \"code_snippet\": \"#ifdef ONLINE_JUDGE\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<long long, long long>;\\n#define rep(i, n) for(int i = 0; i < (n); ++i)\\n#define all(x) (x).begin(),(x).end()\\nconstexpr char ln = '\\\\n';\\nistream& operator>>(istream& is, __int128_t &x) {\\n x = 0;\\n string s;\\n is >> s;\\n int n = int(s.size()), it = 0;\\n if (s[0] == '-') it++;\\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\\n if (s[0] == '-') x = -x;\\n return is;\\n}\\nostream& operator<<(ostream& os, __int128_t x) {\\n if (x == 0) return os << 0;\\n if (x < 0) os << '-', x = -x;\\n deque<int> deq;\\n while (x) deq.emplace_front(x % 10), x /= 10;\\n for (int e : deq) os << e;\\n return os;\\n}\\ntemplate<class T1, class T2>\\nostream& operator<<(ostream& os, const pair<T1, T2>& p) {\\n return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n}\\ntemplate<class T> \\nostream& operator<<(ostream& os, const vector<T>& v) {\\n os << \\\"[\\\";\\n for(auto e : v) os << e << \\\", \\\";\\n return os << \\\"]\\\";\\n}\\ntemplate<class Container> inline int SZ(Container& v) {return int(v.size());}\\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\\ninline int topbit(int x) {return x == 0 ? -1 : 31 - __builtin_clz(x);}\\ninline int topbit(long long x) {return x == 0 ? -1 : 63 - __builtin_clzll(x);}\\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\\ninline int popcount(int x) {return __builtin_popcount(x);}\\ninline int popcount(long long x) {return __builtin_popcountll(x);}\\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\\ninline constexpr long long TEN(int x) {return x == 0 ? 1 : TEN(x-1) * 10;}\\nnamespace detail {\\n template<typename Tp, int Nb>\\n auto make_vector(vector<int>& sizes, Tp const& x) {\\n if constexpr (Nb == 1) {\\n return vector(sizes[0], x);\\n } else {\\n int size = sizes[Nb-1];\\n sizes.pop_back();\\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\\n }\\n }\\n}\\ntemplate<typename Tp, int Nb>\\nauto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {\\n vector<int> s(Nb);\\n for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];\\n return detail::make_vector<Tp, Nb>(s, x);\\n}\\ninline void print() {cout << \\\"\\\\n\\\";}\\ntemplate<class T>\\ninline void print(const vector<T>& v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \\\" \\\";\\n print();\\n}\\ntemplate<class T, class... Args>\\ninline void print(const T &x, const Args &... args) {\\n cout << x << \\\" \\\";\\n print(args...);\\n}\\n#ifdef MINATO_LOCAL\\n#define dump(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\ninline void debug() {cerr << endl;}\\ntemplate<class T>\\ninline void debug(const vector<T> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \\\" \\\";\\n debug();\\n}\\ntemplate<class T, class... Args>\\ninline void debug(const T &x, const Args &... args) {\\n cerr << x << \\\" \\\";\\n debug(args...);\\n}\\n#else\\n#define dump(x) void(0)\\ninline void debug() {}\\ntemplate<class T> inline void debug(const vector<T> &v) {}\\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\\n#endif\\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n// 精度が足りないときはlong double\\nusing DD = long double;\\nconstexpr DD EPS = 1e-11;\\nconst DD PI = acos(DD(-1));\\ninline int sgn(DD a) {return (a < -EPS) ? -1 : (a > EPS) ? 1 : 0;}\\n\\n//点\\nstruct Point {\\n DD x, y;\\n Point (DD x = 0, DD y = 0): x(x), y(y) {}\\n\\n Point operator+(const Point &p) const { return Point(*this) += p;}\\n Point operator-(const Point &p) const { return Point(*this) -= p;}\\n Point operator*(const Point &p) const { return Point(*this) *= p;}\\n Point operator*(DD a) const { return Point(*this) *= a;}\\n Point operator/(DD a) const { return Point(*this) /= a;}\\n Point& operator+=(const Point &p) { x += p.x; y += p.y; return *this;}\\n Point& operator-=(const Point &p) { x -= p.x; y -= p.y; return *this;}\\n Point& operator*=(const Point &p) { DD u = x*p.x - y*p.y; DD v = x*p.y + y*p.x; x = u; y = v; return *this;}\\n Point& operator*=(DD a) { x *= a; y *= a; return *this;}\\n Point& operator/=(DD a) { x /= a; y /= a; return *this;}\\n bool operator==(const Point &p) const { return !sgn(x - p.x) && !sgn(y - p.y);}\\n bool operator!=(const Point &p) const { return sgn(x - p.x) || sgn(y - p.y);}\\n bool operator<(const Point &p) const {\\n if (sgn(x - p.x)) return sgn(x - p.x) < 0;\\n return sgn(y - p.y) < 0;\\n }\\n friend istream& operator>>(istream& is, Point& p) { is >> p.x >> p.y; return is;}\\n friend ostream& operator<<(ostream& os, const Point& p) { os << p.x << \\\" \\\" << p.y; return os;}\\n\\n DD norm() { return x*x + y*y;}\\n DD abs() { return sqrt(norm());}\\n DD arg() { return atan2(y,x);}\\n};\\n\\n//ベクトル\\nusing Vector = Point;\\n\\ninline DD norm(const Vector &a) { return a.x * a.x + a.y * a.y;}\\ninline DD abs(const Vector &a) { return sqrt(norm(a));}\\ninline DD dot(const Vector &a, const Vector &b) { return a.x * b.x + a.y * b.y;}\\ninline DD cross(const Vector &a, const Vector &b) { return a.x * b.y - a.y * b.x;}\\ninline Point rot(const Point &p, DD ang) { return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\\ninline Point rot90(const Point &p) { return Point(-p.y, p.x);}\\ninline DD arg(const Vector &p) { return atan2(p.y, p.x);}\\ninline Vector polar(DD a, DD r) { return Point(cos(r) * a, sin(r) * a);}\\n//象限\\nint ort(const Point &a) {\\n if (sgn(norm(a))) {\\n if (sgn(a.y) > 0) return sgn(a.x) > 0 ? 1 : 2;\\n return sgn(a.x) > 0 ? 4 : 3;\\n }\\n return 0;\\n}\\nbool xsort(const Point &a, const Point &b) {\\n if (sgn(a.x - b.x)) return sgn(a.x - b.x) < 0;\\n return sgn(a.y - b.y) < 0;\\n}\\nbool ysort(const Point &a, const Point &b) {\\n if (sgn(a.y - b.y)) return sgn(a.y - b.y) < 0;\\n return sgn(a.x - b.x) < 0;\\n}\\n\\nbool argsortcross(const Point &a, const Point &b) {\\n int ao = ort(a), bo = ort(b);\\n if (ao != bo) return ao < bo;\\n return sgn(cross(a,b)) > 0;\\n}\\n\\nbool argsortatan2(const Point &a, const Point &b) {\\n return sgn(atan2(b.y, b.x) - atan2(a.y, a.x)) > 0;\\n}\\n\\n//線分\\nstruct Segment {\\n Point p1,p2;\\n Segment() {};\\n Segment(Point p1, Point p2) : p1(p1),p2(p2) {}\\n};\\n\\n//直線\\nusing Line = Segment;\\n\\n// 円\\nstruct Circle {\\n Point c;\\n DD r;\\n Circle(){}\\n Circle(Point c, DD r): c(c), r(r) {}\\n friend istream& operator >>(istream& is, Circle& C) { is >> C.c >> C.r; return is;}\\n friend ostream& operator <<(ostream& os, const Circle& C) { os << C.c << \\\" \\\" << C.r; return os;}\\n};\\n\\n//多角形\\nusing Polygon = vector<Point>;\\n\\n//点の進行方向\\nint ccw(const Point &p0, const Point &p1, const Point &p2) {\\n Vector a = p1 - p0;\\n Vector b = p2 - p0;\\n if (sgn(cross(a,b)) > 0) return 1; //p0,p1から見てp2は左側(反時計回り)\\n if (sgn(cross(a,b)) < 0) return -1; //p0,p1から見てp2は右側(時計回り)\\n if (sgn(dot(a,b)) < 0) return 2; //p2-p0-p1の順に一直線上\\n if (sgn(norm(b) - norm(a)) > 0) return -2; //p0-p1-p2の順に一直線上\\n return 0; //p0-p2-p1の順に一直線上\\n}\\n\\n//直線の交差判定 交差する場合1, 平行な場合0, 同一直線のとき-1\\nint intersectLP(const Vector &a, const Vector &b) {\\n if (sgn(cross(a,b))) return 1;\\n if (sgn(dot(a,b))) return 0;\\n return -1;\\n} \\nint intersectLP(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return intersectLP(p2-p1,p4-p3);}\\nint intersectLP(const Line &l1, const Line &l2) {return intersectLP(l1.p1,l1.p2,l2.p1,l2.p2);}\\n\\n//直線の平行判定\\nbool isParallel(const Vector &a, Vector &b) {return intersectLP(a,b) <= 0;}\\nbool isParallel(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return intersectLP(p1,p2,p3,p4) <= 0;}\\nbool isParallel(const Line &l1, const Line &l2) {return intersectLP(l1,l2) <= 0;}\\n\\n//直線の直交判定\\nbool isOrthogonal(const Vector &a, const Vector &b) {return !sgn(dot(a,b));}\\nbool isOrthogonal(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return isOrthogonal(p2-p1,p4-p3);}\\nbool isOrthogonal(const Line &l1, const Line &l2) {return isOrthogonal(l1.p1,l1.p2,l2.p1,l2.p2);}\\n\\n//線分の交差判定\\nbool intersectSP(const Point &p1, const Point &p2, const Point &p3, const Point &p4) { return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 && ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);}\\nbool intersectSP(const Segment &s1, const Segment &s2) { return intersectSP(s1.p1, s1.p2, s2.p1, s2.p2);}\\n\\n//直線と線分の交差判定\\nbool intersectLSP(const Line &l, const Segment &s) {return ccw(l.p1,l.p2,s.p1)*ccw(l.p1,l.p2,s.p2) <= 0;}\\n\\n//直線と直線の交点\\nPoint getCrossPointLP(const Line &l1, const Line &l2) {\\n assert(intersectLP(l1,l2)==1);\\n return l1.p1 + (l1.p2-l1.p1)*cross(l2.p1-l1.p1,l2.p2-l2.p1)/cross(l1.p2-l1.p1,l2.p2-l2.p1);\\n}\\n\\n//線分と線分の交点\\nPoint getCrossPointSP(const Segment &s1, const Segment &s2) {\\n assert(intersectSP(s1,s2));\\n return getCrossPointLP(s1,s2);\\n}\\n\\n//射影\\nPoint project(const Segment &s, const Point &p) {\\n Vector base = s.p2 - s.p1;\\n DD r = dot(p - s.p1, base) / norm(base);\\n return s.p1 + base * r;\\n}\\n\\n//線対称\\nPoint reflect(const Segment &s, const Point &p) {return p + (project(s,p) - p) * 2;}\\n\\n//点と直線の距離\\nDD getDistanceLP(const Line &l, const Point &p) { return abs(cross(l.p2 - l.p1,p - l.p1) / abs(l.p2 - l.p1));}\\n\\n//点と線分の距離\\nDD getDistanceSP(const Segment &s, const Point &p) {\\n if (sgn(dot(s.p2 - s.p1,p - s.p1)) < 0) return abs(p - s.p1);\\n if (sgn(dot(s.p1 - s.p2,p - s.p2)) < 0) return abs(p - s.p2);\\n return getDistanceLP(s, p);\\n}\\n\\n//直線と直線の距離\\nDD getDistanceLP(const Line &l1, const Line &l2) {\\n if (intersectLP(l1,l2)) return 0;\\n return getDistanceLP(l1,l2.p1);\\n}\\n\\n//直線と線分の距離\\nDD getDistanceLSP(const Line &l, const Segment &s) {\\n if (intersectLSP(l,s)) return 0;\\n return min(getDistanceLP(l,s.p1),getDistanceLP(l,s.p2));\\n}\\n\\n//線分と線分の距離\\nDD getDistanceSP(const Segment &s1, const Segment &s2) {\\n if (intersectSP(s1, s2)) return 0;\\n return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2), getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});\\n}\\n\\n//円と直線の交差判定\\nbool intersectLP(const Circle &c, const Line &l) { return sgn(getDistanceLP(l, c.c) - c.r) <= 0;}\\n//円と線分の交差判定\\nbool intersectSP(const Circle &c, const Segment &s) {\\n return sgn(getDistanceSP(s,c.c) - c.r) <= 0 && sgn(max(abs(s.p1 - c.c),abs(s.p2 - c.c)) - c.r) >= 0;\\n}\\n//円と円の交差判定\\nint intersect(const Circle &c1, const Circle &c2) {\\n if (sgn(abs(c1.c - c2.c) - (c1.r + c2.r)) > 0) return 4; //2つの円が離れている場合\\n if (!sgn(abs(c1.c - c2.c) - (c1.r + c2.r))) return 3; //2つの円が外接する場合\\n if (sgn(fabs(c1.r - c2.r) - abs(c1.c - c2.c)) > 0) return 0; //一方がもう一方を内包する場合\\n if (!sgn(fabs(c1.r - c2.r) - abs(c1.c - c2.c))) return 1; //2つの円が内接する場合\\n return 2; //2つの円が交わる場合\\n}\\n\\n//円と直線の交点\\npair<Point, Point> getCrossPoints(const Circle &c, const Line &l) {\\n assert(intersectLP(c,l));\\n Vector pr = project(l, c.c);\\n Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);\\n DD base = sqrt(c.r * c.r - norm(pr - c.c));\\n return make_pair(pr + e * base, pr - e * base);\\n}\\n\\n//円と円の交点\\npair<Point, Point> getCrossPoints(const Circle &c1, const Circle &c2) {\\n assert(intersect(c1, c2));\\n DD d = abs(c1.c - c2.c);\\n DD a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (c1.r * d * 2));\\n DD t = arg(c2.c - c1.c);\\n return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));\\n}\\n\\n//点pを通る円の接線\\npair<Line, Line> tangent(const Circle &c, const Point &p) {\\n assert(sgn(abs(c.c - p) - c.r) >= 0);\\n if (!sgn(abs(c.c - p) - c.r)) {\\n Point q = rot90(c.c - p);\\n return pair<Line, Line>(Line(p,p+q), Line(p,p+q));\\n } \\n Circle c2=Circle(p,sqrt(norm(c.c-p)-c.r*c.r));\\n auto q = getCrossPoints(c,c2);\\n return pair<Line, Line>(Line(p,q.first), Line(p,q.second));\\n}\\n\\n//多角形の面積\\nDD area(const Polygon &g) {\\n const int N = g.size();\\n DD ret = 0;\\n for (int i = 0; i < N; ++i) {\\n ret += cross(g[i],g[(i+1)%N]);\\n }\\n return fabs(ret)/2;\\n}\\n\\n//凸性判定\\nbool isConvex(const Polygon &g) {\\n const int N = g.size();\\n for (int i = 0; i < N; ++i) {\\n if (ccw(g[i],g[(i+1)%N],g[(i+2)%N]) == -1) return 0;\\n }\\n return 1;\\n}\\n\\n// 多角形-点の包含判定\\nint containment(const Polygon &g, const Point &p) {\\n const int N = g.size();\\n DD ang = 0;\\n for (int i = 0; i < N; i++) {\\n if (!ccw(g[i],g[(i+1)%N],p)) return 1; // pがgの辺上に存在する\\n ang += atan2(cross(g[(i+1)%N] - p, g[i] - p), dot(g[(i+1)%N] - p, g[i] - p));\\n }\\n if (sgn(ang)) return 2; // pがgに含まれる\\n return 0; // pがgに含まれない\\n}\\n\\n//凸包\\nPolygon andrewScan(Polygon s) {\\n Polygon u,l;\\n const int N = s.size();\\n if (N < 3) return s;\\n sort(s.begin(), s.end(), xsort);\\n u.emplace_back(s[0]);\\n u.emplace_back(s[1]);\\n l.emplace_back(s[N-1]);\\n l.emplace_back(s[N-2]);\\n \\n for (int i = 2; i < s.size(); ++i) {\\n // 凸包上の点も含めるなら ccw() == 1 含めないなら ccw() != -1\\n for (int n = u.size(); n >= 2 && ccw(u[n-2],u[n-1],s[i]) != -1; --n) {\\n u.pop_back();\\n }\\n u.emplace_back(s[i]);\\n }\\n\\n for (int i = N - 3; i >= 0; --i) {\\n // 凸包上の点も含めるなら ccw() == 1 含めないなら ccw() != -1\\n for (int n = l.size(); n >= 2 && ccw(l[n-2], l[n-1], s[i]) != -1; --n) {\\n l.pop_back();\\n }\\n l.emplace_back(s[i]);\\n }\\n\\n reverse(l.begin(), l.end());\\n for (int i = u.size() - 2; i >= 1; --i) l.emplace_back(u[i]);\\n\\n return l;\\n}\\n\\n//最遠点対\\nDD farthestpointpair(const Polygon &g) {\\n const int N = g.size();\\n if (N == 2) return abs(g[1] - g[0]);\\n int i = 0, j = 0;\\n for (int k = 0; k < N; ++k) {\\n if (g[k].y > g[i].y) i = k;\\n if (g[k].y < g[j].y) j = k;\\n }\\n\\n DD ret = 0;\\n int si = i, sj = j;\\n while (i != sj || j != si) {\\n ret = max(ret, abs(g[i]-g[j]));\\n if (sgn(cross(g[(i+1)%N] - g[i], g[(j+1)%N] - g[j])) < 0) {\\n ++i;\\n if (i == N) i = 0;\\n } else {\\n ++j;\\n if (j == N) j = 0;\\n }\\n }\\n\\n return ret;\\n}\\n\\nvoid solve() {\\n int N; cin >> N;\\n Polygon P(N);\\n rep(i,N) cin >> P[i];\\n\\n if (N <= 2) {\\n cout << \\\"Yes\\\" << ln;\\n return;\\n }\\n\\n vector<pii> arr = {pii(0,1),pii(1,2),pii(2,0)};\\n for (auto &[a,b] : arr) {\\n Line l = Line(P[a],P[b]);\\n Polygon Q;\\n rep(i,N) {\\n if (sgn(getDistanceLP(l,P[i])) == 0) continue;\\n Q.emplace_back(P[i]);\\n }\\n if (int(Q.size()) <= 1) {\\n cout << \\\"Yes\\\" << ln;\\n return;\\n }\\n Line s = Line(Q[0],Q[1]);\\n if (intersectLP(l,s)) continue;\\n bool ok = true;\\n for (auto &p : Q) {\\n if (sgn(getDistanceLP(s,p))) ok = false; \\n }\\n if (ok) {\\n cout << \\\"Yes\\\" << ln;\\n return;\\n }\\n }\\n\\n cout << \\\"No\\\" << ln;\\n}\\n\\nint main() {\\n int Q; cin >> Q;\\n while (Q--) {\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 5532,\n \"score_of_the_acc\": -1.2584,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3167_4894931\",\n \"code_snippet\": \"#ifdef ONLINE_JUDGE\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<long long, long long>;\\n#define rep(i, n) for(int i = 0; i < (n); ++i)\\n#define all(x) (x).begin(),(x).end()\\nconstexpr char ln = '\\\\n';\\nistream& operator>>(istream& is, __int128_t &x) {\\n x = 0;\\n string s;\\n is >> s;\\n int n = int(s.size()), it = 0;\\n if (s[0] == '-') it++;\\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\\n if (s[0] == '-') x = -x;\\n return is;\\n}\\nostream& operator<<(ostream& os, __int128_t x) {\\n if (x == 0) return os << 0;\\n if (x < 0) os << '-', x = -x;\\n deque<int> deq;\\n while (x) deq.emplace_front(x % 10), x /= 10;\\n for (int e : deq) os << e;\\n return os;\\n}\\ntemplate<class T1, class T2>\\nostream& operator<<(ostream& os, const pair<T1, T2>& p) {\\n return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n}\\ntemplate<class T> \\nostream& operator<<(ostream& os, const vector<T>& v) {\\n os << \\\"[\\\";\\n for(auto e : v) os << e << \\\", \\\";\\n return os << \\\"]\\\";\\n}\\ntemplate<class Container> inline int SZ(Container& v) {return int(v.size());}\\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\\ninline int topbit(int x) {return x == 0 ? -1 : 31 - __builtin_clz(x);}\\ninline int topbit(long long x) {return x == 0 ? -1 : 63 - __builtin_clzll(x);}\\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\\ninline int popcount(int x) {return __builtin_popcount(x);}\\ninline int popcount(long long x) {return __builtin_popcountll(x);}\\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\\ninline constexpr long long TEN(int x) {return x == 0 ? 1 : TEN(x-1) * 10;}\\nnamespace detail {\\n template<typename Tp, int Nb>\\n auto make_vector(vector<int>& sizes, Tp const& x) {\\n if constexpr (Nb == 1) {\\n return vector(sizes[0], x);\\n } else {\\n int size = sizes[Nb-1];\\n sizes.pop_back();\\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\\n }\\n }\\n}\\ntemplate<typename Tp, int Nb>\\nauto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {\\n vector<int> s(Nb);\\n for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];\\n return detail::make_vector<Tp, Nb>(s, x);\\n}\\ninline void print() {cout << \\\"\\\\n\\\";}\\ntemplate<class T>\\ninline void print(const vector<T>& v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \\\" \\\";\\n print();\\n}\\ntemplate<class T, class... Args>\\ninline void print(const T &x, const Args &... args) {\\n cout << x << \\\" \\\";\\n print(args...);\\n}\\n#ifdef MINATO_LOCAL\\n#define dump(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\ninline void debug() {cerr << endl;}\\ntemplate<class T>\\ninline void debug(const vector<T> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \\\" \\\";\\n debug();\\n}\\ntemplate<class T, class... Args>\\ninline void debug(const T &x, const Args &... args) {\\n cerr << x << \\\" \\\";\\n debug(args...);\\n}\\n#else\\n#define dump(x) void(0)\\ninline void debug() {}\\ntemplate<class T> inline void debug(const vector<T> &v) {}\\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\\n#endif\\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n// 精度が足りないときはlong double\\nusing DD = double;\\nconstexpr DD EPS = 1e-11;\\nconst DD PI = acos(DD(-1));\\ninline int sgn(DD a) {return (a < -EPS) ? -1 : (a > EPS) ? 1 : 0;}\\n\\n//点\\nstruct Point {\\n DD x, y;\\n Point (DD x = 0, DD y = 0): x(x), y(y) {}\\n\\n Point operator+(const Point &p) const { return Point(*this) += p;}\\n Point operator-(const Point &p) const { return Point(*this) -= p;}\\n Point operator*(const Point &p) const { return Point(*this) *= p;}\\n Point operator*(DD a) const { return Point(*this) *= a;}\\n Point operator/(DD a) const { return Point(*this) /= a;}\\n Point& operator+=(const Point &p) { x += p.x; y += p.y; return *this;}\\n Point& operator-=(const Point &p) { x -= p.x; y -= p.y; return *this;}\\n Point& operator*=(const Point &p) { DD u = x*p.x - y*p.y; DD v = x*p.y + y*p.x; x = u; y = v; return *this;}\\n Point& operator*=(DD a) { x *= a; y *= a; return *this;}\\n Point& operator/=(DD a) { x /= a; y /= a; return *this;}\\n bool operator==(const Point &p) const { return !sgn(x - p.x) && !sgn(y - p.y);}\\n bool operator!=(const Point &p) const { return sgn(x - p.x) || sgn(y - p.y);}\\n bool operator<(const Point &p) const {\\n if (sgn(x - p.x)) return sgn(x - p.x) < 0;\\n return sgn(y - p.y) < 0;\\n }\\n friend istream& operator>>(istream& is, Point& p) { is >> p.x >> p.y; return is;}\\n friend ostream& operator<<(ostream& os, const Point& p) { os << p.x << \\\" \\\" << p.y; return os;}\\n\\n DD norm() { return x*x + y*y;}\\n DD abs() { return sqrt(norm());}\\n DD arg() { return atan2(y,x);}\\n};\\n\\n//ベクトル\\nusing Vector = Point;\\n\\ninline DD norm(const Vector &a) { return a.x * a.x + a.y * a.y;}\\ninline DD abs(const Vector &a) { return sqrt(norm(a));}\\ninline DD dot(const Vector &a, const Vector &b) { return a.x * b.x + a.y * b.y;}\\ninline DD cross(const Vector &a, const Vector &b) { return a.x * b.y - a.y * b.x;}\\ninline Point rot(const Point &p, DD ang) { return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\\ninline Point rot90(const Point &p) { return Point(-p.y, p.x);}\\ninline DD arg(const Vector &p) { return atan2(p.y, p.x);}\\ninline Vector polar(DD a, DD r) { return Point(cos(r) * a, sin(r) * a);}\\n//象限\\nint ort(const Point &a) {\\n if (sgn(norm(a))) {\\n if (sgn(a.y) > 0) return sgn(a.x) > 0 ? 1 : 2;\\n return sgn(a.x) > 0 ? 4 : 3;\\n }\\n return 0;\\n}\\nbool xsort(const Point &a, const Point &b) {\\n if (sgn(a.x - b.x)) return sgn(a.x - b.x) < 0;\\n return sgn(a.y - b.y) < 0;\\n}\\nbool ysort(const Point &a, const Point &b) {\\n if (sgn(a.y - b.y)) return sgn(a.y - b.y) < 0;\\n return sgn(a.x - b.x) < 0;\\n}\\n\\nbool argsortcross(const Point &a, const Point &b) {\\n int ao = ort(a), bo = ort(b);\\n if (ao != bo) return ao < bo;\\n return sgn(cross(a,b)) > 0;\\n}\\n\\nbool argsortatan2(const Point &a, const Point &b) {\\n return sgn(atan2(b.y, b.x) - atan2(a.y, a.x)) > 0;\\n}\\n\\n//線分\\nstruct Segment {\\n Point p1,p2;\\n Segment() {};\\n Segment(Point p1, Point p2) : p1(p1),p2(p2) {}\\n};\\n\\n//直線\\nusing Line = Segment;\\n\\n// 円\\nstruct Circle {\\n Point c;\\n DD r;\\n Circle(){}\\n Circle(Point c, DD r): c(c), r(r) {}\\n friend istream& operator >>(istream& is, Circle& C) { is >> C.c >> C.r; return is;}\\n friend ostream& operator <<(ostream& os, const Circle& C) { os << C.c << \\\" \\\" << C.r; return os;}\\n};\\n\\n//多角形\\nusing Polygon = vector<Point>;\\n\\n//点の進行方向\\nint ccw(const Point &p0, const Point &p1, const Point &p2) {\\n Vector a = p1 - p0;\\n Vector b = p2 - p0;\\n if (sgn(cross(a,b)) > 0) return 1; //p0,p1から見てp2は左側(反時計回り)\\n if (sgn(cross(a,b)) < 0) return -1; //p0,p1から見てp2は右側(時計回り)\\n if (sgn(dot(a,b)) < 0) return 2; //p2-p0-p1の順に一直線上\\n if (sgn(norm(b) - norm(a)) > 0) return -2; //p0-p1-p2の順に一直線上\\n return 0; //p0-p2-p1の順に一直線上\\n}\\n\\n//直線の交差判定 交差する場合1, 平行な場合0, 同一直線のとき-1\\nint intersectLP(const Vector &a, const Vector &b) {\\n if (sgn(cross(a,b))) return 1;\\n if (sgn(dot(a,b))) return 0;\\n return -1;\\n} \\nint intersectLP(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return intersectLP(p2-p1,p4-p3);}\\nint intersectLP(const Line &l1, const Line &l2) {return intersectLP(l1.p1,l1.p2,l2.p1,l2.p2);}\\n\\n//直線の平行判定\\nbool isParallel(const Vector &a, Vector &b) {return intersectLP(a,b) <= 0;}\\nbool isParallel(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return intersectLP(p1,p2,p3,p4) <= 0;}\\nbool isParallel(const Line &l1, const Line &l2) {return intersectLP(l1,l2) <= 0;}\\n\\n//直線の直交判定\\nbool isOrthogonal(const Vector &a, const Vector &b) {return !sgn(dot(a,b));}\\nbool isOrthogonal(const Point &p1, const Point &p2, const Point &p3, const Point &p4) {return isOrthogonal(p2-p1,p4-p3);}\\nbool isOrthogonal(const Line &l1, const Line &l2) {return isOrthogonal(l1.p1,l1.p2,l2.p1,l2.p2);}\\n\\n//線分の交差判定\\nbool intersectSP(const Point &p1, const Point &p2, const Point &p3, const Point &p4) { return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 && ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);}\\nbool intersectSP(const Segment &s1, const Segment &s2) { return intersectSP(s1.p1, s1.p2, s2.p1, s2.p2);}\\n\\n//直線と線分の交差判定\\nbool intersectLSP(const Line &l, const Segment &s) {return ccw(l.p1,l.p2,s.p1)*ccw(l.p1,l.p2,s.p2) <= 0;}\\n\\n//直線と直線の交点\\nPoint getCrossPointLP(const Line &l1, const Line &l2) {\\n assert(intersectLP(l1,l2)==1);\\n return l1.p1 + (l1.p2-l1.p1)*cross(l2.p1-l1.p1,l2.p2-l2.p1)/cross(l1.p2-l1.p1,l2.p2-l2.p1);\\n}\\n\\n//線分と線分の交点\\nPoint getCrossPointSP(const Segment &s1, const Segment &s2) {\\n assert(intersectSP(s1,s2));\\n return getCrossPointLP(s1,s2);\\n}\\n\\n//射影\\nPoint project(const Segment &s, const Point &p) {\\n Vector base = s.p2 - s.p1;\\n DD r = dot(p - s.p1, base) / norm(base);\\n return s.p1 + base * r;\\n}\\n\\n//線対称\\nPoint reflect(const Segment &s, const Point &p) {return p + (project(s,p) - p) * 2;}\\n\\n//点と直線の距離\\nDD getDistanceLP(const Line &l, const Point &p) { return abs(cross(l.p2 - l.p1,p - l.p1) / abs(l.p2 - l.p1));}\\n\\n//点と線分の距離\\nDD getDistanceSP(const Segment &s, const Point &p) {\\n if (sgn(dot(s.p2 - s.p1,p - s.p1)) < 0) return abs(p - s.p1);\\n if (sgn(dot(s.p1 - s.p2,p - s.p2)) < 0) return abs(p - s.p2);\\n return getDistanceLP(s, p);\\n}\\n\\n//直線と直線の距離\\nDD getDistanceLP(const Line &l1, const Line &l2) {\\n if (intersectLP(l1,l2)) return 0;\\n return getDistanceLP(l1,l2.p1);\\n}\\n\\n//直線と線分の距離\\nDD getDistanceLSP(const Line &l, const Segment &s) {\\n if (intersectLSP(l,s)) return 0;\\n return min(getDistanceLP(l,s.p1),getDistanceLP(l,s.p2));\\n}\\n\\n//線分と線分の距離\\nDD getDistanceSP(const Segment &s1, const Segment &s2) {\\n if (intersectSP(s1, s2)) return 0;\\n return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2), getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});\\n}\\n\\n//円と直線の交差判定\\nbool intersectLP(const Circle &c, const Line &l) { return sgn(getDistanceLP(l, c.c) - c.r) <= 0;}\\n//円と線分の交差判定\\nbool intersectSP(const Circle &c, const Segment &s) {\\n return sgn(getDistanceSP(s,c.c) - c.r) <= 0 && sgn(max(abs(s.p1 - c.c),abs(s.p2 - c.c)) - c.r) >= 0;\\n}\\n//円と円の交差判定\\nint intersect(const Circle &c1, const Circle &c2) {\\n if (sgn(abs(c1.c - c2.c) - (c1.r + c2.r)) > 0) return 4; //2つの円が離れている場合\\n if (!sgn(abs(c1.c - c2.c) - (c1.r + c2.r))) return 3; //2つの円が外接する場合\\n if (sgn(fabs(c1.r - c2.r) - abs(c1.c - c2.c)) > 0) return 0; //一方がもう一方を内包する場合\\n if (!sgn(fabs(c1.r - c2.r) - abs(c1.c - c2.c))) return 1; //2つの円が内接する場合\\n return 2; //2つの円が交わる場合\\n}\\n\\n//円と直線の交点\\npair<Point, Point> getCrossPoints(const Circle &c, const Line &l) {\\n assert(intersectLP(c,l));\\n Vector pr = project(l, c.c);\\n Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);\\n DD base = sqrt(c.r * c.r - norm(pr - c.c));\\n return make_pair(pr + e * base, pr - e * base);\\n}\\n\\n//円と円の交点\\npair<Point, Point> getCrossPoints(const Circle &c1, const Circle &c2) {\\n assert(intersect(c1, c2));\\n DD d = abs(c1.c - c2.c);\\n DD a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (c1.r * d * 2));\\n DD t = arg(c2.c - c1.c);\\n return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));\\n}\\n\\n//点pを通る円の接線\\npair<Line, Line> tangent(const Circle &c, const Point &p) {\\n assert(sgn(abs(c.c - p) - c.r) >= 0);\\n if (!sgn(abs(c.c - p) - c.r)) {\\n Point q = rot90(c.c - p);\\n return pair<Line, Line>(Line(p,p+q), Line(p,p+q));\\n } \\n Circle c2=Circle(p,sqrt(norm(c.c-p)-c.r*c.r));\\n auto q = getCrossPoints(c,c2);\\n return pair<Line, Line>(Line(p,q.first), Line(p,q.second));\\n}\\n\\n//多角形の面積\\nDD area(const Polygon &g) {\\n const int N = g.size();\\n DD ret = 0;\\n for (int i = 0; i < N; ++i) {\\n ret += cross(g[i],g[(i+1)%N]);\\n }\\n return fabs(ret)/2;\\n}\\n\\n//凸性判定\\nbool isConvex(const Polygon &g) {\\n const int N = g.size();\\n for (int i = 0; i < N; ++i) {\\n if (ccw(g[i],g[(i+1)%N],g[(i+2)%N]) == -1) return 0;\\n }\\n return 1;\\n}\\n\\n// 多角形-点の包含判定\\nint containment(const Polygon &g, const Point &p) {\\n const int N = g.size();\\n DD ang = 0;\\n for (int i = 0; i < N; i++) {\\n if (!ccw(g[i],g[(i+1)%N],p)) return 1; // pがgの辺上に存在する\\n ang += atan2(cross(g[(i+1)%N] - p, g[i] - p), dot(g[(i+1)%N] - p, g[i] - p));\\n }\\n if (sgn(ang)) return 2; // pがgに含まれる\\n return 0; // pがgに含まれない\\n}\\n\\n//凸包\\nPolygon andrewScan(Polygon s) {\\n Polygon u,l;\\n const int N = s.size();\\n if (N < 3) return s;\\n sort(s.begin(), s.end(), xsort);\\n u.emplace_back(s[0]);\\n u.emplace_back(s[1]);\\n l.emplace_back(s[N-1]);\\n l.emplace_back(s[N-2]);\\n \\n for (int i = 2; i < s.size(); ++i) {\\n // 凸包上の点も含めるなら ccw() == 1 含めないなら ccw() != -1\\n for (int n = u.size(); n >= 2 && ccw(u[n-2],u[n-1],s[i]) != -1; --n) {\\n u.pop_back();\\n }\\n u.emplace_back(s[i]);\\n }\\n\\n for (int i = N - 3; i >= 0; --i) {\\n // 凸包上の点も含めるなら ccw() == 1 含めないなら ccw() != -1\\n for (int n = l.size(); n >= 2 && ccw(l[n-2], l[n-1], s[i]) != -1; --n) {\\n l.pop_back();\\n }\\n l.emplace_back(s[i]);\\n }\\n\\n reverse(l.begin(), l.end());\\n for (int i = u.size() - 2; i >= 1; --i) l.emplace_back(u[i]);\\n\\n return l;\\n}\\n\\n//最遠点対\\nDD farthestpointpair(const Polygon &g) {\\n const int N = g.size();\\n if (N == 2) return abs(g[1] - g[0]);\\n int i = 0, j = 0;\\n for (int k = 0; k < N; ++k) {\\n if (g[k].y > g[i].y) i = k;\\n if (g[k].y < g[j].y) j = k;\\n }\\n\\n DD ret = 0;\\n int si = i, sj = j;\\n while (i != sj || j != si) {\\n ret = max(ret, abs(g[i]-g[j]));\\n if (sgn(cross(g[(i+1)%N] - g[i], g[(j+1)%N] - g[j])) < 0) {\\n ++i;\\n if (i == N) i = 0;\\n } else {\\n ++j;\\n if (j == N) j = 0;\\n }\\n }\\n\\n return ret;\\n}\\n\\nvoid solve() {\\n int N; cin >> N;\\n Polygon P(N);\\n rep(i,N) cin >> P[i];\\n\\n if (N <= 2) {\\n cout << \\\"Yes\\\" << ln;\\n return;\\n }\\n\\n vector<pii> arr = {pii(0,1),pii(1,2),pii(2,0)};\\n for (auto &[a,b] : arr) {\\n Line l = Line(P[a],P[b]);\\n Polygon Q;\\n rep(i,N) {\\n if (sgn(getDistanceLP(l,P[i])) == 0) continue;\\n Q.emplace_back(P[i]);\\n }\\n if (int(Q.size()) <= 1) {\\n cout << \\\"Yes\\\" << ln;\\n return;\\n }\\n Line s = Line(Q[0],Q[1]);\\n if (intersectLP(l,s)) continue;\\n bool ok = true;\\n for (auto &p : Q) {\\n if (sgn(getDistanceLP(s,p))) ok = false; \\n }\\n if (ok) {\\n cout << \\\"Yes\\\" << ln;\\n return;\\n }\\n }\\n\\n cout << \\\"No\\\" << ln;\\n}\\n\\nint main() {\\n int Q; cin >> Q;\\n while (Q--) {\\n solve();\\n }\\n}\",\n \"accuracy\": 0.8846153846153846,\n \"time_ms\": 230,\n \"memory_kb\": 4312,\n \"score_of_the_acc\": -0.7484,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3167_4880252\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool isheiko(long long dx1, long long dy1, long long dx2, long long dy2) {\\n return dx1 * dy2 == dy1 * dx2;\\n}\\n\\nbool solve(const vector<long long> &x, const vector<long long> &y) {\\n int N = (int)x.size();\\n if (N <= 3) return true;\\n int k = -1;\\n for (int i = 2; i < N; ++i) {\\n if (!isheiko(x[i]-x[0], y[i]-y[0], x[1]-x[0], y[1]-y[0])) k = i;\\n }\\n if (k == -1) return true;\\n\\n vector<long long> ax = {x[0], x[1], x[k]}, ay = {y[0], y[1], y[k]};\\n for (int iter = 0; iter < 3; ++iter) {\\n long long dx = ax[(iter+2)%3] - ax[(iter+1)%3];\\n long long dy = ay[(iter+2)%3] - ay[(iter+1)%3];\\n bool ok = true;\\n for (int i = 0; i < N; ++i) {\\n if (!isheiko(x[i]-ax[iter], y[i]-ay[iter], dx, dy) &&\\n !isheiko(x[i]-ax[(iter+1)%3], y[i]-ay[(iter+1)%3], dx, dy))\\n ok = false;\\n }\\n if (ok) return true;\\n }\\n return false;\\n}\\n\\nint main() {\\n int T; cin >> T;\\n while (T--) {\\n int N; cin >> N;\\n vector<long long> x(N), y(N);\\n for (int i = 0; i < N; ++i) cin >> x[i] >> y[i];\\n if (solve(x, y)) cout << \\\"Yes\\\" << endl;\\n else cout << \\\"No\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 3396,\n \"score_of_the_acc\": -0.6014,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3167_4880049\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cmath>\\n#include <cstring>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <limits>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <vector>\\n#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))\\n#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))\\n#define sz(x) int(x.size())\\nusing namespace std;\\ntemplate <class T>\\nvoid setmax(T &a, T const &b) {\\n if (a < b) a = b;\\n}\\n\\ntemplate <class T>\\nvoid setmin(T &a, T const &b) {\\n if (a > b) a = b;\\n}\\n\\ntemplate <typename T, typename X>\\nauto vectors(T a, X x) { return vector<T>(x, a); }\\n\\ntemplate <typename T, typename X, typename Y, typename... Zs>\\nauto vectors(T a, X x, Y y, Zs... zs) {\\n auto cont = vectors(a, y, zs...);\\n return vector<decltype(cont)>(x, cont);\\n}\\n\\ntemplate <typename T>\\nT cross(T a, T b, T c, T d) {\\n return a * d - b * c;\\n}\\n\\nint main() {\\n int T;\\n cin >> T;\\n vector<int> gp(20010);\\n while (T--) {\\n int N;\\n cin >> N;\\n vector<long long> x(N), y(N);\\n repeat(i, N) cin >> x[i] >> y[i];\\n if (N <= 3) {\\n cout << \\\"Yes\\\" << endl;\\n continue;\\n }\\n bool flg = false;\\n repeat(i, 3) {\\n repeat(j, N) gp[j] = 0;\\n // 方向ベクトル i -> (i + 1)%3\\n int f1 = i;\\n int t1 = (i + 1) % 3;\\n int num1 = 2, num2 = 0;\\n gp[f1] = gp[t1] = 1;\\n repeat(j, N) {\\n if (gp[j]) continue;\\n // (x[t1] - x[f1], y[t1] - y[f1]) cross (x[j] - x[f1], y[j] - y[f1])\\n if (cross(x[t1] - x[f1], y[t1] - y[f1], x[j] - x[f1], y[j] - y[f1]) == 0LL) {\\n gp[j] = 1;\\n ++num1;\\n }\\n }\\n int f2 = -1;\\n int t2 = -1;\\n repeat(j, N) {\\n if (gp[j]) continue;\\n if (f2 == -1) {\\n f2 = j;\\n gp[j] = 2;\\n ++num2;\\n } else if (t2 == -1) {\\n t2 = j;\\n gp[j] = 2;\\n ++num2;\\n } else {\\n assert(f2 != -1 && t2 != -1);\\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[t1] - x[f1], y[t1] - y[f1]) != 0LL) {\\n break;\\n }\\n // (x[t2] - x[f2], y[t2] - y[f2]) cross (x[j] - x[f2], y[j] - y[f2])\\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[j] - x[f2], y[j] - y[f2]) == 0LL) {\\n gp[j] = 2;\\n ++num2;\\n }\\n }\\n }\\n if (num1 + num2 == N) {\\n if (t2 == -1 || f2 == -1) {\\n flg = true;\\n break;\\n }\\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[t1] - x[f1], y[t1] - y[f1]) == 0LL) {\\n flg = true;\\n break;\\n }\\n }\\n }\\n if (flg)\\n cout << \\\"Yes\\\" << endl;\\n else\\n cout << \\\"No\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.5488,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3167_4880045\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cmath>\\n#include <cstring>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <limits>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <vector>\\n#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))\\n#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))\\n#define sz(x) int(x.size())\\nusing namespace std;\\ntemplate <class T>\\nvoid setmax(T &a, T const &b) {\\n if (a < b) a = b;\\n}\\n\\ntemplate <class T>\\nvoid setmin(T &a, T const &b) {\\n if (a > b) a = b;\\n}\\n\\ntemplate <typename T, typename X>\\nauto vectors(T a, X x) { return vector<T>(x, a); }\\n\\ntemplate <typename T, typename X, typename Y, typename... Zs>\\nauto vectors(T a, X x, Y y, Zs... zs) {\\n auto cont = vectors(a, y, zs...);\\n return vector<decltype(cont)>(x, cont);\\n}\\n\\ntemplate <typename T>\\nT cross(T a, T b, T c, T d) {\\n return a * d - b * c;\\n}\\n\\nint main() {\\n int T;\\n cin >> T;\\n vector<int> gp(20010);\\n while (T--) {\\n int N;\\n cin >> N;\\n vector<long long> x(N), y(N);\\n repeat(i, N) cin >> x[i] >> y[i];\\n if (N <= 3) {\\n cout << \\\"Yes\\\" << endl;\\n continue;\\n }\\n bool flg = false;\\n repeat(i, 3) {\\n repeat(j, N) gp[j] = 0;\\n // 方向ベクトル i -> (i + 1)%3\\n int f1 = i;\\n int t1 = (i + 1) % 3;\\n int num1 = 2, num2 = 0;\\n gp[f1] = gp[t1] = 1;\\n repeat(j, N) {\\n if (gp[j]) continue;\\n // (x[t1] - x[f1], y[t1] - y[f1]) cross (x[j] - x[f1], y[j] - y[f1])\\n if (cross(x[t1] - x[f1], y[t1] - y[f1], x[j] - x[f1], y[j] - y[f1]) == 0LL) {\\n gp[j] = 1;\\n ++num1;\\n }\\n }\\n int f2 = -1;\\n int t2 = -1;\\n repeat(j, N) {\\n if (gp[j]) continue;\\n if (f2 == -1) {\\n f2 = j;\\n gp[j] = 2;\\n ++num2;\\n } else if (t2 == -1) {\\n t2 = j;\\n gp[j] = 2;\\n ++num2;\\n } else {\\n assert(f2 != -1 && t2 != -1);\\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[t1] - x[f1], y[t1] - y[f1]) != 0LL) {\\n break;\\n }\\n // (x[t2] - x[f2], y[t2] - y[f2]) cross (x[j] - x[f2], y[j] - y[f2])\\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[j] - x[f2], y[j] - y[f2]) == 0LL) {\\n gp[j] = 2;\\n ++num2;\\n }\\n }\\n }\\n if (num1 + num2 == N) {\\n if (cross(x[t2] - x[f2], y[t2] - y[f2], x[t1] - x[f1], y[t1] - y[f1]) == 0LL) {\\n flg = true;\\n }\\n }\\n }\\n if (flg)\\n cout << \\\"Yes\\\" << endl;\\n else\\n cout << \\\"No\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.7692307692307693,\n \"time_ms\": 340,\n \"memory_kb\": 3464,\n \"score_of_the_acc\": -0.5586,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3167_4877418\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\nvector<string> ans;\\nstruct Q{int s,b;};\\nvoid update(Q &a){\\n if(a.b==0&&a.s==0)return;\\n int g=__gcd(abs(a.b),abs(a.s));\\n a.b/=g;a.s/=g;\\n if(a.b<0)a.s*=-1,a.b*=-1;\\n if(a.b==0)a.s=abs(a.s);\\n}\\nbool same(Q &a,Q &b){\\n update(a);update(b);\\n return a.s==b.s&&a.b==b.b;\\n}\\n\\nstring solve(){\\n int n;cin>>n;\\n vector<int> x(n),y(n);\\n for(int i=0;i<n;i++)cin>>x[i]>>y[i];\\n set<int> S;for(int p:x)S.insert(p);if(S.size()<=2)return \\\"Yes\\\";\\n for(int _=0;_<1000;_++){\\n int s=rand()%n,t=rand()%n;\\n while(x[s]==x[t])(++t)%=n;\\n //cout<<x[s]<<\\\" \\\"<<y[s]<<\\\" \\\"<<x[t]<<\\\" \\\"<<y[t]<<endl;\\n Q slope={y[s]-y[t],x[s]-x[t]};update(slope);\\n Q se1,se2;\\n se2={0,0};update(se2);//cout<<\\\"SSS\\\"<<se2.b<<\\\" \\\"<<se2.s<<endl;\\n se1={x[s]*y[t]-x[t]*y[s],x[s]-x[t]};update(se1);\\n int out=0;\\n for(int i=0;i<n&&!out;i++){\\n Q tmp={slope.b*y[i]-slope.s*x[i],slope.b};update(tmp);\\n if(same(tmp,se1)||same(tmp,se2))continue;\\n if(!se2.s&&!se2.b)se2=tmp;\\n else out=1;\\n }\\n //if(!out)cout<<x[s]<<\\\" \\\"<<y[s]<<\\\" \\\"<<x[t]<<\\\" \\\"<<y[t]<<\\\" \\\"<<se1.b<<\\\" \\\"<<se1.s<<\\\" \\\"<<se2.b<<\\\" \\\"<<se2.s<<endl;\\n if(!out)return \\\"Yes\\\";\\n }\\n return \\\"No\\\";\\n}\\n\\nsigned main(){\\n int t;cin>>t;\\n while(t--)ans.push_back(solve());\\n for(auto p:ans)cout<<p<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 740,\n \"memory_kb\": 4500,\n \"score_of_the_acc\": -1.5431,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3167_4877374\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ld=long double;\\nstruct line{ld a,b;};//y=ax+b\\n\\nbool same(ld x,ld y){\\n return abs(x-y)<1e-1;\\n}\\n\\nline f(ld x1,ld y1,ld x2,ld y2){//2点を通る直線\\n return {(y1-y2)/(x1-x2),(y2*x1-y1*x2)/(x1-x2)};\\n}\\nline g(ld x1,ld y1,ld x2,ld y2,ld x3,ld y3){\\n ld a=f(x2,y2,x3,y3).a;\\n return {a,(y1+y2)/2.0-a*(x1+x2)/2.0};\\n}\\n\\nld d(line A,ld x,ld y){//直線と点の距離\\n return abs(A.a*x-y+A.b)/sqrt(A.a*A.a+1.0);\\n}\\n\\nbool check1(vector<ld> &x,vector<ld> &y){\\n line a=f((x[1]+x[2])/2.0,(y[1]+y[2])/2.0,(x[0]+x[2])/2.0,(y[0]+y[2])/2.0);\\n ld D=d(a,x[0],y[0]);\\n for(int i=0;i<x.size();i++)if(!same(d(a,x[i],y[i]),D))return false;\\n return true;\\n}\\n\\nbool check2(vector<ld> &x,vector<ld> &y){\\n line a=g(x[0],y[0],x[2],y[2],x[1],y[1]);\\n ld D=d(a,x[0],y[0]);\\n for(int i=0;i<x.size();i++)if(!same(d(a,x[i],y[i]),D))return false;\\n return true;\\n}\\n\\nstring solve(){\\n int n;cin>>n;\\n vector<ld> x(n),y(n);\\n for(int i=0;i<n;i++)cin>>x[i]>>y[i];\\n if(n<=3)return \\\"Yes\\\";\\n\\n set<int> XX;\\n for(ld p:x)XX.insert(round(p));\\n if(XX.size()<=2)return \\\"Yes\\\";\\n\\n int cnt=0;\\n\\n AHAHA:\\n assert(++cnt<=1000);\\n for(int i=2;i<n&&same(x[0],x[1]);i++)\\n if(!same(x[i],x[0])){\\n swap(x[i],x[1]);\\n swap(y[i],y[1]);\\n }\\n for(int i=3;i<n&&(same(x[0],x[2])||same(x[1],x[2]));i++)\\n if(!same(x[i],x[0])&&!same(x[i],x[1])){\\n swap(x[i],x[2]);\\n swap(y[i],y[2]);\\n }\\n\\n line A=f(x[0],y[0],x[1],y[1]);\\n bool F=true;\\n for(int i=2;i<n;i++)\\n if(!same(A.a*x[i]+A.b,y[i])){\\n F=false;\\n if(!same(x[0],x[i])&&!same(x[1],x[i])){\\n swap(x[i],x[2]);\\n swap(y[i],y[2]);\\n }\\n }\\n if(F)return \\\"Yes\\\";\\n if(same(A.a*x[2]+A.b,y[2])){\\n int aa=rand()%(n-2)+2,bb=rand()%(n-2)+2;\\n swap(x[0],x[aa]);swap(y[0],y[aa]);\\n swap(x[1],x[bb]);swap(y[1],y[bb]);\\n goto AHAHA;\\n }\\n\\n if(check1(x,y)||check2(x,y))return \\\"Yes\\\";\\n swap(x[2],x[1]);swap(y[2],y[1]);\\n if(check1(x,y)||check2(x,y))return \\\"Yes\\\";\\n swap(x[2],x[0]);swap(y[2],y[0]);\\n if(check1(x,y)||check2(x,y))return \\\"Yes\\\";\\n return \\\"No\\\";\\n}\\n\\nint main(){\\n int t;cin>>t;\\n vector<string> ans;\\n while(t--)ans.push_back(solve());\\n for(string p:ans)cout<<p<<endl;\\n}\",\n \"accuracy\": 0.8846153846153846,\n \"time_ms\": 710,\n \"memory_kb\": 5148,\n \"score_of_the_acc\": -1.7643,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":1983,"cells":{"group_id":{"kind":"string","value":"aoj_3169_cpp"},"problem_description":{"kind":"string","value":"F: n 角錐グラフ\n問題\n$n$ 角錐グラフを以下のように定義する。\n頂点数は $n + 1$ である。\n頂点 $0$ と自身を除くすべての頂点との間に、重み付きの無向辺が張られている。\n頂点 $1, 2, …, n$ はこの順にサイクルとなるように、重み付きの無向辺が張られている。\nあなたは $n$ 角錐グラフ上の頂点 $0$ を出発し、異なる $k$ 個の辺を通って頂点 $0$ に戻ってくる必要がある。一度通った辺は，たとえ向きが異なっても二度と通ることはできない。\n同じ頂点を何回通っても構わないし、途中で頂点 $0$ を通っても構わない。\nこれを満たす道順を良いサーキットと呼ぶ。より形式的には、以下のように定義される。\n$n$ 角錐グラフの辺からなる集合を $E$ とよび、辺 $e \\in E$ の重みを $w(e)$ と書く。\nここで、$n$ 角錐グラフの頂点の列 $(v_1, …, v_{k + 1})$ であり、以下の条件を満たすものを長さ $k$ の\n良いサーキット\nとよぶ。\nすべての $1 \\leq i \\leq k$ に対して $\\{v_i, v_{i + 1}\\} \\in E$\n$v_1 = v_{k + 1} = 0$\nすべての $1 \\leq i, j \\leq k$ に対して、$i \\neq j$ ならば $\\{v_i, v_{i + 1}\\} \\neq \\{v_j, v_{j + 1}\\}$\nまた、長さ $k$ の良いサーキットの\nコスト\nを、通った辺の重みの総和 $\\sum_{i = 1}^{k} w(\\{v_i, v_{i + 1}\\})$ と定義する。\n長さ $k$ の良いサーキットすべてについてコストを求め、その総和を $998244353$ で割った余りを出力せよ。長さ $k$ の良いサーキットが存在しない場合は、$0$ を出力せよ。\nただし、二つの長さ $k$ の良いサーキット $(v_1, …, v_{k + 1})$ と $(v'_1, …, v'_{k + 1})$ が異なるとは、$v_i \\neq v'_i$ を満たす $i$ ($1 \\leq i \\leq k+1$) が存在することを言う。\n入力形式\n入力は $3$ 行からなる。\n$1$ 行目には $n$ と $k$ が空白区切りで与えられる。\n$2$ 行目と $3$ 行目には、$n$ 角錐グラフの重みを表す長さ $n$ の配列 $A=(a_1, ..., a_n)$ と $B=(b_1, ..., b_n)$ がそれぞれ空白区切りで与えられる。\n$a_i$ は、辺 $\\{0, i\\}$ の重みを表し、$b_i$ は、辺 $\\{i, i + 1\\}$（ただし、$i = n$ のときは 辺 $\\{n, 1\\}$）の重みを表す。\n$n$ $k$\n$a_1$ ... $a_n$\n$b_1$ ... $b_n$\n制約\n入力は全て整数で与えられる\n$3 \\leq n \\leq 10^6$\n$3 \\leq k \\leq 2n$\n$1 \\leq a_i, b_i \\leq 10^9$\n出力形式\n長さ $k$ の良いサーキットすべてに対してコストを求め、その総和を $998244353$ で割った余りを一行に出力せよ。良いサーキットが存在しない場合は $0$ を一行に出力せよ。\n入力例1\n3 4\n1 2 3\n4 4 4\n出力例1\n72\nこの入力例は上図の $3$ 角錐グラフを表す。\n長さ $4$ の良いサーキットとコストは全部で $6$ 個存在する。\n$(0, 1, 2, 3, 0)$\n$(0, 2, 3, 1, 0)$\n$(0, 3, 1, 2, 0)$\n$(0, 3, 2, 1, 0)$\n$(0, 1, 3, 2, 0)$\n$(0, 2, 1, 3, 0)$\nコストはそれぞれ、$12$、$11$、$13$、$12$、$11$、$13$ である。\nよって、これらを足し合わせた $72$ を出力する。\n入力例2\n4 6\n1 1 3 4\n4 3 1 2\n出力例2\n224\n長さ $6$ の良いサーキットの一例として、$(0, 1, 2, 0, 3, 4, 0)$ が挙げられる。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3169_10697597","code_snippet":"#ifndef HIDDEN_IN_VS // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）\nusing pii = pair<int, int>;\tusing pll = pair<ll, ll>;\tusing pil = pair<int, ll>;\tusing pli = pair<ll, int>;\nusing vi = vector<int>;\t\tusing vvi = vector<vi>;\t\tusing vvvi = vector<vvi>;\tusing vvvvi = vector<vvvi>;\nusing vl = vector<ll>;\t\tusing vvl = vector<vl>;\t\tusing vvvl = vector<vvl>;\tusing vvvvl = vector<vvvl>;\nusing vb = vector<bool>;\tusing vvb = vector<vb>;\t\tusing vvvb = vector<vvb>;\nusing vc = vector<char>;\tusing vvc = vector<vc>;\t\tusing vvvc = vector<vvc>;\nusing vd = vector<double>;\tusing vvd = vector<vd>;\t\tusing vvvd = vector<vvd>;\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\nusing Graph = vvi;\n\n// 定数の定義\nconst double PI = acos(-1);\nint DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nint DY[4] = { 0, 1, 0, -1 };\nint INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;\n\n// 入出力高速化\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\n\n// 汎用マクロの定義\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((int)(x).size())\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))\n#define Yes(b) {cout << ((b) ? \"Yes\\n\" : \"No\\n\");}\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\n#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）\n#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\n#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定\n\n// 汎用関数の定義\ntemplate <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\ntemplate <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }\ntemplate <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod\n\n// 演算子オーバーロード\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\n\n#endif // 折りたたみ用\n\n\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n\n#ifdef _MSC_VER\n#include \"localACL.hpp\"\n#endif\n\nusing mint = modint998244353;\n//using mint = static_modint<(int)1e9+7>;\n//using mint = modint; // mint::set_mod(m);\n\nusing vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;\n#endif\n\n\n#ifdef _MSC_VER // 手元環境（Visual Studio）\n#include \"local.hpp\"\n#else // 提出用（gcc）\nint mute_dump = 0;\nint frac_print = 0;\n#if __has_include(<atcoder/all>)\nnamespace atcoder {\n\tinline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\n\tinline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\n}\n#endif\ninline int popcount(int n) { return __builtin_popcount(n); }\ninline int popcount(ll n) { return __builtin_popcountll(n); }\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\n#define dump(...)\n#define dumpel(v)\n#define dump_math(v)\n#define input_from_file(f)\n#define output_to_file(f)\n//#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE の代わりに MLE を出す\n#endif\n\n#define Assert(b) assert(b)\n\n//【階乗など（法が大きな素数）】\n/*\n* Factorial_mint(int N) : O(n)\n*\tN まで計算可能として初期化する．\n*\n* mint fact(int n) : O(1)\n*\tn! を返す．\n*\n* mint fact_inv(int n) : O(1)\n*\t1/n! を返す（n が負なら 0 を返す）\n*\n* mint inv(int n) : O(1)\n*\t1/n を返す．\n*\n* mint perm(int n, int r) : O(1)\n*\t順列の数 nPr を返す．\n*\n* mint perm_inv(int n, int r) : O(1)\n*\t順列の数の逆数 1/nPr を返す．\n*\n* mint bin(int n, int r) : O(1)\n*\t二項係数 nCr を返す．\n*\n* mint bin_inv(int n, int r) : O(1)\n*\t二項係数の逆数 1/nCr を返す．\n*\n* mint mul(vi rs) : O(|rs|)\n*\t多項係数 nC[rs] を返す．（n = Σrs）\n*\n* mint hom(int n, int r) : O(1)\n*\t重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\n*\n* mint neg_bin(int n, int r) : O(1)\n*\t負の二項係数 nCr = (-1)^r -n+r-1Cr を返す（n ≦ 0, r ≧ 0）\n*\n* mint pochhammer(int x, int n) : O(1)\n*\tポッホハマー記号 x^(n) を返す（n ≧ 0）\n*\n* mint pochhammer_inv(int x, int n) : O(1)\n*\tポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\n*/\nclass Factorial_mint {\n\tint n_max;\n\n\t// 階乗と階乗の逆数の値を保持するテーブル\n\tvm fac, fac_inv;\n\npublic:\n\t// n! までの階乗とその逆数を前計算しておく．O(n)\n\tFactorial_mint(int n) : n_max(n), fac(n + 1), fac_inv(n + 1) {\n\t\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\n\n\t\tfac[0] = 1;\n\t\trepi(i, 1, n) fac[i] = fac[i - 1] * i;\n\n\t\tfac_inv[n] = fac[n].inv();\n\t\trepir(i, n - 1, 0) fac_inv[i] = fac_inv[i + 1] * (i + 1);\n\t}\n\tFactorial_mint() : n_max(0) {} // ダミー\n\n\t// n! を返す．\n\tmint fact(int n) const {\n\t\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\n\n\t\tAssert(0 <= n && n <= n_max);\n\t\treturn fac[n];\n\t}\n\n\t// 1/n! を返す（n が負なら 0 を返す）\n\tmint fact_inv(int n) const {\n\t\t// verify : https://atcoder.jp/contests/abc289/tasks/abc289_h\n\n\t\tAssert(n <= n_max);\n\t\tif (n < 0) return 0;\n\t\treturn fac_inv[n];\n\t}\n\n\t// 1/n を返す．\n\tmint inv(int n) const {\n\t\t// verify : https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_d\n\n\t\tAssert(n > 0);\n\t\tAssert(n <= n_max);\n\t\treturn fac[n - 1] * fac_inv[n];\n\t}\n\n\t// 順列の数 nPr を返す．\n\tmint perm(int n, int r) const {\n\t\t// verify : https://atcoder.jp/contests/abc172/tasks/abc172_e\n\n\t\tAssert(n <= n_max);\n\n\t\tif (r < 0 || n - r < 0) return 0;\n\t\treturn fac[n] * fac_inv[n - r];\n\t}\n\n\t// 順列の数 nPr の逆数を返す．\n\tmint perm_inv(int n, int r) const {\n\t\t// verify : https://yukicoder.me/problems/no/3139\n\n\t\tAssert(n <= n_max);\n\t\tAssert(0 <= r); Assert(r <= n);\n\n\t\treturn fac_inv[n] * fac[n - r];\n\t}\n\n\t// 二項係数 nCr を返す．\n\tmint bin(int n, int r) const {\n\t\t// verify : https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod\n\n\t\tAssert(n <= n_max);\n\t\tif (r < 0 || n - r < 0) return 0;\n\t\treturn fac[n] * fac_inv[r] * fac_inv[n - r];\n\t}\n\n\t// 二項係数の逆数 1/nCr を返す．\n\tmint bin_inv(int n, int r) const {\n\t\t// verify : https://www.codechef.com/problems/RANDCOLORING\n\n\t\tAssert(n <= n_max);\n\t\tAssert(r >= 0);\n\t\tAssert(n - r >= 0);\n\t\treturn fac_inv[n] * fac[r] * fac[n - r];\n\t}\n\n\t// 多項係数 nC[rs] を返す．\n\tmint mul(const vi& rs) const {\n\t\t// verify : https://yukicoder.me/problems/no/2141\n\n\t\tif (*min_element(all(rs)) < 0) return 0;\n\t\tint n = accumulate(all(rs), 0);\n\t\tAssert(n <= n_max);\n\n\t\tmint res = fac[n];\n\t\trepe(r, rs) res *= fac_inv[r];\n\n\t\treturn res;\n\t}\n\n\t// 重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\n\tmint hom(int n, int r) {\n\t\t// verify : https://mojacoder.app/users/riantkb/problems/toj_ex_2\n\n\t\tif (n == 0) return (int)(r == 0);\n\t\tif (r < 0 || n - 1 < 0) return 0;\n\t\tAssert(n + r - 1 <= n_max);\n\t\treturn fac[n + r - 1] * fac_inv[r] * fac_inv[n - 1];\n\t}\n\n\t// 負の二項係数 nCr を返す（n ≦ 0, r ≧ 0）\n\tmint neg_bin(int n, int r) {\n\t\t// verify : https://atcoder.jp/contests/abc345/tasks/abc345_g\n\n\t\tif (n == 0) return (int)(r == 0);\n\t\tif (r < 0 || -n - 1 < 0) return 0;\n\t\tAssert(-n + r - 1 <= n_max);\n\t\treturn (r & 1 ? -1 : 1) * fac[-n + r - 1] * fac_inv[r] * fac_inv[-n - 1];\n\t}\n\n\t// ポッホハマー記号 x^(n) を返す（n ≧ 0）\n\tmint pochhammer(int x, int n) {\n\t\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\n\n\t\tint x2 = x + n - 1;\n\t\tif (x <= 0 && 0 <= x2) return 0;\n\n\t\tif (x > 0) {\n\t\t\tAssert(x2 <= n_max);\n\t\t\treturn fac[x2] * fac_inv[x - 1];\n\t\t}\n\t\telse {\n\t\t\tAssert(-x <= n_max);\n\t\t\treturn (n & 1 ? -1 : 1) * fac[-x] * fac_inv[-x2 - 1];\n\t\t}\n\t}\n\n\t// ポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\n\tmint pochhammer_inv(int x, int n) {\n\t\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\n\n\t\tint x2 = x + n - 1;\n\t\tAssert(!(x <= 0 && 0 <= x2));\n\n\t\tif (x > 0) {\n\t\t\tAssert(x2 <= n_max);\n\t\t\treturn fac_inv[x2] * fac[x - 1];\n\t\t}\n\t\telse {\n\t\t\tAssert(-x <= n_max);\n\t\t\treturn (n & 1 ? -1 : 1) * fac_inv[-x] * fac[-x2 - 1];\n\t\t}\n\t}\n};\n\n\nint main() {\n//\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\n\tint n, K;\n\tcin >> n >> K;\n\n\tvl a(n), b(n);\n\tcin >> a >> b;\n\n\tFactorial_mint fm(n + 10);\n\n\tll a_sum = accumulate(all(a), 0LL);\n\tll b_sum = accumulate(all(b), 0LL);\n\n\tvm pow2(n + 1);\n\tpow2[0] = 1;\n\trep(i, n) pow2[i + 1] = pow2[i] * 2;\n\n\tmint res = 0;\n\n\trepi(A, 1, K / 2) {\n\t\tint B = K - 2 * A;\n\t\tif (B >= n) continue;\n\t\tif (B < A) break;\n\n\t\t// n 本中 B 本を選んで A 個のブロックに分ける．\n\t\tmint cnt = fm.bin(B - 1, A - 1) * fm.bin(n - B - 1, A - 1);\n\t\tcnt *= 2 * pow2[A - 1] * fm.fact(A - 1);\n\n\t\tres += cnt * (mint(a_sum) * 2 * A + mint(b_sum) * B);\n\t}\n\n\tEXIT(res);\n}","accuracy":1,"time_ms":110,"memory_kb":30936,"score_of_the_acc":-0.3558,"final_rank":2},{"submission_id":"aoj_3169_10697595","code_snippet":"#ifndef HIDDEN_IN_VS // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）\nusing pii = pair<int, int>;\tusing pll = pair<ll, ll>;\tusing pil = pair<int, ll>;\tusing pli = pair<ll, int>;\nusing vi = vector<int>;\t\tusing vvi = vector<vi>;\t\tusing vvvi = vector<vvi>;\tusing vvvvi = vector<vvvi>;\nusing vl = vector<ll>;\t\tusing vvl = vector<vl>;\t\tusing vvvl = vector<vvl>;\tusing vvvvl = vector<vvvl>;\nusing vb = vector<bool>;\tusing vvb = vector<vb>;\t\tusing vvvb = vector<vvb>;\nusing vc = vector<char>;\tusing vvc = vector<vc>;\t\tusing vvvc = vector<vvc>;\nusing vd = vector<double>;\tusing vvd = vector<vd>;\t\tusing vvvd = vector<vvd>;\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\nusing Graph = vvi;\n\n// 定数の定義\nconst double PI = acos(-1);\nint DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nint DY[4] = { 0, 1, 0, -1 };\nint INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;\n\n// 入出力高速化\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\n\n// 汎用マクロの定義\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((int)(x).size())\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))\n#define Yes(b) {cout << ((b) ? \"Yes\\n\" : \"No\\n\");}\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\n#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）\n#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\n#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定\n\n// 汎用関数の定義\ntemplate <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\ntemplate <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }\ntemplate <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod\n\n// 演算子オーバーロード\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\n\n#endif // 折りたたみ用\n\n\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n\n#ifdef _MSC_VER\n#include \"localACL.hpp\"\n#endif\n\nusing mint = modint998244353;\n//using mint = static_modint<(int)1e9+7>;\n//using mint = modint; // mint::set_mod(m);\n\nusing vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;\n#endif\n\n\n#ifdef _MSC_VER // 手元環境（Visual Studio）\n#include \"local.hpp\"\n#else // 提出用（gcc）\nint mute_dump = 0;\nint frac_print = 0;\n#if __has_include(<atcoder/all>)\nnamespace atcoder {\n\tinline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\n\tinline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\n}\n#endif\ninline int popcount(int n) { return __builtin_popcount(n); }\ninline int popcount(ll n) { return __builtin_popcountll(n); }\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\n#define dump(...)\n#define dumpel(v)\n#define dump_math(v)\n#define input_from_file(f)\n#define output_to_file(f)\n//#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE の代わりに MLE を出す\n#endif\n\n#define Assert(b) assert(b)\n\n//【階乗など（法が大きな素数）】\n/*\n* Factorial_mint(int N) : O(n)\n*\tN まで計算可能として初期化する．\n*\n* mint fact(int n) : O(1)\n*\tn! を返す．\n*\n* mint fact_inv(int n) : O(1)\n*\t1/n! を返す（n が負なら 0 を返す）\n*\n* mint inv(int n) : O(1)\n*\t1/n を返す．\n*\n* mint perm(int n, int r) : O(1)\n*\t順列の数 nPr を返す．\n*\n* mint perm_inv(int n, int r) : O(1)\n*\t順列の数の逆数 1/nPr を返す．\n*\n* mint bin(int n, int r) : O(1)\n*\t二項係数 nCr を返す．\n*\n* mint bin_inv(int n, int r) : O(1)\n*\t二項係数の逆数 1/nCr を返す．\n*\n* mint mul(vi rs) : O(|rs|)\n*\t多項係数 nC[rs] を返す．（n = Σrs）\n*\n* mint hom(int n, int r) : O(1)\n*\t重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\n*\n* mint neg_bin(int n, int r) : O(1)\n*\t負の二項係数 nCr = (-1)^r -n+r-1Cr を返す（n ≦ 0, r ≧ 0）\n*\n* mint pochhammer(int x, int n) : O(1)\n*\tポッホハマー記号 x^(n) を返す（n ≧ 0）\n*\n* mint pochhammer_inv(int x, int n) : O(1)\n*\tポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\n*/\nclass Factorial_mint {\n\tint n_max;\n\n\t// 階乗と階乗の逆数の値を保持するテーブル\n\tvm fac, fac_inv;\n\npublic:\n\t// n! までの階乗とその逆数を前計算しておく．O(n)\n\tFactorial_mint(int n) : n_max(n), fac(n + 1), fac_inv(n + 1) {\n\t\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\n\n\t\tfac[0] = 1;\n\t\trepi(i, 1, n) fac[i] = fac[i - 1] * i;\n\n\t\tfac_inv[n] = fac[n].inv();\n\t\trepir(i, n - 1, 0) fac_inv[i] = fac_inv[i + 1] * (i + 1);\n\t}\n\tFactorial_mint() : n_max(0) {} // ダミー\n\n\t// n! を返す．\n\tmint fact(int n) const {\n\t\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\n\n\t\tAssert(0 <= n && n <= n_max);\n\t\treturn fac[n];\n\t}\n\n\t// 1/n! を返す（n が負なら 0 を返す）\n\tmint fact_inv(int n) const {\n\t\t// verify : https://atcoder.jp/contests/abc289/tasks/abc289_h\n\n\t\tAssert(n <= n_max);\n\t\tif (n < 0) return 0;\n\t\treturn fac_inv[n];\n\t}\n\n\t// 1/n を返す．\n\tmint inv(int n) const {\n\t\t// verify : https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_d\n\n\t\tAssert(n > 0);\n\t\tAssert(n <= n_max);\n\t\treturn fac[n - 1] * fac_inv[n];\n\t}\n\n\t// 順列の数 nPr を返す．\n\tmint perm(int n, int r) const {\n\t\t// verify : https://atcoder.jp/contests/abc172/tasks/abc172_e\n\n\t\tAssert(n <= n_max);\n\n\t\tif (r < 0 || n - r < 0) return 0;\n\t\treturn fac[n] * fac_inv[n - r];\n\t}\n\n\t// 順列の数 nPr の逆数を返す．\n\tmint perm_inv(int n, int r) const {\n\t\t// verify : https://yukicoder.me/problems/no/3139\n\n\t\tAssert(n <= n_max);\n\t\tAssert(0 <= r); Assert(r <= n);\n\n\t\treturn fac_inv[n] * fac[n - r];\n\t}\n\n\t// 二項係数 nCr を返す．\n\tmint bin(int n, int r) const {\n\t\t// verify : https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod\n\n\t\tAssert(n <= n_max);\n\t\tif (r < 0 || n - r < 0) return 0;\n\t\treturn fac[n] * fac_inv[r] * fac_inv[n - r];\n\t}\n\n\t// 二項係数の逆数 1/nCr を返す．\n\tmint bin_inv(int n, int r) const {\n\t\t// verify : https://www.codechef.com/problems/RANDCOLORING\n\n\t\tAssert(n <= n_max);\n\t\tAssert(r >= 0);\n\t\tAssert(n - r >= 0);\n\t\treturn fac_inv[n] * fac[r] * fac[n - r];\n\t}\n\n\t// 多項係数 nC[rs] を返す．\n\tmint mul(const vi& rs) const {\n\t\t// verify : https://yukicoder.me/problems/no/2141\n\n\t\tif (*min_element(all(rs)) < 0) return 0;\n\t\tint n = accumulate(all(rs), 0);\n\t\tAssert(n <= n_max);\n\n\t\tmint res = fac[n];\n\t\trepe(r, rs) res *= fac_inv[r];\n\n\t\treturn res;\n\t}\n\n\t// 重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\n\tmint hom(int n, int r) {\n\t\t// verify : https://mojacoder.app/users/riantkb/problems/toj_ex_2\n\n\t\tif (n == 0) return (int)(r == 0);\n\t\tif (r < 0 || n - 1 < 0) return 0;\n\t\tAssert(n + r - 1 <= n_max);\n\t\treturn fac[n + r - 1] * fac_inv[r] * fac_inv[n - 1];\n\t}\n\n\t// 負の二項係数 nCr を返す（n ≦ 0, r ≧ 0）\n\tmint neg_bin(int n, int r) {\n\t\t// verify : https://atcoder.jp/contests/abc345/tasks/abc345_g\n\n\t\tif (n == 0) return (int)(r == 0);\n\t\tif (r < 0 || -n - 1 < 0) return 0;\n\t\tAssert(-n + r - 1 <= n_max);\n\t\treturn (r & 1 ? -1 : 1) * fac[-n + r - 1] * fac_inv[r] * fac_inv[-n - 1];\n\t}\n\n\t// ポッホハマー記号 x^(n) を返す（n ≧ 0）\n\tmint pochhammer(int x, int n) {\n\t\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\n\n\t\tint x2 = x + n - 1;\n\t\tif (x <= 0 && 0 <= x2) return 0;\n\n\t\tif (x > 0) {\n\t\t\tAssert(x2 <= n_max);\n\t\t\treturn fac[x2] * fac_inv[x - 1];\n\t\t}\n\t\telse {\n\t\t\tAssert(-x <= n_max);\n\t\t\treturn (n & 1 ? -1 : 1) * fac[-x] * fac_inv[-x2 - 1];\n\t\t}\n\t}\n\n\t// ポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\n\tmint pochhammer_inv(int x, int n) {\n\t\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\n\n\t\tint x2 = x + n - 1;\n\t\tAssert(!(x <= 0 && 0 <= x2));\n\n\t\tif (x > 0) {\n\t\t\tAssert(x2 <= n_max);\n\t\t\treturn fac_inv[x2] * fac[x - 1];\n\t\t}\n\t\telse {\n\t\t\tAssert(-x <= n_max);\n\t\t\treturn (n & 1 ? -1 : 1) * fac_inv[-x] * fac[-x2 - 1];\n\t\t}\n\t}\n};\n\n\nint main() {\n//\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\n\tint n, K;\n\tcin >> n >> K;\n\n\tvl a(n), b(n);\n\tcin >> a >> b;\n\n\tFactorial_mint fm(n + 10);\n\n\tll a_sum = accumulate(all(a), 0LL);\n\tll b_sum = accumulate(all(b), 0LL);\n\n\tvm pow2(n + 1);\n\tpow2[0] = 1;\n\trep(i, n) pow2[i + 1] = pow2[i] * 2;\n\n\tmint res = 0;\n\n\trepi(A, 1, K / 2) {\n\t\tint B = K - 2 * A;\n\t\tif (B >= n) continue;\n\t\tif (B < A) break;\n\n\t\t// n 本中 B 本を選んで A 個のブロックに分ける．\n\t\tmint cnt = fm.bin(B - 1, A - 1) * fm.bin(n - B - 1, A - 1);\n\t\tcnt *= 2 * pow2[A - 1] * fm.fact(A - 1);\n\n\t\tres += cnt * (a_sum * 2 * A + b_sum * B);\n\t}\n\n\tEXIT(res);\n}","accuracy":0.4,"time_ms":70,"memory_kb":22352,"score_of_the_acc":-0.1873,"final_rank":11},{"submission_id":"aoj_3169_10697594","code_snippet":"#ifndef HIDDEN_IN_VS // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）\nusing pii = pair<int, int>;\tusing pll = pair<ll, ll>;\tusing pil = pair<int, ll>;\tusing pli = pair<ll, int>;\nusing vi = vector<int>;\t\tusing vvi = vector<vi>;\t\tusing vvvi = vector<vvi>;\tusing vvvvi = vector<vvvi>;\nusing vl = vector<ll>;\t\tusing vvl = vector<vl>;\t\tusing vvvl = vector<vvl>;\tusing vvvvl = vector<vvvl>;\nusing vb = vector<bool>;\tusing vvb = vector<vb>;\t\tusing vvvb = vector<vvb>;\nusing vc = vector<char>;\tusing vvc = vector<vc>;\t\tusing vvvc = vector<vvc>;\nusing vd = vector<double>;\tusing vvd = vector<vd>;\t\tusing vvvd = vector<vvd>;\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\nusing Graph = vvi;\n\n// 定数の定義\nconst double PI = acos(-1);\nint DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nint DY[4] = { 0, 1, 0, -1 };\nint INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;\n\n// 入出力高速化\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\n\n// 汎用マクロの定義\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((int)(x).size())\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))\n#define Yes(b) {cout << ((b) ? \"Yes\\n\" : \"No\\n\");}\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\n#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）\n#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\n#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定\n\n// 汎用関数の定義\ntemplate <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\ntemplate <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }\ntemplate <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod\n\n// 演算子オーバーロード\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\n\n#endif // 折りたたみ用\n\n\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n\n#ifdef _MSC_VER\n#include \"localACL.hpp\"\n#endif\n\nusing mint = modint998244353;\n//using mint = static_modint<(int)1e9+7>;\n//using mint = modint; // mint::set_mod(m);\n\nusing vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;\n#endif\n\n\n#ifdef _MSC_VER // 手元環境（Visual Studio）\n#include \"local.hpp\"\n#else // 提出用（gcc）\nint mute_dump = 0;\nint frac_print = 0;\n#if __has_include(<atcoder/all>)\nnamespace atcoder {\n\tinline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\n\tinline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\n}\n#endif\ninline int popcount(int n) { return __builtin_popcount(n); }\ninline int popcount(ll n) { return __builtin_popcountll(n); }\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\n#define dump(...)\n#define dumpel(v)\n#define dump_math(v)\n#define input_from_file(f)\n#define output_to_file(f)\n#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE の代わりに MLE を出す\n#endif\n\n\n//【階乗など（法が大きな素数）】\n/*\n* Factorial_mint(int N) : O(n)\n*\tN まで計算可能として初期化する．\n*\n* mint fact(int n) : O(1)\n*\tn! を返す．\n*\n* mint fact_inv(int n) : O(1)\n*\t1/n! を返す（n が負なら 0 を返す）\n*\n* mint inv(int n) : O(1)\n*\t1/n を返す．\n*\n* mint perm(int n, int r) : O(1)\n*\t順列の数 nPr を返す．\n*\n* mint perm_inv(int n, int r) : O(1)\n*\t順列の数の逆数 1/nPr を返す．\n*\n* mint bin(int n, int r) : O(1)\n*\t二項係数 nCr を返す．\n*\n* mint bin_inv(int n, int r) : O(1)\n*\t二項係数の逆数 1/nCr を返す．\n*\n* mint mul(vi rs) : O(|rs|)\n*\t多項係数 nC[rs] を返す．（n = Σrs）\n*\n* mint hom(int n, int r) : O(1)\n*\t重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\n*\n* mint neg_bin(int n, int r) : O(1)\n*\t負の二項係数 nCr = (-1)^r -n+r-1Cr を返す（n ≦ 0, r ≧ 0）\n*\n* mint pochhammer(int x, int n) : O(1)\n*\tポッホハマー記号 x^(n) を返す（n ≧ 0）\n*\n* mint pochhammer_inv(int x, int n) : O(1)\n*\tポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\n*/\nclass Factorial_mint {\n\tint n_max;\n\n\t// 階乗と階乗の逆数の値を保持するテーブル\n\tvm fac, fac_inv;\n\npublic:\n\t// n! までの階乗とその逆数を前計算しておく．O(n)\n\tFactorial_mint(int n) : n_max(n), fac(n + 1), fac_inv(n + 1) {\n\t\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\n\n\t\tfac[0] = 1;\n\t\trepi(i, 1, n) fac[i] = fac[i - 1] * i;\n\n\t\tfac_inv[n] = fac[n].inv();\n\t\trepir(i, n - 1, 0) fac_inv[i] = fac_inv[i + 1] * (i + 1);\n\t}\n\tFactorial_mint() : n_max(0) {} // ダミー\n\n\t// n! を返す．\n\tmint fact(int n) const {\n\t\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\n\n\t\tAssert(0 <= n && n <= n_max);\n\t\treturn fac[n];\n\t}\n\n\t// 1/n! を返す（n が負なら 0 を返す）\n\tmint fact_inv(int n) const {\n\t\t// verify : https://atcoder.jp/contests/abc289/tasks/abc289_h\n\n\t\tAssert(n <= n_max);\n\t\tif (n < 0) return 0;\n\t\treturn fac_inv[n];\n\t}\n\n\t// 1/n を返す．\n\tmint inv(int n) const {\n\t\t// verify : https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_d\n\n\t\tAssert(n > 0);\n\t\tAssert(n <= n_max);\n\t\treturn fac[n - 1] * fac_inv[n];\n\t}\n\n\t// 順列の数 nPr を返す．\n\tmint perm(int n, int r) const {\n\t\t// verify : https://atcoder.jp/contests/abc172/tasks/abc172_e\n\n\t\tAssert(n <= n_max);\n\n\t\tif (r < 0 || n - r < 0) return 0;\n\t\treturn fac[n] * fac_inv[n - r];\n\t}\n\n\t// 順列の数 nPr の逆数を返す．\n\tmint perm_inv(int n, int r) const {\n\t\t// verify : https://yukicoder.me/problems/no/3139\n\n\t\tAssert(n <= n_max);\n\t\tAssert(0 <= r); Assert(r <= n);\n\n\t\treturn fac_inv[n] * fac[n - r];\n\t}\n\n\t// 二項係数 nCr を返す．\n\tmint bin(int n, int r) const {\n\t\t// verify : https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod\n\n\t\tAssert(n <= n_max);\n\t\tif (r < 0 || n - r < 0) return 0;\n\t\treturn fac[n] * fac_inv[r] * fac_inv[n - r];\n\t}\n\n\t// 二項係数の逆数 1/nCr を返す．\n\tmint bin_inv(int n, int r) const {\n\t\t// verify : https://www.codechef.com/problems/RANDCOLORING\n\n\t\tAssert(n <= n_max);\n\t\tAssert(r >= 0);\n\t\tAssert(n - r >= 0);\n\t\treturn fac_inv[n] * fac[r] * fac[n - r];\n\t}\n\n\t// 多項係数 nC[rs] を返す．\n\tmint mul(const vi& rs) const {\n\t\t// verify : https://yukicoder.me/problems/no/2141\n\n\t\tif (*min_element(all(rs)) < 0) return 0;\n\t\tint n = accumulate(all(rs), 0);\n\t\tAssert(n <= n_max);\n\n\t\tmint res = fac[n];\n\t\trepe(r, rs) res *= fac_inv[r];\n\n\t\treturn res;\n\t}\n\n\t// 重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\n\tmint hom(int n, int r) {\n\t\t// verify : https://mojacoder.app/users/riantkb/problems/toj_ex_2\n\n\t\tif (n == 0) return (int)(r == 0);\n\t\tif (r < 0 || n - 1 < 0) return 0;\n\t\tAssert(n + r - 1 <= n_max);\n\t\treturn fac[n + r - 1] * fac_inv[r] * fac_inv[n - 1];\n\t}\n\n\t// 負の二項係数 nCr を返す（n ≦ 0, r ≧ 0）\n\tmint neg_bin(int n, int r) {\n\t\t// verify : https://atcoder.jp/contests/abc345/tasks/abc345_g\n\n\t\tif (n == 0) return (int)(r == 0);\n\t\tif (r < 0 || -n - 1 < 0) return 0;\n\t\tAssert(-n + r - 1 <= n_max);\n\t\treturn (r & 1 ? -1 : 1) * fac[-n + r - 1] * fac_inv[r] * fac_inv[-n - 1];\n\t}\n\n\t// ポッホハマー記号 x^(n) を返す（n ≧ 0）\n\tmint pochhammer(int x, int n) {\n\t\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\n\n\t\tint x2 = x + n - 1;\n\t\tif (x <= 0 && 0 <= x2) return 0;\n\n\t\tif (x > 0) {\n\t\t\tAssert(x2 <= n_max);\n\t\t\treturn fac[x2] * fac_inv[x - 1];\n\t\t}\n\t\telse {\n\t\t\tAssert(-x <= n_max);\n\t\t\treturn (n & 1 ? -1 : 1) * fac[-x] * fac_inv[-x2 - 1];\n\t\t}\n\t}\n\n\t// ポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\n\tmint pochhammer_inv(int x, int n) {\n\t\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\n\n\t\tint x2 = x + n - 1;\n\t\tAssert(!(x <= 0 && 0 <= x2));\n\n\t\tif (x > 0) {\n\t\t\tAssert(x2 <= n_max);\n\t\t\treturn fac_inv[x2] * fac[x - 1];\n\t\t}\n\t\telse {\n\t\t\tAssert(-x <= n_max);\n\t\t\treturn (n & 1 ? -1 : 1) * fac_inv[-x] * fac[-x2 - 1];\n\t\t}\n\t}\n};\n\n\nint main() {\n//\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\n\tint n, K;\n\tcin >> n >> K;\n\n\tvl a(n), b(n);\n\tcin >> a >> b;\n\n\tFactorial_mint fm(n + 10);\n\n\tll a_sum = accumulate(all(a), 0LL);\n\tll b_sum = accumulate(all(b), 0LL);\n\n\tvm pow2(n + 1);\n\tpow2[0] = 1;\n\trep(i, n) pow2[i + 1] = pow2[i] * 2;\n\n\tmint res = 0;\n\n\trepi(A, 1, K / 2) {\n\t\tint B = K - 2 * A;\n\t\tif (B >= n) continue;\n\t\tif (B < A) break;\n\n\t\t// n 本中 B 本を選んで A 個のブロックに分ける．\n\t\tmint cnt = fm.bin(B - 1, A - 1) * fm.bin(n - B - 1, A - 1);\n\t\tcnt *= 2 * pow2[A - 1] * fm.fact(A - 1);\n\n\t\tres += cnt * (a_sum * 2 * A + b_sum * B);\n\t}\n\n\tEXIT(res);\n}","accuracy":0.4,"time_ms":70,"memory_kb":22352,"score_of_the_acc":-0.1873,"final_rank":11},{"submission_id":"aoj_3169_6928687","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=9167167167167167167;\nconst int INF=100000000;\nconst ll mod=998244353;\n#define rep(i,a) for (ll i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\nnamespace po167{\nstruct combination{\n\tint upper;\n\tlong long MOD;\n\tstd::vector<long long> fact;\n\tstd::vector<long long> rev;\n\tstd::vector<long long> fact_rev;\n\tcombination(int max,long long mod):upper(max),MOD(mod),fact(max+1),rev(max+1),fact_rev(max+1){\n\t\tfor(long long i=0;i<=max;i++){\n\t\t\tif(i<2){\n\t\t\t\tfact[i]=1;\n\t\t\t\tfact_rev[i]=1;\n\t\t\t\trev[i]=1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfact[i]=(fact[i-1]*i)%mod;\n\t\t\trev[i]=mod-((mod/i)*rev[mod%i])%mod;\n\t\t\tfact_rev[i]=(fact_rev[i-1]*rev[i])%mod;\n\t\t}\n\t}\n\tlong long Comb(int x,int y){\n\t\tassert(upper>=x);\n\t\tif (x<y||y<0||x<0) return 0;\n\t\treturn (((fact_rev[y]*fact_rev[x-y])%MOD)*fact[x])%MOD;\n\t}\n\tlong long P(int x,int y){\n\t\tassert(upper>=x);\n\t\tif (x<y||y<0||x<0) return 0;\n\t\treturn (fact_rev[x-y]*fact[x])%MOD;\n\t}\n};\n}\nusing po167::combination;\n\nll jyo(ll x,ll y,ll z){\n ll H=y; //ここから\n ll a=1,b=(x%z+z)%z,c=1;\n while(H>0){\n a*=2;\n if(H%a!=0){\n H-=a/2;\n c*=b;\n c%=z;\n }\n b*=b;\n b%=z;\n } //ここまで\n return c;\n}\n\n\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\t//cin>>t;\n\trep(i,t) solve();\n}\n\nvoid solve(){\n\tll n,k;\n\tcin>>n>>k;\n\tll A=0,B=0;\n\trep(i,n){\n\t\tll a;\n\t\tcin>>a;\n\t\tA+=a;\n\t}rep(i,n){\n\t\tll a;\n\t\tcin>>a;\n\t\tB+=a;\n\t}\n\tA%=mod,B%=mod;\n\tcombination table(n,mod);\n\tll ans=0;\n\tfor(ll i=1;i<=n;i++){\n\t\tll tmp=(jyo(2,i,mod)*table.fact[i-1])%mod;\n\t\tll C=k-i*2;\n\t\tif(C<i||n-C<i) continue;\n\t\ttmp=(tmp*table.Comb(n-C-1,i-1))%mod;\n\t\ttmp=(tmp*table.Comb(C-1,i-1))%mod;\n\t\tans=(ans+(tmp*((i*2*A+B*C)%mod))%mod)%mod;\n\t}\n\tcout<<ans<<\"\\n\";\n}","accuracy":1,"time_ms":320,"memory_kb":26560,"score_of_the_acc":-0.5378,"final_rank":3},{"submission_id":"aoj_3169_5300091","code_snippet":"#include <bits/stdc++.h>\n\n\n\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast moduler by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m`\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n for (long long a : {2, 7, 61}) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\n#define rep(i, n) For((i), 0, (n))\n#define rrep(i, n) rFor((i), (n), 0)\n#define fi first\n#define se second\nusing namespace std;\ntypedef long long lint;\ntypedef unsigned long long ulint;\ntypedef pair<int, int> pii;\ntypedef pair<lint, lint> pll;\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nT div_floor(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a >= 0 ? a / b : (a + 1) / b - 1;\n}\ntemplate <class T>\nT div_ceil(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a > 0 ? (a - 1) / b + 1 : a / b;\n}\n\nconstexpr lint mod = 1000000007;\nconstexpr lint INF = mod * mod;\nconstexpr int MAX = 200010;\n\nusing namespace atcoder;\nusing mint = modint998244353;\n\nvector<mint> fact;\nvector<mint> revfact;\n\nvoid setfact(int n) {\n fact.resize(n + 1);\n revfact.resize(n + 1);\n fact[0] = 1;\n rep(i, n) fact[i + 1] = fact[i] * mint(i + 1);\n\n revfact[n] = fact[n].inv();\n for (int i = n - 1; i >= 0; i--) revfact[i] = revfact[i + 1] * mint(i + 1);\n}\n\nmint getC(int n, int r) {\n if (n < r || r < 0) return 0;\n return fact[n] * revfact[r] * revfact[n - r];\n}\n\nint main() {\n int n, K;\n scanf(\"%d%d\", &n, &K);\n mint side = 0, bottom = 0;\n rep(i, n) {\n int a;\n scanf(\"%d\", &a);\n side += a;\n }\n rep(i, n) {\n int a;\n scanf(\"%d\", &a);\n bottom += a;\n }\n\n setfact(2 * n);\n mint pow2 = 1, a = 0, b = 0;\n for (int l = 0; 2 * l < K; ++l) {\n mint c = fact[l - 1] * pow2 * getC(K - 2 * l - 1, l - 1) *\n getC(n - K + 2 * l - 1, l - 1);\n a += c * 2 * l;\n b += c * (K - 2 * l);\n pow2 *= 2;\n }\n printf(\"%u\\n\", (side * a + bottom * b).val());\n}","accuracy":1,"time_ms":150,"memory_kb":18804,"score_of_the_acc":-0.2299,"final_rank":1},{"submission_id":"aoj_3169_5300088","code_snippet":"#include <bits/stdc++.h>\n\n\n\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast moduler by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m`\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n for (long long a : {2, 7, 61}) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\n#define rep(i, n) For((i), 0, (n))\n#define rrep(i, n) rFor((i), (n), 0)\n#define fi first\n#define se second\nusing namespace std;\ntypedef long long lint;\ntypedef unsigned long long ulint;\ntypedef pair<int, int> pii;\ntypedef pair<lint, lint> pll;\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nT div_floor(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a >= 0 ? a / b : (a + 1) / b - 1;\n}\ntemplate <class T>\nT div_ceil(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a > 0 ? (a - 1) / b + 1 : a / b;\n}\n\nconstexpr lint mod = 1000000007;\nconstexpr lint INF = mod * mod;\nconstexpr int MAX = 200010;\n\nusing namespace atcoder;\nusing mint = modint998244353;\n\nvector<mint> fact;\nvector<mint> revfact;\n\nvoid setfact(int n) {\n fact.resize(n + 1);\n revfact.resize(n + 1);\n fact[0] = 1;\n rep(i, n) fact[i + 1] = fact[i] * mint(i + 1);\n\n revfact[n] = fact[n].inv();\n for (int i = n - 1; i >= 0; i--) revfact[i] = revfact[i + 1] * mint(i + 1);\n}\n\nmint getC(int n, int r) {\n if (n < r || r < 0) return 0;\n return fact[n] * revfact[r] * revfact[n - r];\n}\n\nint main() {\n int n, K;\n scanf(\"%d%d\", &n, &K);\n mint side = 0, bottom = 0;\n rep(i, n) {\n int a;\n scanf(\"%d\", &a);\n side += a;\n }\n rep(i, n) {\n int a;\n scanf(\"%d\", &a);\n bottom += a;\n }\n\n setfact(n);\n mint pow2 = 1, a = 0, b = 0;\n for (int l = 0; 2 * l < K; ++l) {\n mint c = fact[l - 1] * pow2 * getC(K - 2 * l - 1, l - 1) *\n getC(n - K + 2 * l - 1, l - 1);\n a += c * 2 * l;\n b += c * (K - 2 * l);\n pow2 *= 2;\n }\n printf(\"%u\\n\", (side * a + bottom * b).val());\n}","accuracy":0.8,"time_ms":140,"memory_kb":10808,"score_of_the_acc":-0.1047,"final_rank":9},{"submission_id":"aoj_3169_4964416","code_snippet":"#include <bits/stdc++.h>\n\n#include<bits/stdc++.h>\n\nnamespace ProconLib{\n\n template<typename MInt>\n class ModCombination{\n int N;\n std::vector<MInt> fact;\n std::vector<MInt> factInv;\n public:\n ModCombination(int n);\n MInt F(int n){return fact[n];}\n MInt FI(int n){return factInv[n];}\n MInt P(int n,int k){return fact[n]*factInv[n-k];}\n MInt PI(int n,int k){return factInv[n]*fact[n-k];}\n MInt C(int n,int k){return fact[n]*factInv[k]*factInv[n-k];}\n MInt CI(int n,int k){return factInv[n]*fact[k]*fact[n-k];}\n };\n\n template<typename MInt>\n ModCombination<MInt>::ModCombination(int n):N(n),fact(n+1),factInv(n+1){\n fact[0]=MInt(1);\n for(int i=1;i<=n;i++) fact[i]=fact[i-1]*MInt(i);\n factInv[n]=inv(fact[n]);\n for(int i=n-1;i>=0;i--){\n factInv[i]=factInv[i+1]*MInt(i+1);\n }\n }\n \n}\n#include<iostream>\n\nnamespace ProconLib{\n using ll=long long;\n using Int=int;\n template<Int MOD,bool IsPrime=true>\n class ModInt{\n Int n; \n static Int regularize(int n){Int tmp=n%MOD; return tmp>=0 ? tmp : tmp+MOD;}\n static Int regularize(ll n){Int tmp=n%MOD; return tmp>=0 ? tmp : tmp+MOD;}\n public:\n ModInt():n(0){};\n ModInt(int n):n(regularize(n)){}\n ModInt(long long n):n(regularize(n)){}\n ModInt(const ModInt<MOD,IsPrime> &mn):n(mn.n){}\n explicit operator int() const{return n;}\n explicit operator long long() const{return n;}\n\n ModInt<MOD,IsPrime>& operator+=(ModInt<MOD,IsPrime> rhs);\n ModInt<MOD,IsPrime>& operator-=(ModInt<MOD,IsPrime> rhs);\n ModInt<MOD,IsPrime>& operator*=(ModInt<MOD,IsPrime> rhs);\n\n bool operator==(ModInt<MOD,IsPrime> rhs){return n==rhs.n;}\n const Int& get() const {return n;}\n void set(int x){n=regularize(x);}\n void set(ll x){n=regularize(x);} \n };\n\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator+(ModInt<MOD,IsPrime> lhs,ModInt<MOD,IsPrime> rhs){return lhs+=rhs;};\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator+(ModInt<MOD,IsPrime> lhs,int rhs){return lhs+ModInt<MOD,IsPrime>(rhs);}\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator+(ModInt<MOD,IsPrime> lhs,ll rhs){return lhs+ModInt<MOD,IsPrime>(rhs);}\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator+(int lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)+rhs;}\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator+(ll lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)+rhs;}\n\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator+(ModInt<MOD,IsPrime> mn){return mn;};\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator-(ModInt<MOD,IsPrime> mn){return ModInt<MOD,IsPrime>(-mn.get());};\n\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator-(ModInt<MOD,IsPrime> lhs,ModInt<MOD,IsPrime> rhs){return lhs-=rhs;};\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator-(ModInt<MOD,IsPrime> lhs,int rhs){return lhs-ModInt<MOD,IsPrime>(rhs);};\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator-(ModInt<MOD,IsPrime> lhs,ll rhs){return lhs-ModInt<MOD,IsPrime>(rhs);};\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator-(int lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)-rhs;};\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator-(ll lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)-rhs;};\n\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator*(ModInt<MOD,IsPrime> lhs,ModInt<MOD,IsPrime> rhs){return lhs*=rhs;};\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator*(ModInt<MOD,IsPrime> lhs,int rhs){return lhs*ModInt<MOD,IsPrime>(rhs);}\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator*(ModInt<MOD,IsPrime> lhs,ll rhs){return lhs*ModInt<MOD,IsPrime>(rhs);}\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator*(ll lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)*rhs;}\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> operator*(int lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)*rhs;}\n\n template<Int MOD>\n ModInt<MOD,true> operator/(ModInt<MOD,true> lhs,ModInt<MOD,true> rhs);\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> powm(ModInt<MOD,IsPrime> x,Int k);\n template<Int MOD>\n ModInt<MOD,true> inv(ModInt<MOD,true> x){return powm(x,MOD-2);}\n\n template<Int MOD,bool IsPrime>\n std::ostream& operator<<(std::ostream& os,const ModInt<MOD,IsPrime> &mn);\n \n\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime>& ModInt<MOD,IsPrime>::operator+=(ModInt<MOD,IsPrime> rhs){\n n+=rhs.n;\n n= n>=MOD ? n-MOD : n;\n return *this;\n }\n \n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime>& ModInt<MOD,IsPrime>::operator-=(ModInt rhs){\n n=n-rhs.n<0 ? n-rhs.n+MOD : n-rhs.n;\n return *this;\n }\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime>& ModInt<MOD,IsPrime>::operator*=(ModInt<MOD,IsPrime> rhs){\n n=ll(n)*rhs.n%MOD;\n return *this;\n }\n \n template<Int MOD>\n ModInt<MOD,true> operator/(ModInt<MOD,true> lhs,ModInt<MOD,true> rhs){\n return lhs*inv(rhs);\n }\n template<Int MOD,bool IsPrime>\n ModInt<MOD,IsPrime> powm(ModInt<MOD,IsPrime> x,Int k){\n ModInt<MOD,IsPrime> res(1);\n while(k){\n if(k&1) res*=x;\n k>>=1;\n x*=x;\n }\n return res;\n }\n\n template<Int MOD,bool IsPrime>\n std::ostream& operator<<(std::ostream& os,const ModInt<MOD,IsPrime> &mn){\n os<<mn.get();\n return os;\n }\n\n template<Int MOD,bool IsPrime>\n std::istream& operator>>(std::istream& is,ModInt<MOD,IsPrime> &mn){\n Int tmp;\n is>>tmp;\n mn.set(tmp);\n return is;\n }\n}\n\nusing namespace std;\n\nusing ll = long long;\nconst ll MOD = 998244353;\nusing mInt = ProconLib::ModInt<MOD, true>;\nconst int MAX_N = 4000000;\nProconLib::ModCombination<mInt> mComb(MAX_N);\n\nmInt fact(ll x) { return mComb.F(x); }\nmInt calc(ll n, ll k) {\n if (n == 0 && k == 0) return 1;\n if (k <= 0) return 0;\n if (n<0) return 0;\n return mComb.C(n + k - 1, k - 1);\n}\n\nint main() {\n ll n, k;\n cin >> n >> k;\n\n vector<int> a(n);\n vector<int> b(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n for (int i = 0; i < n; i++) cin >> b[i];\n\n mInt P = 0;\n for (int i = 1; i <= n; i++) {\n mInt x = mInt(k - 2 * i) * mInt(2) * mInt(n);\n mInt y = mInt(powm(mInt(2), i - 1)) * fact(i - 1);\n mInt z = calc(k - 2 * i - i, i) * calc(n - (k - 2 * i) - i, i);\n // cerr << \"#P \" << i << \" \" << x << \" \" << y << \" \" << z << endl;\n P += x * y * z;\n }\n P = P / mInt(n);\n // cerr << P << endl;\n\n mInt Q = 0;\n for (int i = 1; i <= n; i++) {\n mInt x = mInt(2) * mInt(i) * mInt(2) * mInt(n);\n mInt y = powm(mInt(2), i - 1) * fact(i - 1);\n mInt z = calc(k - 2 * i - i, i) * calc(n - (k - 2 * i) - i, i);\n // cerr << \"#Q \" << i << \" \" << x << \" \" << y << \" \" << z << endl;\n Q += x * y * z;\n }\n Q = Q / mInt(n);\n\n mInt asum = accumulate(a.begin(), a.end(), 0LL);\n mInt bsum = accumulate(b.begin(), b.end(), 0LL);\n mInt ans = bsum * P + asum * Q;\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":610,"memory_kb":42136,"score_of_the_acc":-1.0964,"final_rank":5},{"submission_id":"aoj_3169_4883802","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 2020000;\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\nconst double pi = acos(-1);\nconst double eps = 1e-10;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << \"debug: \" << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << \"debug: \" << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\ntemplate <std::uint_fast64_t Modulus> class modint {\n using u64 = std::uint_fast64_t;\n\npublic:\n u64 a;\n\n constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}\n constexpr u64 &value() noexcept { return a; }\n constexpr const u64 &value() const noexcept { return a; }\n constexpr modint operator+(const modint rhs) const noexcept {\n\treturn modint(*this) += rhs;\n }\n constexpr modint operator-(const modint rhs) const noexcept {\n\treturn modint(*this) -= rhs;\n }\n constexpr modint operator*(const modint rhs) const noexcept {\n\treturn modint(*this) *= rhs;\n }\n constexpr modint operator/(const modint rhs) const noexcept {\n\treturn modint(*this) /= rhs;\n }\n constexpr modint &operator+=(const modint rhs) noexcept {\n\ta += rhs.a;\n\tif (a >= Modulus) {\n\t a -= Modulus;\n\t}\n\treturn *this;\n }\n constexpr modint &operator-=(const modint rhs) noexcept {\n\tif (a < rhs.a) {\n\t a += Modulus;\n\t}\n\ta -= rhs.a;\n\treturn *this;\n }\n constexpr modint &operator*=(const modint rhs) noexcept {\n\ta = a * rhs.a % Modulus;\n\treturn *this;\n }\n constexpr modint &operator/=(modint rhs) noexcept {\n\tu64 exp = Modulus - 2;\n\twhile (exp) {\n\t if (exp % 2) {\n\t\t*this *= rhs;\n\t }\n\t rhs *= rhs;\n\t exp /= 2;\n\t}\n\treturn *this;\n }\n};\n\nusing mint = modint<mod>;\n\nvector<ll> fac(MAX), finv(MAX), inv(MAX);\n\nvoid comInit(){\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor(ll i=2; i<MAX; i++){\n\t\tfac[i] = fac[i-1]*i % mod;\n\t\tinv[i] = mod - inv[mod%i] * (mod/i) % mod;\n\t\tfinv[i] = finv[i-1] * inv[i] % mod;\n\t}\n}\n\n\nll com(ll n, ll k){\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n-k] % mod) % mod;\n}\n\nll modpow(ll x, ll n, ll mod){\n\tll res = 1;\n\twhile(n > 0){\n\t\tif(n & 1) res = res * x % mod;\n\t\tx = x * x % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nint main(){\n\tll n,k; cin >> n >> k;\n\tmint suma = 0, sumb = 0;\n\tvl a(n); rep(i,n) cin >> a[i], suma += a[i];\n\tvl b(n); rep(i,n) cin >> b[i], sumb += b[i];\n\tcomInit();\n\tmint ans = 0;\n\tfor(int t=1; t*3<=k; t++){\n\t\tmint tmp = modpow(2,t,mod);\n\t\ttmp = tmp * fac[t-1] * com(k-t*2-1,t-1) * com(n+t*2-k-1,t-1);\n\t\tans += suma * tmp * t * 2 + sumb * tmp * (k-2*t);\n\t}\n\tcout << ans.value() << \"\\n\";\n}","accuracy":1,"time_ms":670,"memory_kb":65920,"score_of_the_acc":-1.5041,"final_rank":7},{"submission_id":"aoj_3169_4883357","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 2020000;\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\nconst double pi = acos(-1);\nconst double eps = 1e-10;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << \"debug: \" << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << \"debug: \" << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\ntemplate <std::uint_fast64_t Modulus> class modint {\n using u64 = std::uint_fast64_t;\n\npublic:\n u64 a;\n\n constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}\n constexpr u64 &value() noexcept { return a; }\n constexpr const u64 &value() const noexcept { return a; }\n constexpr modint operator+(const modint rhs) const noexcept {\n\treturn modint(*this) += rhs;\n }\n constexpr modint operator-(const modint rhs) const noexcept {\n\treturn modint(*this) -= rhs;\n }\n constexpr modint operator*(const modint rhs) const noexcept {\n\treturn modint(*this) *= rhs;\n }\n constexpr modint operator/(const modint rhs) const noexcept {\n\treturn modint(*this) /= rhs;\n }\n constexpr modint &operator+=(const modint rhs) noexcept {\n\ta += rhs.a;\n\tif (a >= Modulus) {\n\t a -= Modulus;\n\t}\n\treturn *this;\n }\n constexpr modint &operator-=(const modint rhs) noexcept {\n\tif (a < rhs.a) {\n\t a += Modulus;\n\t}\n\ta -= rhs.a;\n\treturn *this;\n }\n constexpr modint &operator*=(const modint rhs) noexcept {\n\ta = a * rhs.a % Modulus;\n\treturn *this;\n }\n constexpr modint &operator/=(modint rhs) noexcept {\n\tu64 exp = Modulus - 2;\n\twhile (exp) {\n\t if (exp % 2) {\n\t\t*this *= rhs;\n\t }\n\t rhs *= rhs;\n\t exp /= 2;\n\t}\n\treturn *this;\n }\n};\n\nusing mint = modint<mod>;\n\nvector<ll> fac(MAX), finv(MAX), inv(MAX);\n\nvoid comInit(){\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor(ll i=2; i<MAX; i++){\n\t\tfac[i] = fac[i-1]*i % mod;\n\t\tinv[i] = mod - inv[mod%i] * (mod/i) % mod;\n\t\tfinv[i] = finv[i-1] * inv[i] % mod;\n\t}\n}\n\n\nll com(ll n, ll k){\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n-k] % mod) % mod;\n}\n\nll modpow(ll x, ll n, ll mod){\n\tll res = 1;\n\twhile(n > 0){\n\t\tif(n & 1) res = res * x % mod;\n\t\tx = x * x % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nint main(){\n\tll n,k; cin >> n >> k;\n\tmint suma = 0, sumb = 0;\n\tvl a(n); rep(i,n) cin >> a[i], suma += a[i];\n\tvl b(n); rep(i,n) cin >> b[i], sumb += b[i];\n\tcomInit();\n\tmint ans = 0;\n\tfor(int t=0; t*3<=k-3; t++){\n\t\tif(n-2+t < k-3) continue;\n\t\tll rest = k-3 - t*3;\n\t\tans += (suma * (t+1) * 4 + sumb * (rest+t+1) * 2) * com(t+rest,rest) * modpow(2,t,mod);\n\t}\n\tcout << ans.value() << \"\\n\";\n}","accuracy":0.1,"time_ms":50,"memory_kb":49872,"score_of_the_acc":-0.5551,"final_rank":16},{"submission_id":"aoj_3169_4880472","code_snippet":"#include <iostream>\n#include <array>\n#include <algorithm>\n#include <vector>\n#include <bitset>\n#include <set>\n#include <unordered_set>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <iterator>\n#include <numeric>\n#include <map>\n#include <unordered_map>\n#include <queue>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <limits>\n#include <iomanip>\n#include <functional>\n#include <cassert>\n// #include <atcoder/all>\nusing namespace std;\n\nusing ll=long long;\ntemplate<class T> using V = vector<T>;\ntemplate<class T, class U> using P = pair<T, U>;\nusing vll = V<ll>;\nusing vvll = V<vll>;\n#define ALL(v) v.begin(),v.end()\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\n':' ');\n\nconst long long MOD = 998244353;\nconst long long HIGHINF = (long long)1e18;\nconst int INF = (int)1e9;\n\nclass ModInt {\npublic:\n long long x;\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\n constexpr ModInt& operator+=(const ModInt rhs) {\n x += rhs.x;\n if (x >= MOD) x -= MOD;\n return *this;\n }\n constexpr ModInt operator+(const ModInt rhs) const {\n return ModInt(*this) += rhs; \n }\n constexpr ModInt& operator-=(const ModInt& rhs) {\n x -= rhs.x;\n if (x < 0) x += MOD;\n return *this;\n }\n constexpr ModInt operator-(const ModInt rhs) const {\n return ModInt(*this) -= rhs; \n }\n constexpr ModInt& operator*=(const ModInt& rhs) {\n x = x * rhs.x % MOD;\n return *this;\n }\n constexpr ModInt operator*(const ModInt rhs) const {\n return ModInt(*this) *= rhs; \n }\n constexpr ModInt& operator/=(const ModInt& rhs) {\n ModInt div = powmod(rhs, MOD - 2);\n (x *= div.x) %= MOD;\n return *this;\n }\n constexpr ModInt operator/(const ModInt rhs) const {\n return ModInt(*this) /= rhs;\n }\n constexpr ModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n }\n constexpr ModInt& operator++() {\n x += 1;\n return *this;\n }\n constexpr ModInt operator++(int) {\n ModInt tmp(*this);\n operator++();\n return tmp;\n }\n constexpr ModInt& operator--() {\n x -= 1;\n return *this;\n }\n constexpr ModInt operator--(int) {\n ModInt tmp(*this);\n operator--();\n return tmp;\n }\n\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\n os << rhs.x;\n return os;\n }\n friend istream& operator>>(istream& is, ModInt& rhs) {\n is >> rhs.x;\n return is;\n }\n};\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\n return lhs.x == rhs.x;\n}\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\n return !(lhs == rhs);\n}\nModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n}\n\nusing modi = ModInt;\n\n\n// [ModInt]\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\nconst int NMAX = 2000005;\ntemplate < typename T >\nclass Combination {\npublic:\n std::vector<T> fac, invfac;\n Combination() {\n fac.resize(NMAX), invfac.resize(NMAX);\n fac[0] = fac[1] = T(1);\n invfac[0] = invfac[1] = T(1);\n for (int i = 2; i <= NMAX; i++) {\n fac[i] = fac[i - 1] * T(i);\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\n }\n }\n\n // nCr = n! / r!(n-r)!\n T nCr(int n, int r) {\n if (n < 0 || r > n || r < 0) return T(0);\n return fac[n] * invfac[r] * invfac[n - r];\n }\n \n // 重複組み合わせ nHr = (n + r - 1)C(r)\n T nHr(int n, int r) {\n return nCr(n + r - 1, r);\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, k; cin >> n >> k;\n Combination<modi> comb;\n\n modi asum = 0, bsum = 0;\n for (int i = 0; i < n; i++) {\n ll a; cin >> a; asum += modi(a);\n }\n for (int i = 0; i < n; i++) {\n ll b; cin >> b; bsum += modi(b);\n }\n V<modi> fac(n + 1, 1), pow2(n + 1, 1);\n pow2[1] = modi(2);\n for (int i = 2; i < n; i++) {\n fac[i] = fac[i - 1] * modi(i);\n pow2[i] = pow2[i - 1] * modi(2);\n }\n\n modi ans = 0;\n for (int cyc = 1; 2 * cyc <= k; cyc++) {\n modi tmp = pow2[cyc] * fac[cyc - 1] * comb.nHr(cyc, k - 3 * cyc) * comb.nHr(cyc, n - k + cyc);\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":500,"memory_kb":50096,"score_of_the_acc":-1.0816,"final_rank":4},{"submission_id":"aoj_3169_4880458","code_snippet":"#include <iostream>\n#include <array>\n#include <algorithm>\n#include <vector>\n#include <bitset>\n#include <set>\n#include <unordered_set>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <iterator>\n#include <numeric>\n#include <map>\n#include <unordered_map>\n#include <queue>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <limits>\n#include <iomanip>\n#include <functional>\n#include <cassert>\n// #include <atcoder/all>\nusing namespace std;\n\nusing ll=long long;\ntemplate<class T> using V = vector<T>;\ntemplate<class T, class U> using P = pair<T, U>;\nusing vll = V<ll>;\nusing vvll = V<vll>;\n#define ALL(v) v.begin(),v.end()\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\n':' ');\n\nconst long long MOD = 998244353;\nconst long long HIGHINF = (long long)1e18;\nconst int INF = (int)1e9;\n\nclass ModInt {\npublic:\n long long x;\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\n constexpr ModInt& operator+=(const ModInt rhs) {\n x += rhs.x;\n if (x >= MOD) x -= MOD;\n return *this;\n }\n constexpr ModInt operator+(const ModInt rhs) const {\n return ModInt(*this) += rhs; \n }\n constexpr ModInt& operator-=(const ModInt& rhs) {\n x -= rhs.x;\n if (x < 0) x += MOD;\n return *this;\n }\n constexpr ModInt operator-(const ModInt rhs) const {\n return ModInt(*this) -= rhs; \n }\n constexpr ModInt& operator*=(const ModInt& rhs) {\n x = x * rhs.x % MOD;\n return *this;\n }\n constexpr ModInt operator*(const ModInt rhs) const {\n return ModInt(*this) *= rhs; \n }\n constexpr ModInt& operator/=(const ModInt& rhs) {\n ModInt div = powmod(rhs, MOD - 2);\n (x *= div.x) %= MOD;\n return *this;\n }\n constexpr ModInt operator/(const ModInt rhs) const {\n return ModInt(*this) /= rhs;\n }\n constexpr ModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n }\n constexpr ModInt& operator++() {\n x += 1;\n return *this;\n }\n constexpr ModInt operator++(int) {\n ModInt tmp(*this);\n operator++();\n return tmp;\n }\n constexpr ModInt& operator--() {\n x -= 1;\n return *this;\n }\n constexpr ModInt operator--(int) {\n ModInt tmp(*this);\n operator--();\n return tmp;\n }\n\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\n os << rhs.x;\n return os;\n }\n friend istream& operator>>(istream& is, ModInt& rhs) {\n is >> rhs.x;\n return is;\n }\n};\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\n return lhs.x == rhs.x;\n}\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\n return !(lhs == rhs);\n}\nModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n}\n\nusing modi = ModInt;\n\n\n// [ModInt]\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\nconst int NMAX = 5000005;\ntemplate < typename T >\nclass Combination {\npublic:\n std::vector<T> fac, invfac;\n Combination() {\n fac.resize(NMAX), invfac.resize(NMAX);\n fac[0] = fac[1] = T(1);\n invfac[0] = invfac[1] = T(1);\n for (int i = 2; i <= NMAX; i++) {\n fac[i] = fac[i - 1] * T(i);\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\n }\n }\n\n // nCr = n! / r!(n-r)!\n T nCr(int n, int r) {\n if (n < 0 || r > n || r < 0) return T(0);\n return fac[n] * invfac[r] * invfac[n - r];\n }\n \n // 重複組み合わせ nHr = (n + r - 1)C(r)\n T nHr(int n, int r) {\n return nCr(n + r - 1, r);\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, k; cin >> n >> k;\n Combination<modi> comb;\n\n modi asum = 0, bsum = 0;\n for (int i = 0; i < n; i++) {\n ll a, b; cin >> a >> b;\n asum += modi(a), bsum += modi(b);\n }\n V<modi> fac(n + 1, 1), pow2(n + 1, 1);\n pow2[1] = modi(2);\n for (int i = 2; i <= n; i++) {\n fac[i] = fac[i - 1] * modi(i);\n pow2[i] = pow2[i - 1] * modi(2);\n }\n\n modi ans = 0;\n for (int cyc = 1; 2 * cyc <= k; cyc++) {\n modi tmp = pow2[cyc] * fac[cyc - 1] * comb.nCr(k - 2 * cyc - 1, k - 3 * cyc) * comb.nCr(n - k + 2 * cyc - 1, n - k + cyc);\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":0.1,"time_ms":910,"memory_kb":81176,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_3169_4880452","code_snippet":"#include <iostream>\n#include <array>\n#include <algorithm>\n#include <vector>\n#include <bitset>\n#include <set>\n#include <unordered_set>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <iterator>\n#include <numeric>\n#include <map>\n#include <unordered_map>\n#include <queue>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <limits>\n#include <iomanip>\n#include <functional>\n#include <cassert>\n// #include <atcoder/all>\nusing namespace std;\n\nusing ll=long long;\ntemplate<class T> using V = vector<T>;\ntemplate<class T, class U> using P = pair<T, U>;\nusing vll = V<ll>;\nusing vvll = V<vll>;\n#define ALL(v) v.begin(),v.end()\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\n':' ');\n\nconst long long MOD = 998244353;\nconst long long HIGHINF = (long long)1e18;\nconst int INF = (int)1e9;\n\nclass ModInt {\npublic:\n long long x;\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\n constexpr ModInt& operator+=(const ModInt rhs) {\n x += rhs.x;\n if (x >= MOD) x -= MOD;\n return *this;\n }\n constexpr ModInt operator+(const ModInt rhs) const {\n return ModInt(*this) += rhs; \n }\n constexpr ModInt& operator-=(const ModInt& rhs) {\n x -= rhs.x;\n if (x < 0) x += MOD;\n return *this;\n }\n constexpr ModInt operator-(const ModInt rhs) const {\n return ModInt(*this) -= rhs; \n }\n constexpr ModInt& operator*=(const ModInt& rhs) {\n x = x * rhs.x % MOD;\n return *this;\n }\n constexpr ModInt operator*(const ModInt rhs) const {\n return ModInt(*this) *= rhs; \n }\n constexpr ModInt& operator/=(const ModInt& rhs) {\n ModInt div = powmod(rhs, MOD - 2);\n (x *= div.x) %= MOD;\n return *this;\n }\n constexpr ModInt operator/(const ModInt rhs) const {\n return ModInt(*this) /= rhs;\n }\n constexpr ModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n }\n constexpr ModInt& operator++() {\n x += 1;\n return *this;\n }\n constexpr ModInt operator++(int) {\n ModInt tmp(*this);\n operator++();\n return tmp;\n }\n constexpr ModInt& operator--() {\n x -= 1;\n return *this;\n }\n constexpr ModInt operator--(int) {\n ModInt tmp(*this);\n operator--();\n return tmp;\n }\n\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\n os << rhs.x;\n return os;\n }\n friend istream& operator>>(istream& is, ModInt& rhs) {\n is >> rhs.x;\n return is;\n }\n};\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\n return lhs.x == rhs.x;\n}\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\n return !(lhs == rhs);\n}\nModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n}\n\nusing modi = ModInt;\n\n\n// [ModInt]\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\nconst int NMAX = 5000005;\ntemplate < typename T >\nclass Combination {\npublic:\n std::vector<T> fac, invfac;\n Combination() {\n fac.resize(NMAX), invfac.resize(NMAX);\n fac[0] = fac[1] = T(1);\n invfac[0] = invfac[1] = T(1);\n for (int i = 2; i <= NMAX; i++) {\n fac[i] = fac[i - 1] * T(i);\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\n }\n }\n\n // nCr = n! / r!(n-r)!\n T nCr(int n, int r) {\n if (n < 0 || r > n || r < 0) return T(0);\n return fac[n] * invfac[r] * invfac[n - r];\n }\n \n // 重複組み合わせ nHr = (n + r - 1)C(r - 1)\n T nHr(int n, int r) {\n return nCr(n + r - 1, r);\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, k; cin >> n >> k;\n Combination<modi> comb;\n\n modi asum = 0, bsum = 0;\n for (int i = 0; i < n; i++) {\n modi a, b; cin >> a >> b;\n asum += modi(a), bsum += modi(b);\n }\n asum /= modi(n), bsum /= modi(n);\n V<modi> fac(n, 1), pow2(n, 1);\n pow2[1] = 2;\n for (int i = 2; i < n; i++) {\n fac[i] = fac[i - 1] * modi(i);\n pow2[i] = pow2[i - 1] * modi(2);\n }\n\n modi ans = 0;\n for (int cyc = 1; 2 * cyc <= k; cyc++) {\n modi tmp = pow2[cyc] * fac[cyc - 1] * modi(n) * comb.nHr(cyc, k - 3 * cyc) * comb.nHr(cyc, n - k + cyc);\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":0.1,"time_ms":910,"memory_kb":81148,"score_of_the_acc":-1.9996,"final_rank":19},{"submission_id":"aoj_3169_4880444","code_snippet":"#include <iostream>\n#include <array>\n#include <algorithm>\n#include <vector>\n#include <bitset>\n#include <set>\n#include <unordered_set>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <iterator>\n#include <numeric>\n#include <map>\n#include <unordered_map>\n#include <queue>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <limits>\n#include <iomanip>\n#include <functional>\n#include <cassert>\n// #include <atcoder/all>\nusing namespace std;\n\nusing ll=long long;\ntemplate<class T> using V = vector<T>;\ntemplate<class T, class U> using P = pair<T, U>;\nusing vll = V<ll>;\nusing vvll = V<vll>;\n#define ALL(v) v.begin(),v.end()\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\n':' ');\n\nconst long long MOD = 998244353;\nconst long long HIGHINF = (long long)1e18;\nconst int INF = (int)1e9;\n\nclass ModInt {\npublic:\n long long x;\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\n constexpr ModInt& operator+=(const ModInt rhs) {\n x += rhs.x;\n if (x >= MOD) x -= MOD;\n return *this;\n }\n constexpr ModInt operator+(const ModInt rhs) const {\n return ModInt(*this) += rhs; \n }\n constexpr ModInt& operator-=(const ModInt& rhs) {\n x -= rhs.x;\n if (x < 0) x += MOD;\n return *this;\n }\n constexpr ModInt operator-(const ModInt rhs) const {\n return ModInt(*this) -= rhs; \n }\n constexpr ModInt& operator*=(const ModInt& rhs) {\n x = x * rhs.x % MOD;\n return *this;\n }\n constexpr ModInt operator*(const ModInt rhs) const {\n return ModInt(*this) *= rhs; \n }\n constexpr ModInt& operator/=(const ModInt& rhs) {\n ModInt div = powmod(rhs, MOD - 2);\n (x *= div.x) %= MOD;\n return *this;\n }\n constexpr ModInt operator/(const ModInt rhs) const {\n return ModInt(*this) /= rhs;\n }\n constexpr ModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n }\n constexpr ModInt& operator++() {\n x += 1;\n return *this;\n }\n constexpr ModInt operator++(int) {\n ModInt tmp(*this);\n operator++();\n return tmp;\n }\n constexpr ModInt& operator--() {\n x -= 1;\n return *this;\n }\n constexpr ModInt operator--(int) {\n ModInt tmp(*this);\n operator--();\n return tmp;\n }\n\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\n os << rhs.x;\n return os;\n }\n friend istream& operator>>(istream& is, ModInt& rhs) {\n is >> rhs.x;\n return is;\n }\n};\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\n return lhs.x == rhs.x;\n}\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\n return !(lhs == rhs);\n}\nModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n}\n\nusing modi = ModInt;\n\n\n// [ModInt]\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\nconst int NMAX = 1000005;\ntemplate < typename T >\nclass Combination {\npublic:\n std::vector<T> fac, invfac;\n Combination() {\n fac.resize(NMAX), invfac.resize(NMAX);\n fac[0] = fac[1] = T(1);\n invfac[0] = invfac[1] = T(1);\n for (int i = 2; i <= NMAX; i++) {\n fac[i] = fac[i - 1] * T(i);\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\n }\n }\n\n // nCr = n! / r!(n-r)!\n T nCr(int n, int r) {\n if (n < 0 || r > n || r < 0) return T(0);\n return fac[n] * invfac[r] * invfac[n - r];\n }\n \n // 重複組み合わせ nHr = (n + r - 1)C(r - 1)\n T nHr(int n, int r) {\n return nCr(n + r - 1, r);\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, k; cin >> n >> k;\n Combination<modi> comb;\n\n modi asum = 0, bsum = 0;\n for (int i = 0; i < n; i++) {\n modi a, b; cin >> a >> b;\n asum += modi(a), bsum += modi(b);\n }\n asum /= modi(n), bsum /= modi(n);\n V<modi> fac(n, 1), pow2(n, 1);\n pow2[1] = 2;\n for (int i = 2; i < n; i++) {\n fac[i] = fac[i - 1] * modi(i);\n pow2[i] = pow2[i - 1] * modi(2);\n }\n\n modi ans = 0;\n for (int cyc = 1; 2 * cyc <= k; cyc++) {\n modi tmp = pow2[cyc] * fac[cyc - 1] * modi(n) * comb.nHr(cyc, k - 3 * cyc) * comb.nHr(cyc, n - k + cyc);\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":0.1,"time_ms":180,"memory_kb":18772,"score_of_the_acc":-0.2643,"final_rank":15},{"submission_id":"aoj_3169_4880443","code_snippet":"#include <iostream>\n#include <array>\n#include <algorithm>\n#include <vector>\n#include <bitset>\n#include <set>\n#include <unordered_set>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <iterator>\n#include <numeric>\n#include <map>\n#include <unordered_map>\n#include <queue>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <limits>\n#include <iomanip>\n#include <functional>\n#include <cassert>\n// #include <atcoder/all>\nusing namespace std;\n\nusing ll=long long;\ntemplate<class T> using V = vector<T>;\ntemplate<class T, class U> using P = pair<T, U>;\nusing vll = V<ll>;\nusing vvll = V<vll>;\n#define ALL(v) v.begin(),v.end()\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\n':' ');\n\nconst long long MOD = 998244353;\nconst long long HIGHINF = (long long)1e18;\nconst int INF = (int)1e9;\n\nclass ModInt {\npublic:\n long long x;\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\n constexpr ModInt& operator+=(const ModInt rhs) {\n x += rhs.x;\n if (x >= MOD) x -= MOD;\n return *this;\n }\n constexpr ModInt operator+(const ModInt rhs) const {\n return ModInt(*this) += rhs; \n }\n constexpr ModInt& operator-=(const ModInt& rhs) {\n x -= rhs.x;\n if (x < 0) x += MOD;\n return *this;\n }\n constexpr ModInt operator-(const ModInt rhs) const {\n return ModInt(*this) -= rhs; \n }\n constexpr ModInt& operator*=(const ModInt& rhs) {\n x = x * rhs.x % MOD;\n return *this;\n }\n constexpr ModInt operator*(const ModInt rhs) const {\n return ModInt(*this) *= rhs; \n }\n constexpr ModInt& operator/=(const ModInt& rhs) {\n ModInt div = powmod(rhs, MOD - 2);\n (x *= div.x) %= MOD;\n return *this;\n }\n constexpr ModInt operator/(const ModInt rhs) const {\n return ModInt(*this) /= rhs;\n }\n constexpr ModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n }\n constexpr ModInt& operator++() {\n x += 1;\n return *this;\n }\n constexpr ModInt operator++(int) {\n ModInt tmp(*this);\n operator++();\n return tmp;\n }\n constexpr ModInt& operator--() {\n x -= 1;\n return *this;\n }\n constexpr ModInt operator--(int) {\n ModInt tmp(*this);\n operator--();\n return tmp;\n }\n\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\n os << rhs.x;\n return os;\n }\n friend istream& operator>>(istream& is, ModInt& rhs) {\n is >> rhs.x;\n return is;\n }\n};\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\n return lhs.x == rhs.x;\n}\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\n return !(lhs == rhs);\n}\nModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n}\n\nusing modi = ModInt;\n\n\n// [ModInt]\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\nconst int NMAX = 1000005;\ntemplate < typename T >\nclass Combination {\npublic:\n std::vector<T> fac, invfac;\n Combination() {\n fac.resize(NMAX), invfac.resize(NMAX);\n fac[0] = fac[1] = T(1);\n invfac[0] = invfac[1] = T(1);\n for (int i = 2; i <= NMAX; i++) {\n fac[i] = fac[i - 1] * T(i);\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\n }\n }\n\n // nCr = n! / r!(n-r)!\n T nCr(int n, int r) {\n if (n < 0 || r > n || r < 0) return T(0);\n return fac[n] * invfac[r] * invfac[n - r];\n }\n \n // 重複組み合わせ nHr = (n + r - 1)C(r - 1)\n T nHr(int n, int r) {\n return nCr(n + r - 1, r);\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, k; cin >> n >> k;\n Combination<modi> comb;\n\n modi asum = 0, bsum = 0;\n for (int i = 0; i < n; i++) {\n modi a, b; cin >> a >> b;\n asum += a, bsum += b;\n }\n asum /= modi(n), bsum /= modi(n);\n V<modi> fac(n, 1), pow2(n, 1);\n pow2[1] = 2;\n for (int i = 2; i < n; i++) {\n fac[i] = fac[i - 1] * modi(i);\n pow2[i] = pow2[i - 1] * modi(2);\n }\n\n modi ans = 0;\n for (int cyc = 1; cyc < n; cyc++) {\n if (k < 2 * cyc) break;\n modi tmp = pow2[cyc] * fac[cyc - 1] * modi(n) * comb.nHr(cyc, k - 3 * cyc) * comb.nHr(cyc, n - k + cyc);\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":0.1,"time_ms":180,"memory_kb":18700,"score_of_the_acc":-0.2633,"final_rank":13},{"submission_id":"aoj_3169_4879627","code_snippet":"#include <iostream>\n#include <array>\n#include <algorithm>\n#include <vector>\n#include <bitset>\n#include <set>\n#include <unordered_set>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <iterator>\n#include <numeric>\n#include <map>\n#include <unordered_map>\n#include <queue>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <limits>\n#include <iomanip>\n#include <functional>\n#include <cassert>\n// #include <atcoder/all>\nusing namespace std;\n\nusing ll=long long;\ntemplate<class T> using V = vector<T>;\ntemplate<class T, class U> using P = pair<T, U>;\nusing vll = V<ll>;\nusing vvll = V<vll>;\n#define ALL(v) v.begin(),v.end()\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\n':' ');\n\nconst long long MOD = 998244353;\nconst long long HIGHINF = (long long)1e18;\nconst int INF = (int)1e9;\n\nclass ModInt {\npublic:\n long long x;\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\n constexpr ModInt& operator+=(const ModInt rhs) {\n x += rhs.x;\n if (x >= MOD) x -= MOD;\n return *this;\n }\n constexpr ModInt operator+(const ModInt rhs) const {\n return ModInt(*this) += rhs; \n }\n constexpr ModInt& operator-=(const ModInt& rhs) {\n x -= rhs.x;\n if (x < 0) x += MOD;\n return *this;\n }\n constexpr ModInt operator-(const ModInt rhs) const {\n return ModInt(*this) -= rhs; \n }\n constexpr ModInt& operator*=(const ModInt& rhs) {\n x = x * rhs.x % MOD;\n return *this;\n }\n constexpr ModInt operator*(const ModInt rhs) const {\n return ModInt(*this) *= rhs; \n }\n constexpr ModInt& operator/=(const ModInt& rhs) {\n ModInt div = powmod(rhs, MOD - 2);\n (x *= div.x) %= MOD;\n return *this;\n }\n constexpr ModInt operator/(const ModInt rhs) const {\n return ModInt(*this) /= rhs;\n }\n constexpr ModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n }\n constexpr ModInt& operator++() {\n x += 1;\n return *this;\n }\n constexpr ModInt operator++(int) {\n ModInt tmp(*this);\n operator++();\n return tmp;\n }\n constexpr ModInt& operator--() {\n x -= 1;\n return *this;\n }\n constexpr ModInt operator--(int) {\n ModInt tmp(*this);\n operator--();\n return tmp;\n }\n\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\n os << rhs.x;\n return os;\n }\n friend istream& operator>>(istream& is, ModInt& rhs) {\n is >> rhs.x;\n return is;\n }\n};\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\n return lhs.x == rhs.x;\n}\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\n return !(lhs == rhs);\n}\nModInt powmod(ModInt m, long long p) {\n if (p == 0) return ModInt(1);\n ModInt tmp = powmod(m, p / 2);\n if (p & 1) return tmp * tmp * m;\n else return tmp * tmp;\n}\n\nusing modi = ModInt;\n\n\n// [ModInt]\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\nconst int NMAX = 1000005;\ntemplate < typename T >\nclass Combination {\npublic:\n std::vector<T> fac, invfac;\n Combination() {\n fac.resize(NMAX), invfac.resize(NMAX);\n fac[0] = fac[1] = T(1);\n invfac[0] = invfac[1] = T(1);\n for (int i = 2; i <= NMAX; i++) {\n fac[i] = fac[i - 1] * T(i);\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\n }\n }\n\n // nCr = n! / r!(n-r)!\n T nCr(int n, int r) {\n if (n < 0 || r > n || r < 0) return T(0);\n return fac[n] * invfac[r] * invfac[n - r];\n }\n \n // 重複組み合わせ nHr = (n + r - 1)C(r - 1)\n T nHr(int n, int r) {\n return nCr(n + r - 1, r);\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, k; cin >> n >> k;\n Combination<modi> comb;\n\n modi asum = 0, bsum = 0;\n for (int i = 0; i < n; i++) {\n modi a, b; cin >> a >> b;\n asum += a, bsum += b;\n }\n asum /= modi(n), bsum /= modi(n);\n V<modi> fac(n, 1), pow2(n, 1);\n pow2[1] = 2;\n for (int i = 2; i < n; i++) {\n fac[i] = fac[i - 1] * modi(i);\n pow2[i] = pow2[i - 1] * modi(2);\n }\n\n modi ans = 0;\n for (int cyc = 1; cyc < n; cyc++) {\n if (k - 2 * cyc <= 0) break;\n modi tmp = pow2[cyc] * fac[cyc - 1] * modi(n) * comb.nHr(cyc, k - 3 * cyc) * comb.nHr(cyc, n - k + cyc);\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":0.1,"time_ms":180,"memory_kb":18740,"score_of_the_acc":-0.2639,"final_rank":14},{"submission_id":"aoj_3169_4879023","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\n{ for(auto it : P) { s << \"<\" << it << \"> \"; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for(auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s << endl; }\n\n\n\n// modint: mod 計算を int を扱うように扱える構造体\ntemplate<int MOD> struct Fp {\n long long val;\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\n if (val < 0) val += MOD;\n }\n constexpr int getmod() { return MOD; }\n constexpr Fp operator - () const noexcept {\n return val ? MOD - val : 0;\n }\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\n constexpr Fp& operator += (const Fp& r) noexcept {\n val += r.val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -= (const Fp& r) noexcept {\n val -= r.val;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp& operator *= (const Fp& r) noexcept {\n val = val * r.val % MOD;\n return *this;\n }\n constexpr Fp& operator /= (const Fp& r) noexcept {\n long long a = r.val, b = MOD, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n val = val * u % MOD;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr bool operator == (const Fp& r) const noexcept {\n return this->val == r.val;\n }\n constexpr bool operator != (const Fp& r) const noexcept {\n return this->val != r.val;\n }\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\n return os << x.val;\n }\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\n if (n == 0) return 1;\n auto t = modpow(a, n / 2);\n t = t * t;\n if (n & 1) t = t * a;\n return t;\n }\n};\n\n// 二項係数ライブラリ\ntemplate<class T> struct BiCoef {\n vector<T> fact_, inv_, finv_;\n constexpr BiCoef() {}\n constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {\n init(n);\n }\n constexpr void init(int n) noexcept {\n fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);\n int MOD = fact_[0].getmod();\n for(int i = 2; i < n; i++){\n fact_[i] = fact_[i-1] * i;\n inv_[i] = -inv_[MOD%i] * (MOD/i);\n finv_[i] = finv_[i-1] * inv_[i];\n }\n }\n constexpr T com(int n, int k) const noexcept {\n if (n < k || n < 0 || k < 0) return 0;\n return fact_[n] * finv_[k] * finv_[n-k];\n }\n constexpr T fact(int n) const noexcept {\n if (n < 0) return 0;\n return fact_[n];\n }\n constexpr T inv(int n) const noexcept {\n if (n < 0) return 0;\n return inv_[n];\n }\n constexpr T finv(int n) const noexcept {\n if (n < 0) return 0;\n return finv_[n];\n }\n};\n\nconst int MOD = 998244353;\nusing mint = Fp<MOD>;\n\nint main() {\n int N, K;\n cin >> N >> K;\n BiCoef<mint> bc(N*2 + 1);\n mint A = 0, B = 0;\n for (int i = 0; i < N; ++i) { long long v; cin >> v; A += v; }\n for (int i = 0; i < N; ++i) { long long v; cin >> v; B += v; }\n vector<mint> two(N+5, 1);\n for (int i = 1; i < two.size(); ++i) two[i] = two[i-1] * 2;\n\n mint res = 0;\n for (int i = 1; i*2 <= K; ++i) {\n mint fac = bc.com(K - i*2 - 1, i - 1) *\n bc.com(N - K + i*2 - 1, i - 1) *\n bc.fact(i - 1) * two[i];\n mint tmp = fac * (A * i*2 + B * (K - i*2));\n res += tmp;\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":680,"memory_kb":57388,"score_of_the_acc":-1.3945,"final_rank":6},{"submission_id":"aoj_3169_4879018","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\n{ for(auto it : P) { s << \"<\" << it << \"> \"; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for(auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s << endl; }\n\n\n\n// modint: mod 計算を int を扱うように扱える構造体\ntemplate<int MOD> struct Fp {\n long long val;\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\n if (val < 0) val += MOD;\n }\n constexpr int getmod() { return MOD; }\n constexpr Fp operator - () const noexcept {\n return val ? MOD - val : 0;\n }\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\n constexpr Fp& operator += (const Fp& r) noexcept {\n val += r.val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -= (const Fp& r) noexcept {\n val -= r.val;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp& operator *= (const Fp& r) noexcept {\n val = val * r.val % MOD;\n return *this;\n }\n constexpr Fp& operator /= (const Fp& r) noexcept {\n long long a = r.val, b = MOD, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n val = val * u % MOD;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr bool operator == (const Fp& r) const noexcept {\n return this->val == r.val;\n }\n constexpr bool operator != (const Fp& r) const noexcept {\n return this->val != r.val;\n }\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\n return os << x.val;\n }\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\n if (n == 0) return 1;\n auto t = modpow(a, n / 2);\n t = t * t;\n if (n & 1) t = t * a;\n return t;\n }\n};\n\n// 二項係数ライブラリ\ntemplate<class T> struct BiCoef {\n vector<T> fact_, inv_, finv_;\n constexpr BiCoef() {}\n constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {\n init(n);\n }\n constexpr void init(int n) noexcept {\n fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);\n int MOD = fact_[0].getmod();\n for(int i = 2; i < n; i++){\n fact_[i] = fact_[i-1] * i;\n inv_[i] = -inv_[MOD%i] * (MOD/i);\n finv_[i] = finv_[i-1] * inv_[i];\n }\n }\n constexpr T com(int n, int k) const noexcept {\n if (n < k || n < 0 || k < 0) return 0;\n return fact_[n] * finv_[k] * finv_[n-k];\n }\n constexpr T fact(int n) const noexcept {\n if (n < 0) return 0;\n return fact_[n];\n }\n constexpr T inv(int n) const noexcept {\n if (n < 0) return 0;\n return inv_[n];\n }\n constexpr T finv(int n) const noexcept {\n if (n < 0) return 0;\n return finv_[n];\n }\n};\n\nconst int MOD = 998244353;\nusing mint = Fp<MOD>;\n\nint main() {\n int N, K;\n cin >> N >> K;\n BiCoef<mint> bc(N+1);\n mint A = 0, B = 0;\n for (int i = 0; i < N; ++i) { long long v; cin >> v; A += v; }\n for (int i = 0; i < N; ++i) { long long v; cin >> v; B += v; }\n vector<mint> two(N+5, 1);\n for (int i = 1; i < two.size(); ++i) two[i] = two[i-1] * 2;\n\n mint res = 0;\n for (int i = 1; i*2 <= K; ++i) {\n mint fac = bc.com(K - i*2 - 1, i - 1) *\n bc.com(N - K + i*2 - 1, i - 1) *\n bc.fact(i - 1) * two[i];\n mint tmp = fac * (A * i*2 + B * (K - i*2));\n res += tmp;\n }\n cout << res << endl;\n}","accuracy":0.8,"time_ms":570,"memory_kb":33892,"score_of_the_acc":-0.9327,"final_rank":10},{"submission_id":"aoj_3169_4877335","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\nconst int MOD=998244353;\n\nint pw(int n,int k){\n assert(k>=0);\n int res=1;\n while(k){\n if(k&1)(res*=n)%=MOD;\n (n*=n)%=MOD;\n k>>=1;\n }\n return res;\n}\nstd::vector<int> Factorial(5e6),Finverse(5e6);\ninline void Cinit(){\n Factorial[0]=1;\n for(int i=1;i<5e6;i++)Factorial[i]=(Factorial[i-1]*i)%MOD;\n Finverse[4999999]=pw(Factorial[4999999],MOD-2);\n for(int i=4999998;i>=0;i--)Finverse[i]=(i+1)*Finverse[i+1]%MOD;\n}\nint nCk(int n,int k){\n assert(n>=k&&k>=0);\n if(n<k)return 0;if(k<0)return 0;\n assert(n<5000000&&k<5000000);\n if(!Factorial[0])Cinit();\n int res=Factorial[n];\n (res*=Finverse[k])%=MOD;\n (res*=Finverse[n-k])%=MOD;\n return res;\n}\n\nsigned main(){\n int n,k;cin>>n>>k;\n int asum=0,bsum=0;\n for(int i=0;i<n;i++){\n int a;cin>>a;asum+=a;\n }\n for(int i=0;i<n;i++){\n int b;cin>>b;bsum+=b;\n }\n asum%=MOD;bsum%=MOD;\n int ans=0;\n for(int i=1;i*3<=k&&2*i<=n;i++){//i回降りてi回登る->k-2i個下を旅する\n if(k-2*i>n-i)continue;\n int tmp=nCk(k-3*i+i-1,i-1)*nCk(n-k+2*i-i+i-1,i-1)%MOD;\n (tmp*=n)%=MOD;\n (tmp*=pw(i,MOD-2))%=MOD;\n (tmp*=pw(2,i))%=MOD;\n (tmp*=Factorial[i])%=MOD;\n int A=asum*2*i%MOD*pw(n,MOD-2)%MOD;\n int B=bsum*(k-2*i)%MOD*pw(n,MOD-2)%MOD;\n (tmp*=A+B)%=MOD;\n (ans+=tmp)%=MOD;\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":600,"memory_kb":80816,"score_of_the_acc":-1.6344,"final_rank":8},{"submission_id":"aoj_3169_4877310","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\nconst int MOD=998244353;\n\nint pw(int n,int k){\n assert(k>=0);\n int res=1;\n while(k){\n if(k&1)(res*=n)%=MOD;\n (n*=n)%=MOD;\n k>>=1;\n }\n return res;\n}\nstd::vector<int> Factorial(5e6),Finverse(5e6);\ninline void Cinit(){\n Factorial[0]=1;\n for(int i=1;i<5e6;i++)Factorial[i]=(Factorial[i-1]*i)%MOD;\n Finverse[4999999]=pw(Factorial[4999999],MOD-2);\n for(int i=4999998;i>=0;i--)Finverse[i]=(i+1)*Finverse[i+1]%MOD;\n}\nint nCk(int n,int k){\n assert(n>=k&&k>=0);\n if(n<k)return 0;if(k<0)return 0;\n assert(n<5000000&&k<5000000);\n if(!Factorial[0])Cinit();\n int res=Factorial[n];\n (res*=Finverse[k])%=MOD;\n (res*=Finverse[n-k])%=MOD;\n return res;\n}\n\nsigned main(){\n int n,k;cin>>n>>k;\n int asum=0,bsum=0;\n for(int i=0;i<n;i++){\n int a;cin>>a;asum+=a;\n }\n for(int i=0;i<n;i++){\n int b;cin>>b;bsum+=b;\n }\n asum%=MOD;bsum%=MOD;\n int ans=0;\n for(int i=1;i*3<=k&&2*i<=n;i++){//i回降りてi回登る->k-2i個下を旅する\n if(k-2*i>n-i)continue;\n int tmp=nCk(k-3*i+i-1,i-1)*nCk(n-k+2*i-i+i-1,i-1)%MOD;\n (tmp*=n)%=MOD;\n (tmp*=pw(n-(k-2*i),MOD-2))%=MOD;\n (tmp*=pw(2,i))%=MOD;\n (tmp*=Factorial[i])%=MOD;\n int A=asum*2*i%MOD*pw(n,MOD-2)%MOD;\n int B=bsum*(k-2*i)%MOD*pw(n,MOD-2)%MOD;\n (tmp*=A+B)%=MOD;\n (ans+=tmp)%=MOD;\n }\n cout<<ans<<endl;\n}","accuracy":0.1,"time_ms":60,"memory_kb":80728,"score_of_the_acc":-1.0053,"final_rank":17},{"submission_id":"aoj_3169_4877308","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\nconst int MOD=998244353;\n\nint pw(int n,int k){\n assert(k>=0);\n int res=1;\n while(k){\n if(k&1)(res*=n)%=MOD;\n (n*=n)%=MOD;\n k>>=1;\n }\n return res;\n}\nstd::vector<int> Factorial(5e6),Finverse(5e6);\ninline void Cinit(){\n Factorial[0]=1;\n for(int i=1;i<5e6;i++)Factorial[i]=(Factorial[i-1]*i)%MOD;\n Finverse[4999999]=pw(Factorial[4999999],MOD-2);\n for(int i=4999998;i>=0;i--)Finverse[i]=(i+1)*Finverse[i+1]%MOD;\n}\nint nCk(int n,int k){\n if(n<k)return 0;if(k<0)return 0;\n assert(n<5000000&&k<5000000);\n if(!Factorial[0])Cinit();\n int res=Factorial[n];\n (res*=Finverse[k])%=MOD;\n (res*=Finverse[n-k])%=MOD;\n return res;\n}\n\nsigned main(){\n int n,k;cin>>n>>k;\n int asum=0,bsum=0;\n for(int i=0;i<n;i++){\n int a;cin>>a;asum+=a;\n }\n for(int i=0;i<n;i++){\n int b;cin>>b;bsum+=b;\n }\n asum%=MOD;bsum%=MOD;\n int ans=0;\n for(int i=1;i*3<=k&&2*i<=n;i++){//i回降りてi回登る->k-2i個下を旅する\n if(k-2*i>n-i)continue;\n int tmp=nCk(k-3*i+i-1,i-1)*nCk(n-k+2*i-i+i-1,i-1)%MOD;\n (tmp*=n)%=MOD;\n (tmp*=pw(n-(k-2*i),MOD-2))%=MOD;\n (tmp*=pw(2,i))%=MOD;\n (tmp*=Factorial[i])%=MOD;\n int A=asum*2*i%MOD*pw(n,MOD-2)%MOD;\n int B=bsum*(k-2*i)%MOD*pw(n,MOD-2)%MOD;\n (tmp*=A+B)%=MOD;\n (ans+=tmp)%=MOD;\n }\n cout<<ans<<endl;\n}","accuracy":0.1,"time_ms":60,"memory_kb":80768,"score_of_the_acc":-1.0058,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_3169_10697597\",\n \"code_snippet\": \"#ifndef HIDDEN_IN_VS // 折りたたみ用\\n\\n// 警告の抑制\\n#define _CRT_SECURE_NO_WARNINGS\\n\\n// ライブラリの読み込み\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 型名の短縮\\nusing ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）\\nusing pii = pair<int, int>;\\tusing pll = pair<ll, ll>;\\tusing pil = pair<int, ll>;\\tusing pli = pair<ll, int>;\\nusing vi = vector<int>;\\t\\tusing vvi = vector<vi>;\\t\\tusing vvvi = vector<vvi>;\\tusing vvvvi = vector<vvvi>;\\nusing vl = vector<ll>;\\t\\tusing vvl = vector<vl>;\\t\\tusing vvvl = vector<vvl>;\\tusing vvvvl = vector<vvvl>;\\nusing vb = vector<bool>;\\tusing vvb = vector<vb>;\\t\\tusing vvvb = vector<vvb>;\\nusing vc = vector<char>;\\tusing vvc = vector<vc>;\\t\\tusing vvvc = vector<vvc>;\\nusing vd = vector<double>;\\tusing vvd = vector<vd>;\\t\\tusing vvvd = vector<vvd>;\\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\\nusing Graph = vvi;\\n\\n// 定数の定義\\nconst double PI = acos(-1);\\nint DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\\nint DY[4] = { 0, 1, 0, -1 };\\nint INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;\\n\\n// 入出力高速化\\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\\n\\n// 汎用マクロの定義\\n#define all(a) (a).begin(), (a).end()\\n#define sz(x) ((int)(x).size())\\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))\\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))\\n#define Yes(b) {cout << ((b) ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\");}\\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\\n#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）\\n#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）\\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\\n#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定\\n\\n// 汎用関数の定義\\ntemplate <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\\ntemplate <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }\\ntemplate <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod\\n\\n// 演算子オーバーロード\\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\\n\\n#endif // 折りたたみ用\\n\\n\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n\\n#ifdef _MSC_VER\\n#include \\\"localACL.hpp\\\"\\n#endif\\n\\nusing mint = modint998244353;\\n//using mint = static_modint<(int)1e9+7>;\\n//using mint = modint; // mint::set_mod(m);\\n\\nusing vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;\\n#endif\\n\\n\\n#ifdef _MSC_VER // 手元環境（Visual Studio）\\n#include \\\"local.hpp\\\"\\n#else // 提出用（gcc）\\nint mute_dump = 0;\\nint frac_print = 0;\\n#if __has_include(<atcoder/all>)\\nnamespace atcoder {\\n\\tinline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\\n\\tinline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\\n}\\n#endif\\ninline int popcount(int n) { return __builtin_popcount(n); }\\ninline int popcount(ll n) { return __builtin_popcountll(n); }\\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }\\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }\\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\\n#define dump(...)\\n#define dumpel(v)\\n#define dump_math(v)\\n#define input_from_file(f)\\n#define output_to_file(f)\\n//#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE の代わりに MLE を出す\\n#endif\\n\\n#define Assert(b) assert(b)\\n\\n//【階乗など（法が大きな素数）】\\n/*\\n* Factorial_mint(int N) : O(n)\\n*\\tN まで計算可能として初期化する．\\n*\\n* mint fact(int n) : O(1)\\n*\\tn! を返す．\\n*\\n* mint fact_inv(int n) : O(1)\\n*\\t1/n! を返す（n が負なら 0 を返す）\\n*\\n* mint inv(int n) : O(1)\\n*\\t1/n を返す．\\n*\\n* mint perm(int n, int r) : O(1)\\n*\\t順列の数 nPr を返す．\\n*\\n* mint perm_inv(int n, int r) : O(1)\\n*\\t順列の数の逆数 1/nPr を返す．\\n*\\n* mint bin(int n, int r) : O(1)\\n*\\t二項係数 nCr を返す．\\n*\\n* mint bin_inv(int n, int r) : O(1)\\n*\\t二項係数の逆数 1/nCr を返す．\\n*\\n* mint mul(vi rs) : O(|rs|)\\n*\\t多項係数 nC[rs] を返す．（n = Σrs）\\n*\\n* mint hom(int n, int r) : O(1)\\n*\\t重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\\n*\\n* mint neg_bin(int n, int r) : O(1)\\n*\\t負の二項係数 nCr = (-1)^r -n+r-1Cr を返す（n ≦ 0, r ≧ 0）\\n*\\n* mint pochhammer(int x, int n) : O(1)\\n*\\tポッホハマー記号 x^(n) を返す（n ≧ 0）\\n*\\n* mint pochhammer_inv(int x, int n) : O(1)\\n*\\tポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\\n*/\\nclass Factorial_mint {\\n\\tint n_max;\\n\\n\\t// 階乗と階乗の逆数の値を保持するテーブル\\n\\tvm fac, fac_inv;\\n\\npublic:\\n\\t// n! までの階乗とその逆数を前計算しておく．O(n)\\n\\tFactorial_mint(int n) : n_max(n), fac(n + 1), fac_inv(n + 1) {\\n\\t\\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\\n\\n\\t\\tfac[0] = 1;\\n\\t\\trepi(i, 1, n) fac[i] = fac[i - 1] * i;\\n\\n\\t\\tfac_inv[n] = fac[n].inv();\\n\\t\\trepir(i, n - 1, 0) fac_inv[i] = fac_inv[i + 1] * (i + 1);\\n\\t}\\n\\tFactorial_mint() : n_max(0) {} // ダミー\\n\\n\\t// n! を返す．\\n\\tmint fact(int n) const {\\n\\t\\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\\n\\n\\t\\tAssert(0 <= n && n <= n_max);\\n\\t\\treturn fac[n];\\n\\t}\\n\\n\\t// 1/n! を返す（n が負なら 0 を返す）\\n\\tmint fact_inv(int n) const {\\n\\t\\t// verify : https://atcoder.jp/contests/abc289/tasks/abc289_h\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tif (n < 0) return 0;\\n\\t\\treturn fac_inv[n];\\n\\t}\\n\\n\\t// 1/n を返す．\\n\\tmint inv(int n) const {\\n\\t\\t// verify : https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_d\\n\\n\\t\\tAssert(n > 0);\\n\\t\\tAssert(n <= n_max);\\n\\t\\treturn fac[n - 1] * fac_inv[n];\\n\\t}\\n\\n\\t// 順列の数 nPr を返す．\\n\\tmint perm(int n, int r) const {\\n\\t\\t// verify : https://atcoder.jp/contests/abc172/tasks/abc172_e\\n\\n\\t\\tAssert(n <= n_max);\\n\\n\\t\\tif (r < 0 || n - r < 0) return 0;\\n\\t\\treturn fac[n] * fac_inv[n - r];\\n\\t}\\n\\n\\t// 順列の数 nPr の逆数を返す．\\n\\tmint perm_inv(int n, int r) const {\\n\\t\\t// verify : https://yukicoder.me/problems/no/3139\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tAssert(0 <= r); Assert(r <= n);\\n\\n\\t\\treturn fac_inv[n] * fac[n - r];\\n\\t}\\n\\n\\t// 二項係数 nCr を返す．\\n\\tmint bin(int n, int r) const {\\n\\t\\t// verify : https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tif (r < 0 || n - r < 0) return 0;\\n\\t\\treturn fac[n] * fac_inv[r] * fac_inv[n - r];\\n\\t}\\n\\n\\t// 二項係数の逆数 1/nCr を返す．\\n\\tmint bin_inv(int n, int r) const {\\n\\t\\t// verify : https://www.codechef.com/problems/RANDCOLORING\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tAssert(r >= 0);\\n\\t\\tAssert(n - r >= 0);\\n\\t\\treturn fac_inv[n] * fac[r] * fac[n - r];\\n\\t}\\n\\n\\t// 多項係数 nC[rs] を返す．\\n\\tmint mul(const vi& rs) const {\\n\\t\\t// verify : https://yukicoder.me/problems/no/2141\\n\\n\\t\\tif (*min_element(all(rs)) < 0) return 0;\\n\\t\\tint n = accumulate(all(rs), 0);\\n\\t\\tAssert(n <= n_max);\\n\\n\\t\\tmint res = fac[n];\\n\\t\\trepe(r, rs) res *= fac_inv[r];\\n\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// 重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\\n\\tmint hom(int n, int r) {\\n\\t\\t// verify : https://mojacoder.app/users/riantkb/problems/toj_ex_2\\n\\n\\t\\tif (n == 0) return (int)(r == 0);\\n\\t\\tif (r < 0 || n - 1 < 0) return 0;\\n\\t\\tAssert(n + r - 1 <= n_max);\\n\\t\\treturn fac[n + r - 1] * fac_inv[r] * fac_inv[n - 1];\\n\\t}\\n\\n\\t// 負の二項係数 nCr を返す（n ≦ 0, r ≧ 0）\\n\\tmint neg_bin(int n, int r) {\\n\\t\\t// verify : https://atcoder.jp/contests/abc345/tasks/abc345_g\\n\\n\\t\\tif (n == 0) return (int)(r == 0);\\n\\t\\tif (r < 0 || -n - 1 < 0) return 0;\\n\\t\\tAssert(-n + r - 1 <= n_max);\\n\\t\\treturn (r & 1 ? -1 : 1) * fac[-n + r - 1] * fac_inv[r] * fac_inv[-n - 1];\\n\\t}\\n\\n\\t// ポッホハマー記号 x^(n) を返す（n ≧ 0）\\n\\tmint pochhammer(int x, int n) {\\n\\t\\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\\n\\n\\t\\tint x2 = x + n - 1;\\n\\t\\tif (x <= 0 && 0 <= x2) return 0;\\n\\n\\t\\tif (x > 0) {\\n\\t\\t\\tAssert(x2 <= n_max);\\n\\t\\t\\treturn fac[x2] * fac_inv[x - 1];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tAssert(-x <= n_max);\\n\\t\\t\\treturn (n & 1 ? -1 : 1) * fac[-x] * fac_inv[-x2 - 1];\\n\\t\\t}\\n\\t}\\n\\n\\t// ポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\\n\\tmint pochhammer_inv(int x, int n) {\\n\\t\\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\\n\\n\\t\\tint x2 = x + n - 1;\\n\\t\\tAssert(!(x <= 0 && 0 <= x2));\\n\\n\\t\\tif (x > 0) {\\n\\t\\t\\tAssert(x2 <= n_max);\\n\\t\\t\\treturn fac_inv[x2] * fac[x - 1];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tAssert(-x <= n_max);\\n\\t\\t\\treturn (n & 1 ? -1 : 1) * fac_inv[-x] * fac[-x2 - 1];\\n\\t\\t}\\n\\t}\\n};\\n\\n\\nint main() {\\n//\\tinput_from_file(\\\"input.txt\\\");\\n//\\toutput_to_file(\\\"output.txt\\\");\\n\\n\\tint n, K;\\n\\tcin >> n >> K;\\n\\n\\tvl a(n), b(n);\\n\\tcin >> a >> b;\\n\\n\\tFactorial_mint fm(n + 10);\\n\\n\\tll a_sum = accumulate(all(a), 0LL);\\n\\tll b_sum = accumulate(all(b), 0LL);\\n\\n\\tvm pow2(n + 1);\\n\\tpow2[0] = 1;\\n\\trep(i, n) pow2[i + 1] = pow2[i] * 2;\\n\\n\\tmint res = 0;\\n\\n\\trepi(A, 1, K / 2) {\\n\\t\\tint B = K - 2 * A;\\n\\t\\tif (B >= n) continue;\\n\\t\\tif (B < A) break;\\n\\n\\t\\t// n 本中 B 本を選んで A 個のブロックに分ける．\\n\\t\\tmint cnt = fm.bin(B - 1, A - 1) * fm.bin(n - B - 1, A - 1);\\n\\t\\tcnt *= 2 * pow2[A - 1] * fm.fact(A - 1);\\n\\n\\t\\tres += cnt * (mint(a_sum) * 2 * A + mint(b_sum) * B);\\n\\t}\\n\\n\\tEXIT(res);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 30936,\n \"score_of_the_acc\": -0.3558,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3169_10697595\",\n \"code_snippet\": \"#ifndef HIDDEN_IN_VS // 折りたたみ用\\n\\n// 警告の抑制\\n#define _CRT_SECURE_NO_WARNINGS\\n\\n// ライブラリの読み込み\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 型名の短縮\\nusing ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）\\nusing pii = pair<int, int>;\\tusing pll = pair<ll, ll>;\\tusing pil = pair<int, ll>;\\tusing pli = pair<ll, int>;\\nusing vi = vector<int>;\\t\\tusing vvi = vector<vi>;\\t\\tusing vvvi = vector<vvi>;\\tusing vvvvi = vector<vvvi>;\\nusing vl = vector<ll>;\\t\\tusing vvl = vector<vl>;\\t\\tusing vvvl = vector<vvl>;\\tusing vvvvl = vector<vvvl>;\\nusing vb = vector<bool>;\\tusing vvb = vector<vb>;\\t\\tusing vvvb = vector<vvb>;\\nusing vc = vector<char>;\\tusing vvc = vector<vc>;\\t\\tusing vvvc = vector<vvc>;\\nusing vd = vector<double>;\\tusing vvd = vector<vd>;\\t\\tusing vvvd = vector<vvd>;\\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\\nusing Graph = vvi;\\n\\n// 定数の定義\\nconst double PI = acos(-1);\\nint DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\\nint DY[4] = { 0, 1, 0, -1 };\\nint INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;\\n\\n// 入出力高速化\\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\\n\\n// 汎用マクロの定義\\n#define all(a) (a).begin(), (a).end()\\n#define sz(x) ((int)(x).size())\\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))\\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))\\n#define Yes(b) {cout << ((b) ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\");}\\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\\n#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）\\n#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）\\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\\n#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定\\n\\n// 汎用関数の定義\\ntemplate <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\\ntemplate <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }\\ntemplate <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod\\n\\n// 演算子オーバーロード\\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\\n\\n#endif // 折りたたみ用\\n\\n\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n\\n#ifdef _MSC_VER\\n#include \\\"localACL.hpp\\\"\\n#endif\\n\\nusing mint = modint998244353;\\n//using mint = static_modint<(int)1e9+7>;\\n//using mint = modint; // mint::set_mod(m);\\n\\nusing vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;\\n#endif\\n\\n\\n#ifdef _MSC_VER // 手元環境（Visual Studio）\\n#include \\\"local.hpp\\\"\\n#else // 提出用（gcc）\\nint mute_dump = 0;\\nint frac_print = 0;\\n#if __has_include(<atcoder/all>)\\nnamespace atcoder {\\n\\tinline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\\n\\tinline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\\n}\\n#endif\\ninline int popcount(int n) { return __builtin_popcount(n); }\\ninline int popcount(ll n) { return __builtin_popcountll(n); }\\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }\\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }\\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\\n#define dump(...)\\n#define dumpel(v)\\n#define dump_math(v)\\n#define input_from_file(f)\\n#define output_to_file(f)\\n//#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE の代わりに MLE を出す\\n#endif\\n\\n#define Assert(b) assert(b)\\n\\n//【階乗など（法が大きな素数）】\\n/*\\n* Factorial_mint(int N) : O(n)\\n*\\tN まで計算可能として初期化する．\\n*\\n* mint fact(int n) : O(1)\\n*\\tn! を返す．\\n*\\n* mint fact_inv(int n) : O(1)\\n*\\t1/n! を返す（n が負なら 0 を返す）\\n*\\n* mint inv(int n) : O(1)\\n*\\t1/n を返す．\\n*\\n* mint perm(int n, int r) : O(1)\\n*\\t順列の数 nPr を返す．\\n*\\n* mint perm_inv(int n, int r) : O(1)\\n*\\t順列の数の逆数 1/nPr を返す．\\n*\\n* mint bin(int n, int r) : O(1)\\n*\\t二項係数 nCr を返す．\\n*\\n* mint bin_inv(int n, int r) : O(1)\\n*\\t二項係数の逆数 1/nCr を返す．\\n*\\n* mint mul(vi rs) : O(|rs|)\\n*\\t多項係数 nC[rs] を返す．（n = Σrs）\\n*\\n* mint hom(int n, int r) : O(1)\\n*\\t重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\\n*\\n* mint neg_bin(int n, int r) : O(1)\\n*\\t負の二項係数 nCr = (-1)^r -n+r-1Cr を返す（n ≦ 0, r ≧ 0）\\n*\\n* mint pochhammer(int x, int n) : O(1)\\n*\\tポッホハマー記号 x^(n) を返す（n ≧ 0）\\n*\\n* mint pochhammer_inv(int x, int n) : O(1)\\n*\\tポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\\n*/\\nclass Factorial_mint {\\n\\tint n_max;\\n\\n\\t// 階乗と階乗の逆数の値を保持するテーブル\\n\\tvm fac, fac_inv;\\n\\npublic:\\n\\t// n! までの階乗とその逆数を前計算しておく．O(n)\\n\\tFactorial_mint(int n) : n_max(n), fac(n + 1), fac_inv(n + 1) {\\n\\t\\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\\n\\n\\t\\tfac[0] = 1;\\n\\t\\trepi(i, 1, n) fac[i] = fac[i - 1] * i;\\n\\n\\t\\tfac_inv[n] = fac[n].inv();\\n\\t\\trepir(i, n - 1, 0) fac_inv[i] = fac_inv[i + 1] * (i + 1);\\n\\t}\\n\\tFactorial_mint() : n_max(0) {} // ダミー\\n\\n\\t// n! を返す．\\n\\tmint fact(int n) const {\\n\\t\\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\\n\\n\\t\\tAssert(0 <= n && n <= n_max);\\n\\t\\treturn fac[n];\\n\\t}\\n\\n\\t// 1/n! を返す（n が負なら 0 を返す）\\n\\tmint fact_inv(int n) const {\\n\\t\\t// verify : https://atcoder.jp/contests/abc289/tasks/abc289_h\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tif (n < 0) return 0;\\n\\t\\treturn fac_inv[n];\\n\\t}\\n\\n\\t// 1/n を返す．\\n\\tmint inv(int n) const {\\n\\t\\t// verify : https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_d\\n\\n\\t\\tAssert(n > 0);\\n\\t\\tAssert(n <= n_max);\\n\\t\\treturn fac[n - 1] * fac_inv[n];\\n\\t}\\n\\n\\t// 順列の数 nPr を返す．\\n\\tmint perm(int n, int r) const {\\n\\t\\t// verify : https://atcoder.jp/contests/abc172/tasks/abc172_e\\n\\n\\t\\tAssert(n <= n_max);\\n\\n\\t\\tif (r < 0 || n - r < 0) return 0;\\n\\t\\treturn fac[n] * fac_inv[n - r];\\n\\t}\\n\\n\\t// 順列の数 nPr の逆数を返す．\\n\\tmint perm_inv(int n, int r) const {\\n\\t\\t// verify : https://yukicoder.me/problems/no/3139\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tAssert(0 <= r); Assert(r <= n);\\n\\n\\t\\treturn fac_inv[n] * fac[n - r];\\n\\t}\\n\\n\\t// 二項係数 nCr を返す．\\n\\tmint bin(int n, int r) const {\\n\\t\\t// verify : https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tif (r < 0 || n - r < 0) return 0;\\n\\t\\treturn fac[n] * fac_inv[r] * fac_inv[n - r];\\n\\t}\\n\\n\\t// 二項係数の逆数 1/nCr を返す．\\n\\tmint bin_inv(int n, int r) const {\\n\\t\\t// verify : https://www.codechef.com/problems/RANDCOLORING\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tAssert(r >= 0);\\n\\t\\tAssert(n - r >= 0);\\n\\t\\treturn fac_inv[n] * fac[r] * fac[n - r];\\n\\t}\\n\\n\\t// 多項係数 nC[rs] を返す．\\n\\tmint mul(const vi& rs) const {\\n\\t\\t// verify : https://yukicoder.me/problems/no/2141\\n\\n\\t\\tif (*min_element(all(rs)) < 0) return 0;\\n\\t\\tint n = accumulate(all(rs), 0);\\n\\t\\tAssert(n <= n_max);\\n\\n\\t\\tmint res = fac[n];\\n\\t\\trepe(r, rs) res *= fac_inv[r];\\n\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// 重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\\n\\tmint hom(int n, int r) {\\n\\t\\t// verify : https://mojacoder.app/users/riantkb/problems/toj_ex_2\\n\\n\\t\\tif (n == 0) return (int)(r == 0);\\n\\t\\tif (r < 0 || n - 1 < 0) return 0;\\n\\t\\tAssert(n + r - 1 <= n_max);\\n\\t\\treturn fac[n + r - 1] * fac_inv[r] * fac_inv[n - 1];\\n\\t}\\n\\n\\t// 負の二項係数 nCr を返す（n ≦ 0, r ≧ 0）\\n\\tmint neg_bin(int n, int r) {\\n\\t\\t// verify : https://atcoder.jp/contests/abc345/tasks/abc345_g\\n\\n\\t\\tif (n == 0) return (int)(r == 0);\\n\\t\\tif (r < 0 || -n - 1 < 0) return 0;\\n\\t\\tAssert(-n + r - 1 <= n_max);\\n\\t\\treturn (r & 1 ? -1 : 1) * fac[-n + r - 1] * fac_inv[r] * fac_inv[-n - 1];\\n\\t}\\n\\n\\t// ポッホハマー記号 x^(n) を返す（n ≧ 0）\\n\\tmint pochhammer(int x, int n) {\\n\\t\\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\\n\\n\\t\\tint x2 = x + n - 1;\\n\\t\\tif (x <= 0 && 0 <= x2) return 0;\\n\\n\\t\\tif (x > 0) {\\n\\t\\t\\tAssert(x2 <= n_max);\\n\\t\\t\\treturn fac[x2] * fac_inv[x - 1];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tAssert(-x <= n_max);\\n\\t\\t\\treturn (n & 1 ? -1 : 1) * fac[-x] * fac_inv[-x2 - 1];\\n\\t\\t}\\n\\t}\\n\\n\\t// ポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\\n\\tmint pochhammer_inv(int x, int n) {\\n\\t\\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\\n\\n\\t\\tint x2 = x + n - 1;\\n\\t\\tAssert(!(x <= 0 && 0 <= x2));\\n\\n\\t\\tif (x > 0) {\\n\\t\\t\\tAssert(x2 <= n_max);\\n\\t\\t\\treturn fac_inv[x2] * fac[x - 1];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tAssert(-x <= n_max);\\n\\t\\t\\treturn (n & 1 ? -1 : 1) * fac_inv[-x] * fac[-x2 - 1];\\n\\t\\t}\\n\\t}\\n};\\n\\n\\nint main() {\\n//\\tinput_from_file(\\\"input.txt\\\");\\n//\\toutput_to_file(\\\"output.txt\\\");\\n\\n\\tint n, K;\\n\\tcin >> n >> K;\\n\\n\\tvl a(n), b(n);\\n\\tcin >> a >> b;\\n\\n\\tFactorial_mint fm(n + 10);\\n\\n\\tll a_sum = accumulate(all(a), 0LL);\\n\\tll b_sum = accumulate(all(b), 0LL);\\n\\n\\tvm pow2(n + 1);\\n\\tpow2[0] = 1;\\n\\trep(i, n) pow2[i + 1] = pow2[i] * 2;\\n\\n\\tmint res = 0;\\n\\n\\trepi(A, 1, K / 2) {\\n\\t\\tint B = K - 2 * A;\\n\\t\\tif (B >= n) continue;\\n\\t\\tif (B < A) break;\\n\\n\\t\\t// n 本中 B 本を選んで A 個のブロックに分ける．\\n\\t\\tmint cnt = fm.bin(B - 1, A - 1) * fm.bin(n - B - 1, A - 1);\\n\\t\\tcnt *= 2 * pow2[A - 1] * fm.fact(A - 1);\\n\\n\\t\\tres += cnt * (a_sum * 2 * A + b_sum * B);\\n\\t}\\n\\n\\tEXIT(res);\\n}\",\n \"accuracy\": 0.4,\n \"time_ms\": 70,\n \"memory_kb\": 22352,\n \"score_of_the_acc\": -0.1873,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3169_10697594\",\n \"code_snippet\": \"#ifndef HIDDEN_IN_VS // 折りたたみ用\\n\\n// 警告の抑制\\n#define _CRT_SECURE_NO_WARNINGS\\n\\n// ライブラリの読み込み\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 型名の短縮\\nusing ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）\\nusing pii = pair<int, int>;\\tusing pll = pair<ll, ll>;\\tusing pil = pair<int, ll>;\\tusing pli = pair<ll, int>;\\nusing vi = vector<int>;\\t\\tusing vvi = vector<vi>;\\t\\tusing vvvi = vector<vvi>;\\tusing vvvvi = vector<vvvi>;\\nusing vl = vector<ll>;\\t\\tusing vvl = vector<vl>;\\t\\tusing vvvl = vector<vvl>;\\tusing vvvvl = vector<vvvl>;\\nusing vb = vector<bool>;\\tusing vvb = vector<vb>;\\t\\tusing vvvb = vector<vvb>;\\nusing vc = vector<char>;\\tusing vvc = vector<vc>;\\t\\tusing vvvc = vector<vvc>;\\nusing vd = vector<double>;\\tusing vvd = vector<vd>;\\t\\tusing vvvd = vector<vvd>;\\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\\nusing Graph = vvi;\\n\\n// 定数の定義\\nconst double PI = acos(-1);\\nint DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\\nint DY[4] = { 0, 1, 0, -1 };\\nint INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;\\n\\n// 入出力高速化\\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\\n\\n// 汎用マクロの定義\\n#define all(a) (a).begin(), (a).end()\\n#define sz(x) ((int)(x).size())\\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))\\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))\\n#define Yes(b) {cout << ((b) ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\");}\\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\\n#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）\\n#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）\\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\\n#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定\\n\\n// 汎用関数の定義\\ntemplate <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\\ntemplate <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }\\ntemplate <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod\\n\\n// 演算子オーバーロード\\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\\n\\n#endif // 折りたたみ用\\n\\n\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n\\n#ifdef _MSC_VER\\n#include \\\"localACL.hpp\\\"\\n#endif\\n\\nusing mint = modint998244353;\\n//using mint = static_modint<(int)1e9+7>;\\n//using mint = modint; // mint::set_mod(m);\\n\\nusing vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;\\n#endif\\n\\n\\n#ifdef _MSC_VER // 手元環境（Visual Studio）\\n#include \\\"local.hpp\\\"\\n#else // 提出用（gcc）\\nint mute_dump = 0;\\nint frac_print = 0;\\n#if __has_include(<atcoder/all>)\\nnamespace atcoder {\\n\\tinline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\\n\\tinline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\\n}\\n#endif\\ninline int popcount(int n) { return __builtin_popcount(n); }\\ninline int popcount(ll n) { return __builtin_popcountll(n); }\\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }\\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }\\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\\n#define dump(...)\\n#define dumpel(v)\\n#define dump_math(v)\\n#define input_from_file(f)\\n#define output_to_file(f)\\n#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE の代わりに MLE を出す\\n#endif\\n\\n\\n//【階乗など（法が大きな素数）】\\n/*\\n* Factorial_mint(int N) : O(n)\\n*\\tN まで計算可能として初期化する．\\n*\\n* mint fact(int n) : O(1)\\n*\\tn! を返す．\\n*\\n* mint fact_inv(int n) : O(1)\\n*\\t1/n! を返す（n が負なら 0 を返す）\\n*\\n* mint inv(int n) : O(1)\\n*\\t1/n を返す．\\n*\\n* mint perm(int n, int r) : O(1)\\n*\\t順列の数 nPr を返す．\\n*\\n* mint perm_inv(int n, int r) : O(1)\\n*\\t順列の数の逆数 1/nPr を返す．\\n*\\n* mint bin(int n, int r) : O(1)\\n*\\t二項係数 nCr を返す．\\n*\\n* mint bin_inv(int n, int r) : O(1)\\n*\\t二項係数の逆数 1/nCr を返す．\\n*\\n* mint mul(vi rs) : O(|rs|)\\n*\\t多項係数 nC[rs] を返す．（n = Σrs）\\n*\\n* mint hom(int n, int r) : O(1)\\n*\\t重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\\n*\\n* mint neg_bin(int n, int r) : O(1)\\n*\\t負の二項係数 nCr = (-1)^r -n+r-1Cr を返す（n ≦ 0, r ≧ 0）\\n*\\n* mint pochhammer(int x, int n) : O(1)\\n*\\tポッホハマー記号 x^(n) を返す（n ≧ 0）\\n*\\n* mint pochhammer_inv(int x, int n) : O(1)\\n*\\tポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\\n*/\\nclass Factorial_mint {\\n\\tint n_max;\\n\\n\\t// 階乗と階乗の逆数の値を保持するテーブル\\n\\tvm fac, fac_inv;\\n\\npublic:\\n\\t// n! までの階乗とその逆数を前計算しておく．O(n)\\n\\tFactorial_mint(int n) : n_max(n), fac(n + 1), fac_inv(n + 1) {\\n\\t\\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\\n\\n\\t\\tfac[0] = 1;\\n\\t\\trepi(i, 1, n) fac[i] = fac[i - 1] * i;\\n\\n\\t\\tfac_inv[n] = fac[n].inv();\\n\\t\\trepir(i, n - 1, 0) fac_inv[i] = fac_inv[i + 1] * (i + 1);\\n\\t}\\n\\tFactorial_mint() : n_max(0) {} // ダミー\\n\\n\\t// n! を返す．\\n\\tmint fact(int n) const {\\n\\t\\t// verify : https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b\\n\\n\\t\\tAssert(0 <= n && n <= n_max);\\n\\t\\treturn fac[n];\\n\\t}\\n\\n\\t// 1/n! を返す（n が負なら 0 を返す）\\n\\tmint fact_inv(int n) const {\\n\\t\\t// verify : https://atcoder.jp/contests/abc289/tasks/abc289_h\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tif (n < 0) return 0;\\n\\t\\treturn fac_inv[n];\\n\\t}\\n\\n\\t// 1/n を返す．\\n\\tmint inv(int n) const {\\n\\t\\t// verify : https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_d\\n\\n\\t\\tAssert(n > 0);\\n\\t\\tAssert(n <= n_max);\\n\\t\\treturn fac[n - 1] * fac_inv[n];\\n\\t}\\n\\n\\t// 順列の数 nPr を返す．\\n\\tmint perm(int n, int r) const {\\n\\t\\t// verify : https://atcoder.jp/contests/abc172/tasks/abc172_e\\n\\n\\t\\tAssert(n <= n_max);\\n\\n\\t\\tif (r < 0 || n - r < 0) return 0;\\n\\t\\treturn fac[n] * fac_inv[n - r];\\n\\t}\\n\\n\\t// 順列の数 nPr の逆数を返す．\\n\\tmint perm_inv(int n, int r) const {\\n\\t\\t// verify : https://yukicoder.me/problems/no/3139\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tAssert(0 <= r); Assert(r <= n);\\n\\n\\t\\treturn fac_inv[n] * fac[n - r];\\n\\t}\\n\\n\\t// 二項係数 nCr を返す．\\n\\tmint bin(int n, int r) const {\\n\\t\\t// verify : https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tif (r < 0 || n - r < 0) return 0;\\n\\t\\treturn fac[n] * fac_inv[r] * fac_inv[n - r];\\n\\t}\\n\\n\\t// 二項係数の逆数 1/nCr を返す．\\n\\tmint bin_inv(int n, int r) const {\\n\\t\\t// verify : https://www.codechef.com/problems/RANDCOLORING\\n\\n\\t\\tAssert(n <= n_max);\\n\\t\\tAssert(r >= 0);\\n\\t\\tAssert(n - r >= 0);\\n\\t\\treturn fac_inv[n] * fac[r] * fac[n - r];\\n\\t}\\n\\n\\t// 多項係数 nC[rs] を返す．\\n\\tmint mul(const vi& rs) const {\\n\\t\\t// verify : https://yukicoder.me/problems/no/2141\\n\\n\\t\\tif (*min_element(all(rs)) < 0) return 0;\\n\\t\\tint n = accumulate(all(rs), 0);\\n\\t\\tAssert(n <= n_max);\\n\\n\\t\\tmint res = fac[n];\\n\\t\\trepe(r, rs) res *= fac_inv[r];\\n\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// 重複組合せの数 nHr = n+r-1Cr を返す（0H0 = 1 とする）\\n\\tmint hom(int n, int r) {\\n\\t\\t// verify : https://mojacoder.app/users/riantkb/problems/toj_ex_2\\n\\n\\t\\tif (n == 0) return (int)(r == 0);\\n\\t\\tif (r < 0 || n - 1 < 0) return 0;\\n\\t\\tAssert(n + r - 1 <= n_max);\\n\\t\\treturn fac[n + r - 1] * fac_inv[r] * fac_inv[n - 1];\\n\\t}\\n\\n\\t// 負の二項係数 nCr を返す（n ≦ 0, r ≧ 0）\\n\\tmint neg_bin(int n, int r) {\\n\\t\\t// verify : https://atcoder.jp/contests/abc345/tasks/abc345_g\\n\\n\\t\\tif (n == 0) return (int)(r == 0);\\n\\t\\tif (r < 0 || -n - 1 < 0) return 0;\\n\\t\\tAssert(-n + r - 1 <= n_max);\\n\\t\\treturn (r & 1 ? -1 : 1) * fac[-n + r - 1] * fac_inv[r] * fac_inv[-n - 1];\\n\\t}\\n\\n\\t// ポッホハマー記号 x^(n) を返す（n ≧ 0）\\n\\tmint pochhammer(int x, int n) {\\n\\t\\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\\n\\n\\t\\tint x2 = x + n - 1;\\n\\t\\tif (x <= 0 && 0 <= x2) return 0;\\n\\n\\t\\tif (x > 0) {\\n\\t\\t\\tAssert(x2 <= n_max);\\n\\t\\t\\treturn fac[x2] * fac_inv[x - 1];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tAssert(-x <= n_max);\\n\\t\\t\\treturn (n & 1 ? -1 : 1) * fac[-x] * fac_inv[-x2 - 1];\\n\\t\\t}\\n\\t}\\n\\n\\t// ポッホハマー記号の逆数 1/x^(n) を返す（n ≧ 0）\\n\\tmint pochhammer_inv(int x, int n) {\\n\\t\\t// verify : https://atcoder.jp/contests/agc070/tasks/agc070_c\\n\\n\\t\\tint x2 = x + n - 1;\\n\\t\\tAssert(!(x <= 0 && 0 <= x2));\\n\\n\\t\\tif (x > 0) {\\n\\t\\t\\tAssert(x2 <= n_max);\\n\\t\\t\\treturn fac_inv[x2] * fac[x - 1];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tAssert(-x <= n_max);\\n\\t\\t\\treturn (n & 1 ? -1 : 1) * fac_inv[-x] * fac[-x2 - 1];\\n\\t\\t}\\n\\t}\\n};\\n\\n\\nint main() {\\n//\\tinput_from_file(\\\"input.txt\\\");\\n//\\toutput_to_file(\\\"output.txt\\\");\\n\\n\\tint n, K;\\n\\tcin >> n >> K;\\n\\n\\tvl a(n), b(n);\\n\\tcin >> a >> b;\\n\\n\\tFactorial_mint fm(n + 10);\\n\\n\\tll a_sum = accumulate(all(a), 0LL);\\n\\tll b_sum = accumulate(all(b), 0LL);\\n\\n\\tvm pow2(n + 1);\\n\\tpow2[0] = 1;\\n\\trep(i, n) pow2[i + 1] = pow2[i] * 2;\\n\\n\\tmint res = 0;\\n\\n\\trepi(A, 1, K / 2) {\\n\\t\\tint B = K - 2 * A;\\n\\t\\tif (B >= n) continue;\\n\\t\\tif (B < A) break;\\n\\n\\t\\t// n 本中 B 本を選んで A 個のブロックに分ける．\\n\\t\\tmint cnt = fm.bin(B - 1, A - 1) * fm.bin(n - B - 1, A - 1);\\n\\t\\tcnt *= 2 * pow2[A - 1] * fm.fact(A - 1);\\n\\n\\t\\tres += cnt * (a_sum * 2 * A + b_sum * B);\\n\\t}\\n\\n\\tEXIT(res);\\n}\",\n \"accuracy\": 0.4,\n \"time_ms\": 70,\n \"memory_kb\": 22352,\n \"score_of_the_acc\": -0.1873,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3169_6928687\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=9167167167167167167;\\nconst int INF=100000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (ll i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\nnamespace po167{\\nstruct combination{\\n\\tint upper;\\n\\tlong long MOD;\\n\\tstd::vector<long long> fact;\\n\\tstd::vector<long long> rev;\\n\\tstd::vector<long long> fact_rev;\\n\\tcombination(int max,long long mod):upper(max),MOD(mod),fact(max+1),rev(max+1),fact_rev(max+1){\\n\\t\\tfor(long long i=0;i<=max;i++){\\n\\t\\t\\tif(i<2){\\n\\t\\t\\t\\tfact[i]=1;\\n\\t\\t\\t\\tfact_rev[i]=1;\\n\\t\\t\\t\\trev[i]=1;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tfact[i]=(fact[i-1]*i)%mod;\\n\\t\\t\\trev[i]=mod-((mod/i)*rev[mod%i])%mod;\\n\\t\\t\\tfact_rev[i]=(fact_rev[i-1]*rev[i])%mod;\\n\\t\\t}\\n\\t}\\n\\tlong long Comb(int x,int y){\\n\\t\\tassert(upper>=x);\\n\\t\\tif (x<y||y<0||x<0) return 0;\\n\\t\\treturn (((fact_rev[y]*fact_rev[x-y])%MOD)*fact[x])%MOD;\\n\\t}\\n\\tlong long P(int x,int y){\\n\\t\\tassert(upper>=x);\\n\\t\\tif (x<y||y<0||x<0) return 0;\\n\\t\\treturn (fact_rev[x-y]*fact[x])%MOD;\\n\\t}\\n};\\n}\\nusing po167::combination;\\n\\nll jyo(ll x,ll y,ll z){\\n ll H=y; //ここから\\n ll a=1,b=(x%z+z)%z,c=1;\\n while(H>0){\\n a*=2;\\n if(H%a!=0){\\n H-=a/2;\\n c*=b;\\n c%=z;\\n }\\n b*=b;\\n b%=z;\\n } //ここまで\\n return c;\\n}\\n\\n\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tint t=1;\\n\\t//cin>>t;\\n\\trep(i,t) solve();\\n}\\n\\nvoid solve(){\\n\\tll n,k;\\n\\tcin>>n>>k;\\n\\tll A=0,B=0;\\n\\trep(i,n){\\n\\t\\tll a;\\n\\t\\tcin>>a;\\n\\t\\tA+=a;\\n\\t}rep(i,n){\\n\\t\\tll a;\\n\\t\\tcin>>a;\\n\\t\\tB+=a;\\n\\t}\\n\\tA%=mod,B%=mod;\\n\\tcombination table(n,mod);\\n\\tll ans=0;\\n\\tfor(ll i=1;i<=n;i++){\\n\\t\\tll tmp=(jyo(2,i,mod)*table.fact[i-1])%mod;\\n\\t\\tll C=k-i*2;\\n\\t\\tif(C<i||n-C<i) continue;\\n\\t\\ttmp=(tmp*table.Comb(n-C-1,i-1))%mod;\\n\\t\\ttmp=(tmp*table.Comb(C-1,i-1))%mod;\\n\\t\\tans=(ans+(tmp*((i*2*A+B*C)%mod))%mod)%mod;\\n\\t}\\n\\tcout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 26560,\n \"score_of_the_acc\": -0.5378,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3169_5300091\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\n\\n#include <utility>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast moduler by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m`\\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n for (long long a : {2, 7, 61}) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\\n#define rep(i, n) For((i), 0, (n))\\n#define rrep(i, n) rFor((i), (n), 0)\\n#define fi first\\n#define se second\\nusing namespace std;\\ntypedef long long lint;\\ntypedef unsigned long long ulint;\\ntypedef pair<int, int> pii;\\ntypedef pair<lint, lint> pll;\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nT div_floor(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a >= 0 ? a / b : (a + 1) / b - 1;\\n}\\ntemplate <class T>\\nT div_ceil(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a > 0 ? (a - 1) / b + 1 : a / b;\\n}\\n\\nconstexpr lint mod = 1000000007;\\nconstexpr lint INF = mod * mod;\\nconstexpr int MAX = 200010;\\n\\nusing namespace atcoder;\\nusing mint = modint998244353;\\n\\nvector<mint> fact;\\nvector<mint> revfact;\\n\\nvoid setfact(int n) {\\n fact.resize(n + 1);\\n revfact.resize(n + 1);\\n fact[0] = 1;\\n rep(i, n) fact[i + 1] = fact[i] * mint(i + 1);\\n\\n revfact[n] = fact[n].inv();\\n for (int i = n - 1; i >= 0; i--) revfact[i] = revfact[i + 1] * mint(i + 1);\\n}\\n\\nmint getC(int n, int r) {\\n if (n < r || r < 0) return 0;\\n return fact[n] * revfact[r] * revfact[n - r];\\n}\\n\\nint main() {\\n int n, K;\\n scanf(\\\"%d%d\\\", &n, &K);\\n mint side = 0, bottom = 0;\\n rep(i, n) {\\n int a;\\n scanf(\\\"%d\\\", &a);\\n side += a;\\n }\\n rep(i, n) {\\n int a;\\n scanf(\\\"%d\\\", &a);\\n bottom += a;\\n }\\n\\n setfact(2 * n);\\n mint pow2 = 1, a = 0, b = 0;\\n for (int l = 0; 2 * l < K; ++l) {\\n mint c = fact[l - 1] * pow2 * getC(K - 2 * l - 1, l - 1) *\\n getC(n - K + 2 * l - 1, l - 1);\\n a += c * 2 * l;\\n b += c * (K - 2 * l);\\n pow2 *= 2;\\n }\\n printf(\\\"%u\\\\n\\\", (side * a + bottom * b).val());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 18804,\n \"score_of_the_acc\": -0.2299,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3169_5300088\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\n\\n#include <utility>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast moduler by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m`\\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n for (long long a : {2, 7, 61}) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\\n#define rep(i, n) For((i), 0, (n))\\n#define rrep(i, n) rFor((i), (n), 0)\\n#define fi first\\n#define se second\\nusing namespace std;\\ntypedef long long lint;\\ntypedef unsigned long long ulint;\\ntypedef pair<int, int> pii;\\ntypedef pair<lint, lint> pll;\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nT div_floor(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a >= 0 ? a / b : (a + 1) / b - 1;\\n}\\ntemplate <class T>\\nT div_ceil(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a > 0 ? (a - 1) / b + 1 : a / b;\\n}\\n\\nconstexpr lint mod = 1000000007;\\nconstexpr lint INF = mod * mod;\\nconstexpr int MAX = 200010;\\n\\nusing namespace atcoder;\\nusing mint = modint998244353;\\n\\nvector<mint> fact;\\nvector<mint> revfact;\\n\\nvoid setfact(int n) {\\n fact.resize(n + 1);\\n revfact.resize(n + 1);\\n fact[0] = 1;\\n rep(i, n) fact[i + 1] = fact[i] * mint(i + 1);\\n\\n revfact[n] = fact[n].inv();\\n for (int i = n - 1; i >= 0; i--) revfact[i] = revfact[i + 1] * mint(i + 1);\\n}\\n\\nmint getC(int n, int r) {\\n if (n < r || r < 0) return 0;\\n return fact[n] * revfact[r] * revfact[n - r];\\n}\\n\\nint main() {\\n int n, K;\\n scanf(\\\"%d%d\\\", &n, &K);\\n mint side = 0, bottom = 0;\\n rep(i, n) {\\n int a;\\n scanf(\\\"%d\\\", &a);\\n side += a;\\n }\\n rep(i, n) {\\n int a;\\n scanf(\\\"%d\\\", &a);\\n bottom += a;\\n }\\n\\n setfact(n);\\n mint pow2 = 1, a = 0, b = 0;\\n for (int l = 0; 2 * l < K; ++l) {\\n mint c = fact[l - 1] * pow2 * getC(K - 2 * l - 1, l - 1) *\\n getC(n - K + 2 * l - 1, l - 1);\\n a += c * 2 * l;\\n b += c * (K - 2 * l);\\n pow2 *= 2;\\n }\\n printf(\\\"%u\\\\n\\\", (side * a + bottom * b).val());\\n}\",\n \"accuracy\": 0.8,\n \"time_ms\": 140,\n \"memory_kb\": 10808,\n \"score_of_the_acc\": -0.1047,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3169_4964416\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#include<bits/stdc++.h>\\n\\nnamespace ProconLib{\\n\\n template<typename MInt>\\n class ModCombination{\\n int N;\\n std::vector<MInt> fact;\\n std::vector<MInt> factInv;\\n public:\\n ModCombination(int n);\\n MInt F(int n){return fact[n];}\\n MInt FI(int n){return factInv[n];}\\n MInt P(int n,int k){return fact[n]*factInv[n-k];}\\n MInt PI(int n,int k){return factInv[n]*fact[n-k];}\\n MInt C(int n,int k){return fact[n]*factInv[k]*factInv[n-k];}\\n MInt CI(int n,int k){return factInv[n]*fact[k]*fact[n-k];}\\n };\\n\\n template<typename MInt>\\n ModCombination<MInt>::ModCombination(int n):N(n),fact(n+1),factInv(n+1){\\n fact[0]=MInt(1);\\n for(int i=1;i<=n;i++) fact[i]=fact[i-1]*MInt(i);\\n factInv[n]=inv(fact[n]);\\n for(int i=n-1;i>=0;i--){\\n factInv[i]=factInv[i+1]*MInt(i+1);\\n }\\n }\\n \\n}\\n#include<iostream>\\n\\nnamespace ProconLib{\\n using ll=long long;\\n using Int=int;\\n template<Int MOD,bool IsPrime=true>\\n class ModInt{\\n Int n; \\n static Int regularize(int n){Int tmp=n%MOD; return tmp>=0 ? tmp : tmp+MOD;}\\n static Int regularize(ll n){Int tmp=n%MOD; return tmp>=0 ? tmp : tmp+MOD;}\\n public:\\n ModInt():n(0){};\\n ModInt(int n):n(regularize(n)){}\\n ModInt(long long n):n(regularize(n)){}\\n ModInt(const ModInt<MOD,IsPrime> &mn):n(mn.n){}\\n explicit operator int() const{return n;}\\n explicit operator long long() const{return n;}\\n\\n ModInt<MOD,IsPrime>& operator+=(ModInt<MOD,IsPrime> rhs);\\n ModInt<MOD,IsPrime>& operator-=(ModInt<MOD,IsPrime> rhs);\\n ModInt<MOD,IsPrime>& operator*=(ModInt<MOD,IsPrime> rhs);\\n\\n bool operator==(ModInt<MOD,IsPrime> rhs){return n==rhs.n;}\\n const Int& get() const {return n;}\\n void set(int x){n=regularize(x);}\\n void set(ll x){n=regularize(x);} \\n };\\n\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator+(ModInt<MOD,IsPrime> lhs,ModInt<MOD,IsPrime> rhs){return lhs+=rhs;};\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator+(ModInt<MOD,IsPrime> lhs,int rhs){return lhs+ModInt<MOD,IsPrime>(rhs);}\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator+(ModInt<MOD,IsPrime> lhs,ll rhs){return lhs+ModInt<MOD,IsPrime>(rhs);}\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator+(int lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)+rhs;}\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator+(ll lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)+rhs;}\\n\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator+(ModInt<MOD,IsPrime> mn){return mn;};\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator-(ModInt<MOD,IsPrime> mn){return ModInt<MOD,IsPrime>(-mn.get());};\\n\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator-(ModInt<MOD,IsPrime> lhs,ModInt<MOD,IsPrime> rhs){return lhs-=rhs;};\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator-(ModInt<MOD,IsPrime> lhs,int rhs){return lhs-ModInt<MOD,IsPrime>(rhs);};\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator-(ModInt<MOD,IsPrime> lhs,ll rhs){return lhs-ModInt<MOD,IsPrime>(rhs);};\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator-(int lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)-rhs;};\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator-(ll lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)-rhs;};\\n\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator*(ModInt<MOD,IsPrime> lhs,ModInt<MOD,IsPrime> rhs){return lhs*=rhs;};\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator*(ModInt<MOD,IsPrime> lhs,int rhs){return lhs*ModInt<MOD,IsPrime>(rhs);}\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator*(ModInt<MOD,IsPrime> lhs,ll rhs){return lhs*ModInt<MOD,IsPrime>(rhs);}\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator*(ll lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)*rhs;}\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> operator*(int lhs,ModInt<MOD,IsPrime> rhs){return ModInt<MOD,IsPrime>(lhs)*rhs;}\\n\\n template<Int MOD>\\n ModInt<MOD,true> operator/(ModInt<MOD,true> lhs,ModInt<MOD,true> rhs);\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> powm(ModInt<MOD,IsPrime> x,Int k);\\n template<Int MOD>\\n ModInt<MOD,true> inv(ModInt<MOD,true> x){return powm(x,MOD-2);}\\n\\n template<Int MOD,bool IsPrime>\\n std::ostream& operator<<(std::ostream& os,const ModInt<MOD,IsPrime> &mn);\\n \\n\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime>& ModInt<MOD,IsPrime>::operator+=(ModInt<MOD,IsPrime> rhs){\\n n+=rhs.n;\\n n= n>=MOD ? n-MOD : n;\\n return *this;\\n }\\n \\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime>& ModInt<MOD,IsPrime>::operator-=(ModInt rhs){\\n n=n-rhs.n<0 ? n-rhs.n+MOD : n-rhs.n;\\n return *this;\\n }\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime>& ModInt<MOD,IsPrime>::operator*=(ModInt<MOD,IsPrime> rhs){\\n n=ll(n)*rhs.n%MOD;\\n return *this;\\n }\\n \\n template<Int MOD>\\n ModInt<MOD,true> operator/(ModInt<MOD,true> lhs,ModInt<MOD,true> rhs){\\n return lhs*inv(rhs);\\n }\\n template<Int MOD,bool IsPrime>\\n ModInt<MOD,IsPrime> powm(ModInt<MOD,IsPrime> x,Int k){\\n ModInt<MOD,IsPrime> res(1);\\n while(k){\\n if(k&1) res*=x;\\n k>>=1;\\n x*=x;\\n }\\n return res;\\n }\\n\\n template<Int MOD,bool IsPrime>\\n std::ostream& operator<<(std::ostream& os,const ModInt<MOD,IsPrime> &mn){\\n os<<mn.get();\\n return os;\\n }\\n\\n template<Int MOD,bool IsPrime>\\n std::istream& operator>>(std::istream& is,ModInt<MOD,IsPrime> &mn){\\n Int tmp;\\n is>>tmp;\\n mn.set(tmp);\\n return is;\\n }\\n}\\n\\nusing namespace std;\\n\\nusing ll = long long;\\nconst ll MOD = 998244353;\\nusing mInt = ProconLib::ModInt<MOD, true>;\\nconst int MAX_N = 4000000;\\nProconLib::ModCombination<mInt> mComb(MAX_N);\\n\\nmInt fact(ll x) { return mComb.F(x); }\\nmInt calc(ll n, ll k) {\\n if (n == 0 && k == 0) return 1;\\n if (k <= 0) return 0;\\n if (n<0) return 0;\\n return mComb.C(n + k - 1, k - 1);\\n}\\n\\nint main() {\\n ll n, k;\\n cin >> n >> k;\\n\\n vector<int> a(n);\\n vector<int> b(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n for (int i = 0; i < n; i++) cin >> b[i];\\n\\n mInt P = 0;\\n for (int i = 1; i <= n; i++) {\\n mInt x = mInt(k - 2 * i) * mInt(2) * mInt(n);\\n mInt y = mInt(powm(mInt(2), i - 1)) * fact(i - 1);\\n mInt z = calc(k - 2 * i - i, i) * calc(n - (k - 2 * i) - i, i);\\n // cerr << \\\"#P \\\" << i << \\\" \\\" << x << \\\" \\\" << y << \\\" \\\" << z << endl;\\n P += x * y * z;\\n }\\n P = P / mInt(n);\\n // cerr << P << endl;\\n\\n mInt Q = 0;\\n for (int i = 1; i <= n; i++) {\\n mInt x = mInt(2) * mInt(i) * mInt(2) * mInt(n);\\n mInt y = powm(mInt(2), i - 1) * fact(i - 1);\\n mInt z = calc(k - 2 * i - i, i) * calc(n - (k - 2 * i) - i, i);\\n // cerr << \\\"#Q \\\" << i << \\\" \\\" << x << \\\" \\\" << y << \\\" \\\" << z << endl;\\n Q += x * y * z;\\n }\\n Q = Q / mInt(n);\\n\\n mInt asum = accumulate(a.begin(), a.end(), 0LL);\\n mInt bsum = accumulate(b.begin(), b.end(), 0LL);\\n mInt ans = bsum * P + asum * Q;\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 42136,\n \"score_of_the_acc\": -1.0964,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3169_4883802\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 2020000;\\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-10;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\ntemplate <std::uint_fast64_t Modulus> class modint {\\n using u64 = std::uint_fast64_t;\\n\\npublic:\\n u64 a;\\n\\n constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}\\n constexpr u64 &value() noexcept { return a; }\\n constexpr const u64 &value() const noexcept { return a; }\\n constexpr modint operator+(const modint rhs) const noexcept {\\n\\treturn modint(*this) += rhs;\\n }\\n constexpr modint operator-(const modint rhs) const noexcept {\\n\\treturn modint(*this) -= rhs;\\n }\\n constexpr modint operator*(const modint rhs) const noexcept {\\n\\treturn modint(*this) *= rhs;\\n }\\n constexpr modint operator/(const modint rhs) const noexcept {\\n\\treturn modint(*this) /= rhs;\\n }\\n constexpr modint &operator+=(const modint rhs) noexcept {\\n\\ta += rhs.a;\\n\\tif (a >= Modulus) {\\n\\t a -= Modulus;\\n\\t}\\n\\treturn *this;\\n }\\n constexpr modint &operator-=(const modint rhs) noexcept {\\n\\tif (a < rhs.a) {\\n\\t a += Modulus;\\n\\t}\\n\\ta -= rhs.a;\\n\\treturn *this;\\n }\\n constexpr modint &operator*=(const modint rhs) noexcept {\\n\\ta = a * rhs.a % Modulus;\\n\\treturn *this;\\n }\\n constexpr modint &operator/=(modint rhs) noexcept {\\n\\tu64 exp = Modulus - 2;\\n\\twhile (exp) {\\n\\t if (exp % 2) {\\n\\t\\t*this *= rhs;\\n\\t }\\n\\t rhs *= rhs;\\n\\t exp /= 2;\\n\\t}\\n\\treturn *this;\\n }\\n};\\n\\nusing mint = modint<mod>;\\n\\nvector<ll> fac(MAX), finv(MAX), inv(MAX);\\n\\nvoid comInit(){\\n\\tfac[0] = fac[1] = 1;\\n\\tfinv[0] = finv[1] = 1;\\n\\tinv[1] = 1;\\n\\tfor(ll i=2; i<MAX; i++){\\n\\t\\tfac[i] = fac[i-1]*i % mod;\\n\\t\\tinv[i] = mod - inv[mod%i] * (mod/i) % mod;\\n\\t\\tfinv[i] = finv[i-1] * inv[i] % mod;\\n\\t}\\n}\\n\\n\\nll com(ll n, ll k){\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * (finv[k] * finv[n-k] % mod) % mod;\\n}\\n\\nll modpow(ll x, ll n, ll mod){\\n\\tll res = 1;\\n\\twhile(n > 0){\\n\\t\\tif(n & 1) res = res * x % mod;\\n\\t\\tx = x * x % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tll n,k; cin >> n >> k;\\n\\tmint suma = 0, sumb = 0;\\n\\tvl a(n); rep(i,n) cin >> a[i], suma += a[i];\\n\\tvl b(n); rep(i,n) cin >> b[i], sumb += b[i];\\n\\tcomInit();\\n\\tmint ans = 0;\\n\\tfor(int t=1; t*3<=k; t++){\\n\\t\\tmint tmp = modpow(2,t,mod);\\n\\t\\ttmp = tmp * fac[t-1] * com(k-t*2-1,t-1) * com(n+t*2-k-1,t-1);\\n\\t\\tans += suma * tmp * t * 2 + sumb * tmp * (k-2*t);\\n\\t}\\n\\tcout << ans.value() << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 670,\n \"memory_kb\": 65920,\n \"score_of_the_acc\": -1.5041,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3169_4883357\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 2020000;\\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-10;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\ntemplate <std::uint_fast64_t Modulus> class modint {\\n using u64 = std::uint_fast64_t;\\n\\npublic:\\n u64 a;\\n\\n constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}\\n constexpr u64 &value() noexcept { return a; }\\n constexpr const u64 &value() const noexcept { return a; }\\n constexpr modint operator+(const modint rhs) const noexcept {\\n\\treturn modint(*this) += rhs;\\n }\\n constexpr modint operator-(const modint rhs) const noexcept {\\n\\treturn modint(*this) -= rhs;\\n }\\n constexpr modint operator*(const modint rhs) const noexcept {\\n\\treturn modint(*this) *= rhs;\\n }\\n constexpr modint operator/(const modint rhs) const noexcept {\\n\\treturn modint(*this) /= rhs;\\n }\\n constexpr modint &operator+=(const modint rhs) noexcept {\\n\\ta += rhs.a;\\n\\tif (a >= Modulus) {\\n\\t a -= Modulus;\\n\\t}\\n\\treturn *this;\\n }\\n constexpr modint &operator-=(const modint rhs) noexcept {\\n\\tif (a < rhs.a) {\\n\\t a += Modulus;\\n\\t}\\n\\ta -= rhs.a;\\n\\treturn *this;\\n }\\n constexpr modint &operator*=(const modint rhs) noexcept {\\n\\ta = a * rhs.a % Modulus;\\n\\treturn *this;\\n }\\n constexpr modint &operator/=(modint rhs) noexcept {\\n\\tu64 exp = Modulus - 2;\\n\\twhile (exp) {\\n\\t if (exp % 2) {\\n\\t\\t*this *= rhs;\\n\\t }\\n\\t rhs *= rhs;\\n\\t exp /= 2;\\n\\t}\\n\\treturn *this;\\n }\\n};\\n\\nusing mint = modint<mod>;\\n\\nvector<ll> fac(MAX), finv(MAX), inv(MAX);\\n\\nvoid comInit(){\\n\\tfac[0] = fac[1] = 1;\\n\\tfinv[0] = finv[1] = 1;\\n\\tinv[1] = 1;\\n\\tfor(ll i=2; i<MAX; i++){\\n\\t\\tfac[i] = fac[i-1]*i % mod;\\n\\t\\tinv[i] = mod - inv[mod%i] * (mod/i) % mod;\\n\\t\\tfinv[i] = finv[i-1] * inv[i] % mod;\\n\\t}\\n}\\n\\n\\nll com(ll n, ll k){\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * (finv[k] * finv[n-k] % mod) % mod;\\n}\\n\\nll modpow(ll x, ll n, ll mod){\\n\\tll res = 1;\\n\\twhile(n > 0){\\n\\t\\tif(n & 1) res = res * x % mod;\\n\\t\\tx = x * x % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tll n,k; cin >> n >> k;\\n\\tmint suma = 0, sumb = 0;\\n\\tvl a(n); rep(i,n) cin >> a[i], suma += a[i];\\n\\tvl b(n); rep(i,n) cin >> b[i], sumb += b[i];\\n\\tcomInit();\\n\\tmint ans = 0;\\n\\tfor(int t=0; t*3<=k-3; t++){\\n\\t\\tif(n-2+t < k-3) continue;\\n\\t\\tll rest = k-3 - t*3;\\n\\t\\tans += (suma * (t+1) * 4 + sumb * (rest+t+1) * 2) * com(t+rest,rest) * modpow(2,t,mod);\\n\\t}\\n\\tcout << ans.value() << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 50,\n \"memory_kb\": 49872,\n \"score_of_the_acc\": -0.5551,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3169_4880472\",\n \"code_snippet\": \"#include <iostream>\\n#include <array>\\n#include <algorithm>\\n#include <vector>\\n#include <bitset>\\n#include <set>\\n#include <unordered_set>\\n#include <cmath>\\n#include <complex>\\n#include <deque>\\n#include <iterator>\\n#include <numeric>\\n#include <map>\\n#include <unordered_map>\\n#include <queue>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <utility>\\n#include <limits>\\n#include <iomanip>\\n#include <functional>\\n#include <cassert>\\n// #include <atcoder/all>\\nusing namespace std;\\n\\nusing ll=long long;\\ntemplate<class T> using V = vector<T>;\\ntemplate<class T, class U> using P = pair<T, U>;\\nusing vll = V<ll>;\\nusing vvll = V<vll>;\\n#define ALL(v) v.begin(),v.end()\\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\\\n':' ');\\n\\nconst long long MOD = 998244353;\\nconst long long HIGHINF = (long long)1e18;\\nconst int INF = (int)1e9;\\n\\nclass ModInt {\\npublic:\\n long long x;\\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\\n constexpr ModInt& operator+=(const ModInt rhs) {\\n x += rhs.x;\\n if (x >= MOD) x -= MOD;\\n return *this;\\n }\\n constexpr ModInt operator+(const ModInt rhs) const {\\n return ModInt(*this) += rhs; \\n }\\n constexpr ModInt& operator-=(const ModInt& rhs) {\\n x -= rhs.x;\\n if (x < 0) x += MOD;\\n return *this;\\n }\\n constexpr ModInt operator-(const ModInt rhs) const {\\n return ModInt(*this) -= rhs; \\n }\\n constexpr ModInt& operator*=(const ModInt& rhs) {\\n x = x * rhs.x % MOD;\\n return *this;\\n }\\n constexpr ModInt operator*(const ModInt rhs) const {\\n return ModInt(*this) *= rhs; \\n }\\n constexpr ModInt& operator/=(const ModInt& rhs) {\\n ModInt div = powmod(rhs, MOD - 2);\\n (x *= div.x) %= MOD;\\n return *this;\\n }\\n constexpr ModInt operator/(const ModInt rhs) const {\\n return ModInt(*this) /= rhs;\\n }\\n constexpr ModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n }\\n constexpr ModInt& operator++() {\\n x += 1;\\n return *this;\\n }\\n constexpr ModInt operator++(int) {\\n ModInt tmp(*this);\\n operator++();\\n return tmp;\\n }\\n constexpr ModInt& operator--() {\\n x -= 1;\\n return *this;\\n }\\n constexpr ModInt operator--(int) {\\n ModInt tmp(*this);\\n operator--();\\n return tmp;\\n }\\n\\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\\n os << rhs.x;\\n return os;\\n }\\n friend istream& operator>>(istream& is, ModInt& rhs) {\\n is >> rhs.x;\\n return is;\\n }\\n};\\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\\n return lhs.x == rhs.x;\\n}\\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\\n return !(lhs == rhs);\\n}\\nModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n}\\n\\nusing modi = ModInt;\\n\\n\\n// [ModInt]\\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\\nconst int NMAX = 2000005;\\ntemplate < typename T >\\nclass Combination {\\npublic:\\n std::vector<T> fac, invfac;\\n Combination() {\\n fac.resize(NMAX), invfac.resize(NMAX);\\n fac[0] = fac[1] = T(1);\\n invfac[0] = invfac[1] = T(1);\\n for (int i = 2; i <= NMAX; i++) {\\n fac[i] = fac[i - 1] * T(i);\\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\\n }\\n }\\n\\n // nCr = n! / r!(n-r)!\\n T nCr(int n, int r) {\\n if (n < 0 || r > n || r < 0) return T(0);\\n return fac[n] * invfac[r] * invfac[n - r];\\n }\\n \\n // 重複組み合わせ nHr = (n + r - 1)C(r)\\n T nHr(int n, int r) {\\n return nCr(n + r - 1, r);\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n, k; cin >> n >> k;\\n Combination<modi> comb;\\n\\n modi asum = 0, bsum = 0;\\n for (int i = 0; i < n; i++) {\\n ll a; cin >> a; asum += modi(a);\\n }\\n for (int i = 0; i < n; i++) {\\n ll b; cin >> b; bsum += modi(b);\\n }\\n V<modi> fac(n + 1, 1), pow2(n + 1, 1);\\n pow2[1] = modi(2);\\n for (int i = 2; i < n; i++) {\\n fac[i] = fac[i - 1] * modi(i);\\n pow2[i] = pow2[i - 1] * modi(2);\\n }\\n\\n modi ans = 0;\\n for (int cyc = 1; 2 * cyc <= k; cyc++) {\\n modi tmp = pow2[cyc] * fac[cyc - 1] * comb.nHr(cyc, k - 3 * cyc) * comb.nHr(cyc, n - k + cyc);\\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 500,\n \"memory_kb\": 50096,\n \"score_of_the_acc\": -1.0816,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3169_4880458\",\n \"code_snippet\": \"#include <iostream>\\n#include <array>\\n#include <algorithm>\\n#include <vector>\\n#include <bitset>\\n#include <set>\\n#include <unordered_set>\\n#include <cmath>\\n#include <complex>\\n#include <deque>\\n#include <iterator>\\n#include <numeric>\\n#include <map>\\n#include <unordered_map>\\n#include <queue>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <utility>\\n#include <limits>\\n#include <iomanip>\\n#include <functional>\\n#include <cassert>\\n// #include <atcoder/all>\\nusing namespace std;\\n\\nusing ll=long long;\\ntemplate<class T> using V = vector<T>;\\ntemplate<class T, class U> using P = pair<T, U>;\\nusing vll = V<ll>;\\nusing vvll = V<vll>;\\n#define ALL(v) v.begin(),v.end()\\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\\\n':' ');\\n\\nconst long long MOD = 998244353;\\nconst long long HIGHINF = (long long)1e18;\\nconst int INF = (int)1e9;\\n\\nclass ModInt {\\npublic:\\n long long x;\\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\\n constexpr ModInt& operator+=(const ModInt rhs) {\\n x += rhs.x;\\n if (x >= MOD) x -= MOD;\\n return *this;\\n }\\n constexpr ModInt operator+(const ModInt rhs) const {\\n return ModInt(*this) += rhs; \\n }\\n constexpr ModInt& operator-=(const ModInt& rhs) {\\n x -= rhs.x;\\n if (x < 0) x += MOD;\\n return *this;\\n }\\n constexpr ModInt operator-(const ModInt rhs) const {\\n return ModInt(*this) -= rhs; \\n }\\n constexpr ModInt& operator*=(const ModInt& rhs) {\\n x = x * rhs.x % MOD;\\n return *this;\\n }\\n constexpr ModInt operator*(const ModInt rhs) const {\\n return ModInt(*this) *= rhs; \\n }\\n constexpr ModInt& operator/=(const ModInt& rhs) {\\n ModInt div = powmod(rhs, MOD - 2);\\n (x *= div.x) %= MOD;\\n return *this;\\n }\\n constexpr ModInt operator/(const ModInt rhs) const {\\n return ModInt(*this) /= rhs;\\n }\\n constexpr ModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n }\\n constexpr ModInt& operator++() {\\n x += 1;\\n return *this;\\n }\\n constexpr ModInt operator++(int) {\\n ModInt tmp(*this);\\n operator++();\\n return tmp;\\n }\\n constexpr ModInt& operator--() {\\n x -= 1;\\n return *this;\\n }\\n constexpr ModInt operator--(int) {\\n ModInt tmp(*this);\\n operator--();\\n return tmp;\\n }\\n\\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\\n os << rhs.x;\\n return os;\\n }\\n friend istream& operator>>(istream& is, ModInt& rhs) {\\n is >> rhs.x;\\n return is;\\n }\\n};\\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\\n return lhs.x == rhs.x;\\n}\\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\\n return !(lhs == rhs);\\n}\\nModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n}\\n\\nusing modi = ModInt;\\n\\n\\n// [ModInt]\\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\\nconst int NMAX = 5000005;\\ntemplate < typename T >\\nclass Combination {\\npublic:\\n std::vector<T> fac, invfac;\\n Combination() {\\n fac.resize(NMAX), invfac.resize(NMAX);\\n fac[0] = fac[1] = T(1);\\n invfac[0] = invfac[1] = T(1);\\n for (int i = 2; i <= NMAX; i++) {\\n fac[i] = fac[i - 1] * T(i);\\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\\n }\\n }\\n\\n // nCr = n! / r!(n-r)!\\n T nCr(int n, int r) {\\n if (n < 0 || r > n || r < 0) return T(0);\\n return fac[n] * invfac[r] * invfac[n - r];\\n }\\n \\n // 重複組み合わせ nHr = (n + r - 1)C(r)\\n T nHr(int n, int r) {\\n return nCr(n + r - 1, r);\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n, k; cin >> n >> k;\\n Combination<modi> comb;\\n\\n modi asum = 0, bsum = 0;\\n for (int i = 0; i < n; i++) {\\n ll a, b; cin >> a >> b;\\n asum += modi(a), bsum += modi(b);\\n }\\n V<modi> fac(n + 1, 1), pow2(n + 1, 1);\\n pow2[1] = modi(2);\\n for (int i = 2; i <= n; i++) {\\n fac[i] = fac[i - 1] * modi(i);\\n pow2[i] = pow2[i - 1] * modi(2);\\n }\\n\\n modi ans = 0;\\n for (int cyc = 1; 2 * cyc <= k; cyc++) {\\n modi tmp = pow2[cyc] * fac[cyc - 1] * comb.nCr(k - 2 * cyc - 1, k - 3 * cyc) * comb.nCr(n - k + 2 * cyc - 1, n - k + cyc);\\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 910,\n \"memory_kb\": 81176,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3169_4880452\",\n \"code_snippet\": \"#include <iostream>\\n#include <array>\\n#include <algorithm>\\n#include <vector>\\n#include <bitset>\\n#include <set>\\n#include <unordered_set>\\n#include <cmath>\\n#include <complex>\\n#include <deque>\\n#include <iterator>\\n#include <numeric>\\n#include <map>\\n#include <unordered_map>\\n#include <queue>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <utility>\\n#include <limits>\\n#include <iomanip>\\n#include <functional>\\n#include <cassert>\\n// #include <atcoder/all>\\nusing namespace std;\\n\\nusing ll=long long;\\ntemplate<class T> using V = vector<T>;\\ntemplate<class T, class U> using P = pair<T, U>;\\nusing vll = V<ll>;\\nusing vvll = V<vll>;\\n#define ALL(v) v.begin(),v.end()\\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\\\n':' ');\\n\\nconst long long MOD = 998244353;\\nconst long long HIGHINF = (long long)1e18;\\nconst int INF = (int)1e9;\\n\\nclass ModInt {\\npublic:\\n long long x;\\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\\n constexpr ModInt& operator+=(const ModInt rhs) {\\n x += rhs.x;\\n if (x >= MOD) x -= MOD;\\n return *this;\\n }\\n constexpr ModInt operator+(const ModInt rhs) const {\\n return ModInt(*this) += rhs; \\n }\\n constexpr ModInt& operator-=(const ModInt& rhs) {\\n x -= rhs.x;\\n if (x < 0) x += MOD;\\n return *this;\\n }\\n constexpr ModInt operator-(const ModInt rhs) const {\\n return ModInt(*this) -= rhs; \\n }\\n constexpr ModInt& operator*=(const ModInt& rhs) {\\n x = x * rhs.x % MOD;\\n return *this;\\n }\\n constexpr ModInt operator*(const ModInt rhs) const {\\n return ModInt(*this) *= rhs; \\n }\\n constexpr ModInt& operator/=(const ModInt& rhs) {\\n ModInt div = powmod(rhs, MOD - 2);\\n (x *= div.x) %= MOD;\\n return *this;\\n }\\n constexpr ModInt operator/(const ModInt rhs) const {\\n return ModInt(*this) /= rhs;\\n }\\n constexpr ModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n }\\n constexpr ModInt& operator++() {\\n x += 1;\\n return *this;\\n }\\n constexpr ModInt operator++(int) {\\n ModInt tmp(*this);\\n operator++();\\n return tmp;\\n }\\n constexpr ModInt& operator--() {\\n x -= 1;\\n return *this;\\n }\\n constexpr ModInt operator--(int) {\\n ModInt tmp(*this);\\n operator--();\\n return tmp;\\n }\\n\\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\\n os << rhs.x;\\n return os;\\n }\\n friend istream& operator>>(istream& is, ModInt& rhs) {\\n is >> rhs.x;\\n return is;\\n }\\n};\\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\\n return lhs.x == rhs.x;\\n}\\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\\n return !(lhs == rhs);\\n}\\nModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n}\\n\\nusing modi = ModInt;\\n\\n\\n// [ModInt]\\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\\nconst int NMAX = 5000005;\\ntemplate < typename T >\\nclass Combination {\\npublic:\\n std::vector<T> fac, invfac;\\n Combination() {\\n fac.resize(NMAX), invfac.resize(NMAX);\\n fac[0] = fac[1] = T(1);\\n invfac[0] = invfac[1] = T(1);\\n for (int i = 2; i <= NMAX; i++) {\\n fac[i] = fac[i - 1] * T(i);\\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\\n }\\n }\\n\\n // nCr = n! / r!(n-r)!\\n T nCr(int n, int r) {\\n if (n < 0 || r > n || r < 0) return T(0);\\n return fac[n] * invfac[r] * invfac[n - r];\\n }\\n \\n // 重複組み合わせ nHr = (n + r - 1)C(r - 1)\\n T nHr(int n, int r) {\\n return nCr(n + r - 1, r);\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n, k; cin >> n >> k;\\n Combination<modi> comb;\\n\\n modi asum = 0, bsum = 0;\\n for (int i = 0; i < n; i++) {\\n modi a, b; cin >> a >> b;\\n asum += modi(a), bsum += modi(b);\\n }\\n asum /= modi(n), bsum /= modi(n);\\n V<modi> fac(n, 1), pow2(n, 1);\\n pow2[1] = 2;\\n for (int i = 2; i < n; i++) {\\n fac[i] = fac[i - 1] * modi(i);\\n pow2[i] = pow2[i - 1] * modi(2);\\n }\\n\\n modi ans = 0;\\n for (int cyc = 1; 2 * cyc <= k; cyc++) {\\n modi tmp = pow2[cyc] * fac[cyc - 1] * modi(n) * comb.nHr(cyc, k - 3 * cyc) * comb.nHr(cyc, n - k + cyc);\\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 910,\n \"memory_kb\": 81148,\n \"score_of_the_acc\": -1.9996,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3169_4880444\",\n \"code_snippet\": \"#include <iostream>\\n#include <array>\\n#include <algorithm>\\n#include <vector>\\n#include <bitset>\\n#include <set>\\n#include <unordered_set>\\n#include <cmath>\\n#include <complex>\\n#include <deque>\\n#include <iterator>\\n#include <numeric>\\n#include <map>\\n#include <unordered_map>\\n#include <queue>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <utility>\\n#include <limits>\\n#include <iomanip>\\n#include <functional>\\n#include <cassert>\\n// #include <atcoder/all>\\nusing namespace std;\\n\\nusing ll=long long;\\ntemplate<class T> using V = vector<T>;\\ntemplate<class T, class U> using P = pair<T, U>;\\nusing vll = V<ll>;\\nusing vvll = V<vll>;\\n#define ALL(v) v.begin(),v.end()\\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\\\n':' ');\\n\\nconst long long MOD = 998244353;\\nconst long long HIGHINF = (long long)1e18;\\nconst int INF = (int)1e9;\\n\\nclass ModInt {\\npublic:\\n long long x;\\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\\n constexpr ModInt& operator+=(const ModInt rhs) {\\n x += rhs.x;\\n if (x >= MOD) x -= MOD;\\n return *this;\\n }\\n constexpr ModInt operator+(const ModInt rhs) const {\\n return ModInt(*this) += rhs; \\n }\\n constexpr ModInt& operator-=(const ModInt& rhs) {\\n x -= rhs.x;\\n if (x < 0) x += MOD;\\n return *this;\\n }\\n constexpr ModInt operator-(const ModInt rhs) const {\\n return ModInt(*this) -= rhs; \\n }\\n constexpr ModInt& operator*=(const ModInt& rhs) {\\n x = x * rhs.x % MOD;\\n return *this;\\n }\\n constexpr ModInt operator*(const ModInt rhs) const {\\n return ModInt(*this) *= rhs; \\n }\\n constexpr ModInt& operator/=(const ModInt& rhs) {\\n ModInt div = powmod(rhs, MOD - 2);\\n (x *= div.x) %= MOD;\\n return *this;\\n }\\n constexpr ModInt operator/(const ModInt rhs) const {\\n return ModInt(*this) /= rhs;\\n }\\n constexpr ModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n }\\n constexpr ModInt& operator++() {\\n x += 1;\\n return *this;\\n }\\n constexpr ModInt operator++(int) {\\n ModInt tmp(*this);\\n operator++();\\n return tmp;\\n }\\n constexpr ModInt& operator--() {\\n x -= 1;\\n return *this;\\n }\\n constexpr ModInt operator--(int) {\\n ModInt tmp(*this);\\n operator--();\\n return tmp;\\n }\\n\\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\\n os << rhs.x;\\n return os;\\n }\\n friend istream& operator>>(istream& is, ModInt& rhs) {\\n is >> rhs.x;\\n return is;\\n }\\n};\\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\\n return lhs.x == rhs.x;\\n}\\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\\n return !(lhs == rhs);\\n}\\nModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n}\\n\\nusing modi = ModInt;\\n\\n\\n// [ModInt]\\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\\nconst int NMAX = 1000005;\\ntemplate < typename T >\\nclass Combination {\\npublic:\\n std::vector<T> fac, invfac;\\n Combination() {\\n fac.resize(NMAX), invfac.resize(NMAX);\\n fac[0] = fac[1] = T(1);\\n invfac[0] = invfac[1] = T(1);\\n for (int i = 2; i <= NMAX; i++) {\\n fac[i] = fac[i - 1] * T(i);\\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\\n }\\n }\\n\\n // nCr = n! / r!(n-r)!\\n T nCr(int n, int r) {\\n if (n < 0 || r > n || r < 0) return T(0);\\n return fac[n] * invfac[r] * invfac[n - r];\\n }\\n \\n // 重複組み合わせ nHr = (n + r - 1)C(r - 1)\\n T nHr(int n, int r) {\\n return nCr(n + r - 1, r);\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n, k; cin >> n >> k;\\n Combination<modi> comb;\\n\\n modi asum = 0, bsum = 0;\\n for (int i = 0; i < n; i++) {\\n modi a, b; cin >> a >> b;\\n asum += modi(a), bsum += modi(b);\\n }\\n asum /= modi(n), bsum /= modi(n);\\n V<modi> fac(n, 1), pow2(n, 1);\\n pow2[1] = 2;\\n for (int i = 2; i < n; i++) {\\n fac[i] = fac[i - 1] * modi(i);\\n pow2[i] = pow2[i - 1] * modi(2);\\n }\\n\\n modi ans = 0;\\n for (int cyc = 1; 2 * cyc <= k; cyc++) {\\n modi tmp = pow2[cyc] * fac[cyc - 1] * modi(n) * comb.nHr(cyc, k - 3 * cyc) * comb.nHr(cyc, n - k + cyc);\\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 180,\n \"memory_kb\": 18772,\n \"score_of_the_acc\": -0.2643,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3169_4880443\",\n \"code_snippet\": \"#include <iostream>\\n#include <array>\\n#include <algorithm>\\n#include <vector>\\n#include <bitset>\\n#include <set>\\n#include <unordered_set>\\n#include <cmath>\\n#include <complex>\\n#include <deque>\\n#include <iterator>\\n#include <numeric>\\n#include <map>\\n#include <unordered_map>\\n#include <queue>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <utility>\\n#include <limits>\\n#include <iomanip>\\n#include <functional>\\n#include <cassert>\\n// #include <atcoder/all>\\nusing namespace std;\\n\\nusing ll=long long;\\ntemplate<class T> using V = vector<T>;\\ntemplate<class T, class U> using P = pair<T, U>;\\nusing vll = V<ll>;\\nusing vvll = V<vll>;\\n#define ALL(v) v.begin(),v.end()\\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\\\n':' ');\\n\\nconst long long MOD = 998244353;\\nconst long long HIGHINF = (long long)1e18;\\nconst int INF = (int)1e9;\\n\\nclass ModInt {\\npublic:\\n long long x;\\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\\n constexpr ModInt& operator+=(const ModInt rhs) {\\n x += rhs.x;\\n if (x >= MOD) x -= MOD;\\n return *this;\\n }\\n constexpr ModInt operator+(const ModInt rhs) const {\\n return ModInt(*this) += rhs; \\n }\\n constexpr ModInt& operator-=(const ModInt& rhs) {\\n x -= rhs.x;\\n if (x < 0) x += MOD;\\n return *this;\\n }\\n constexpr ModInt operator-(const ModInt rhs) const {\\n return ModInt(*this) -= rhs; \\n }\\n constexpr ModInt& operator*=(const ModInt& rhs) {\\n x = x * rhs.x % MOD;\\n return *this;\\n }\\n constexpr ModInt operator*(const ModInt rhs) const {\\n return ModInt(*this) *= rhs; \\n }\\n constexpr ModInt& operator/=(const ModInt& rhs) {\\n ModInt div = powmod(rhs, MOD - 2);\\n (x *= div.x) %= MOD;\\n return *this;\\n }\\n constexpr ModInt operator/(const ModInt rhs) const {\\n return ModInt(*this) /= rhs;\\n }\\n constexpr ModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n }\\n constexpr ModInt& operator++() {\\n x += 1;\\n return *this;\\n }\\n constexpr ModInt operator++(int) {\\n ModInt tmp(*this);\\n operator++();\\n return tmp;\\n }\\n constexpr ModInt& operator--() {\\n x -= 1;\\n return *this;\\n }\\n constexpr ModInt operator--(int) {\\n ModInt tmp(*this);\\n operator--();\\n return tmp;\\n }\\n\\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\\n os << rhs.x;\\n return os;\\n }\\n friend istream& operator>>(istream& is, ModInt& rhs) {\\n is >> rhs.x;\\n return is;\\n }\\n};\\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\\n return lhs.x == rhs.x;\\n}\\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\\n return !(lhs == rhs);\\n}\\nModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n}\\n\\nusing modi = ModInt;\\n\\n\\n// [ModInt]\\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\\nconst int NMAX = 1000005;\\ntemplate < typename T >\\nclass Combination {\\npublic:\\n std::vector<T> fac, invfac;\\n Combination() {\\n fac.resize(NMAX), invfac.resize(NMAX);\\n fac[0] = fac[1] = T(1);\\n invfac[0] = invfac[1] = T(1);\\n for (int i = 2; i <= NMAX; i++) {\\n fac[i] = fac[i - 1] * T(i);\\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\\n }\\n }\\n\\n // nCr = n! / r!(n-r)!\\n T nCr(int n, int r) {\\n if (n < 0 || r > n || r < 0) return T(0);\\n return fac[n] * invfac[r] * invfac[n - r];\\n }\\n \\n // 重複組み合わせ nHr = (n + r - 1)C(r - 1)\\n T nHr(int n, int r) {\\n return nCr(n + r - 1, r);\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n, k; cin >> n >> k;\\n Combination<modi> comb;\\n\\n modi asum = 0, bsum = 0;\\n for (int i = 0; i < n; i++) {\\n modi a, b; cin >> a >> b;\\n asum += a, bsum += b;\\n }\\n asum /= modi(n), bsum /= modi(n);\\n V<modi> fac(n, 1), pow2(n, 1);\\n pow2[1] = 2;\\n for (int i = 2; i < n; i++) {\\n fac[i] = fac[i - 1] * modi(i);\\n pow2[i] = pow2[i - 1] * modi(2);\\n }\\n\\n modi ans = 0;\\n for (int cyc = 1; cyc < n; cyc++) {\\n if (k < 2 * cyc) break;\\n modi tmp = pow2[cyc] * fac[cyc - 1] * modi(n) * comb.nHr(cyc, k - 3 * cyc) * comb.nHr(cyc, n - k + cyc);\\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 180,\n \"memory_kb\": 18700,\n \"score_of_the_acc\": -0.2633,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3169_4879627\",\n \"code_snippet\": \"#include <iostream>\\n#include <array>\\n#include <algorithm>\\n#include <vector>\\n#include <bitset>\\n#include <set>\\n#include <unordered_set>\\n#include <cmath>\\n#include <complex>\\n#include <deque>\\n#include <iterator>\\n#include <numeric>\\n#include <map>\\n#include <unordered_map>\\n#include <queue>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <utility>\\n#include <limits>\\n#include <iomanip>\\n#include <functional>\\n#include <cassert>\\n// #include <atcoder/all>\\nusing namespace std;\\n\\nusing ll=long long;\\ntemplate<class T> using V = vector<T>;\\ntemplate<class T, class U> using P = pair<T, U>;\\nusing vll = V<ll>;\\nusing vvll = V<vll>;\\n#define ALL(v) v.begin(),v.end()\\ntemplate < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }\\ntemplate < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }\\n#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\\\\n':' ');\\n\\nconst long long MOD = 998244353;\\nconst long long HIGHINF = (long long)1e18;\\nconst int INF = (int)1e9;\\n\\nclass ModInt {\\npublic:\\n long long x;\\n constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}\\n constexpr ModInt& operator+=(const ModInt rhs) {\\n x += rhs.x;\\n if (x >= MOD) x -= MOD;\\n return *this;\\n }\\n constexpr ModInt operator+(const ModInt rhs) const {\\n return ModInt(*this) += rhs; \\n }\\n constexpr ModInt& operator-=(const ModInt& rhs) {\\n x -= rhs.x;\\n if (x < 0) x += MOD;\\n return *this;\\n }\\n constexpr ModInt operator-(const ModInt rhs) const {\\n return ModInt(*this) -= rhs; \\n }\\n constexpr ModInt& operator*=(const ModInt& rhs) {\\n x = x * rhs.x % MOD;\\n return *this;\\n }\\n constexpr ModInt operator*(const ModInt rhs) const {\\n return ModInt(*this) *= rhs; \\n }\\n constexpr ModInt& operator/=(const ModInt& rhs) {\\n ModInt div = powmod(rhs, MOD - 2);\\n (x *= div.x) %= MOD;\\n return *this;\\n }\\n constexpr ModInt operator/(const ModInt rhs) const {\\n return ModInt(*this) /= rhs;\\n }\\n constexpr ModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n }\\n constexpr ModInt& operator++() {\\n x += 1;\\n return *this;\\n }\\n constexpr ModInt operator++(int) {\\n ModInt tmp(*this);\\n operator++();\\n return tmp;\\n }\\n constexpr ModInt& operator--() {\\n x -= 1;\\n return *this;\\n }\\n constexpr ModInt operator--(int) {\\n ModInt tmp(*this);\\n operator--();\\n return tmp;\\n }\\n\\n friend ostream& operator<<(ostream& os, const ModInt &rhs) {\\n os << rhs.x;\\n return os;\\n }\\n friend istream& operator>>(istream& is, ModInt& rhs) {\\n is >> rhs.x;\\n return is;\\n }\\n};\\nbool operator==(const ModInt& lhs, const ModInt& rhs) {\\n return lhs.x == rhs.x;\\n}\\nbool operator!=(const ModInt& lhs, const ModInt& rhs) {\\n return !(lhs == rhs);\\n}\\nModInt powmod(ModInt m, long long p) {\\n if (p == 0) return ModInt(1);\\n ModInt tmp = powmod(m, p / 2);\\n if (p & 1) return tmp * tmp * m;\\n else return tmp * tmp;\\n}\\n\\nusing modi = ModInt;\\n\\n\\n// [ModInt]\\n// verified at https://atcoder.jp/contests/abc021/submissions/15053490\\nconst int NMAX = 1000005;\\ntemplate < typename T >\\nclass Combination {\\npublic:\\n std::vector<T> fac, invfac;\\n Combination() {\\n fac.resize(NMAX), invfac.resize(NMAX);\\n fac[0] = fac[1] = T(1);\\n invfac[0] = invfac[1] = T(1);\\n for (int i = 2; i <= NMAX; i++) {\\n fac[i] = fac[i - 1] * T(i);\\n invfac[i] = invfac[i - 1] * powmod(T(i), MOD - 2);\\n }\\n }\\n\\n // nCr = n! / r!(n-r)!\\n T nCr(int n, int r) {\\n if (n < 0 || r > n || r < 0) return T(0);\\n return fac[n] * invfac[r] * invfac[n - r];\\n }\\n \\n // 重複組み合わせ nHr = (n + r - 1)C(r - 1)\\n T nHr(int n, int r) {\\n return nCr(n + r - 1, r);\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n, k; cin >> n >> k;\\n Combination<modi> comb;\\n\\n modi asum = 0, bsum = 0;\\n for (int i = 0; i < n; i++) {\\n modi a, b; cin >> a >> b;\\n asum += a, bsum += b;\\n }\\n asum /= modi(n), bsum /= modi(n);\\n V<modi> fac(n, 1), pow2(n, 1);\\n pow2[1] = 2;\\n for (int i = 2; i < n; i++) {\\n fac[i] = fac[i - 1] * modi(i);\\n pow2[i] = pow2[i - 1] * modi(2);\\n }\\n\\n modi ans = 0;\\n for (int cyc = 1; cyc < n; cyc++) {\\n if (k - 2 * cyc <= 0) break;\\n modi tmp = pow2[cyc] * fac[cyc - 1] * modi(n) * comb.nHr(cyc, k - 3 * cyc) * comb.nHr(cyc, n - k + cyc);\\n ans += tmp * (modi(2 * cyc) * asum + modi(k - 2 * cyc) * bsum);\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 180,\n \"memory_kb\": 18740,\n \"score_of_the_acc\": -0.2639,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3169_4879023\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it << \\\"> \\\"; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it.first << \\\"->\\\" << it.second << \\\"> \\\"; } return s << endl; }\\n\\n\\n\\n// modint: mod 計算を int を扱うように扱える構造体\\ntemplate<int MOD> struct Fp {\\n long long val;\\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\\n if (val < 0) val += MOD;\\n }\\n constexpr int getmod() { return MOD; }\\n constexpr Fp operator - () const noexcept {\\n return val ? MOD - val : 0;\\n }\\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\\n constexpr Fp& operator += (const Fp& r) noexcept {\\n val += r.val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -= (const Fp& r) noexcept {\\n val -= r.val;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp& operator *= (const Fp& r) noexcept {\\n val = val * r.val % MOD;\\n return *this;\\n }\\n constexpr Fp& operator /= (const Fp& r) noexcept {\\n long long a = r.val, b = MOD, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b; swap(a, b);\\n u -= t * v; swap(u, v);\\n }\\n val = val * u % MOD;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr bool operator == (const Fp& r) const noexcept {\\n return this->val == r.val;\\n }\\n constexpr bool operator != (const Fp& r) const noexcept {\\n return this->val != r.val;\\n }\\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\\n return os << x.val;\\n }\\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\\n if (n == 0) return 1;\\n auto t = modpow(a, n / 2);\\n t = t * t;\\n if (n & 1) t = t * a;\\n return t;\\n }\\n};\\n\\n// 二項係数ライブラリ\\ntemplate<class T> struct BiCoef {\\n vector<T> fact_, inv_, finv_;\\n constexpr BiCoef() {}\\n constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {\\n init(n);\\n }\\n constexpr void init(int n) noexcept {\\n fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);\\n int MOD = fact_[0].getmod();\\n for(int i = 2; i < n; i++){\\n fact_[i] = fact_[i-1] * i;\\n inv_[i] = -inv_[MOD%i] * (MOD/i);\\n finv_[i] = finv_[i-1] * inv_[i];\\n }\\n }\\n constexpr T com(int n, int k) const noexcept {\\n if (n < k || n < 0 || k < 0) return 0;\\n return fact_[n] * finv_[k] * finv_[n-k];\\n }\\n constexpr T fact(int n) const noexcept {\\n if (n < 0) return 0;\\n return fact_[n];\\n }\\n constexpr T inv(int n) const noexcept {\\n if (n < 0) return 0;\\n return inv_[n];\\n }\\n constexpr T finv(int n) const noexcept {\\n if (n < 0) return 0;\\n return finv_[n];\\n }\\n};\\n\\nconst int MOD = 998244353;\\nusing mint = Fp<MOD>;\\n\\nint main() {\\n int N, K;\\n cin >> N >> K;\\n BiCoef<mint> bc(N*2 + 1);\\n mint A = 0, B = 0;\\n for (int i = 0; i < N; ++i) { long long v; cin >> v; A += v; }\\n for (int i = 0; i < N; ++i) { long long v; cin >> v; B += v; }\\n vector<mint> two(N+5, 1);\\n for (int i = 1; i < two.size(); ++i) two[i] = two[i-1] * 2;\\n\\n mint res = 0;\\n for (int i = 1; i*2 <= K; ++i) {\\n mint fac = bc.com(K - i*2 - 1, i - 1) *\\n bc.com(N - K + i*2 - 1, i - 1) *\\n bc.fact(i - 1) * two[i];\\n mint tmp = fac * (A * i*2 + B * (K - i*2));\\n res += tmp;\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 57388,\n \"score_of_the_acc\": -1.3945,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3169_4879018\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it << \\\"> \\\"; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it.first << \\\"->\\\" << it.second << \\\"> \\\"; } return s << endl; }\\n\\n\\n\\n// modint: mod 計算を int を扱うように扱える構造体\\ntemplate<int MOD> struct Fp {\\n long long val;\\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\\n if (val < 0) val += MOD;\\n }\\n constexpr int getmod() { return MOD; }\\n constexpr Fp operator - () const noexcept {\\n return val ? MOD - val : 0;\\n }\\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\\n constexpr Fp& operator += (const Fp& r) noexcept {\\n val += r.val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -= (const Fp& r) noexcept {\\n val -= r.val;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp& operator *= (const Fp& r) noexcept {\\n val = val * r.val % MOD;\\n return *this;\\n }\\n constexpr Fp& operator /= (const Fp& r) noexcept {\\n long long a = r.val, b = MOD, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b; swap(a, b);\\n u -= t * v; swap(u, v);\\n }\\n val = val * u % MOD;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr bool operator == (const Fp& r) const noexcept {\\n return this->val == r.val;\\n }\\n constexpr bool operator != (const Fp& r) const noexcept {\\n return this->val != r.val;\\n }\\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\\n return os << x.val;\\n }\\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\\n if (n == 0) return 1;\\n auto t = modpow(a, n / 2);\\n t = t * t;\\n if (n & 1) t = t * a;\\n return t;\\n }\\n};\\n\\n// 二項係数ライブラリ\\ntemplate<class T> struct BiCoef {\\n vector<T> fact_, inv_, finv_;\\n constexpr BiCoef() {}\\n constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {\\n init(n);\\n }\\n constexpr void init(int n) noexcept {\\n fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);\\n int MOD = fact_[0].getmod();\\n for(int i = 2; i < n; i++){\\n fact_[i] = fact_[i-1] * i;\\n inv_[i] = -inv_[MOD%i] * (MOD/i);\\n finv_[i] = finv_[i-1] * inv_[i];\\n }\\n }\\n constexpr T com(int n, int k) const noexcept {\\n if (n < k || n < 0 || k < 0) return 0;\\n return fact_[n] * finv_[k] * finv_[n-k];\\n }\\n constexpr T fact(int n) const noexcept {\\n if (n < 0) return 0;\\n return fact_[n];\\n }\\n constexpr T inv(int n) const noexcept {\\n if (n < 0) return 0;\\n return inv_[n];\\n }\\n constexpr T finv(int n) const noexcept {\\n if (n < 0) return 0;\\n return finv_[n];\\n }\\n};\\n\\nconst int MOD = 998244353;\\nusing mint = Fp<MOD>;\\n\\nint main() {\\n int N, K;\\n cin >> N >> K;\\n BiCoef<mint> bc(N+1);\\n mint A = 0, B = 0;\\n for (int i = 0; i < N; ++i) { long long v; cin >> v; A += v; }\\n for (int i = 0; i < N; ++i) { long long v; cin >> v; B += v; }\\n vector<mint> two(N+5, 1);\\n for (int i = 1; i < two.size(); ++i) two[i] = two[i-1] * 2;\\n\\n mint res = 0;\\n for (int i = 1; i*2 <= K; ++i) {\\n mint fac = bc.com(K - i*2 - 1, i - 1) *\\n bc.com(N - K + i*2 - 1, i - 1) *\\n bc.fact(i - 1) * two[i];\\n mint tmp = fac * (A * i*2 + B * (K - i*2));\\n res += tmp;\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 0.8,\n \"time_ms\": 570,\n \"memory_kb\": 33892,\n \"score_of_the_acc\": -0.9327,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3169_4877335\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\nconst int MOD=998244353;\\n\\nint pw(int n,int k){\\n assert(k>=0);\\n int res=1;\\n while(k){\\n if(k&1)(res*=n)%=MOD;\\n (n*=n)%=MOD;\\n k>>=1;\\n }\\n return res;\\n}\\nstd::vector<int> Factorial(5e6),Finverse(5e6);\\ninline void Cinit(){\\n Factorial[0]=1;\\n for(int i=1;i<5e6;i++)Factorial[i]=(Factorial[i-1]*i)%MOD;\\n Finverse[4999999]=pw(Factorial[4999999],MOD-2);\\n for(int i=4999998;i>=0;i--)Finverse[i]=(i+1)*Finverse[i+1]%MOD;\\n}\\nint nCk(int n,int k){\\n assert(n>=k&&k>=0);\\n if(n<k)return 0;if(k<0)return 0;\\n assert(n<5000000&&k<5000000);\\n if(!Factorial[0])Cinit();\\n int res=Factorial[n];\\n (res*=Finverse[k])%=MOD;\\n (res*=Finverse[n-k])%=MOD;\\n return res;\\n}\\n\\nsigned main(){\\n int n,k;cin>>n>>k;\\n int asum=0,bsum=0;\\n for(int i=0;i<n;i++){\\n int a;cin>>a;asum+=a;\\n }\\n for(int i=0;i<n;i++){\\n int b;cin>>b;bsum+=b;\\n }\\n asum%=MOD;bsum%=MOD;\\n int ans=0;\\n for(int i=1;i*3<=k&&2*i<=n;i++){//i回降りてi回登る->k-2i個下を旅する\\n if(k-2*i>n-i)continue;\\n int tmp=nCk(k-3*i+i-1,i-1)*nCk(n-k+2*i-i+i-1,i-1)%MOD;\\n (tmp*=n)%=MOD;\\n (tmp*=pw(i,MOD-2))%=MOD;\\n (tmp*=pw(2,i))%=MOD;\\n (tmp*=Factorial[i])%=MOD;\\n int A=asum*2*i%MOD*pw(n,MOD-2)%MOD;\\n int B=bsum*(k-2*i)%MOD*pw(n,MOD-2)%MOD;\\n (tmp*=A+B)%=MOD;\\n (ans+=tmp)%=MOD;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 600,\n \"memory_kb\": 80816,\n \"score_of_the_acc\": -1.6344,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3169_4877310\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\nconst int MOD=998244353;\\n\\nint pw(int n,int k){\\n assert(k>=0);\\n int res=1;\\n while(k){\\n if(k&1)(res*=n)%=MOD;\\n (n*=n)%=MOD;\\n k>>=1;\\n }\\n return res;\\n}\\nstd::vector<int> Factorial(5e6),Finverse(5e6);\\ninline void Cinit(){\\n Factorial[0]=1;\\n for(int i=1;i<5e6;i++)Factorial[i]=(Factorial[i-1]*i)%MOD;\\n Finverse[4999999]=pw(Factorial[4999999],MOD-2);\\n for(int i=4999998;i>=0;i--)Finverse[i]=(i+1)*Finverse[i+1]%MOD;\\n}\\nint nCk(int n,int k){\\n assert(n>=k&&k>=0);\\n if(n<k)return 0;if(k<0)return 0;\\n assert(n<5000000&&k<5000000);\\n if(!Factorial[0])Cinit();\\n int res=Factorial[n];\\n (res*=Finverse[k])%=MOD;\\n (res*=Finverse[n-k])%=MOD;\\n return res;\\n}\\n\\nsigned main(){\\n int n,k;cin>>n>>k;\\n int asum=0,bsum=0;\\n for(int i=0;i<n;i++){\\n int a;cin>>a;asum+=a;\\n }\\n for(int i=0;i<n;i++){\\n int b;cin>>b;bsum+=b;\\n }\\n asum%=MOD;bsum%=MOD;\\n int ans=0;\\n for(int i=1;i*3<=k&&2*i<=n;i++){//i回降りてi回登る->k-2i個下を旅する\\n if(k-2*i>n-i)continue;\\n int tmp=nCk(k-3*i+i-1,i-1)*nCk(n-k+2*i-i+i-1,i-1)%MOD;\\n (tmp*=n)%=MOD;\\n (tmp*=pw(n-(k-2*i),MOD-2))%=MOD;\\n (tmp*=pw(2,i))%=MOD;\\n (tmp*=Factorial[i])%=MOD;\\n int A=asum*2*i%MOD*pw(n,MOD-2)%MOD;\\n int B=bsum*(k-2*i)%MOD*pw(n,MOD-2)%MOD;\\n (tmp*=A+B)%=MOD;\\n (ans+=tmp)%=MOD;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 60,\n \"memory_kb\": 80728,\n \"score_of_the_acc\": -1.0053,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3169_4877308\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\nconst int MOD=998244353;\\n\\nint pw(int n,int k){\\n assert(k>=0);\\n int res=1;\\n while(k){\\n if(k&1)(res*=n)%=MOD;\\n (n*=n)%=MOD;\\n k>>=1;\\n }\\n return res;\\n}\\nstd::vector<int> Factorial(5e6),Finverse(5e6);\\ninline void Cinit(){\\n Factorial[0]=1;\\n for(int i=1;i<5e6;i++)Factorial[i]=(Factorial[i-1]*i)%MOD;\\n Finverse[4999999]=pw(Factorial[4999999],MOD-2);\\n for(int i=4999998;i>=0;i--)Finverse[i]=(i+1)*Finverse[i+1]%MOD;\\n}\\nint nCk(int n,int k){\\n if(n<k)return 0;if(k<0)return 0;\\n assert(n<5000000&&k<5000000);\\n if(!Factorial[0])Cinit();\\n int res=Factorial[n];\\n (res*=Finverse[k])%=MOD;\\n (res*=Finverse[n-k])%=MOD;\\n return res;\\n}\\n\\nsigned main(){\\n int n,k;cin>>n>>k;\\n int asum=0,bsum=0;\\n for(int i=0;i<n;i++){\\n int a;cin>>a;asum+=a;\\n }\\n for(int i=0;i<n;i++){\\n int b;cin>>b;bsum+=b;\\n }\\n asum%=MOD;bsum%=MOD;\\n int ans=0;\\n for(int i=1;i*3<=k&&2*i<=n;i++){//i回降りてi回登る->k-2i個下を旅する\\n if(k-2*i>n-i)continue;\\n int tmp=nCk(k-3*i+i-1,i-1)*nCk(n-k+2*i-i+i-1,i-1)%MOD;\\n (tmp*=n)%=MOD;\\n (tmp*=pw(n-(k-2*i),MOD-2))%=MOD;\\n (tmp*=pw(2,i))%=MOD;\\n (tmp*=Factorial[i])%=MOD;\\n int A=asum*2*i%MOD*pw(n,MOD-2)%MOD;\\n int B=bsum*(k-2*i)%MOD*pw(n,MOD-2)%MOD;\\n (tmp*=A+B)%=MOD;\\n (ans+=tmp)%=MOD;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 60,\n \"memory_kb\": 80768,\n \"score_of_the_acc\": -1.0058,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":1984,"cells":{"group_id":{"kind":"string","value":"aoj_3173_cpp"},"problem_description":{"kind":"string","value":"B Hokkaido_University2\n問題文\nほむちゃんは春から北海道大学に入学しました。\n今日は初めての授業。しかし大変、寝坊をしてしまいました。\nほむちゃんは初めての授業に間に合うことができるのでしょうか。\n札幌は碁盤目状の町並みで知られています。\nより正確には、札幌はxy平面で表されます。\nほむちゃんは各時刻 $t=0,1,2,\\ldots$ で次のいずれかの行動をします。\nほむちゃんは時刻 $t$ に $(x,y)$ にいるとします。\n$x$ が偶数または $t$ が偶数のとき時刻 $t+1$ に $(x+1,y)$ に移動する。\n$x$ が奇数または $t$ が偶数のとき時刻 $t+1$ に $(x-1,y)$ に移動する。\n$y$ が偶数または $t$ が奇数のとき時刻 $t+1$ に $(x,y+1)$ に移動する。\n$y$ が奇数または $t$ が奇数のとき時刻 $t+1$ に $(x,y-1)$ に移動する。\n時刻 $t+1$ まで $(x,y)$ にとどまる。\nほむちゃんは時刻 $0$ に $(s_x,s_y)$ にいます。\n北海道大学の校門は $(g_x,g_y)$ にあります。\n全ての行動の選び方にたいする、ほむちゃんが $(g_x,g_y)$ にたどり着く時刻の最小値を求めてください。\n入力\n入力は以下の形式で標準入力から与えられる。\n$s_x$ $s_y$ $g_x$ $g_y$\n制約\n$0 \\leq s_x,s_y,g_x,g_y \\leq 10^{18}$\n入力は全て整数である。\n出力\n答えを 1 行に出力せよ。\n入力例1\n3 5 4 9\n出力例1\n5\n以下のように動くのが最適です。\n時刻 $0$ に $(3,5)$ から $(4,5)$ に移動する。\n時刻 $1$ に $(4,5)$ から $(4,6)$ に移動する。\n時刻 $2$ に $(4,6)$ から $(4,7)$ に移動する。\n時刻 $3$ に $(4,7)$ から $(4,8)$ に移動する。\n時刻 $4$ に $(4,8)$ から $(4,9)$ に移動する。\n時刻 $5$ に $(4,9)$ に到着する。\n他の動き方では時刻 $5$ に $(4,9)$ にいることはできません。\n入力例2\n0 0 1000 0\n出力例2\n1001"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3173_5075124","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Printer {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid print(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(bool v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(vector<bool>::reference v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid print(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid print(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid print(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void print(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\n\t\tprint(v.first);\n\t\tprint(D.d);\n\t\tprint(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) print(D.d);\n\t\t\tprint(*i);\n\t\t}\n\t}\n\ttemplate <class T> void print(const vector<T>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void print(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) print(D.l);\n\t\t\tprint(v[i]);\n\t\t}\n\t}\n\n\tPrinter() = default;\n\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tPrinter& operator()() {\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Printer& operator()(H&& h) {\n\t\tprint(h);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\n\t\tprint(h);\n\t\tprint(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\n\t\tprint_range(begin, end);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Printer& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tPrinter& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tPrinter& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tPrinter& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tPrinter& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n\ttemplate <class V> auto operator()(const V& val, size_t i) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(next(begin(v), i), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct EachConsPair_impl {\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, EachConsPair_impl& c) {\n\t\tvector<pair<value_type, value_type>> result;\n\t\tif (size(v) >= 2) {\n\t\t\tresult.reserve(size(v) - 1);\n\t\t\tfor (size_t i = 0; i < size(v) - 1; ++i) {\n\t\t\t\tresult.emplace_back(v[i], v[i + 1]);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n} EachConsPair;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 7 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T = long long> constexpr T TEN(size_t n) {\n\tT result = 1;\n\tfor (size_t i = 0; i < n; ++i) result *= 10;\n\treturn result;\n}\ntemplate <class T, class U,\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr auto div_ceil(T n, U m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> constexpr T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> constexpr T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T, class U, class V>\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\n\treturn lower <= v && v < upper;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\nconstexpr bool is_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> constexpr T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T> constexpr int BIT(T x, int i) {\n\treturn (x & (T(1) << i)) ? 1 : 0;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Pow(T a, U n) {\n\tassert(n >= 0);\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Powmod(T a, U n, T mod) {\n\tassert(n >= 0);\n\tif (a > mod) a %= mod;\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 5 \"/home/yuruhiya/programming/library/Graph/GraphTemplate.cpp\"\nusing namespace std;\n\nusing Weight = long long;\nconstexpr Weight INF = numeric_limits<Weight>::max();\nstruct Edge {\n\tint to;\n\tWeight cost;\n\tEdge() : to(-1), cost(-1) {}\n\tEdge(int _to, Weight _cost = 1) : to(_to), cost(_cost) {}\n\tfriend bool operator<(const Edge& e1, const Edge& e2) {\n\t\treturn e1.cost < e2.cost;\n\t}\n\tfriend bool operator>(const Edge& e1, const Edge& e2) {\n\t\treturn e1.cost > e2.cost;\n\t}\n\tfriend ostream& operator<<(ostream& os, const Edge& e) {\n\t\treturn os << \"->\" << e.to << '(' << e.cost << ')';\n\t}\n};\nusing Graph = vector<vector<Edge>>;\nstruct Edge2 {\n\tint from, to;\n\tWeight cost;\n\tEdge2() : from(-1), to(-1), cost(0) {}\n\tEdge2(int _from, int _to, Weight _cost) : from(_from), to(_to), cost(_cost) {}\n\tfriend bool operator<(const Edge2& e1, const Edge2& e2) {\n\t\treturn e1.cost < e2.cost;\n\t}\n\tfriend bool operator>(const Edge2& e1, const Edge2& e2) {\n\t\treturn e1.cost > e2.cost;\n\t}\n\tfriend ostream& operator<<(ostream& os, const Edge2& e) {\n\t\treturn os << e.from << \"->\" << e.to << '(' << e.cost << ')';\n\t}\n};\nusing Edges = vector<Edge2>;\nusing Matrix = vector<vector<Weight>>;\n#line 5 \"/home/yuruhiya/programming/library/Graph/Dijkstra.cpp\"\nusing namespace std;\n\nvector<Weight> Dijkstra(const Graph& graph, int s) {\n\tint V = graph.size();\n\tvector<Weight> dist(V, INF);\n\tdist[s] = 0;\n\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\n\tpq.emplace(s, 0);\n\twhile (!pq.empty()) {\n\t\tEdge p = pq.top();\n\t\tpq.pop();\n\t\tint v = p.to;\n\t\tif (dist[v] < p.cost) continue;\n\t\tfor (auto e : graph[v]) {\n\t\t\tif (dist[e.to] > dist[v] + e.cost) {\n\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\tpq.emplace(e.to, dist[e.to]);\n\t\t\t}\n\t\t}\n\t}\n\treturn dist;\n}\nWeight Dijkstra(const Graph& graph, int s, int t) {\n\tint V = graph.size();\n\tvector<Weight> dist(V, INF);\n\tdist[s] = 0;\n\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\n\tpq.emplace(s, 0);\n\twhile (!pq.empty()) {\n\t\tEdge p = pq.top();\n\t\tpq.pop();\n\t\tint v = p.to;\n\t\tif (v == t) return dist[t];\n\t\tif (dist[v] < p.cost) continue;\n\t\tfor (auto e : graph[v]) {\n\t\t\tif (dist[e.to] > dist[v] + e.cost) {\n\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\tpq.emplace(e.to, dist[e.to]);\n\t\t\t}\n\t\t}\n\t}\n\treturn dist[t];\n}\n#line 3 \"a.cpp\"\n\nint main() {\n\tinl(sx, sy, gx, gy);\n\n\tconst int range = 50;\n\tVL x_val, y_val;\n\tx_val << step(sx - range, sx + range).to_a();\n\tx_val << step(gx - range, gx + range).to_a();\n\ty_val << step(sy - range, sy + range).to_a();\n\ty_val << step(gy - range, gy + range).to_a();\n\tx_val = x_val | Uniq;\n\ty_val = y_val | Uniq;\n\tdump(x_val, y_val);\n\n\tconst int MAX_V = sz(x_val) * sz(y_val) * 2;\n\tGraph g(MAX_V);\n\tauto to_i = [&](ll x, ll y, ll time) {\n\t\treturn lower_index(x_val, x) * sz(y_val) * 2 + lower_index(y_val, y) * 2 + time;\n\t};\n\tauto add_edge = [&](ll x1, ll y1, ll t1, ll x2, ll y2, ll t2, ll cost) {\n\t\tg[to_i(x1, y1, t1)].emplace_back(to_i(x2, y2, t2), cost);\n\t};\n\tauto add_edge2 = [&](ll x1, ll y1, ll t1, ll x2, ll y2, ll t2, ll cost) {\n\t\tadd_edge(x1, y1, t1, x2, y2, t2, cost);\n\t\tadd_edge(x2, y2, t2, x1, y1, t1, cost);\n\t};\n\n\tfor (ll x : x_val) {\n\t\tfor (ll y : y_val) {\n\t\t\tfor (ll f : {0, 1}) {\n\t\t\t\tadd_edge2(x, y, f, x, y, 1 - f, 1);\n\t\t\t}\n\t\t}\n\t}\n\tfor (auto [x1, x2] : x_val | EachConsPair) {\n\t\tfor (ll y : y_val) {\n\t\t\tfor (ll f : {0, 1}) {\n\t\t\t\tif (x1 + 1 == x2) {\n\t\t\t\t\tif (x1 % 2 == 0 || f == 0) {\n\t\t\t\t\t\tadd_edge2(x1, y, f, x2, y, 1 - f, 1);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif ((x1 % 2 == 1 && f == 0) || (x1 % 2 == 0 && f == 1)) {\n\t\t\t\t\t\tadd_edge(x1, y, f, x2, y, (f + x2 - x1) % 2, x2 - x1);\n\t\t\t\t\t}\n\t\t\t\t\tif ((x2 % 2 == 0 && f == 0) || (x2 % 2 == 1 && f == 1)) {\n\t\t\t\t\t\tadd_edge(x2, y, f, x1, y, (f + x2 - x1) % 2, x2 - x1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (ll x : x_val) {\n\t\tfor (auto [y1, y2] : y_val | EachConsPair) {\n\t\t\tfor (ll f : {0, 1}) {\n\t\t\t\tif (y1 + 1 == y2) {\n\t\t\t\t\tif (y1 % 2 == 0 || f == 1) {\n\t\t\t\t\t\tadd_edge2(x, y1, f, x, y2, 1 - f, 1);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif ((y1 % 2 == 1 && f == 1) || (y1 % 2 == 0 && f == 0)) {\n\t\t\t\t\t\tadd_edge(x, y1, f, x, y2, (f + y2 - y1) % 2, y2 - y1);\n\t\t\t\t\t}\n\t\t\t\t\tif ((y2 % 2 == 0 && f == 1) || (y2 % 2 == 1 && f == 0)) {\n\t\t\t\t\t\tadd_edge(x, y2, f, x, y1, (f + y2 - y1) % 2, y2 - y1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tll ans1 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 0));\n\tll ans2 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 1));\n\tout(min(ans1, ans2));\n}","accuracy":0.0425531914893617,"time_ms":40,"memory_kb":17076,"score_of_the_acc":-0.3794,"final_rank":20},{"submission_id":"aoj_3173_5075116","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Printer {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid print(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(bool v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(vector<bool>::reference v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid print(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid print(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid print(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void print(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\n\t\tprint(v.first);\n\t\tprint(D.d);\n\t\tprint(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) print(D.d);\n\t\t\tprint(*i);\n\t\t}\n\t}\n\ttemplate <class T> void print(const vector<T>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void print(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) print(D.l);\n\t\t\tprint(v[i]);\n\t\t}\n\t}\n\n\tPrinter() = default;\n\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tPrinter& operator()() {\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Printer& operator()(H&& h) {\n\t\tprint(h);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\n\t\tprint(h);\n\t\tprint(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\n\t\tprint_range(begin, end);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Printer& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tPrinter& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tPrinter& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tPrinter& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tPrinter& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n\ttemplate <class V> auto operator()(const V& val, size_t i) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(next(begin(v), i), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct EachConsPair_impl {\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, EachConsPair_impl& c) {\n\t\tvector<pair<value_type, value_type>> result;\n\t\tif (size(v) >= 2) {\n\t\t\tresult.reserve(size(v) - 1);\n\t\t\tfor (size_t i = 0; i < size(v) - 1; ++i) {\n\t\t\t\tresult.emplace_back(v[i], v[i + 1]);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n} EachConsPair;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 7 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T = long long> constexpr T TEN(size_t n) {\n\tT result = 1;\n\tfor (size_t i = 0; i < n; ++i) result *= 10;\n\treturn result;\n}\ntemplate <class T, class U,\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr auto div_ceil(T n, U m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> constexpr T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> constexpr T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T, class U, class V>\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\n\treturn lower <= v && v < upper;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\nconstexpr bool is_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> constexpr T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T> constexpr int BIT(T x, int i) {\n\treturn (x & (T(1) << i)) ? 1 : 0;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Pow(T a, U n) {\n\tassert(n >= 0);\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Powmod(T a, U n, T mod) {\n\tassert(n >= 0);\n\tif (a > mod) a %= mod;\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 5 \"/home/yuruhiya/programming/library/Graph/GraphTemplate.cpp\"\nusing namespace std;\n\nusing Weight = long long;\nconstexpr Weight INF = numeric_limits<Weight>::max();\nstruct Edge {\n\tint to;\n\tWeight cost;\n\tEdge() : to(-1), cost(-1) {}\n\tEdge(int _to, Weight _cost = 1) : to(_to), cost(_cost) {}\n\tfriend bool operator<(const Edge& e1, const Edge& e2) {\n\t\treturn e1.cost < e2.cost;\n\t}\n\tfriend bool operator>(const Edge& e1, const Edge& e2) {\n\t\treturn e1.cost > e2.cost;\n\t}\n\tfriend ostream& operator<<(ostream& os, const Edge& e) {\n\t\treturn os << \"->\" << e.to << '(' << e.cost << ')';\n\t}\n};\nusing Graph = vector<vector<Edge>>;\nstruct Edge2 {\n\tint from, to;\n\tWeight cost;\n\tEdge2() : from(-1), to(-1), cost(0) {}\n\tEdge2(int _from, int _to, Weight _cost) : from(_from), to(_to), cost(_cost) {}\n\tfriend bool operator<(const Edge2& e1, const Edge2& e2) {\n\t\treturn e1.cost < e2.cost;\n\t}\n\tfriend bool operator>(const Edge2& e1, const Edge2& e2) {\n\t\treturn e1.cost > e2.cost;\n\t}\n\tfriend ostream& operator<<(ostream& os, const Edge2& e) {\n\t\treturn os << e.from << \"->\" << e.to << '(' << e.cost << ')';\n\t}\n};\nusing Edges = vector<Edge2>;\nusing Matrix = vector<vector<Weight>>;\n#line 5 \"/home/yuruhiya/programming/library/Graph/Dijkstra.cpp\"\nusing namespace std;\n\nvector<Weight> Dijkstra(const Graph& graph, int s) {\n\tint V = graph.size();\n\tvector<Weight> dist(V, INF);\n\tdist[s] = 0;\n\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\n\tpq.emplace(s, 0);\n\twhile (!pq.empty()) {\n\t\tEdge p = pq.top();\n\t\tpq.pop();\n\t\tint v = p.to;\n\t\tif (dist[v] < p.cost) continue;\n\t\tfor (auto e : graph[v]) {\n\t\t\tif (dist[e.to] > dist[v] + e.cost) {\n\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\tpq.emplace(e.to, dist[e.to]);\n\t\t\t}\n\t\t}\n\t}\n\treturn dist;\n}\nWeight Dijkstra(const Graph& graph, int s, int t) {\n\tint V = graph.size();\n\tvector<Weight> dist(V, INF);\n\tdist[s] = 0;\n\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\n\tpq.emplace(s, 0);\n\twhile (!pq.empty()) {\n\t\tEdge p = pq.top();\n\t\tpq.pop();\n\t\tint v = p.to;\n\t\tif (v == t) return dist[t];\n\t\tif (dist[v] < p.cost) continue;\n\t\tfor (auto e : graph[v]) {\n\t\t\tif (dist[e.to] > dist[v] + e.cost) {\n\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\tpq.emplace(e.to, dist[e.to]);\n\t\t\t}\n\t\t}\n\t}\n\treturn dist[t];\n}\n#line 3 \"a.cpp\"\n\nint main() {\n\tinl(sx, sy, gx, gy);\n\n\tconst int range = 50;\n\tVL x_val, y_val;\n\tx_val << step(sx - range, sx + range).to_a();\n\tx_val << step(gx - range, gx + range).to_a();\n\ty_val << step(sy - range, sy + range).to_a();\n\ty_val << step(gy - range, gy + range).to_a();\n\tx_val = x_val | Uniq;\n\ty_val = y_val | Uniq;\n\tdump(x_val, y_val);\n\n\tconst int MAX_V = sz(x_val) * sz(y_val) * 2;\n\tGraph g(MAX_V);\n\tauto to_i = [&](ll x, ll y, ll time) {\n\t\treturn lower_index(x_val, x) * sz(y_val) * 2 + lower_index(y_val, y) * 2 + time;\n\t};\n\tauto add_edge = [&](ll x1, ll y1, ll t1, ll x2, ll y2, ll t2, ll cost) {\n\t\tg[to_i(x1, y1, t1)].emplace_back(to_i(x2, y2, t2), cost);\n\t};\n\tauto add_edge2 = [&](ll x1, ll y1, ll t1, ll x2, ll y2, ll t2, ll cost) {\n\t\tadd_edge(x1, y1, t1, x2, y2, t2, cost);\n\t\tadd_edge(x2, y2, t2, x1, y1, t1, cost);\n\t};\n\n\tfor (ll x : x_val) {\n\t\tfor (ll y : y_val) {\n\t\t\tfor (ll f : {0, 1}) {\n\t\t\t\tadd_edge2(x, y, f, x, y, 1 - f, 1);\n\t\t\t}\n\t\t}\n\t}\n\tfor (auto [x1, x2] : x_val | EachConsPair) {\n\t\tfor (ll y : y_val) {\n\t\t\tfor (ll f : {0, 1}) {\n\t\t\t\tif (x1 + 1 == x2) {\n\t\t\t\t\tif (x1 % 2 == 0 || f == 0) {\n\t\t\t\t\t\tadd_edge2(x1, y, f, x2, y, 1 - f, 1);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif ((x1 % 2 == 1 && f == 0) || (x1 % 2 == 0 && f == 1)) {\n\t\t\t\t\t\tadd_edge2(x1, y, f, x2, y, (f + x2 - x1) % 2, x2 - x1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (ll x : x_val) {\n\t\tfor (auto [y1, y2] : y_val | EachConsPair) {\n\t\t\tfor (ll f : {0, 1}) {\n\t\t\t\tif (y1 + 1 == y2) {\n\t\t\t\t\tif (y1 % 2 == 0 || f == 1) {\n\t\t\t\t\t\tadd_edge2(x, y1, f, x, y2, 1 - f, 1);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif ((y1 % 2 == 1 && f == 1) || (y1 % 2 == 0 && f == 0)) {\n\t\t\t\t\t\tadd_edge2(x, y1, f, x, y2, (f + y2 - y1) % 2, y2 - y1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tll ans1 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 0));\n\tll ans2 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 1));\n\tout(min(ans1, ans2));\n}","accuracy":0.06382978723404255,"time_ms":40,"memory_kb":17320,"score_of_the_acc":-0.3831,"final_rank":18},{"submission_id":"aoj_3173_5075069","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Printer {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid print(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(bool v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(vector<bool>::reference v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid print(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid print(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid print(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void print(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\n\t\tprint(v.first);\n\t\tprint(D.d);\n\t\tprint(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) print(D.d);\n\t\t\tprint(*i);\n\t\t}\n\t}\n\ttemplate <class T> void print(const vector<T>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void print(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) print(D.l);\n\t\t\tprint(v[i]);\n\t\t}\n\t}\n\n\tPrinter() = default;\n\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tPrinter& operator()() {\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Printer& operator()(H&& h) {\n\t\tprint(h);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\n\t\tprint(h);\n\t\tprint(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\n\t\tprint_range(begin, end);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Printer& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tPrinter& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tPrinter& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tPrinter& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tPrinter& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n\ttemplate <class V> auto operator()(const V& val, size_t i) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(next(begin(v), i), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct EachConsPair_impl {\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, EachConsPair_impl& c) {\n\t\tvector<pair<value_type, value_type>> result;\n\t\tif (size(v) >= 2) {\n\t\t\tresult.reserve(size(v) - 1);\n\t\t\tfor (size_t i = 0; i < size(v) - 1; ++i) {\n\t\t\t\tresult.emplace_back(v[i], v[i + 1]);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n} EachConsPair;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 7 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T = long long> constexpr T TEN(size_t n) {\n\tT result = 1;\n\tfor (size_t i = 0; i < n; ++i) result *= 10;\n\treturn result;\n}\ntemplate <class T, class U,\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr auto div_ceil(T n, U m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> constexpr T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> constexpr T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T, class U, class V>\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\n\treturn lower <= v && v < upper;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\nconstexpr bool is_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> constexpr T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T> constexpr int BIT(T x, int i) {\n\treturn (x & (T(1) << i)) ? 1 : 0;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Pow(T a, U n) {\n\tassert(n >= 0);\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Powmod(T a, U n, T mod) {\n\tassert(n >= 0);\n\tif (a > mod) a %= mod;\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 5 \"/home/yuruhiya/programming/library/Graph/GraphTemplate.cpp\"\nusing namespace std;\n\nusing Weight = long long;\nconstexpr Weight INF = numeric_limits<Weight>::max();\nstruct Edge {\n\tint to;\n\tWeight cost;\n\tEdge() : to(-1), cost(-1) {}\n\tEdge(int _to, Weight _cost = 1) : to(_to), cost(_cost) {}\n\tfriend bool operator<(const Edge& e1, const Edge& e2) {\n\t\treturn e1.cost < e2.cost;\n\t}\n\tfriend bool operator>(const Edge& e1, const Edge& e2) {\n\t\treturn e1.cost > e2.cost;\n\t}\n\tfriend ostream& operator<<(ostream& os, const Edge& e) {\n\t\treturn os << \"->\" << e.to << '(' << e.cost << ')';\n\t}\n};\nusing Graph = vector<vector<Edge>>;\nstruct Edge2 {\n\tint from, to;\n\tWeight cost;\n\tEdge2() : from(-1), to(-1), cost(0) {}\n\tEdge2(int _from, int _to, Weight _cost) : from(_from), to(_to), cost(_cost) {}\n\tfriend bool operator<(const Edge2& e1, const Edge2& e2) {\n\t\treturn e1.cost < e2.cost;\n\t}\n\tfriend bool operator>(const Edge2& e1, const Edge2& e2) {\n\t\treturn e1.cost > e2.cost;\n\t}\n\tfriend ostream& operator<<(ostream& os, const Edge2& e) {\n\t\treturn os << e.from << \"->\" << e.to << '(' << e.cost << ')';\n\t}\n};\nusing Edges = vector<Edge2>;\nusing Matrix = vector<vector<Weight>>;\n#line 5 \"/home/yuruhiya/programming/library/Graph/Dijkstra.cpp\"\nusing namespace std;\n\nvector<Weight> Dijkstra(const Graph& graph, int s) {\n\tint V = graph.size();\n\tvector<Weight> dist(V, INF);\n\tdist[s] = 0;\n\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\n\tpq.emplace(s, 0);\n\twhile (!pq.empty()) {\n\t\tEdge p = pq.top();\n\t\tpq.pop();\n\t\tint v = p.to;\n\t\tif (dist[v] < p.cost) continue;\n\t\tfor (auto e : graph[v]) {\n\t\t\tif (dist[e.to] > dist[v] + e.cost) {\n\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\tpq.emplace(e.to, dist[e.to]);\n\t\t\t}\n\t\t}\n\t}\n\treturn dist;\n}\nWeight Dijkstra(const Graph& graph, int s, int t) {\n\tint V = graph.size();\n\tvector<Weight> dist(V, INF);\n\tdist[s] = 0;\n\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\n\tpq.emplace(s, 0);\n\twhile (!pq.empty()) {\n\t\tEdge p = pq.top();\n\t\tpq.pop();\n\t\tint v = p.to;\n\t\tif (v == t) return dist[t];\n\t\tif (dist[v] < p.cost) continue;\n\t\tfor (auto e : graph[v]) {\n\t\t\tif (dist[e.to] > dist[v] + e.cost) {\n\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\tpq.emplace(e.to, dist[e.to]);\n\t\t\t}\n\t\t}\n\t}\n\treturn dist[t];\n}\n#line 3 \"a.cpp\"\n\nint main() {\n\tinl(sx, sy, gx, gy);\n\n\tconst int range = 50;\n\tVL x_val, y_val;\n\tx_val << step(sx - range, sx + range).to_a();\n\tx_val << step(gx - range, gx + range).to_a();\n\ty_val << step(sy - range, sy + range).to_a();\n\ty_val << step(gy - range, gy + range).to_a();\n\tx_val = x_val | Uniq;\n\ty_val = y_val | Uniq;\n\n\tconst int MAX_V = sz(x_val) * sz(y_val) * 2;\n\tGraph g(MAX_V);\n\tauto to_i = [&](int x, int y, int time) {\n\t\treturn lower_index(x_val, x) * sz(y_val) * 2 + lower_index(y_val, y) * 2 + time;\n\t};\n\tauto add_edge = [&](int x1, int y1, int t1, int x2, int y2, int t2, ll cost) {\n\t\tg[to_i(x1, y1, t1)].emplace_back(to_i(x2, y2, t2), cost);\n\t};\n\tauto add_edge2 = [&](int x1, int y1, int t1, int x2, int y2, int t2, ll cost) {\n\t\tadd_edge(x1, y1, t1, x2, y2, t2, cost);\n\t\tadd_edge(x2, y2, t2, x1, y1, t1, cost);\n\t};\n\n\tfor (ll x : x_val) {\n\t\tfor (ll y : y_val) {\n\t\t\tfor (int f : {0, 1}) {\n\t\t\t\tadd_edge2(x, y, f, x, y, 1 - f, 1);\n\t\t\t}\n\t\t}\n\t}\n\tfor (auto [x1, x2] : x_val | EachConsPair) {\n\t\tfor (ll y : y_val) {\n\t\t\tfor (int f : {0, 1}) {\n\t\t\t\tif (x1 + 1 == x2) {\n\t\t\t\t\tif (x1 % 2 == 0 || f == 0) {\n\t\t\t\t\t\tadd_edge2(x1, y, f, x2, y, 1 - f, 1);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (x1 % 2 == 1 && f == 0) {\n\t\t\t\t\t\tadd_edge2(x1, y, f, x2, y, (f + x2 - x1) % 2, x2 - x1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (ll x : x_val) {\n\t\tfor (auto [y1, y2] : y_val | EachConsPair) {\n\t\t\tfor (int f : {0, 1}) {\n\t\t\t\tif (y1 + 1 == y2) {\n\t\t\t\t\tif (y1 % 2 == 0 || f == 1) {\n\t\t\t\t\t\tadd_edge2(x, y1, f, x, y2, 1 - f, 1);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (y1 % 2 == 1 && f == 1) {\n\t\t\t\t\t\tadd_edge2(x, y1, f, x, y2, (f + y2 - y1) % 2, y2 - y1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tll ans1 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 0));\n\tll ans2 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 1));\n\tout(min(ans1, ans2));\n}","accuracy":0.0425531914893617,"time_ms":10,"memory_kb":13020,"score_of_the_acc":-0.1426,"final_rank":19},{"submission_id":"aoj_3173_4860824","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#ifdef _DEBUG\n#include \"_DEBUG.hpp\"\n#endif\n#define int long long\nconst int INF = 2e18;\nconst int MOD = 1e9 + 7;\n\nsigned main() {\n int Sx, Sy, Gx, Gy;\n cin >> Sx >> Sy >> Gx >> Gy;\n\n int ans = INF;\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim) -> void {\n if (lim == 8) return;\n if (y == Gy && x == Gx) {\n ans = min(ans, t);\n return;\n }\n /* ----- x + 1 ----- */\n if (x % 2 == 0 || t % 2 == 0) {\n dfs(dfs, y, x + 1, t + 1, lim + 1);\n }\n /* ----- x - 1 ----- */\n if (x % 2 == 1 || t % 2 == 0) {\n dfs(dfs, y, x - 1, t + 1, lim + 1);\n }\n /* ----- y + 1 ----- */\n if (y % 2 == 0 || t % 2 == 1) {\n dfs(dfs, y + 1, x, t + 1, lim + 1);\n }\n /* ----- y - 1 ----- */\n if (y % 2 == 1 || t % 2 == 1) {\n dfs(dfs, y - 1, x, t + 1, lim + 1);\n }\n /* ----- + 0 ----- */\n dfs(dfs, y, x, t + 1, lim + 1);\n\n /* ----- 一気に行く ----- */\n if ((Gx - x) >= 0 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\n }\n if ((x - Gx) >= 0 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\n }\n if ((Gy - y) >= 0 && (y % 2 == t % 2)) {\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\n }\n if ((y - Gy) >= 0 && (y % 2 != t % 2)) {\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\n }\n\n /* ----- 1つ手前まで行く ----- */\n if ((Gx - x) >= 1 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx - 1, t + (Gx - x) - 1, lim + 1);\n }\n if ((x - Gx) >= 1 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx + 1, t + (x - Gx) - 1, lim + 1);\n }\n if ((Gy - y) >= 1 && (y % 2 == t % 2)) {\n dfs(dfs, Gy - 1, x, t + (Gy - y) - 1, lim + 1);\n }\n if ((y - Gy) >= 1 && (y % 2 != t % 2)) {\n dfs(dfs, Gy + 1, x, t + (y - Gy) - 1, lim + 1);\n }\n\n /* ----- 2つ手前まで行く ----- */\n if ((Gx - x) >= 2 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx - 2, t + (Gx - x) - 2, lim + 1);\n }\n if ((x - Gx) >= 2 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx + 2, t + (x - Gx) - 2, lim + 1);\n }\n if ((Gy - y) >= 2 && (y % 2 == t % 2)) {\n dfs(dfs, Gy - 2, x, t + (Gy - y) - 2, lim + 1);\n }\n if ((y - Gy) >= 2 && (y % 2 != t % 2)) {\n dfs(dfs, Gy + 2, x, t + (y - Gy) - 2, lim + 1);\n }\n\n /* ----- 3つ手前まで行く ----- */\n if ((Gx - x) >= 3 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx - 3, t + (Gx - x) - 3, lim + 1);\n }\n if ((x - Gx) >= 3 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx + 3, t + (x - Gx) - 3, lim + 1);\n }\n if ((Gy - y) >= 3 && (y % 2 == t % 2)) {\n dfs(dfs, Gy - 3, x, t + (Gy - y) - 3, lim + 1);\n }\n if ((y - Gy) >= 3 && (y % 2 != t % 2)) {\n dfs(dfs, Gy + 3, x, t + (y - Gy) - 3, lim + 1);\n }\n\n // /* ----- ジグザグ ----- */\n // if ((Gx - x) > 0 && (Gy - y) > 0 && (x % 2 == 0 && t % 2 == 0)) {\n // int dy = abs(Gy - y), dx = abs(Gx - x);\n // int d = min(dy, dx);\n // dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\n // }\n // if ((Gx - x) < 0 && (Gy - y) > 0 && (x % 2 == 1 && t % 2 == 0)) {\n // int dy = abs(Gy - y), dx = abs(Gx - x);\n // int d = min(dy, dx);\n // dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\n // }\n // if ((Gx - x) < 0 && (Gy - y) < 0 && (x % 2 == 0 && t % 2 == 1)) {\n // int dy = abs(Gy - y), dx = abs(Gx - x);\n // int d = min(dy, dx);\n // dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\n // }\n // if ((Gx - x) > 0 && (Gy - y) < 0 && (x % 2 == 1 && t % 2 == 1)) {\n // int dy = abs(Gy - y), dx = abs(Gx - x);\n // int d = min(dy, dx);\n // dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\n // }\n };\n dfs(dfs, Sy, Sx, 0, 0);\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3432,"score_of_the_acc":-0.1765,"final_rank":2},{"submission_id":"aoj_3173_4860823","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#ifdef _DEBUG\n#include \"_DEBUG.hpp\"\n#endif\n#define int long long\nconst int INF = 2e18;\nconst int MOD = 1e9 + 7;\n\nsigned main() {\n int Sx, Sy, Gx, Gy;\n cin >> Sx >> Sy >> Gx >> Gy;\n\n int ans = INF;\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim) -> void {\n if (lim == 8) return;\n if (y == Gy && x == Gx) {\n ans = min(ans, t);\n return;\n }\n /* ----- x + 1 ----- */\n if (x % 2 == 0 || t % 2 == 0) {\n dfs(dfs, y, x + 1, t + 1, lim + 1);\n }\n /* ----- x - 1 ----- */\n if (x % 2 == 1 || t % 2 == 0) {\n dfs(dfs, y, x - 1, t + 1, lim + 1);\n }\n /* ----- y + 1 ----- */\n if (y % 2 == 0 || t % 2 == 1) {\n dfs(dfs, y + 1, x, t + 1, lim + 1);\n }\n /* ----- y - 1 ----- */\n if (y % 2 == 1 || t % 2 == 1) {\n dfs(dfs, y - 1, x, t + 1, lim + 1);\n }\n /* ----- + 0 ----- */\n dfs(dfs, y, x, t + 1, lim + 1);\n\n /* ----- 一気に行く ----- */\n if ((Gx - x) >= 0 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\n }\n if ((x - Gx) >= 0 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\n }\n if ((Gy - y) >= 0 && (y % 2 == t % 2)) {\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\n }\n if ((y - Gy) >= 0 && (y % 2 != t % 2)) {\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\n }\n\n /* ----- 1つ手前まで行く ----- */\n if ((Gx - x) >= 1 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx - 1, t + (Gx - x) - 1, lim + 1);\n }\n if ((x - Gx) >= 1 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx + 1, t + (x - Gx) - 1, lim + 1);\n }\n if ((Gy - y) >= 1 && (y % 2 == t % 2)) {\n dfs(dfs, Gy - 1, x, t + (Gy - y) - 1, lim + 1);\n }\n if ((y - Gy) >= 1 && (y % 2 != t % 2)) {\n dfs(dfs, Gy + 1, x, t + (y - Gy) - 1, lim + 1);\n }\n\n /* ----- 2つ手前まで行く ----- */\n if ((Gx - x) >= 2 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx - 2, t + (Gx - x) - 2, lim + 1);\n }\n if ((x - Gx) >= 2 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx + 2, t + (x - Gx) - 2, lim + 1);\n }\n if ((Gy - y) >= 2 && (y % 2 == t % 2)) {\n dfs(dfs, Gy - 2, x, t + (Gy - y) - 2, lim + 1);\n }\n if ((y - Gy) >= 2 && (y % 2 != t % 2)) {\n dfs(dfs, Gy + 2, x, t + (y - Gy) - 2, lim + 1);\n }\n\n /* ----- 3つ手前まで行く ----- */\n if ((Gx - x) >= 3 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx - 3, t + (Gx - x) - 3, lim + 1);\n }\n if ((x - Gx) >= 3 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx + 3, t + (x - Gx) - 3, lim + 1);\n }\n if ((Gy - y) >= 3 && (y % 2 == t % 2)) {\n dfs(dfs, Gy - 3, x, t + (Gy - y) - 3, lim + 1);\n }\n if ((y - Gy) >= 3 && (y % 2 != t % 2)) {\n dfs(dfs, Gy + 3, x, t + (y - Gy) - 3, lim + 1);\n }\n\n /* ----- ジグザグ ----- */\n if ((Gx - x) > 0 && (Gy - y) > 0 && (x % 2 == 0 && t % 2 == 0)) {\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\n }\n if ((Gx - x) < 0 && (Gy - y) > 0 && (x % 2 == 1 && t % 2 == 0)) {\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\n }\n if ((Gx - x) < 0 && (Gy - y) < 0 && (x % 2 == 0 && t % 2 == 1)) {\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\n }\n if ((Gx - x) > 0 && (Gy - y) < 0 && (x % 2 == 1 && t % 2 == 1)) {\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\n }\n };\n dfs(dfs, Sy, Sx, 0, 0);\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3432,"score_of_the_acc":-0.2353,"final_rank":3},{"submission_id":"aoj_3173_4860797","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#ifdef _DEBUG\n #include \"_DEBUG.hpp\"\n#endif\n#define int long long\nconst int INF = 1LL << 61;\nconst int MOD = 1e9 + 7;\n\nsigned main(){\n\n int Sx, Sy, Gx, Gy;\n cin >> Sx >> Sy >> Gx >> Gy;\n \n int ans = INF;\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim)->void{\n if(lim == 10) return;\n if(y == Gy && x == Gx){\n ans = min(ans, t);\n return;\n }\n /* ----- x + 1 ----- */\n if(x % 2 == 0 || t % 2 == 0){\n dfs(dfs, y, x + 1, t + 1, lim + 1);\n }\n /* ----- x - 1 ----- */\n if(x % 2 == 1 || t % 2 == 0){\n dfs(dfs, y, x - 1, t + 1, lim + 1);\n }\n /* ----- y + 1 ----- */\n if(y % 2 == 0 || t % 2 == 1){\n dfs(dfs, y + 1, x, t + 1, lim + 1);\n }\n /* ----- y - 1 ----- */\n if(y % 2 == 1 || t % 2 == 1){\n dfs(dfs, y - 1, x, t + 1, lim + 1);\n }\n /* ----- + 0 ----- */\n dfs(dfs, y, x, t + 1, lim + 1);\n\n if((Gx - x) >= 0 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\n }\n if((x - Gx) >= 0 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\n }\n if((Gy - y) >= 0 && (x % 2 != t % 2)){\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\n }\n if((y - Gy) >= 0 && (x % 2 != t % 2)){\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\n }\n };\n dfs(dfs, Sy, Sx, 0, 0);\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.8723404255319149,"time_ms":40,"memory_kb":3432,"score_of_the_acc":-0.1765,"final_rank":7},{"submission_id":"aoj_3173_4860795","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#ifdef _DEBUG\n #include \"_DEBUG.hpp\"\n#endif\n#define int long long\nconst int INF = 1LL << 61;\nconst int MOD = 1e9 + 7;\n\nsigned main(){\n\n int Sx, Sy, Gx, Gy;\n cin >> Sx >> Sy >> Gx >> Gy;\n \n int ans = INF;\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim)->void{\n if(lim == 8) return;\n if(y == Gy && x == Gx){\n ans = min(ans, t);\n return;\n }\n /* ----- x + 1 ----- */\n if(x % 2 == 0 || t % 2 == 0){\n dfs(dfs, y, x + 1, t + 1, lim + 1);\n }\n /* ----- x - 1 ----- */\n if(x % 2 == 1 || t % 2 == 0){\n dfs(dfs, y, x - 1, t + 1, lim + 1);\n }\n /* ----- y + 1 ----- */\n if(y % 2 == 0 || t % 2 == 1){\n dfs(dfs, y + 1, x, t + 1, lim + 1);\n }\n /* ----- y - 1 ----- */\n if(y % 2 == 1 || t % 2 == 1){\n dfs(dfs, y - 1, x, t + 1, lim + 1);\n }\n /* ----- + 0 ----- */\n dfs(dfs, y, x, t + 1, lim + 1);\n\n /* ----- 一気に行く ----- */\n if((Gx - x) >= 0 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\n }\n if((x - Gx) >= 0 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\n }\n if((Gy - y) >= 0 && (y % 2 == t % 2)){\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\n }\n if((y - Gy) >= 0 && (y % 2 != t % 2)){\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\n }\n\n /* ----- 1つ手前まで行く ----- */\n if((Gx - x) >= 1 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx-1, t + (Gx - x) - 1, lim + 1);\n }\n if((x - Gx) >= 1 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx+1, t + (x - Gx) - 1, lim + 1);\n }\n if((Gy - y) >= 1 && (y % 2 == t % 2)){\n dfs(dfs, Gy-1, x, t + (Gy - y) - 1, lim + 1);\n }\n if((y - Gy) >= 1 && (y % 2 != t % 2)){\n dfs(dfs, Gy+1, x, t + (y - Gy) - 1, lim + 1);\n }\n\n /* ----- 2つ手前まで行く ----- */\n if((Gx - x) >= 2 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx-2, t + (Gx - x) - 2, lim + 1);\n }\n if((x - Gx) >= 2 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx+2, t + (x - Gx) - 2, lim + 1);\n }\n if((Gy - y) >= 2 && (y % 2 == t % 2)){\n dfs(dfs, Gy-2, x, t + (Gy - y) - 2, lim + 1);\n }\n if((y - Gy) >= 2 && (y % 2 != t % 2)){\n dfs(dfs, Gy+2, x, t + (y - Gy) - 2, lim + 1);\n }\n };\n dfs(dfs, Sy, Sx, 0, 0);\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3432,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_3173_4860780","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#ifdef _DEBUG\n#include \"_DEBUG.hpp\"\n#endif\n#define int long long\nconst int INF = 1LL << 61;\nconst int MOD = 1e9 + 7;\n\nsigned main() {\n int Sx, Sy, Gx, Gy;\n cin >> Sx >> Sy >> Gx >> Gy;\n\n int ans = INF;\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim) -> void {\n if (lim == 8) return;\n if (y == Gy && x == Gx) {\n ans = min(ans, t);\n return;\n }\n /* ----- x + 1 ----- */\n if (x % 2 == 0 || t % 2 == 0) {\n dfs(dfs, y, x + 1, t + 1, lim + 1);\n }\n /* ----- x - 1 ----- */\n if (x % 2 == 1 || t % 2 == 0) {\n dfs(dfs, y, x - 1, t + 1, lim + 1);\n }\n /* ----- y + 1 ----- */\n if (y % 2 == 0 || t % 2 == 1) {\n dfs(dfs, y + 1, x, t + 1, lim + 1);\n }\n /* ----- y - 1 ----- */\n if (y % 2 == 1 || t % 2 == 1) {\n dfs(dfs, y - 1, x, t + 1, lim + 1);\n }\n /* ----- + 0 ----- */\n dfs(dfs, y, x, t + 1, lim + 1);\n\n /* ----- 一気に行く ----- */\n if ((Gx - x) >= 0 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\n }\n if ((x - Gx) >= 0 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\n }\n if ((Gy - y) >= 0 && (y % 2 == t % 2)) {\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\n }\n if ((y - Gy) >= 0 && (y % 2 != t % 2)) {\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\n }\n\n /* ----- 1つ手前まで行く ----- */\n if ((Gx - x) >= 1 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx - 1, t + (Gx - x) - 1, lim + 1);\n }\n if ((x - Gx) >= 1 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx + 1, t + (x - Gx) - 1, lim + 1);\n }\n if ((Gy - y) >= 1 && (y % 2 == t % 2)) {\n dfs(dfs, Gy - 1, x, t + (Gy - y) - 1, lim + 1);\n }\n if ((y - Gy) >= 1 && (y % 2 != t % 2)) {\n dfs(dfs, Gy + 1, x, t + (y - Gy) - 1, lim + 1);\n }\n\n /* ----- 2つ手前まで行く ----- */\n if ((Gx - x) >= 2 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx - 2, t + (Gx - x) - 2, lim + 1);\n }\n if ((x - Gx) >= 2 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx + 2, t + (x - Gx) - 2, lim + 1);\n }\n if ((Gy - y) >= 2 && (y % 2 == t % 2)) {\n dfs(dfs, Gy - 2, x, t + (Gy - y) - 2, lim + 1);\n }\n if ((y - Gy) >= 2 && (y % 2 != t % 2)) {\n dfs(dfs, Gy + 2, x, t + (y - Gy) - 2, lim + 1);\n }\n\n /* ----- 3つ手前まで行く ----- */\n if ((Gx - x) >= 3 && (x % 2 != t % 2)) {\n dfs(dfs, y, Gx - 3, t + (Gx - x) - 3, lim + 1);\n }\n if ((x - Gx) >= 3 && (x % 2 == t % 2)) {\n dfs(dfs, y, Gx + 3, t + (x - Gx) - 3, lim + 1);\n }\n if ((Gy - y) >= 3 && (y % 2 == t % 2)) {\n dfs(dfs, Gy - 3, x, t + (Gy - y) - 3, lim + 1);\n }\n if ((y - Gy) >= 3 && (y % 2 != t % 2)) {\n dfs(dfs, Gy + 3, x, t + (y - Gy) - 3, lim + 1);\n }\n\n /* ----- ジグザグ ----- */\n if ((Gx - x) > 0 && (Gy - y) > 0 && (x % 2 == 0 && t % 2 == 0)) {\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\n }\n if ((Gx - x) < 0 && (Gy - y) > 0 && (x % 2 == 1 && t % 2 == 0)) {\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\n }\n if ((Gx - x) < 0 && (Gy - y) < 0 && (x % 2 == 0 && t % 2 == 1)) {\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\n }\n if ((Gx - x) > 0 && (Gy - y) < 0 && (x % 2 == 1 && t % 2 == 1)) {\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\n }\n };\n dfs(dfs, Sy, Sx, 0, 0);\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3436,"score_of_the_acc":-0.2354,"final_rank":4},{"submission_id":"aoj_3173_4845900","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#ifdef _DEBUG\n #include \"_DEBUG.hpp\"\n#endif\n#define int long long\nconst int INF = 1LL << 60;\nconst int MOD = 1e9 + 7;\n\nsigned main(){\n\n int Sx, Sy, Gx, Gy;\n cin >> Sx >> Sy >> Gx >> Gy;\n \n int ans = INF;\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim)->void{\n if(lim == 8) return;\n if(y == Gy && x == Gx){\n ans = min(ans, t);\n return;\n }\n /* ----- x + 1 ----- */\n if(x % 2 == 0 || t % 2 == 0){\n dfs(dfs, y, x + 1, t + 1, lim + 1);\n }\n /* ----- x - 1 ----- */\n if(x % 2 == 1 || t % 2 == 0){\n dfs(dfs, y, x - 1, t + 1, lim + 1);\n }\n /* ----- y + 1 ----- */\n if(y % 2 == 0 || t % 2 == 1){\n dfs(dfs, y + 1, x, t + 1, lim + 1);\n }\n /* ----- y - 1 ----- */\n if(y % 2 == 1 || t % 2 == 1){\n dfs(dfs, y - 1, x, t + 1, lim + 1);\n }\n /* ----- + 0 ----- */\n dfs(dfs, y, x, t + 1, lim + 1);\n\n /* ----- 一気に行く ----- */\n if((Gx - x) >= 0 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\n }\n if((x - Gx) >= 0 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\n }\n if((Gy - y) >= 0 && (y % 2 == t % 2)){\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\n }\n if((y - Gy) >= 0 && (y % 2 != t % 2)){\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\n }\n\n /* ----- 1つ手前まで行く ----- */\n if((Gx - x) >= 1 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx-1, t + (Gx - x) - 1, lim + 1);\n }\n if((x - Gx) >= 1 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx+1, t + (x - Gx) - 1, lim + 1);\n }\n if((Gy - y) >= 1 && (y % 2 == t % 2)){\n dfs(dfs, Gy-1, x, t + (Gy - y) - 1, lim + 1);\n }\n if((y - Gy) >= 1 && (y % 2 != t % 2)){\n dfs(dfs, Gy+1, x, t + (y - Gy) - 1, lim + 1);\n }\n\n /* ----- 2つ手前まで行く ----- */\n if((Gx - x) >= 2 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx-2, t + (Gx - x) - 2, lim + 1);\n }\n if((x - Gx) >= 2 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx+2, t + (x - Gx) - 2, lim + 1);\n }\n if((Gy - y) >= 2 && (y % 2 == t % 2)){\n dfs(dfs, Gy-2, x, t + (Gy - y) - 2, lim + 1);\n }\n if((y - Gy) >= 2 && (y % 2 != t % 2)){\n dfs(dfs, Gy+2, x, t + (y - Gy) - 2, lim + 1);\n }\n\n /* ----- 3つ手前まで行く ----- */\n if((Gx - x) >= 3 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx-3, t + (Gx - x) - 3, lim + 1);\n }\n if((x - Gx) >= 3 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx+3, t + (x - Gx) - 3, lim + 1);\n }\n if((Gy - y) >= 3 && (y % 2 == t % 2)){\n dfs(dfs, Gy-3, x, t + (Gy - y) - 3, lim + 1);\n }\n if((y - Gy) >= 3 && (y % 2 != t % 2)){\n dfs(dfs, Gy+3, x, t + (y - Gy) - 3, lim + 1);\n }\n\n /* ----- ジグザグ ----- */\n if((Gx - x) > 0 && (Gy - y) > 0 && (x % 2 == 0 && t % 2 == 0)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\n }\n if((Gx - x) < 0 && (Gy - y) > 0 && (x % 2 == 1 && t % 2 == 0)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\n }\n if((Gx - x) < 0 && (Gy - y) < 0 && (x % 2 == 0 && t % 2 == 1)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\n }\n if((Gx - x) > 0 && (Gy - y) < 0 && (x % 2 == 1 && t % 2 == 1)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\n }\n };\n dfs(dfs, Sy, Sx, 0, 0);\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.19148936170212766,"time_ms":50,"memory_kb":3432,"score_of_the_acc":-0.2353,"final_rank":15},{"submission_id":"aoj_3173_4845891","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#ifdef _DEBUG\n #include \"_DEBUG.hpp\"\n#endif\n#define int long long\nconst int INF = 1LL << 60;\nconst int MOD = 1e9 + 7;\n\nsigned main(){\n\n int Sx, Sy, Gx, Gy;\n cin >> Sx >> Sy >> Gx >> Gy;\n \n int ans = INF;\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim)->void{\n if(lim == 8) return;\n if(y == Gy && x == Gx){\n ans = min(ans, t);\n return;\n }\n /* ----- x + 1 ----- */\n if(x % 2 == 0 || t % 2 == 0){\n dfs(dfs, y, x + 1, t + 1, lim + 1);\n }\n /* ----- x - 1 ----- */\n if(x % 2 == 1 || t % 2 == 0){\n dfs(dfs, y, x - 1, t + 1, lim + 1);\n }\n /* ----- y + 1 ----- */\n if(y % 2 == 0 || t % 2 == 1){\n dfs(dfs, y + 1, x, t + 1, lim + 1);\n }\n /* ----- y - 1 ----- */\n if(y % 2 == 1 || t % 2 == 1){\n dfs(dfs, y - 1, x, t + 1, lim + 1);\n }\n /* ----- + 0 ----- */\n dfs(dfs, y, x, t + 1, lim + 1);\n\n /* ----- 一気に行く ----- */\n if((Gx - x) >= 0 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\n }\n if((x - Gx) >= 0 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\n }\n if((Gy - y) >= 0 && (y % 2 == t % 2)){\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\n }\n if((y - Gy) >= 0 && (y % 2 != t % 2)){\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\n }\n\n /* ----- 1つ手前まで行く ----- */\n if((Gx - x) >= 1 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx-1, t + (Gx - x) - 1, lim + 1);\n }\n if((x - Gx) >= 1 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx+1, t + (x - Gx) - 1, lim + 1);\n }\n if((Gy - y) >= 1 && (y % 2 == t % 2)){\n dfs(dfs, Gy-1, x, t + (Gy - y) - 1, lim + 1);\n }\n if((y - Gy) >= 1 && (y % 2 != t % 2)){\n dfs(dfs, Gy+1, x, t + (y - Gy) - 1, lim + 1);\n }\n\n /* ----- 2つ手前まで行く ----- */\n if((Gx - x) >= 2 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx-2, t + (Gx - x) - 2, lim + 1);\n }\n if((x - Gx) >= 2 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx+2, t + (x - Gx) - 2, lim + 1);\n }\n if((Gy - y) >= 2 && (y % 2 == t % 2)){\n dfs(dfs, Gy-2, x, t + (Gy - y) - 2, lim + 1);\n }\n if((y - Gy) >= 2 && (y % 2 != t % 2)){\n dfs(dfs, Gy+2, x, t + (y - Gy) - 2, lim + 1);\n }\n\n /* ----- 3つ手前まで行く ----- */\n if((Gx - x) >= 3 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx-3, t + (Gx - x) - 3, lim + 1);\n }\n if((x - Gx) >= 3 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx+3, t + (x - Gx) - 3, lim + 1);\n }\n if((Gy - y) >= 3 && (y % 2 == t % 2)){\n dfs(dfs, Gy-3, x, t + (Gy - y) - 3, lim + 1);\n }\n if((y - Gy) >= 3 && (y % 2 != t % 2)){\n dfs(dfs, Gy+3, x, t + (y - Gy) - 3, lim + 1);\n }\n\n /* ----- ジグザグ ----- */\n if((Gx - x) > 0 && (Gy - y) > 0 && !(x % 2 != t % 2)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\n }\n if((Gx - x) < 0 && (Gy - y) > 0 && !(x % 2 == t % 2)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\n }\n if((Gx - x) < 0 && (Gy - y) < 0 && !(y % 2 == t % 2)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\n }\n if((Gx - x) > 0 && (Gy - y) < 0 && !(y % 2 != t % 2)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\n }\n };\n dfs(dfs, Sy, Sx, 0, 0);\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.19148936170212766,"time_ms":60,"memory_kb":3464,"score_of_the_acc":-0.2946,"final_rank":17},{"submission_id":"aoj_3173_4845845","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#ifdef _DEBUG\n #include \"_DEBUG.hpp\"\n#endif\n#define int long long\nconst int INF = 1LL << 60;\nconst int MOD = 1e9 + 7;\n\nsigned main(){\n\n int Sx, Sy, Gx, Gy;\n cin >> Sx >> Sy >> Gx >> Gy;\n \n int ans = INF;\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim)->void{\n if(lim == 8) return;\n if(y == Gy && x == Gx){\n ans = min(ans, t);\n return;\n }\n /* ----- x + 1 ----- */\n if(x % 2 == 0 || t % 2 == 0){\n dfs(dfs, y, x + 1, t + 1, lim + 1);\n }\n /* ----- x - 1 ----- */\n if(x % 2 == 1 || t % 2 == 0){\n dfs(dfs, y, x - 1, t + 1, lim + 1);\n }\n /* ----- y + 1 ----- */\n if(y % 2 == 0 || t % 2 == 1){\n dfs(dfs, y + 1, x, t + 1, lim + 1);\n }\n /* ----- y - 1 ----- */\n if(y % 2 == 1 || t % 2 == 1){\n dfs(dfs, y - 1, x, t + 1, lim + 1);\n }\n /* ----- + 0 ----- */\n dfs(dfs, y, x, t + 1, lim + 1);\n\n /* ----- 一気に行く ----- */\n if((Gx - x) >= 0 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\n }\n if((x - Gx) >= 0 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\n }\n if((Gy - y) >= 0 && (y % 2 == t % 2)){\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\n }\n if((y - Gy) >= 0 && (y % 2 != t % 2)){\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\n }\n\n /* ----- 1つ手前まで行く ----- */\n if((Gx - x) >= 1 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx-1, t + (Gx - x) - 1, lim + 1);\n }\n if((x - Gx) >= 1 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx+1, t + (x - Gx) - 1, lim + 1);\n }\n if((Gy - y) >= 1 && (y % 2 == t % 2)){\n dfs(dfs, Gy-1, x, t + (Gy - y) - 1, lim + 1);\n }\n if((y - Gy) >= 1 && (y % 2 != t % 2)){\n dfs(dfs, Gy+1, x, t + (y - Gy) - 1, lim + 1);\n }\n\n /* ----- 2つ手前まで行く ----- */\n if((Gx - x) >= 2 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx-2, t + (Gx - x) - 2, lim + 1);\n }\n if((x - Gx) >= 2 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx+2, t + (x - Gx) - 2, lim + 1);\n }\n if((Gy - y) >= 2 && (y % 2 == t % 2)){\n dfs(dfs, Gy-2, x, t + (Gy - y) - 2, lim + 1);\n }\n if((y - Gy) >= 2 && (y % 2 != t % 2)){\n dfs(dfs, Gy+2, x, t + (y - Gy) - 2, lim + 1);\n }\n\n /* ----- 3つ手前まで行く ----- */\n if((Gx - x) >= 3 && (x % 2 != t % 2)){\n dfs(dfs, y, Gx-3, t + (Gx - x) - 3, lim + 1);\n }\n if((x - Gx) >= 3 && (x % 2 == t % 2)){\n dfs(dfs, y, Gx+3, t + (x - Gx) - 3, lim + 1);\n }\n if((Gy - y) >= 3 && (y % 2 == t % 2)){\n dfs(dfs, Gy-3, x, t + (Gy - y) - 3, lim + 1);\n }\n if((y - Gy) >= 3 && (y % 2 != t % 2)){\n dfs(dfs, Gy+3, x, t + (y - Gy) - 3, lim + 1);\n }\n\n /* ----- ジグザグ ----- */\n if((Gx - x) > 0 && (Gy - y) > 0 && !(x % 2 != t % 2)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\n }\n if((Gx - x) < 0 && (Gy - y) > 0 && !(x % 2 == t % 2)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\n }\n if((Gx - x) < 0 && (Gy - y) < 0 && !(y % 2 == t % 2)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\n }\n if((Gx - x) > 0 && (Gy - y) < 0 && !(y % 2 != t % 2)){\n int dy = abs(Gy - y), dx = abs(Gx - x);\n int d = min(dy, dx);\n dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\n }\n };\n dfs(dfs, Sy, Sx, 0, 0);\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.19148936170212766,"time_ms":60,"memory_kb":3432,"score_of_the_acc":-0.2941,"final_rank":16},{"submission_id":"aoj_3173_4845754","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\n\n#define int long long\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\n\nstruct state {\n int x, y, t;\n state(int x, int y, int t): x(x), y(y), t(t){} \n};\n\nint Sx[5][2] = {{30, 31},\n\t\t{30, 31},\n\t\t{14, 15},\n\t\t{21, 20},\n\t\t{20, 21}};\nint Sy[5][2] = {{40, 41},\n\t\t{40, 41},\n\t\t{24, 25},\n\t\t{31, 30},\n\t\t{30, 31}};\nint Gx[5][2] = {{30, 31},\n\t\t{14, 15},\n\t\t{30, 31},\n\t\t{20, 21},\n\t\t{21, 20}};\nint Gy[5][2] = {{40, 41},\n\t\t{24, 25},\n\t\t{40, 41},\n\t\t{30, 31},\n\t\t{31, 30}};\n\nint pre_calc[5][5][2][2][2][2];\n\nint bfs(int sx, int sy, int gx, int gy) {\n bool used[50][50][100];\n fill_n(**used, 50*50*100, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n \n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return (t - (abs(sx-gx)+abs(sy-gy))); \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nint bfs2(int sx, int sy, int gx, int gy) {\n bool used[50][50][100];\n fill_n(**used, 50*50*100, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n \n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return t; \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nsigned main() {\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n\n for ( int k = 0; k < 5; k++ ) {\n for ( int l = 0; l < 5; l++ ) {\n for ( int i = 0; i < (1<<4); i++ ) {\n\tint sx = Sx[k][(i>>0)&1];\n\tint sy = Sy[l][(i>>1)&1];\n\tint gx = Gx[k][(i>>2)&1];\n\tint gy = Gy[l][(i>>3)&1];\t\n\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\n\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\n\t cout << \"aaa \" << k << \" \" << l << \" \" << bfs(sx, sy, gx, gy) << \" \" << pre_calc[2][0][0][0][0][0] << endl;\n\t \n\t }*/\n\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\n\t cout << k << \" \" << l << \" \" << sx << \" \" << sy << \" \" << gx << \" \" << gy << endl;\t \n\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\t \t \n\t }*/\t\n }\n }\n }\n\n int sx, sy, gx, gy;\n cin >> sx >> sy >> gx >> gy;\n\n /*cout << Sx[2][0] << \" \" << Sy[0][0] << \" \" << Gx[2][0] << \" \" << Gy[0][0] << endl;\n cout << pre_calc[2][0][0][0][0][0] << endl; */\n\n int abs_x = min(sx, gx);\n int abs_y = min(sy, gy);\n int hiku_x = abs_x / 2 * 2;\n int hiku_y = abs_y / 2 * 2;\n sx -= hiku_x;\n sy -= hiku_y;\n gx -= hiku_x;\n gy -= hiku_y;\n // cerr << sx << \" \" << sy << endl;\n if ( sx < 50 && sy < 50 && gx < 50 && gy < 50 ) {\n cout << bfs2(sx, sy, gx, gy) << endl; \n } else { \n\n int ans = abs(sx-gx)+abs(sy-gy); \n int k = 0, l = 0;\n if (sx == gx + 1) {\n k = 3;\n } else if (gx == sx + 1) {\n k = 4;\n } else {\n if ( sx > gx ) k = 1;\n if ( sx < gx ) k = 2;\n }\n\n \n if (sy == gy + 1) {\n l = 3;\n } else if (gy == sy + 1) {\n l = 4;\n } else {\n if ( sy > gy ) l = 1;\n if ( sy < gy ) l = 2;\n }\n\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\n \n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3888,"score_of_the_acc":-0.4185,"final_rank":5},{"submission_id":"aoj_3173_4845747","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\n\n#define int long long\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\n\nstruct state {\n int x, y, t;\n state(int x, int y, int t): x(x), y(y), t(t){} \n};\n\nint Sx[5][2] = {{30, 31},\n\t\t{30, 31},\n\t\t{14, 15},\n\t\t{21, 20},\n\t\t{20, 21}};\nint Sy[5][2] = {{40, 41},\n\t\t{40, 41},\n\t\t{24, 25},\n\t\t{31, 30},\n\t\t{30, 31}};\nint Gx[5][2] = {{30, 31},\n\t\t{14, 15},\n\t\t{30, 31},\n\t\t{20, 21},\n\t\t{21, 20}};\nint Gy[5][2] = {{40, 41},\n\t\t{24, 25},\n\t\t{40, 41},\n\t\t{30, 31},\n\t\t{31, 30}};\n\nint pre_calc[5][5][2][2][2][2];\n\nint bfs(int sx, int sy, int gx, int gy) {\n bool used[50][50][100];\n fill_n(**used, 50*50*100, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n \n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return (t - (abs(sx-gx)+abs(sy-gy))); \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nint bfs2(int sx, int sy, int gx, int gy) {\n bool used[50][50][100];\n fill_n(**used, 50*50*100, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n \n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return t; \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nsigned main() {\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n\n for ( int k = 0; k < 5; k++ ) {\n for ( int l = 0; l < 5; l++ ) {\n for ( int i = 0; i < (1<<4); i++ ) {\n\tint sx = Sx[k][(i>>0)&1];\n\tint sy = Sy[l][(i>>1)&1];\n\tint gx = Gx[k][(i>>2)&1];\n\tint gy = Gy[l][(i>>3)&1];\t\n\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\n\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\n\t cout << \"aaa \" << k << \" \" << l << \" \" << bfs(sx, sy, gx, gy) << \" \" << pre_calc[2][0][0][0][0][0] << endl;\n\t \n\t }*/\n\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\n\t cout << k << \" \" << l << \" \" << sx << \" \" << sy << \" \" << gx << \" \" << gy << endl;\t \n\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\t \t \n\t }*/\t\n }\n }\n }\n\n int sx, sy, gx, gy;\n cin >> sx >> sy >> gx >> gy;\n\n /*cout << Sx[2][0] << \" \" << Sy[0][0] << \" \" << Gx[2][0] << \" \" << Gy[0][0] << endl;\n cout << pre_calc[2][0][0][0][0][0] << endl; */\n\n int abs_x = min(sx, gx); int abs_y = min(sy, gy);\n int hiku = min(abs_x, abs_y) / 2 * 2;\n sx -= hiku;\n sy -= hiku;\n gx -= hiku;\n gy -= hiku;\n // cerr << sx << \" \" << sy << endl;\n if ( sx < 50 && sy < 50 && gx < 50 && gy < 50 ) {\n cout << bfs2(sx, sy, gx, gy) << endl; \n } else { \n\n int ans = abs(sx-gx)+abs(sy-gy); \n int k = 0, l = 0;\n if (sx == gx + 1) {\n k = 3;\n } else if (gx == sx + 1) {\n k = 4;\n } else {\n if ( sx > gx ) k = 1;\n if ( sx < gx ) k = 2;\n }\n\n \n if (sy == gy + 1) {\n l = 3;\n } else if (gy == sy + 1) {\n l = 4;\n } else {\n if ( sy > gy ) l = 1;\n if ( sy < gy ) l = 2;\n }\n\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\n \n cout << ans << endl;\n }\n return 0;\n}","accuracy":0.6808510638297872,"time_ms":100,"memory_kb":3856,"score_of_the_acc":-0.5357,"final_rank":10},{"submission_id":"aoj_3173_4845708","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\n\n#define int long long\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\n\nstruct state {\n int x, y, t;\n state(int x, int y, int t): x(x), y(y), t(t){} \n};\n\nint Sx[5][2] = {{30, 31},\n\t\t{30, 31},\n\t\t{14, 15},\n\t\t{21, 20},\n\t\t{20, 21}};\nint Sy[5][2] = {{40, 41},\n\t\t{40, 41},\n\t\t{24, 25},\n\t\t{31, 30},\n\t\t{30, 31}};\nint Gx[5][2] = {{30, 31},\n\t\t{14, 15},\n\t\t{30, 31},\n\t\t{20, 21},\n\t\t{21, 20}};\nint Gy[5][2] = {{40, 41},\n\t\t{24, 25},\n\t\t{40, 41},\n\t\t{30, 31},\n\t\t{31, 30}};\n\nint pre_calc[5][5][2][2][2][2];\n\nint bfs(int sx, int sy, int gx, int gy) {\n bool used[50][50][100];\n fill_n(**used, 50*50*100, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n \n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return (t - (abs(sx-gx)+abs(sy-gy))); \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nint bfs2(int sx, int sy, int gx, int gy) {\n bool used[50][50][100];\n fill_n(**used, 50*50*100, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n \n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return t; \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nsigned main() {\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n\n for ( int k = 0; k < 5; k++ ) {\n for ( int l = 0; l < 5; l++ ) {\n for ( int i = 0; i < (1<<4); i++ ) {\n\tint sx = Sx[k][(i>>0)&1];\n\tint sy = Sy[l][(i>>1)&1];\n\tint gx = Gx[k][(i>>2)&1];\n\tint gy = Gy[l][(i>>3)&1];\t\n\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\n\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\n\t cout << \"aaa \" << k << \" \" << l << \" \" << bfs(sx, sy, gx, gy) << \" \" << pre_calc[2][0][0][0][0][0] << endl;\n\t \n\t }*/\n\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\n\t cout << k << \" \" << l << \" \" << sx << \" \" << sy << \" \" << gx << \" \" << gy << endl;\t \n\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\t \t \n\t }*/\t\n }\n }\n }\n\n int sx, sy, gx, gy;\n cin >> sx >> sy >> gx >> gy;\n\n /*cout << Sx[2][0] << \" \" << Sy[0][0] << \" \" << Gx[2][0] << \" \" << Gy[0][0] << endl;\n cout << pre_calc[2][0][0][0][0][0] << endl; */\n\n int abs_x = abs(sx-gx), abs_y = abs(sy-gy);\n int hiku = min(abs_x, abs_y) / 2 * 2;\n sx -= hiku;\n sy -= hiku;\n gx -= hiku;\n gy -= hiku;\n if ( sx < 50 && sy < 50 && gx < 50 && gy < 50 ) {\n cout << bfs2(sx, sy, gx, gy) << endl; \n } else { \n\n int ans = abs(sx-gx)+abs(sy-gy); \n int k = 0, l = 0;\n if (sx == gx + 1) {\n k = 3;\n } else if (gx == sx + 1) {\n k = 4;\n } else {\n if ( sx > gx ) k = 1;\n if ( sx < gx ) k = 2;\n }\n\n \n if (sy == gy + 1) {\n l = 3;\n } else if (gy == sy + 1) {\n l = 4;\n } else {\n if ( sy > gy ) l = 1;\n if ( sy < gy ) l = 2;\n }\n\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\n \n cout << ans << endl;\n }\n return 0;\n}","accuracy":0.6808510638297872,"time_ms":80,"memory_kb":3856,"score_of_the_acc":-0.4181,"final_rank":8},{"submission_id":"aoj_3173_4845695","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\n\n#define int long long\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\n\nstruct state {\n int x, y, t;\n state(int x, int y, int t): x(x), y(y), t(t){} \n};\n\nint Sx[5][2] = {{30, 31},\n\t\t{30, 31},\n\t\t{14, 15},\n\t\t{21, 20},\n\t\t{20, 21}};\nint Sy[5][2] = {{40, 41},\n\t\t{40, 41},\n\t\t{24, 25},\n\t\t{31, 30},\n\t\t{30, 31}};\nint Gx[5][2] = {{30, 31},\n\t\t{14, 15},\n\t\t{30, 31},\n\t\t{20, 21},\n\t\t{21, 20}};\nint Gy[5][2] = {{40, 41},\n\t\t{24, 25},\n\t\t{40, 41},\n\t\t{31, 30},\n\t\t{30, 31}};\n\nint pre_calc[5][5][2][2][2][2];\n\nint bfs(int sx, int sy, int gx, int gy) {\n bool used[50][50][100];\n fill_n(**used, 50*50*100, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n \n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return (t - (abs(sx-gx)+abs(sy-gy))); \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nint bfs2(int sx, int sy, int gx, int gy) {\n bool used[50][50][100];\n fill_n(**used, 50*50*100, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n \n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return t; \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nsigned main() {\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n\n for ( int k = 0; k < 5; k++ ) {\n for ( int l = 0; l < 5; l++ ) {\n for ( int i = 0; i < (1<<4); i++ ) {\n\tint sx = Sx[k][(i>>0)&1];\n\tint sy = Sy[l][(i>>1)&1];\n\tint gx = Gx[k][(i>>2)&1];\n\tint gy = Gy[l][(i>>3)&1];\t\n\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\n\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\n\t cout << \"aaa \" << k << \" \" << l << \" \" << bfs(sx, sy, gx, gy) << \" \" << pre_calc[2][0][0][0][0][0] << endl;\n\t \n\t }*/\n\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\n\t cout << k << \" \" << l << \" \" << sx << \" \" << sy << \" \" << gx << \" \" << gy << endl;\t \n\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\t \t \n\t }*/\t\n }\n }\n }\n\n int sx, sy, gx, gy;\n cin >> sx >> sy >> gx >> gy;\n\n /*cout << Sx[2][0] << \" \" << Sy[0][0] << \" \" << Gx[2][0] << \" \" << Gy[0][0] << endl;\n cout << pre_calc[2][0][0][0][0][0] << endl; */\n\n int abs_x = abs(sx-gx), abs_y = abs(sy-gy);\n int hiku = min(abs_x, abs_y) / 2 * 2;\n sx -= hiku;\n sy -= hiku;\n gx -= hiku;\n gy -= hiku;\n if ( sx < 50 && sy < 50 && gx < 50 && gy < 50 ) {\n cout << bfs2(sx, sy, gx, gy) << endl; \n } else { \n\n int ans = abs(sx-gx)+abs(sy-gy); \n int k = 0, l = 0;\n if (sx == gx + 1) {\n k = 3;\n } else if (gx == sx + 1) {\n k = 4;\n } else {\n if ( sx > gx ) k = 1;\n if ( sx < gx ) k = 2;\n }\n\n \n if (sy == gy + 1) {\n l = 3;\n } else if (gy == sy + 1) {\n l = 4;\n } else {\n if ( sy > gy ) l = 1;\n if ( sy < gy ) l = 2;\n }\n\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\n \n cout << ans << endl;\n }\n return 0;\n}","accuracy":0.6808510638297872,"time_ms":90,"memory_kb":3856,"score_of_the_acc":-0.4769,"final_rank":9},{"submission_id":"aoj_3173_4845587","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\n\nstruct state {\n int x, y, t;\n state(int x, int y, int t): x(x), y(y), t(t){} \n};\n\nint Sx[3][2] = {{30, 31},\n\t\t{30, 31},\n\t\t{14, 15}};\nint Sy[3][2] = {{40, 41},\n\t\t{40, 41},\n\t\t{24, 25}};\nint Gx[3][2] = {{30, 31},\n\t\t{14, 15},\n\t\t{30, 31}};\nint Gy[3][2] = {{40, 41},\n\t\t{24, 25},\n\t\t{40, 41}};\n\nint pre_calc[3][3][2][2][2][2];\n\nint bfs(int sx, int sy, int gx, int gy) {\n bool used[50][50][100];\n fill_n(**used, 50*50*100, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n \n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return (t - (abs(sx-gx)+abs(sy-gy))); \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nint bfs2(int sx, int sy, int gx, int gy) {\n bool used[50][50][100];\n fill_n(**used, 50*50*100, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n \n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return t; \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nsigned main() {\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n for ( int k = 0; k < 3; k++ ) {\n for ( int l = 0; l < 3; l++ ) {\n for ( int i = 0; i < (1<<4); i++ ) {\n\tint sx = Sx[k][(i>>0)&1];\n\tint sy = Sy[l][(i>>1)&1];\n\tint gx = Gx[k][(i>>2)&1];\n\tint gy = Gy[l][(i>>3)&1];\t\n\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\n\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\n\t cout << \"aaa \" << k << \" \" << l << \" \" << bfs(sx, sy, gx, gy) << \" \" << pre_calc[2][0][0][0][0][0] << endl;\n\t \n\t }*/\n\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\n\t cout << k << \" \" << l << \" \" << sx << \" \" << sy << \" \" << gx << \" \" << gy << endl;\t \n\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\t \t \n\t }*/\t\n }\n }\n }\n\n int sx, sy, gx, gy;\n cin >> sx >> sy >> gx >> gy;\n\n /*cout << Sx[2][0] << \" \" << Sy[0][0] << \" \" << Gx[2][0] << \" \" << Gy[0][0] << endl;\n cout << pre_calc[2][0][0][0][0][0] << endl; */\n\n int abs_x = abs(sx-gx), abs_y = abs(sy-gy);\n int hiku = min(abs_x, abs_y) / 2 * 2;\n sx -= hiku;\n sy -= hiku;\n gx -= hiku;\n gy -= hiku;\n if ( sx < 50 && sy < 50 && gx < 50 && gy < 50 ) {\n cout << bfs2(sx, sy, gx, gy) << endl; \n } else { \n\n int ans = abs(sx-gx)+abs(sy-gy); \n int k = 0, l = 0;\n if ( sx > gx ) k = 1;\n if ( sx < gx ) k = 2;\n if ( sy > gy ) l = 1;\n if ( sy < gy ) l = 2;\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\n \n cout << ans << endl;\n }\n return 0;\n}","accuracy":0.6170212765957447,"time_ms":50,"memory_kb":3892,"score_of_the_acc":-0.2421,"final_rank":12},{"submission_id":"aoj_3173_4845454","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\n\nstruct state {\n int x, y, t;\n state(int x, int y, int t): x(x), y(y), t(t){} \n};\n\nint Sx[3][2] = {{30, 31},\n\t\t{30, 31},\n\t\t{14, 15}};\nint Sy[3][2] = {{40, 41},\n\t\t{40, 41},\n\t\t{24, 25}};\nint Gx[3][2] = {{30, 31},\n\t\t{14, 15},\n\t\t{30, 31}};\nint Gy[3][2] = {{40, 41},\n\t\t{24, 25},\n\t\t{40, 41}};\n\nint pre_calc[3][3][2][2][2][2];\n\nint bfs(int sx, int sy, int gx, int gy) {\n bool used[50][50][100];\n fill_n(**used, 50*50*100, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n \n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return (t - (abs(sx-gx)+abs(sy-gy))); \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nsigned main() {\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n for ( int k = 0; k < 3; k++ ) {\n for ( int l = 0; l < 3; l++ ) {\n for ( int i = 0; i < (1<<4); i++ ) {\n\tint sx = Sx[k][(i>>0)&1];\n\tint sy = Sy[l][(i>>1)&1];\n\tint gx = Gx[k][(i>>2)&1];\n\tint gy = Gy[l][(i>>3)&1];\t\n\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\n\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\n\t cout << \"aaa \" << k << \" \" << l << \" \" << bfs(sx, sy, gx, gy) << \" \" << pre_calc[2][0][0][0][0][0] << endl;\n\t \n\t }*/\n\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\n\t cout << k << \" \" << l << \" \" << sx << \" \" << sy << \" \" << gx << \" \" << gy << endl;\t \n\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\t \t \n\t }*/\t\n }\n }\n }\n\n int sx, sy, gx, gy;\n cin >> sx >> sy >> gx >> gy;\n\n /*cout << Sx[2][0] << \" \" << Sy[0][0] << \" \" << Gx[2][0] << \" \" << Gy[0][0] << endl;\n cout << pre_calc[2][0][0][0][0][0] << endl; */ \n\n int ans = abs(sx-gx)+abs(sy-gy); \n int k = 0, l = 0;\n if ( sx > gx ) k = 1;\n if ( sx < gx ) k = 2;\n if ( sy > gy ) l = 1;\n if ( sy < gy ) l = 2;\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.6170212765957447,"time_ms":60,"memory_kb":3876,"score_of_the_acc":-0.3007,"final_rank":13},{"submission_id":"aoj_3173_4845451","code_snippet":"#pragma target(\"avx\")\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef unordered_map<ll, ll> U_MAP;\ntypedef priority_queue<ll> pq;\ntypedef priority_queue<ll, vector<ll>, greater<ll>> rpq;\nconstexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;\nconstexpr ll LINF = 1e18;\n\n#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)\n#define rrep(i, a, b) for (ll i = (a); i < (b); i++)\n#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)\n#define all(v) (v).begin(), (v).end()\n#define Size(n) (n).size()\n#define Cout(x) cout << (x) << endl\n#define doublecout(a) cout << fixed << setprecision(15) << a << endl;\n#define fi first\n#define se second\n#define m_p make_pair\n#define p_b push_back\nstring to_string(string s) { return '\"' + s + '\"'; }\nstring to_string(const char* s) { return to_string((string)s); }\nstring to_string(bool b) { return (b ? \"true\" : \"false\"); }\ntemplate <typename A, typename B>\nstring to_string(pair<A, B> p) {\n return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";\n}\ntemplate <typename A>\nstring to_string(A v) {\n bool first = true;\n string res = \"{\";\n for (const auto& x : v) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(x);\n }\n res += \"}\";\n return res;\n}\nvoid debug_out() { cerr << endl; }\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cerr << \" \" << to_string(H);\n debug_out(T...);\n}\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n\n//------ Believe yourself as a genius!!!!!! ------\n\nint dy[] = {1, 0, -1, 0};\nint dx[] = {0, 1, 0, -1};\n// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};\nstring alph(\"abcdefghijklmnopqrstuvwxyz\"), s;\nll n, cnt, ans, a, b, c, d, tmp, m, h, w, x, y, sum, k, q, sx, sy, gx, gy;\nll dat[210][210][210];\n\nint main(void) {\n cin.tie(0);\n cout.tie(0);\n ios::sync_with_stdio(false);\n\n cin >> sx >> sy >> gx >> gy;\n if (abs(gy - sy) + abs(gx - sx) <= 50) {\n tmp = abs(sx - gx);\n if (min(sx, gx) % 2 == 1) {\n if (sx < gx) {\n sx = 1;\n gx = sx + tmp;\n } else {\n gx = 1;\n sx = gx + tmp;\n }\n } else {\n if (sx < gx) {\n sx = 0;\n gx = sx + tmp;\n } else {\n gx = 0;\n sx = gx + tmp;\n }\n }\n tmp = abs(sy - gy);\n if (min(sy, gy) % 2 == 1) {\n if (sy < gy) {\n sy = 1;\n gy = sy + tmp;\n } else {\n gy = 1;\n sy = gy + tmp;\n }\n } else {\n if (sy < gy) {\n sy = 0;\n gy = sy + tmp;\n } else {\n gy = 0;\n sy = gy + tmp;\n }\n }\n priority_queue<pair<P, P>, vector<pair<P, P>>, greater<pair<P, P>>> que;\n que.push({{0, 0}, {sy, sx}});\n ans = INF;\n rep(i, 200) rep(j, 200) rep(k, 200) dat[i][j][k] = INF;\n dat[0][sy][sx] = 0;\n\n while (1) {\n if (que.empty()) break;\n pair<P, P> X;\n X = que.top();\n que.pop();\n\n int time = X.fi.se, nowy = X.se.fi, nowx = X.se.se, cost = X.fi.fi;\n // cout << time << \" \" << nowx << \" \" << nowy << \"\\n\";\n\n if (dat[time][nowy][nowx] < cost) continue;\n\n if (time % 2 == 0) {\n if (dat[time + 1][nowy][nowx - 1] > cost + 1 && nowx - 1 >= 0) {\n que.push({{cost + 1, time + 1}, {nowy, nowx - 1}});\n dat[time + 1][nowy][nowx - 1] = cost + 1;\n }\n if (dat[time + 1][nowy][nowx + 1] > cost + 1 && nowx + 1 < 200) {\n que.push({{cost + 1, time + 1}, {nowy, nowx + 1}});\n dat[time + 1][nowy][nowx + 1] = cost + 1;\n }\n } else {\n if (dat[time + 1][nowy - 1][nowx] > cost + 1 && nowy - 1 >= 0) {\n que.push({{cost + 1, time + 1}, {nowy - 1, nowx}});\n dat[time + 1][nowy - 1][nowx] = cost + 1;\n }\n if (dat[time + 1][nowy + 1][nowx] > cost + 1 && nowy + 1 < 200) {\n que.push({{cost + 1, time + 1}, {nowy + 1, nowx}});\n dat[time + 1][nowy + 1][nowx] = cost + 1;\n }\n }\n if (nowx % 2 == 0) {\n if (dat[time + 1][nowy][nowx + 1] > cost + 1 && nowx + 1 < 200) {\n que.push({{cost + 1, time + 1}, {nowy, nowx + 1}});\n dat[time + 1][nowy][nowx + 1] = cost + 1;\n }\n } else {\n if (dat[time + 1][nowy][nowx - 1] > cost + 1 && nowx - 1 >= 0) {\n que.push({{cost + 1, time + 1}, {nowy, nowx - 1}});\n dat[time + 1][nowy][nowx - 1] = cost + 1;\n }\n }\n if (nowy % 2 == 0) {\n if (dat[time + 1][nowy + 1][nowx] > cost + 1 && nowy + 1 < 200) {\n que.push({{cost + 1, time + 1}, {nowy + 1, nowx}});\n dat[time + 1][nowy + 1][nowx] = cost + 1;\n }\n } else {\n if (dat[time + 1][nowy - 1][nowx] > cost + 1 && nowy - 1 >= 0) {\n que.push({{cost + 1, time + 1}, {nowy - 1, nowx}});\n dat[time + 1][nowy - 1][nowx] = cost + 1;\n }\n }\n if (dat[time + 1][nowy][nowx] > cost + 1) {\n que.push({{cost + 1, time + 1}, {nowy, nowx}});\n dat[time + 1][nowy][nowx] = cost + 1;\n }\n }\n rep(i, 200) ans = min(ans, dat[i][gy][gx]);\n Cout(ans);\n return 0;\n }\n if (sx == gx && sy == gy) {\n Cout(0);\n } else if (sx < gx && sy < gy) {\n Cout(abs(gy - sy) + abs(gx - sx));\n } else if (sx < gx && sy > gy) {\n Cout(abs(gy - sy) + abs(gx - sx));\n } else if (sx > gx && sy < gy) {\n Cout(abs(gy - sy) + abs(gx - sx));\n } else if (sx > gx && sy > gy) {\n Cout(abs(gy - sy) + abs(gx - sx)); //さぼった\n } else {\n if (sx == gx) {\n if (sy < gy) {\n if (sy % 2 == 1)\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\n else\n Cout(abs(gy - sy) + abs(gx - sx));\n } else {\n if (sy % 2 == 0)\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\n else\n Cout(abs(gy - sy) + abs(gx - sx));\n }\n } else {\n if (sx < gx) {\n if (sx % 2 == 0)\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\n else\n Cout(abs(gy - sy) + abs(gx - sx));\n } else {\n if (sx % 2 == 1)\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\n else\n Cout(abs(gy - sy) + abs(gx - sx));\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":70656,"score_of_the_acc":-2,"final_rank":6},{"submission_id":"aoj_3173_4845405","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\n\nstruct state {\n int x, y, t;\n state(int x, int y, int t): x(x), y(y), t(t){} \n};\n\nint Sx[3][2] = {{30, 31},\n\t\t{30, 31},\n\t\t{14, 15}};\nint Sy[3][2] = {{40, 41},\n\t\t{40, 41},\n\t\t{24, 25}};\nint Gx[3][2] = {{30, 31},\n\t\t{14, 15},\n\t\t{30, 31}};\nint Gy[3][2] = {{40, 41},\n\t\t{24, 25},\n\t\t{40, 41}};\n\nint pre_calc[3][3][2][2][2][2];\n\nint bfs(int sx, int sy, int gx, int gy) {\n bool used[50][50][50];\n fill_n(**used, 50*50*50, false); \n queue<state> Q;\n Q.push(state(sx, sy, 0));\n while ( !Q.empty() ) {\n int x = Q.front().x; \n int y = Q.front().y;\n int t = Q.front().t;\n Q.pop();\n\n if ( x == gx && y == gy ) {\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \" \" << (abs(sx-gx)+abs(sy-gy)) << endl; \n return (t - (abs(sx-gx)+abs(sy-gy))); \n break;\t\n }\n\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 50 ) continue; \n \n if ( used[y][x][t] ) continue;\n used[y][x][t] = true; \n\n if ( x%2 == 0 || t%2 == 0 ) {\n Q.push(state(x+1, y, t+1));\t\n }\n if ( x%2 == 1 || t%2 == 0 ) {\n Q.push(state(x-1, y, t+1));\t\n }\n if ( y%2 == 0 || t%2 == 1 ) {\n Q.push(state(x, y+1, t+1));\t\n }\n if ( y%2 == 1 || t%2 == 1 ) {\n Q.push(state(x, y-1, t+1));\t\n }\n Q.push(state(x, y, t+1)); \n }\n\n return 0; \n}\n\nsigned main() {\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n for ( int k = 0; k < 3; k++ ) {\n for ( int l = 0; l < 3; l++ ) {\n for ( int i = 0; i < (1<<4); i++ ) {\n\tint sx = Sx[k][(i>>0)&1];\n\tint sy = Sy[l][(i>>1)&1];\n\tint gx = Gx[k][(i>>2)&1];\n\tint gy = Gy[l][(i>>3)&1];\t\n\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\n\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\n\t cout << \"aaa \" << k << \" \" << l << \" \" << bfs(sx, sy, gx, gy) << \" \" << pre_calc[2][0][0][0][0][0] << endl;\n\t \n\t }*/\n\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\n\t cout << k << \" \" << l << \" \" << sx << \" \" << sy << \" \" << gx << \" \" << gy << endl;\t \n\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\t \t \n\t }*/\t\n }\n }\n }\n\n int sx, sy, gx, gy;\n cin >> sx >> sy >> gx >> gy;\n\n /*cout << Sx[2][0] << \" \" << Sy[0][0] << \" \" << Gx[2][0] << \" \" << Gy[0][0] << endl;\n cout << pre_calc[2][0][0][0][0][0] << endl; */ \n\n int ans = abs(sx-gx)+abs(sy-gy); \n int k = 0, l = 0;\n if ( sx > gx ) k = 1;\n if ( sx < gx ) k = 2;\n if ( sy > gy ) l = 1;\n if ( sy < gy ) l = 2;\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.6170212765957447,"time_ms":50,"memory_kb":3756,"score_of_the_acc":-0.2401,"final_rank":11},{"submission_id":"aoj_3173_4845394","code_snippet":"#pragma target(\"avx\")\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef unordered_map<ll, ll> U_MAP;\ntypedef priority_queue<ll> pq;\ntypedef priority_queue<ll, vector<ll>, greater<ll>> rpq;\nconstexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;\nconstexpr ll LINF = 1e18;\n\n#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)\n#define rrep(i, a, b) for (ll i = (a); i < (b); i++)\n#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)\n#define all(v) (v).begin(), (v).end()\n#define Size(n) (n).size()\n#define Cout(x) cout << (x) << endl\n#define doublecout(a) cout << fixed << setprecision(15) << a << endl;\n#define fi first\n#define se second\n#define m_p make_pair\n#define p_b push_back\nstring to_string(string s) { return '\"' + s + '\"'; }\nstring to_string(const char* s) { return to_string((string)s); }\nstring to_string(bool b) { return (b ? \"true\" : \"false\"); }\ntemplate <typename A, typename B>\nstring to_string(pair<A, B> p) {\n return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";\n}\ntemplate <typename A>\nstring to_string(A v) {\n bool first = true;\n string res = \"{\";\n for (const auto& x : v) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(x);\n }\n res += \"}\";\n return res;\n}\nvoid debug_out() { cerr << endl; }\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cerr << \" \" << to_string(H);\n debug_out(T...);\n}\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n\n//------ Believe yourself as a genius!!!!!! ------\n\nint dy[] = {1, 0, -1, 0};\nint dx[] = {0, 1, 0, -1};\n// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};\nstring alph(\"abcdefghijklmnopqrstuvwxyz\"), s;\nll n, cnt, ans, a, b, c, d, tmp, m, h, w, x, y, sum, k, q, sx, sy, gx, gy;\nll dat[210][210][210];\n\nint main(void) {\n cin.tie(0);\n cout.tie(0);\n ios::sync_with_stdio(false);\n\n cin >> sx >> sy >> gx >> gy;\n if (abs(gy - sy) + abs(gx - sx) <= 50) {\n tmp = abs(sx - gx);\n if (min(sx, gx) % 2 == 1) {\n if (sx < gx) {\n sx = 1;\n gx = sx + tmp;\n } else {\n gx = 1;\n sx = gx + tmp;\n }\n } else {\n if (sx < gx) {\n sx = 0;\n gx = sx + tmp;\n } else {\n gx = 0;\n sx = gx + tmp;\n }\n }\n tmp = abs(sy - gy);\n if (min(sy, gy) % 2 == 1) {\n if (sy < gy) {\n sy = 1;\n gy = sy + tmp;\n } else {\n gy = 1;\n sy = gy + tmp;\n }\n } else {\n if (sy < gy) {\n sy = 0;\n gy = sy + tmp;\n } else {\n gy = 0;\n sy = gy + tmp;\n }\n }\n priority_queue<pair<P, P>, vector<pair<P, P>>, greater<pair<P, P>>> que;\n que.push({{0, 0}, {sy, sx}});\n ans = INF;\n rep(i, 200) rep(j, 200) rep(k, 200) dat[i][j][k] = INF;\n dat[0][sy][sx] = 0;\n\n while (1) {\n if (que.empty()) break;\n pair<P, P> X;\n X = que.top();\n que.pop();\n\n int time = X.fi.se, nowy = X.se.fi, nowx = X.se.se, cost = X.fi.fi;\n // cout << time << \" \" << nowx << \" \" << nowy << \"\\n\";\n\n if (dat[time][nowy][nowx] < cost) continue;\n\n if (time % 2 == 0) {\n if (dat[time + 1][nowy][nowx - 1] > cost + 1 && nowx - 1 >= 0) {\n que.push({{cost + 1, time + 1}, {nowy, nowx - 1}});\n dat[time + 1][nowy][nowx - 1] = cost + 1;\n }\n if (dat[time + 1][nowy][nowx + 1] > cost + 1 && nowx + 1 < 200) {\n que.push({{cost + 1, time + 1}, {nowy, nowx + 1}});\n dat[time + 1][nowy][nowx + 1] = cost + 1;\n }\n } else {\n if (dat[time + 1][nowy - 1][nowx] > cost + 1 && nowy - 1 >= 0) {\n que.push({{cost + 1, time + 1}, {nowy - 1, nowx}});\n dat[time + 1][nowy - 1][nowx] = cost + 1;\n }\n if (dat[time + 1][nowy + 1][nowx] > cost + 1 && nowy + 1 < 200) {\n que.push({{cost + 1, time + 1}, {nowy + 1, nowx}});\n dat[time + 1][nowy + 1][nowx] = cost + 1;\n }\n }\n if (nowx % 2 == 0) {\n if (dat[time + 1][nowy][nowx + 1] > cost + 1 && nowx + 1 < 200) {\n que.push({{cost + 1, time + 1}, {nowy, nowx + 1}});\n dat[time + 1][nowy][nowx + 1] = cost + 1;\n }\n } else {\n if (dat[time + 1][nowy][nowx - 1] > cost + 1 && nowx - 1 >= 0) {\n que.push({{cost + 1, time + 1}, {nowy, nowx - 1}});\n dat[time + 1][nowy][nowx - 1] = cost + 1;\n }\n }\n if (nowy % 2 == 0) {\n if (dat[time + 1][nowy + 1][nowx] > cost + 1 && nowy + 1 < 200) {\n que.push({{cost + 1, time + 1}, {nowy + 1, nowx}});\n dat[time + 1][nowy + 1][nowx] = cost + 1;\n }\n } else {\n if (dat[time + 1][nowy - 1][nowx] > cost + 1 && nowy - 1 >= 0) {\n que.push({{cost + 1, time + 1}, {nowy - 1, nowx}});\n dat[time + 1][nowy - 1][nowx] = cost + 1;\n }\n }\n if (dat[time + 1][nowy][nowx] > cost + 1) {\n que.push({{cost + 1, time + 1}, {nowy, nowx}});\n dat[time + 1][nowy][nowx] = cost + 1;\n }\n }\n rep(i, 200) ans = min(ans, dat[i][gy][gx]);\n Cout(ans);\n return 0;\n }\n if (sx == gx && sy == gy) {\n Cout(0);\n } else if (sx < gx && sy < gy) {\n Cout(abs(gy - sy) + abs(gx - sx));\n } else if (sx < gx && sy > gy) {\n Cout(abs(gy - sy) + abs(gx - sx));\n } else if (sx > gx && sy < gy) {\n Cout(abs(gy - sy) + abs(gx - sx));\n } else if (sx < gx && sy < gy) {\n Cout(abs(gy - sy) + abs(gx - sx)); //さぼった\n } else {\n if (sx == gx) {\n if (sy < gy) {\n if (sy % 2 == 1)\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\n else\n Cout(abs(gy - sy) + abs(gx - sx));\n } else {\n if (sy % 2 == 0)\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\n else\n Cout(abs(gy - sy) + abs(gx - sx));\n }\n } else {\n if (sx < gx) {\n if (sx % 2 == 0)\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\n else\n Cout(abs(gy - sy) + abs(gx - sx));\n } else {\n if (sx % 2 == 1)\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\n else\n Cout(abs(gy - sy) + abs(gx - sx));\n }\n }\n }\n return 0;\n}","accuracy":0.2765957446808511,"time_ms":170,"memory_kb":70352,"score_of_the_acc":-1.9367,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_3173_5075124\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Printer {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid print(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(bool v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(vector<bool>::reference v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid print(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid print(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid print(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void print(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\\n\\t\\tprint(v.first);\\n\\t\\tprint(D.d);\\n\\t\\tprint(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) print(D.d);\\n\\t\\t\\tprint(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void print(const vector<T>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void print(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) print(D.l);\\n\\t\\t\\tprint(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tPrinter() = default;\\n\\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tPrinter& operator()() {\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Printer& operator()(H&& h) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tprint_range(begin, end);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Printer& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tPrinter& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class V> auto operator()(const V& val, size_t i) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(next(begin(v), i), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct EachConsPair_impl {\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, EachConsPair_impl& c) {\\n\\t\\tvector<pair<value_type, value_type>> result;\\n\\t\\tif (size(v) >= 2) {\\n\\t\\t\\tresult.reserve(size(v) - 1);\\n\\t\\t\\tfor (size_t i = 0; i < size(v) - 1; ++i) {\\n\\t\\t\\t\\tresult.emplace_back(v[i], v[i + 1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} EachConsPair;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 7 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T = long long> constexpr T TEN(size_t n) {\\n\\tT result = 1;\\n\\tfor (size_t i = 0; i < n; ++i) result *= 10;\\n\\treturn result;\\n}\\ntemplate <class T, class U,\\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr auto div_ceil(T n, U m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> constexpr T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> constexpr T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T, class U, class V>\\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\\n\\treturn lower <= v && v < upper;\\n}\\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\\nconstexpr bool is_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> constexpr T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T> constexpr int BIT(T x, int i) {\\n\\treturn (x & (T(1) << i)) ? 1 : 0;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Pow(T a, U n) {\\n\\tassert(n >= 0);\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Powmod(T a, U n, T mod) {\\n\\tassert(n >= 0);\\n\\tif (a > mod) a %= mod;\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 5 \\\"/home/yuruhiya/programming/library/Graph/GraphTemplate.cpp\\\"\\nusing namespace std;\\n\\nusing Weight = long long;\\nconstexpr Weight INF = numeric_limits<Weight>::max();\\nstruct Edge {\\n\\tint to;\\n\\tWeight cost;\\n\\tEdge() : to(-1), cost(-1) {}\\n\\tEdge(int _to, Weight _cost = 1) : to(_to), cost(_cost) {}\\n\\tfriend bool operator<(const Edge& e1, const Edge& e2) {\\n\\t\\treturn e1.cost < e2.cost;\\n\\t}\\n\\tfriend bool operator>(const Edge& e1, const Edge& e2) {\\n\\t\\treturn e1.cost > e2.cost;\\n\\t}\\n\\tfriend ostream& operator<<(ostream& os, const Edge& e) {\\n\\t\\treturn os << \\\"->\\\" << e.to << '(' << e.cost << ')';\\n\\t}\\n};\\nusing Graph = vector<vector<Edge>>;\\nstruct Edge2 {\\n\\tint from, to;\\n\\tWeight cost;\\n\\tEdge2() : from(-1), to(-1), cost(0) {}\\n\\tEdge2(int _from, int _to, Weight _cost) : from(_from), to(_to), cost(_cost) {}\\n\\tfriend bool operator<(const Edge2& e1, const Edge2& e2) {\\n\\t\\treturn e1.cost < e2.cost;\\n\\t}\\n\\tfriend bool operator>(const Edge2& e1, const Edge2& e2) {\\n\\t\\treturn e1.cost > e2.cost;\\n\\t}\\n\\tfriend ostream& operator<<(ostream& os, const Edge2& e) {\\n\\t\\treturn os << e.from << \\\"->\\\" << e.to << '(' << e.cost << ')';\\n\\t}\\n};\\nusing Edges = vector<Edge2>;\\nusing Matrix = vector<vector<Weight>>;\\n#line 5 \\\"/home/yuruhiya/programming/library/Graph/Dijkstra.cpp\\\"\\nusing namespace std;\\n\\nvector<Weight> Dijkstra(const Graph& graph, int s) {\\n\\tint V = graph.size();\\n\\tvector<Weight> dist(V, INF);\\n\\tdist[s] = 0;\\n\\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\\n\\tpq.emplace(s, 0);\\n\\twhile (!pq.empty()) {\\n\\t\\tEdge p = pq.top();\\n\\t\\tpq.pop();\\n\\t\\tint v = p.to;\\n\\t\\tif (dist[v] < p.cost) continue;\\n\\t\\tfor (auto e : graph[v]) {\\n\\t\\t\\tif (dist[e.to] > dist[v] + e.cost) {\\n\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\tpq.emplace(e.to, dist[e.to]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dist;\\n}\\nWeight Dijkstra(const Graph& graph, int s, int t) {\\n\\tint V = graph.size();\\n\\tvector<Weight> dist(V, INF);\\n\\tdist[s] = 0;\\n\\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\\n\\tpq.emplace(s, 0);\\n\\twhile (!pq.empty()) {\\n\\t\\tEdge p = pq.top();\\n\\t\\tpq.pop();\\n\\t\\tint v = p.to;\\n\\t\\tif (v == t) return dist[t];\\n\\t\\tif (dist[v] < p.cost) continue;\\n\\t\\tfor (auto e : graph[v]) {\\n\\t\\t\\tif (dist[e.to] > dist[v] + e.cost) {\\n\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\tpq.emplace(e.to, dist[e.to]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dist[t];\\n}\\n#line 3 \\\"a.cpp\\\"\\n\\nint main() {\\n\\tinl(sx, sy, gx, gy);\\n\\n\\tconst int range = 50;\\n\\tVL x_val, y_val;\\n\\tx_val << step(sx - range, sx + range).to_a();\\n\\tx_val << step(gx - range, gx + range).to_a();\\n\\ty_val << step(sy - range, sy + range).to_a();\\n\\ty_val << step(gy - range, gy + range).to_a();\\n\\tx_val = x_val | Uniq;\\n\\ty_val = y_val | Uniq;\\n\\tdump(x_val, y_val);\\n\\n\\tconst int MAX_V = sz(x_val) * sz(y_val) * 2;\\n\\tGraph g(MAX_V);\\n\\tauto to_i = [&](ll x, ll y, ll time) {\\n\\t\\treturn lower_index(x_val, x) * sz(y_val) * 2 + lower_index(y_val, y) * 2 + time;\\n\\t};\\n\\tauto add_edge = [&](ll x1, ll y1, ll t1, ll x2, ll y2, ll t2, ll cost) {\\n\\t\\tg[to_i(x1, y1, t1)].emplace_back(to_i(x2, y2, t2), cost);\\n\\t};\\n\\tauto add_edge2 = [&](ll x1, ll y1, ll t1, ll x2, ll y2, ll t2, ll cost) {\\n\\t\\tadd_edge(x1, y1, t1, x2, y2, t2, cost);\\n\\t\\tadd_edge(x2, y2, t2, x1, y1, t1, cost);\\n\\t};\\n\\n\\tfor (ll x : x_val) {\\n\\t\\tfor (ll y : y_val) {\\n\\t\\t\\tfor (ll f : {0, 1}) {\\n\\t\\t\\t\\tadd_edge2(x, y, f, x, y, 1 - f, 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (auto [x1, x2] : x_val | EachConsPair) {\\n\\t\\tfor (ll y : y_val) {\\n\\t\\t\\tfor (ll f : {0, 1}) {\\n\\t\\t\\t\\tif (x1 + 1 == x2) {\\n\\t\\t\\t\\t\\tif (x1 % 2 == 0 || f == 0) {\\n\\t\\t\\t\\t\\t\\tadd_edge2(x1, y, f, x2, y, 1 - f, 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tif ((x1 % 2 == 1 && f == 0) || (x1 % 2 == 0 && f == 1)) {\\n\\t\\t\\t\\t\\t\\tadd_edge(x1, y, f, x2, y, (f + x2 - x1) % 2, x2 - x1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif ((x2 % 2 == 0 && f == 0) || (x2 % 2 == 1 && f == 1)) {\\n\\t\\t\\t\\t\\t\\tadd_edge(x2, y, f, x1, y, (f + x2 - x1) % 2, x2 - x1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (ll x : x_val) {\\n\\t\\tfor (auto [y1, y2] : y_val | EachConsPair) {\\n\\t\\t\\tfor (ll f : {0, 1}) {\\n\\t\\t\\t\\tif (y1 + 1 == y2) {\\n\\t\\t\\t\\t\\tif (y1 % 2 == 0 || f == 1) {\\n\\t\\t\\t\\t\\t\\tadd_edge2(x, y1, f, x, y2, 1 - f, 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tif ((y1 % 2 == 1 && f == 1) || (y1 % 2 == 0 && f == 0)) {\\n\\t\\t\\t\\t\\t\\tadd_edge(x, y1, f, x, y2, (f + y2 - y1) % 2, y2 - y1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif ((y2 % 2 == 0 && f == 1) || (y2 % 2 == 1 && f == 0)) {\\n\\t\\t\\t\\t\\t\\tadd_edge(x, y2, f, x, y1, (f + y2 - y1) % 2, y2 - y1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tll ans1 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 0));\\n\\tll ans2 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 1));\\n\\tout(min(ans1, ans2));\\n}\",\n \"accuracy\": 0.0425531914893617,\n \"time_ms\": 40,\n \"memory_kb\": 17076,\n \"score_of_the_acc\": -0.3794,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3173_5075116\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Printer {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid print(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(bool v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(vector<bool>::reference v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid print(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid print(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid print(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void print(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\\n\\t\\tprint(v.first);\\n\\t\\tprint(D.d);\\n\\t\\tprint(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) print(D.d);\\n\\t\\t\\tprint(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void print(const vector<T>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void print(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) print(D.l);\\n\\t\\t\\tprint(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tPrinter() = default;\\n\\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tPrinter& operator()() {\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Printer& operator()(H&& h) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tprint_range(begin, end);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Printer& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tPrinter& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class V> auto operator()(const V& val, size_t i) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(next(begin(v), i), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct EachConsPair_impl {\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, EachConsPair_impl& c) {\\n\\t\\tvector<pair<value_type, value_type>> result;\\n\\t\\tif (size(v) >= 2) {\\n\\t\\t\\tresult.reserve(size(v) - 1);\\n\\t\\t\\tfor (size_t i = 0; i < size(v) - 1; ++i) {\\n\\t\\t\\t\\tresult.emplace_back(v[i], v[i + 1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} EachConsPair;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 7 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T = long long> constexpr T TEN(size_t n) {\\n\\tT result = 1;\\n\\tfor (size_t i = 0; i < n; ++i) result *= 10;\\n\\treturn result;\\n}\\ntemplate <class T, class U,\\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr auto div_ceil(T n, U m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> constexpr T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> constexpr T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T, class U, class V>\\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\\n\\treturn lower <= v && v < upper;\\n}\\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\\nconstexpr bool is_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> constexpr T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T> constexpr int BIT(T x, int i) {\\n\\treturn (x & (T(1) << i)) ? 1 : 0;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Pow(T a, U n) {\\n\\tassert(n >= 0);\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Powmod(T a, U n, T mod) {\\n\\tassert(n >= 0);\\n\\tif (a > mod) a %= mod;\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 5 \\\"/home/yuruhiya/programming/library/Graph/GraphTemplate.cpp\\\"\\nusing namespace std;\\n\\nusing Weight = long long;\\nconstexpr Weight INF = numeric_limits<Weight>::max();\\nstruct Edge {\\n\\tint to;\\n\\tWeight cost;\\n\\tEdge() : to(-1), cost(-1) {}\\n\\tEdge(int _to, Weight _cost = 1) : to(_to), cost(_cost) {}\\n\\tfriend bool operator<(const Edge& e1, const Edge& e2) {\\n\\t\\treturn e1.cost < e2.cost;\\n\\t}\\n\\tfriend bool operator>(const Edge& e1, const Edge& e2) {\\n\\t\\treturn e1.cost > e2.cost;\\n\\t}\\n\\tfriend ostream& operator<<(ostream& os, const Edge& e) {\\n\\t\\treturn os << \\\"->\\\" << e.to << '(' << e.cost << ')';\\n\\t}\\n};\\nusing Graph = vector<vector<Edge>>;\\nstruct Edge2 {\\n\\tint from, to;\\n\\tWeight cost;\\n\\tEdge2() : from(-1), to(-1), cost(0) {}\\n\\tEdge2(int _from, int _to, Weight _cost) : from(_from), to(_to), cost(_cost) {}\\n\\tfriend bool operator<(const Edge2& e1, const Edge2& e2) {\\n\\t\\treturn e1.cost < e2.cost;\\n\\t}\\n\\tfriend bool operator>(const Edge2& e1, const Edge2& e2) {\\n\\t\\treturn e1.cost > e2.cost;\\n\\t}\\n\\tfriend ostream& operator<<(ostream& os, const Edge2& e) {\\n\\t\\treturn os << e.from << \\\"->\\\" << e.to << '(' << e.cost << ')';\\n\\t}\\n};\\nusing Edges = vector<Edge2>;\\nusing Matrix = vector<vector<Weight>>;\\n#line 5 \\\"/home/yuruhiya/programming/library/Graph/Dijkstra.cpp\\\"\\nusing namespace std;\\n\\nvector<Weight> Dijkstra(const Graph& graph, int s) {\\n\\tint V = graph.size();\\n\\tvector<Weight> dist(V, INF);\\n\\tdist[s] = 0;\\n\\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\\n\\tpq.emplace(s, 0);\\n\\twhile (!pq.empty()) {\\n\\t\\tEdge p = pq.top();\\n\\t\\tpq.pop();\\n\\t\\tint v = p.to;\\n\\t\\tif (dist[v] < p.cost) continue;\\n\\t\\tfor (auto e : graph[v]) {\\n\\t\\t\\tif (dist[e.to] > dist[v] + e.cost) {\\n\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\tpq.emplace(e.to, dist[e.to]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dist;\\n}\\nWeight Dijkstra(const Graph& graph, int s, int t) {\\n\\tint V = graph.size();\\n\\tvector<Weight> dist(V, INF);\\n\\tdist[s] = 0;\\n\\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\\n\\tpq.emplace(s, 0);\\n\\twhile (!pq.empty()) {\\n\\t\\tEdge p = pq.top();\\n\\t\\tpq.pop();\\n\\t\\tint v = p.to;\\n\\t\\tif (v == t) return dist[t];\\n\\t\\tif (dist[v] < p.cost) continue;\\n\\t\\tfor (auto e : graph[v]) {\\n\\t\\t\\tif (dist[e.to] > dist[v] + e.cost) {\\n\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\tpq.emplace(e.to, dist[e.to]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dist[t];\\n}\\n#line 3 \\\"a.cpp\\\"\\n\\nint main() {\\n\\tinl(sx, sy, gx, gy);\\n\\n\\tconst int range = 50;\\n\\tVL x_val, y_val;\\n\\tx_val << step(sx - range, sx + range).to_a();\\n\\tx_val << step(gx - range, gx + range).to_a();\\n\\ty_val << step(sy - range, sy + range).to_a();\\n\\ty_val << step(gy - range, gy + range).to_a();\\n\\tx_val = x_val | Uniq;\\n\\ty_val = y_val | Uniq;\\n\\tdump(x_val, y_val);\\n\\n\\tconst int MAX_V = sz(x_val) * sz(y_val) * 2;\\n\\tGraph g(MAX_V);\\n\\tauto to_i = [&](ll x, ll y, ll time) {\\n\\t\\treturn lower_index(x_val, x) * sz(y_val) * 2 + lower_index(y_val, y) * 2 + time;\\n\\t};\\n\\tauto add_edge = [&](ll x1, ll y1, ll t1, ll x2, ll y2, ll t2, ll cost) {\\n\\t\\tg[to_i(x1, y1, t1)].emplace_back(to_i(x2, y2, t2), cost);\\n\\t};\\n\\tauto add_edge2 = [&](ll x1, ll y1, ll t1, ll x2, ll y2, ll t2, ll cost) {\\n\\t\\tadd_edge(x1, y1, t1, x2, y2, t2, cost);\\n\\t\\tadd_edge(x2, y2, t2, x1, y1, t1, cost);\\n\\t};\\n\\n\\tfor (ll x : x_val) {\\n\\t\\tfor (ll y : y_val) {\\n\\t\\t\\tfor (ll f : {0, 1}) {\\n\\t\\t\\t\\tadd_edge2(x, y, f, x, y, 1 - f, 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (auto [x1, x2] : x_val | EachConsPair) {\\n\\t\\tfor (ll y : y_val) {\\n\\t\\t\\tfor (ll f : {0, 1}) {\\n\\t\\t\\t\\tif (x1 + 1 == x2) {\\n\\t\\t\\t\\t\\tif (x1 % 2 == 0 || f == 0) {\\n\\t\\t\\t\\t\\t\\tadd_edge2(x1, y, f, x2, y, 1 - f, 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tif ((x1 % 2 == 1 && f == 0) || (x1 % 2 == 0 && f == 1)) {\\n\\t\\t\\t\\t\\t\\tadd_edge2(x1, y, f, x2, y, (f + x2 - x1) % 2, x2 - x1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (ll x : x_val) {\\n\\t\\tfor (auto [y1, y2] : y_val | EachConsPair) {\\n\\t\\t\\tfor (ll f : {0, 1}) {\\n\\t\\t\\t\\tif (y1 + 1 == y2) {\\n\\t\\t\\t\\t\\tif (y1 % 2 == 0 || f == 1) {\\n\\t\\t\\t\\t\\t\\tadd_edge2(x, y1, f, x, y2, 1 - f, 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tif ((y1 % 2 == 1 && f == 1) || (y1 % 2 == 0 && f == 0)) {\\n\\t\\t\\t\\t\\t\\tadd_edge2(x, y1, f, x, y2, (f + y2 - y1) % 2, y2 - y1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tll ans1 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 0));\\n\\tll ans2 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 1));\\n\\tout(min(ans1, ans2));\\n}\",\n \"accuracy\": 0.06382978723404255,\n \"time_ms\": 40,\n \"memory_kb\": 17320,\n \"score_of_the_acc\": -0.3831,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3173_5075069\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Printer {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid print(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(bool v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(vector<bool>::reference v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid print(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid print(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid print(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void print(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\\n\\t\\tprint(v.first);\\n\\t\\tprint(D.d);\\n\\t\\tprint(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) print(D.d);\\n\\t\\t\\tprint(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void print(const vector<T>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void print(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) print(D.l);\\n\\t\\t\\tprint(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tPrinter() = default;\\n\\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tPrinter& operator()() {\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Printer& operator()(H&& h) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tprint_range(begin, end);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Printer& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tPrinter& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class V> auto operator()(const V& val, size_t i) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(next(begin(v), i), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct EachConsPair_impl {\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, EachConsPair_impl& c) {\\n\\t\\tvector<pair<value_type, value_type>> result;\\n\\t\\tif (size(v) >= 2) {\\n\\t\\t\\tresult.reserve(size(v) - 1);\\n\\t\\t\\tfor (size_t i = 0; i < size(v) - 1; ++i) {\\n\\t\\t\\t\\tresult.emplace_back(v[i], v[i + 1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} EachConsPair;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 7 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T = long long> constexpr T TEN(size_t n) {\\n\\tT result = 1;\\n\\tfor (size_t i = 0; i < n; ++i) result *= 10;\\n\\treturn result;\\n}\\ntemplate <class T, class U,\\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr auto div_ceil(T n, U m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> constexpr T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> constexpr T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T, class U, class V>\\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\\n\\treturn lower <= v && v < upper;\\n}\\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\\nconstexpr bool is_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> constexpr T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T> constexpr int BIT(T x, int i) {\\n\\treturn (x & (T(1) << i)) ? 1 : 0;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Pow(T a, U n) {\\n\\tassert(n >= 0);\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Powmod(T a, U n, T mod) {\\n\\tassert(n >= 0);\\n\\tif (a > mod) a %= mod;\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 5 \\\"/home/yuruhiya/programming/library/Graph/GraphTemplate.cpp\\\"\\nusing namespace std;\\n\\nusing Weight = long long;\\nconstexpr Weight INF = numeric_limits<Weight>::max();\\nstruct Edge {\\n\\tint to;\\n\\tWeight cost;\\n\\tEdge() : to(-1), cost(-1) {}\\n\\tEdge(int _to, Weight _cost = 1) : to(_to), cost(_cost) {}\\n\\tfriend bool operator<(const Edge& e1, const Edge& e2) {\\n\\t\\treturn e1.cost < e2.cost;\\n\\t}\\n\\tfriend bool operator>(const Edge& e1, const Edge& e2) {\\n\\t\\treturn e1.cost > e2.cost;\\n\\t}\\n\\tfriend ostream& operator<<(ostream& os, const Edge& e) {\\n\\t\\treturn os << \\\"->\\\" << e.to << '(' << e.cost << ')';\\n\\t}\\n};\\nusing Graph = vector<vector<Edge>>;\\nstruct Edge2 {\\n\\tint from, to;\\n\\tWeight cost;\\n\\tEdge2() : from(-1), to(-1), cost(0) {}\\n\\tEdge2(int _from, int _to, Weight _cost) : from(_from), to(_to), cost(_cost) {}\\n\\tfriend bool operator<(const Edge2& e1, const Edge2& e2) {\\n\\t\\treturn e1.cost < e2.cost;\\n\\t}\\n\\tfriend bool operator>(const Edge2& e1, const Edge2& e2) {\\n\\t\\treturn e1.cost > e2.cost;\\n\\t}\\n\\tfriend ostream& operator<<(ostream& os, const Edge2& e) {\\n\\t\\treturn os << e.from << \\\"->\\\" << e.to << '(' << e.cost << ')';\\n\\t}\\n};\\nusing Edges = vector<Edge2>;\\nusing Matrix = vector<vector<Weight>>;\\n#line 5 \\\"/home/yuruhiya/programming/library/Graph/Dijkstra.cpp\\\"\\nusing namespace std;\\n\\nvector<Weight> Dijkstra(const Graph& graph, int s) {\\n\\tint V = graph.size();\\n\\tvector<Weight> dist(V, INF);\\n\\tdist[s] = 0;\\n\\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\\n\\tpq.emplace(s, 0);\\n\\twhile (!pq.empty()) {\\n\\t\\tEdge p = pq.top();\\n\\t\\tpq.pop();\\n\\t\\tint v = p.to;\\n\\t\\tif (dist[v] < p.cost) continue;\\n\\t\\tfor (auto e : graph[v]) {\\n\\t\\t\\tif (dist[e.to] > dist[v] + e.cost) {\\n\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\tpq.emplace(e.to, dist[e.to]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dist;\\n}\\nWeight Dijkstra(const Graph& graph, int s, int t) {\\n\\tint V = graph.size();\\n\\tvector<Weight> dist(V, INF);\\n\\tdist[s] = 0;\\n\\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\\n\\tpq.emplace(s, 0);\\n\\twhile (!pq.empty()) {\\n\\t\\tEdge p = pq.top();\\n\\t\\tpq.pop();\\n\\t\\tint v = p.to;\\n\\t\\tif (v == t) return dist[t];\\n\\t\\tif (dist[v] < p.cost) continue;\\n\\t\\tfor (auto e : graph[v]) {\\n\\t\\t\\tif (dist[e.to] > dist[v] + e.cost) {\\n\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\tpq.emplace(e.to, dist[e.to]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dist[t];\\n}\\n#line 3 \\\"a.cpp\\\"\\n\\nint main() {\\n\\tinl(sx, sy, gx, gy);\\n\\n\\tconst int range = 50;\\n\\tVL x_val, y_val;\\n\\tx_val << step(sx - range, sx + range).to_a();\\n\\tx_val << step(gx - range, gx + range).to_a();\\n\\ty_val << step(sy - range, sy + range).to_a();\\n\\ty_val << step(gy - range, gy + range).to_a();\\n\\tx_val = x_val | Uniq;\\n\\ty_val = y_val | Uniq;\\n\\n\\tconst int MAX_V = sz(x_val) * sz(y_val) * 2;\\n\\tGraph g(MAX_V);\\n\\tauto to_i = [&](int x, int y, int time) {\\n\\t\\treturn lower_index(x_val, x) * sz(y_val) * 2 + lower_index(y_val, y) * 2 + time;\\n\\t};\\n\\tauto add_edge = [&](int x1, int y1, int t1, int x2, int y2, int t2, ll cost) {\\n\\t\\tg[to_i(x1, y1, t1)].emplace_back(to_i(x2, y2, t2), cost);\\n\\t};\\n\\tauto add_edge2 = [&](int x1, int y1, int t1, int x2, int y2, int t2, ll cost) {\\n\\t\\tadd_edge(x1, y1, t1, x2, y2, t2, cost);\\n\\t\\tadd_edge(x2, y2, t2, x1, y1, t1, cost);\\n\\t};\\n\\n\\tfor (ll x : x_val) {\\n\\t\\tfor (ll y : y_val) {\\n\\t\\t\\tfor (int f : {0, 1}) {\\n\\t\\t\\t\\tadd_edge2(x, y, f, x, y, 1 - f, 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (auto [x1, x2] : x_val | EachConsPair) {\\n\\t\\tfor (ll y : y_val) {\\n\\t\\t\\tfor (int f : {0, 1}) {\\n\\t\\t\\t\\tif (x1 + 1 == x2) {\\n\\t\\t\\t\\t\\tif (x1 % 2 == 0 || f == 0) {\\n\\t\\t\\t\\t\\t\\tadd_edge2(x1, y, f, x2, y, 1 - f, 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tif (x1 % 2 == 1 && f == 0) {\\n\\t\\t\\t\\t\\t\\tadd_edge2(x1, y, f, x2, y, (f + x2 - x1) % 2, x2 - x1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (ll x : x_val) {\\n\\t\\tfor (auto [y1, y2] : y_val | EachConsPair) {\\n\\t\\t\\tfor (int f : {0, 1}) {\\n\\t\\t\\t\\tif (y1 + 1 == y2) {\\n\\t\\t\\t\\t\\tif (y1 % 2 == 0 || f == 1) {\\n\\t\\t\\t\\t\\t\\tadd_edge2(x, y1, f, x, y2, 1 - f, 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tif (y1 % 2 == 1 && f == 1) {\\n\\t\\t\\t\\t\\t\\tadd_edge2(x, y1, f, x, y2, (f + y2 - y1) % 2, y2 - y1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tll ans1 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 0));\\n\\tll ans2 = Dijkstra(g, to_i(sx, sy, 0), to_i(gx, gy, 1));\\n\\tout(min(ans1, ans2));\\n}\",\n \"accuracy\": 0.0425531914893617,\n \"time_ms\": 10,\n \"memory_kb\": 13020,\n \"score_of_the_acc\": -0.1426,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3173_4860824\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef _DEBUG\\n#include \\\"_DEBUG.hpp\\\"\\n#endif\\n#define int long long\\nconst int INF = 2e18;\\nconst int MOD = 1e9 + 7;\\n\\nsigned main() {\\n int Sx, Sy, Gx, Gy;\\n cin >> Sx >> Sy >> Gx >> Gy;\\n\\n int ans = INF;\\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim) -> void {\\n if (lim == 8) return;\\n if (y == Gy && x == Gx) {\\n ans = min(ans, t);\\n return;\\n }\\n /* ----- x + 1 ----- */\\n if (x % 2 == 0 || t % 2 == 0) {\\n dfs(dfs, y, x + 1, t + 1, lim + 1);\\n }\\n /* ----- x - 1 ----- */\\n if (x % 2 == 1 || t % 2 == 0) {\\n dfs(dfs, y, x - 1, t + 1, lim + 1);\\n }\\n /* ----- y + 1 ----- */\\n if (y % 2 == 0 || t % 2 == 1) {\\n dfs(dfs, y + 1, x, t + 1, lim + 1);\\n }\\n /* ----- y - 1 ----- */\\n if (y % 2 == 1 || t % 2 == 1) {\\n dfs(dfs, y - 1, x, t + 1, lim + 1);\\n }\\n /* ----- + 0 ----- */\\n dfs(dfs, y, x, t + 1, lim + 1);\\n\\n /* ----- 一気に行く ----- */\\n if ((Gx - x) >= 0 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\\n }\\n if ((x - Gx) >= 0 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\\n }\\n if ((Gy - y) >= 0 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\\n }\\n if ((y - Gy) >= 0 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\\n }\\n\\n /* ----- 1つ手前まで行く ----- */\\n if ((Gx - x) >= 1 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx - 1, t + (Gx - x) - 1, lim + 1);\\n }\\n if ((x - Gx) >= 1 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx + 1, t + (x - Gx) - 1, lim + 1);\\n }\\n if ((Gy - y) >= 1 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy - 1, x, t + (Gy - y) - 1, lim + 1);\\n }\\n if ((y - Gy) >= 1 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy + 1, x, t + (y - Gy) - 1, lim + 1);\\n }\\n\\n /* ----- 2つ手前まで行く ----- */\\n if ((Gx - x) >= 2 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx - 2, t + (Gx - x) - 2, lim + 1);\\n }\\n if ((x - Gx) >= 2 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx + 2, t + (x - Gx) - 2, lim + 1);\\n }\\n if ((Gy - y) >= 2 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy - 2, x, t + (Gy - y) - 2, lim + 1);\\n }\\n if ((y - Gy) >= 2 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy + 2, x, t + (y - Gy) - 2, lim + 1);\\n }\\n\\n /* ----- 3つ手前まで行く ----- */\\n if ((Gx - x) >= 3 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx - 3, t + (Gx - x) - 3, lim + 1);\\n }\\n if ((x - Gx) >= 3 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx + 3, t + (x - Gx) - 3, lim + 1);\\n }\\n if ((Gy - y) >= 3 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy - 3, x, t + (Gy - y) - 3, lim + 1);\\n }\\n if ((y - Gy) >= 3 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy + 3, x, t + (y - Gy) - 3, lim + 1);\\n }\\n\\n // /* ----- ジグザグ ----- */\\n // if ((Gx - x) > 0 && (Gy - y) > 0 && (x % 2 == 0 && t % 2 == 0)) {\\n // int dy = abs(Gy - y), dx = abs(Gx - x);\\n // int d = min(dy, dx);\\n // dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\\n // }\\n // if ((Gx - x) < 0 && (Gy - y) > 0 && (x % 2 == 1 && t % 2 == 0)) {\\n // int dy = abs(Gy - y), dx = abs(Gx - x);\\n // int d = min(dy, dx);\\n // dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\\n // }\\n // if ((Gx - x) < 0 && (Gy - y) < 0 && (x % 2 == 0 && t % 2 == 1)) {\\n // int dy = abs(Gy - y), dx = abs(Gx - x);\\n // int d = min(dy, dx);\\n // dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\\n // }\\n // if ((Gx - x) > 0 && (Gy - y) < 0 && (x % 2 == 1 && t % 2 == 1)) {\\n // int dy = abs(Gy - y), dx = abs(Gx - x);\\n // int d = min(dy, dx);\\n // dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\\n // }\\n };\\n dfs(dfs, Sy, Sx, 0, 0);\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.1765,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3173_4860823\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef _DEBUG\\n#include \\\"_DEBUG.hpp\\\"\\n#endif\\n#define int long long\\nconst int INF = 2e18;\\nconst int MOD = 1e9 + 7;\\n\\nsigned main() {\\n int Sx, Sy, Gx, Gy;\\n cin >> Sx >> Sy >> Gx >> Gy;\\n\\n int ans = INF;\\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim) -> void {\\n if (lim == 8) return;\\n if (y == Gy && x == Gx) {\\n ans = min(ans, t);\\n return;\\n }\\n /* ----- x + 1 ----- */\\n if (x % 2 == 0 || t % 2 == 0) {\\n dfs(dfs, y, x + 1, t + 1, lim + 1);\\n }\\n /* ----- x - 1 ----- */\\n if (x % 2 == 1 || t % 2 == 0) {\\n dfs(dfs, y, x - 1, t + 1, lim + 1);\\n }\\n /* ----- y + 1 ----- */\\n if (y % 2 == 0 || t % 2 == 1) {\\n dfs(dfs, y + 1, x, t + 1, lim + 1);\\n }\\n /* ----- y - 1 ----- */\\n if (y % 2 == 1 || t % 2 == 1) {\\n dfs(dfs, y - 1, x, t + 1, lim + 1);\\n }\\n /* ----- + 0 ----- */\\n dfs(dfs, y, x, t + 1, lim + 1);\\n\\n /* ----- 一気に行く ----- */\\n if ((Gx - x) >= 0 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\\n }\\n if ((x - Gx) >= 0 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\\n }\\n if ((Gy - y) >= 0 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\\n }\\n if ((y - Gy) >= 0 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\\n }\\n\\n /* ----- 1つ手前まで行く ----- */\\n if ((Gx - x) >= 1 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx - 1, t + (Gx - x) - 1, lim + 1);\\n }\\n if ((x - Gx) >= 1 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx + 1, t + (x - Gx) - 1, lim + 1);\\n }\\n if ((Gy - y) >= 1 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy - 1, x, t + (Gy - y) - 1, lim + 1);\\n }\\n if ((y - Gy) >= 1 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy + 1, x, t + (y - Gy) - 1, lim + 1);\\n }\\n\\n /* ----- 2つ手前まで行く ----- */\\n if ((Gx - x) >= 2 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx - 2, t + (Gx - x) - 2, lim + 1);\\n }\\n if ((x - Gx) >= 2 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx + 2, t + (x - Gx) - 2, lim + 1);\\n }\\n if ((Gy - y) >= 2 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy - 2, x, t + (Gy - y) - 2, lim + 1);\\n }\\n if ((y - Gy) >= 2 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy + 2, x, t + (y - Gy) - 2, lim + 1);\\n }\\n\\n /* ----- 3つ手前まで行く ----- */\\n if ((Gx - x) >= 3 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx - 3, t + (Gx - x) - 3, lim + 1);\\n }\\n if ((x - Gx) >= 3 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx + 3, t + (x - Gx) - 3, lim + 1);\\n }\\n if ((Gy - y) >= 3 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy - 3, x, t + (Gy - y) - 3, lim + 1);\\n }\\n if ((y - Gy) >= 3 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy + 3, x, t + (y - Gy) - 3, lim + 1);\\n }\\n\\n /* ----- ジグザグ ----- */\\n if ((Gx - x) > 0 && (Gy - y) > 0 && (x % 2 == 0 && t % 2 == 0)) {\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\\n }\\n if ((Gx - x) < 0 && (Gy - y) > 0 && (x % 2 == 1 && t % 2 == 0)) {\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\\n }\\n if ((Gx - x) < 0 && (Gy - y) < 0 && (x % 2 == 0 && t % 2 == 1)) {\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\\n }\\n if ((Gx - x) > 0 && (Gy - y) < 0 && (x % 2 == 1 && t % 2 == 1)) {\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\\n }\\n };\\n dfs(dfs, Sy, Sx, 0, 0);\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.2353,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3173_4860797\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef _DEBUG\\n #include \\\"_DEBUG.hpp\\\"\\n#endif\\n#define int long long\\nconst int INF = 1LL << 61;\\nconst int MOD = 1e9 + 7;\\n\\nsigned main(){\\n\\n int Sx, Sy, Gx, Gy;\\n cin >> Sx >> Sy >> Gx >> Gy;\\n \\n int ans = INF;\\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim)->void{\\n if(lim == 10) return;\\n if(y == Gy && x == Gx){\\n ans = min(ans, t);\\n return;\\n }\\n /* ----- x + 1 ----- */\\n if(x % 2 == 0 || t % 2 == 0){\\n dfs(dfs, y, x + 1, t + 1, lim + 1);\\n }\\n /* ----- x - 1 ----- */\\n if(x % 2 == 1 || t % 2 == 0){\\n dfs(dfs, y, x - 1, t + 1, lim + 1);\\n }\\n /* ----- y + 1 ----- */\\n if(y % 2 == 0 || t % 2 == 1){\\n dfs(dfs, y + 1, x, t + 1, lim + 1);\\n }\\n /* ----- y - 1 ----- */\\n if(y % 2 == 1 || t % 2 == 1){\\n dfs(dfs, y - 1, x, t + 1, lim + 1);\\n }\\n /* ----- + 0 ----- */\\n dfs(dfs, y, x, t + 1, lim + 1);\\n\\n if((Gx - x) >= 0 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\\n }\\n if((x - Gx) >= 0 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\\n }\\n if((Gy - y) >= 0 && (x % 2 != t % 2)){\\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\\n }\\n if((y - Gy) >= 0 && (x % 2 != t % 2)){\\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\\n }\\n };\\n dfs(dfs, Sy, Sx, 0, 0);\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.8723404255319149,\n \"time_ms\": 40,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.1765,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3173_4860795\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef _DEBUG\\n #include \\\"_DEBUG.hpp\\\"\\n#endif\\n#define int long long\\nconst int INF = 1LL << 61;\\nconst int MOD = 1e9 + 7;\\n\\nsigned main(){\\n\\n int Sx, Sy, Gx, Gy;\\n cin >> Sx >> Sy >> Gx >> Gy;\\n \\n int ans = INF;\\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim)->void{\\n if(lim == 8) return;\\n if(y == Gy && x == Gx){\\n ans = min(ans, t);\\n return;\\n }\\n /* ----- x + 1 ----- */\\n if(x % 2 == 0 || t % 2 == 0){\\n dfs(dfs, y, x + 1, t + 1, lim + 1);\\n }\\n /* ----- x - 1 ----- */\\n if(x % 2 == 1 || t % 2 == 0){\\n dfs(dfs, y, x - 1, t + 1, lim + 1);\\n }\\n /* ----- y + 1 ----- */\\n if(y % 2 == 0 || t % 2 == 1){\\n dfs(dfs, y + 1, x, t + 1, lim + 1);\\n }\\n /* ----- y - 1 ----- */\\n if(y % 2 == 1 || t % 2 == 1){\\n dfs(dfs, y - 1, x, t + 1, lim + 1);\\n }\\n /* ----- + 0 ----- */\\n dfs(dfs, y, x, t + 1, lim + 1);\\n\\n /* ----- 一気に行く ----- */\\n if((Gx - x) >= 0 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\\n }\\n if((x - Gx) >= 0 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\\n }\\n if((Gy - y) >= 0 && (y % 2 == t % 2)){\\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\\n }\\n if((y - Gy) >= 0 && (y % 2 != t % 2)){\\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\\n }\\n\\n /* ----- 1つ手前まで行く ----- */\\n if((Gx - x) >= 1 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx-1, t + (Gx - x) - 1, lim + 1);\\n }\\n if((x - Gx) >= 1 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx+1, t + (x - Gx) - 1, lim + 1);\\n }\\n if((Gy - y) >= 1 && (y % 2 == t % 2)){\\n dfs(dfs, Gy-1, x, t + (Gy - y) - 1, lim + 1);\\n }\\n if((y - Gy) >= 1 && (y % 2 != t % 2)){\\n dfs(dfs, Gy+1, x, t + (y - Gy) - 1, lim + 1);\\n }\\n\\n /* ----- 2つ手前まで行く ----- */\\n if((Gx - x) >= 2 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx-2, t + (Gx - x) - 2, lim + 1);\\n }\\n if((x - Gx) >= 2 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx+2, t + (x - Gx) - 2, lim + 1);\\n }\\n if((Gy - y) >= 2 && (y % 2 == t % 2)){\\n dfs(dfs, Gy-2, x, t + (Gy - y) - 2, lim + 1);\\n }\\n if((y - Gy) >= 2 && (y % 2 != t % 2)){\\n dfs(dfs, Gy+2, x, t + (y - Gy) - 2, lim + 1);\\n }\\n };\\n dfs(dfs, Sy, Sx, 0, 0);\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3173_4860780\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef _DEBUG\\n#include \\\"_DEBUG.hpp\\\"\\n#endif\\n#define int long long\\nconst int INF = 1LL << 61;\\nconst int MOD = 1e9 + 7;\\n\\nsigned main() {\\n int Sx, Sy, Gx, Gy;\\n cin >> Sx >> Sy >> Gx >> Gy;\\n\\n int ans = INF;\\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim) -> void {\\n if (lim == 8) return;\\n if (y == Gy && x == Gx) {\\n ans = min(ans, t);\\n return;\\n }\\n /* ----- x + 1 ----- */\\n if (x % 2 == 0 || t % 2 == 0) {\\n dfs(dfs, y, x + 1, t + 1, lim + 1);\\n }\\n /* ----- x - 1 ----- */\\n if (x % 2 == 1 || t % 2 == 0) {\\n dfs(dfs, y, x - 1, t + 1, lim + 1);\\n }\\n /* ----- y + 1 ----- */\\n if (y % 2 == 0 || t % 2 == 1) {\\n dfs(dfs, y + 1, x, t + 1, lim + 1);\\n }\\n /* ----- y - 1 ----- */\\n if (y % 2 == 1 || t % 2 == 1) {\\n dfs(dfs, y - 1, x, t + 1, lim + 1);\\n }\\n /* ----- + 0 ----- */\\n dfs(dfs, y, x, t + 1, lim + 1);\\n\\n /* ----- 一気に行く ----- */\\n if ((Gx - x) >= 0 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\\n }\\n if ((x - Gx) >= 0 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\\n }\\n if ((Gy - y) >= 0 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\\n }\\n if ((y - Gy) >= 0 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\\n }\\n\\n /* ----- 1つ手前まで行く ----- */\\n if ((Gx - x) >= 1 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx - 1, t + (Gx - x) - 1, lim + 1);\\n }\\n if ((x - Gx) >= 1 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx + 1, t + (x - Gx) - 1, lim + 1);\\n }\\n if ((Gy - y) >= 1 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy - 1, x, t + (Gy - y) - 1, lim + 1);\\n }\\n if ((y - Gy) >= 1 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy + 1, x, t + (y - Gy) - 1, lim + 1);\\n }\\n\\n /* ----- 2つ手前まで行く ----- */\\n if ((Gx - x) >= 2 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx - 2, t + (Gx - x) - 2, lim + 1);\\n }\\n if ((x - Gx) >= 2 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx + 2, t + (x - Gx) - 2, lim + 1);\\n }\\n if ((Gy - y) >= 2 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy - 2, x, t + (Gy - y) - 2, lim + 1);\\n }\\n if ((y - Gy) >= 2 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy + 2, x, t + (y - Gy) - 2, lim + 1);\\n }\\n\\n /* ----- 3つ手前まで行く ----- */\\n if ((Gx - x) >= 3 && (x % 2 != t % 2)) {\\n dfs(dfs, y, Gx - 3, t + (Gx - x) - 3, lim + 1);\\n }\\n if ((x - Gx) >= 3 && (x % 2 == t % 2)) {\\n dfs(dfs, y, Gx + 3, t + (x - Gx) - 3, lim + 1);\\n }\\n if ((Gy - y) >= 3 && (y % 2 == t % 2)) {\\n dfs(dfs, Gy - 3, x, t + (Gy - y) - 3, lim + 1);\\n }\\n if ((y - Gy) >= 3 && (y % 2 != t % 2)) {\\n dfs(dfs, Gy + 3, x, t + (y - Gy) - 3, lim + 1);\\n }\\n\\n /* ----- ジグザグ ----- */\\n if ((Gx - x) > 0 && (Gy - y) > 0 && (x % 2 == 0 && t % 2 == 0)) {\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\\n }\\n if ((Gx - x) < 0 && (Gy - y) > 0 && (x % 2 == 1 && t % 2 == 0)) {\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\\n }\\n if ((Gx - x) < 0 && (Gy - y) < 0 && (x % 2 == 0 && t % 2 == 1)) {\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\\n }\\n if ((Gx - x) > 0 && (Gy - y) < 0 && (x % 2 == 1 && t % 2 == 1)) {\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\\n }\\n };\\n dfs(dfs, Sy, Sx, 0, 0);\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.2354,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3173_4845900\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef _DEBUG\\n #include \\\"_DEBUG.hpp\\\"\\n#endif\\n#define int long long\\nconst int INF = 1LL << 60;\\nconst int MOD = 1e9 + 7;\\n\\nsigned main(){\\n\\n int Sx, Sy, Gx, Gy;\\n cin >> Sx >> Sy >> Gx >> Gy;\\n \\n int ans = INF;\\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim)->void{\\n if(lim == 8) return;\\n if(y == Gy && x == Gx){\\n ans = min(ans, t);\\n return;\\n }\\n /* ----- x + 1 ----- */\\n if(x % 2 == 0 || t % 2 == 0){\\n dfs(dfs, y, x + 1, t + 1, lim + 1);\\n }\\n /* ----- x - 1 ----- */\\n if(x % 2 == 1 || t % 2 == 0){\\n dfs(dfs, y, x - 1, t + 1, lim + 1);\\n }\\n /* ----- y + 1 ----- */\\n if(y % 2 == 0 || t % 2 == 1){\\n dfs(dfs, y + 1, x, t + 1, lim + 1);\\n }\\n /* ----- y - 1 ----- */\\n if(y % 2 == 1 || t % 2 == 1){\\n dfs(dfs, y - 1, x, t + 1, lim + 1);\\n }\\n /* ----- + 0 ----- */\\n dfs(dfs, y, x, t + 1, lim + 1);\\n\\n /* ----- 一気に行く ----- */\\n if((Gx - x) >= 0 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\\n }\\n if((x - Gx) >= 0 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\\n }\\n if((Gy - y) >= 0 && (y % 2 == t % 2)){\\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\\n }\\n if((y - Gy) >= 0 && (y % 2 != t % 2)){\\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\\n }\\n\\n /* ----- 1つ手前まで行く ----- */\\n if((Gx - x) >= 1 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx-1, t + (Gx - x) - 1, lim + 1);\\n }\\n if((x - Gx) >= 1 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx+1, t + (x - Gx) - 1, lim + 1);\\n }\\n if((Gy - y) >= 1 && (y % 2 == t % 2)){\\n dfs(dfs, Gy-1, x, t + (Gy - y) - 1, lim + 1);\\n }\\n if((y - Gy) >= 1 && (y % 2 != t % 2)){\\n dfs(dfs, Gy+1, x, t + (y - Gy) - 1, lim + 1);\\n }\\n\\n /* ----- 2つ手前まで行く ----- */\\n if((Gx - x) >= 2 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx-2, t + (Gx - x) - 2, lim + 1);\\n }\\n if((x - Gx) >= 2 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx+2, t + (x - Gx) - 2, lim + 1);\\n }\\n if((Gy - y) >= 2 && (y % 2 == t % 2)){\\n dfs(dfs, Gy-2, x, t + (Gy - y) - 2, lim + 1);\\n }\\n if((y - Gy) >= 2 && (y % 2 != t % 2)){\\n dfs(dfs, Gy+2, x, t + (y - Gy) - 2, lim + 1);\\n }\\n\\n /* ----- 3つ手前まで行く ----- */\\n if((Gx - x) >= 3 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx-3, t + (Gx - x) - 3, lim + 1);\\n }\\n if((x - Gx) >= 3 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx+3, t + (x - Gx) - 3, lim + 1);\\n }\\n if((Gy - y) >= 3 && (y % 2 == t % 2)){\\n dfs(dfs, Gy-3, x, t + (Gy - y) - 3, lim + 1);\\n }\\n if((y - Gy) >= 3 && (y % 2 != t % 2)){\\n dfs(dfs, Gy+3, x, t + (y - Gy) - 3, lim + 1);\\n }\\n\\n /* ----- ジグザグ ----- */\\n if((Gx - x) > 0 && (Gy - y) > 0 && (x % 2 == 0 && t % 2 == 0)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\\n }\\n if((Gx - x) < 0 && (Gy - y) > 0 && (x % 2 == 1 && t % 2 == 0)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\\n }\\n if((Gx - x) < 0 && (Gy - y) < 0 && (x % 2 == 0 && t % 2 == 1)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\\n }\\n if((Gx - x) > 0 && (Gy - y) < 0 && (x % 2 == 1 && t % 2 == 1)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\\n }\\n };\\n dfs(dfs, Sy, Sx, 0, 0);\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.19148936170212766,\n \"time_ms\": 50,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.2353,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3173_4845891\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef _DEBUG\\n #include \\\"_DEBUG.hpp\\\"\\n#endif\\n#define int long long\\nconst int INF = 1LL << 60;\\nconst int MOD = 1e9 + 7;\\n\\nsigned main(){\\n\\n int Sx, Sy, Gx, Gy;\\n cin >> Sx >> Sy >> Gx >> Gy;\\n \\n int ans = INF;\\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim)->void{\\n if(lim == 8) return;\\n if(y == Gy && x == Gx){\\n ans = min(ans, t);\\n return;\\n }\\n /* ----- x + 1 ----- */\\n if(x % 2 == 0 || t % 2 == 0){\\n dfs(dfs, y, x + 1, t + 1, lim + 1);\\n }\\n /* ----- x - 1 ----- */\\n if(x % 2 == 1 || t % 2 == 0){\\n dfs(dfs, y, x - 1, t + 1, lim + 1);\\n }\\n /* ----- y + 1 ----- */\\n if(y % 2 == 0 || t % 2 == 1){\\n dfs(dfs, y + 1, x, t + 1, lim + 1);\\n }\\n /* ----- y - 1 ----- */\\n if(y % 2 == 1 || t % 2 == 1){\\n dfs(dfs, y - 1, x, t + 1, lim + 1);\\n }\\n /* ----- + 0 ----- */\\n dfs(dfs, y, x, t + 1, lim + 1);\\n\\n /* ----- 一気に行く ----- */\\n if((Gx - x) >= 0 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\\n }\\n if((x - Gx) >= 0 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\\n }\\n if((Gy - y) >= 0 && (y % 2 == t % 2)){\\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\\n }\\n if((y - Gy) >= 0 && (y % 2 != t % 2)){\\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\\n }\\n\\n /* ----- 1つ手前まで行く ----- */\\n if((Gx - x) >= 1 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx-1, t + (Gx - x) - 1, lim + 1);\\n }\\n if((x - Gx) >= 1 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx+1, t + (x - Gx) - 1, lim + 1);\\n }\\n if((Gy - y) >= 1 && (y % 2 == t % 2)){\\n dfs(dfs, Gy-1, x, t + (Gy - y) - 1, lim + 1);\\n }\\n if((y - Gy) >= 1 && (y % 2 != t % 2)){\\n dfs(dfs, Gy+1, x, t + (y - Gy) - 1, lim + 1);\\n }\\n\\n /* ----- 2つ手前まで行く ----- */\\n if((Gx - x) >= 2 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx-2, t + (Gx - x) - 2, lim + 1);\\n }\\n if((x - Gx) >= 2 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx+2, t + (x - Gx) - 2, lim + 1);\\n }\\n if((Gy - y) >= 2 && (y % 2 == t % 2)){\\n dfs(dfs, Gy-2, x, t + (Gy - y) - 2, lim + 1);\\n }\\n if((y - Gy) >= 2 && (y % 2 != t % 2)){\\n dfs(dfs, Gy+2, x, t + (y - Gy) - 2, lim + 1);\\n }\\n\\n /* ----- 3つ手前まで行く ----- */\\n if((Gx - x) >= 3 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx-3, t + (Gx - x) - 3, lim + 1);\\n }\\n if((x - Gx) >= 3 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx+3, t + (x - Gx) - 3, lim + 1);\\n }\\n if((Gy - y) >= 3 && (y % 2 == t % 2)){\\n dfs(dfs, Gy-3, x, t + (Gy - y) - 3, lim + 1);\\n }\\n if((y - Gy) >= 3 && (y % 2 != t % 2)){\\n dfs(dfs, Gy+3, x, t + (y - Gy) - 3, lim + 1);\\n }\\n\\n /* ----- ジグザグ ----- */\\n if((Gx - x) > 0 && (Gy - y) > 0 && !(x % 2 != t % 2)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\\n }\\n if((Gx - x) < 0 && (Gy - y) > 0 && !(x % 2 == t % 2)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\\n }\\n if((Gx - x) < 0 && (Gy - y) < 0 && !(y % 2 == t % 2)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\\n }\\n if((Gx - x) > 0 && (Gy - y) < 0 && !(y % 2 != t % 2)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\\n }\\n };\\n dfs(dfs, Sy, Sx, 0, 0);\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.19148936170212766,\n \"time_ms\": 60,\n \"memory_kb\": 3464,\n \"score_of_the_acc\": -0.2946,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3173_4845845\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef _DEBUG\\n #include \\\"_DEBUG.hpp\\\"\\n#endif\\n#define int long long\\nconst int INF = 1LL << 60;\\nconst int MOD = 1e9 + 7;\\n\\nsigned main(){\\n\\n int Sx, Sy, Gx, Gy;\\n cin >> Sx >> Sy >> Gx >> Gy;\\n \\n int ans = INF;\\n auto dfs = [&](auto&& dfs, int y, int x, int t, int lim)->void{\\n if(lim == 8) return;\\n if(y == Gy && x == Gx){\\n ans = min(ans, t);\\n return;\\n }\\n /* ----- x + 1 ----- */\\n if(x % 2 == 0 || t % 2 == 0){\\n dfs(dfs, y, x + 1, t + 1, lim + 1);\\n }\\n /* ----- x - 1 ----- */\\n if(x % 2 == 1 || t % 2 == 0){\\n dfs(dfs, y, x - 1, t + 1, lim + 1);\\n }\\n /* ----- y + 1 ----- */\\n if(y % 2 == 0 || t % 2 == 1){\\n dfs(dfs, y + 1, x, t + 1, lim + 1);\\n }\\n /* ----- y - 1 ----- */\\n if(y % 2 == 1 || t % 2 == 1){\\n dfs(dfs, y - 1, x, t + 1, lim + 1);\\n }\\n /* ----- + 0 ----- */\\n dfs(dfs, y, x, t + 1, lim + 1);\\n\\n /* ----- 一気に行く ----- */\\n if((Gx - x) >= 0 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx, t + (Gx - x), lim + 1);\\n }\\n if((x - Gx) >= 0 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx, t + (x - Gx), lim + 1);\\n }\\n if((Gy - y) >= 0 && (y % 2 == t % 2)){\\n dfs(dfs, Gy, x, t + (Gy - y), lim + 1);\\n }\\n if((y - Gy) >= 0 && (y % 2 != t % 2)){\\n dfs(dfs, Gy, x, t + (y - Gy), lim + 1);\\n }\\n\\n /* ----- 1つ手前まで行く ----- */\\n if((Gx - x) >= 1 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx-1, t + (Gx - x) - 1, lim + 1);\\n }\\n if((x - Gx) >= 1 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx+1, t + (x - Gx) - 1, lim + 1);\\n }\\n if((Gy - y) >= 1 && (y % 2 == t % 2)){\\n dfs(dfs, Gy-1, x, t + (Gy - y) - 1, lim + 1);\\n }\\n if((y - Gy) >= 1 && (y % 2 != t % 2)){\\n dfs(dfs, Gy+1, x, t + (y - Gy) - 1, lim + 1);\\n }\\n\\n /* ----- 2つ手前まで行く ----- */\\n if((Gx - x) >= 2 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx-2, t + (Gx - x) - 2, lim + 1);\\n }\\n if((x - Gx) >= 2 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx+2, t + (x - Gx) - 2, lim + 1);\\n }\\n if((Gy - y) >= 2 && (y % 2 == t % 2)){\\n dfs(dfs, Gy-2, x, t + (Gy - y) - 2, lim + 1);\\n }\\n if((y - Gy) >= 2 && (y % 2 != t % 2)){\\n dfs(dfs, Gy+2, x, t + (y - Gy) - 2, lim + 1);\\n }\\n\\n /* ----- 3つ手前まで行く ----- */\\n if((Gx - x) >= 3 && (x % 2 != t % 2)){\\n dfs(dfs, y, Gx-3, t + (Gx - x) - 3, lim + 1);\\n }\\n if((x - Gx) >= 3 && (x % 2 == t % 2)){\\n dfs(dfs, y, Gx+3, t + (x - Gx) - 3, lim + 1);\\n }\\n if((Gy - y) >= 3 && (y % 2 == t % 2)){\\n dfs(dfs, Gy-3, x, t + (Gy - y) - 3, lim + 1);\\n }\\n if((y - Gy) >= 3 && (y % 2 != t % 2)){\\n dfs(dfs, Gy+3, x, t + (y - Gy) - 3, lim + 1);\\n }\\n\\n /* ----- ジグザグ ----- */\\n if((Gx - x) > 0 && (Gy - y) > 0 && !(x % 2 != t % 2)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y + d, x + d, t + d * 2, lim + 1);\\n }\\n if((Gx - x) < 0 && (Gy - y) > 0 && !(x % 2 == t % 2)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y + d, x - d, t + d * 2, lim + 1);\\n }\\n if((Gx - x) < 0 && (Gy - y) < 0 && !(y % 2 == t % 2)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y - d, x - d, t + d * 2, lim + 1);\\n }\\n if((Gx - x) > 0 && (Gy - y) < 0 && !(y % 2 != t % 2)){\\n int dy = abs(Gy - y), dx = abs(Gx - x);\\n int d = min(dy, dx);\\n dfs(dfs, y - d, x + d, t + d * 2, lim + 1);\\n }\\n };\\n dfs(dfs, Sy, Sx, 0, 0);\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.19148936170212766,\n \"time_ms\": 60,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.2941,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3173_4845754\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <functional>\\n#include <bitset>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\\n\\nstruct state {\\n int x, y, t;\\n state(int x, int y, int t): x(x), y(y), t(t){} \\n};\\n\\nint Sx[5][2] = {{30, 31},\\n\\t\\t{30, 31},\\n\\t\\t{14, 15},\\n\\t\\t{21, 20},\\n\\t\\t{20, 21}};\\nint Sy[5][2] = {{40, 41},\\n\\t\\t{40, 41},\\n\\t\\t{24, 25},\\n\\t\\t{31, 30},\\n\\t\\t{30, 31}};\\nint Gx[5][2] = {{30, 31},\\n\\t\\t{14, 15},\\n\\t\\t{30, 31},\\n\\t\\t{20, 21},\\n\\t\\t{21, 20}};\\nint Gy[5][2] = {{40, 41},\\n\\t\\t{24, 25},\\n\\t\\t{40, 41},\\n\\t\\t{30, 31},\\n\\t\\t{31, 30}};\\n\\nint pre_calc[5][5][2][2][2][2];\\n\\nint bfs(int sx, int sy, int gx, int gy) {\\n bool used[50][50][100];\\n fill_n(**used, 50*50*100, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n \\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return (t - (abs(sx-gx)+abs(sy-gy))); \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nint bfs2(int sx, int sy, int gx, int gy) {\\n bool used[50][50][100];\\n fill_n(**used, 50*50*100, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n \\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return t; \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nsigned main() {\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n\\n for ( int k = 0; k < 5; k++ ) {\\n for ( int l = 0; l < 5; l++ ) {\\n for ( int i = 0; i < (1<<4); i++ ) {\\n\\tint sx = Sx[k][(i>>0)&1];\\n\\tint sy = Sy[l][(i>>1)&1];\\n\\tint gx = Gx[k][(i>>2)&1];\\n\\tint gy = Gy[l][(i>>3)&1];\\t\\n\\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\\n\\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\\n\\t cout << \\\"aaa \\\" << k << \\\" \\\" << l << \\\" \\\" << bfs(sx, sy, gx, gy) << \\\" \\\" << pre_calc[2][0][0][0][0][0] << endl;\\n\\t \\n\\t }*/\\n\\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\\n\\t cout << k << \\\" \\\" << l << \\\" \\\" << sx << \\\" \\\" << sy << \\\" \\\" << gx << \\\" \\\" << gy << endl;\\t \\n\\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\\t \\t \\n\\t }*/\\t\\n }\\n }\\n }\\n\\n int sx, sy, gx, gy;\\n cin >> sx >> sy >> gx >> gy;\\n\\n /*cout << Sx[2][0] << \\\" \\\" << Sy[0][0] << \\\" \\\" << Gx[2][0] << \\\" \\\" << Gy[0][0] << endl;\\n cout << pre_calc[2][0][0][0][0][0] << endl; */\\n\\n int abs_x = min(sx, gx);\\n int abs_y = min(sy, gy);\\n int hiku_x = abs_x / 2 * 2;\\n int hiku_y = abs_y / 2 * 2;\\n sx -= hiku_x;\\n sy -= hiku_y;\\n gx -= hiku_x;\\n gy -= hiku_y;\\n // cerr << sx << \\\" \\\" << sy << endl;\\n if ( sx < 50 && sy < 50 && gx < 50 && gy < 50 ) {\\n cout << bfs2(sx, sy, gx, gy) << endl; \\n } else { \\n\\n int ans = abs(sx-gx)+abs(sy-gy); \\n int k = 0, l = 0;\\n if (sx == gx + 1) {\\n k = 3;\\n } else if (gx == sx + 1) {\\n k = 4;\\n } else {\\n if ( sx > gx ) k = 1;\\n if ( sx < gx ) k = 2;\\n }\\n\\n \\n if (sy == gy + 1) {\\n l = 3;\\n } else if (gy == sy + 1) {\\n l = 4;\\n } else {\\n if ( sy > gy ) l = 1;\\n if ( sy < gy ) l = 2;\\n }\\n\\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\\n \\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3888,\n \"score_of_the_acc\": -0.4185,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3173_4845747\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <functional>\\n#include <bitset>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\\n\\nstruct state {\\n int x, y, t;\\n state(int x, int y, int t): x(x), y(y), t(t){} \\n};\\n\\nint Sx[5][2] = {{30, 31},\\n\\t\\t{30, 31},\\n\\t\\t{14, 15},\\n\\t\\t{21, 20},\\n\\t\\t{20, 21}};\\nint Sy[5][2] = {{40, 41},\\n\\t\\t{40, 41},\\n\\t\\t{24, 25},\\n\\t\\t{31, 30},\\n\\t\\t{30, 31}};\\nint Gx[5][2] = {{30, 31},\\n\\t\\t{14, 15},\\n\\t\\t{30, 31},\\n\\t\\t{20, 21},\\n\\t\\t{21, 20}};\\nint Gy[5][2] = {{40, 41},\\n\\t\\t{24, 25},\\n\\t\\t{40, 41},\\n\\t\\t{30, 31},\\n\\t\\t{31, 30}};\\n\\nint pre_calc[5][5][2][2][2][2];\\n\\nint bfs(int sx, int sy, int gx, int gy) {\\n bool used[50][50][100];\\n fill_n(**used, 50*50*100, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n \\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return (t - (abs(sx-gx)+abs(sy-gy))); \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nint bfs2(int sx, int sy, int gx, int gy) {\\n bool used[50][50][100];\\n fill_n(**used, 50*50*100, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n \\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return t; \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nsigned main() {\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n\\n for ( int k = 0; k < 5; k++ ) {\\n for ( int l = 0; l < 5; l++ ) {\\n for ( int i = 0; i < (1<<4); i++ ) {\\n\\tint sx = Sx[k][(i>>0)&1];\\n\\tint sy = Sy[l][(i>>1)&1];\\n\\tint gx = Gx[k][(i>>2)&1];\\n\\tint gy = Gy[l][(i>>3)&1];\\t\\n\\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\\n\\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\\n\\t cout << \\\"aaa \\\" << k << \\\" \\\" << l << \\\" \\\" << bfs(sx, sy, gx, gy) << \\\" \\\" << pre_calc[2][0][0][0][0][0] << endl;\\n\\t \\n\\t }*/\\n\\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\\n\\t cout << k << \\\" \\\" << l << \\\" \\\" << sx << \\\" \\\" << sy << \\\" \\\" << gx << \\\" \\\" << gy << endl;\\t \\n\\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\\t \\t \\n\\t }*/\\t\\n }\\n }\\n }\\n\\n int sx, sy, gx, gy;\\n cin >> sx >> sy >> gx >> gy;\\n\\n /*cout << Sx[2][0] << \\\" \\\" << Sy[0][0] << \\\" \\\" << Gx[2][0] << \\\" \\\" << Gy[0][0] << endl;\\n cout << pre_calc[2][0][0][0][0][0] << endl; */\\n\\n int abs_x = min(sx, gx); int abs_y = min(sy, gy);\\n int hiku = min(abs_x, abs_y) / 2 * 2;\\n sx -= hiku;\\n sy -= hiku;\\n gx -= hiku;\\n gy -= hiku;\\n // cerr << sx << \\\" \\\" << sy << endl;\\n if ( sx < 50 && sy < 50 && gx < 50 && gy < 50 ) {\\n cout << bfs2(sx, sy, gx, gy) << endl; \\n } else { \\n\\n int ans = abs(sx-gx)+abs(sy-gy); \\n int k = 0, l = 0;\\n if (sx == gx + 1) {\\n k = 3;\\n } else if (gx == sx + 1) {\\n k = 4;\\n } else {\\n if ( sx > gx ) k = 1;\\n if ( sx < gx ) k = 2;\\n }\\n\\n \\n if (sy == gy + 1) {\\n l = 3;\\n } else if (gy == sy + 1) {\\n l = 4;\\n } else {\\n if ( sy > gy ) l = 1;\\n if ( sy < gy ) l = 2;\\n }\\n\\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\\n \\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.6808510638297872,\n \"time_ms\": 100,\n \"memory_kb\": 3856,\n \"score_of_the_acc\": -0.5357,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3173_4845708\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <functional>\\n#include <bitset>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\\n\\nstruct state {\\n int x, y, t;\\n state(int x, int y, int t): x(x), y(y), t(t){} \\n};\\n\\nint Sx[5][2] = {{30, 31},\\n\\t\\t{30, 31},\\n\\t\\t{14, 15},\\n\\t\\t{21, 20},\\n\\t\\t{20, 21}};\\nint Sy[5][2] = {{40, 41},\\n\\t\\t{40, 41},\\n\\t\\t{24, 25},\\n\\t\\t{31, 30},\\n\\t\\t{30, 31}};\\nint Gx[5][2] = {{30, 31},\\n\\t\\t{14, 15},\\n\\t\\t{30, 31},\\n\\t\\t{20, 21},\\n\\t\\t{21, 20}};\\nint Gy[5][2] = {{40, 41},\\n\\t\\t{24, 25},\\n\\t\\t{40, 41},\\n\\t\\t{30, 31},\\n\\t\\t{31, 30}};\\n\\nint pre_calc[5][5][2][2][2][2];\\n\\nint bfs(int sx, int sy, int gx, int gy) {\\n bool used[50][50][100];\\n fill_n(**used, 50*50*100, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n \\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return (t - (abs(sx-gx)+abs(sy-gy))); \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nint bfs2(int sx, int sy, int gx, int gy) {\\n bool used[50][50][100];\\n fill_n(**used, 50*50*100, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n \\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return t; \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nsigned main() {\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n\\n for ( int k = 0; k < 5; k++ ) {\\n for ( int l = 0; l < 5; l++ ) {\\n for ( int i = 0; i < (1<<4); i++ ) {\\n\\tint sx = Sx[k][(i>>0)&1];\\n\\tint sy = Sy[l][(i>>1)&1];\\n\\tint gx = Gx[k][(i>>2)&1];\\n\\tint gy = Gy[l][(i>>3)&1];\\t\\n\\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\\n\\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\\n\\t cout << \\\"aaa \\\" << k << \\\" \\\" << l << \\\" \\\" << bfs(sx, sy, gx, gy) << \\\" \\\" << pre_calc[2][0][0][0][0][0] << endl;\\n\\t \\n\\t }*/\\n\\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\\n\\t cout << k << \\\" \\\" << l << \\\" \\\" << sx << \\\" \\\" << sy << \\\" \\\" << gx << \\\" \\\" << gy << endl;\\t \\n\\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\\t \\t \\n\\t }*/\\t\\n }\\n }\\n }\\n\\n int sx, sy, gx, gy;\\n cin >> sx >> sy >> gx >> gy;\\n\\n /*cout << Sx[2][0] << \\\" \\\" << Sy[0][0] << \\\" \\\" << Gx[2][0] << \\\" \\\" << Gy[0][0] << endl;\\n cout << pre_calc[2][0][0][0][0][0] << endl; */\\n\\n int abs_x = abs(sx-gx), abs_y = abs(sy-gy);\\n int hiku = min(abs_x, abs_y) / 2 * 2;\\n sx -= hiku;\\n sy -= hiku;\\n gx -= hiku;\\n gy -= hiku;\\n if ( sx < 50 && sy < 50 && gx < 50 && gy < 50 ) {\\n cout << bfs2(sx, sy, gx, gy) << endl; \\n } else { \\n\\n int ans = abs(sx-gx)+abs(sy-gy); \\n int k = 0, l = 0;\\n if (sx == gx + 1) {\\n k = 3;\\n } else if (gx == sx + 1) {\\n k = 4;\\n } else {\\n if ( sx > gx ) k = 1;\\n if ( sx < gx ) k = 2;\\n }\\n\\n \\n if (sy == gy + 1) {\\n l = 3;\\n } else if (gy == sy + 1) {\\n l = 4;\\n } else {\\n if ( sy > gy ) l = 1;\\n if ( sy < gy ) l = 2;\\n }\\n\\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\\n \\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.6808510638297872,\n \"time_ms\": 80,\n \"memory_kb\": 3856,\n \"score_of_the_acc\": -0.4181,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3173_4845695\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <functional>\\n#include <bitset>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\\n\\nstruct state {\\n int x, y, t;\\n state(int x, int y, int t): x(x), y(y), t(t){} \\n};\\n\\nint Sx[5][2] = {{30, 31},\\n\\t\\t{30, 31},\\n\\t\\t{14, 15},\\n\\t\\t{21, 20},\\n\\t\\t{20, 21}};\\nint Sy[5][2] = {{40, 41},\\n\\t\\t{40, 41},\\n\\t\\t{24, 25},\\n\\t\\t{31, 30},\\n\\t\\t{30, 31}};\\nint Gx[5][2] = {{30, 31},\\n\\t\\t{14, 15},\\n\\t\\t{30, 31},\\n\\t\\t{20, 21},\\n\\t\\t{21, 20}};\\nint Gy[5][2] = {{40, 41},\\n\\t\\t{24, 25},\\n\\t\\t{40, 41},\\n\\t\\t{31, 30},\\n\\t\\t{30, 31}};\\n\\nint pre_calc[5][5][2][2][2][2];\\n\\nint bfs(int sx, int sy, int gx, int gy) {\\n bool used[50][50][100];\\n fill_n(**used, 50*50*100, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n \\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return (t - (abs(sx-gx)+abs(sy-gy))); \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nint bfs2(int sx, int sy, int gx, int gy) {\\n bool used[50][50][100];\\n fill_n(**used, 50*50*100, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n \\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return t; \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nsigned main() {\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n\\n for ( int k = 0; k < 5; k++ ) {\\n for ( int l = 0; l < 5; l++ ) {\\n for ( int i = 0; i < (1<<4); i++ ) {\\n\\tint sx = Sx[k][(i>>0)&1];\\n\\tint sy = Sy[l][(i>>1)&1];\\n\\tint gx = Gx[k][(i>>2)&1];\\n\\tint gy = Gy[l][(i>>3)&1];\\t\\n\\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\\n\\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\\n\\t cout << \\\"aaa \\\" << k << \\\" \\\" << l << \\\" \\\" << bfs(sx, sy, gx, gy) << \\\" \\\" << pre_calc[2][0][0][0][0][0] << endl;\\n\\t \\n\\t }*/\\n\\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\\n\\t cout << k << \\\" \\\" << l << \\\" \\\" << sx << \\\" \\\" << sy << \\\" \\\" << gx << \\\" \\\" << gy << endl;\\t \\n\\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\\t \\t \\n\\t }*/\\t\\n }\\n }\\n }\\n\\n int sx, sy, gx, gy;\\n cin >> sx >> sy >> gx >> gy;\\n\\n /*cout << Sx[2][0] << \\\" \\\" << Sy[0][0] << \\\" \\\" << Gx[2][0] << \\\" \\\" << Gy[0][0] << endl;\\n cout << pre_calc[2][0][0][0][0][0] << endl; */\\n\\n int abs_x = abs(sx-gx), abs_y = abs(sy-gy);\\n int hiku = min(abs_x, abs_y) / 2 * 2;\\n sx -= hiku;\\n sy -= hiku;\\n gx -= hiku;\\n gy -= hiku;\\n if ( sx < 50 && sy < 50 && gx < 50 && gy < 50 ) {\\n cout << bfs2(sx, sy, gx, gy) << endl; \\n } else { \\n\\n int ans = abs(sx-gx)+abs(sy-gy); \\n int k = 0, l = 0;\\n if (sx == gx + 1) {\\n k = 3;\\n } else if (gx == sx + 1) {\\n k = 4;\\n } else {\\n if ( sx > gx ) k = 1;\\n if ( sx < gx ) k = 2;\\n }\\n\\n \\n if (sy == gy + 1) {\\n l = 3;\\n } else if (gy == sy + 1) {\\n l = 4;\\n } else {\\n if ( sy > gy ) l = 1;\\n if ( sy < gy ) l = 2;\\n }\\n\\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\\n \\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.6808510638297872,\n \"time_ms\": 90,\n \"memory_kb\": 3856,\n \"score_of_the_acc\": -0.4769,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3173_4845587\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\\n\\nstruct state {\\n int x, y, t;\\n state(int x, int y, int t): x(x), y(y), t(t){} \\n};\\n\\nint Sx[3][2] = {{30, 31},\\n\\t\\t{30, 31},\\n\\t\\t{14, 15}};\\nint Sy[3][2] = {{40, 41},\\n\\t\\t{40, 41},\\n\\t\\t{24, 25}};\\nint Gx[3][2] = {{30, 31},\\n\\t\\t{14, 15},\\n\\t\\t{30, 31}};\\nint Gy[3][2] = {{40, 41},\\n\\t\\t{24, 25},\\n\\t\\t{40, 41}};\\n\\nint pre_calc[3][3][2][2][2][2];\\n\\nint bfs(int sx, int sy, int gx, int gy) {\\n bool used[50][50][100];\\n fill_n(**used, 50*50*100, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n \\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return (t - (abs(sx-gx)+abs(sy-gy))); \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nint bfs2(int sx, int sy, int gx, int gy) {\\n bool used[50][50][100];\\n fill_n(**used, 50*50*100, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n \\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return t; \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nsigned main() {\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n\\n for ( int k = 0; k < 3; k++ ) {\\n for ( int l = 0; l < 3; l++ ) {\\n for ( int i = 0; i < (1<<4); i++ ) {\\n\\tint sx = Sx[k][(i>>0)&1];\\n\\tint sy = Sy[l][(i>>1)&1];\\n\\tint gx = Gx[k][(i>>2)&1];\\n\\tint gy = Gy[l][(i>>3)&1];\\t\\n\\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\\n\\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\\n\\t cout << \\\"aaa \\\" << k << \\\" \\\" << l << \\\" \\\" << bfs(sx, sy, gx, gy) << \\\" \\\" << pre_calc[2][0][0][0][0][0] << endl;\\n\\t \\n\\t }*/\\n\\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\\n\\t cout << k << \\\" \\\" << l << \\\" \\\" << sx << \\\" \\\" << sy << \\\" \\\" << gx << \\\" \\\" << gy << endl;\\t \\n\\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\\t \\t \\n\\t }*/\\t\\n }\\n }\\n }\\n\\n int sx, sy, gx, gy;\\n cin >> sx >> sy >> gx >> gy;\\n\\n /*cout << Sx[2][0] << \\\" \\\" << Sy[0][0] << \\\" \\\" << Gx[2][0] << \\\" \\\" << Gy[0][0] << endl;\\n cout << pre_calc[2][0][0][0][0][0] << endl; */\\n\\n int abs_x = abs(sx-gx), abs_y = abs(sy-gy);\\n int hiku = min(abs_x, abs_y) / 2 * 2;\\n sx -= hiku;\\n sy -= hiku;\\n gx -= hiku;\\n gy -= hiku;\\n if ( sx < 50 && sy < 50 && gx < 50 && gy < 50 ) {\\n cout << bfs2(sx, sy, gx, gy) << endl; \\n } else { \\n\\n int ans = abs(sx-gx)+abs(sy-gy); \\n int k = 0, l = 0;\\n if ( sx > gx ) k = 1;\\n if ( sx < gx ) k = 2;\\n if ( sy > gy ) l = 1;\\n if ( sy < gy ) l = 2;\\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\\n \\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.6170212765957447,\n \"time_ms\": 50,\n \"memory_kb\": 3892,\n \"score_of_the_acc\": -0.2421,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3173_4845454\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\\n\\nstruct state {\\n int x, y, t;\\n state(int x, int y, int t): x(x), y(y), t(t){} \\n};\\n\\nint Sx[3][2] = {{30, 31},\\n\\t\\t{30, 31},\\n\\t\\t{14, 15}};\\nint Sy[3][2] = {{40, 41},\\n\\t\\t{40, 41},\\n\\t\\t{24, 25}};\\nint Gx[3][2] = {{30, 31},\\n\\t\\t{14, 15},\\n\\t\\t{30, 31}};\\nint Gy[3][2] = {{40, 41},\\n\\t\\t{24, 25},\\n\\t\\t{40, 41}};\\n\\nint pre_calc[3][3][2][2][2][2];\\n\\nint bfs(int sx, int sy, int gx, int gy) {\\n bool used[50][50][100];\\n fill_n(**used, 50*50*100, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n \\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return (t - (abs(sx-gx)+abs(sy-gy))); \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 100 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nsigned main() {\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n\\n for ( int k = 0; k < 3; k++ ) {\\n for ( int l = 0; l < 3; l++ ) {\\n for ( int i = 0; i < (1<<4); i++ ) {\\n\\tint sx = Sx[k][(i>>0)&1];\\n\\tint sy = Sy[l][(i>>1)&1];\\n\\tint gx = Gx[k][(i>>2)&1];\\n\\tint gy = Gy[l][(i>>3)&1];\\t\\n\\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\\n\\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\\n\\t cout << \\\"aaa \\\" << k << \\\" \\\" << l << \\\" \\\" << bfs(sx, sy, gx, gy) << \\\" \\\" << pre_calc[2][0][0][0][0][0] << endl;\\n\\t \\n\\t }*/\\n\\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\\n\\t cout << k << \\\" \\\" << l << \\\" \\\" << sx << \\\" \\\" << sy << \\\" \\\" << gx << \\\" \\\" << gy << endl;\\t \\n\\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\\t \\t \\n\\t }*/\\t\\n }\\n }\\n }\\n\\n int sx, sy, gx, gy;\\n cin >> sx >> sy >> gx >> gy;\\n\\n /*cout << Sx[2][0] << \\\" \\\" << Sy[0][0] << \\\" \\\" << Gx[2][0] << \\\" \\\" << Gy[0][0] << endl;\\n cout << pre_calc[2][0][0][0][0][0] << endl; */ \\n\\n int ans = abs(sx-gx)+abs(sy-gy); \\n int k = 0, l = 0;\\n if ( sx > gx ) k = 1;\\n if ( sx < gx ) k = 2;\\n if ( sy > gy ) l = 1;\\n if ( sy < gy ) l = 2;\\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.6170212765957447,\n \"time_ms\": 60,\n \"memory_kb\": 3876,\n \"score_of_the_acc\": -0.3007,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3173_4845451\",\n \"code_snippet\": \"#pragma target(\\\"avx\\\")\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef pair<ll, ll> P;\\ntypedef vector<ll> V;\\ntypedef unordered_map<ll, ll> U_MAP;\\ntypedef priority_queue<ll> pq;\\ntypedef priority_queue<ll, vector<ll>, greater<ll>> rpq;\\nconstexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;\\nconstexpr ll LINF = 1e18;\\n\\n#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)\\n#define rrep(i, a, b) for (ll i = (a); i < (b); i++)\\n#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)\\n#define all(v) (v).begin(), (v).end()\\n#define Size(n) (n).size()\\n#define Cout(x) cout << (x) << endl\\n#define doublecout(a) cout << fixed << setprecision(15) << a << endl;\\n#define fi first\\n#define se second\\n#define m_p make_pair\\n#define p_b push_back\\nstring to_string(string s) { return '\\\"' + s + '\\\"'; }\\nstring to_string(const char* s) { return to_string((string)s); }\\nstring to_string(bool b) { return (b ? \\\"true\\\" : \\\"false\\\"); }\\ntemplate <typename A, typename B>\\nstring to_string(pair<A, B> p) {\\n return \\\"(\\\" + to_string(p.first) + \\\", \\\" + to_string(p.second) + \\\")\\\";\\n}\\ntemplate <typename A>\\nstring to_string(A v) {\\n bool first = true;\\n string res = \\\"{\\\";\\n for (const auto& x : v) {\\n if (!first) {\\n res += \\\", \\\";\\n }\\n first = false;\\n res += to_string(x);\\n }\\n res += \\\"}\\\";\\n return res;\\n}\\nvoid debug_out() { cerr << endl; }\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n cerr << \\\" \\\" << to_string(H);\\n debug_out(T...);\\n}\\n#define debug(...) cerr << \\\"[\\\" << #__VA_ARGS__ << \\\"]:\\\", debug_out(__VA_ARGS__)\\n\\n//------ Believe yourself as a genius!!!!!! ------\\n\\nint dy[] = {1, 0, -1, 0};\\nint dx[] = {0, 1, 0, -1};\\n// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};\\nstring alph(\\\"abcdefghijklmnopqrstuvwxyz\\\"), s;\\nll n, cnt, ans, a, b, c, d, tmp, m, h, w, x, y, sum, k, q, sx, sy, gx, gy;\\nll dat[210][210][210];\\n\\nint main(void) {\\n cin.tie(0);\\n cout.tie(0);\\n ios::sync_with_stdio(false);\\n\\n cin >> sx >> sy >> gx >> gy;\\n if (abs(gy - sy) + abs(gx - sx) <= 50) {\\n tmp = abs(sx - gx);\\n if (min(sx, gx) % 2 == 1) {\\n if (sx < gx) {\\n sx = 1;\\n gx = sx + tmp;\\n } else {\\n gx = 1;\\n sx = gx + tmp;\\n }\\n } else {\\n if (sx < gx) {\\n sx = 0;\\n gx = sx + tmp;\\n } else {\\n gx = 0;\\n sx = gx + tmp;\\n }\\n }\\n tmp = abs(sy - gy);\\n if (min(sy, gy) % 2 == 1) {\\n if (sy < gy) {\\n sy = 1;\\n gy = sy + tmp;\\n } else {\\n gy = 1;\\n sy = gy + tmp;\\n }\\n } else {\\n if (sy < gy) {\\n sy = 0;\\n gy = sy + tmp;\\n } else {\\n gy = 0;\\n sy = gy + tmp;\\n }\\n }\\n priority_queue<pair<P, P>, vector<pair<P, P>>, greater<pair<P, P>>> que;\\n que.push({{0, 0}, {sy, sx}});\\n ans = INF;\\n rep(i, 200) rep(j, 200) rep(k, 200) dat[i][j][k] = INF;\\n dat[0][sy][sx] = 0;\\n\\n while (1) {\\n if (que.empty()) break;\\n pair<P, P> X;\\n X = que.top();\\n que.pop();\\n\\n int time = X.fi.se, nowy = X.se.fi, nowx = X.se.se, cost = X.fi.fi;\\n // cout << time << \\\" \\\" << nowx << \\\" \\\" << nowy << \\\"\\\\n\\\";\\n\\n if (dat[time][nowy][nowx] < cost) continue;\\n\\n if (time % 2 == 0) {\\n if (dat[time + 1][nowy][nowx - 1] > cost + 1 && nowx - 1 >= 0) {\\n que.push({{cost + 1, time + 1}, {nowy, nowx - 1}});\\n dat[time + 1][nowy][nowx - 1] = cost + 1;\\n }\\n if (dat[time + 1][nowy][nowx + 1] > cost + 1 && nowx + 1 < 200) {\\n que.push({{cost + 1, time + 1}, {nowy, nowx + 1}});\\n dat[time + 1][nowy][nowx + 1] = cost + 1;\\n }\\n } else {\\n if (dat[time + 1][nowy - 1][nowx] > cost + 1 && nowy - 1 >= 0) {\\n que.push({{cost + 1, time + 1}, {nowy - 1, nowx}});\\n dat[time + 1][nowy - 1][nowx] = cost + 1;\\n }\\n if (dat[time + 1][nowy + 1][nowx] > cost + 1 && nowy + 1 < 200) {\\n que.push({{cost + 1, time + 1}, {nowy + 1, nowx}});\\n dat[time + 1][nowy + 1][nowx] = cost + 1;\\n }\\n }\\n if (nowx % 2 == 0) {\\n if (dat[time + 1][nowy][nowx + 1] > cost + 1 && nowx + 1 < 200) {\\n que.push({{cost + 1, time + 1}, {nowy, nowx + 1}});\\n dat[time + 1][nowy][nowx + 1] = cost + 1;\\n }\\n } else {\\n if (dat[time + 1][nowy][nowx - 1] > cost + 1 && nowx - 1 >= 0) {\\n que.push({{cost + 1, time + 1}, {nowy, nowx - 1}});\\n dat[time + 1][nowy][nowx - 1] = cost + 1;\\n }\\n }\\n if (nowy % 2 == 0) {\\n if (dat[time + 1][nowy + 1][nowx] > cost + 1 && nowy + 1 < 200) {\\n que.push({{cost + 1, time + 1}, {nowy + 1, nowx}});\\n dat[time + 1][nowy + 1][nowx] = cost + 1;\\n }\\n } else {\\n if (dat[time + 1][nowy - 1][nowx] > cost + 1 && nowy - 1 >= 0) {\\n que.push({{cost + 1, time + 1}, {nowy - 1, nowx}});\\n dat[time + 1][nowy - 1][nowx] = cost + 1;\\n }\\n }\\n if (dat[time + 1][nowy][nowx] > cost + 1) {\\n que.push({{cost + 1, time + 1}, {nowy, nowx}});\\n dat[time + 1][nowy][nowx] = cost + 1;\\n }\\n }\\n rep(i, 200) ans = min(ans, dat[i][gy][gx]);\\n Cout(ans);\\n return 0;\\n }\\n if (sx == gx && sy == gy) {\\n Cout(0);\\n } else if (sx < gx && sy < gy) {\\n Cout(abs(gy - sy) + abs(gx - sx));\\n } else if (sx < gx && sy > gy) {\\n Cout(abs(gy - sy) + abs(gx - sx));\\n } else if (sx > gx && sy < gy) {\\n Cout(abs(gy - sy) + abs(gx - sx));\\n } else if (sx > gx && sy > gy) {\\n Cout(abs(gy - sy) + abs(gx - sx)); //さぼった\\n } else {\\n if (sx == gx) {\\n if (sy < gy) {\\n if (sy % 2 == 1)\\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\\n else\\n Cout(abs(gy - sy) + abs(gx - sx));\\n } else {\\n if (sy % 2 == 0)\\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\\n else\\n Cout(abs(gy - sy) + abs(gx - sx));\\n }\\n } else {\\n if (sx < gx) {\\n if (sx % 2 == 0)\\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\\n else\\n Cout(abs(gy - sy) + abs(gx - sx));\\n } else {\\n if (sx % 2 == 1)\\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\\n else\\n Cout(abs(gy - sy) + abs(gx - sx));\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 70656,\n \"score_of_the_acc\": -2,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3173_4845405\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n#define REP(i, n) for ( int i = 0; i < (n); i++ )\\n\\nstruct state {\\n int x, y, t;\\n state(int x, int y, int t): x(x), y(y), t(t){} \\n};\\n\\nint Sx[3][2] = {{30, 31},\\n\\t\\t{30, 31},\\n\\t\\t{14, 15}};\\nint Sy[3][2] = {{40, 41},\\n\\t\\t{40, 41},\\n\\t\\t{24, 25}};\\nint Gx[3][2] = {{30, 31},\\n\\t\\t{14, 15},\\n\\t\\t{30, 31}};\\nint Gy[3][2] = {{40, 41},\\n\\t\\t{24, 25},\\n\\t\\t{40, 41}};\\n\\nint pre_calc[3][3][2][2][2][2];\\n\\nint bfs(int sx, int sy, int gx, int gy) {\\n bool used[50][50][50];\\n fill_n(**used, 50*50*50, false); \\n queue<state> Q;\\n Q.push(state(sx, sy, 0));\\n while ( !Q.empty() ) {\\n int x = Q.front().x; \\n int y = Q.front().y;\\n int t = Q.front().t;\\n Q.pop();\\n\\n if ( x == gx && y == gy ) {\\n // if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) cout << t << \\\" \\\" << (abs(sx-gx)+abs(sy-gy)) << endl; \\n return (t - (abs(sx-gx)+abs(sy-gy))); \\n break;\\t\\n }\\n\\n if ( x < 0 || y < 0 || t < 0 || x >= 50 || y >= 50 || t >= 50 ) continue; \\n \\n if ( used[y][x][t] ) continue;\\n used[y][x][t] = true; \\n\\n if ( x%2 == 0 || t%2 == 0 ) {\\n Q.push(state(x+1, y, t+1));\\t\\n }\\n if ( x%2 == 1 || t%2 == 0 ) {\\n Q.push(state(x-1, y, t+1));\\t\\n }\\n if ( y%2 == 0 || t%2 == 1 ) {\\n Q.push(state(x, y+1, t+1));\\t\\n }\\n if ( y%2 == 1 || t%2 == 1 ) {\\n Q.push(state(x, y-1, t+1));\\t\\n }\\n Q.push(state(x, y, t+1)); \\n }\\n\\n return 0; \\n}\\n\\nsigned main() {\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n\\n for ( int k = 0; k < 3; k++ ) {\\n for ( int l = 0; l < 3; l++ ) {\\n for ( int i = 0; i < (1<<4); i++ ) {\\n\\tint sx = Sx[k][(i>>0)&1];\\n\\tint sy = Sy[l][(i>>1)&1];\\n\\tint gx = Gx[k][(i>>2)&1];\\n\\tint gy = Gy[l][(i>>3)&1];\\t\\n\\tpre_calc[k][l][sx%2][sy%2][gx%2][gy%2] = bfs(sx, sy, gx, gy);\\n\\t/*if ( sx == 14 && sy == 40 && gx == 30 && gy == 40 ) {\\n\\t cout << \\\"aaa \\\" << k << \\\" \\\" << l << \\\" \\\" << bfs(sx, sy, gx, gy) << \\\" \\\" << pre_calc[2][0][0][0][0][0] << endl;\\n\\t \\n\\t }*/\\n\\t/*if ( k == 2 && l == 0 && sx%2 == 0 && sy%2 == 0 && gx%2 == 0 && gy%2 == 0 ) {\\n\\t cout << k << \\\" \\\" << l << \\\" \\\" << sx << \\\" \\\" << sy << \\\" \\\" << gx << \\\" \\\" << gy << endl;\\t \\n\\t cout << pre_calc[k][l][sx%2][sy%2][gx%2][gy%2] << endl;\\t \\t \\n\\t }*/\\t\\n }\\n }\\n }\\n\\n int sx, sy, gx, gy;\\n cin >> sx >> sy >> gx >> gy;\\n\\n /*cout << Sx[2][0] << \\\" \\\" << Sy[0][0] << \\\" \\\" << Gx[2][0] << \\\" \\\" << Gy[0][0] << endl;\\n cout << pre_calc[2][0][0][0][0][0] << endl; */ \\n\\n int ans = abs(sx-gx)+abs(sy-gy); \\n int k = 0, l = 0;\\n if ( sx > gx ) k = 1;\\n if ( sx < gx ) k = 2;\\n if ( sy > gy ) l = 1;\\n if ( sy < gy ) l = 2;\\n ans += pre_calc[k][l][sx%2][sy%2][gx%2][gy%2];\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.6170212765957447,\n \"time_ms\": 50,\n \"memory_kb\": 3756,\n \"score_of_the_acc\": -0.2401,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3173_4845394\",\n \"code_snippet\": \"#pragma target(\\\"avx\\\")\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef pair<ll, ll> P;\\ntypedef vector<ll> V;\\ntypedef unordered_map<ll, ll> U_MAP;\\ntypedef priority_queue<ll> pq;\\ntypedef priority_queue<ll, vector<ll>, greater<ll>> rpq;\\nconstexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;\\nconstexpr ll LINF = 1e18;\\n\\n#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)\\n#define rrep(i, a, b) for (ll i = (a); i < (b); i++)\\n#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)\\n#define all(v) (v).begin(), (v).end()\\n#define Size(n) (n).size()\\n#define Cout(x) cout << (x) << endl\\n#define doublecout(a) cout << fixed << setprecision(15) << a << endl;\\n#define fi first\\n#define se second\\n#define m_p make_pair\\n#define p_b push_back\\nstring to_string(string s) { return '\\\"' + s + '\\\"'; }\\nstring to_string(const char* s) { return to_string((string)s); }\\nstring to_string(bool b) { return (b ? \\\"true\\\" : \\\"false\\\"); }\\ntemplate <typename A, typename B>\\nstring to_string(pair<A, B> p) {\\n return \\\"(\\\" + to_string(p.first) + \\\", \\\" + to_string(p.second) + \\\")\\\";\\n}\\ntemplate <typename A>\\nstring to_string(A v) {\\n bool first = true;\\n string res = \\\"{\\\";\\n for (const auto& x : v) {\\n if (!first) {\\n res += \\\", \\\";\\n }\\n first = false;\\n res += to_string(x);\\n }\\n res += \\\"}\\\";\\n return res;\\n}\\nvoid debug_out() { cerr << endl; }\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n cerr << \\\" \\\" << to_string(H);\\n debug_out(T...);\\n}\\n#define debug(...) cerr << \\\"[\\\" << #__VA_ARGS__ << \\\"]:\\\", debug_out(__VA_ARGS__)\\n\\n//------ Believe yourself as a genius!!!!!! ------\\n\\nint dy[] = {1, 0, -1, 0};\\nint dx[] = {0, 1, 0, -1};\\n// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};\\nstring alph(\\\"abcdefghijklmnopqrstuvwxyz\\\"), s;\\nll n, cnt, ans, a, b, c, d, tmp, m, h, w, x, y, sum, k, q, sx, sy, gx, gy;\\nll dat[210][210][210];\\n\\nint main(void) {\\n cin.tie(0);\\n cout.tie(0);\\n ios::sync_with_stdio(false);\\n\\n cin >> sx >> sy >> gx >> gy;\\n if (abs(gy - sy) + abs(gx - sx) <= 50) {\\n tmp = abs(sx - gx);\\n if (min(sx, gx) % 2 == 1) {\\n if (sx < gx) {\\n sx = 1;\\n gx = sx + tmp;\\n } else {\\n gx = 1;\\n sx = gx + tmp;\\n }\\n } else {\\n if (sx < gx) {\\n sx = 0;\\n gx = sx + tmp;\\n } else {\\n gx = 0;\\n sx = gx + tmp;\\n }\\n }\\n tmp = abs(sy - gy);\\n if (min(sy, gy) % 2 == 1) {\\n if (sy < gy) {\\n sy = 1;\\n gy = sy + tmp;\\n } else {\\n gy = 1;\\n sy = gy + tmp;\\n }\\n } else {\\n if (sy < gy) {\\n sy = 0;\\n gy = sy + tmp;\\n } else {\\n gy = 0;\\n sy = gy + tmp;\\n }\\n }\\n priority_queue<pair<P, P>, vector<pair<P, P>>, greater<pair<P, P>>> que;\\n que.push({{0, 0}, {sy, sx}});\\n ans = INF;\\n rep(i, 200) rep(j, 200) rep(k, 200) dat[i][j][k] = INF;\\n dat[0][sy][sx] = 0;\\n\\n while (1) {\\n if (que.empty()) break;\\n pair<P, P> X;\\n X = que.top();\\n que.pop();\\n\\n int time = X.fi.se, nowy = X.se.fi, nowx = X.se.se, cost = X.fi.fi;\\n // cout << time << \\\" \\\" << nowx << \\\" \\\" << nowy << \\\"\\\\n\\\";\\n\\n if (dat[time][nowy][nowx] < cost) continue;\\n\\n if (time % 2 == 0) {\\n if (dat[time + 1][nowy][nowx - 1] > cost + 1 && nowx - 1 >= 0) {\\n que.push({{cost + 1, time + 1}, {nowy, nowx - 1}});\\n dat[time + 1][nowy][nowx - 1] = cost + 1;\\n }\\n if (dat[time + 1][nowy][nowx + 1] > cost + 1 && nowx + 1 < 200) {\\n que.push({{cost + 1, time + 1}, {nowy, nowx + 1}});\\n dat[time + 1][nowy][nowx + 1] = cost + 1;\\n }\\n } else {\\n if (dat[time + 1][nowy - 1][nowx] > cost + 1 && nowy - 1 >= 0) {\\n que.push({{cost + 1, time + 1}, {nowy - 1, nowx}});\\n dat[time + 1][nowy - 1][nowx] = cost + 1;\\n }\\n if (dat[time + 1][nowy + 1][nowx] > cost + 1 && nowy + 1 < 200) {\\n que.push({{cost + 1, time + 1}, {nowy + 1, nowx}});\\n dat[time + 1][nowy + 1][nowx] = cost + 1;\\n }\\n }\\n if (nowx % 2 == 0) {\\n if (dat[time + 1][nowy][nowx + 1] > cost + 1 && nowx + 1 < 200) {\\n que.push({{cost + 1, time + 1}, {nowy, nowx + 1}});\\n dat[time + 1][nowy][nowx + 1] = cost + 1;\\n }\\n } else {\\n if (dat[time + 1][nowy][nowx - 1] > cost + 1 && nowx - 1 >= 0) {\\n que.push({{cost + 1, time + 1}, {nowy, nowx - 1}});\\n dat[time + 1][nowy][nowx - 1] = cost + 1;\\n }\\n }\\n if (nowy % 2 == 0) {\\n if (dat[time + 1][nowy + 1][nowx] > cost + 1 && nowy + 1 < 200) {\\n que.push({{cost + 1, time + 1}, {nowy + 1, nowx}});\\n dat[time + 1][nowy + 1][nowx] = cost + 1;\\n }\\n } else {\\n if (dat[time + 1][nowy - 1][nowx] > cost + 1 && nowy - 1 >= 0) {\\n que.push({{cost + 1, time + 1}, {nowy - 1, nowx}});\\n dat[time + 1][nowy - 1][nowx] = cost + 1;\\n }\\n }\\n if (dat[time + 1][nowy][nowx] > cost + 1) {\\n que.push({{cost + 1, time + 1}, {nowy, nowx}});\\n dat[time + 1][nowy][nowx] = cost + 1;\\n }\\n }\\n rep(i, 200) ans = min(ans, dat[i][gy][gx]);\\n Cout(ans);\\n return 0;\\n }\\n if (sx == gx && sy == gy) {\\n Cout(0);\\n } else if (sx < gx && sy < gy) {\\n Cout(abs(gy - sy) + abs(gx - sx));\\n } else if (sx < gx && sy > gy) {\\n Cout(abs(gy - sy) + abs(gx - sx));\\n } else if (sx > gx && sy < gy) {\\n Cout(abs(gy - sy) + abs(gx - sx));\\n } else if (sx < gx && sy < gy) {\\n Cout(abs(gy - sy) + abs(gx - sx)); //さぼった\\n } else {\\n if (sx == gx) {\\n if (sy < gy) {\\n if (sy % 2 == 1)\\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\\n else\\n Cout(abs(gy - sy) + abs(gx - sx));\\n } else {\\n if (sy % 2 == 0)\\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\\n else\\n Cout(abs(gy - sy) + abs(gx - sx));\\n }\\n } else {\\n if (sx < gx) {\\n if (sx % 2 == 0)\\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\\n else\\n Cout(abs(gy - sy) + abs(gx - sx));\\n } else {\\n if (sx % 2 == 1)\\n Cout(abs(gy - sy) + abs(gx - sx) + 1);\\n else\\n Cout(abs(gy - sy) + abs(gx - sx));\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.2765957446808511,\n \"time_ms\": 170,\n \"memory_kb\": 70352,\n \"score_of_the_acc\": -1.9367,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1985,"cells":{"group_id":{"kind":"string","value":"aoj_3174_cpp"},"problem_description":{"kind":"string","value":"C - No Palindromes\n問題文\numg くんは長さ $N$ の英小文字からなる文字列 $S$ を持っています。\numg くんは回文が苦手なので、$S$ の文字を自由に並び替えて、次の条件を満たす文字列 $T$ を作ることにしました。\n$T$ のどの長さ $2$ 以上の連続する部分文字列も回文ではない。\nこのような $T$ が存在するかどうか判定し、存在するならば $1$ つ求めてください。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$\n$S$\n制約\n$1 \\leq N \\leq 10^5$\n$S$ は英小文字からなる長さ $N$ の文字列である。\n出力\n条件を満たす文字列 $T$ が存在しない場合は、\n-1\nを出力せよ。\nそうでない場合は、$T$ を $1$ つ出力せよ。\n条件を満たす $T$ は複数存在するかもしれないが、それらのうちのどれを出力しても正答となる。\n入力例 1\n3\naba\n出力例 1\n-1\n$S =$\naba\nを並び替えて作れる文字列は次の $3$ つです。\naab\n部分文字列\naa\nは回文である。\naba\n部分文字列\naba\nは回文である。\nbaa\n部分文字列\naa\nは回文である。\nこれらはすべて条件を満たさないので、$T$ は存在しません。\n入力例 2\n6\nbamboo\n出力例 2\nboamob\nboamob\nのどの連続する長さ $2$ 以上の部分文字列も回文ではないので、これが $T$ の $1$ つとなります。\n入力例 3\n14\ntakeyabuyaketa\n出力例 3\ntakeyabuyaketa"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3174_4875827","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=Int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n Int n;\n cin>>n;\n string s;\n cin>>s;\n\n vector<Int> cnt(26,0);\n for(char c:s) cnt[c-'a']++;\n\n string ans;\n ans+='?';\n ans+='!';\n for(Int i=0;i<n;i++){\n using P = pair<Int, char>;\n vector<P> vp;\n for(Int j=0;j<26;j++)\n vp.emplace_back(cnt[j],'a'+j);\n sort(vp.rbegin(),vp.rend());\n for(auto p:vp){\n if(p.first==0) continue;\n if(ans[i+0]==p.second) continue;\n if(ans[i+1]==p.second) continue;\n ans+=p.second;\n cnt[p.second-'a']--;\n break;\n }\n if((Int)ans.size()!=i+3) drop(-1);\n }\n ans.erase(ans.begin());\n ans.erase(ans.begin());\n\n cout<<ans<<newl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3840,"score_of_the_acc":-0.1449,"final_rank":11},{"submission_id":"aoj_3174_4846691","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\n{ for(auto it : P) { s << \"<\" << it << \"> \"; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for(auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s << endl; }\n\n\nstring solve(int N, const string &S) {\n map<char,int> ma;\n for (auto c : S) ma[c]++;\n if (ma.size() == 1) {\n if (N == 1) return S;\n else return \"-1\";\n }\n else if (ma.size() == 2) {\n if (N == 2) return S;\n else return \"-1\";\n }\n else {\n string res = \"\";\n while (!ma.empty()) {\n int vmax = -1;\n char pmax;\n for (auto it : ma) {\n if (res.size() > 0 && res.back() == it.first) continue;\n if (res.size() > 1 && res[res.size() - 2] == it.first) continue;\n if (chmax(vmax, it.second)) pmax = it.first;\n }\n if (vmax == -1) return \"-1\";\n res += pmax;\n ma[pmax]--;\n if (ma[pmax] == 0) ma.erase(pmax);\n }\n return res;\n }\n}\n\nint main() {\n int N;\n string S;\n cin >> N >> S;\n cout << solve(N, S) << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3440,"score_of_the_acc":-0.0051,"final_rank":2},{"submission_id":"aoj_3174_4846656","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> l_l;\ntypedef pair<int, int> i_i;\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nconst long long INF = 1e18;\n//const ll mod = 1000000007;\nll N;\nstring S;\nmap<char, ll> mp;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cin >> N;\n cin >> S;\n for(int i = 0; i < N; i++) {\n mp[S[i]]++;\n }\n string ans;\n for(int i = 0; i < N; i++) {\n char tmp = '#';\n for(char a = 'a'; a <= 'z'; a++) {\n if(i >= 2 and ans[i-2] == a) continue;\n if(i >= 1 and ans[i-1] == a) continue;\n if(mp[tmp] < mp[a]) tmp = a;\n }\n if(tmp == '#') {\n cout << -1 << endl;\n return 0;\n }\n ans.push_back(tmp);\n mp[tmp]--;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3628,"score_of_the_acc":-0.0724,"final_rank":7},{"submission_id":"aoj_3174_4846647","code_snippet":"// Sに含まれるアルファベットのうち\n// 過半数以上のアルファベット文字があったらだめ\n// そうじゃなかったら絶対作れそう？\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N;\n string S;\n cin >> N >> S;\n vector<int> alphabet('z' - 'a' + 1, 0);\n for(char ch: S) ++alphabet[ch - 'a'];\n // for(int num: alphabet) {\n // if(num > N/2) {\n // cout << -1 << endl;\n // return 0;\n // }\n // }\n\n // 構築\n // 同じ文字が隣りあってはダメ\n // 長さ3→両端同じはだめ\n string res = \"\";\n \n // int r = 0;\n // for(int i = 0; i < N; ++i) {\n // while(alphabet[r] == 0) {\n // r = (r + 1)%('z' - 'a' + 1);\n // }\n // res += (char)('a' + r);\n // --alphabet[r];\n // r = (r+1)%('z' - 'a' + 1);\n // }\n\n vector<pair<int,int>> alp('z' - 'a' + 1);\n for(int i = 0; i < 'z' - 'a' + 1; ++i) {\n alp[i].first = alphabet[i];\n alp[i].second = i;\n }\n sort(alp.rbegin(), alp.rend());\n for(int i = 0; i < N; ++i) {\n set<char> prev;\n if(i-1 >= 0) prev.insert(res[i-1]);\n if(i-2 >= 0) prev.insert(res[i-2]);\n bool flg = false;\n for(int r = 0; r < 'z' - 'a' + 1; ++r) {\n if(alp[r].first > 0 && prev.find((char)(alp[r].second + 'a')) == prev.end()) {\n res += (char)(alp[r].second + 'a');\n --alp[r].first;\n flg = true;\n break;\n }\n }\n if(!flg) {\n cout << -1 << endl;\n return 0;\n }\n sort(alp.rbegin(), alp.rend());\n }\n\n for(int i = 0; i < N-1; ++i) {\n if(res[i] == res[i+1]) {\n cout << -1 << endl;\n return 0;\n }\n }\n for(int i = 0; i < N-2; ++i) {\n if(res[i] == res[i+2]) {\n cout << -1 << endl;\n return 0;\n }\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3452,"score_of_the_acc":-0.0347,"final_rank":5},{"submission_id":"aoj_3174_4845381","code_snippet":"#pragma GCC optimize(\"Ofast\", \"unroll-loops\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n\nstruct info{\n\tchar c = ' ';\n\tint idx = 0;\n\tint cnt = 0;\n};\n\nint N;\nstring S;\n\nvoid input(void){\n\tcin >> N >> S;\n}\n\nint main(void){\n\tinput();\n\tstring res = \"\";\n\tvector<info> infos(26);\n\tfor (int i = 0; i < 26; ++i){\n\t\tinfos[i].c = (char)('a' + i);\n\t}\n\tfor (int i = 0; i < N; ++i){\n\t\tint idx = S[i] - 'a';\n\t\tinfos[idx].cnt++;\n\t}\n\n\tpriority_queue<info, vector<info>, function<bool(info, info)>> waiting(\n\t\t[](info i1, info i2){ return i1.idx > i2.idx; }\n\t);\n\tpriority_queue<info, vector<info>, function<bool(info, info)>> ok(\n\t\t[](info i1, info i2){ return i1.cnt < i2.cnt; }\n\t);\n\n\tfor (auto i : infos)\n\t\tif (i.cnt)\n\t\t\tok.push(i);\n\n\tfor (int i = 0; i < N; ++i){\n\t\twhile (waiting.size()){\n\t\t\tinfo t = waiting.top();\n\t\t\tif (t.idx <= i){\n\t\t\t\tok.push(t);\n\t\t\t\twaiting.pop();\n\t\t\t}\n\t\t\telse break;\n\t\t}\n\t\tif (ok.size() == 0){\n\t\t\tcout << -1 << endl;\n\t\t\treturn 0;\n\t\t}\n\t\tinfo t = ok.top();\n\t\tok.pop();\n\t\tres += t.c;\n\t\tt.cnt--;\n\t\tt.idx = i + 3;\n\t\tif (t.cnt)\n\t\t\twaiting.push(t);\n\t}\n\n\tcout << res << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3440,"score_of_the_acc":-0.0051,"final_rank":2},{"submission_id":"aoj_3174_4845155","code_snippet":"#line 2 \"cpplib/util/template.hpp\"\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target(\"avx\")\n#include<bits/stdc++.h>\nusing namespace std;\nstruct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;\ntypedef long long lint;\n#define INF (1LL<<60)\n#define IINF (1<<30)\n#define EPS (1e-10)\n#define endl ('\\n')\ntypedef vector<lint> vec;\ntypedef vector<vector<lint>> mat;\ntypedef vector<vector<vector<lint>>> mat3;\ntypedef vector<string> svec;\ntypedef vector<vector<string>> smat;\ntemplate<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?\" \":\"\")<<i<INF/2?i:\"INF\";f=1;}cout<<endl;}\ntemplate<typename T>inline void numout2(T t){for(auto i:t)numout(i);}\ntemplate<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?\" \":\"\")<<i;f=1;}cout<<endl;}\ntemplate<typename T>inline void output2(T t){for(auto i:t)output(i);}\ntemplate<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?\"\":\" \"<<t[i];f=1;}cout<<endl;}\ntemplate<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}\n#define rep(i,...) for(auto i:range(__VA_ARGS__)) \n#define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))\n#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)\n#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)\n#define irep(i) for(lint i=0;;++i)\ninline vector<long long> range(long long n){vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}\ninline vector<long long> range(long long a,long long b){vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}\ninline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}\ntemplate<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}\n#define all(n) begin(n),end(n)\ntemplate<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}\ntemplate<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}\nconst vector<lint> dx={1,0,-1,0,1,1,-1,-1};\nconst vector<lint> dy={0,1,0,-1,1,-1,1,-1};\n#define SUM(v) accumulate(all(v),0LL)\ntemplate<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}\n#line 2 \"code.cpp\"\n\nint main(){\n lint n;\n cin>>n;\n string s;\n cin>>s;\n map<char,lint>m;\n rep(i,n){\n m[s[i]]++;\n }\n multiset<pair<char,lint>>v;\n sort(all(s),[&](auto s,auto t){return m[s]==m[t]?s>t:m[s]>m[t];});\n string ans(n,'#');\n vector<lint>b(n,0);\n lint now=0;\n rep(i,n){\n while(b[now%n])now++;\n ans[now%n]=s[i];\n b[now%n]=1;\n now+=3;\n }\n for(int i=0;i<n-1;++i){\n if(ans[i]==ans[i+1]){\n cout<<-1<<endl;\n return 0;\n }\n }\n for(int i=0;i<n-2;++i){\n if(ans[i]==ans[i+2]){\n cout<<-1<<endl;\n return 0;\n }\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":30,"memory_kb":4764,"score_of_the_acc":-0.3428,"final_rank":12},{"submission_id":"aoj_3174_4844826","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\n#define reps(i, n) for (int i = 1; i <= (int) (n); i++)\n#define all(x) (x).begin(), (x).end()\n#define uniq(x) (x).erase(unique(all(x)), (x).end())\n#define bit(n) (1LL << (n))\n#define dump(x) cerr << #x \" = \" << (x) << endl\nusing vint = vector<int>;\nusing vvint = vector<vint>;\nusing pint = pair<int, int>;\nusing vpint = vector<pint>;\ntemplate<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\nconstexpr double PI = 3.1415926535897932384626433832795028;\nconstexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};\nconstexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};\nint sign(int x) { return (x > 0) - (x < 0); }\nint gcd(int a, int b) {\n while (b) { swap(a %= b, b); }\n return a;\n}\nint lcm(int a, int b) { return a / gcd(a, b) * b; }\nint cdiv(int a, int b) { return (a - 1 + b) / b; }\ntemplate<typename T> void fin(T mes) {\n cout << mes << endl;\n exit(0);\n}\ntemplate<typename T> T sq(T x) { return x * x; }\ntemplate<typename T, typename U> bool chmax(T &a, const U &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<typename T, typename U> bool chmin(T &a, const U &b) {\n if (b < a) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\n os << \"(\" << rhs.first << \", \" << rhs.second << \")\";\n return os;\n}\ntemplate<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {\n os << \"{\";\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\n os << *itr << (next(itr) != rhs.end() ? \", \" : \"\");\n }\n os << \"}\";\n return os;\n}\ntemplate<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {\n os << \"{\";\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\n os << *itr << (next(itr) != rhs.end() ? \", \" : \"\");\n }\n os << \"}\";\n return os;\n}\ntemplate<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {\n os << \"{\";\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\n os << *itr << (next(itr) != rhs.end() ? \", \" : \"\");\n }\n os << \"}\";\n return os;\n}\ntemplate<typename T> ostream &operator<<(ostream &os, const multiset<T> &rhs) {\n os << \"{\";\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\n os << *itr << (next(itr) != rhs.end() ? \", \" : \"\");\n }\n os << \"}\";\n return os;\n}\ntemplate<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {\n os << \"{\";\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\n os << *itr << (next(itr) != rhs.end() ? \", \" : \"\");\n }\n os << \"}\";\n return os;\n}\nstruct setup {\n static constexpr int PREC = 20;\n setup() {\n cout << fixed << setprecision(PREC);\n cerr << fixed << setprecision(PREC);\n };\n} setup;\n\nsigned main() {\n int N;\n string S;\n cin >> N >> S;\n vint ap(26);\n for (char c:S) { ap[c - 'a']++; }\n string T;\n while (N--) {\n vector<char> taboo;\n if (T.size() >= 1) { taboo.emplace_back(T[T.size() - 1]); }\n if (T.size() >= 2) { taboo.emplace_back(T[T.size() - 2]); }\n int m = 0, a = -1;\n rep(i, 26) {\n bool flg = false;\n for (char c:taboo) { if (i + 'a' == c) { flg = true; }}\n if (flg) { continue; }\n if (chmax(m, ap[i])) { a = i; }\n }\n if (a == -1) { fin(-1); }\n ap[a]--;\n T.push_back(a + 'a');\n }\n cout << T << endl;\n\n}","accuracy":1,"time_ms":10,"memory_kb":3812,"score_of_the_acc":-0.0848,"final_rank":8},{"submission_id":"aoj_3174_4844802","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\")\n#pragma GCC optimize(\"unroll-loops\")\n//#pragma warning(disable : 4996)\n\n#ifdef _MSC_VER\n#include <intrin.h>\n\n#define __builtin_popcount __popcnt\n#define __builtin_popcountll __popcnt64\n#endif\n\n#include <limits.h>\n#include <math.h>\n#include <time.h>\n\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <complex>\n#include <cstdio>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n//#include<atcoder/all>\n\nusing namespace std;\n\n//using namespace atcoder;\n\n#define REP(i, n) for (int i = 0; i < (n); ++i)\n#define REPR(i, n) for (int i = n - 1; i >= 0; --i)\n#define FOR(i, m, n) for (int i = m; i < n; ++i)\n#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)\n#define SORT(v, n) sort(v, v + n);\n#define VSORT(v) sort(v.begin(), v.end());\n#define REVERSE(v, n) reverse(v, v + n);\n#define VREVERSE(v) reverse(v.begin(), v.end())\n#define ll long long\n#define print(x) cout << (x) << endl\n#define pe(x) cout << (x) << \" \"\n#define DEBUG(x) cout << #x << \": \" << x << endl\n#define lb(v, n) lower_bound(v.begin(), v.end(), (n))\n#define ub(v, n) upper_bound(v.begin(), v.end(), (n))\n#define int long long\n//#define double long double\n#define all(x) (x).begin(), (x).end()\n#define print_space(v) REP(i, v.size()) cout << v[i] << \" \\n\"[i==(int)v.size()-1]\ntemplate <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }\ntemplate <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }\ntypedef pair<int, int> pii;\ntypedef pair<long long, long long> pll;\nstd::random_device rd;\nstd::mt19937 mt(rd());\nconstexpr ll MOD = 1e9 + 7;\nconstexpr int MAX = 500050;\nconst double pi = acos(-1);\nconstexpr double EPS = 1e-8;\nconstexpr ll LINF = 1e18 + 1;\nconstexpr int INF = 1e9 + 1;\nvoid Yes(bool cond) { cout << (cond ? \"Yes\" : \"No\") << '\\n'; }\nvoid YES(bool cond) { cout << (cond ? \"YES\" : \"NO\") << '\\n'; }\n\n\n\nvoid solve() {\n\tint N; string S; cin >> N;\n\tcin >> S;\n\t//map<char, int>mp;\n\n\tvector<int>cnt(26);\n\tfor (char c : S)cnt[c-'a']++;\n\t//for (char i = 'a'; i <= 'z'; i++) {\n\t//\tcnt[i - 'a'] = mp[i];\n\t//}\n\tvector<pair<int, char>>v(26);\n\tREP(i, 26) {\n\t\t//cout << cnt[i] << \" \" << (char)('a' + i) << endl;\n\t\tv[i] = { cnt[i],(char)('a'+i) };\n\t}\n\tstring ans;\n\tREP(j, N) {\n\t\tsort(v.rbegin(), v.rend());\n\t\tbool ok = false;\n\t\tREP(i, 26) {\n\t\t\t//cout << v[i].first << \" \" << v[i].second << endl;\n\t\t}\n\t\tREP(i, 26) {\n\t\t\tif (v[i].first == 0)break;\n\t\t\tif (j - 1 >= 0 && ans[j - 1] == v[i].second)continue;\n\t\t\tif (j - 2 >= 0 && ans[j - 2] == v[i].second)continue;\n\t\t\tv[i].first--;\n\t\t\tans += v[i].second;\n\t\t\t//print(v[i].second);\n\t\t\tok = true;\n\t\t\tbreak;\n\t\t}\n\t\tif (!ok) {\n\t\t\tprint(-1); return;\n\t\t}\n\t}\n\tprint(ans);\n}\n\n\n\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\t//int q;\n\t//cin >> q;\n\t//while (q--)\n\tsolve();\n\n}","accuracy":1,"time_ms":20,"memory_kb":3616,"score_of_the_acc":-0.0699,"final_rank":6},{"submission_id":"aoj_3174_4844799","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing i64 = long long;\nusing P = pair<i64, i64>;\n\n#define overload3(_1, _2, _3, name, ...) name\n#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)\n#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)\n#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)\n#define all(v) v.begin(), v.end()\n\nstruct IoSetup {\n IoSetup() {\n // cin.tie(nullptr);\n // ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\nint main() {\n i64 N;\n cin >> N;\n string S;\n cin >> S;\n vector<i64> C(26);\n rep(i, N) C[S[i] - 'a']++;\n priority_queue<P> que, tmp;\n rep(i, 26) que.push(P(C[i], i));\n string ans = \"\";\n rep(i, N) {\n while(true) {\n P t = que.top();\n que.pop();\n if(i == 0) {\n t.first--;\n ans = ans + (char)(t.second + 'a');\n que.push(t);\n break;\n } else if(i == 1) {\n if(t.second + 'a' == ans[i - 1]) {\n tmp.push(t);\n continue;\n }\n } else {\n if(t.second + 'a' == ans[i - 1] || t.second + 'a' == ans[i - 2]) {\n tmp.push(t);\n continue;\n }\n }\n ans = ans + (char)(t.second + 'a');\n t.first--;\n que.push(t);\n while(!tmp.empty()) {\n que.push(tmp.top());\n tmp.pop();\n }\n break;\n }\n }\n string t = ans;\n sort(all(S));\n sort(all(t));\n if(S == t)\n cout << ans << endl;\n else\n cout << -1 << endl;\n}","accuracy":1,"time_ms":380,"memory_kb":3592,"score_of_the_acc":-1.0377,"final_rank":13},{"submission_id":"aoj_3174_4844775","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing uint = unsigned;\nusing pcc = pair<char, char>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<ld, ld>;\nusing tuplis = array<ll, 3>;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nconst ll LINF=0x1fffffffffffffff;\nconst ll MINF=0x7fffffffffff;\nconst int INF=0x3fffffff;\nconst int MOD=1000000007;\nconst int MODD=998244353;\nconst ld DINF=numeric_limits<ld>::infinity();\nconst ld EPS=1e-9;\nconst ld PI=3.1415926535897932;\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\n#define overload4(_1,_2,_3,_4,name,...) name\n#define overload3(_1,_2,_3,name,...) name\n#define rep1(n) for(ll i=0;i<n;++i)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(n) for(ll i=n;i--;)\n#define rrep2(i,n) for(ll i=n;i--;)\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\n#define each1(i,a) for(auto&&i:a)\n#define each2(x,y,a) for(auto&&[x,y]:a)\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\n#define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__)\n#define all1(i) begin(i),end(i)\n#define all2(i,a) begin(i),begin(i)+a\n#define all3(i,a,b) begin(i)+a,begin(i)+b\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\n#define rall1(i) (i).rbegin(),(i).rend()\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\n#define Msum(...) accumulate(all(__VA_ARGS__),0_M)\n#define elif else if\n#define unless(a) if(!(a))\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\nll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }\nll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\nvector<ll> iota(ll n){ vector<ll> a(n); iota(a.begin(), a.end(), 0); return a; }\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\nmap<ll,ll> factor_map(ull x){ map<ll,ll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans[i] = 1; while((x /= i) % i == 0) ans[i]++; } if(x != 1) ans[x] = 1; return ans; }\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\ntemplate<class T> unordered_map<T, ll> press(vector<T> a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\ntemplate<class T> map<T, ll> press_map(vector<T> a){ Uniq(a); map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\nint scan(){ return getchar(); }\nvoid scan(int& a){ scanf(\"%d\", &a); }\nvoid scan(unsigned& a){ scanf(\"%u\", &a); }\nvoid scan(long& a){ scanf(\"%ld\", &a); }\nvoid scan(long long& a){ scanf(\"%lld\", &a); }\nvoid scan(unsigned long long& a){ scanf(\"%llu\", &a); }\nvoid scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\\n'); }\nvoid scan(float& a){ scanf(\"%f\", &a); }\nvoid scan(double& a){ scanf(\"%lf\", &a); }\nvoid scan(long double& a){ scanf(\"%Lf\", &a); }\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\nvoid scan(char a[]){ scanf(\"%s\", a); }\nvoid scan(string& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>&);\ntemplate<class T, size_t size> void scan(array<T, size>&);\ntemplate<class T, class L> void scan(pair<T, L>&);\ntemplate<class T, size_t size> void scan(T(&)[size]);\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(T& a){ cin >> a; }\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(unsigned a){ printf(\"%u\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(unsigned long long a){ printf(\"%llu\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(float a){ printf(\"%.15f\", a); }\nvoid print(double a){ printf(\"%.15f\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\ntemplate<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }\ntemplate<class T> void print(const vector<T>&);\ntemplate<class T, size_t size> void print(const array<T, size>&);\ntemplate<class T, class L> void print(const pair<T, L>& p);\ntemplate<class T, size_t size> void print(const T (&)[size]);\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const T& a){ cout << a; }\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\n#ifdef DEBUG\ninline ll __lg(ull __n){ return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); }\n#define debug(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...) void(0)\n#endif\nint first(bool i = true){ return out(i?\"first\":\"second\"); }\nint First(bool i = true){ return out(i?\"First\":\"Second\"); }\nint yes(bool i = true){ return out(i?\"yes\":\"no\"); }\nint Yes(bool i = true){ return out(i?\"Yes\":\"No\"); }\nint No(){ return out(\"No\"); }\nint YES(bool i = true){ return out(i?\"YES\":\"NO\"); }\nint NO(){ return out(\"NO\"); }\nint Yay(bool i = true){ return out(i?\"Yay!\":\":(\"); }\nint possible(bool i = true){ return out(i?\"possible\":\"impossible\"); }\nint Possible(bool i = true){ return out(i?\"Possible\":\"Impossible\"); }\nint POSSIBLE(bool i = true){ return out(i?\"POSSIBLE\":\"IMPOSSIBLE\"); }\nvoid Case(ll i){ printf(\"Case #%lld: \", i); }\n\n\n\nsigned main(){\n LL(n);\n STR(s);\n vec(ll,cnt,26);\n each(i,s)cnt[i-'a']++;\n string ans=\"--\";\n auto p=iota(26);\n sort(all(p),[&](ll a,ll b){return cnt[a]>cnt[b];});\n rep(n){\n const ll x=p[0],y=p[1],z=p[2];\n if(ans.end()[-1]!=x+'a'&&ans.end()[-2]!=x+'a'){\n cnt[x]--;\n ans+=char(x+'a');\n }\n elif(ans.end()[-1]!=y+'a'&&ans.end()[-2]!=y+'a'){\n if(!cnt[y]--)return out(-1);\n ans+=char(y+'a');\n }\n else{\n if(!cnt[z]--)return out(-1);\n ans+=char(z+'a');\n }\n sort(all(p),[&](ll a,ll b){return cnt[a]>cnt[b];});\n }\n out(ans.substr(2));\n}","accuracy":1,"time_ms":10,"memory_kb":3916,"score_of_the_acc":-0.1071,"final_rank":9},{"submission_id":"aoj_3174_4844751","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define INF_LL (int64)1e18\n#define INF (int32)1e9\n#define REP(i, n) for(int64 i = 0;i < (n);i++)\n#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)\n#define all(x) x.begin(),x.end()\n#define fs first\n#define sc second\n\nusing int32 = int_fast32_t;\nusing uint32 = uint_fast32_t;\nusing int64 = int_fast64_t;\nusing uint64 = uint_fast64_t;\nusing PII = pair<int32, int32>;\nusing PLL = pair<int64, int64>;\n\nconst double eps = 1e-10;\n\ntemplate<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}\ntemplate<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}\n\ntemplate<typename T>\nvector<T> make_v(size_t a){return vector<T>(a);}\n\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts){\n\treturn vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\n\ntemplate<typename T,typename U,typename... V>\ntypename enable_if<is_same<T, U>::value!=0>::type\nfill_v(U &u,const V... v){u=U(v...);}\n\ntemplate<typename T,typename U,typename... V>\ntypename enable_if<is_same<T, U>::value==0>::type\nfill_v(U &u,const V... v){\n\tfor(auto &e:u) fill_v<T>(e,v...);\n}\n\nint main(void){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint64 N;\n\tcin >> N;\n\tstring s;\n\tcin >> s;\n\tpriority_queue<pair<int, char>> pq;\n\tint cnt[26] = {};\n\tREP(i, N) {\n\t cnt[s[i] - 'a']++;\n\t}\n int last[26] = {};\n\tREP(i, 26) {\n\t if (cnt[i])\n \t pq.emplace(cnt[i], (char)(i + 'a'));\n\t last[i] = -INF;\n\t}\n\tbool ok = 1;\n\tstring res(\"\");\n\twhile (pq.size()) {\n\t ok = 0;\n\t vector<pair<int, char>> v;\n//\t cout << pq.size() << endl;\n\t while (pq.size()) {\n\t int num;\n\t char c;\n\t tie(num, c) = pq.top(); pq.pop();\n//\t cout << num << \" \" << c << \" \" << res.size() << \" \" << last[c-'a'] << endl;\n\t if (res.size() - last[c -'a'] > 1) {\n\t ok = 1;\n\t res += c;\n\t num--;\n\t last[c - 'a'] = res.size();\n\t if (num > 0)\n \t v.emplace_back(num, c);\n\t break;\n\t } else {\n\t v.emplace_back(num, c);\n\t }\n\t }\n\t if (!ok) break;\n\t for (auto& x : v) pq.push(x);\n\t}\n\tif (ok) {\n\t cout << res << endl;\n\t} else {\n\t cout << -1 << endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3416,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_3174_4844731","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(ll i=0;i<n;i++)\n#define repl(i,l,r) for(ll i=(l);i<(r);i++)\n#define per(i,n) for(ll i=n-1;i>=0;i--)\n#define perl(i,r,l) for(ll i=r-1;i>=l;i--)\n#define fi first\n#define se second\n#define pb push_back\n#define ins insert\n#define pqueue(x) priority_queue<x,vector<x>,greater<x>>\n#define all(x) (x).begin(),(x).end()\n#define CST(x) cout<<fixed<<setprecision(x)\n#define rev(x) reverse(x);\nusing ll=long long;\nusing vl=vector<ll>;\nusing vvl=vector<vector<ll>>;\nusing pl=pair<ll,ll>;\nusing vpl=vector<pl>;\nusing vvpl=vector<vpl>;\nconst ll MOD=1000000007;\nconst ll MOD9=998244353;\nconst int inf=1e9+10;\nconst ll INF=4e18;\nconst ll dy[8]={1,0,-1,0,1,1,-1,-1};\nconst ll dx[8]={0,-1,0,1,1,-1,1,-1};\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a >= b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\nint main(){\n ll n;cin >> n;\n string s;cin >> s;\n vl alp(26);rep(i,n){\n alp[s[i]-'a']++;\n }\n string ans;\n rep(i,n){\n priority_queue<pair<ll,char>,vector<pair<ll,char>>,less<pair<ll,char>>> que;\n rep(j,26){\n que.push({alp[j],'a'+j});\n }\n /*rep(j,26){\n cout << que.top().fi<<\" \"<< que.top().se <<endl;\n que.pop();\n }\n return 0;*/\n bool ok=false;\n rep(j,26){\n pair<ll,char> p=que.top();que.pop();\n if(i>=1)if(ans[i-1]==p.se)continue;\n if(i>=2)if(ans[i-2]==p.se)continue;\n if(p.fi==0)break;\n //cout << p.se <<endl;\n ans+=p.se;\n //cout << ans <<endl;\n alp[p.se-'a']--;\n ok=true;\n break;\n }\n if(!ok) cout << -1 <<endl,exit(0);\n }\n cout << ans <<endl;\n}","accuracy":1,"time_ms":30,"memory_kb":3816,"score_of_the_acc":-0.1397,"final_rank":10},{"submission_id":"aoj_3174_4844669","code_snippet":"// #pragma GCC optimize(\"unroll-loops\", \"omit-frame-pointer\", \"inline\")\n// #pragma GCC option(\"arch=native\", \"tune=native\", \"no-zero-upper\")\n// #pragma GCC\n// target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native\")\n// #pragma GCC optimize(\"Ofast\")\n// #pragma GCC optimize(\"tree-vectorize\",\"openmp\",\"predictive-commoning\")\n// #pragma GCC option(\"D_GLIBCXX_PARALLEL\",\"openmp\")\n\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC target(\"avx2\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\n// #define int long long\n#define pb push_back\n#define mp make_pair\n#define eps 1e-9\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define fi first\n#define sec second\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n#define dmp(x) cerr << #x << \": \" << x << endl;\n\ntemplate <class T>\nvoid chmin(T &a, const T &b) {\n if (a > b) a = b;\n}\ntemplate <class T>\nvoid chmax(T &a, const T &b) {\n if (a < b) a = b;\n}\n\ntemplate <class T>\nusing MaxHeap = priority_queue<T>;\ntemplate <class T>\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T>\nvector<T> vect(int len, T elem) {\n return vector<T>(len, elem);\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << p.fi << ',' << p.sec;\n return os;\n}\ntemplate <class T, class U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n is >> p.fi >> p.sec;\n return is;\n}\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i];\n if (i + 1 < vec.size()) os << ' ';\n }\n return os;\n}\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\n return is;\n}\nvoid fastio() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(20);\n}\n\n#define endl \"\\n\"\n\nvoid solve() {\n int n;\n string s;\n cin >> n >> s;\n vector<int> cnt(30);\n for (int i = 0; i < n; i++) { cnt[s[i] - 'a']++; }\n vector<pair<int, int>> occ;\n for (int i = 0; i < 30; i++) { occ.emplace_back(cnt[i], i); }\n sort(all(occ));\n reverse(all(occ));\n // dmp(occ);\n set<int> idx;\n for (int i = 0; i < n; i++) idx.insert(i);\n vector<int> ans(n);\n for (int i = 0; i < 30; i++) {\n int c = occ[i].second;\n int pre = -3;\n for (int j = 0; j < occ[i].first; j++) {\n auto it = idx.lower_bound(pre + 3);\n if (it == idx.end()) {\n cout << -1 << endl;\n return;\n }\n ans[*it] = c;\n pre = *it;\n idx.erase(it);\n }\n }\n for (int i = 0; i < n; i++) { cout << (char)(ans[i] + 'a'); }\n cout << endl;\n return;\n}\n\nsigned main() {\n fastio();\n solve();\n // int t; cin >> t; while(t--)solve();\n\n // int t; cin >> t;\n // for(int i=1;i<=t;i++){\n // cout << \"Case #\" << i << \": \";\n // solve();\n // }\n return 0;\n}","accuracy":0.7391304347826086,"time_ms":20,"memory_kb":8084,"score_of_the_acc":-1.027,"final_rank":14},{"submission_id":"aoj_3174_4840854","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\n{ for(auto it : P) { s << \"<\" << it << \"> \"; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for(auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s << endl; }\n\n\nstring solve(int N, const string &S) {\n map<char,int> ma;\n for (auto c : S) ma[c]++;\n if (ma.size() == 1) {\n if (N == 1) return S;\n else return \"-1\";\n }\n else if (ma.size() == 2) {\n if (N == 2) return S;\n else return \"-1\";\n }\n else {\n string res = \"\";\n while (!ma.empty()) {\n int vmax = -1;\n char pmax;\n for (auto it : ma) {\n if (res.size() > 0 && res.back() == it.first) continue;\n if (res.size() > 1 && res[res.size() - 2] == it.first) continue;\n if (chmax(vmax, it.second)) pmax = it.first;\n }\n if (vmax == -1) return \"-1\";\n res += pmax;\n ma[pmax]--;\n if (ma[pmax] == 0) ma.erase(pmax);\n }\n return res;\n }\n}\n\nint main() {\n int N;\n string S;\n cin >> N >> S;\n cout << solve(N, S) << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3496,"score_of_the_acc":-0.0171,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_3174_4875827\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=Int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n Int n;\\n cin>>n;\\n string s;\\n cin>>s;\\n\\n vector<Int> cnt(26,0);\\n for(char c:s) cnt[c-'a']++;\\n\\n string ans;\\n ans+='?';\\n ans+='!';\\n for(Int i=0;i<n;i++){\\n using P = pair<Int, char>;\\n vector<P> vp;\\n for(Int j=0;j<26;j++)\\n vp.emplace_back(cnt[j],'a'+j);\\n sort(vp.rbegin(),vp.rend());\\n for(auto p:vp){\\n if(p.first==0) continue;\\n if(ans[i+0]==p.second) continue;\\n if(ans[i+1]==p.second) continue;\\n ans+=p.second;\\n cnt[p.second-'a']--;\\n break;\\n }\\n if((Int)ans.size()!=i+3) drop(-1);\\n }\\n ans.erase(ans.begin());\\n ans.erase(ans.begin());\\n\\n cout<<ans<<newl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.1449,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3174_4846691\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it << \\\"> \\\"; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it.first << \\\"->\\\" << it.second << \\\"> \\\"; } return s << endl; }\\n\\n\\nstring solve(int N, const string &S) {\\n map<char,int> ma;\\n for (auto c : S) ma[c]++;\\n if (ma.size() == 1) {\\n if (N == 1) return S;\\n else return \\\"-1\\\";\\n }\\n else if (ma.size() == 2) {\\n if (N == 2) return S;\\n else return \\\"-1\\\";\\n }\\n else {\\n string res = \\\"\\\";\\n while (!ma.empty()) {\\n int vmax = -1;\\n char pmax;\\n for (auto it : ma) {\\n if (res.size() > 0 && res.back() == it.first) continue;\\n if (res.size() > 1 && res[res.size() - 2] == it.first) continue;\\n if (chmax(vmax, it.second)) pmax = it.first;\\n }\\n if (vmax == -1) return \\\"-1\\\";\\n res += pmax;\\n ma[pmax]--;\\n if (ma[pmax] == 0) ma.erase(pmax);\\n }\\n return res;\\n }\\n}\\n\\nint main() {\\n int N;\\n string S;\\n cin >> N >> S;\\n cout << solve(N, S) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.0051,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3174_4846656\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> l_l;\\ntypedef pair<int, int> i_i;\\ntemplate<class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nconst long long INF = 1e18;\\n//const ll mod = 1000000007;\\nll N;\\nstring S;\\nmap<char, ll> mp;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cin >> N;\\n cin >> S;\\n for(int i = 0; i < N; i++) {\\n mp[S[i]]++;\\n }\\n string ans;\\n for(int i = 0; i < N; i++) {\\n char tmp = '#';\\n for(char a = 'a'; a <= 'z'; a++) {\\n if(i >= 2 and ans[i-2] == a) continue;\\n if(i >= 1 and ans[i-1] == a) continue;\\n if(mp[tmp] < mp[a]) tmp = a;\\n }\\n if(tmp == '#') {\\n cout << -1 << endl;\\n return 0;\\n }\\n ans.push_back(tmp);\\n mp[tmp]--;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.0724,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3174_4846647\",\n \"code_snippet\": \"// Sに含まれるアルファベットのうち\\n// 過半数以上のアルファベット文字があったらだめ\\n// そうじゃなかったら絶対作れそう？\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int N;\\n string S;\\n cin >> N >> S;\\n vector<int> alphabet('z' - 'a' + 1, 0);\\n for(char ch: S) ++alphabet[ch - 'a'];\\n // for(int num: alphabet) {\\n // if(num > N/2) {\\n // cout << -1 << endl;\\n // return 0;\\n // }\\n // }\\n\\n // 構築\\n // 同じ文字が隣りあってはダメ\\n // 長さ3→両端同じはだめ\\n string res = \\\"\\\";\\n \\n // int r = 0;\\n // for(int i = 0; i < N; ++i) {\\n // while(alphabet[r] == 0) {\\n // r = (r + 1)%('z' - 'a' + 1);\\n // }\\n // res += (char)('a' + r);\\n // --alphabet[r];\\n // r = (r+1)%('z' - 'a' + 1);\\n // }\\n\\n vector<pair<int,int>> alp('z' - 'a' + 1);\\n for(int i = 0; i < 'z' - 'a' + 1; ++i) {\\n alp[i].first = alphabet[i];\\n alp[i].second = i;\\n }\\n sort(alp.rbegin(), alp.rend());\\n for(int i = 0; i < N; ++i) {\\n set<char> prev;\\n if(i-1 >= 0) prev.insert(res[i-1]);\\n if(i-2 >= 0) prev.insert(res[i-2]);\\n bool flg = false;\\n for(int r = 0; r < 'z' - 'a' + 1; ++r) {\\n if(alp[r].first > 0 && prev.find((char)(alp[r].second + 'a')) == prev.end()) {\\n res += (char)(alp[r].second + 'a');\\n --alp[r].first;\\n flg = true;\\n break;\\n }\\n }\\n if(!flg) {\\n cout << -1 << endl;\\n return 0;\\n }\\n sort(alp.rbegin(), alp.rend());\\n }\\n\\n for(int i = 0; i < N-1; ++i) {\\n if(res[i] == res[i+1]) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n for(int i = 0; i < N-2; ++i) {\\n if(res[i] == res[i+2]) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3452,\n \"score_of_the_acc\": -0.0347,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3174_4845381\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\", \\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define ll long long\\n#define ld long double\\n\\nstruct info{\\n\\tchar c = ' ';\\n\\tint idx = 0;\\n\\tint cnt = 0;\\n};\\n\\nint N;\\nstring S;\\n\\nvoid input(void){\\n\\tcin >> N >> S;\\n}\\n\\nint main(void){\\n\\tinput();\\n\\tstring res = \\\"\\\";\\n\\tvector<info> infos(26);\\n\\tfor (int i = 0; i < 26; ++i){\\n\\t\\tinfos[i].c = (char)('a' + i);\\n\\t}\\n\\tfor (int i = 0; i < N; ++i){\\n\\t\\tint idx = S[i] - 'a';\\n\\t\\tinfos[idx].cnt++;\\n\\t}\\n\\n\\tpriority_queue<info, vector<info>, function<bool(info, info)>> waiting(\\n\\t\\t[](info i1, info i2){ return i1.idx > i2.idx; }\\n\\t);\\n\\tpriority_queue<info, vector<info>, function<bool(info, info)>> ok(\\n\\t\\t[](info i1, info i2){ return i1.cnt < i2.cnt; }\\n\\t);\\n\\n\\tfor (auto i : infos)\\n\\t\\tif (i.cnt)\\n\\t\\t\\tok.push(i);\\n\\n\\tfor (int i = 0; i < N; ++i){\\n\\t\\twhile (waiting.size()){\\n\\t\\t\\tinfo t = waiting.top();\\n\\t\\t\\tif (t.idx <= i){\\n\\t\\t\\t\\tok.push(t);\\n\\t\\t\\t\\twaiting.pop();\\n\\t\\t\\t}\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tif (ok.size() == 0){\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tinfo t = ok.top();\\n\\t\\tok.pop();\\n\\t\\tres += t.c;\\n\\t\\tt.cnt--;\\n\\t\\tt.idx = i + 3;\\n\\t\\tif (t.cnt)\\n\\t\\t\\twaiting.push(t);\\n\\t}\\n\\n\\tcout << res << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.0051,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3174_4845155\",\n \"code_snippet\": \"#line 2 \\\"cpplib/util/template.hpp\\\"\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#pragma GCC target(\\\"avx\\\")\\n#include<bits/stdc++.h>\\nusing namespace std;\\nstruct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;\\ntypedef long long lint;\\n#define INF (1LL<<60)\\n#define IINF (1<<30)\\n#define EPS (1e-10)\\n#define endl ('\\\\n')\\ntypedef vector<lint> vec;\\ntypedef vector<vector<lint>> mat;\\ntypedef vector<vector<vector<lint>>> mat3;\\ntypedef vector<string> svec;\\ntypedef vector<vector<string>> smat;\\ntemplate<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?\\\" \\\":\\\"\\\")<<i<INF/2?i:\\\"INF\\\";f=1;}cout<<endl;}\\ntemplate<typename T>inline void numout2(T t){for(auto i:t)numout(i);}\\ntemplate<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?\\\" \\\":\\\"\\\")<<i;f=1;}cout<<endl;}\\ntemplate<typename T>inline void output2(T t){for(auto i:t)output(i);}\\ntemplate<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?\\\"\\\":\\\" \\\"<<t[i];f=1;}cout<<endl;}\\ntemplate<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}\\n#define rep(i,...) for(auto i:range(__VA_ARGS__)) \\n#define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))\\n#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)\\n#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)\\n#define irep(i) for(lint i=0;;++i)\\ninline vector<long long> range(long long n){vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}\\ninline vector<long long> range(long long a,long long b){vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}\\ninline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}\\ntemplate<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}\\n#define all(n) begin(n),end(n)\\ntemplate<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}\\ntemplate<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}\\nconst vector<lint> dx={1,0,-1,0,1,1,-1,-1};\\nconst vector<lint> dy={0,1,0,-1,1,-1,1,-1};\\n#define SUM(v) accumulate(all(v),0LL)\\ntemplate<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}\\n#line 2 \\\"code.cpp\\\"\\n\\nint main(){\\n lint n;\\n cin>>n;\\n string s;\\n cin>>s;\\n map<char,lint>m;\\n rep(i,n){\\n m[s[i]]++;\\n }\\n multiset<pair<char,lint>>v;\\n sort(all(s),[&](auto s,auto t){return m[s]==m[t]?s>t:m[s]>m[t];});\\n string ans(n,'#');\\n vector<lint>b(n,0);\\n lint now=0;\\n rep(i,n){\\n while(b[now%n])now++;\\n ans[now%n]=s[i];\\n b[now%n]=1;\\n now+=3;\\n }\\n for(int i=0;i<n-1;++i){\\n if(ans[i]==ans[i+1]){\\n cout<<-1<<endl;\\n return 0;\\n }\\n }\\n for(int i=0;i<n-2;++i){\\n if(ans[i]==ans[i+2]){\\n cout<<-1<<endl;\\n return 0;\\n }\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4764,\n \"score_of_the_acc\": -0.3428,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3174_4844826\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\\n#define reps(i, n) for (int i = 1; i <= (int) (n); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define uniq(x) (x).erase(unique(all(x)), (x).end())\\n#define bit(n) (1LL << (n))\\n#define dump(x) cerr << #x \\\" = \\\" << (x) << endl\\nusing vint = vector<int>;\\nusing vvint = vector<vint>;\\nusing pint = pair<int, int>;\\nusing vpint = vector<pint>;\\ntemplate<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr double PI = 3.1415926535897932384626433832795028;\\nconstexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};\\nconstexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};\\nint sign(int x) { return (x > 0) - (x < 0); }\\nint gcd(int a, int b) {\\n while (b) { swap(a %= b, b); }\\n return a;\\n}\\nint lcm(int a, int b) { return a / gcd(a, b) * b; }\\nint cdiv(int a, int b) { return (a - 1 + b) / b; }\\ntemplate<typename T> void fin(T mes) {\\n cout << mes << endl;\\n exit(0);\\n}\\ntemplate<typename T> T sq(T x) { return x * x; }\\ntemplate<typename T, typename U> bool chmax(T &a, const U &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<typename T, typename U> bool chmin(T &a, const U &b) {\\n if (b < a) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\\n os << \\\"(\\\" << rhs.first << \\\", \\\" << rhs.second << \\\")\\\";\\n return os;\\n}\\ntemplate<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {\\n os << \\\"{\\\";\\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\\n os << *itr << (next(itr) != rhs.end() ? \\\", \\\" : \\\"\\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {\\n os << \\\"{\\\";\\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\\n os << *itr << (next(itr) != rhs.end() ? \\\", \\\" : \\\"\\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {\\n os << \\\"{\\\";\\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\\n os << *itr << (next(itr) != rhs.end() ? \\\", \\\" : \\\"\\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate<typename T> ostream &operator<<(ostream &os, const multiset<T> &rhs) {\\n os << \\\"{\\\";\\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\\n os << *itr << (next(itr) != rhs.end() ? \\\", \\\" : \\\"\\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {\\n os << \\\"{\\\";\\n for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {\\n os << *itr << (next(itr) != rhs.end() ? \\\", \\\" : \\\"\\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\nstruct setup {\\n static constexpr int PREC = 20;\\n setup() {\\n cout << fixed << setprecision(PREC);\\n cerr << fixed << setprecision(PREC);\\n };\\n} setup;\\n\\nsigned main() {\\n int N;\\n string S;\\n cin >> N >> S;\\n vint ap(26);\\n for (char c:S) { ap[c - 'a']++; }\\n string T;\\n while (N--) {\\n vector<char> taboo;\\n if (T.size() >= 1) { taboo.emplace_back(T[T.size() - 1]); }\\n if (T.size() >= 2) { taboo.emplace_back(T[T.size() - 2]); }\\n int m = 0, a = -1;\\n rep(i, 26) {\\n bool flg = false;\\n for (char c:taboo) { if (i + 'a' == c) { flg = true; }}\\n if (flg) { continue; }\\n if (chmax(m, ap[i])) { a = i; }\\n }\\n if (a == -1) { fin(-1); }\\n ap[a]--;\\n T.push_back(a + 'a');\\n }\\n cout << T << endl;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3812,\n \"score_of_the_acc\": -0.0848,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3174_4844802\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#pragma warning(disable : 4996)\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n\\n#define __builtin_popcount __popcnt\\n#define __builtin_popcountll __popcnt64\\n#endif\\n\\n#include <limits.h>\\n#include <math.h>\\n#include <time.h>\\n\\n#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <complex>\\n#include <cstdio>\\n#include <cstring>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <vector>\\n\\n//#include<atcoder/all>\\n\\nusing namespace std;\\n\\n//using namespace atcoder;\\n\\n#define REP(i, n) for (int i = 0; i < (n); ++i)\\n#define REPR(i, n) for (int i = n - 1; i >= 0; --i)\\n#define FOR(i, m, n) for (int i = m; i < n; ++i)\\n#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)\\n#define SORT(v, n) sort(v, v + n);\\n#define VSORT(v) sort(v.begin(), v.end());\\n#define REVERSE(v, n) reverse(v, v + n);\\n#define VREVERSE(v) reverse(v.begin(), v.end())\\n#define ll long long\\n#define print(x) cout << (x) << endl\\n#define pe(x) cout << (x) << \\\" \\\"\\n#define DEBUG(x) cout << #x << \\\": \\\" << x << endl\\n#define lb(v, n) lower_bound(v.begin(), v.end(), (n))\\n#define ub(v, n) upper_bound(v.begin(), v.end(), (n))\\n#define int long long\\n//#define double long double\\n#define all(x) (x).begin(), (x).end()\\n#define print_space(v) REP(i, v.size()) cout << v[i] << \\\" \\\\n\\\"[i==(int)v.size()-1]\\ntemplate <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }\\ntemplate <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }\\ntypedef pair<int, int> pii;\\ntypedef pair<long long, long long> pll;\\nstd::random_device rd;\\nstd::mt19937 mt(rd());\\nconstexpr ll MOD = 1e9 + 7;\\nconstexpr int MAX = 500050;\\nconst double pi = acos(-1);\\nconstexpr double EPS = 1e-8;\\nconstexpr ll LINF = 1e18 + 1;\\nconstexpr int INF = 1e9 + 1;\\nvoid Yes(bool cond) { cout << (cond ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid YES(bool cond) { cout << (cond ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\n\\n\\n\\nvoid solve() {\\n\\tint N; string S; cin >> N;\\n\\tcin >> S;\\n\\t//map<char, int>mp;\\n\\n\\tvector<int>cnt(26);\\n\\tfor (char c : S)cnt[c-'a']++;\\n\\t//for (char i = 'a'; i <= 'z'; i++) {\\n\\t//\\tcnt[i - 'a'] = mp[i];\\n\\t//}\\n\\tvector<pair<int, char>>v(26);\\n\\tREP(i, 26) {\\n\\t\\t//cout << cnt[i] << \\\" \\\" << (char)('a' + i) << endl;\\n\\t\\tv[i] = { cnt[i],(char)('a'+i) };\\n\\t}\\n\\tstring ans;\\n\\tREP(j, N) {\\n\\t\\tsort(v.rbegin(), v.rend());\\n\\t\\tbool ok = false;\\n\\t\\tREP(i, 26) {\\n\\t\\t\\t//cout << v[i].first << \\\" \\\" << v[i].second << endl;\\n\\t\\t}\\n\\t\\tREP(i, 26) {\\n\\t\\t\\tif (v[i].first == 0)break;\\n\\t\\t\\tif (j - 1 >= 0 && ans[j - 1] == v[i].second)continue;\\n\\t\\t\\tif (j - 2 >= 0 && ans[j - 2] == v[i].second)continue;\\n\\t\\t\\tv[i].first--;\\n\\t\\t\\tans += v[i].second;\\n\\t\\t\\t//print(v[i].second);\\n\\t\\t\\tok = true;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tif (!ok) {\\n\\t\\t\\tprint(-1); return;\\n\\t\\t}\\n\\t}\\n\\tprint(ans);\\n}\\n\\n\\n\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\t//int q;\\n\\t//cin >> q;\\n\\t//while (q--)\\n\\tsolve();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3616,\n \"score_of_the_acc\": -0.0699,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3174_4844799\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing i64 = long long;\\nusing P = pair<i64, i64>;\\n\\n#define overload3(_1, _2, _3, name, ...) name\\n#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)\\n#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)\\n#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)\\n#define all(v) v.begin(), v.end()\\n\\nstruct IoSetup {\\n IoSetup() {\\n // cin.tie(nullptr);\\n // ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\nint main() {\\n i64 N;\\n cin >> N;\\n string S;\\n cin >> S;\\n vector<i64> C(26);\\n rep(i, N) C[S[i] - 'a']++;\\n priority_queue<P> que, tmp;\\n rep(i, 26) que.push(P(C[i], i));\\n string ans = \\\"\\\";\\n rep(i, N) {\\n while(true) {\\n P t = que.top();\\n que.pop();\\n if(i == 0) {\\n t.first--;\\n ans = ans + (char)(t.second + 'a');\\n que.push(t);\\n break;\\n } else if(i == 1) {\\n if(t.second + 'a' == ans[i - 1]) {\\n tmp.push(t);\\n continue;\\n }\\n } else {\\n if(t.second + 'a' == ans[i - 1] || t.second + 'a' == ans[i - 2]) {\\n tmp.push(t);\\n continue;\\n }\\n }\\n ans = ans + (char)(t.second + 'a');\\n t.first--;\\n que.push(t);\\n while(!tmp.empty()) {\\n que.push(tmp.top());\\n tmp.pop();\\n }\\n break;\\n }\\n }\\n string t = ans;\\n sort(all(S));\\n sort(all(t));\\n if(S == t)\\n cout << ans << endl;\\n else\\n cout << -1 << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -1.0377,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3174_4844775\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing uint = unsigned;\\nusing pcc = pair<char, char>;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pdd = pair<ld, ld>;\\nusing tuplis = array<ll, 3>;\\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\\nconst ll LINF=0x1fffffffffffffff;\\nconst ll MINF=0x7fffffffffff;\\nconst int INF=0x3fffffff;\\nconst int MOD=1000000007;\\nconst int MODD=998244353;\\nconst ld DINF=numeric_limits<ld>::infinity();\\nconst ld EPS=1e-9;\\nconst ld PI=3.1415926535897932;\\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\\n#define overload4(_1,_2,_3,_4,name,...) name\\n#define overload3(_1,_2,_3,name,...) name\\n#define rep1(n) for(ll i=0;i<n;++i)\\n#define rep2(i,n) for(ll i=0;i<n;++i)\\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\\n#define rrep1(n) for(ll i=n;i--;)\\n#define rrep2(i,n) for(ll i=n;i--;)\\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\\n#define each1(i,a) for(auto&&i:a)\\n#define each2(x,y,a) for(auto&&[x,y]:a)\\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\\n#define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__)\\n#define all1(i) begin(i),end(i)\\n#define all2(i,a) begin(i),begin(i)+a\\n#define all3(i,a,b) begin(i)+a,begin(i)+b\\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\\n#define rall1(i) (i).rbegin(),(i).rend()\\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\\n#define Msum(...) accumulate(all(__VA_ARGS__),0_M)\\n#define elif else if\\n#define unless(a) if(!(a))\\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\\n#define Sort(a) sort(all(a))\\n#define Rev(a) reverse(all(a))\\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type>name(size);in(name)\\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\\nll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }\\nll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\\nvector<ll> iota(ll n){ vector<ll> a(n); iota(a.begin(), a.end(), 0); return a; }\\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\\nmap<ll,ll> factor_map(ull x){ map<ll,ll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans[i] = 1; while((x /= i) % i == 0) ans[i]++; } if(x != 1) ans[x] = 1; return ans; }\\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\\ntemplate<class T> unordered_map<T, ll> press(vector<T> a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\\ntemplate<class T> map<T, ll> press_map(vector<T> a){ Uniq(a); map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\\nint scan(){ return getchar(); }\\nvoid scan(int& a){ scanf(\\\"%d\\\", &a); }\\nvoid scan(unsigned& a){ scanf(\\\"%u\\\", &a); }\\nvoid scan(long& a){ scanf(\\\"%ld\\\", &a); }\\nvoid scan(long long& a){ scanf(\\\"%lld\\\", &a); }\\nvoid scan(unsigned long long& a){ scanf(\\\"%llu\\\", &a); }\\nvoid scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\\\\n'); }\\nvoid scan(float& a){ scanf(\\\"%f\\\", &a); }\\nvoid scan(double& a){ scanf(\\\"%lf\\\", &a); }\\nvoid scan(long double& a){ scanf(\\\"%Lf\\\", &a); }\\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\\nvoid scan(char a[]){ scanf(\\\"%s\\\", a); }\\nvoid scan(string& a){ cin >> a; }\\ntemplate<class T> void scan(vector<T>&);\\ntemplate<class T, size_t size> void scan(array<T, size>&);\\ntemplate<class T, class L> void scan(pair<T, L>&);\\ntemplate<class T, size_t size> void scan(T(&)[size]);\\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\\ntemplate<class T> void scan(T& a){ cin >> a; }\\nvoid in(){}\\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\\nvoid print(){ putchar(' '); }\\nvoid print(bool a){ printf(\\\"%d\\\", a); }\\nvoid print(int a){ printf(\\\"%d\\\", a); }\\nvoid print(unsigned a){ printf(\\\"%u\\\", a); }\\nvoid print(long a){ printf(\\\"%ld\\\", a); }\\nvoid print(long long a){ printf(\\\"%lld\\\", a); }\\nvoid print(unsigned long long a){ printf(\\\"%llu\\\", a); }\\nvoid print(char a){ printf(\\\"%c\\\", a); }\\nvoid print(char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(const char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(float a){ printf(\\\"%.15f\\\", a); }\\nvoid print(double a){ printf(\\\"%.15f\\\", a); }\\nvoid print(long double a){ printf(\\\"%.15Lf\\\", a); }\\nvoid print(const string& a){ for(auto&& i : a) print(i); }\\ntemplate<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }\\ntemplate<class T> void print(const vector<T>&);\\ntemplate<class T, size_t size> void print(const array<T, size>&);\\ntemplate<class T, class L> void print(const pair<T, L>& p);\\ntemplate<class T, size_t size> void print(const T (&)[size]);\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\\ntemplate<class T> void print(const T& a){ cout << a; }\\nint out(){ putchar('\\\\n'); return 0; }\\ntemplate<class T> int out(const T& t){ print(t); putchar('\\\\n'); return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\\n#ifdef DEBUG\\ninline ll __lg(ull __n){ return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); }\\n#define debug(...) { print(#__VA_ARGS__); print(\\\":\\\"); out(__VA_ARGS__); }\\n#else\\n#define debug(...) void(0)\\n#endif\\nint first(bool i = true){ return out(i?\\\"first\\\":\\\"second\\\"); }\\nint First(bool i = true){ return out(i?\\\"First\\\":\\\"Second\\\"); }\\nint yes(bool i = true){ return out(i?\\\"yes\\\":\\\"no\\\"); }\\nint Yes(bool i = true){ return out(i?\\\"Yes\\\":\\\"No\\\"); }\\nint No(){ return out(\\\"No\\\"); }\\nint YES(bool i = true){ return out(i?\\\"YES\\\":\\\"NO\\\"); }\\nint NO(){ return out(\\\"NO\\\"); }\\nint Yay(bool i = true){ return out(i?\\\"Yay!\\\":\\\":(\\\"); }\\nint possible(bool i = true){ return out(i?\\\"possible\\\":\\\"impossible\\\"); }\\nint Possible(bool i = true){ return out(i?\\\"Possible\\\":\\\"Impossible\\\"); }\\nint POSSIBLE(bool i = true){ return out(i?\\\"POSSIBLE\\\":\\\"IMPOSSIBLE\\\"); }\\nvoid Case(ll i){ printf(\\\"Case #%lld: \\\", i); }\\n\\n\\n\\nsigned main(){\\n LL(n);\\n STR(s);\\n vec(ll,cnt,26);\\n each(i,s)cnt[i-'a']++;\\n string ans=\\\"--\\\";\\n auto p=iota(26);\\n sort(all(p),[&](ll a,ll b){return cnt[a]>cnt[b];});\\n rep(n){\\n const ll x=p[0],y=p[1],z=p[2];\\n if(ans.end()[-1]!=x+'a'&&ans.end()[-2]!=x+'a'){\\n cnt[x]--;\\n ans+=char(x+'a');\\n }\\n elif(ans.end()[-1]!=y+'a'&&ans.end()[-2]!=y+'a'){\\n if(!cnt[y]--)return out(-1);\\n ans+=char(y+'a');\\n }\\n else{\\n if(!cnt[z]--)return out(-1);\\n ans+=char(z+'a');\\n }\\n sort(all(p),[&](ll a,ll b){return cnt[a]>cnt[b];});\\n }\\n out(ans.substr(2));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3916,\n \"score_of_the_acc\": -0.1071,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3174_4844751\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define INF_LL (int64)1e18\\n#define INF (int32)1e9\\n#define REP(i, n) for(int64 i = 0;i < (n);i++)\\n#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)\\n#define all(x) x.begin(),x.end()\\n#define fs first\\n#define sc second\\n\\nusing int32 = int_fast32_t;\\nusing uint32 = uint_fast32_t;\\nusing int64 = int_fast64_t;\\nusing uint64 = uint_fast64_t;\\nusing PII = pair<int32, int32>;\\nusing PLL = pair<int64, int64>;\\n\\nconst double eps = 1e-10;\\n\\ntemplate<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}\\ntemplate<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}\\n\\ntemplate<typename T>\\nvector<T> make_v(size_t a){return vector<T>(a);}\\n\\ntemplate<typename T,typename... Ts>\\nauto make_v(size_t a,Ts... ts){\\n\\treturn vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\\n}\\n\\ntemplate<typename T,typename U,typename... V>\\ntypename enable_if<is_same<T, U>::value!=0>::type\\nfill_v(U &u,const V... v){u=U(v...);}\\n\\ntemplate<typename T,typename U,typename... V>\\ntypename enable_if<is_same<T, U>::value==0>::type\\nfill_v(U &u,const V... v){\\n\\tfor(auto &e:u) fill_v<T>(e,v...);\\n}\\n\\nint main(void){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\tint64 N;\\n\\tcin >> N;\\n\\tstring s;\\n\\tcin >> s;\\n\\tpriority_queue<pair<int, char>> pq;\\n\\tint cnt[26] = {};\\n\\tREP(i, N) {\\n\\t cnt[s[i] - 'a']++;\\n\\t}\\n int last[26] = {};\\n\\tREP(i, 26) {\\n\\t if (cnt[i])\\n \\t pq.emplace(cnt[i], (char)(i + 'a'));\\n\\t last[i] = -INF;\\n\\t}\\n\\tbool ok = 1;\\n\\tstring res(\\\"\\\");\\n\\twhile (pq.size()) {\\n\\t ok = 0;\\n\\t vector<pair<int, char>> v;\\n//\\t cout << pq.size() << endl;\\n\\t while (pq.size()) {\\n\\t int num;\\n\\t char c;\\n\\t tie(num, c) = pq.top(); pq.pop();\\n//\\t cout << num << \\\" \\\" << c << \\\" \\\" << res.size() << \\\" \\\" << last[c-'a'] << endl;\\n\\t if (res.size() - last[c -'a'] > 1) {\\n\\t ok = 1;\\n\\t res += c;\\n\\t num--;\\n\\t last[c - 'a'] = res.size();\\n\\t if (num > 0)\\n \\t v.emplace_back(num, c);\\n\\t break;\\n\\t } else {\\n\\t v.emplace_back(num, c);\\n\\t }\\n\\t }\\n\\t if (!ok) break;\\n\\t for (auto& x : v) pq.push(x);\\n\\t}\\n\\tif (ok) {\\n\\t cout << res << endl;\\n\\t} else {\\n\\t cout << -1 << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3174_4844731\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(ll i=0;i<n;i++)\\n#define repl(i,l,r) for(ll i=(l);i<(r);i++)\\n#define per(i,n) for(ll i=n-1;i>=0;i--)\\n#define perl(i,r,l) for(ll i=r-1;i>=l;i--)\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define ins insert\\n#define pqueue(x) priority_queue<x,vector<x>,greater<x>>\\n#define all(x) (x).begin(),(x).end()\\n#define CST(x) cout<<fixed<<setprecision(x)\\n#define rev(x) reverse(x);\\nusing ll=long long;\\nusing vl=vector<ll>;\\nusing vvl=vector<vector<ll>>;\\nusing pl=pair<ll,ll>;\\nusing vpl=vector<pl>;\\nusing vvpl=vector<vpl>;\\nconst ll MOD=1000000007;\\nconst ll MOD9=998244353;\\nconst int inf=1e9+10;\\nconst ll INF=4e18;\\nconst ll dy[8]={1,0,-1,0,1,1,-1,-1};\\nconst ll dx[8]={0,-1,0,1,1,-1,1,-1};\\ntemplate<class T> inline bool chmin(T& a, T b) {\\n if (a >= b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<class T> inline bool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\nint main(){\\n ll n;cin >> n;\\n string s;cin >> s;\\n vl alp(26);rep(i,n){\\n alp[s[i]-'a']++;\\n }\\n string ans;\\n rep(i,n){\\n priority_queue<pair<ll,char>,vector<pair<ll,char>>,less<pair<ll,char>>> que;\\n rep(j,26){\\n que.push({alp[j],'a'+j});\\n }\\n /*rep(j,26){\\n cout << que.top().fi<<\\\" \\\"<< que.top().se <<endl;\\n que.pop();\\n }\\n return 0;*/\\n bool ok=false;\\n rep(j,26){\\n pair<ll,char> p=que.top();que.pop();\\n if(i>=1)if(ans[i-1]==p.se)continue;\\n if(i>=2)if(ans[i-2]==p.se)continue;\\n if(p.fi==0)break;\\n //cout << p.se <<endl;\\n ans+=p.se;\\n //cout << ans <<endl;\\n alp[p.se-'a']--;\\n ok=true;\\n break;\\n }\\n if(!ok) cout << -1 <<endl,exit(0);\\n }\\n cout << ans <<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3816,\n \"score_of_the_acc\": -0.1397,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3174_4844669\",\n \"code_snippet\": \"// #pragma GCC optimize(\\\"unroll-loops\\\", \\\"omit-frame-pointer\\\", \\\"inline\\\")\\n// #pragma GCC option(\\\"arch=native\\\", \\\"tune=native\\\", \\\"no-zero-upper\\\")\\n// #pragma GCC\\n// target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native\\\")\\n// #pragma GCC optimize(\\\"Ofast\\\")\\n// #pragma GCC optimize(\\\"tree-vectorize\\\",\\\"openmp\\\",\\\"predictive-commoning\\\")\\n// #pragma GCC option(\\\"D_GLIBCXX_PARALLEL\\\",\\\"openmp\\\")\\n\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vll;\\n// #define int long long\\n#define pb push_back\\n#define mp make_pair\\n#define eps 1e-9\\n#define INF 2000000000 // 2e9\\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\\n#define fi first\\n#define sec second\\n#define all(x) (x).begin(), (x).end()\\n#define sq(x) ((x) * (x))\\n#define dmp(x) cerr << #x << \\\": \\\" << x << endl;\\n\\ntemplate <class T>\\nvoid chmin(T &a, const T &b) {\\n if (a > b) a = b;\\n}\\ntemplate <class T>\\nvoid chmax(T &a, const T &b) {\\n if (a < b) a = b;\\n}\\n\\ntemplate <class T>\\nusing MaxHeap = priority_queue<T>;\\ntemplate <class T>\\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T>\\nvector<T> vect(int len, T elem) {\\n return vector<T>(len, elem);\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << p.fi << ',' << p.sec;\\n return os;\\n}\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n is >> p.fi >> p.sec;\\n return is;\\n}\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i];\\n if (i + 1 < vec.size()) os << ' ';\\n }\\n return os;\\n}\\ntemplate <class T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\\n return is;\\n}\\nvoid fastio() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(20);\\n}\\n\\n#define endl \\\"\\\\n\\\"\\n\\nvoid solve() {\\n int n;\\n string s;\\n cin >> n >> s;\\n vector<int> cnt(30);\\n for (int i = 0; i < n; i++) { cnt[s[i] - 'a']++; }\\n vector<pair<int, int>> occ;\\n for (int i = 0; i < 30; i++) { occ.emplace_back(cnt[i], i); }\\n sort(all(occ));\\n reverse(all(occ));\\n // dmp(occ);\\n set<int> idx;\\n for (int i = 0; i < n; i++) idx.insert(i);\\n vector<int> ans(n);\\n for (int i = 0; i < 30; i++) {\\n int c = occ[i].second;\\n int pre = -3;\\n for (int j = 0; j < occ[i].first; j++) {\\n auto it = idx.lower_bound(pre + 3);\\n if (it == idx.end()) {\\n cout << -1 << endl;\\n return;\\n }\\n ans[*it] = c;\\n pre = *it;\\n idx.erase(it);\\n }\\n }\\n for (int i = 0; i < n; i++) { cout << (char)(ans[i] + 'a'); }\\n cout << endl;\\n return;\\n}\\n\\nsigned main() {\\n fastio();\\n solve();\\n // int t; cin >> t; while(t--)solve();\\n\\n // int t; cin >> t;\\n // for(int i=1;i<=t;i++){\\n // cout << \\\"Case #\\\" << i << \\\": \\\";\\n // solve();\\n // }\\n return 0;\\n}\",\n \"accuracy\": 0.7391304347826086,\n \"time_ms\": 20,\n \"memory_kb\": 8084,\n \"score_of_the_acc\": -1.027,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3174_4840854\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it << \\\"> \\\"; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it.first << \\\"->\\\" << it.second << \\\"> \\\"; } return s << endl; }\\n\\n\\nstring solve(int N, const string &S) {\\n map<char,int> ma;\\n for (auto c : S) ma[c]++;\\n if (ma.size() == 1) {\\n if (N == 1) return S;\\n else return \\\"-1\\\";\\n }\\n else if (ma.size() == 2) {\\n if (N == 2) return S;\\n else return \\\"-1\\\";\\n }\\n else {\\n string res = \\\"\\\";\\n while (!ma.empty()) {\\n int vmax = -1;\\n char pmax;\\n for (auto it : ma) {\\n if (res.size() > 0 && res.back() == it.first) continue;\\n if (res.size() > 1 && res[res.size() - 2] == it.first) continue;\\n if (chmax(vmax, it.second)) pmax = it.first;\\n }\\n if (vmax == -1) return \\\"-1\\\";\\n res += pmax;\\n ma[pmax]--;\\n if (ma[pmax] == 0) ma.erase(pmax);\\n }\\n return res;\\n }\\n}\\n\\nint main() {\\n int N;\\n string S;\\n cin >> N >> S;\\n cout << solve(N, S) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -0.0171,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1986,"cells":{"group_id":{"kind":"string","value":"aoj_3168_cpp"},"problem_description":{"kind":"string","value":"E: えびちゃんを捕獲せよ\n問題\nあ やせいの えびちゃんが とびだしてきた！\n頂点数 $N$、辺数 $M$ の無向グラフで表されるフィールドがある。頂点は $1$ から $N$ まで、辺は $1$ から $M$ までで、それぞれ番号付けされている。また、各頂点には\na\nから\nz\nの英小文字のいずれかが $1$ つ書かれている。\nえびちゃんは任意の頂点に出現する可能性がある。\nえびちゃんは、ある頂点に出現した後、すぐに別の頂点へワープして逃げてしまう。\nえびちゃんは、次の条件をすべて満たすとき、頂点 $u$ から頂点 $v$ へワープすることができる。\n$u$ から $v$ へ、$K$ 本以下の辺を辿って移動できる。\n$u$ に書かれた文字と $v$ に書かれた文字が隣り合っている。\n「英小文字 $c$ と隣り合っている文字」とは、英小文字のアルファベットを辞書順に並べ、\na\nと\nz\nをつなげて円環状に並べたものの中で $c$ と隣接している $2$ 文字を指す。たとえば、\nb\nは\na\nと\nc\nに隣り合っており、\nz\nは\ny\nと\na\nに隣り合っている。\nあなたは、いくつかの頂点に罠を設置して、えびちゃんを捕獲する体制を整えることにした。\nえびちゃんは罠のある頂点に侵入すると、即座に捕まってしまう。\nえびちゃんがどの頂点に現れたとしても身動きが取れないようにするために必要な罠の個数の最小値を求めよ。ただし、身動きが取れないとは、「現れた頂点に罠がある」または「罠のない頂点にワープできない」のいずれかが成り立つことを指す。\n入力形式\n$N$ $M$ $K$\n$c_1$ $c_2$ … $c_N$\n$u_1$ $v_1$\n…\n$u_M$ $v_M$\n$1$ 行目には、頂点数 $N$、辺数 $M$、えびちゃんのワープに関する値 $K$ が与えられる。\n$2$ 行目には、各頂点に書かれた文字がスペース区切りで与えられる。$c_i$ ($1\\leq i\\leq N$) は、$i$ 番目の頂点に書かれた文字を表す。\n$2+i$ 行目 ($1\\leq i\\leq M$) には、$i$ 本目の辺の情報が与えられる。頂点 $u_i$ と $v_i$ を双方向に結ぶことを意味する。\n制約\n$2\\leq N\\leq 300$\n$1\\leq M\\leq N(N-1)/2$\n$1\\leq K\\leq 300$\n$c_i$ ($1\\leq i\\leq N$) は英小文字である。\n多重辺および自己ループは存在しない。\n出力形式\n答えを一行に出力せよ。\n入力例1\n5 3 2\na b c d z\n1 2\n1 3\n3 5\n出力例1\n2\nえびちゃんがワープできる頂点の組は $(1, 2)$、$(1, 5)$、$(2, 3)$ であり、例として頂点 $2$ と頂点 $5$ に設置することで目標を達成することができる。また、$1$ 個以下の罠で目標を達成することはできない。なお、頂点 $4$ からはどこにもワープできないため、罠を設置する必要はないことに注意せよ。\n入力例2\n5 5 1\na b c d z\n1 2\n1 3\n1 4\n1 5\n3 4\n出力例2\n2\nえびちゃんがワープできる頂点の組は $(1, 2)$、$(1, 5)$、$(3, 4)$ であり、例として頂点 $1$ と頂点 $3$ に設置することで目標を達成することができる。このケースにおいても、$1$ 個以下の罠では目標を達成することはできない。\n入力例3\n4 6 3\nh u p c\n1 2\n1 3\n1 4\n2 3\n2 4\n3 4\n出力例3\n0\nえびちゃんはどの頂点間もワープできないので、罠を用意する必要はない。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3168_10848645","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define INF 1e8\nvoid warshall_floyd(vector<vector<int>> &M) {\n int n = M.size();\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n for (int k = 0; k < n; k++)\n M[j][k] = min(M[j][k], M[j][i] + M[i][k]);\n}\n\nstruct edge {\n int to, cap, rev;\n};\n\nvoid add_edge(vector<vector<edge>> &G, int from, int to, int cap) {\n G[from].emplace_back((edge) {to, cap, (int) G[to].size()});\n G[to].emplace_back((edge) {from, 0, (int) G[from].size() - 1});\n}\n\nint dfs_f(vector<vector<edge>> &G, vector<bool> &used, int v, int t, int f) {\n if (v == t) return f;\n used[v] = true;\n for (int i = 0; i < G[v].size(); i++) {\n edge &e = G[v][i];\n if (!used[e.to] && e.cap > 0) {\n int d = dfs_f(G, used, e.to, t, min(f, e.cap));\n if (d > 0) {\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n}\n\nint max_flow(vector<vector<edge>> &G, int s, int t) {\n int flow = 0;\n while (true) {\n vector<bool> used(G.size(), false);\n int f = dfs_f(G, used, s, t, INF);\n if (f == 0) return flow;\n flow += f;\n }\n}\n#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);\nint main(){\n FIO\n int n, m, k;\n cin >> n >> m >> k;\n\n vector<char> c(n);\n for (int i = 0; i < n; i++) cin >> c.at(i);\n\n vector<vector<int>> M(n, vector<int>(n, INF));\n\n for (int i = 0; i < m; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n M[u][v] = 1;\n M[v][u] = 1;\n }\n\n warshall_floyd(M);\n\n vector<vector<edge>> G(2 * n + 2);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (i == j) continue;\n if (M[i][j] <= k && (c[i] + 1 == c[j] || c[j] + 1 == c[i] || (c[i] == 'a' && c[j] == 'z') || (c[i] == 'z' && c[j] == 'a'))) {\n add_edge(G, i, n + j, 1);\n add_edge(G, j, n + i, 1);\n }\n }\n }\n\n for (int i = 0; i < n; i++) add_edge(G, 2 * n, i, 1);\n for (int i = 0; i < n; i++) add_edge(G, n + i, 2 * n + 1, 1);\n\n cout << max_flow(G, 2 * n, 2 * n + 1) / 2 << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":7280,"score_of_the_acc":-1.0104,"final_rank":11},{"submission_id":"aoj_3168_8704655","code_snippet":"#line 1 \"3168.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3168\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Utility/U32Pair.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Utility/U32Pair.hpp\"\n\n#include <functional>\n#line 7 \"/home/zawatin/compro/cp-documentation/Src/Utility/U32Pair.hpp\"\n\nnamespace zawa {\n\nclass U32Pair {\nprivate:\n static constexpr u32 SHIFT{32};\n static constexpr u32 MASK{static_cast<u32>((1LL << SHIFT) - 1)};\n u64 value_{};\npublic:\n constexpr U32Pair() {}\n constexpr U32Pair(u32 first, u32 second) {\n value_ = (static_cast<u64>(first) << SHIFT) | second;\n }\n constexpr u32 first() const noexcept {\n return static_cast<u32>(value_ >> SHIFT);\n }\n constexpr u32 second() const noexcept {\n return static_cast<u32>(value_ & MASK);\n }\n constexpr u64 combined() const noexcept {\n return value_;\n }\n constexpr U32Pair& operator=(const U32Pair& rhs) {\n value_ = rhs.value_;\n return *this;\n }\n friend constexpr bool operator==(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ == rhs.value_;\n }\n friend constexpr bool operator!=(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ != rhs.value_;\n }\n friend constexpr bool operator<(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ < rhs.value_;\n }\n friend constexpr bool operator<=(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ <= rhs.value_;\n }\n friend constexpr bool operator>(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ > rhs.value_;\n }\n friend constexpr bool operator>=(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ >= rhs.value_;\n }\n friend std::ostream& operator<<(std::ostream& os, const U32Pair& pair) {\n os << '(' << pair.first() << ',' << pair.second() << ')';\n return os;\n }\n};\n\nstruct U32PairHash {\n usize operator()(const U32Pair& pair) const noexcept {\n return std::hash<u64>{}(pair.combined());\n }\n};\n\n} // namespace zawa\n#line 5 \"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <type_traits>\n#include <vector>\n#include <queue>\n\nnamespace zawa {\n\ntemplate <class Cap> \nclass Dinic {\nprivate:\n static_assert(std::is_signed_v<Cap>, \"Cap must be signed\");\n usize n_{}, m_{};\n static constexpr u32 invalid() noexcept {\n return std::numeric_limits<u32>::max();\n }\npublic:\n inline usize size() const noexcept {\n return n_;\n }\n inline usize edgeNumber() const noexcept {\n return m_;\n }\nprivate:\n struct Edge {\n u32 to{}, rev{};\n Cap residual{};\n Edge() = default;\n Edge(u32 to, u32 rev, const Cap& residual) \n : to{to}, rev{rev}, residual{residual} {}\n };\n\n std::vector<std::vector<Edge>> g_;\n std::vector<U32Pair> edges_;\n std::vector<u32> label_, cur_;\n\n bool dualStep(u32 s, u32 t) {\n std::fill(label_.begin(), label_.end(), invalid());\n label_[s] = 0;\n std::queue<u32> queue{ { s } };\n while (queue.size()) {\n u32 v{queue.front()};\n queue.pop();\n for (const Edge& e : g_[v]) if (e.residual > 0) {\n if (label_[e.to] > label_[v] + 1) {\n label_[e.to] = label_[v] + 1;\n if (e.to == t) return true;\n queue.emplace(e.to);\n }\n }\n }\n return false;\n }\n\n bool admissible(u32 v, const Edge& e) const noexcept {\n return e.residual > 0 and label_[v] + 1 == label_[e.to];\n }\n\n inline void flow(Edge& e, Cap f) {\n e.residual -= f;\n g_[e.to][e.rev].residual += f;\n }\n\n Cap dfs(u32 v, u32 t, Cap up) {\n if (v == t) return up;\n Cap res{};\n for (u32& i{cur_[v]} ; i < g_[v].size() ; i++) {\n if (!admissible(v, g_[v][i])) continue;\n Cap f{dfs(g_[v][i].to, t, std::min(g_[v][i].residual, up - res))};\n if (f == 0) continue;\n flow(g_[v][i], f);\n res += f;\n if (res == up) return res;\n }\n return res;\n }\n\n Cap primalStep(u32 s, u32 t) {\n std::fill(cur_.begin(), cur_.end(), 0u);\n cur_[t] = g_[t].size();\n Cap res{};\n while (true) {\n Cap f{dfs(s, t, std::numeric_limits<Cap>::max())};\n if (f == 0) break;\n res += f;\n }\n return res;\n }\n\n const Edge& edge(u32 i) const noexcept {\n return g_[edges_[i].first()][edges_[i].second()];\n }\n const Edge& reverse(u32 i) const noexcept {\n const Edge& e{edge(i)};\n return g_[e.to][e.rev];\n }\n\npublic:\n Dinic() = default;\n Dinic(u32 n, u32 m = 0u) \n : n_{n}, m_{m}, g_(n), edges_{}, label_(n), cur_(n) {\n g_.shrink_to_fit();\n label_.shrink_to_fit();\n cur_.shrink_to_fit();\n edges_.reserve(m);\n }\n\n u32 addEdge(u32 u, u32 v, const Cap& cap) {\n assert(u < size());\n assert(v < size());\n u32 id{static_cast<u32>(g_[u].size())};\n u32 revId{u == v ? id + 1 : static_cast<u32>(g_[v].size())};\n u32 res{static_cast<u32>(edges_.size())};\n edges_.emplace_back(u, id);\n g_[u].emplace_back(v, revId, cap);\n g_[v].emplace_back(u, id, Cap{});\n return res;\n }\n\n const Cap& flowed(u32 id) const noexcept {\n assert(id < edgeNumber());\n return reverse(id).residual;\n }\n const Cap& residual(u32 id) const noexcept {\n assert(id < edgeNumber());\n return edge(id).residual;\n }\n const Cap& capacity(u32 id) const noexcept {\n assert(id < edgeNumber());\n return edge(id).residual + reverse(id).residual;\n }\n\n Cap flow(u32 s, u32 t) {\n assert(s < size());\n assert(t < size()); \n Cap res{};\n while (dualStep(s, t)) {\n res += primalStep(s, t);\n }\n return res;\n }\n\n std::vector<bool> cut(u32 s) {\n std::vector<bool> res(size());\n res[s] = true;\n std::queue<u32> queue{ { s } };\n while (queue.size()) {\n u32 v{queue.front()};\n queue.pop();\n for (const auto& e : g_[v]) if (e.cap > 0 and !res[e.to]) {\n res[e.to] = true;\n queue.emplace(e.to);\n }\n }\n return res;\n } \n};\n\n} // namespace zawa\n#line 5 \"3168.test.cpp\"\n\n#line 7 \"3168.test.cpp\"\n#include <utility>\n#line 9 \"3168.test.cpp\"\n\nbool adjust(char a, char b) {\n if (a > b) std::swap(a, b);\n if (a == 'a' and b == 'z') return true;\n return (int)(b - a) == 1;\n}\n\nint main() {\n using namespace zawa;\n int n, m, k; std::cin >> n >> m >> k;\n std::vector<char> s(n);\n for (auto& c : s) std::cin >> c;\n const int INF{(int)1e9};\n std::vector g(n, std::vector<int>(n, INF));\n for (int i{} ; i < n ; i++) g[i][i] = 0;\n for (int _{} ; _ < m ; _++) {\n int u, v; std::cin >> u >> v;\n u--; v--;\n g[u][v] = g[v][u] = 1;\n }\n for (int k{} ; k < n ; k++) {\n for (int i{} ; i < n ; i++) {\n for (int j{} ; j < n ; j++) {\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\n }\n }\n }\n Dinic<int> solver(2 * n + 2);\n for (int i{} ; i < n ; i++) {\n solver.addEdge(2 * n, i, 1);\n solver.addEdge(n + i, 2 * n + 1, 1);\n }\n for (int i{} ; i < n ; i++) {\n for (int j{i + 1} ; j < n ; j++) {\n if (g[i][j] > k) continue;\n if (!adjust(s[i], s[j])) continue;\n if (s[i] % 2) {\n solver.addEdge(i, n + j, 1);\n }\n else {\n solver.addEdge(j, n + i, 1);\n }\n }\n }\n int ans{solver.flow(2 * n, 2 * n + 1)};\n std::cout << ans << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":4832,"score_of_the_acc":-0.3682,"final_rank":3},{"submission_id":"aoj_3168_8652993","code_snippet":"#line 1 \"3168.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3168\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\nnamespace zawa {\n\ntemplate <class Cap>\nclass Dinic {\nprivate:\n static_assert(std::is_signed_v<Cap>, \"Cap must be signed\");\n static constexpr u32 INVALID{static_cast<u32>(-1)};\n using EdgePointer = std::pair<u32, u32>;\npublic:\n static constexpr u32 invalid() noexcept {\n return INVALID;\n }\nprivate:\n class ResidualGraph {\n public:\n struct Edge {\n u32 from{}, to{};\n Cap cap{};\n u32 rev{}, id{};\n Edge() = default;\n Edge(u32 from, u32 to, const Cap& cap, u32 rev, u32 id)\n : from{from}, to{to}, cap{cap}, rev{rev}, id{id} {}\n EdgePointer reverseEdgePointer() const {\n return EdgePointer{to, rev};\n }\n }; \n private:\n usize n_{}, m_{};\n std::vector<std::vector<Edge>> g_{};\n public:\n ResidualGraph() = default;\n ResidualGraph(usize n) : n_{n}, m_{}, g_(n) {\n g_.shrink_to_fit();\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n inline usize edgeNumber() const noexcept {\n return m_;\n }\n u32 invalidEdgePointer(u32 v) const noexcept {\n return g_[v].size();\n }\n\n std::vector<Edge>& operator[](usize i) noexcept {\n return g_[i];\n }\n const std::vector<Edge>& operator[](usize i) const noexcept {\n return g_[i];\n }\n Edge& operator[](const EdgePointer& e) noexcept {\n return g_[e.first][e.second];\n }\n const Edge& operator[](const EdgePointer& e) const noexcept {\n return g_[e.first][e.second];\n }\n\n const Edge& reverseEdge(const EdgePointer& pos) {\n return g_[g_[pos].reverseEdgePointer()];\n }\n \n u32 addEdge(u32 from, u32 to, const Cap& cap, u32 id) {\n u32 i{static_cast<u32>(g_[from].size())};\n u32 j{static_cast<u32>(from == to ? i + 1 : g_[to].size())};\n g_[from].emplace_back(from, to, cap, j, id);\n g_[to].emplace_back(to, from, Cap{}, i, id);\n m_++;\n return i;\n }\n void update(Edge& e, const Cap& flow) {\n assert(e.cap >= flow);\n e.cap -= flow;\n (*this)[e.reverseEdgePointer()].cap += flow;\n }\n };\n\n using Edge = typename ResidualGraph::Edge;\n\n ResidualGraph graph_;\n std::vector<u32> label_;\n std::vector<EdgePointer> edges_;\n\npublic:\n inline usize size() const noexcept {\n return graph_.size();\n }\n inline usize edgeNumber() const noexcept { \n return graph_.edgeNumber();\n }\nprivate:\n\n bool admissible(const Edge& e) {\n return e.cap > 0 and label_[e.from] + 1 == label_[e.to];\n }\n\n bool dualStep(u32 s, u32 t) {\n std::fill(label_.begin(), label_.end(), invalid());\n label_[s] = 0;\n std::vector<u32> queue;\n queue.reserve(size());\n queue.emplace_back(s);\n for (u32 topQ{} ; topQ < queue.size() ; topQ++) {\n u32 v{queue[topQ]};\n for (const auto& e : graph_[v]) if (e.cap > 0) {\n if (label_[e.to] > label_[v] + 1) {\n label_[e.to] = label_[v] + 1;\n queue.emplace_back(e.to);\n }\n }\n }\n return label_[t] < size();\n }\n\n bool findAdmissiblePath(u32 s, u32 t, std::vector<EdgePointer>& path) {\n std::vector<u32> currentEdge(size());\n currentEdge[t] = graph_.invalidEdgePointer(t);\n u32 v{s};\n while (true) {\n while (currentEdge[v] != graph_.invalidEdgePointer(v)) {\n const Edge& now{graph_[v][currentEdge[v]]};\n if (admissible(now)) {\n path.emplace_back(v, currentEdge[v]);\n v = now.to;\n }\n else {\n currentEdge[v]++;\n }\n }\n if (v == s) return false;\n if (v == t) return true;\n if (v != t) {\n v = path.back().first;\n path.pop_back();\n currentEdge[v]++;\n }\n }\n assert(false);\n return false;\n }\n\n Cap flow(const std::vector<EdgePointer>& path) {\n auto min{std::min_element(path.begin(), path.end(), [&](const EdgePointer& l, const EdgePointer& r) -> bool {\n return graph_[l].cap < graph_[r].cap;\n })};\n Cap amount{graph_[*min].cap};\n assert(amount > 0);\n for (const auto& pos : path) {\n Edge& e{graph_[pos]};\n graph_.update(e, amount);\n }\n return amount;\n }\n\n Cap primalStep(u32 s, u32 t) {\n std::vector<EdgePointer> path;\n Cap res{};\n while (findAdmissiblePath(s, t, path)) {\n res += flow(path);\n path.clear();\n }\n return res;\n }\n\npublic:\n\n Dinic() = default;\n // @param m: 辺数をここに入れるとreserveしてくれる\n Dinic(usize n, usize m = usize{}) : graph_{n}, label_(n) {\n label_.shrink_to_fit();\n edges_.reserve(m);\n }\n\n u32 addEdge(u32 from, u32 to, const Cap& cap, u32 id = invalid()) {\n assert(from < size());\n assert(to < size());\n u32 res{static_cast<u32>(edges_.size())};\n edges_.emplace_back(from, graph_.addEdge(from, to, cap, id));\n return res;\n }\n\n Cap residual(u32 id) {\n assert(id < edgeNumber());\n return graph_[edges_[id]].cap;\n }\n\n Cap flowed(u32 id) {\n assert(id < edgeNumber());\n return graph_.reverseEdge(edges_[id]).cap;\n }\n\n Cap originCap(u32 id) {\n assert(id < edgeNumber());\n EdgePointer e{edges_[id]};\n return graph_[e].cap + graph_.reverseEdge(edges_[id]).cap;\n }\n\n Cap flow(u32 s, u32 t) {\n assert(s < size());\n assert(t < size());\n Cap res{};\n while (dualStep(s, t)) {\n res += primalStep(s, t);\n }\n return res;\n }\n};\n\n} // namespace zawa\n#line 5 \"3168.test.cpp\"\n\n#line 9 \"3168.test.cpp\"\n\nbool adjust(char a, char b) {\n if (a > b) std::swap(a, b);\n if (a == 'a' and b == 'z') return true;\n return (int)(b - a) == 1;\n}\n\nint main() {\n using namespace zawa;\n int n, m, k; std::cin >> n >> m >> k;\n std::vector<char> s(n);\n for (auto& c : s) std::cin >> c;\n const int INF{(int)1e9};\n std::vector g(n, std::vector<int>(n, INF));\n for (int i{} ; i < n ; i++) g[i][i] = 0;\n for (int _{} ; _ < m ; _++) {\n int u, v; std::cin >> u >> v;\n u--; v--;\n g[u][v] = g[v][u] = 1;\n }\n for (int k{} ; k < n ; k++) {\n for (int i{} ; i < n ; i++) {\n for (int j{} ; j < n ; j++) {\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\n }\n }\n }\n Dinic<int> solver(2 * n + 2);\n for (int i{} ; i < n ; i++) {\n solver.addEdge(2 * n, i, 1);\n solver.addEdge(n + i, 2 * n + 1, 1);\n }\n for (int i{} ; i < n ; i++) {\n for (int j{i + 1} ; j < n ; j++) {\n if (g[i][j] > k) continue;\n if (!adjust(s[i], s[j])) continue;\n if (s[i] % 2) {\n solver.addEdge(i, n + j, 1);\n }\n else {\n solver.addEdge(j, n + i, 1);\n }\n }\n }\n int ans{solver.flow(2 * n, 2 * n + 1)};\n std::cout << ans << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":5384,"score_of_the_acc":-0.513,"final_rank":9},{"submission_id":"aoj_3168_8652453","code_snippet":"#line 1 \"3168.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3168\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\nnamespace zawa {\n\ntemplate <class Cap>\nclass Dinic {\nprivate:\n static_assert(std::is_signed_v<Cap>, \"Cap must be signed\");\n static constexpr u32 INVALID{static_cast<u32>(-1)};\npublic:\n static constexpr u32 invalid() noexcept {\n return INVALID;\n }\nprivate:\n class ResidualGraph {\n public:\n struct Edge {\n u32 from{}, to{};\n Cap cap{};\n u32 rev{}, id{};\n Edge() = default;\n Edge(u32 from, u32 to, const Cap& cap, u32 rev, u32 id)\n : from{from}, to{to}, cap{cap}, rev{rev}, id{id} {}\n }; \n private:\n usize n_{}, m_{};\n std::vector<std::vector<Edge>> g_{};\n public:\n ResidualGraph() = default;\n ResidualGraph(usize n) : n_{n}, m_{}, g_(n) {\n g_.shrink_to_fit();\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n inline usize edgeNumber() const noexcept {\n return m_;\n }\n\n std::vector<Edge>& operator[](usize i) noexcept {\n assert(i < size());\n return g_[i];\n }\n const std::vector<Edge>& operator[](usize i) const noexcept {\n assert(i < size());\n return g_[i];\n }\n\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id) {\n u32 i{static_cast<u32>(g_[from].size())};\n u32 j{static_cast<u32>(from == to ? i + 1 : g_[to].size())};\n g_[from].emplace_back(from, to, cap, j, id);\n g_[to].emplace_back(to, from, Cap{}, i, id);\n m_++;\n }\n void update(Edge& e, const Cap& flow) {\n assert(e.cap >= flow);\n e.cap -= flow;\n g_[e.to][e.rev].cap += flow;\n }\n u32 invalidEdgePointer(u32 v) const noexcept {\n return g_[v].size();\n }\n };\n\n ResidualGraph graph_;\n std::vector<u32> label_;\n\npublic:\n using Edge = typename ResidualGraph::Edge;\n inline usize size() const noexcept {\n return graph_.size();\n }\nprivate:\n\n bool admissible(const Edge& e) {\n return e.cap > 0 and label_[e.from] + 1 == label_[e.to];\n }\n\n bool dualStep(u32 s, u32 t) {\n std::fill(label_.begin(), label_.end(), invalid());\n label_[s] = 0;\n std::vector<u32> queue;\n queue.reserve(size());\n queue.emplace_back(s);\n for (u32 topQ{} ; topQ < queue.size() ; topQ++) {\n u32 v{queue[topQ]};\n for (const auto& e : graph_[v]) if (e.cap > 0) {\n if (label_[e.to] > label_[v] + 1) {\n label_[e.to] = label_[v] + 1;\n queue.emplace_back(e.to);\n }\n }\n }\n return label_[t] < size();\n }\n\n using EdgePointer = std::pair<u32, u32>;\n\n bool findAdmissiblePath(u32 s, u32 t, std::vector<EdgePointer>& path) {\n std::vector<u32> currentEdge(size());\n currentEdge[t] = graph_.invalidEdgePointer(t);\n u32 v{s};\n while (true) {\n while (currentEdge[v] != graph_.invalidEdgePointer(v)) {\n const Edge& now{graph_[v][currentEdge[v]]};\n if (admissible(now)) {\n path.emplace_back(v, currentEdge[v]);\n v = now.to;\n }\n else {\n currentEdge[v]++;\n }\n }\n if (v == s) return false;\n if (v == t) return true;\n if (v != t) {\n v = path.back().first;\n path.pop_back();\n currentEdge[v]++;\n }\n }\n assert(false);\n return false;\n }\n\n Cap flow(const std::vector<EdgePointer>& path) {\n auto min{std::min_element(path.begin(), path.end(), [&](const EdgePointer& l, const EdgePointer& r) -> bool {\n return graph_[l.first][l.second].cap < graph_[r.first][r.second].cap;\n })};\n Cap amount{graph_[min->first][min->second].cap};\n assert(amount > 0);\n for (const auto& [x, y] : path) {\n Edge& e{graph_[x][y]};\n graph_.update(e, amount);\n }\n return amount;\n }\n\n Cap primalStep(u32 s, u32 t) {\n std::vector<EdgePointer> path;\n Cap res{};\n while (findAdmissiblePath(s, t, path)) {\n res += flow(path);\n path.clear();\n }\n return res;\n }\n\npublic:\n\n Dinic() = default;\n Dinic(usize n) : graph_{n}, label_(n) {\n label_.shrink_to_fit();\n }\n\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id = invalid()) {\n assert(from < size());\n assert(to < size());\n graph_.addEdge(from, to, cap, id);\n }\n\n Cap flow(u32 s, u32 t) {\n assert(s < size());\n assert(t < size());\n Cap res{};\n while (dualStep(s, t)) {\n res += primalStep(s, t);\n }\n return res;\n }\n};\n\n} // namespace zawa\n#line 5 \"3168.test.cpp\"\n\n#line 9 \"3168.test.cpp\"\n\nbool adjust(char a, char b) {\n if (a > b) std::swap(a, b);\n if (a == 'a' and b == 'z') return true;\n return (int)(b - a) == 1;\n}\n\nint main() {\n using namespace zawa;\n int n, m, k; std::cin >> n >> m >> k;\n std::vector<char> s(n);\n for (auto& c : s) std::cin >> c;\n const int INF{(int)1e9};\n std::vector g(n, std::vector<int>(n, INF));\n for (int i{} ; i < n ; i++) g[i][i] = 0;\n for (int _{} ; _ < m ; _++) {\n int u, v; std::cin >> u >> v;\n u--; v--;\n g[u][v] = g[v][u] = 1;\n }\n for (int k{} ; k < n ; k++) {\n for (int i{} ; i < n ; i++) {\n for (int j{} ; j < n ; j++) {\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\n }\n }\n }\n Dinic<int> solver(2 * n + 2);\n for (int i{} ; i < n ; i++) {\n solver.addEdge(2 * n, i, 1);\n solver.addEdge(n + i, 2 * n + 1, 1);\n }\n for (int i{} ; i < n ; i++) {\n for (int j{i + 1} ; j < n ; j++) {\n if (g[i][j] > k) continue;\n if (!adjust(s[i], s[j])) continue;\n if (s[i] % 2) {\n solver.addEdge(i, n + j, 1);\n }\n else {\n solver.addEdge(j, n + i, 1);\n }\n }\n }\n int ans{solver.flow(2 * n, 2 * n + 1)};\n std::cout << ans << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":5224,"score_of_the_acc":-0.4711,"final_rank":7},{"submission_id":"aoj_3168_8652444","code_snippet":"#line 1 \"3168.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3168\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\n// #include <iostream>\n\nnamespace zawa {\n\ntemplate <class Cap>\nclass Dinic {\nprivate:\n static_assert(std::is_signed_v<Cap>, \"Cap must be signed\");\n static constexpr u32 INVALID{static_cast<u32>(-1)};\npublic:\n static constexpr u32 invalid() noexcept {\n return INVALID;\n }\nprivate:\n class ResidualGraph {\n public:\n struct Edge {\n u32 from{}, to{};\n Cap cap{};\n u32 rev{}, id{};\n Edge() = default;\n Edge(u32 from, u32 to, const Cap& cap, u32 rev, u32 id)\n : from{from}, to{to}, cap{cap}, rev{rev}, id{id} {}\n }; \n private:\n usize n_{}, m_{};\n std::vector<std::vector<Edge>> g_{};\n public:\n ResidualGraph() = default;\n ResidualGraph(usize n) : n_{n}, m_{}, g_(n) {\n g_.shrink_to_fit();\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n inline usize edgeNumber() const noexcept {\n return m_;\n }\n\n std::vector<Edge>& operator[](usize i) noexcept {\n assert(i < size());\n return g_[i];\n }\n const std::vector<Edge>& operator[](usize i) const noexcept {\n assert(i < size());\n return g_[i];\n }\n\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id) {\n u32 i{static_cast<u32>(g_[from].size())};\n u32 j{static_cast<u32>(from == to ? i + 1 : g_[to].size())};\n g_[from].emplace_back(from, to, cap, j, id);\n g_[to].emplace_back(to, from, Cap{}, i, id);\n m_++;\n }\n void update(Edge& e, const Cap& flow) {\n assert(e.cap >= flow);\n e.cap -= flow;\n g_[e.to][e.rev].cap += flow;\n }\n u32 invalidEdgePointer(u32 v) const noexcept {\n return g_[v].size();\n }\n };\n\n ResidualGraph graph_;\n std::vector<u32> label_;\n\npublic:\n using Edge = typename ResidualGraph::Edge;\n inline usize size() const noexcept {\n return graph_.size();\n }\nprivate:\n\n bool admissible(const Edge& e) {\n return e.cap > 0 and label_[e.from] + 1 == label_[e.to];\n }\n\n bool dualStep(u32 s, u32 t) {\n std::fill(label_.begin(), label_.end(), invalid());\n label_[s] = 0;\n std::vector<u32> queue;\n queue.reserve(size());\n queue.emplace_back(s);\n for (u32 topQ{} ; topQ < queue.size() ; topQ++) {\n u32 v{queue[topQ]};\n for (const auto& e : graph_[v]) if (e.cap > 0) {\n if (label_[e.to] > label_[v] + 1) {\n label_[e.to] = label_[v] + 1;\n queue.emplace_back(e.to);\n }\n }\n }\n return label_[t] < size();\n }\n\n using EdgePointer = std::pair<u32, u32>;\n\n bool findAdmissiblePath(u32 s, u32 t, std::vector<EdgePointer>& path) {\n std::vector<u32> currentEdge(size());\n currentEdge[t] = graph_.invalidEdgePointer(t);\n u32 v{s};\n while (true) {\n // for (auto [x, y] : path) {\n // std::cout << '(' << x << ',' << y << ',' << graph_[x][y].cap << ')' << ' ';\n // }\n // std::cout << std::endl;\n while (currentEdge[v] != graph_.invalidEdgePointer(v)) {\n const Edge& now{graph_[v][currentEdge[v]]};\n if (admissible(now)) {\n // std::cout << \"find edge \" << '(' << v << ',' << currentEdge[v] << ',' << now.cap << ')' << std::endl;\n path.emplace_back(v, currentEdge[v]);\n v = now.to;\n // std::cout << \"v become \" << v << std::endl;\n }\n else {\n currentEdge[v]++;\n }\n }\n if (v == s) return false;\n if (v == t) return true;\n if (v != t) {\n // std::cout << \"v rollback \" << std::endl;\n v = path.back().first;\n // std::cout << \"v become \" << v << std::endl;\n path.pop_back();\n currentEdge[v]++;\n }\n }\n assert(false);\n return false;\n }\n\n Cap flow(const std::vector<EdgePointer>& path) {\n // std::cout << \"flowing!!!\" << std::endl;\n // for (auto [x, y] : path) {\n // std::cout << '(' << x << ',' << y << ',' << graph_[x][y].cap << ')' << ' ';\n // }\n // std::cout << std::endl;\n auto min{std::min_element(path.begin(), path.end(), [&](const EdgePointer& l, const EdgePointer& r) -> bool {\n return graph_[l.first][l.second].cap < graph_[r.first][r.second].cap;\n })};\n Cap amount{graph_[min->first][min->second].cap};\n assert(amount > 0);\n for (const auto& [x, y] : path) {\n Edge& e{graph_[x][y]};\n graph_.update(e, amount);\n }\n return amount;\n }\n\n Cap primalStep(u32 s, u32 t) {\n std::vector<EdgePointer> path;\n Cap res{};\n while (findAdmissiblePath(s, t, path)) {\n res += flow(path);\n path.clear();\n }\n return res;\n }\n\npublic:\n\n Dinic() = default;\n Dinic(usize n) : graph_{n}, label_(n) {\n label_.shrink_to_fit();\n }\n\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id = invalid()) {\n assert(from < size());\n assert(to < size());\n graph_.addEdge(from, to, cap, id);\n }\n\n Cap flow(u32 s, u32 t) {\n assert(s < size());\n assert(t < size());\n Cap res{};\n while (dualStep(s, t)) {\n res += primalStep(s, t);\n }\n return res;\n }\n};\n\n} // namespace zawa\n#line 5 \"3168.test.cpp\"\n\n#line 9 \"3168.test.cpp\"\n\nbool adjust(char a, char b) {\n if (a > b) std::swap(a, b);\n if (a == 'a' and b == 'z') return true;\n return (int)(b - a) == 1;\n}\n\nint main() {\n using namespace zawa;\n int n, m, k; std::cin >> n >> m >> k;\n std::vector<char> s(n);\n for (auto& c : s) std::cin >> c;\n const int INF{(int)1e9};\n std::vector g(n, std::vector<int>(n, INF));\n for (int i{} ; i < n ; i++) g[i][i] = 0;\n for (int _{} ; _ < m ; _++) {\n int u, v; std::cin >> u >> v;\n u--; v--;\n g[u][v] = g[v][u] = 1;\n }\n for (int k{} ; k < n ; k++) {\n for (int i{} ; i < n ; i++) {\n for (int j{} ; j < n ; j++) {\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\n }\n }\n }\n Dinic<int> solver(2 * n + 2);\n for (int i{} ; i < n ; i++) {\n solver.addEdge(2 * n, i, 1);\n solver.addEdge(n + i, 2 * n + 1, 1);\n }\n for (int i{} ; i < n ; i++) {\n for (int j{i + 1} ; j < n ; j++) {\n if (g[i][j] > k) continue;\n if (!adjust(s[i], s[j])) continue;\n if (s[i] % 2) {\n solver.addEdge(i, n + j, 1);\n }\n else {\n solver.addEdge(j, n + i, 1);\n }\n }\n }\n int ans{solver.flow(2 * n, 2 * n + 1)};\n std::cout << ans << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":5224,"score_of_the_acc":-0.4711,"final_rank":7},{"submission_id":"aoj_3168_8652328","code_snippet":"#line 1 \"3168.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3168\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\n// #include <iostream>\n\nnamespace zawa {\n\ntemplate <class Cap>\nclass Dinic {\nprivate:\n static_assert(std::is_signed_v<Cap>, \"Cap must be signed\");\n static constexpr u32 INVALID{static_cast<u32>(-1)};\npublic:\n static constexpr u32 invalid() noexcept {\n return INVALID;\n }\nprivate:\n class ResidualGraph {\n public:\n struct Edge {\n u32 from{}, to{};\n Cap cap{};\n u32 rev{}, id{};\n Edge() = default;\n Edge(u32 from, u32 to, const Cap& cap, u32 rev, u32 id)\n : from{from}, to{to}, cap{cap}, rev{rev}, id{id} {}\n }; \n private:\n usize n_{}, m_{};\n std::vector<std::vector<Edge>> g_{};\n public:\n ResidualGraph() = default;\n ResidualGraph(usize n) : n_{n}, m_{}, g_(n) {\n g_.shrink_to_fit();\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n inline usize edgeNumber() const noexcept {\n return m_;\n }\n\n std::vector<Edge>& operator[](usize i) noexcept {\n assert(i < size());\n return g_[i];\n }\n const std::vector<Edge>& operator[](usize i) const noexcept {\n assert(i < size());\n return g_[i];\n }\n\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id) {\n u32 i{static_cast<u32>(g_[from].size())};\n u32 j{static_cast<u32>(from == to ? i + 1 : g_[to].size())};\n g_[from].emplace_back(from, to, cap, j, id);\n g_[to].emplace_back(to, from, Cap{}, j, id);\n m_++;\n }\n void update(Edge& e, const Cap& flow) {\n assert(e.cap >= flow);\n e.cap -= flow;\n g_[e.to][e.rev].cap += flow;\n }\n u32 invalidEdgePointer(u32 v) const noexcept {\n return g_[v].size();\n }\n };\n\n ResidualGraph graph_;\n std::vector<u32> label_;\n\npublic:\n using Edge = typename ResidualGraph::Edge;\n inline usize size() const noexcept {\n return graph_.size();\n }\nprivate:\n\n bool admissible(const Edge& e) {\n return e.cap > 0 and label_[e.from] + 1 == label_[e.to];\n }\n\n bool dualStep(u32 s, u32 t) {\n std::fill(label_.begin(), label_.end(), invalid());\n label_[s] = 0;\n std::vector<u32> queue;\n queue.reserve(size());\n queue.emplace_back(s);\n for (u32 topQ{} ; topQ < queue.size() ; topQ++) {\n u32 v{queue[topQ]};\n for (const auto& e : graph_[v]) if (e.cap > 0) {\n if (label_[e.to] > label_[v] + 1) {\n label_[e.to] = label_[v] + 1;\n queue.emplace_back(e.to);\n }\n }\n }\n return label_[t] < size();\n }\n\n using EdgePointer = std::pair<u32, u32>;\n\n bool findAdmissiblePath(u32 s, u32 t, std::vector<EdgePointer>& path) {\n std::vector<u32> currentEdge(size());\n currentEdge[t] = graph_.invalidEdgePointer(t);\n u32 v{s};\n while (true) {\n // for (auto [x, y] : path) {\n // std::cout << '(' << x << ',' << y << ',' << graph_[x][y].cap << ')' << ' ';\n // }\n // std::cout << std::endl;\n while (currentEdge[v] != graph_.invalidEdgePointer(v)) {\n const Edge& now{graph_[v][currentEdge[v]]};\n if (admissible(now)) {\n // std::cout << \"find edge \" << '(' << v << ',' << currentEdge[v] << ',' << now.cap << ')' << std::endl;\n path.emplace_back(v, currentEdge[v]);\n v = now.to;\n // std::cout << \"v become \" << v << std::endl;\n }\n else {\n currentEdge[v]++;\n }\n }\n if (v == s) return false;\n if (v == t) return true;\n if (v != t) {\n // std::cout << \"v rollback \" << std::endl;\n v = path.back().first;\n // std::cout << \"v become \" << v << std::endl;\n path.pop_back();\n currentEdge[v]++;\n }\n }\n assert(false);\n return false;\n }\n\n Cap flow(const std::vector<EdgePointer>& path) {\n // std::cout << \"flowing!!!\" << std::endl;\n // for (auto [x, y] : path) {\n // std::cout << '(' << x << ',' << y << ',' << graph_[x][y].cap << ')' << ' ';\n // }\n // std::cout << std::endl;\n auto min{std::min_element(path.begin(), path.end(), [&](const EdgePointer& l, const EdgePointer& r) -> bool {\n return graph_[l.first][l.second].cap < graph_[r.first][r.second].cap;\n })};\n Cap amount{graph_[min->first][min->second].cap};\n assert(amount > 0);\n for (const auto& [x, y] : path) {\n Edge& e{graph_[x][y]};\n graph_.update(e, amount);\n }\n return amount;\n }\n\n Cap primalStep(u32 s, u32 t) {\n std::vector<EdgePointer> path;\n Cap res{};\n while (findAdmissiblePath(s, t, path)) {\n res += flow(path);\n path.clear();\n }\n return res;\n }\n\npublic:\n\n Dinic() = default;\n Dinic(usize n) : graph_{n}, label_(n) {\n label_.shrink_to_fit();\n }\n\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id = invalid()) {\n assert(from < size());\n assert(to < size());\n graph_.addEdge(from, to, cap, id);\n }\n\n Cap flow(u32 s, u32 t) {\n assert(s < size());\n assert(t < size());\n Cap res{};\n while (dualStep(s, t)) {\n res += primalStep(s, t);\n }\n return res;\n }\n};\n\n} // namespace zawa\n#line 5 \"3168.test.cpp\"\n\n#line 9 \"3168.test.cpp\"\n\nbool adjust(char a, char b) {\n if (a > b) std::swap(a, b);\n if (a == 'a' and b == 'z') return true;\n return (int)(b - a) == 1;\n}\n\nint main() {\n using namespace zawa;\n int n, m, k; std::cin >> n >> m >> k;\n std::vector<char> s(n);\n for (auto& c : s) std::cin >> c;\n const int INF{(int)1e9};\n std::vector g(n, std::vector<int>(n, INF));\n for (int i{} ; i < n ; i++) g[i][i] = 0;\n for (int _{} ; _ < m ; _++) {\n int u, v; std::cin >> u >> v;\n u--; v--;\n g[u][v] = g[v][u] = 1;\n }\n for (int k{} ; k < n ; k++) {\n for (int i{} ; i < n ; i++) {\n for (int j{} ; j < n ; j++) {\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\n }\n }\n }\n Dinic<int> solver(2 * n + 2);\n for (int i{} ; i < n ; i++) {\n solver.addEdge(2 * n, i, 1);\n solver.addEdge(n + i, 2 * n + 1, 1);\n }\n for (int i{} ; i < n ; i++) {\n for (int j{i + 1} ; j < n ; j++) {\n if (g[i][j] > k) continue;\n if (!adjust(s[i], s[j])) continue;\n if (s[i] % 2) {\n solver.addEdge(i, n + j, 1);\n }\n else {\n solver.addEdge(j, n + i, 1);\n }\n }\n }\n int ans{solver.flow(2 * n, 2 * n + 1)};\n std::cout << ans << '\\n';\n}","accuracy":0.6909090909090909,"time_ms":20,"memory_kb":5228,"score_of_the_acc":-0.4721,"final_rank":14},{"submission_id":"aoj_3168_8538376","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repd(i,a,b) for (ll i=(a);i<(b);i++)\n#define rep(i,n) repd(i,0,n)\n#define all(x) (x).begin(),(x).end()\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntypedef long long ll;\ntypedef pair<int,int> P;\ntypedef vector<ll> vec;\ntypedef vector<vec> Graph;\nconst long long INF = 1LL<<60;\nconst long long MOD = 1000000007;\n\n//https://github.com/atcoder/ac-library/tree/master/atcoder\n#ifndef ATCODER_INTERNAL_QUEUE_HPP\n#define ATCODER_INTERNAL_QUEUE_HPP 1\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_QUEUE_HPP\n\n#ifndef ATCODER_MAXFLOW_HPP\n#define ATCODER_MAXFLOW_HPP 1\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\n\nnamespace atcoder {\n\ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n explicit mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n level[v] = _n;\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\n} // namespace atcoder\n\n#endif // ATCODER_MAXFLOW_HPP\n\nusing namespace atcoder;\n \n\nint main()\n{ \n ios::sync_with_stdio(false);\n cin.tie(0);\n ll n,m,k;\n cin>>n>>m>>k;\n vector<char> c(n);\n rep(i,n)cin>>c[i];\n mf_graph<ll> g(n*2+2);\n Graph G(n);\n rep(i,m){\n ll a,b;\n cin>>a>>b;\n a--;b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n rep(i,n){\n vec dist(n,-1);\n dist[i]=0;\n queue<ll> que;\n que.push(i);\n while(que.size()){\n ll x=que.front();\n que.pop();\n for(ll nx:G[x]){\n if(dist[nx]>=0)continue;\n que.push(nx);\n dist[nx]=dist[x]+1;\n }\n }\n rep(j,n){\n if(dist[j]==-1)continue;\n if(dist[j]<=k){\n ll x=c[i]-'a';\n ll y=c[j]-'a';\n ll sub=abs(x-y);\n if(sub==1||sub==25){\n if(x%2==0)g.add_edge(2+i,2+n+j,1e6);\n else g.add_edge(2+j,2+i+n,1e6);\n }\n }\n }\n }\n rep(i,n){\n g.add_edge(0,2+i,1);\n g.add_edge(2+n+i,1,1);\n }\n ll ans=g.flow(0,1);\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6940,"score_of_the_acc":-0.9108,"final_rank":10},{"submission_id":"aoj_3168_7976864","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// テンプレート引数: 距離の型TとT型の無効値(十分大きな値)INF\n// 引数: Nは頂点数、次に辺の情報(u, v, cost)\n// directedをtrueにすると有向辺として扱う(u -> v)向き\n// INFはオーバーフロー注意！！(2倍してもオーバーフローしない値である必要がある)\ntemplate <class T, T INF>\nvector<vector<T>> WF(int N, vector<tuple<int, int, T>> E, bool directed) {\n vector G(N, vector(N, INF));\n for (int i = 0 ; i < N ; i++) G[i][i] = 0;\n for (auto [u, v, c] : E) {\n G[u][v] = min(G[u][v], c);\n if (!directed) G[v][u] = min(G[v][u], c);\n }\n for (int k = 0 ; k < N ; k++) {\n for (int i = 0 ; i < N ; i++) {\n for (int j = 0 ; j < N ; j++) {\n G[i][j] = min(G[i][j], G[i][k] + G[k][j]);\n }\n }\n }\n return G;\n}\n\n\n// O(E V^2)\n// O(E \\min(E^{1/2}, V^{2/3})) if caps are constant\n// template param Flow: 流量の型\n// template param directed: 有向ならtrue\ntemplate<typename Flow,bool directed>\nstruct Dinic{\n // @member dst: 辺の向かう先\n // @member cap: 容量\n // @member rev: 逆辺の「識別番号」\n // @brief: 流量は管理していないっぽいので、流量が欲しい時は追加時の容量と現在の容量から流量を計算する必要がある。\n struct Edge {\n int dst;\n Flow cap;\n int rev;\n Edge(int dst,Flow cap,int rev):dst(dst),cap(cap),rev(rev){}\n };\n\n vector< vector<Edge> > G;\n vector<int> level,iter;\n\n // @param n: 頂点数\n Dinic(int n):G(n),level(n),iter(n){}\n\n // @brief srcからdstへ容量capの辺を追加する\n // @param src: 始点\n // @param dst: 終点\n // @param cap: 容量\n // @response: 追加した辺の識別番号(多分)\n int add_edge(int src,int dst,Flow cap){\n int e=G[src].size();\n int r=(src==dst?e+1:G[dst].size());\n G[src].emplace_back(dst,cap,r);\n G[dst].emplace_back(src,directed?0:cap,e);\n return e;\n }\n\n void bfs(int s){\n fill(level.begin(),level.end(),-1);\n queue<int> que;\n level[s]=0;\n que.emplace(s);\n while(!que.empty()){\n int v=que.front();que.pop();\n for(Edge &e : G[v]) {\n if(e.cap>0 and level[e.dst]<0){\n level[e.dst]=level[v]+1;\n que.emplace(e.dst);\n }\n }\n }\n }\n\n Flow dfs(int v,int t,Flow f){\n if(v==t) return f;\n for(int &i=iter[v];i<(int)G[v].size();i++){\n Edge &e=G[v][i];\n if(e.cap>0 and level[v]<level[e.dst]){\n Flow d=dfs(e.dst,t,min(f,e.cap));\n if(d==0) continue;\n e.cap-=d;\n G[e.dst][e.rev].cap+=d;\n return d;\n }\n }\n return 0;\n }\n\n // @brief: sからtへの最大フローを求める\n Flow flow(int s,int t){\n return flow(s,t,numeric_limits<Flow>::max()/2);\n }\n\n // @brief: sからtへの流量制限limの最大フローを流す(多分)\n Flow flow(int s,int t,Flow lim){\n Flow fl=0;\n while(1){\n bfs(s);\n if(level[t]<0 or lim==0) break;\n fill(iter.begin(),iter.end(),0);\n\n while(1){\n Flow f=dfs(s,t,lim);\n if(f==0) break;\n fl+=f;\n lim-=f;\n }\n }\n return fl;\n }\n\n // よくわからない\n Flow cut(int s,int t,int x,int a){\n static_assert(directed, \"must be directed\");\n auto &e=G[x][a];\n int y=e.dst;\n Flow cr=G[y][e.rev].cap;\n if(cr==0) return e.cap=0;\n e.cap=G[y][e.rev].cap=0;\n Flow cap=cr-flow(x,y,cr);\n if(x!=s and cap!=0) flow(x,s,cap);\n if(t!=y and cap!=0) flow(t,y,cap);\n return cap;\n }\n\n // @brief: 頂点xのa番目の辺に流量fを追加してs -> tへフローを流す\n // @condition: 頂点xにa個以上の辺が存在する\n // @param s: フローのsource\n // @param t: フローのsink\n // @param x: 流量を追加したい辺の始点がある頂点\n // @param a: 流量を追加した辺の識別番号\n // @param f: 追加したい流量\n Flow link(int s,int t,int x,int a,Flow f){\n auto &e=G[x][a];\n e.cap+=f;\n return flow(s,t,f);\n }\n};\n\nvector<int> BipJudge(vector<vector<int>> G) {\n size_t N = G.size();\n vector<int> col(N, -1);\n\n auto dfs = [&](auto dfs, int v, int c) -> bool {\n col[v] = c;\n for (auto x : G[v]) {\n if (col[x] == c) return false;\n if (col[x] == -1 and !dfs(dfs, x, 1 - c)) return false;\n }\n return true;\n };\n\n bool ok = true;\n for (size_t i = 0 ; i < N ; i++) {\n ok &= (col[i] != -1 or dfs(dfs, i, 0));\n }\n\n if (ok) return col;\n else return vector<int>(N, -1);\n}\n\nint main() {\n int N, M, K; cin >> N >> M >> K;\n vector<char> C(N);\n for (auto& c : C) cin >> c;\n \n vector<tuple<int, int, int>> E(M);\n for (auto& [u, v, c] : E) {\n cin >> u >> v;\n u--; v--;\n c = 1;\n }\n\n auto G = WF<int, (int)1e9>(N, E, false);\n\n vector<vector<int>> Ebi(N); \n for (int i = 0 ; i < N ; i++) {\n for (int j = 0 ; j < N ; j++) {\n if (G[i][j] > K) continue;\n int s = (C[i] - C[j] + 26) % 26;\n if (s == 1 or s == 25) {\n Ebi[i].push_back(j);\n }\n }\n }\n\n vector<int> col = BipJudge(Ebi);\n\n Dinic<int, true> din(N + 2);\n for (int i = 0 ; i < N ; i++) {\n if (col[i] == 0) {\n din.add_edge(N, i, 1);\n for (auto x : Ebi[i]) din.add_edge(i, x, 1);\n }\n else {\n din.add_edge(i, N + 1, 1);\n }\n }\n\n int ans = din.flow(N, N + 1);\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":5172,"score_of_the_acc":-0.4574,"final_rank":6},{"submission_id":"aoj_3168_7975975","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// テンプレート引数: 距離の型TとT型の無効値(十分大きな値)INF\n// 引数: Nは頂点数、次に辺の情報(u, v, cost)\n// directedをtrueにすると有向辺として扱う(u -> v)向き\n// INFはオーバーフロー注意！！(2倍してもオーバーフローしない値である必要がある)\ntemplate <class T, T INF>\nvector<vector<T>> WF(int N, vector<tuple<int, int, T>> E, bool directed) {\n vector G(N, vector(N, INF));\n for (int i = 0 ; i < N ; i++) G[i][i] = 0;\n for (auto [u, v, c] : E) {\n G[u][v] = min(G[u][v], c);\n if (!directed) G[v][u] = min(G[v][u], c);\n }\n for (int k = 0 ; k < N ; k++) {\n for (int i = 0 ; i < N ; i++) {\n for (int j = 0 ; j < N ; j++) {\n G[i][j] = min(G[i][j], G[i][k] + G[k][j]);\n }\n }\n }\n return G;\n}\n\n// O(E V^2)\n// O(E \\min(E^{1/2}, V^{2/3})) if caps are constant\ntemplate<typename Flow,bool directed>\nstruct Dinic{\n struct Edge {\n int dst;\n Flow cap;\n int rev;\n Edge(int dst,Flow cap,int rev):dst(dst),cap(cap),rev(rev){}\n };\n\n vector< vector<Edge> > G;\n vector<int> level,iter;\n\n Dinic(int n):G(n),level(n),iter(n){}\n\n int add_edge(int src,int dst,Flow cap){\n int e=G[src].size();\n int r=(src==dst?e+1:G[dst].size());\n G[src].emplace_back(dst,cap,r);\n G[dst].emplace_back(src,directed?0:cap,e);\n return e;\n }\n\n void bfs(int s){\n fill(level.begin(),level.end(),-1);\n queue<int> que;\n level[s]=0;\n que.emplace(s);\n while(!que.empty()){\n int v=que.front();que.pop();\n for(Edge &e : G[v]) {\n if(e.cap>0 and level[e.dst]<0){\n level[e.dst]=level[v]+1;\n que.emplace(e.dst);\n }\n }\n }\n }\n\n Flow dfs(int v,int t,Flow f){\n if(v==t) return f;\n for(int &i=iter[v];i<(int)G[v].size();i++){\n Edge &e=G[v][i];\n if(e.cap>0 and level[v]<level[e.dst]){\n Flow d=dfs(e.dst,t,min(f,e.cap));\n if(d==0) continue;\n e.cap-=d;\n G[e.dst][e.rev].cap+=d;\n return d;\n }\n }\n return 0;\n }\n\n Flow flow(int s,int t,Flow lim){\n Flow fl=0;\n while(1){\n bfs(s);\n if(level[t]<0 or lim==0) break;\n fill(iter.begin(),iter.end(),0);\n\n while(1){\n Flow f=dfs(s,t,lim);\n if(f==0) break;\n fl+=f;\n lim-=f;\n }\n }\n return fl;\n }\n\n Flow flow(int s,int t){\n return flow(s,t,numeric_limits<Flow>::max()/2);\n }\n\n Flow cut(int s,int t,int x,int a){\n static_assert(directed, \"must be directed\");\n auto &e=G[x][a];\n int y=e.dst;\n Flow cr=G[y][e.rev].cap;\n if(cr==0) return e.cap=0;\n e.cap=G[y][e.rev].cap=0;\n Flow cap=cr-flow(x,y,cr);\n if(x!=s and cap!=0) flow(x,s,cap);\n if(t!=y and cap!=0) flow(t,y,cap);\n return cap;\n }\n\n Flow link(int s,int t,int x,int a,Flow f){\n auto &e=G[x][a];\n e.cap+=f;\n return flow(s,t,f);\n }\n};\n\nint main() {\n int N, M, K; cin >> N >> M >> K;\n vector<char> C(N);\n for (auto& c : C) cin >> c;\n \n vector<tuple<int, int, int>> E(M);\n for (auto& [u, v, c] : E) {\n cin >> u >> v;\n u--; v--;\n c = 1;\n }\n\n auto G = WF<int, (int)1e9>(N, E, false);\n\n vector<vector<int>> Ebi(N); \n for (int i = 0 ; i < N ; i++) {\n for (int j = 0 ; j < N ; j++) {\n if (G[i][j] > K) continue;\n int s = (C[i] - C[j] + 26) % 26;\n if (s == 1 or s == 25) {\n Ebi[i].push_back(j);\n }\n }\n }\n\n vector<int> col(N, -1);\n auto dfs = [&](auto dfs, int v, int c) -> void {\n col[v] = c;\n for (auto x : Ebi[v]) {\n if (col[x] == -1) dfs(dfs, x, 1 - c);\n }\n };\n\n for (int i = 0 ; i < N ; i++) {\n if (col[i] == -1) dfs(dfs, i, 0);\n }\n\n Dinic<int, true> din(N + 2);\n for (int i = 0 ; i < N ; i++) {\n if (col[i] == 0) {\n din.add_edge(N, i, 1);\n for (auto x : Ebi[i]) din.add_edge(i, x, 1);\n }\n else {\n din.add_edge(i, N + 1, 1);\n }\n }\n\n int ans = din.flow(N, N + 1);\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":5152,"score_of_the_acc":-0.4522,"final_rank":5},{"submission_id":"aoj_3168_7975574","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n//BEGIN CUT HERE\n// O(E V^2)\n// O(E \\min(E^{1/2}, V^{2/3})) if caps are constant\ntemplate<typename Flow,bool directed>\nstruct Dinic{\n struct Edge {\n int dst;\n Flow cap;\n int rev;\n Edge(int dst,Flow cap,int rev):dst(dst),cap(cap),rev(rev){}\n };\n\n vector< vector<Edge> > G;\n vector<int> level,iter;\n\n Dinic(int n):G(n),level(n),iter(n){}\n\n int add_edge(int src,int dst,Flow cap){\n int e=G[src].size();\n int r=(src==dst?e+1:G[dst].size());\n G[src].emplace_back(dst,cap,r);\n G[dst].emplace_back(src,directed?0:cap,e);\n return e;\n }\n\n void bfs(int s){\n fill(level.begin(),level.end(),-1);\n queue<int> que;\n level[s]=0;\n que.emplace(s);\n while(!que.empty()){\n int v=que.front();que.pop();\n for(Edge &e : G[v]) {\n if(e.cap>0 and level[e.dst]<0){\n level[e.dst]=level[v]+1;\n que.emplace(e.dst);\n }\n }\n }\n }\n\n Flow dfs(int v,int t,Flow f){\n if(v==t) return f;\n for(int &i=iter[v];i<(int)G[v].size();i++){\n Edge &e=G[v][i];\n if(e.cap>0 and level[v]<level[e.dst]){\n Flow d=dfs(e.dst,t,min(f,e.cap));\n if(d==0) continue;\n e.cap-=d;\n G[e.dst][e.rev].cap+=d;\n return d;\n }\n }\n return 0;\n }\n\n Flow flow(int s,int t,Flow lim){\n Flow fl=0;\n while(1){\n bfs(s);\n if(level[t]<0 or lim==0) break;\n fill(iter.begin(),iter.end(),0);\n\n while(1){\n Flow f=dfs(s,t,lim);\n if(f==0) break;\n fl+=f;\n lim-=f;\n }\n }\n return fl;\n }\n\n Flow flow(int s,int t){\n return flow(s,t,numeric_limits<Flow>::max()/2);\n }\n\n Flow cut(int s,int t,int x,int a){\n static_assert(directed, \"must be directed\");\n auto &e=G[x][a];\n int y=e.dst;\n Flow cr=G[y][e.rev].cap;\n if(cr==0) return e.cap=0;\n e.cap=G[y][e.rev].cap=0;\n Flow cap=cr-flow(x,y,cr);\n if(x!=s and cap!=0) flow(x,s,cap);\n if(t!=y and cap!=0) flow(t,y,cap);\n return cap;\n }\n\n Flow link(int s,int t,int x,int a,Flow f){\n auto &e=G[x][a];\n e.cap+=f;\n return flow(s,t,f);\n }\n};\n\nconst int INF = (int)1e9;\n\nint main() {\n int N, M, K; cin >> N >> M >> K;\n vector<int> C(N);\n for (auto& c : C) {\n char op; cin >> op;\n c = (int)op;\n }\n for (auto& c : C) c %= 26;\n\n vector G(N, vector(N, INF));\n for (int i = 0 ; i < N ; i++) G[i][i] = 0;\n\n for (int _ = 0 ; _ < M ; _++) {\n int u, v; cin >> u >> v;\n u--; v--;\n G[u][v] = G[v][u] = 1;\n }\n\n for (int k = 0 ; k < N ; k++) {\n for (int i = 0 ; i < N ; i++) {\n for (int j = 0 ; j < N ; j++) {\n G[i][j] = min(G[i][j], G[i][k] + G[k][j]);\n }\n }\n }\n\n vector<vector<int>> Ebi(N);\n\n for (int i = 0 ; i < N ; i++) {\n for (int j = i + 1 ; j < N ; j++) {\n if (G[i][j] > K) continue;\n int score = (C[i] - C[j] + 26) % 26;\n if (score == 1 or score == 25) {\n Ebi[i].push_back(j);\n Ebi[j].push_back(i);\n }\n }\n }\n\n\n vector<int> id(N, -1);\n int size = 0;\n \n auto dfsid = [&](auto dfsid, int v) -> void {\n id[v] = size;\n for (auto x : Ebi[v]) if (id[x] == -1) {\n dfsid(dfsid, x);\n }\n };\n\n for (int i = 0 ; i < N ; i++) {\n if (id[i] == -1) {\n dfsid(dfsid, i);\n size++;\n }\n }\n\n vector<int> col(N, -1); \n\n auto dfscol = [&](auto dfscol, int v, int c) -> void {\n col[v] = c;\n for (auto x : Ebi[v]) {\n if (col[x] != -1) {\n assert(col[x] == 1 - c);\n }\n else {\n dfscol(dfscol, x, 1 - c);\n }\n }\n };\n\n for (int i = 0 ; i < N ; i++) {\n if (col[i] == -1) {\n dfscol(dfscol, i, 0);\n }\n }\n\n Dinic<int, true> din(N + 2);\n vector<int> zero(size), one(size);\n for (int i = 0 ; i < N ; i++) {\n if (col[i] == 0) {\n din.add_edge(N, i, 1);\n for (auto x : Ebi[i]) {\n din.add_edge(i, x, 1);\n }\n zero[id[i]]++;\n }\n else {\n din.add_edge(i, N + 1, 1);\n one[id[i]]++;\n }\n }\n\n \n int ans = 0;\n for (int i = 0 ; i < size ; i++) {\n ans += min(zero[i], one[i]);\n }\n\n int f = din.flow(N, N + 1);\n\n cout << f << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":5136,"score_of_the_acc":-0.448,"final_rank":4},{"submission_id":"aoj_3168_7975488","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef unsigned uint;\ntypedef long long ll;\ntypedef long long lint;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\ntypedef char chr;\ntypedef string str;\n\n#define REP(i, n) for (int i=0;i<(int)n;i++)\n#define ALL(x) x.begin() x.begin()\n#define SEP \" \"\n#define YES cout << \"Yes\" << endl\n#define NO cout << \"NO\" << endl\n#define OUT(x) cout << x << endl\n#define OUTF(x) cout << fixed << setprecision(10) << x << endl\n#define SIZE(v) v.size()\n#define PB push_back\n#define MP make_pair\n#define MT make_typle\n\nconst double pi = 3.141592653589793238;\n\nconst int large_a = 65;\nconst int small_a = 97;\n\nconst int INF = 2147483647;\nconst int INT_INF = 2147483647;\n\nconst int dy[4] = {-1, 0, 1, 0};\nconst int dx[4] = {0, 1, 0, -1};\n\ntemplate<class T> inline void print_vec(const vector<T>& v) {\n\tint last = SIZE(v);\n\tREP(i, last) {\n\t\tcout << v[i];\n\t\tif(i != last-1) cout << SEP;\n\t}\n\tcout << endl;\n}\n\nint main() {\n\tint n,m,k;\n\tcin>>n>>m>>k;\n\tvector<char> chara(n+1);\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>chara[i];\n\t}\n\tvector<vector<int>> g(n+1);\n\tfor(int i=0;i<m;i++){\n\t\tint u,v;\n\t\tcin>>u>>v;\n\t\tg[u].push_back(v);\n\t\tg[v].push_back(u);\n\t}\n\tvector<set<int>> v(n+1);\n\t\n\tfor(int j=1;j<=n;j++){\n\t\tqueue<int> que;\n\t\tvector<int> dist(n+1,-1);\n\t\tque.push(j);\n\t\tchar nowc=chara[j];\n\t\tdist[j]=0;\n\t\twhile(!que.empty()){\n\t\t\tint pos=que.front();\n\t\t\tque.pop();\n\t\t\tfor(int i=0;i<g[pos].size();i++){\n\t\t\t\tint to=g[pos][i];\n\t\t\t\tif(dist[to]==-1){\n\t\t\t\t\tdist[to]=dist[pos]+1;\n\t\t\t\t\tchar nextc=chara[to];\n\t\t\t\t\tif(dist[to]<=k){\n\t\t\t\t\t\tif(nowc=='a'){\n\t\t\t\t\t\t\tif(nextc=='z' or nextc=='b'){\n\t\t\t\t\t\t\t\tv[j].insert(to);\n\t\t\t\t\t\t\t\tv[to].insert(j);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}else if(nowc=='z'){\n\t\t\t\t\t\t\tif(nextc=='a' or nextc=='y'){\n\t\t\t\t\t\t\t\tv[j].insert(to);\n\t\t\t\t\t\t\t\tv[to].insert(j);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}else if(abs(nextc-nowc)==1){\n\t\t\t\t\t\t\t\tv[j].insert(to);\n\t\t\t\t\t\t\t\tv[to].insert(j);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tque.push(to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tset<int> exist;\n\tfor(int i=1;i<=n;i++){\n\t\tif(v[i].size()>0){\n\t\t\texist.insert(i);\n\t\t}\n\t}\n\n\n\n\n\tint ans=0;\n\twhile(!exist.empty()){\n\n\n\n\t\tint ma=0;\n\t\tint ind=-1;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tif(v[i].size()>ma){\n\t\t\t\tind=i;\n\t\t\t\tma=v[i].size();\n\t\t\t}\n\t\t}\n\t\texist.erase(ind);\n\t\tfor(int i=0;i<ma;i++){\n\t\t\tfor(int j:v[ind]){\n\t\t\t\tv[j].erase(ind);\n\t\t\t\tif(v[j].empty()){\n\t\t\t\t\texist.erase(j);\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tv[ind].clear();\n\t\tans++;\n\t}\n\tOUT(ans);\n}","accuracy":0.14545454545454545,"time_ms":20,"memory_kb":4240,"score_of_the_acc":-0.2129,"final_rank":19},{"submission_id":"aoj_3168_7975477","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\nconst int mod = 998244353;\nconst int inf = (1<<30);\n\nconst int dy[4] = {-1,0,0,1};\nconst int dx[4] = {0,-1,1,0};\n\nvector<vector<ll>> g(310,vector<ll>(310,310)); \nvector<int> c(310);\nvoid make_ebi(int n){\n for(int k =0; k<n; k++){\n for(int i = 0; i <n; i++){\n for(int j = 0; j<n; j++) g[i][j] = min(g[i][j],g[i][k]+g[k][j]);\n }\n }\n rep(i,n){\n rep(j,n){\n if((int)c[i] != ((int)c[j]+1)%26 && (int)c[i] != ((int)c[j]+25)%26){\n g[i][j] = 310;\n // cout<<\"***\"<<endl;\n }\n }\n }\n\n\n\n\n}\n\n// [lower, upper]\nint random(int lower, int upper) {\n return (rand() % (upper + 1)) + lower;\n}\n\nvector<int> make_random_permutation(int n) {\n vector<int> a(n);\n iota(a.begin(), a.end(), 0);\n\n random_device seed_gen;\n mt19937 engine(seed_gen());\n shuffle(a.begin(), a.end(), engine);\n\n return a;\n}\n\n\nint put_trap(int n,int k,vector<vector<ll>> g){\n int ans = 0;\n bool c = true;\n vector<int> x = make_random_permutation(n);\n while(c){\n c = false;\n int mg = 0;\n int a = -1;\n \n rep(i,n){\n //cout<<\"!!\"<<endl;\n int eg = 0;\n rep(j,n){\n if(g[x[i]][j] <= k) eg++;\n }\n if(eg > mg){\n // cout<<\"??\"<<endl;\n c = true;\n a = x[i];\n mg = eg;\n }\n }\n if(c == false) return ans;\n\n rep(i,n){\n g[a][i] = 310;\n g[i][a] = 310;\n }\n ans++;\n }\n\n return ans;\n}\n\n\nint main(){\n int n,m,k;\n cin>>n>>m>>k;\n rep(i,n){\n char p;\n cin>>p;\n c[i] = int(p-'a');\n }\n\n rep(i,m){\n int u,v; cin>>u>>v;\n u--;v--;\n g[u][v] = 1;\n g[v][u] = 1;\n }\n make_ebi(n);\n int ans = 310;\n rep(i,100){\n ans = min(ans,put_trap(n,k,g));\n }\n\n cout<<ans<<endl;\n}","accuracy":0.18181818181818182,"time_ms":970,"memory_kb":4672,"score_of_the_acc":-1.3158,"final_rank":15},{"submission_id":"aoj_3168_7975147","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\nconst int mod = 998244353;\nconst int inf = (1<<30);\n\nconst int dy[4] = {-1,0,0,1};\nconst int dx[4] = {0,-1,1,0};\n\nvector<vector<ll>> g(310,vector<ll>(310,310)); \nvector<int> c(310);\nvoid make_ebi(int n){\n for(int k =0; k<n; k++){\n for(int i = 0; i <n; i++){\n for(int j = 0; j<n; j++) g[i][j] = min(g[i][j],g[i][k]+g[k][j]);\n }\n }\n rep(i,n){\n rep(j,n){\n if((int)c[i] != ((int)c[j]+1)%26 && (int)c[i] != ((int)c[j]+25)%26){\n g[i][j] = 310;\n // cout<<\"***\"<<endl;\n }\n }\n }\n\n\n\n\n}\n\n\nint put_trap(int n,int k){\n int ans = 0;\n bool c = true;\n while(c){\n c = false;\n int mg = 0;\n int a = -1;\n\n rep(i,n){\n //cout<<\"!!\"<<endl;\n int eg = 0;\n rep(j,n){\n if(g[i][j] <= k) eg++;\n }\n if(eg > mg){\n // cout<<\"??\"<<endl;\n c = true;\n a = i;\n mg = eg;\n }\n }\n if(c == false) return ans;\n\n rep(i,n){\n g[a][i] = 310;\n g[i][a] = 310;\n }\n ans++;\n }\n\n return ans;\n}\n\n\n\n\n\n\n\nint main(){\n int n,m,k;\n cin>>n>>m>>k;\n rep(i,n){\n char p;\n cin>>p;\n c[i] = int(p-'a');\n }\n\n rep(i,m){\n int u,v; cin>>u>>v;\n u--;v--;\n g[u][v] = 1;\n g[v][u] = 1;\n }\n make_ebi(n);\n cout<<put_trap(n,k)<<endl;\n\n\n\n\n}","accuracy":0.14545454545454545,"time_ms":20,"memory_kb":4244,"score_of_the_acc":-0.214,"final_rank":20},{"submission_id":"aoj_3168_7975074","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N, M, K; cin >> N >> M >> K;\n vector<int> C(N);\n for (auto& c : C) {\n char op; cin >> op;\n c = (int)op;\n }\n for (auto& c : C) c %= 26;\n\n const int INF = (int)1e9;\n vector G(N, vector(N, INF));\n for (int i = 0 ; i < N ; i++) G[i][i] = 0;\n\n for (int _ = 0 ; _ < M ; _++) {\n int u, v; cin >> u >> v;\n u--; v--;\n G[u][v] = G[v][u] = 1;\n }\n\n for (int k = 0 ; k < N ; k++) {\n for (int i = 0 ; i < N ; i++) {\n for (int j = 0 ; j < N ; j++) {\n G[i][j] = min(G[i][j], G[i][k] + G[k][j]);\n }\n }\n }\n\n vector<vector<int>> Ebi(N);\n for (int i = 0 ; i < N ; i++) {\n for (int j = i + 1 ; j < N ; j++) {\n if (G[i][j] > K) continue;\n // cout << C[i] << ' ' << C[j] << ' ' << (C[i] - C[j] + 26) % 26 << endl;\n int score = (C[i] - C[j] + 26) % 26;\n if (score == 1 or score == 25) {\n Ebi[i].push_back(j);\n Ebi[j].push_back(i);\n }\n }\n }\n\n\n vector<int> id(N, -1);\n int size = 0;\n \n auto dfsid = [&](auto dfsid, int v) -> void {\n id[v] = size;\n for (auto x : Ebi[v]) if (id[x] == -1) {\n dfsid(dfsid, x);\n }\n };\n\n for (int i = 0 ; i < N ; i++) {\n if (id[i] == -1) {\n dfsid(dfsid, i);\n size++;\n }\n }\n\n vector<int> col(N, -1); \n\n auto dfscol = [&](auto dfscol, int v, int c) -> void {\n col[v] = c;\n for (auto x : Ebi[v]) {\n if (col[x] != -1) {\n assert(col[x] == 1 - c);\n }\n else {\n dfscol(dfscol, x, 1 - c);\n }\n }\n };\n\n for (int i = 0 ; i < N ; i++) {\n if (col[i] == -1) {\n dfscol(dfscol, i, 0);\n }\n }\n\n vector<int> zero(size), one(size);\n for (int i = 0 ; i < N ; i++) {\n if (col[i] == 0) {\n zero[id[i]]++;\n }\n else {\n one[id[i]]++;\n }\n }\n \n int ans = 0;\n for (int i = 0 ; i < size ; i++) {\n ans += min(zero[i], one[i]);\n }\n\n cout << ans << endl;\n}","accuracy":0.14545454545454545,"time_ms":20,"memory_kb":3576,"score_of_the_acc":-0.0387,"final_rank":17},{"submission_id":"aoj_3168_7010638","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3168.cc: Capture Ebichan\n */\n\n#include<cstdio>\n#include<vector>\n#include<queue>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 300;\n\n/* typedef */\n\ntypedef queue<int> qi;\ntypedef vector<int> vi;\ntypedef vector<bool> vb;\n\n/* global variables */\n\nint cs[MAX_N], ds[MAX_N], gids[MAX_N];\nvi nbrs[MAX_N], gnbrs[MAX_N], enbrs[MAX_N];\nbool used[MAX_N];\n\n/* subroutines */\n\nvoid bfs(int n, int k, int st) {\n int c1 = (cs[st] + 25) % 26, c2 = (cs[st] + 1) % 26;\n fill(ds, ds + n, -1);\n ds[st] = 0;\n\n qi q;\n q.push(st);\n\n while (! q.empty()) {\n int u = q.front(); q.pop();\n if (ds[u] >= k) continue;\n\n for (auto v: nbrs[u])\n if (ds[v] < 0) {\n\tds[v] = ds[u] + 1;\n\tq.push(v);\n\n\tif (ds[v] <= k && (cs[v] == c1 || cs[v] == c2))\n\t gnbrs[gids[st]].push_back(gids[v]);\n }\n }\n}\n\nbool max_match_rec(const vi *nbrs, int u, vi &matches, vb &visited) {\n if (u < 0) return true;\n for (const int v: nbrs[u]) {\n if (! visited[v]) {\n visited[v] = true;\n if (max_match_rec(nbrs, matches[v], matches, visited)) {\n\tmatches[u] = v;\n\tmatches[v] = u;\n\treturn true;\n }\n }\n }\n return false;\n}\n\nint max_match(const int n, int l, const vi *nbrs, vi &matches) {\n matches.assign(n, -1);\n int count = 0;\n \n for (int u = 0; u < l; u++) {\n vb visited(n, false);\n if (max_match_rec(nbrs, u, matches, visited)) count++;\n }\n\n return count;\n}\n\n/* main */\n\nint main() {\n int n, m, k;\n scanf(\"%d%d%d\", &n, &m, &k);\n\n for (int i = 0; i < n; i++) {\n char w[4];\n scanf(\"%s\", w);\n cs[i] = w[0] - 'a';\n }\n\n for (int i = 0; i < m; i++) {\n int u, v;\n scanf(\"%d%d\", &u, &v);\n u--, v--;\n nbrs[u].push_back(v);\n nbrs[v].push_back(u);\n }\n\n int l = 0;\n for (int u = 0; u < n; u++)\n if (! (cs[u] & 1)) l++;\n\n for (int u = 0, i = 0, j = 0; u < n; u++) {\n if (! (cs[u] & 1)) gids[u] = i++;\n else gids[u] = l + j++;\n }\n //for (int u = 0; u < n; u++) printf(\"%d \", gids[u]); putchar('\\n');\n\n for (int u = 0; u < n; u++) bfs(n, k, u);\n\n vi matches;\n int mm = max_match(n, l, gnbrs, matches);\n //printf(\"mm=%d\\n\", mm);\n //for (int i = 0; i < l; i++) printf(\"%d->%d \", i, matches[i]);\n //putchar('\\n');\n\n qi q;\n for (int u = 0; u < l; u++) {\n for (auto v: gnbrs[u]) {\n if (matches[u] == v) enbrs[v].push_back(u);\n else enbrs[u].push_back(v);\n }\n if (matches[u] < 0)\n used[u] = true, q.push(u);\n }\n\n while (! q.empty()) {\n int u = q.front(); q.pop();\n for (auto v: nbrs[u])\n if (! used[v])\n\tused[v] = true, q.push(v);\n }\n\n int cnt = 0;\n for (int u = 0; u < l; u++)\n if (! gnbrs[u].empty() && ! used[u]) cnt++;\n for (int u = l; u < n; u++)\n if (! gnbrs[u].empty() && used[u]) cnt++;\n\n printf(\"%d\\n\", cnt);\n return 0;\n}","accuracy":0.14545454545454545,"time_ms":10,"memory_kb":3468,"score_of_the_acc":0,"final_rank":16},{"submission_id":"aoj_3168_7010376","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3168.cc: Capture Ebichan\n */\n\n#include<cstdio>\n#include<vector>\n#include<queue>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 300;\n\n/* typedef */\n\ntypedef queue<int> qi;\ntypedef vector<int> vi;\ntypedef vector<bool> vb;\n\n/* global variables */\n\nint cs[MAX_N], ds[MAX_N], gids[MAX_N];\nvi nbrs[MAX_N], gnbrs[MAX_N], enbrs[MAX_N];\nbool used[MAX_N];\n\n/* subroutines */\n\nvoid bfs(int n, int k, int st) {\n int c1 = (cs[st] + 25) % 26, c2 = (cs[st] + 1) % 26;\n fill(ds, ds + n, -1);\n ds[st] = 0;\n\n qi q;\n q.push(st);\n\n while (! q.empty()) {\n int u = q.front(); q.pop();\n if (ds[u] >= k) continue;\n\n for (auto v: nbrs[u])\n if (ds[v] < 0) {\n\tds[v] = ds[u] + 1;\n\tq.push(v);\n\n\tif (ds[v] <= k && (cs[v] == c1 || cs[v] == c2)) {\n\t gnbrs[gids[st]].push_back(gids[v]);\n\t gnbrs[gids[v]].push_back(gids[st]);\n\t}\n }\n }\n}\n\nbool max_match_rec(const vi *nbrs, int u, vi &matches, vb &visited) {\n if (u < 0) return true;\n for (const int v: nbrs[u]) {\n if (! visited[v]) {\n visited[v] = true;\n if (max_match_rec(nbrs, matches[v], matches, visited)) {\n\tmatches[u] = v;\n\tmatches[v] = u;\n\treturn true;\n }\n }\n }\n return false;\n}\n\nint max_match(const int n, int l, const vi *nbrs, vi &matches) {\n matches.assign(n, -1);\n int count = 0;\n \n for (int u = 0; u < l; u++) {\n vb visited(n, false);\n if (max_match_rec(nbrs, u, matches, visited)) count++;\n }\n\n return count;\n}\n\n/* main */\n\nint main() {\n int n, m, k;\n scanf(\"%d%d%d\", &n, &m, &k);\n\n for (int i = 0; i < n; i++) {\n char w[4];\n scanf(\"%s\", w);\n cs[i] = w[0] - 'a';\n }\n\n for (int i = 0; i < m; i++) {\n int u, v;\n scanf(\"%d%d\", &u, &v);\n u--, v--;\n nbrs[u].push_back(v);\n nbrs[v].push_back(u);\n }\n\n int l = 0;\n for (int u = 0; u < n; u++)\n if (! (cs[u] & 1)) l++;\n\n for (int u = 0, i = 0, j = 0; u < n; u++) {\n if (! (cs[u] & 1)) gids[u] = i++;\n else gids[u] = l + j++;\n }\n //for (int u = 0; u < n; u++) printf(\"%d \", gids[u]); putchar('\\n');\n\n for (int u = 0; u < n; u++) bfs(n, k, u);\n\n vi matches;\n int mm = max_match(n, l, gnbrs, matches);\n //printf(\"mm=%d\\n\", mm);\n //for (int i = 0; i < l; i++) printf(\"%d->%d \", i, matches[i]);\n //putchar('\\n');\n\n qi q;\n for (int u = 0; u < l; u++) {\n for (auto v: gnbrs[u]) {\n if (matches[u] == v) enbrs[v].push_back(u);\n else enbrs[u].push_back(v);\n }\n if (matches[u] < 0)\n used[u] = true, q.push(u);\n }\n\n while (! q.empty()) {\n int u = q.front(); q.pop();\n for (auto v: nbrs[u])\n if (! used[v])\n\tused[v] = true, q.push(v);\n }\n\n int cnt = 0;\n for (int u = 0; u < l; u++)\n if (! gnbrs[u].empty() && ! used[u]) cnt++;\n for (int u = l; u < n; u++)\n if (! gnbrs[u].empty() && used[u]) cnt++;\n\n printf(\"%d\\n\", cnt);\n return 0;\n}","accuracy":0.14545454545454545,"time_ms":10,"memory_kb":3628,"score_of_the_acc":-0.042,"final_rank":18},{"submission_id":"aoj_3168_6928630","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=9167167167167167167;\nconst int INF=100000000;\nconst ll mod=998244353;\n#define rep(i,a) for (ll i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\nnamespace atcoder {\n \nnamespace internal {\n \ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n \n} // namespace internal\n \n} // namespace atcoder\nnamespace atcoder {\n \ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n \n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n g[from].push_back(_edge{to, int(g[to].size()), cap});\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0});\n return m;\n }\n \n struct edge {\n int from, to;\n Cap cap, flow;\n };\n \n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n \n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n \n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n \n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) break;\n }\n return res;\n };\n \n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n while (flow < flow_limit) {\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n }\n return flow;\n }\n \n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n \n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n \n} // namespace atcoder\nusing namespace atcoder;\n\nvoid Warshall_Floyd(std::vector<std::vector<int>> &G){\n\tint N=G.size();\n\tassert(N==(int)G[0].size());\n\tfor(int k=0;k<N;k++){\n\t\tfor(int i=0;i<N;i++){\n\t\t\tfor(int j=0;j<N;j++){\n\t\t\t\tif(G[i][j]>G[i][k]+G[k][j]){\n\t\t\t\t\tG[i][j]=G[i][k]+G[k][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\t//cin>>t;\n\trep(i,t) solve();\n}\n\nvoid solve(){\n\tint N,M,K;\n\tcin>>N>>M>>K;\n\tvector<char> p(N);\n\trep(i,N) cin>>p[i];\n\tvector<vector<int>> G(N,vector<int>(N,INF));\n\trep(i,N) G[i][i]=0;\n\trep(i,M){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\ta--,b--;\n\t\tG[a][b]=1;\n\t\tG[b][a]=1;\n\t}\n\tWarshall_Floyd(G);\n\tmf_graph<int> mfg(N+2);\n\trep(i,N){\n\t\tif((p[i]-'a')%2){\n\t\t\tmfg.add_edge(i,N+1,1);\n\t\t\tcontinue;\n\t\t}\n\t\tmfg.add_edge(N,i,1);\n\t\trep(j,N){\n\t\t\tif(G[i][j]<=K&&(abs(13-abs(p[i]-p[j]))==12)){\n\t\t\t\tmfg.add_edge(i,j,1);\n\t\t\t}\n\t\t}\n\t}\n\tint ans=mfg.flow(N,N+1);\n\tcout<<ans<<\"\\n\";\n}","accuracy":1,"time_ms":20,"memory_kb":4596,"score_of_the_acc":-0.3063,"final_rank":2},{"submission_id":"aoj_3168_6928623","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=9167167167167167167;\nconst int INF=2100000000;\nconst ll mod=998244353;\n#define rep(i,a) for (ll i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\nnamespace atcoder {\n \nnamespace internal {\n \ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n \n} // namespace internal\n \n} // namespace atcoder\nnamespace atcoder {\n \ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n \n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n g[from].push_back(_edge{to, int(g[to].size()), cap});\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0});\n return m;\n }\n \n struct edge {\n int from, to;\n Cap cap, flow;\n };\n \n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n \n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n \n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n \n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) break;\n }\n return res;\n };\n \n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n while (flow < flow_limit) {\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n }\n return flow;\n }\n \n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n \n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n \n} // namespace atcoder\nusing namespace atcoder;\n\nvoid Warshall_Floyd(std::vector<std::vector<int>> &G){\n\tint N=G.size();\n\tassert(N==(int)G[0].size());\n\tfor(int k=0;k<N;k++){\n\t\tfor(int i=0;i<N;i++){\n\t\t\tfor(int j=0;j<N;j++){\n\t\t\t\tif(G[i][j]>G[i][k]+G[k][j]){\n\t\t\t\t\tG[i][j]=G[i][k]+G[k][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\t//cin>>t;\n\trep(i,t) solve();\n}\n\nvoid solve(){\n\tint N,M,K;\n\tcin>>N>>M>>K;\n\tvector<char> p(N);\n\trep(i,N) cin>>p[i];\n\tvector<vector<int>> G(N,vector<int>(N,INF));\n\trep(i,N) G[i][i]=0;\n\trep(i,M){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\ta--,b--;\n\t\tG[a][b]=1;\n\t\tG[b][a]=1;\n\t}\n\tWarshall_Floyd(G);\n\tmf_graph<int> mfg(N+2);\n\trep(i,N){\n\t\tif((p[i]-'a')%2){\n\t\t\tmfg.add_edge(i,N+1,1);\n\t\t\tcontinue;\n\t\t}\n\t\tmfg.add_edge(N,i,1);\n\t\trep(j,N){\n\t\t\tif(G[i][j]<=K&&(abs(13-abs(p[i]-p[j]))==12)){\n\t\t\t\tmfg.add_edge(i,j,1);\n\t\t\t}\n\t\t}\n\t}\n\tint ans=mfg.flow(N,N+1);\n\tcout<<ans<<\"\\n\";\n}","accuracy":0.6909090909090909,"time_ms":20,"memory_kb":4624,"score_of_the_acc":-0.3137,"final_rank":13},{"submission_id":"aoj_3168_6928618","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=9167167167167167167;\nconst int INF=2100000000;\nconst ll mod=998244353;\n#define rep(i,a) for (ll i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\nnamespace atcoder {\n \nnamespace internal {\n \ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n \n} // namespace internal\n \n} // namespace atcoder\nnamespace atcoder {\n \ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n \n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n g[from].push_back(_edge{to, int(g[to].size()), cap});\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0});\n return m;\n }\n \n struct edge {\n int from, to;\n Cap cap, flow;\n };\n \n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n \n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n \n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n \n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) break;\n }\n return res;\n };\n \n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n while (flow < flow_limit) {\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n }\n return flow;\n }\n \n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n \n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n \n} // namespace atcoder\nusing namespace atcoder;\n\nvoid Warshall_Floyd(std::vector<std::vector<int>> &G){\n\tint N=G.size();\n\tassert(N==(int)G[0].size());\n\tfor(int k=0;k<N;k++){\n\t\tfor(int i=0;i<N;i++){\n\t\t\tfor(int j=0;j<N;j++){\n\t\t\t\tif(G[i][j]>G[i][k]+G[k][j]){\n\t\t\t\t\tG[i][j]=G[i][k]+G[k][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\t//cin>>t;\n\trep(i,t) solve();\n}\n\nvoid solve(){\n\tint N,M,K;\n\tcin>>N>>M>>K;\n\tvector<char> p(N);\n\trep(i,N) cin>>p[i];\n\tvector<vector<int>> G(N,vector<int>(N,INF));\n\trep(i,N) G[i][i]=0;\n\trep(i,M){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\ta--,b--;\n\t\tG[a][b]=1;\n\t\tG[b][a]=0;\n\t}\n\tWarshall_Floyd(G);\n\tmf_graph<int> mfg(N+2);\n\trep(i,N){\n\t\tif((p[i]-'a')%2){\n\t\t\tmfg.add_edge(i,N+1,1);\n\t\t\tcontinue;\n\t\t}\n\t\tmfg.add_edge(N,i,1);\n\t\trep(j,N){\n\t\t\tif(G[i][j]<=K&&(abs(13-abs(p[i]-p[j]))==12)){\n\t\t\t\tmfg.add_edge(i,j,1);\n\t\t\t}\n\t\t}\n\t}\n\tint ans=mfg.flow(N,N+1);\n\tcout<<ans<<\"\\n\";\n}","accuracy":0.6909090909090909,"time_ms":20,"memory_kb":4600,"score_of_the_acc":-0.3074,"final_rank":12},{"submission_id":"aoj_3168_5067410","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\nnamespace CharacterClass {\n\tconstexpr string_view\n\t digit = \"0123456789\",\n\t xdigit = \"0123456789ABCDEFabcdef\", lower = \"abcdefghijklmnopqrstuvwxyz\",\n\t upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n\t alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t alnum = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t word = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\",\n\t punct = R\"(!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~)\",\n\t graph =\n\t R\"(!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t print =\n\t R\"( !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t blank = \" \\t\", space = \" \\t\\n\\r\\f\\v\";\n} // namespace CharacterClass\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Printer {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid print(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(bool v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(vector<bool>::reference v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid print(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid print(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid print(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void print(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\n\t\tprint(v.first);\n\t\tprint(D.d);\n\t\tprint(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) print(D.d);\n\t\t\tprint(*i);\n\t\t}\n\t}\n\ttemplate <class T> void print(const vector<T>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void print(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) print(D.l);\n\t\t\tprint(v[i]);\n\t\t}\n\t}\n\n\tPrinter() = default;\n\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tPrinter& operator()() {\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Printer& operator()(H&& h) {\n\t\tprint(h);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\n\t\tprint(h);\n\t\tprint(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\n\t\tprint_range(begin, end);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Printer& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tPrinter& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tPrinter& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tPrinter& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tPrinter& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 7 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T = long long> constexpr T TEN(size_t n) {\n\tT result = 1;\n\tfor (size_t i = 0; i < n; ++i) result *= 10;\n\treturn result;\n}\ntemplate <class T, class U,\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr auto div_ceil(T n, U m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> constexpr T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> constexpr T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T, class U, class V>\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\n\treturn lower <= v && v < upper;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\nconstexpr bool is_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> constexpr T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T> constexpr int BIT(T x, int i) {\n\treturn (x & (1 << i)) ? 1 : 0;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Pow(T a, U n) {\n\tassert(n >= 0);\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Powmod(T a, U n, T mod) {\n\tassert(n >= 0);\n\tif (a > mod) a %= mod;\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 4 \"/home/yuruhiya/programming/library/Graph/ShortestPath.cpp\"\n#include <optional>\n#line 6 \"/home/yuruhiya/programming/library/Graph/ShortestPath.cpp\"\nusing namespace std;\n\nvector<int> ShortestPath(const vector<vector<int>>& graph, int s,\n int inf = numeric_limits<int>::max()) {\n\tint V = graph.size();\n\tvector<int> dist(V, inf);\n\tdist[s] = 0;\n\tqueue<int> que;\n\tque.push(s);\n\twhile (!que.empty()) {\n\t\tint f = que.front();\n\t\tque.pop();\n\t\tfor (auto e : graph[f]) {\n\t\t\tif (dist[e] == inf) {\n\t\t\t\tque.push(e);\n\t\t\t\tdist[e] = dist[f] + 1;\n\t\t\t}\n\t\t}\n\t}\n\treturn dist;\n}\nint ShortestPathST(const vector<vector<int>>& graph, int s, int t,\n int inf = numeric_limits<int>::max()) {\n\tsize_t n = graph.size();\n\tvector<int> dist(n, inf);\n\tdist[s] = 0;\n\tqueue<int> que;\n\tque.push(s);\n\twhile (!que.empty()) {\n\t\tint v = que.front();\n\t\tif (v == t) return dist[t];\n\t\tque.pop();\n\t\tfor (auto u : graph[v]) {\n\t\t\tif (dist[u] == inf) {\n\t\t\t\tque.push(u);\n\t\t\t\tdist[u] = dist[v] + 1;\n\t\t\t}\n\t\t}\n\t}\n\treturn dist[t];\n}\n#line 6 \"/home/yuruhiya/programming/library/Graph/BipartiteMatching.cpp\"\nusing namespace std;\n\nclass BipartiteMatching {\n\tsize_t left, right;\n\tvector<vector<int>> graph;\n\tvector<bool> used;\n\tvector<int> left_match, right_match;\n\tbool dfs(int v) {\n\t\tif (used[v]) {\n\t\t\treturn false;\n\t\t}\n\t\tused[v] = true;\n\t\tfor (int u : graph[v]) {\n\t\t\tif (right_match[u] == -1 || dfs(right_match[u])) {\n\t\t\t\tleft_match[v] = u;\n\t\t\t\tright_match[u] = v;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\npublic:\n\tBipartiteMatching(size_t _left, size_t _right)\n\t : left(_left),\n\t right(_right),\n\t graph(left),\n\t used(left),\n\t left_match(left),\n\t right_match(right) {}\n\tBipartiteMatching(size_t _left, size_t _right, const vector<vector<int>>& _graph)\n\t : left(_left),\n\t right(_right),\n\t graph(_graph),\n\t used(left),\n\t left_match(left),\n\t right_match(right) {\n\t\tassert(graph.size() == left);\n\t}\n\tvoid add_edge(int l, int r) {\n\t\tgraph[l].push_back(r);\n\t}\n\tint solve() {\n\t\tint result = 0;\n\t\tfill(left_match.begin(), left_match.end(), -1);\n\t\tfill(right_match.begin(), right_match.end(), -1);\n\t\tfill(used.begin(), used.end(), false);\n\t\tfor (bool update = true; update;) {\n\t\t\tupdate = false;\n\t\t\tfor (size_t i = 0; i < left; ++i) {\n\t\t\t\tif (left_match[i] == -1 && dfs(i)) {\n\t\t\t\t\tupdate = true;\n\t\t\t\t\t++result;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (update) {\n\t\t\t\tfill(used.begin(), used.end(), false);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\tvector<pair<int, int>> edges() const {\n\t\tvector<pair<int, int>> result;\n\t\tfor (size_t i = 0; i < left; ++i) {\n\t\t\tif (left_match[i] != -1) {\n\t\t\t\tresult.emplace_back(i, left_match[i]);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n};\n#line 4 \"a.cpp\"\n\nint main() {\n\tini(n, m, k);\n\tVI c = step(n) | Map([&](int i) { return in.read<char>() - 'a'; });\n\tdump(c);\n\tVVI g(n);\n\trep(i, m) {\n\t\tint u = in--, v = in--;\n\t\tg[u].push_back(v);\n\t\tg[v].push_back(u);\n\t}\n\tVVI d = step(n) | Map([&](int i) { return ShortestPath(g, i, inf); });\n\n\tBipartiteMatching bg(n, n);\n\trep(i, n) FOR(j, i + 1, n) {\n\t\tif (d[i][j] <= k && ((c[i] + 1) % 26 == c[j] || (c[j] + 1) % 26 == c[i])) {\n\t\t\tint a = i, b = j;\n\t\t\tif (c[a] % 2 == 1) swap(a, b);\n\t\t\tbg.add_edge(a, b);\n\t\t}\n\t}\n\tout(bg.solve());\n}","accuracy":1,"time_ms":20,"memory_kb":4492,"score_of_the_acc":-0.279,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_3168_10848645\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define INF 1e8\\nvoid warshall_floyd(vector<vector<int>> &M) {\\n int n = M.size();\\n for (int i = 0; i < n; i++)\\n for (int j = 0; j < n; j++)\\n for (int k = 0; k < n; k++)\\n M[j][k] = min(M[j][k], M[j][i] + M[i][k]);\\n}\\n\\nstruct edge {\\n int to, cap, rev;\\n};\\n\\nvoid add_edge(vector<vector<edge>> &G, int from, int to, int cap) {\\n G[from].emplace_back((edge) {to, cap, (int) G[to].size()});\\n G[to].emplace_back((edge) {from, 0, (int) G[from].size() - 1});\\n}\\n\\nint dfs_f(vector<vector<edge>> &G, vector<bool> &used, int v, int t, int f) {\\n if (v == t) return f;\\n used[v] = true;\\n for (int i = 0; i < G[v].size(); i++) {\\n edge &e = G[v][i];\\n if (!used[e.to] && e.cap > 0) {\\n int d = dfs_f(G, used, e.to, t, min(f, e.cap));\\n if (d > 0) {\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint max_flow(vector<vector<edge>> &G, int s, int t) {\\n int flow = 0;\\n while (true) {\\n vector<bool> used(G.size(), false);\\n int f = dfs_f(G, used, s, t, INF);\\n if (f == 0) return flow;\\n flow += f;\\n }\\n}\\n#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);\\nint main(){\\n FIO\\n int n, m, k;\\n cin >> n >> m >> k;\\n\\n vector<char> c(n);\\n for (int i = 0; i < n; i++) cin >> c.at(i);\\n\\n vector<vector<int>> M(n, vector<int>(n, INF));\\n\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n cin >> u >> v;\\n u--;\\n v--;\\n M[u][v] = 1;\\n M[v][u] = 1;\\n }\\n\\n warshall_floyd(M);\\n\\n vector<vector<edge>> G(2 * n + 2);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n if (i == j) continue;\\n if (M[i][j] <= k && (c[i] + 1 == c[j] || c[j] + 1 == c[i] || (c[i] == 'a' && c[j] == 'z') || (c[i] == 'z' && c[j] == 'a'))) {\\n add_edge(G, i, n + j, 1);\\n add_edge(G, j, n + i, 1);\\n }\\n }\\n }\\n\\n for (int i = 0; i < n; i++) add_edge(G, 2 * n, i, 1);\\n for (int i = 0; i < n; i++) add_edge(G, n + i, 2 * n + 1, 1);\\n\\n cout << max_flow(G, 2 * n, 2 * n + 1) / 2 << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7280,\n \"score_of_the_acc\": -1.0104,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3168_8704655\",\n \"code_snippet\": \"#line 1 \\\"3168.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3168\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\\\"\\n\\n#include <cstdint>\\n#include <cstddef>\\n\\nnamespace zawa {\\n\\nusing i16 = std::int16_t;\\nusing i32 = std::int32_t;\\nusing i64 = std::int64_t;\\nusing i128 = __int128_t;\\n\\nusing u8 = std::uint8_t;\\nusing u16 = std::uint16_t;\\nusing u32 = std::uint32_t;\\nusing u64 = std::uint64_t;\\n\\nusing usize = std::size_t;\\n\\n} // namespace zawa\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#include <iostream>\\n#include <iomanip>\\n\\nnamespace zawa {\\n\\nvoid SetFastIO() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n}\\n\\nvoid SetPrecision(u32 dig) {\\n std::cout << std::fixed << std::setprecision(dig);\\n}\\n\\n} // namespace zawa\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Utility/U32Pair.hpp\\\"\\n\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/Utility/U32Pair.hpp\\\"\\n\\n#include <functional>\\n#line 7 \\\"/home/zawatin/compro/cp-documentation/Src/Utility/U32Pair.hpp\\\"\\n\\nnamespace zawa {\\n\\nclass U32Pair {\\nprivate:\\n static constexpr u32 SHIFT{32};\\n static constexpr u32 MASK{static_cast<u32>((1LL << SHIFT) - 1)};\\n u64 value_{};\\npublic:\\n constexpr U32Pair() {}\\n constexpr U32Pair(u32 first, u32 second) {\\n value_ = (static_cast<u64>(first) << SHIFT) | second;\\n }\\n constexpr u32 first() const noexcept {\\n return static_cast<u32>(value_ >> SHIFT);\\n }\\n constexpr u32 second() const noexcept {\\n return static_cast<u32>(value_ & MASK);\\n }\\n constexpr u64 combined() const noexcept {\\n return value_;\\n }\\n constexpr U32Pair& operator=(const U32Pair& rhs) {\\n value_ = rhs.value_;\\n return *this;\\n }\\n friend constexpr bool operator==(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ == rhs.value_;\\n }\\n friend constexpr bool operator!=(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ != rhs.value_;\\n }\\n friend constexpr bool operator<(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ < rhs.value_;\\n }\\n friend constexpr bool operator<=(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ <= rhs.value_;\\n }\\n friend constexpr bool operator>(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ > rhs.value_;\\n }\\n friend constexpr bool operator>=(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ >= rhs.value_;\\n }\\n friend std::ostream& operator<<(std::ostream& os, const U32Pair& pair) {\\n os << '(' << pair.first() << ',' << pair.second() << ')';\\n return os;\\n }\\n};\\n\\nstruct U32PairHash {\\n usize operator()(const U32Pair& pair) const noexcept {\\n return std::hash<u64>{}(pair.combined());\\n }\\n};\\n\\n} // namespace zawa\\n#line 5 \\\"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\\\"\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <limits>\\n#include <type_traits>\\n#include <vector>\\n#include <queue>\\n\\nnamespace zawa {\\n\\ntemplate <class Cap> \\nclass Dinic {\\nprivate:\\n static_assert(std::is_signed_v<Cap>, \\\"Cap must be signed\\\");\\n usize n_{}, m_{};\\n static constexpr u32 invalid() noexcept {\\n return std::numeric_limits<u32>::max();\\n }\\npublic:\\n inline usize size() const noexcept {\\n return n_;\\n }\\n inline usize edgeNumber() const noexcept {\\n return m_;\\n }\\nprivate:\\n struct Edge {\\n u32 to{}, rev{};\\n Cap residual{};\\n Edge() = default;\\n Edge(u32 to, u32 rev, const Cap& residual) \\n : to{to}, rev{rev}, residual{residual} {}\\n };\\n\\n std::vector<std::vector<Edge>> g_;\\n std::vector<U32Pair> edges_;\\n std::vector<u32> label_, cur_;\\n\\n bool dualStep(u32 s, u32 t) {\\n std::fill(label_.begin(), label_.end(), invalid());\\n label_[s] = 0;\\n std::queue<u32> queue{ { s } };\\n while (queue.size()) {\\n u32 v{queue.front()};\\n queue.pop();\\n for (const Edge& e : g_[v]) if (e.residual > 0) {\\n if (label_[e.to] > label_[v] + 1) {\\n label_[e.to] = label_[v] + 1;\\n if (e.to == t) return true;\\n queue.emplace(e.to);\\n }\\n }\\n }\\n return false;\\n }\\n\\n bool admissible(u32 v, const Edge& e) const noexcept {\\n return e.residual > 0 and label_[v] + 1 == label_[e.to];\\n }\\n\\n inline void flow(Edge& e, Cap f) {\\n e.residual -= f;\\n g_[e.to][e.rev].residual += f;\\n }\\n\\n Cap dfs(u32 v, u32 t, Cap up) {\\n if (v == t) return up;\\n Cap res{};\\n for (u32& i{cur_[v]} ; i < g_[v].size() ; i++) {\\n if (!admissible(v, g_[v][i])) continue;\\n Cap f{dfs(g_[v][i].to, t, std::min(g_[v][i].residual, up - res))};\\n if (f == 0) continue;\\n flow(g_[v][i], f);\\n res += f;\\n if (res == up) return res;\\n }\\n return res;\\n }\\n\\n Cap primalStep(u32 s, u32 t) {\\n std::fill(cur_.begin(), cur_.end(), 0u);\\n cur_[t] = g_[t].size();\\n Cap res{};\\n while (true) {\\n Cap f{dfs(s, t, std::numeric_limits<Cap>::max())};\\n if (f == 0) break;\\n res += f;\\n }\\n return res;\\n }\\n\\n const Edge& edge(u32 i) const noexcept {\\n return g_[edges_[i].first()][edges_[i].second()];\\n }\\n const Edge& reverse(u32 i) const noexcept {\\n const Edge& e{edge(i)};\\n return g_[e.to][e.rev];\\n }\\n\\npublic:\\n Dinic() = default;\\n Dinic(u32 n, u32 m = 0u) \\n : n_{n}, m_{m}, g_(n), edges_{}, label_(n), cur_(n) {\\n g_.shrink_to_fit();\\n label_.shrink_to_fit();\\n cur_.shrink_to_fit();\\n edges_.reserve(m);\\n }\\n\\n u32 addEdge(u32 u, u32 v, const Cap& cap) {\\n assert(u < size());\\n assert(v < size());\\n u32 id{static_cast<u32>(g_[u].size())};\\n u32 revId{u == v ? id + 1 : static_cast<u32>(g_[v].size())};\\n u32 res{static_cast<u32>(edges_.size())};\\n edges_.emplace_back(u, id);\\n g_[u].emplace_back(v, revId, cap);\\n g_[v].emplace_back(u, id, Cap{});\\n return res;\\n }\\n\\n const Cap& flowed(u32 id) const noexcept {\\n assert(id < edgeNumber());\\n return reverse(id).residual;\\n }\\n const Cap& residual(u32 id) const noexcept {\\n assert(id < edgeNumber());\\n return edge(id).residual;\\n }\\n const Cap& capacity(u32 id) const noexcept {\\n assert(id < edgeNumber());\\n return edge(id).residual + reverse(id).residual;\\n }\\n\\n Cap flow(u32 s, u32 t) {\\n assert(s < size());\\n assert(t < size()); \\n Cap res{};\\n while (dualStep(s, t)) {\\n res += primalStep(s, t);\\n }\\n return res;\\n }\\n\\n std::vector<bool> cut(u32 s) {\\n std::vector<bool> res(size());\\n res[s] = true;\\n std::queue<u32> queue{ { s } };\\n while (queue.size()) {\\n u32 v{queue.front()};\\n queue.pop();\\n for (const auto& e : g_[v]) if (e.cap > 0 and !res[e.to]) {\\n res[e.to] = true;\\n queue.emplace(e.to);\\n }\\n }\\n return res;\\n } \\n};\\n\\n} // namespace zawa\\n#line 5 \\\"3168.test.cpp\\\"\\n\\n#line 7 \\\"3168.test.cpp\\\"\\n#include <utility>\\n#line 9 \\\"3168.test.cpp\\\"\\n\\nbool adjust(char a, char b) {\\n if (a > b) std::swap(a, b);\\n if (a == 'a' and b == 'z') return true;\\n return (int)(b - a) == 1;\\n}\\n\\nint main() {\\n using namespace zawa;\\n int n, m, k; std::cin >> n >> m >> k;\\n std::vector<char> s(n);\\n for (auto& c : s) std::cin >> c;\\n const int INF{(int)1e9};\\n std::vector g(n, std::vector<int>(n, INF));\\n for (int i{} ; i < n ; i++) g[i][i] = 0;\\n for (int _{} ; _ < m ; _++) {\\n int u, v; std::cin >> u >> v;\\n u--; v--;\\n g[u][v] = g[v][u] = 1;\\n }\\n for (int k{} ; k < n ; k++) {\\n for (int i{} ; i < n ; i++) {\\n for (int j{} ; j < n ; j++) {\\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\\n }\\n }\\n }\\n Dinic<int> solver(2 * n + 2);\\n for (int i{} ; i < n ; i++) {\\n solver.addEdge(2 * n, i, 1);\\n solver.addEdge(n + i, 2 * n + 1, 1);\\n }\\n for (int i{} ; i < n ; i++) {\\n for (int j{i + 1} ; j < n ; j++) {\\n if (g[i][j] > k) continue;\\n if (!adjust(s[i], s[j])) continue;\\n if (s[i] % 2) {\\n solver.addEdge(i, n + j, 1);\\n }\\n else {\\n solver.addEdge(j, n + i, 1);\\n }\\n }\\n }\\n int ans{solver.flow(2 * n, 2 * n + 1)};\\n std::cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4832,\n \"score_of_the_acc\": -0.3682,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3168_8652993\",\n \"code_snippet\": \"#line 1 \\\"3168.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3168\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\\\"\\n\\n#include <cstdint>\\n#include <cstddef>\\n\\nnamespace zawa {\\n\\nusing i16 = std::int16_t;\\nusing i32 = std::int32_t;\\nusing i64 = std::int64_t;\\nusing i128 = __int128_t;\\n\\nusing u8 = std::uint8_t;\\nusing u16 = std::uint16_t;\\nusing u32 = std::uint32_t;\\nusing u64 = std::uint64_t;\\n\\nusing usize = std::size_t;\\n\\n} // namespace zawa\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#include <iostream>\\n#include <iomanip>\\n\\nnamespace zawa {\\n\\nvoid SetFastIO() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n}\\n\\nvoid SetPrecision(u32 dig) {\\n std::cout << std::fixed << std::setprecision(dig);\\n}\\n\\n} // namespace zawa\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\\\"\\n\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\\\"\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <type_traits>\\n#include <utility>\\n#include <vector>\\n\\nnamespace zawa {\\n\\ntemplate <class Cap>\\nclass Dinic {\\nprivate:\\n static_assert(std::is_signed_v<Cap>, \\\"Cap must be signed\\\");\\n static constexpr u32 INVALID{static_cast<u32>(-1)};\\n using EdgePointer = std::pair<u32, u32>;\\npublic:\\n static constexpr u32 invalid() noexcept {\\n return INVALID;\\n }\\nprivate:\\n class ResidualGraph {\\n public:\\n struct Edge {\\n u32 from{}, to{};\\n Cap cap{};\\n u32 rev{}, id{};\\n Edge() = default;\\n Edge(u32 from, u32 to, const Cap& cap, u32 rev, u32 id)\\n : from{from}, to{to}, cap{cap}, rev{rev}, id{id} {}\\n EdgePointer reverseEdgePointer() const {\\n return EdgePointer{to, rev};\\n }\\n }; \\n private:\\n usize n_{}, m_{};\\n std::vector<std::vector<Edge>> g_{};\\n public:\\n ResidualGraph() = default;\\n ResidualGraph(usize n) : n_{n}, m_{}, g_(n) {\\n g_.shrink_to_fit();\\n }\\n\\n inline usize size() const noexcept {\\n return n_;\\n }\\n inline usize edgeNumber() const noexcept {\\n return m_;\\n }\\n u32 invalidEdgePointer(u32 v) const noexcept {\\n return g_[v].size();\\n }\\n\\n std::vector<Edge>& operator[](usize i) noexcept {\\n return g_[i];\\n }\\n const std::vector<Edge>& operator[](usize i) const noexcept {\\n return g_[i];\\n }\\n Edge& operator[](const EdgePointer& e) noexcept {\\n return g_[e.first][e.second];\\n }\\n const Edge& operator[](const EdgePointer& e) const noexcept {\\n return g_[e.first][e.second];\\n }\\n\\n const Edge& reverseEdge(const EdgePointer& pos) {\\n return g_[g_[pos].reverseEdgePointer()];\\n }\\n \\n u32 addEdge(u32 from, u32 to, const Cap& cap, u32 id) {\\n u32 i{static_cast<u32>(g_[from].size())};\\n u32 j{static_cast<u32>(from == to ? i + 1 : g_[to].size())};\\n g_[from].emplace_back(from, to, cap, j, id);\\n g_[to].emplace_back(to, from, Cap{}, i, id);\\n m_++;\\n return i;\\n }\\n void update(Edge& e, const Cap& flow) {\\n assert(e.cap >= flow);\\n e.cap -= flow;\\n (*this)[e.reverseEdgePointer()].cap += flow;\\n }\\n };\\n\\n using Edge = typename ResidualGraph::Edge;\\n\\n ResidualGraph graph_;\\n std::vector<u32> label_;\\n std::vector<EdgePointer> edges_;\\n\\npublic:\\n inline usize size() const noexcept {\\n return graph_.size();\\n }\\n inline usize edgeNumber() const noexcept { \\n return graph_.edgeNumber();\\n }\\nprivate:\\n\\n bool admissible(const Edge& e) {\\n return e.cap > 0 and label_[e.from] + 1 == label_[e.to];\\n }\\n\\n bool dualStep(u32 s, u32 t) {\\n std::fill(label_.begin(), label_.end(), invalid());\\n label_[s] = 0;\\n std::vector<u32> queue;\\n queue.reserve(size());\\n queue.emplace_back(s);\\n for (u32 topQ{} ; topQ < queue.size() ; topQ++) {\\n u32 v{queue[topQ]};\\n for (const auto& e : graph_[v]) if (e.cap > 0) {\\n if (label_[e.to] > label_[v] + 1) {\\n label_[e.to] = label_[v] + 1;\\n queue.emplace_back(e.to);\\n }\\n }\\n }\\n return label_[t] < size();\\n }\\n\\n bool findAdmissiblePath(u32 s, u32 t, std::vector<EdgePointer>& path) {\\n std::vector<u32> currentEdge(size());\\n currentEdge[t] = graph_.invalidEdgePointer(t);\\n u32 v{s};\\n while (true) {\\n while (currentEdge[v] != graph_.invalidEdgePointer(v)) {\\n const Edge& now{graph_[v][currentEdge[v]]};\\n if (admissible(now)) {\\n path.emplace_back(v, currentEdge[v]);\\n v = now.to;\\n }\\n else {\\n currentEdge[v]++;\\n }\\n }\\n if (v == s) return false;\\n if (v == t) return true;\\n if (v != t) {\\n v = path.back().first;\\n path.pop_back();\\n currentEdge[v]++;\\n }\\n }\\n assert(false);\\n return false;\\n }\\n\\n Cap flow(const std::vector<EdgePointer>& path) {\\n auto min{std::min_element(path.begin(), path.end(), [&](const EdgePointer& l, const EdgePointer& r) -> bool {\\n return graph_[l].cap < graph_[r].cap;\\n })};\\n Cap amount{graph_[*min].cap};\\n assert(amount > 0);\\n for (const auto& pos : path) {\\n Edge& e{graph_[pos]};\\n graph_.update(e, amount);\\n }\\n return amount;\\n }\\n\\n Cap primalStep(u32 s, u32 t) {\\n std::vector<EdgePointer> path;\\n Cap res{};\\n while (findAdmissiblePath(s, t, path)) {\\n res += flow(path);\\n path.clear();\\n }\\n return res;\\n }\\n\\npublic:\\n\\n Dinic() = default;\\n // @param m: 辺数をここに入れるとreserveしてくれる\\n Dinic(usize n, usize m = usize{}) : graph_{n}, label_(n) {\\n label_.shrink_to_fit();\\n edges_.reserve(m);\\n }\\n\\n u32 addEdge(u32 from, u32 to, const Cap& cap, u32 id = invalid()) {\\n assert(from < size());\\n assert(to < size());\\n u32 res{static_cast<u32>(edges_.size())};\\n edges_.emplace_back(from, graph_.addEdge(from, to, cap, id));\\n return res;\\n }\\n\\n Cap residual(u32 id) {\\n assert(id < edgeNumber());\\n return graph_[edges_[id]].cap;\\n }\\n\\n Cap flowed(u32 id) {\\n assert(id < edgeNumber());\\n return graph_.reverseEdge(edges_[id]).cap;\\n }\\n\\n Cap originCap(u32 id) {\\n assert(id < edgeNumber());\\n EdgePointer e{edges_[id]};\\n return graph_[e].cap + graph_.reverseEdge(edges_[id]).cap;\\n }\\n\\n Cap flow(u32 s, u32 t) {\\n assert(s < size());\\n assert(t < size());\\n Cap res{};\\n while (dualStep(s, t)) {\\n res += primalStep(s, t);\\n }\\n return res;\\n }\\n};\\n\\n} // namespace zawa\\n#line 5 \\\"3168.test.cpp\\\"\\n\\n#line 9 \\\"3168.test.cpp\\\"\\n\\nbool adjust(char a, char b) {\\n if (a > b) std::swap(a, b);\\n if (a == 'a' and b == 'z') return true;\\n return (int)(b - a) == 1;\\n}\\n\\nint main() {\\n using namespace zawa;\\n int n, m, k; std::cin >> n >> m >> k;\\n std::vector<char> s(n);\\n for (auto& c : s) std::cin >> c;\\n const int INF{(int)1e9};\\n std::vector g(n, std::vector<int>(n, INF));\\n for (int i{} ; i < n ; i++) g[i][i] = 0;\\n for (int _{} ; _ < m ; _++) {\\n int u, v; std::cin >> u >> v;\\n u--; v--;\\n g[u][v] = g[v][u] = 1;\\n }\\n for (int k{} ; k < n ; k++) {\\n for (int i{} ; i < n ; i++) {\\n for (int j{} ; j < n ; j++) {\\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\\n }\\n }\\n }\\n Dinic<int> solver(2 * n + 2);\\n for (int i{} ; i < n ; i++) {\\n solver.addEdge(2 * n, i, 1);\\n solver.addEdge(n + i, 2 * n + 1, 1);\\n }\\n for (int i{} ; i < n ; i++) {\\n for (int j{i + 1} ; j < n ; j++) {\\n if (g[i][j] > k) continue;\\n if (!adjust(s[i], s[j])) continue;\\n if (s[i] % 2) {\\n solver.addEdge(i, n + j, 1);\\n }\\n else {\\n solver.addEdge(j, n + i, 1);\\n }\\n }\\n }\\n int ans{solver.flow(2 * n, 2 * n + 1)};\\n std::cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5384,\n \"score_of_the_acc\": -0.513,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3168_8652453\",\n \"code_snippet\": \"#line 1 \\\"3168.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3168\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\\\"\\n\\n#include <cstdint>\\n#include <cstddef>\\n\\nnamespace zawa {\\n\\nusing i16 = std::int16_t;\\nusing i32 = std::int32_t;\\nusing i64 = std::int64_t;\\nusing i128 = __int128_t;\\n\\nusing u8 = std::uint8_t;\\nusing u16 = std::uint16_t;\\nusing u32 = std::uint32_t;\\nusing u64 = std::uint64_t;\\n\\nusing usize = std::size_t;\\n\\n} // namespace zawa\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#include <iostream>\\n#include <iomanip>\\n\\nnamespace zawa {\\n\\nvoid SetFastIO() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n}\\n\\nvoid SetPrecision(u32 dig) {\\n std::cout << std::fixed << std::setprecision(dig);\\n}\\n\\n} // namespace zawa\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\\\"\\n\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\\\"\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <type_traits>\\n#include <utility>\\n#include <vector>\\n\\nnamespace zawa {\\n\\ntemplate <class Cap>\\nclass Dinic {\\nprivate:\\n static_assert(std::is_signed_v<Cap>, \\\"Cap must be signed\\\");\\n static constexpr u32 INVALID{static_cast<u32>(-1)};\\npublic:\\n static constexpr u32 invalid() noexcept {\\n return INVALID;\\n }\\nprivate:\\n class ResidualGraph {\\n public:\\n struct Edge {\\n u32 from{}, to{};\\n Cap cap{};\\n u32 rev{}, id{};\\n Edge() = default;\\n Edge(u32 from, u32 to, const Cap& cap, u32 rev, u32 id)\\n : from{from}, to{to}, cap{cap}, rev{rev}, id{id} {}\\n }; \\n private:\\n usize n_{}, m_{};\\n std::vector<std::vector<Edge>> g_{};\\n public:\\n ResidualGraph() = default;\\n ResidualGraph(usize n) : n_{n}, m_{}, g_(n) {\\n g_.shrink_to_fit();\\n }\\n\\n inline usize size() const noexcept {\\n return n_;\\n }\\n inline usize edgeNumber() const noexcept {\\n return m_;\\n }\\n\\n std::vector<Edge>& operator[](usize i) noexcept {\\n assert(i < size());\\n return g_[i];\\n }\\n const std::vector<Edge>& operator[](usize i) const noexcept {\\n assert(i < size());\\n return g_[i];\\n }\\n\\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id) {\\n u32 i{static_cast<u32>(g_[from].size())};\\n u32 j{static_cast<u32>(from == to ? i + 1 : g_[to].size())};\\n g_[from].emplace_back(from, to, cap, j, id);\\n g_[to].emplace_back(to, from, Cap{}, i, id);\\n m_++;\\n }\\n void update(Edge& e, const Cap& flow) {\\n assert(e.cap >= flow);\\n e.cap -= flow;\\n g_[e.to][e.rev].cap += flow;\\n }\\n u32 invalidEdgePointer(u32 v) const noexcept {\\n return g_[v].size();\\n }\\n };\\n\\n ResidualGraph graph_;\\n std::vector<u32> label_;\\n\\npublic:\\n using Edge = typename ResidualGraph::Edge;\\n inline usize size() const noexcept {\\n return graph_.size();\\n }\\nprivate:\\n\\n bool admissible(const Edge& e) {\\n return e.cap > 0 and label_[e.from] + 1 == label_[e.to];\\n }\\n\\n bool dualStep(u32 s, u32 t) {\\n std::fill(label_.begin(), label_.end(), invalid());\\n label_[s] = 0;\\n std::vector<u32> queue;\\n queue.reserve(size());\\n queue.emplace_back(s);\\n for (u32 topQ{} ; topQ < queue.size() ; topQ++) {\\n u32 v{queue[topQ]};\\n for (const auto& e : graph_[v]) if (e.cap > 0) {\\n if (label_[e.to] > label_[v] + 1) {\\n label_[e.to] = label_[v] + 1;\\n queue.emplace_back(e.to);\\n }\\n }\\n }\\n return label_[t] < size();\\n }\\n\\n using EdgePointer = std::pair<u32, u32>;\\n\\n bool findAdmissiblePath(u32 s, u32 t, std::vector<EdgePointer>& path) {\\n std::vector<u32> currentEdge(size());\\n currentEdge[t] = graph_.invalidEdgePointer(t);\\n u32 v{s};\\n while (true) {\\n while (currentEdge[v] != graph_.invalidEdgePointer(v)) {\\n const Edge& now{graph_[v][currentEdge[v]]};\\n if (admissible(now)) {\\n path.emplace_back(v, currentEdge[v]);\\n v = now.to;\\n }\\n else {\\n currentEdge[v]++;\\n }\\n }\\n if (v == s) return false;\\n if (v == t) return true;\\n if (v != t) {\\n v = path.back().first;\\n path.pop_back();\\n currentEdge[v]++;\\n }\\n }\\n assert(false);\\n return false;\\n }\\n\\n Cap flow(const std::vector<EdgePointer>& path) {\\n auto min{std::min_element(path.begin(), path.end(), [&](const EdgePointer& l, const EdgePointer& r) -> bool {\\n return graph_[l.first][l.second].cap < graph_[r.first][r.second].cap;\\n })};\\n Cap amount{graph_[min->first][min->second].cap};\\n assert(amount > 0);\\n for (const auto& [x, y] : path) {\\n Edge& e{graph_[x][y]};\\n graph_.update(e, amount);\\n }\\n return amount;\\n }\\n\\n Cap primalStep(u32 s, u32 t) {\\n std::vector<EdgePointer> path;\\n Cap res{};\\n while (findAdmissiblePath(s, t, path)) {\\n res += flow(path);\\n path.clear();\\n }\\n return res;\\n }\\n\\npublic:\\n\\n Dinic() = default;\\n Dinic(usize n) : graph_{n}, label_(n) {\\n label_.shrink_to_fit();\\n }\\n\\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id = invalid()) {\\n assert(from < size());\\n assert(to < size());\\n graph_.addEdge(from, to, cap, id);\\n }\\n\\n Cap flow(u32 s, u32 t) {\\n assert(s < size());\\n assert(t < size());\\n Cap res{};\\n while (dualStep(s, t)) {\\n res += primalStep(s, t);\\n }\\n return res;\\n }\\n};\\n\\n} // namespace zawa\\n#line 5 \\\"3168.test.cpp\\\"\\n\\n#line 9 \\\"3168.test.cpp\\\"\\n\\nbool adjust(char a, char b) {\\n if (a > b) std::swap(a, b);\\n if (a == 'a' and b == 'z') return true;\\n return (int)(b - a) == 1;\\n}\\n\\nint main() {\\n using namespace zawa;\\n int n, m, k; std::cin >> n >> m >> k;\\n std::vector<char> s(n);\\n for (auto& c : s) std::cin >> c;\\n const int INF{(int)1e9};\\n std::vector g(n, std::vector<int>(n, INF));\\n for (int i{} ; i < n ; i++) g[i][i] = 0;\\n for (int _{} ; _ < m ; _++) {\\n int u, v; std::cin >> u >> v;\\n u--; v--;\\n g[u][v] = g[v][u] = 1;\\n }\\n for (int k{} ; k < n ; k++) {\\n for (int i{} ; i < n ; i++) {\\n for (int j{} ; j < n ; j++) {\\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\\n }\\n }\\n }\\n Dinic<int> solver(2 * n + 2);\\n for (int i{} ; i < n ; i++) {\\n solver.addEdge(2 * n, i, 1);\\n solver.addEdge(n + i, 2 * n + 1, 1);\\n }\\n for (int i{} ; i < n ; i++) {\\n for (int j{i + 1} ; j < n ; j++) {\\n if (g[i][j] > k) continue;\\n if (!adjust(s[i], s[j])) continue;\\n if (s[i] % 2) {\\n solver.addEdge(i, n + j, 1);\\n }\\n else {\\n solver.addEdge(j, n + i, 1);\\n }\\n }\\n }\\n int ans{solver.flow(2 * n, 2 * n + 1)};\\n std::cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5224,\n \"score_of_the_acc\": -0.4711,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3168_8652444\",\n \"code_snippet\": \"#line 1 \\\"3168.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3168\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\\\"\\n\\n#include <cstdint>\\n#include <cstddef>\\n\\nnamespace zawa {\\n\\nusing i16 = std::int16_t;\\nusing i32 = std::int32_t;\\nusing i64 = std::int64_t;\\nusing i128 = __int128_t;\\n\\nusing u8 = std::uint8_t;\\nusing u16 = std::uint16_t;\\nusing u32 = std::uint32_t;\\nusing u64 = std::uint64_t;\\n\\nusing usize = std::size_t;\\n\\n} // namespace zawa\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#include <iostream>\\n#include <iomanip>\\n\\nnamespace zawa {\\n\\nvoid SetFastIO() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n}\\n\\nvoid SetPrecision(u32 dig) {\\n std::cout << std::fixed << std::setprecision(dig);\\n}\\n\\n} // namespace zawa\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\\\"\\n\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\\\"\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <type_traits>\\n#include <utility>\\n#include <vector>\\n\\n// #include <iostream>\\n\\nnamespace zawa {\\n\\ntemplate <class Cap>\\nclass Dinic {\\nprivate:\\n static_assert(std::is_signed_v<Cap>, \\\"Cap must be signed\\\");\\n static constexpr u32 INVALID{static_cast<u32>(-1)};\\npublic:\\n static constexpr u32 invalid() noexcept {\\n return INVALID;\\n }\\nprivate:\\n class ResidualGraph {\\n public:\\n struct Edge {\\n u32 from{}, to{};\\n Cap cap{};\\n u32 rev{}, id{};\\n Edge() = default;\\n Edge(u32 from, u32 to, const Cap& cap, u32 rev, u32 id)\\n : from{from}, to{to}, cap{cap}, rev{rev}, id{id} {}\\n }; \\n private:\\n usize n_{}, m_{};\\n std::vector<std::vector<Edge>> g_{};\\n public:\\n ResidualGraph() = default;\\n ResidualGraph(usize n) : n_{n}, m_{}, g_(n) {\\n g_.shrink_to_fit();\\n }\\n\\n inline usize size() const noexcept {\\n return n_;\\n }\\n inline usize edgeNumber() const noexcept {\\n return m_;\\n }\\n\\n std::vector<Edge>& operator[](usize i) noexcept {\\n assert(i < size());\\n return g_[i];\\n }\\n const std::vector<Edge>& operator[](usize i) const noexcept {\\n assert(i < size());\\n return g_[i];\\n }\\n\\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id) {\\n u32 i{static_cast<u32>(g_[from].size())};\\n u32 j{static_cast<u32>(from == to ? i + 1 : g_[to].size())};\\n g_[from].emplace_back(from, to, cap, j, id);\\n g_[to].emplace_back(to, from, Cap{}, i, id);\\n m_++;\\n }\\n void update(Edge& e, const Cap& flow) {\\n assert(e.cap >= flow);\\n e.cap -= flow;\\n g_[e.to][e.rev].cap += flow;\\n }\\n u32 invalidEdgePointer(u32 v) const noexcept {\\n return g_[v].size();\\n }\\n };\\n\\n ResidualGraph graph_;\\n std::vector<u32> label_;\\n\\npublic:\\n using Edge = typename ResidualGraph::Edge;\\n inline usize size() const noexcept {\\n return graph_.size();\\n }\\nprivate:\\n\\n bool admissible(const Edge& e) {\\n return e.cap > 0 and label_[e.from] + 1 == label_[e.to];\\n }\\n\\n bool dualStep(u32 s, u32 t) {\\n std::fill(label_.begin(), label_.end(), invalid());\\n label_[s] = 0;\\n std::vector<u32> queue;\\n queue.reserve(size());\\n queue.emplace_back(s);\\n for (u32 topQ{} ; topQ < queue.size() ; topQ++) {\\n u32 v{queue[topQ]};\\n for (const auto& e : graph_[v]) if (e.cap > 0) {\\n if (label_[e.to] > label_[v] + 1) {\\n label_[e.to] = label_[v] + 1;\\n queue.emplace_back(e.to);\\n }\\n }\\n }\\n return label_[t] < size();\\n }\\n\\n using EdgePointer = std::pair<u32, u32>;\\n\\n bool findAdmissiblePath(u32 s, u32 t, std::vector<EdgePointer>& path) {\\n std::vector<u32> currentEdge(size());\\n currentEdge[t] = graph_.invalidEdgePointer(t);\\n u32 v{s};\\n while (true) {\\n // for (auto [x, y] : path) {\\n // std::cout << '(' << x << ',' << y << ',' << graph_[x][y].cap << ')' << ' ';\\n // }\\n // std::cout << std::endl;\\n while (currentEdge[v] != graph_.invalidEdgePointer(v)) {\\n const Edge& now{graph_[v][currentEdge[v]]};\\n if (admissible(now)) {\\n // std::cout << \\\"find edge \\\" << '(' << v << ',' << currentEdge[v] << ',' << now.cap << ')' << std::endl;\\n path.emplace_back(v, currentEdge[v]);\\n v = now.to;\\n // std::cout << \\\"v become \\\" << v << std::endl;\\n }\\n else {\\n currentEdge[v]++;\\n }\\n }\\n if (v == s) return false;\\n if (v == t) return true;\\n if (v != t) {\\n // std::cout << \\\"v rollback \\\" << std::endl;\\n v = path.back().first;\\n // std::cout << \\\"v become \\\" << v << std::endl;\\n path.pop_back();\\n currentEdge[v]++;\\n }\\n }\\n assert(false);\\n return false;\\n }\\n\\n Cap flow(const std::vector<EdgePointer>& path) {\\n // std::cout << \\\"flowing!!!\\\" << std::endl;\\n // for (auto [x, y] : path) {\\n // std::cout << '(' << x << ',' << y << ',' << graph_[x][y].cap << ')' << ' ';\\n // }\\n // std::cout << std::endl;\\n auto min{std::min_element(path.begin(), path.end(), [&](const EdgePointer& l, const EdgePointer& r) -> bool {\\n return graph_[l.first][l.second].cap < graph_[r.first][r.second].cap;\\n })};\\n Cap amount{graph_[min->first][min->second].cap};\\n assert(amount > 0);\\n for (const auto& [x, y] : path) {\\n Edge& e{graph_[x][y]};\\n graph_.update(e, amount);\\n }\\n return amount;\\n }\\n\\n Cap primalStep(u32 s, u32 t) {\\n std::vector<EdgePointer> path;\\n Cap res{};\\n while (findAdmissiblePath(s, t, path)) {\\n res += flow(path);\\n path.clear();\\n }\\n return res;\\n }\\n\\npublic:\\n\\n Dinic() = default;\\n Dinic(usize n) : graph_{n}, label_(n) {\\n label_.shrink_to_fit();\\n }\\n\\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id = invalid()) {\\n assert(from < size());\\n assert(to < size());\\n graph_.addEdge(from, to, cap, id);\\n }\\n\\n Cap flow(u32 s, u32 t) {\\n assert(s < size());\\n assert(t < size());\\n Cap res{};\\n while (dualStep(s, t)) {\\n res += primalStep(s, t);\\n }\\n return res;\\n }\\n};\\n\\n} // namespace zawa\\n#line 5 \\\"3168.test.cpp\\\"\\n\\n#line 9 \\\"3168.test.cpp\\\"\\n\\nbool adjust(char a, char b) {\\n if (a > b) std::swap(a, b);\\n if (a == 'a' and b == 'z') return true;\\n return (int)(b - a) == 1;\\n}\\n\\nint main() {\\n using namespace zawa;\\n int n, m, k; std::cin >> n >> m >> k;\\n std::vector<char> s(n);\\n for (auto& c : s) std::cin >> c;\\n const int INF{(int)1e9};\\n std::vector g(n, std::vector<int>(n, INF));\\n for (int i{} ; i < n ; i++) g[i][i] = 0;\\n for (int _{} ; _ < m ; _++) {\\n int u, v; std::cin >> u >> v;\\n u--; v--;\\n g[u][v] = g[v][u] = 1;\\n }\\n for (int k{} ; k < n ; k++) {\\n for (int i{} ; i < n ; i++) {\\n for (int j{} ; j < n ; j++) {\\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\\n }\\n }\\n }\\n Dinic<int> solver(2 * n + 2);\\n for (int i{} ; i < n ; i++) {\\n solver.addEdge(2 * n, i, 1);\\n solver.addEdge(n + i, 2 * n + 1, 1);\\n }\\n for (int i{} ; i < n ; i++) {\\n for (int j{i + 1} ; j < n ; j++) {\\n if (g[i][j] > k) continue;\\n if (!adjust(s[i], s[j])) continue;\\n if (s[i] % 2) {\\n solver.addEdge(i, n + j, 1);\\n }\\n else {\\n solver.addEdge(j, n + i, 1);\\n }\\n }\\n }\\n int ans{solver.flow(2 * n, 2 * n + 1)};\\n std::cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5224,\n \"score_of_the_acc\": -0.4711,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3168_8652328\",\n \"code_snippet\": \"#line 1 \\\"3168.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3168\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\\\"\\n\\n#include <cstdint>\\n#include <cstddef>\\n\\nnamespace zawa {\\n\\nusing i16 = std::int16_t;\\nusing i32 = std::int32_t;\\nusing i64 = std::int64_t;\\nusing i128 = __int128_t;\\n\\nusing u8 = std::uint8_t;\\nusing u16 = std::uint16_t;\\nusing u32 = std::uint32_t;\\nusing u64 = std::uint64_t;\\n\\nusing usize = std::size_t;\\n\\n} // namespace zawa\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#include <iostream>\\n#include <iomanip>\\n\\nnamespace zawa {\\n\\nvoid SetFastIO() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n}\\n\\nvoid SetPrecision(u32 dig) {\\n std::cout << std::fixed << std::setprecision(dig);\\n}\\n\\n} // namespace zawa\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\\\"\\n\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/Graph/Flow/Dinic.hpp\\\"\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <type_traits>\\n#include <utility>\\n#include <vector>\\n\\n// #include <iostream>\\n\\nnamespace zawa {\\n\\ntemplate <class Cap>\\nclass Dinic {\\nprivate:\\n static_assert(std::is_signed_v<Cap>, \\\"Cap must be signed\\\");\\n static constexpr u32 INVALID{static_cast<u32>(-1)};\\npublic:\\n static constexpr u32 invalid() noexcept {\\n return INVALID;\\n }\\nprivate:\\n class ResidualGraph {\\n public:\\n struct Edge {\\n u32 from{}, to{};\\n Cap cap{};\\n u32 rev{}, id{};\\n Edge() = default;\\n Edge(u32 from, u32 to, const Cap& cap, u32 rev, u32 id)\\n : from{from}, to{to}, cap{cap}, rev{rev}, id{id} {}\\n }; \\n private:\\n usize n_{}, m_{};\\n std::vector<std::vector<Edge>> g_{};\\n public:\\n ResidualGraph() = default;\\n ResidualGraph(usize n) : n_{n}, m_{}, g_(n) {\\n g_.shrink_to_fit();\\n }\\n\\n inline usize size() const noexcept {\\n return n_;\\n }\\n inline usize edgeNumber() const noexcept {\\n return m_;\\n }\\n\\n std::vector<Edge>& operator[](usize i) noexcept {\\n assert(i < size());\\n return g_[i];\\n }\\n const std::vector<Edge>& operator[](usize i) const noexcept {\\n assert(i < size());\\n return g_[i];\\n }\\n\\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id) {\\n u32 i{static_cast<u32>(g_[from].size())};\\n u32 j{static_cast<u32>(from == to ? i + 1 : g_[to].size())};\\n g_[from].emplace_back(from, to, cap, j, id);\\n g_[to].emplace_back(to, from, Cap{}, j, id);\\n m_++;\\n }\\n void update(Edge& e, const Cap& flow) {\\n assert(e.cap >= flow);\\n e.cap -= flow;\\n g_[e.to][e.rev].cap += flow;\\n }\\n u32 invalidEdgePointer(u32 v) const noexcept {\\n return g_[v].size();\\n }\\n };\\n\\n ResidualGraph graph_;\\n std::vector<u32> label_;\\n\\npublic:\\n using Edge = typename ResidualGraph::Edge;\\n inline usize size() const noexcept {\\n return graph_.size();\\n }\\nprivate:\\n\\n bool admissible(const Edge& e) {\\n return e.cap > 0 and label_[e.from] + 1 == label_[e.to];\\n }\\n\\n bool dualStep(u32 s, u32 t) {\\n std::fill(label_.begin(), label_.end(), invalid());\\n label_[s] = 0;\\n std::vector<u32> queue;\\n queue.reserve(size());\\n queue.emplace_back(s);\\n for (u32 topQ{} ; topQ < queue.size() ; topQ++) {\\n u32 v{queue[topQ]};\\n for (const auto& e : graph_[v]) if (e.cap > 0) {\\n if (label_[e.to] > label_[v] + 1) {\\n label_[e.to] = label_[v] + 1;\\n queue.emplace_back(e.to);\\n }\\n }\\n }\\n return label_[t] < size();\\n }\\n\\n using EdgePointer = std::pair<u32, u32>;\\n\\n bool findAdmissiblePath(u32 s, u32 t, std::vector<EdgePointer>& path) {\\n std::vector<u32> currentEdge(size());\\n currentEdge[t] = graph_.invalidEdgePointer(t);\\n u32 v{s};\\n while (true) {\\n // for (auto [x, y] : path) {\\n // std::cout << '(' << x << ',' << y << ',' << graph_[x][y].cap << ')' << ' ';\\n // }\\n // std::cout << std::endl;\\n while (currentEdge[v] != graph_.invalidEdgePointer(v)) {\\n const Edge& now{graph_[v][currentEdge[v]]};\\n if (admissible(now)) {\\n // std::cout << \\\"find edge \\\" << '(' << v << ',' << currentEdge[v] << ',' << now.cap << ')' << std::endl;\\n path.emplace_back(v, currentEdge[v]);\\n v = now.to;\\n // std::cout << \\\"v become \\\" << v << std::endl;\\n }\\n else {\\n currentEdge[v]++;\\n }\\n }\\n if (v == s) return false;\\n if (v == t) return true;\\n if (v != t) {\\n // std::cout << \\\"v rollback \\\" << std::endl;\\n v = path.back().first;\\n // std::cout << \\\"v become \\\" << v << std::endl;\\n path.pop_back();\\n currentEdge[v]++;\\n }\\n }\\n assert(false);\\n return false;\\n }\\n\\n Cap flow(const std::vector<EdgePointer>& path) {\\n // std::cout << \\\"flowing!!!\\\" << std::endl;\\n // for (auto [x, y] : path) {\\n // std::cout << '(' << x << ',' << y << ',' << graph_[x][y].cap << ')' << ' ';\\n // }\\n // std::cout << std::endl;\\n auto min{std::min_element(path.begin(), path.end(), [&](const EdgePointer& l, const EdgePointer& r) -> bool {\\n return graph_[l.first][l.second].cap < graph_[r.first][r.second].cap;\\n })};\\n Cap amount{graph_[min->first][min->second].cap};\\n assert(amount > 0);\\n for (const auto& [x, y] : path) {\\n Edge& e{graph_[x][y]};\\n graph_.update(e, amount);\\n }\\n return amount;\\n }\\n\\n Cap primalStep(u32 s, u32 t) {\\n std::vector<EdgePointer> path;\\n Cap res{};\\n while (findAdmissiblePath(s, t, path)) {\\n res += flow(path);\\n path.clear();\\n }\\n return res;\\n }\\n\\npublic:\\n\\n Dinic() = default;\\n Dinic(usize n) : graph_{n}, label_(n) {\\n label_.shrink_to_fit();\\n }\\n\\n void addEdge(u32 from, u32 to, const Cap& cap, u32 id = invalid()) {\\n assert(from < size());\\n assert(to < size());\\n graph_.addEdge(from, to, cap, id);\\n }\\n\\n Cap flow(u32 s, u32 t) {\\n assert(s < size());\\n assert(t < size());\\n Cap res{};\\n while (dualStep(s, t)) {\\n res += primalStep(s, t);\\n }\\n return res;\\n }\\n};\\n\\n} // namespace zawa\\n#line 5 \\\"3168.test.cpp\\\"\\n\\n#line 9 \\\"3168.test.cpp\\\"\\n\\nbool adjust(char a, char b) {\\n if (a > b) std::swap(a, b);\\n if (a == 'a' and b == 'z') return true;\\n return (int)(b - a) == 1;\\n}\\n\\nint main() {\\n using namespace zawa;\\n int n, m, k; std::cin >> n >> m >> k;\\n std::vector<char> s(n);\\n for (auto& c : s) std::cin >> c;\\n const int INF{(int)1e9};\\n std::vector g(n, std::vector<int>(n, INF));\\n for (int i{} ; i < n ; i++) g[i][i] = 0;\\n for (int _{} ; _ < m ; _++) {\\n int u, v; std::cin >> u >> v;\\n u--; v--;\\n g[u][v] = g[v][u] = 1;\\n }\\n for (int k{} ; k < n ; k++) {\\n for (int i{} ; i < n ; i++) {\\n for (int j{} ; j < n ; j++) {\\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\\n }\\n }\\n }\\n Dinic<int> solver(2 * n + 2);\\n for (int i{} ; i < n ; i++) {\\n solver.addEdge(2 * n, i, 1);\\n solver.addEdge(n + i, 2 * n + 1, 1);\\n }\\n for (int i{} ; i < n ; i++) {\\n for (int j{i + 1} ; j < n ; j++) {\\n if (g[i][j] > k) continue;\\n if (!adjust(s[i], s[j])) continue;\\n if (s[i] % 2) {\\n solver.addEdge(i, n + j, 1);\\n }\\n else {\\n solver.addEdge(j, n + i, 1);\\n }\\n }\\n }\\n int ans{solver.flow(2 * n, 2 * n + 1)};\\n std::cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 0.6909090909090909,\n \"time_ms\": 20,\n \"memory_kb\": 5228,\n \"score_of_the_acc\": -0.4721,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3168_8538376\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repd(i,a,b) for (ll i=(a);i<(b);i++)\\n#define rep(i,n) repd(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> Graph;\\nconst long long INF = 1LL<<60;\\nconst long long MOD = 1000000007;\\n\\n//https://github.com/atcoder/ac-library/tree/master/atcoder\\n#ifndef ATCODER_INTERNAL_QUEUE_HPP\\n#define ATCODER_INTERNAL_QUEUE_HPP 1\\n\\n#include <vector>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#endif // ATCODER_INTERNAL_QUEUE_HPP\\n\\n#ifndef ATCODER_MAXFLOW_HPP\\n#define ATCODER_MAXFLOW_HPP 1\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\n\\nnamespace atcoder {\\n\\ntemplate <class Cap> struct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n explicit mf_graph(int n) : _n(n), g(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& _e = g[pos[i].first][pos[i].second];\\n auto& _re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n\\n Cap flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d =\\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) return res;\\n }\\n level[v] = _n;\\n return res;\\n };\\n\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\n} // namespace atcoder\\n\\n#endif // ATCODER_MAXFLOW_HPP\\n\\nusing namespace atcoder;\\n \\n\\nint main()\\n{ \\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n ll n,m,k;\\n cin>>n>>m>>k;\\n vector<char> c(n);\\n rep(i,n)cin>>c[i];\\n mf_graph<ll> g(n*2+2);\\n Graph G(n);\\n rep(i,m){\\n ll a,b;\\n cin>>a>>b;\\n a--;b--;\\n G[a].push_back(b);\\n G[b].push_back(a);\\n }\\n rep(i,n){\\n vec dist(n,-1);\\n dist[i]=0;\\n queue<ll> que;\\n que.push(i);\\n while(que.size()){\\n ll x=que.front();\\n que.pop();\\n for(ll nx:G[x]){\\n if(dist[nx]>=0)continue;\\n que.push(nx);\\n dist[nx]=dist[x]+1;\\n }\\n }\\n rep(j,n){\\n if(dist[j]==-1)continue;\\n if(dist[j]<=k){\\n ll x=c[i]-'a';\\n ll y=c[j]-'a';\\n ll sub=abs(x-y);\\n if(sub==1||sub==25){\\n if(x%2==0)g.add_edge(2+i,2+n+j,1e6);\\n else g.add_edge(2+j,2+i+n,1e6);\\n }\\n }\\n }\\n }\\n rep(i,n){\\n g.add_edge(0,2+i,1);\\n g.add_edge(2+n+i,1,1);\\n }\\n ll ans=g.flow(0,1);\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6940,\n \"score_of_the_acc\": -0.9108,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3168_7976864\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// テンプレート引数: 距離の型TとT型の無効値(十分大きな値)INF\\n// 引数: Nは頂点数、次に辺の情報(u, v, cost)\\n// directedをtrueにすると有向辺として扱う(u -> v)向き\\n// INFはオーバーフロー注意！！(2倍してもオーバーフローしない値である必要がある)\\ntemplate <class T, T INF>\\nvector<vector<T>> WF(int N, vector<tuple<int, int, T>> E, bool directed) {\\n vector G(N, vector(N, INF));\\n for (int i = 0 ; i < N ; i++) G[i][i] = 0;\\n for (auto [u, v, c] : E) {\\n G[u][v] = min(G[u][v], c);\\n if (!directed) G[v][u] = min(G[v][u], c);\\n }\\n for (int k = 0 ; k < N ; k++) {\\n for (int i = 0 ; i < N ; i++) {\\n for (int j = 0 ; j < N ; j++) {\\n G[i][j] = min(G[i][j], G[i][k] + G[k][j]);\\n }\\n }\\n }\\n return G;\\n}\\n\\n\\n// O(E V^2)\\n// O(E \\\\min(E^{1/2}, V^{2/3})) if caps are constant\\n// template param Flow: 流量の型\\n// template param directed: 有向ならtrue\\ntemplate<typename Flow,bool directed>\\nstruct Dinic{\\n // @member dst: 辺の向かう先\\n // @member cap: 容量\\n // @member rev: 逆辺の「識別番号」\\n // @brief: 流量は管理していないっぽいので、流量が欲しい時は追加時の容量と現在の容量から流量を計算する必要がある。\\n struct Edge {\\n int dst;\\n Flow cap;\\n int rev;\\n Edge(int dst,Flow cap,int rev):dst(dst),cap(cap),rev(rev){}\\n };\\n\\n vector< vector<Edge> > G;\\n vector<int> level,iter;\\n\\n // @param n: 頂点数\\n Dinic(int n):G(n),level(n),iter(n){}\\n\\n // @brief srcからdstへ容量capの辺を追加する\\n // @param src: 始点\\n // @param dst: 終点\\n // @param cap: 容量\\n // @response: 追加した辺の識別番号(多分)\\n int add_edge(int src,int dst,Flow cap){\\n int e=G[src].size();\\n int r=(src==dst?e+1:G[dst].size());\\n G[src].emplace_back(dst,cap,r);\\n G[dst].emplace_back(src,directed?0:cap,e);\\n return e;\\n }\\n\\n void bfs(int s){\\n fill(level.begin(),level.end(),-1);\\n queue<int> que;\\n level[s]=0;\\n que.emplace(s);\\n while(!que.empty()){\\n int v=que.front();que.pop();\\n for(Edge &e : G[v]) {\\n if(e.cap>0 and level[e.dst]<0){\\n level[e.dst]=level[v]+1;\\n que.emplace(e.dst);\\n }\\n }\\n }\\n }\\n\\n Flow dfs(int v,int t,Flow f){\\n if(v==t) return f;\\n for(int &i=iter[v];i<(int)G[v].size();i++){\\n Edge &e=G[v][i];\\n if(e.cap>0 and level[v]<level[e.dst]){\\n Flow d=dfs(e.dst,t,min(f,e.cap));\\n if(d==0) continue;\\n e.cap-=d;\\n G[e.dst][e.rev].cap+=d;\\n return d;\\n }\\n }\\n return 0;\\n }\\n\\n // @brief: sからtへの最大フローを求める\\n Flow flow(int s,int t){\\n return flow(s,t,numeric_limits<Flow>::max()/2);\\n }\\n\\n // @brief: sからtへの流量制限limの最大フローを流す(多分)\\n Flow flow(int s,int t,Flow lim){\\n Flow fl=0;\\n while(1){\\n bfs(s);\\n if(level[t]<0 or lim==0) break;\\n fill(iter.begin(),iter.end(),0);\\n\\n while(1){\\n Flow f=dfs(s,t,lim);\\n if(f==0) break;\\n fl+=f;\\n lim-=f;\\n }\\n }\\n return fl;\\n }\\n\\n // よくわからない\\n Flow cut(int s,int t,int x,int a){\\n static_assert(directed, \\\"must be directed\\\");\\n auto &e=G[x][a];\\n int y=e.dst;\\n Flow cr=G[y][e.rev].cap;\\n if(cr==0) return e.cap=0;\\n e.cap=G[y][e.rev].cap=0;\\n Flow cap=cr-flow(x,y,cr);\\n if(x!=s and cap!=0) flow(x,s,cap);\\n if(t!=y and cap!=0) flow(t,y,cap);\\n return cap;\\n }\\n\\n // @brief: 頂点xのa番目の辺に流量fを追加してs -> tへフローを流す\\n // @condition: 頂点xにa個以上の辺が存在する\\n // @param s: フローのsource\\n // @param t: フローのsink\\n // @param x: 流量を追加したい辺の始点がある頂点\\n // @param a: 流量を追加した辺の識別番号\\n // @param f: 追加したい流量\\n Flow link(int s,int t,int x,int a,Flow f){\\n auto &e=G[x][a];\\n e.cap+=f;\\n return flow(s,t,f);\\n }\\n};\\n\\nvector<int> BipJudge(vector<vector<int>> G) {\\n size_t N = G.size();\\n vector<int> col(N, -1);\\n\\n auto dfs = [&](auto dfs, int v, int c) -> bool {\\n col[v] = c;\\n for (auto x : G[v]) {\\n if (col[x] == c) return false;\\n if (col[x] == -1 and !dfs(dfs, x, 1 - c)) return false;\\n }\\n return true;\\n };\\n\\n bool ok = true;\\n for (size_t i = 0 ; i < N ; i++) {\\n ok &= (col[i] != -1 or dfs(dfs, i, 0));\\n }\\n\\n if (ok) return col;\\n else return vector<int>(N, -1);\\n}\\n\\nint main() {\\n int N, M, K; cin >> N >> M >> K;\\n vector<char> C(N);\\n for (auto& c : C) cin >> c;\\n \\n vector<tuple<int, int, int>> E(M);\\n for (auto& [u, v, c] : E) {\\n cin >> u >> v;\\n u--; v--;\\n c = 1;\\n }\\n\\n auto G = WF<int, (int)1e9>(N, E, false);\\n\\n vector<vector<int>> Ebi(N); \\n for (int i = 0 ; i < N ; i++) {\\n for (int j = 0 ; j < N ; j++) {\\n if (G[i][j] > K) continue;\\n int s = (C[i] - C[j] + 26) % 26;\\n if (s == 1 or s == 25) {\\n Ebi[i].push_back(j);\\n }\\n }\\n }\\n\\n vector<int> col = BipJudge(Ebi);\\n\\n Dinic<int, true> din(N + 2);\\n for (int i = 0 ; i < N ; i++) {\\n if (col[i] == 0) {\\n din.add_edge(N, i, 1);\\n for (auto x : Ebi[i]) din.add_edge(i, x, 1);\\n }\\n else {\\n din.add_edge(i, N + 1, 1);\\n }\\n }\\n\\n int ans = din.flow(N, N + 1);\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5172,\n \"score_of_the_acc\": -0.4574,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3168_7975975\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// テンプレート引数: 距離の型TとT型の無効値(十分大きな値)INF\\n// 引数: Nは頂点数、次に辺の情報(u, v, cost)\\n// directedをtrueにすると有向辺として扱う(u -> v)向き\\n// INFはオーバーフロー注意！！(2倍してもオーバーフローしない値である必要がある)\\ntemplate <class T, T INF>\\nvector<vector<T>> WF(int N, vector<tuple<int, int, T>> E, bool directed) {\\n vector G(N, vector(N, INF));\\n for (int i = 0 ; i < N ; i++) G[i][i] = 0;\\n for (auto [u, v, c] : E) {\\n G[u][v] = min(G[u][v], c);\\n if (!directed) G[v][u] = min(G[v][u], c);\\n }\\n for (int k = 0 ; k < N ; k++) {\\n for (int i = 0 ; i < N ; i++) {\\n for (int j = 0 ; j < N ; j++) {\\n G[i][j] = min(G[i][j], G[i][k] + G[k][j]);\\n }\\n }\\n }\\n return G;\\n}\\n\\n// O(E V^2)\\n// O(E \\\\min(E^{1/2}, V^{2/3})) if caps are constant\\ntemplate<typename Flow,bool directed>\\nstruct Dinic{\\n struct Edge {\\n int dst;\\n Flow cap;\\n int rev;\\n Edge(int dst,Flow cap,int rev):dst(dst),cap(cap),rev(rev){}\\n };\\n\\n vector< vector<Edge> > G;\\n vector<int> level,iter;\\n\\n Dinic(int n):G(n),level(n),iter(n){}\\n\\n int add_edge(int src,int dst,Flow cap){\\n int e=G[src].size();\\n int r=(src==dst?e+1:G[dst].size());\\n G[src].emplace_back(dst,cap,r);\\n G[dst].emplace_back(src,directed?0:cap,e);\\n return e;\\n }\\n\\n void bfs(int s){\\n fill(level.begin(),level.end(),-1);\\n queue<int> que;\\n level[s]=0;\\n que.emplace(s);\\n while(!que.empty()){\\n int v=que.front();que.pop();\\n for(Edge &e : G[v]) {\\n if(e.cap>0 and level[e.dst]<0){\\n level[e.dst]=level[v]+1;\\n que.emplace(e.dst);\\n }\\n }\\n }\\n }\\n\\n Flow dfs(int v,int t,Flow f){\\n if(v==t) return f;\\n for(int &i=iter[v];i<(int)G[v].size();i++){\\n Edge &e=G[v][i];\\n if(e.cap>0 and level[v]<level[e.dst]){\\n Flow d=dfs(e.dst,t,min(f,e.cap));\\n if(d==0) continue;\\n e.cap-=d;\\n G[e.dst][e.rev].cap+=d;\\n return d;\\n }\\n }\\n return 0;\\n }\\n\\n Flow flow(int s,int t,Flow lim){\\n Flow fl=0;\\n while(1){\\n bfs(s);\\n if(level[t]<0 or lim==0) break;\\n fill(iter.begin(),iter.end(),0);\\n\\n while(1){\\n Flow f=dfs(s,t,lim);\\n if(f==0) break;\\n fl+=f;\\n lim-=f;\\n }\\n }\\n return fl;\\n }\\n\\n Flow flow(int s,int t){\\n return flow(s,t,numeric_limits<Flow>::max()/2);\\n }\\n\\n Flow cut(int s,int t,int x,int a){\\n static_assert(directed, \\\"must be directed\\\");\\n auto &e=G[x][a];\\n int y=e.dst;\\n Flow cr=G[y][e.rev].cap;\\n if(cr==0) return e.cap=0;\\n e.cap=G[y][e.rev].cap=0;\\n Flow cap=cr-flow(x,y,cr);\\n if(x!=s and cap!=0) flow(x,s,cap);\\n if(t!=y and cap!=0) flow(t,y,cap);\\n return cap;\\n }\\n\\n Flow link(int s,int t,int x,int a,Flow f){\\n auto &e=G[x][a];\\n e.cap+=f;\\n return flow(s,t,f);\\n }\\n};\\n\\nint main() {\\n int N, M, K; cin >> N >> M >> K;\\n vector<char> C(N);\\n for (auto& c : C) cin >> c;\\n \\n vector<tuple<int, int, int>> E(M);\\n for (auto& [u, v, c] : E) {\\n cin >> u >> v;\\n u--; v--;\\n c = 1;\\n }\\n\\n auto G = WF<int, (int)1e9>(N, E, false);\\n\\n vector<vector<int>> Ebi(N); \\n for (int i = 0 ; i < N ; i++) {\\n for (int j = 0 ; j < N ; j++) {\\n if (G[i][j] > K) continue;\\n int s = (C[i] - C[j] + 26) % 26;\\n if (s == 1 or s == 25) {\\n Ebi[i].push_back(j);\\n }\\n }\\n }\\n\\n vector<int> col(N, -1);\\n auto dfs = [&](auto dfs, int v, int c) -> void {\\n col[v] = c;\\n for (auto x : Ebi[v]) {\\n if (col[x] == -1) dfs(dfs, x, 1 - c);\\n }\\n };\\n\\n for (int i = 0 ; i < N ; i++) {\\n if (col[i] == -1) dfs(dfs, i, 0);\\n }\\n\\n Dinic<int, true> din(N + 2);\\n for (int i = 0 ; i < N ; i++) {\\n if (col[i] == 0) {\\n din.add_edge(N, i, 1);\\n for (auto x : Ebi[i]) din.add_edge(i, x, 1);\\n }\\n else {\\n din.add_edge(i, N + 1, 1);\\n }\\n }\\n\\n int ans = din.flow(N, N + 1);\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5152,\n \"score_of_the_acc\": -0.4522,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3168_7975574\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n//BEGIN CUT HERE\\n// O(E V^2)\\n// O(E \\\\min(E^{1/2}, V^{2/3})) if caps are constant\\ntemplate<typename Flow,bool directed>\\nstruct Dinic{\\n struct Edge {\\n int dst;\\n Flow cap;\\n int rev;\\n Edge(int dst,Flow cap,int rev):dst(dst),cap(cap),rev(rev){}\\n };\\n\\n vector< vector<Edge> > G;\\n vector<int> level,iter;\\n\\n Dinic(int n):G(n),level(n),iter(n){}\\n\\n int add_edge(int src,int dst,Flow cap){\\n int e=G[src].size();\\n int r=(src==dst?e+1:G[dst].size());\\n G[src].emplace_back(dst,cap,r);\\n G[dst].emplace_back(src,directed?0:cap,e);\\n return e;\\n }\\n\\n void bfs(int s){\\n fill(level.begin(),level.end(),-1);\\n queue<int> que;\\n level[s]=0;\\n que.emplace(s);\\n while(!que.empty()){\\n int v=que.front();que.pop();\\n for(Edge &e : G[v]) {\\n if(e.cap>0 and level[e.dst]<0){\\n level[e.dst]=level[v]+1;\\n que.emplace(e.dst);\\n }\\n }\\n }\\n }\\n\\n Flow dfs(int v,int t,Flow f){\\n if(v==t) return f;\\n for(int &i=iter[v];i<(int)G[v].size();i++){\\n Edge &e=G[v][i];\\n if(e.cap>0 and level[v]<level[e.dst]){\\n Flow d=dfs(e.dst,t,min(f,e.cap));\\n if(d==0) continue;\\n e.cap-=d;\\n G[e.dst][e.rev].cap+=d;\\n return d;\\n }\\n }\\n return 0;\\n }\\n\\n Flow flow(int s,int t,Flow lim){\\n Flow fl=0;\\n while(1){\\n bfs(s);\\n if(level[t]<0 or lim==0) break;\\n fill(iter.begin(),iter.end(),0);\\n\\n while(1){\\n Flow f=dfs(s,t,lim);\\n if(f==0) break;\\n fl+=f;\\n lim-=f;\\n }\\n }\\n return fl;\\n }\\n\\n Flow flow(int s,int t){\\n return flow(s,t,numeric_limits<Flow>::max()/2);\\n }\\n\\n Flow cut(int s,int t,int x,int a){\\n static_assert(directed, \\\"must be directed\\\");\\n auto &e=G[x][a];\\n int y=e.dst;\\n Flow cr=G[y][e.rev].cap;\\n if(cr==0) return e.cap=0;\\n e.cap=G[y][e.rev].cap=0;\\n Flow cap=cr-flow(x,y,cr);\\n if(x!=s and cap!=0) flow(x,s,cap);\\n if(t!=y and cap!=0) flow(t,y,cap);\\n return cap;\\n }\\n\\n Flow link(int s,int t,int x,int a,Flow f){\\n auto &e=G[x][a];\\n e.cap+=f;\\n return flow(s,t,f);\\n }\\n};\\n\\nconst int INF = (int)1e9;\\n\\nint main() {\\n int N, M, K; cin >> N >> M >> K;\\n vector<int> C(N);\\n for (auto& c : C) {\\n char op; cin >> op;\\n c = (int)op;\\n }\\n for (auto& c : C) c %= 26;\\n\\n vector G(N, vector(N, INF));\\n for (int i = 0 ; i < N ; i++) G[i][i] = 0;\\n\\n for (int _ = 0 ; _ < M ; _++) {\\n int u, v; cin >> u >> v;\\n u--; v--;\\n G[u][v] = G[v][u] = 1;\\n }\\n\\n for (int k = 0 ; k < N ; k++) {\\n for (int i = 0 ; i < N ; i++) {\\n for (int j = 0 ; j < N ; j++) {\\n G[i][j] = min(G[i][j], G[i][k] + G[k][j]);\\n }\\n }\\n }\\n\\n vector<vector<int>> Ebi(N);\\n\\n for (int i = 0 ; i < N ; i++) {\\n for (int j = i + 1 ; j < N ; j++) {\\n if (G[i][j] > K) continue;\\n int score = (C[i] - C[j] + 26) % 26;\\n if (score == 1 or score == 25) {\\n Ebi[i].push_back(j);\\n Ebi[j].push_back(i);\\n }\\n }\\n }\\n\\n\\n vector<int> id(N, -1);\\n int size = 0;\\n \\n auto dfsid = [&](auto dfsid, int v) -> void {\\n id[v] = size;\\n for (auto x : Ebi[v]) if (id[x] == -1) {\\n dfsid(dfsid, x);\\n }\\n };\\n\\n for (int i = 0 ; i < N ; i++) {\\n if (id[i] == -1) {\\n dfsid(dfsid, i);\\n size++;\\n }\\n }\\n\\n vector<int> col(N, -1); \\n\\n auto dfscol = [&](auto dfscol, int v, int c) -> void {\\n col[v] = c;\\n for (auto x : Ebi[v]) {\\n if (col[x] != -1) {\\n assert(col[x] == 1 - c);\\n }\\n else {\\n dfscol(dfscol, x, 1 - c);\\n }\\n }\\n };\\n\\n for (int i = 0 ; i < N ; i++) {\\n if (col[i] == -1) {\\n dfscol(dfscol, i, 0);\\n }\\n }\\n\\n Dinic<int, true> din(N + 2);\\n vector<int> zero(size), one(size);\\n for (int i = 0 ; i < N ; i++) {\\n if (col[i] == 0) {\\n din.add_edge(N, i, 1);\\n for (auto x : Ebi[i]) {\\n din.add_edge(i, x, 1);\\n }\\n zero[id[i]]++;\\n }\\n else {\\n din.add_edge(i, N + 1, 1);\\n one[id[i]]++;\\n }\\n }\\n\\n \\n int ans = 0;\\n for (int i = 0 ; i < size ; i++) {\\n ans += min(zero[i], one[i]);\\n }\\n\\n int f = din.flow(N, N + 1);\\n\\n cout << f << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5136,\n \"score_of_the_acc\": -0.448,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3168_7975488\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef unsigned uint;\\ntypedef long long ll;\\ntypedef long long lint;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n\\ntypedef char chr;\\ntypedef string str;\\n\\n#define REP(i, n) for (int i=0;i<(int)n;i++)\\n#define ALL(x) x.begin() x.begin()\\n#define SEP \\\" \\\"\\n#define YES cout << \\\"Yes\\\" << endl\\n#define NO cout << \\\"NO\\\" << endl\\n#define OUT(x) cout << x << endl\\n#define OUTF(x) cout << fixed << setprecision(10) << x << endl\\n#define SIZE(v) v.size()\\n#define PB push_back\\n#define MP make_pair\\n#define MT make_typle\\n\\nconst double pi = 3.141592653589793238;\\n\\nconst int large_a = 65;\\nconst int small_a = 97;\\n\\nconst int INF = 2147483647;\\nconst int INT_INF = 2147483647;\\n\\nconst int dy[4] = {-1, 0, 1, 0};\\nconst int dx[4] = {0, 1, 0, -1};\\n\\ntemplate<class T> inline void print_vec(const vector<T>& v) {\\n\\tint last = SIZE(v);\\n\\tREP(i, last) {\\n\\t\\tcout << v[i];\\n\\t\\tif(i != last-1) cout << SEP;\\n\\t}\\n\\tcout << endl;\\n}\\n\\nint main() {\\n\\tint n,m,k;\\n\\tcin>>n>>m>>k;\\n\\tvector<char> chara(n+1);\\n\\tfor(int i=1;i<=n;i++){\\n\\t\\tcin>>chara[i];\\n\\t}\\n\\tvector<vector<int>> g(n+1);\\n\\tfor(int i=0;i<m;i++){\\n\\t\\tint u,v;\\n\\t\\tcin>>u>>v;\\n\\t\\tg[u].push_back(v);\\n\\t\\tg[v].push_back(u);\\n\\t}\\n\\tvector<set<int>> v(n+1);\\n\\t\\n\\tfor(int j=1;j<=n;j++){\\n\\t\\tqueue<int> que;\\n\\t\\tvector<int> dist(n+1,-1);\\n\\t\\tque.push(j);\\n\\t\\tchar nowc=chara[j];\\n\\t\\tdist[j]=0;\\n\\t\\twhile(!que.empty()){\\n\\t\\t\\tint pos=que.front();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tfor(int i=0;i<g[pos].size();i++){\\n\\t\\t\\t\\tint to=g[pos][i];\\n\\t\\t\\t\\tif(dist[to]==-1){\\n\\t\\t\\t\\t\\tdist[to]=dist[pos]+1;\\n\\t\\t\\t\\t\\tchar nextc=chara[to];\\n\\t\\t\\t\\t\\tif(dist[to]<=k){\\n\\t\\t\\t\\t\\t\\tif(nowc=='a'){\\n\\t\\t\\t\\t\\t\\t\\tif(nextc=='z' or nextc=='b'){\\n\\t\\t\\t\\t\\t\\t\\t\\tv[j].insert(to);\\n\\t\\t\\t\\t\\t\\t\\t\\tv[to].insert(j);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t}else if(nowc=='z'){\\n\\t\\t\\t\\t\\t\\t\\tif(nextc=='a' or nextc=='y'){\\n\\t\\t\\t\\t\\t\\t\\t\\tv[j].insert(to);\\n\\t\\t\\t\\t\\t\\t\\t\\tv[to].insert(j);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}else if(abs(nextc-nowc)==1){\\n\\t\\t\\t\\t\\t\\t\\t\\tv[j].insert(to);\\n\\t\\t\\t\\t\\t\\t\\t\\tv[to].insert(j);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tque.push(to);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tset<int> exist;\\n\\tfor(int i=1;i<=n;i++){\\n\\t\\tif(v[i].size()>0){\\n\\t\\t\\texist.insert(i);\\n\\t\\t}\\n\\t}\\n\\n\\n\\n\\n\\tint ans=0;\\n\\twhile(!exist.empty()){\\n\\n\\n\\n\\t\\tint ma=0;\\n\\t\\tint ind=-1;\\n\\t\\tfor(int i=1;i<=n;i++){\\n\\t\\t\\tif(v[i].size()>ma){\\n\\t\\t\\t\\tind=i;\\n\\t\\t\\t\\tma=v[i].size();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\texist.erase(ind);\\n\\t\\tfor(int i=0;i<ma;i++){\\n\\t\\t\\tfor(int j:v[ind]){\\n\\t\\t\\t\\tv[j].erase(ind);\\n\\t\\t\\t\\tif(v[j].empty()){\\n\\t\\t\\t\\t\\texist.erase(j);\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tv[ind].clear();\\n\\t\\tans++;\\n\\t}\\n\\tOUT(ans);\\n}\",\n \"accuracy\": 0.14545454545454545,\n \"time_ms\": 20,\n \"memory_kb\": 4240,\n \"score_of_the_acc\": -0.2129,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3168_7975477\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\nconst int mod = 998244353;\\nconst int inf = (1<<30);\\n\\nconst int dy[4] = {-1,0,0,1};\\nconst int dx[4] = {0,-1,1,0};\\n\\nvector<vector<ll>> g(310,vector<ll>(310,310)); \\nvector<int> c(310);\\nvoid make_ebi(int n){\\n for(int k =0; k<n; k++){\\n for(int i = 0; i <n; i++){\\n for(int j = 0; j<n; j++) g[i][j] = min(g[i][j],g[i][k]+g[k][j]);\\n }\\n }\\n rep(i,n){\\n rep(j,n){\\n if((int)c[i] != ((int)c[j]+1)%26 && (int)c[i] != ((int)c[j]+25)%26){\\n g[i][j] = 310;\\n // cout<<\\\"***\\\"<<endl;\\n }\\n }\\n }\\n\\n\\n\\n\\n}\\n\\n// [lower, upper]\\nint random(int lower, int upper) {\\n return (rand() % (upper + 1)) + lower;\\n}\\n\\nvector<int> make_random_permutation(int n) {\\n vector<int> a(n);\\n iota(a.begin(), a.end(), 0);\\n\\n random_device seed_gen;\\n mt19937 engine(seed_gen());\\n shuffle(a.begin(), a.end(), engine);\\n\\n return a;\\n}\\n\\n\\nint put_trap(int n,int k,vector<vector<ll>> g){\\n int ans = 0;\\n bool c = true;\\n vector<int> x = make_random_permutation(n);\\n while(c){\\n c = false;\\n int mg = 0;\\n int a = -1;\\n \\n rep(i,n){\\n //cout<<\\\"!!\\\"<<endl;\\n int eg = 0;\\n rep(j,n){\\n if(g[x[i]][j] <= k) eg++;\\n }\\n if(eg > mg){\\n // cout<<\\\"??\\\"<<endl;\\n c = true;\\n a = x[i];\\n mg = eg;\\n }\\n }\\n if(c == false) return ans;\\n\\n rep(i,n){\\n g[a][i] = 310;\\n g[i][a] = 310;\\n }\\n ans++;\\n }\\n\\n return ans;\\n}\\n\\n\\nint main(){\\n int n,m,k;\\n cin>>n>>m>>k;\\n rep(i,n){\\n char p;\\n cin>>p;\\n c[i] = int(p-'a');\\n }\\n\\n rep(i,m){\\n int u,v; cin>>u>>v;\\n u--;v--;\\n g[u][v] = 1;\\n g[v][u] = 1;\\n }\\n make_ebi(n);\\n int ans = 310;\\n rep(i,100){\\n ans = min(ans,put_trap(n,k,g));\\n }\\n\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.18181818181818182,\n \"time_ms\": 970,\n \"memory_kb\": 4672,\n \"score_of_the_acc\": -1.3158,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3168_7975147\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\nconst int mod = 998244353;\\nconst int inf = (1<<30);\\n\\nconst int dy[4] = {-1,0,0,1};\\nconst int dx[4] = {0,-1,1,0};\\n\\nvector<vector<ll>> g(310,vector<ll>(310,310)); \\nvector<int> c(310);\\nvoid make_ebi(int n){\\n for(int k =0; k<n; k++){\\n for(int i = 0; i <n; i++){\\n for(int j = 0; j<n; j++) g[i][j] = min(g[i][j],g[i][k]+g[k][j]);\\n }\\n }\\n rep(i,n){\\n rep(j,n){\\n if((int)c[i] != ((int)c[j]+1)%26 && (int)c[i] != ((int)c[j]+25)%26){\\n g[i][j] = 310;\\n // cout<<\\\"***\\\"<<endl;\\n }\\n }\\n }\\n\\n\\n\\n\\n}\\n\\n\\nint put_trap(int n,int k){\\n int ans = 0;\\n bool c = true;\\n while(c){\\n c = false;\\n int mg = 0;\\n int a = -1;\\n\\n rep(i,n){\\n //cout<<\\\"!!\\\"<<endl;\\n int eg = 0;\\n rep(j,n){\\n if(g[i][j] <= k) eg++;\\n }\\n if(eg > mg){\\n // cout<<\\\"??\\\"<<endl;\\n c = true;\\n a = i;\\n mg = eg;\\n }\\n }\\n if(c == false) return ans;\\n\\n rep(i,n){\\n g[a][i] = 310;\\n g[i][a] = 310;\\n }\\n ans++;\\n }\\n\\n return ans;\\n}\\n\\n\\n\\n\\n\\n\\n\\nint main(){\\n int n,m,k;\\n cin>>n>>m>>k;\\n rep(i,n){\\n char p;\\n cin>>p;\\n c[i] = int(p-'a');\\n }\\n\\n rep(i,m){\\n int u,v; cin>>u>>v;\\n u--;v--;\\n g[u][v] = 1;\\n g[v][u] = 1;\\n }\\n make_ebi(n);\\n cout<<put_trap(n,k)<<endl;\\n\\n\\n\\n\\n}\",\n \"accuracy\": 0.14545454545454545,\n \"time_ms\": 20,\n \"memory_kb\": 4244,\n \"score_of_the_acc\": -0.214,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3168_7975074\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n int N, M, K; cin >> N >> M >> K;\\n vector<int> C(N);\\n for (auto& c : C) {\\n char op; cin >> op;\\n c = (int)op;\\n }\\n for (auto& c : C) c %= 26;\\n\\n const int INF = (int)1e9;\\n vector G(N, vector(N, INF));\\n for (int i = 0 ; i < N ; i++) G[i][i] = 0;\\n\\n for (int _ = 0 ; _ < M ; _++) {\\n int u, v; cin >> u >> v;\\n u--; v--;\\n G[u][v] = G[v][u] = 1;\\n }\\n\\n for (int k = 0 ; k < N ; k++) {\\n for (int i = 0 ; i < N ; i++) {\\n for (int j = 0 ; j < N ; j++) {\\n G[i][j] = min(G[i][j], G[i][k] + G[k][j]);\\n }\\n }\\n }\\n\\n vector<vector<int>> Ebi(N);\\n for (int i = 0 ; i < N ; i++) {\\n for (int j = i + 1 ; j < N ; j++) {\\n if (G[i][j] > K) continue;\\n // cout << C[i] << ' ' << C[j] << ' ' << (C[i] - C[j] + 26) % 26 << endl;\\n int score = (C[i] - C[j] + 26) % 26;\\n if (score == 1 or score == 25) {\\n Ebi[i].push_back(j);\\n Ebi[j].push_back(i);\\n }\\n }\\n }\\n\\n\\n vector<int> id(N, -1);\\n int size = 0;\\n \\n auto dfsid = [&](auto dfsid, int v) -> void {\\n id[v] = size;\\n for (auto x : Ebi[v]) if (id[x] == -1) {\\n dfsid(dfsid, x);\\n }\\n };\\n\\n for (int i = 0 ; i < N ; i++) {\\n if (id[i] == -1) {\\n dfsid(dfsid, i);\\n size++;\\n }\\n }\\n\\n vector<int> col(N, -1); \\n\\n auto dfscol = [&](auto dfscol, int v, int c) -> void {\\n col[v] = c;\\n for (auto x : Ebi[v]) {\\n if (col[x] != -1) {\\n assert(col[x] == 1 - c);\\n }\\n else {\\n dfscol(dfscol, x, 1 - c);\\n }\\n }\\n };\\n\\n for (int i = 0 ; i < N ; i++) {\\n if (col[i] == -1) {\\n dfscol(dfscol, i, 0);\\n }\\n }\\n\\n vector<int> zero(size), one(size);\\n for (int i = 0 ; i < N ; i++) {\\n if (col[i] == 0) {\\n zero[id[i]]++;\\n }\\n else {\\n one[id[i]]++;\\n }\\n }\\n \\n int ans = 0;\\n for (int i = 0 ; i < size ; i++) {\\n ans += min(zero[i], one[i]);\\n }\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.14545454545454545,\n \"time_ms\": 20,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -0.0387,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3168_7010638\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3168.cc: Capture Ebichan\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<queue>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 300;\\n\\n/* typedef */\\n\\ntypedef queue<int> qi;\\ntypedef vector<int> vi;\\ntypedef vector<bool> vb;\\n\\n/* global variables */\\n\\nint cs[MAX_N], ds[MAX_N], gids[MAX_N];\\nvi nbrs[MAX_N], gnbrs[MAX_N], enbrs[MAX_N];\\nbool used[MAX_N];\\n\\n/* subroutines */\\n\\nvoid bfs(int n, int k, int st) {\\n int c1 = (cs[st] + 25) % 26, c2 = (cs[st] + 1) % 26;\\n fill(ds, ds + n, -1);\\n ds[st] = 0;\\n\\n qi q;\\n q.push(st);\\n\\n while (! q.empty()) {\\n int u = q.front(); q.pop();\\n if (ds[u] >= k) continue;\\n\\n for (auto v: nbrs[u])\\n if (ds[v] < 0) {\\n\\tds[v] = ds[u] + 1;\\n\\tq.push(v);\\n\\n\\tif (ds[v] <= k && (cs[v] == c1 || cs[v] == c2))\\n\\t gnbrs[gids[st]].push_back(gids[v]);\\n }\\n }\\n}\\n\\nbool max_match_rec(const vi *nbrs, int u, vi &matches, vb &visited) {\\n if (u < 0) return true;\\n for (const int v: nbrs[u]) {\\n if (! visited[v]) {\\n visited[v] = true;\\n if (max_match_rec(nbrs, matches[v], matches, visited)) {\\n\\tmatches[u] = v;\\n\\tmatches[v] = u;\\n\\treturn true;\\n }\\n }\\n }\\n return false;\\n}\\n\\nint max_match(const int n, int l, const vi *nbrs, vi &matches) {\\n matches.assign(n, -1);\\n int count = 0;\\n \\n for (int u = 0; u < l; u++) {\\n vb visited(n, false);\\n if (max_match_rec(nbrs, u, matches, visited)) count++;\\n }\\n\\n return count;\\n}\\n\\n/* main */\\n\\nint main() {\\n int n, m, k;\\n scanf(\\\"%d%d%d\\\", &n, &m, &k);\\n\\n for (int i = 0; i < n; i++) {\\n char w[4];\\n scanf(\\\"%s\\\", w);\\n cs[i] = w[0] - 'a';\\n }\\n\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n scanf(\\\"%d%d\\\", &u, &v);\\n u--, v--;\\n nbrs[u].push_back(v);\\n nbrs[v].push_back(u);\\n }\\n\\n int l = 0;\\n for (int u = 0; u < n; u++)\\n if (! (cs[u] & 1)) l++;\\n\\n for (int u = 0, i = 0, j = 0; u < n; u++) {\\n if (! (cs[u] & 1)) gids[u] = i++;\\n else gids[u] = l + j++;\\n }\\n //for (int u = 0; u < n; u++) printf(\\\"%d \\\", gids[u]); putchar('\\\\n');\\n\\n for (int u = 0; u < n; u++) bfs(n, k, u);\\n\\n vi matches;\\n int mm = max_match(n, l, gnbrs, matches);\\n //printf(\\\"mm=%d\\\\n\\\", mm);\\n //for (int i = 0; i < l; i++) printf(\\\"%d->%d \\\", i, matches[i]);\\n //putchar('\\\\n');\\n\\n qi q;\\n for (int u = 0; u < l; u++) {\\n for (auto v: gnbrs[u]) {\\n if (matches[u] == v) enbrs[v].push_back(u);\\n else enbrs[u].push_back(v);\\n }\\n if (matches[u] < 0)\\n used[u] = true, q.push(u);\\n }\\n\\n while (! q.empty()) {\\n int u = q.front(); q.pop();\\n for (auto v: nbrs[u])\\n if (! used[v])\\n\\tused[v] = true, q.push(v);\\n }\\n\\n int cnt = 0;\\n for (int u = 0; u < l; u++)\\n if (! gnbrs[u].empty() && ! used[u]) cnt++;\\n for (int u = l; u < n; u++)\\n if (! gnbrs[u].empty() && used[u]) cnt++;\\n\\n printf(\\\"%d\\\\n\\\", cnt);\\n return 0;\\n}\",\n \"accuracy\": 0.14545454545454545,\n \"time_ms\": 10,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": 0,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3168_7010376\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3168.cc: Capture Ebichan\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<queue>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 300;\\n\\n/* typedef */\\n\\ntypedef queue<int> qi;\\ntypedef vector<int> vi;\\ntypedef vector<bool> vb;\\n\\n/* global variables */\\n\\nint cs[MAX_N], ds[MAX_N], gids[MAX_N];\\nvi nbrs[MAX_N], gnbrs[MAX_N], enbrs[MAX_N];\\nbool used[MAX_N];\\n\\n/* subroutines */\\n\\nvoid bfs(int n, int k, int st) {\\n int c1 = (cs[st] + 25) % 26, c2 = (cs[st] + 1) % 26;\\n fill(ds, ds + n, -1);\\n ds[st] = 0;\\n\\n qi q;\\n q.push(st);\\n\\n while (! q.empty()) {\\n int u = q.front(); q.pop();\\n if (ds[u] >= k) continue;\\n\\n for (auto v: nbrs[u])\\n if (ds[v] < 0) {\\n\\tds[v] = ds[u] + 1;\\n\\tq.push(v);\\n\\n\\tif (ds[v] <= k && (cs[v] == c1 || cs[v] == c2)) {\\n\\t gnbrs[gids[st]].push_back(gids[v]);\\n\\t gnbrs[gids[v]].push_back(gids[st]);\\n\\t}\\n }\\n }\\n}\\n\\nbool max_match_rec(const vi *nbrs, int u, vi &matches, vb &visited) {\\n if (u < 0) return true;\\n for (const int v: nbrs[u]) {\\n if (! visited[v]) {\\n visited[v] = true;\\n if (max_match_rec(nbrs, matches[v], matches, visited)) {\\n\\tmatches[u] = v;\\n\\tmatches[v] = u;\\n\\treturn true;\\n }\\n }\\n }\\n return false;\\n}\\n\\nint max_match(const int n, int l, const vi *nbrs, vi &matches) {\\n matches.assign(n, -1);\\n int count = 0;\\n \\n for (int u = 0; u < l; u++) {\\n vb visited(n, false);\\n if (max_match_rec(nbrs, u, matches, visited)) count++;\\n }\\n\\n return count;\\n}\\n\\n/* main */\\n\\nint main() {\\n int n, m, k;\\n scanf(\\\"%d%d%d\\\", &n, &m, &k);\\n\\n for (int i = 0; i < n; i++) {\\n char w[4];\\n scanf(\\\"%s\\\", w);\\n cs[i] = w[0] - 'a';\\n }\\n\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n scanf(\\\"%d%d\\\", &u, &v);\\n u--, v--;\\n nbrs[u].push_back(v);\\n nbrs[v].push_back(u);\\n }\\n\\n int l = 0;\\n for (int u = 0; u < n; u++)\\n if (! (cs[u] & 1)) l++;\\n\\n for (int u = 0, i = 0, j = 0; u < n; u++) {\\n if (! (cs[u] & 1)) gids[u] = i++;\\n else gids[u] = l + j++;\\n }\\n //for (int u = 0; u < n; u++) printf(\\\"%d \\\", gids[u]); putchar('\\\\n');\\n\\n for (int u = 0; u < n; u++) bfs(n, k, u);\\n\\n vi matches;\\n int mm = max_match(n, l, gnbrs, matches);\\n //printf(\\\"mm=%d\\\\n\\\", mm);\\n //for (int i = 0; i < l; i++) printf(\\\"%d->%d \\\", i, matches[i]);\\n //putchar('\\\\n');\\n\\n qi q;\\n for (int u = 0; u < l; u++) {\\n for (auto v: gnbrs[u]) {\\n if (matches[u] == v) enbrs[v].push_back(u);\\n else enbrs[u].push_back(v);\\n }\\n if (matches[u] < 0)\\n used[u] = true, q.push(u);\\n }\\n\\n while (! q.empty()) {\\n int u = q.front(); q.pop();\\n for (auto v: nbrs[u])\\n if (! used[v])\\n\\tused[v] = true, q.push(v);\\n }\\n\\n int cnt = 0;\\n for (int u = 0; u < l; u++)\\n if (! gnbrs[u].empty() && ! used[u]) cnt++;\\n for (int u = l; u < n; u++)\\n if (! gnbrs[u].empty() && used[u]) cnt++;\\n\\n printf(\\\"%d\\\\n\\\", cnt);\\n return 0;\\n}\",\n \"accuracy\": 0.14545454545454545,\n \"time_ms\": 10,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.042,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3168_6928630\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=9167167167167167167;\\nconst int INF=100000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (ll i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\nnamespace atcoder {\\n \\nnamespace internal {\\n \\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n \\n} // namespace internal\\n \\n} // namespace atcoder\\nnamespace atcoder {\\n \\ntemplate <class Cap> struct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(n) {}\\n \\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n g[from].push_back(_edge{to, int(g[to].size()), cap});\\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0});\\n return m;\\n }\\n \\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n \\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& _e = g[pos[i].first][pos[i].second];\\n auto& _re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n \\n Cap flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n \\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n \\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d =\\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) break;\\n }\\n return res;\\n };\\n \\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n while (flow < flow_limit) {\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n }\\n return flow;\\n }\\n \\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n \\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n \\n} // namespace atcoder\\nusing namespace atcoder;\\n\\nvoid Warshall_Floyd(std::vector<std::vector<int>> &G){\\n\\tint N=G.size();\\n\\tassert(N==(int)G[0].size());\\n\\tfor(int k=0;k<N;k++){\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tfor(int j=0;j<N;j++){\\n\\t\\t\\t\\tif(G[i][j]>G[i][k]+G[k][j]){\\n\\t\\t\\t\\t\\tG[i][j]=G[i][k]+G[k][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tint t=1;\\n\\t//cin>>t;\\n\\trep(i,t) solve();\\n}\\n\\nvoid solve(){\\n\\tint N,M,K;\\n\\tcin>>N>>M>>K;\\n\\tvector<char> p(N);\\n\\trep(i,N) cin>>p[i];\\n\\tvector<vector<int>> G(N,vector<int>(N,INF));\\n\\trep(i,N) G[i][i]=0;\\n\\trep(i,M){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\ta--,b--;\\n\\t\\tG[a][b]=1;\\n\\t\\tG[b][a]=1;\\n\\t}\\n\\tWarshall_Floyd(G);\\n\\tmf_graph<int> mfg(N+2);\\n\\trep(i,N){\\n\\t\\tif((p[i]-'a')%2){\\n\\t\\t\\tmfg.add_edge(i,N+1,1);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tmfg.add_edge(N,i,1);\\n\\t\\trep(j,N){\\n\\t\\t\\tif(G[i][j]<=K&&(abs(13-abs(p[i]-p[j]))==12)){\\n\\t\\t\\t\\tmfg.add_edge(i,j,1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans=mfg.flow(N,N+1);\\n\\tcout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4596,\n \"score_of_the_acc\": -0.3063,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3168_6928623\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=9167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (ll i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\nnamespace atcoder {\\n \\nnamespace internal {\\n \\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n \\n} // namespace internal\\n \\n} // namespace atcoder\\nnamespace atcoder {\\n \\ntemplate <class Cap> struct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(n) {}\\n \\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n g[from].push_back(_edge{to, int(g[to].size()), cap});\\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0});\\n return m;\\n }\\n \\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n \\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& _e = g[pos[i].first][pos[i].second];\\n auto& _re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n \\n Cap flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n \\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n \\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d =\\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) break;\\n }\\n return res;\\n };\\n \\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n while (flow < flow_limit) {\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n }\\n return flow;\\n }\\n \\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n \\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n \\n} // namespace atcoder\\nusing namespace atcoder;\\n\\nvoid Warshall_Floyd(std::vector<std::vector<int>> &G){\\n\\tint N=G.size();\\n\\tassert(N==(int)G[0].size());\\n\\tfor(int k=0;k<N;k++){\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tfor(int j=0;j<N;j++){\\n\\t\\t\\t\\tif(G[i][j]>G[i][k]+G[k][j]){\\n\\t\\t\\t\\t\\tG[i][j]=G[i][k]+G[k][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tint t=1;\\n\\t//cin>>t;\\n\\trep(i,t) solve();\\n}\\n\\nvoid solve(){\\n\\tint N,M,K;\\n\\tcin>>N>>M>>K;\\n\\tvector<char> p(N);\\n\\trep(i,N) cin>>p[i];\\n\\tvector<vector<int>> G(N,vector<int>(N,INF));\\n\\trep(i,N) G[i][i]=0;\\n\\trep(i,M){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\ta--,b--;\\n\\t\\tG[a][b]=1;\\n\\t\\tG[b][a]=1;\\n\\t}\\n\\tWarshall_Floyd(G);\\n\\tmf_graph<int> mfg(N+2);\\n\\trep(i,N){\\n\\t\\tif((p[i]-'a')%2){\\n\\t\\t\\tmfg.add_edge(i,N+1,1);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tmfg.add_edge(N,i,1);\\n\\t\\trep(j,N){\\n\\t\\t\\tif(G[i][j]<=K&&(abs(13-abs(p[i]-p[j]))==12)){\\n\\t\\t\\t\\tmfg.add_edge(i,j,1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans=mfg.flow(N,N+1);\\n\\tcout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.6909090909090909,\n \"time_ms\": 20,\n \"memory_kb\": 4624,\n \"score_of_the_acc\": -0.3137,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3168_6928618\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=9167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (ll i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\nnamespace atcoder {\\n \\nnamespace internal {\\n \\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n \\n} // namespace internal\\n \\n} // namespace atcoder\\nnamespace atcoder {\\n \\ntemplate <class Cap> struct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(n) {}\\n \\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n g[from].push_back(_edge{to, int(g[to].size()), cap});\\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0});\\n return m;\\n }\\n \\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n \\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& _e = g[pos[i].first][pos[i].second];\\n auto& _re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n \\n Cap flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n \\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n \\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d =\\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) break;\\n }\\n return res;\\n };\\n \\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n while (flow < flow_limit) {\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n }\\n return flow;\\n }\\n \\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n \\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n \\n} // namespace atcoder\\nusing namespace atcoder;\\n\\nvoid Warshall_Floyd(std::vector<std::vector<int>> &G){\\n\\tint N=G.size();\\n\\tassert(N==(int)G[0].size());\\n\\tfor(int k=0;k<N;k++){\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tfor(int j=0;j<N;j++){\\n\\t\\t\\t\\tif(G[i][j]>G[i][k]+G[k][j]){\\n\\t\\t\\t\\t\\tG[i][j]=G[i][k]+G[k][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tint t=1;\\n\\t//cin>>t;\\n\\trep(i,t) solve();\\n}\\n\\nvoid solve(){\\n\\tint N,M,K;\\n\\tcin>>N>>M>>K;\\n\\tvector<char> p(N);\\n\\trep(i,N) cin>>p[i];\\n\\tvector<vector<int>> G(N,vector<int>(N,INF));\\n\\trep(i,N) G[i][i]=0;\\n\\trep(i,M){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\ta--,b--;\\n\\t\\tG[a][b]=1;\\n\\t\\tG[b][a]=0;\\n\\t}\\n\\tWarshall_Floyd(G);\\n\\tmf_graph<int> mfg(N+2);\\n\\trep(i,N){\\n\\t\\tif((p[i]-'a')%2){\\n\\t\\t\\tmfg.add_edge(i,N+1,1);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tmfg.add_edge(N,i,1);\\n\\t\\trep(j,N){\\n\\t\\t\\tif(G[i][j]<=K&&(abs(13-abs(p[i]-p[j]))==12)){\\n\\t\\t\\t\\tmfg.add_edge(i,j,1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans=mfg.flow(N,N+1);\\n\\tcout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.6909090909090909,\n \"time_ms\": 20,\n \"memory_kb\": 4600,\n \"score_of_the_acc\": -0.3074,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3168_5067410\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\nnamespace CharacterClass {\\n\\tconstexpr string_view\\n\\t digit = \\\"0123456789\\\",\\n\\t xdigit = \\\"0123456789ABCDEFabcdef\\\", lower = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n\\t upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n\\t alpha = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t alnum = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t word = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\\\",\\n\\t punct = R\\\"(!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~)\\\",\\n\\t graph =\\n\\t R\\\"(!\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t print =\\n\\t R\\\"( !\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t blank = \\\" \\\\t\\\", space = \\\" \\\\t\\\\n\\\\r\\\\f\\\\v\\\";\\n} // namespace CharacterClass\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Printer {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid print(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(bool v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(vector<bool>::reference v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid print(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid print(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid print(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void print(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\\n\\t\\tprint(v.first);\\n\\t\\tprint(D.d);\\n\\t\\tprint(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) print(D.d);\\n\\t\\t\\tprint(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void print(const vector<T>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void print(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) print(D.l);\\n\\t\\t\\tprint(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tPrinter() = default;\\n\\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tPrinter& operator()() {\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Printer& operator()(H&& h) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tprint_range(begin, end);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Printer& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tPrinter& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 7 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T = long long> constexpr T TEN(size_t n) {\\n\\tT result = 1;\\n\\tfor (size_t i = 0; i < n; ++i) result *= 10;\\n\\treturn result;\\n}\\ntemplate <class T, class U,\\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr auto div_ceil(T n, U m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> constexpr T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> constexpr T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T, class U, class V>\\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\\n\\treturn lower <= v && v < upper;\\n}\\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\\nconstexpr bool is_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> constexpr T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T> constexpr int BIT(T x, int i) {\\n\\treturn (x & (1 << i)) ? 1 : 0;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Pow(T a, U n) {\\n\\tassert(n >= 0);\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Powmod(T a, U n, T mod) {\\n\\tassert(n >= 0);\\n\\tif (a > mod) a %= mod;\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 4 \\\"/home/yuruhiya/programming/library/Graph/ShortestPath.cpp\\\"\\n#include <optional>\\n#line 6 \\\"/home/yuruhiya/programming/library/Graph/ShortestPath.cpp\\\"\\nusing namespace std;\\n\\nvector<int> ShortestPath(const vector<vector<int>>& graph, int s,\\n int inf = numeric_limits<int>::max()) {\\n\\tint V = graph.size();\\n\\tvector<int> dist(V, inf);\\n\\tdist[s] = 0;\\n\\tqueue<int> que;\\n\\tque.push(s);\\n\\twhile (!que.empty()) {\\n\\t\\tint f = que.front();\\n\\t\\tque.pop();\\n\\t\\tfor (auto e : graph[f]) {\\n\\t\\t\\tif (dist[e] == inf) {\\n\\t\\t\\t\\tque.push(e);\\n\\t\\t\\t\\tdist[e] = dist[f] + 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dist;\\n}\\nint ShortestPathST(const vector<vector<int>>& graph, int s, int t,\\n int inf = numeric_limits<int>::max()) {\\n\\tsize_t n = graph.size();\\n\\tvector<int> dist(n, inf);\\n\\tdist[s] = 0;\\n\\tqueue<int> que;\\n\\tque.push(s);\\n\\twhile (!que.empty()) {\\n\\t\\tint v = que.front();\\n\\t\\tif (v == t) return dist[t];\\n\\t\\tque.pop();\\n\\t\\tfor (auto u : graph[v]) {\\n\\t\\t\\tif (dist[u] == inf) {\\n\\t\\t\\t\\tque.push(u);\\n\\t\\t\\t\\tdist[u] = dist[v] + 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dist[t];\\n}\\n#line 6 \\\"/home/yuruhiya/programming/library/Graph/BipartiteMatching.cpp\\\"\\nusing namespace std;\\n\\nclass BipartiteMatching {\\n\\tsize_t left, right;\\n\\tvector<vector<int>> graph;\\n\\tvector<bool> used;\\n\\tvector<int> left_match, right_match;\\n\\tbool dfs(int v) {\\n\\t\\tif (used[v]) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tused[v] = true;\\n\\t\\tfor (int u : graph[v]) {\\n\\t\\t\\tif (right_match[u] == -1 || dfs(right_match[u])) {\\n\\t\\t\\t\\tleft_match[v] = u;\\n\\t\\t\\t\\tright_match[u] = v;\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n\\npublic:\\n\\tBipartiteMatching(size_t _left, size_t _right)\\n\\t : left(_left),\\n\\t right(_right),\\n\\t graph(left),\\n\\t used(left),\\n\\t left_match(left),\\n\\t right_match(right) {}\\n\\tBipartiteMatching(size_t _left, size_t _right, const vector<vector<int>>& _graph)\\n\\t : left(_left),\\n\\t right(_right),\\n\\t graph(_graph),\\n\\t used(left),\\n\\t left_match(left),\\n\\t right_match(right) {\\n\\t\\tassert(graph.size() == left);\\n\\t}\\n\\tvoid add_edge(int l, int r) {\\n\\t\\tgraph[l].push_back(r);\\n\\t}\\n\\tint solve() {\\n\\t\\tint result = 0;\\n\\t\\tfill(left_match.begin(), left_match.end(), -1);\\n\\t\\tfill(right_match.begin(), right_match.end(), -1);\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\tfor (bool update = true; update;) {\\n\\t\\t\\tupdate = false;\\n\\t\\t\\tfor (size_t i = 0; i < left; ++i) {\\n\\t\\t\\t\\tif (left_match[i] == -1 && dfs(i)) {\\n\\t\\t\\t\\t\\tupdate = true;\\n\\t\\t\\t\\t\\t++result;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (update) {\\n\\t\\t\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\tvector<pair<int, int>> edges() const {\\n\\t\\tvector<pair<int, int>> result;\\n\\t\\tfor (size_t i = 0; i < left; ++i) {\\n\\t\\t\\tif (left_match[i] != -1) {\\n\\t\\t\\t\\tresult.emplace_back(i, left_match[i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n};\\n#line 4 \\\"a.cpp\\\"\\n\\nint main() {\\n\\tini(n, m, k);\\n\\tVI c = step(n) | Map([&](int i) { return in.read<char>() - 'a'; });\\n\\tdump(c);\\n\\tVVI g(n);\\n\\trep(i, m) {\\n\\t\\tint u = in--, v = in--;\\n\\t\\tg[u].push_back(v);\\n\\t\\tg[v].push_back(u);\\n\\t}\\n\\tVVI d = step(n) | Map([&](int i) { return ShortestPath(g, i, inf); });\\n\\n\\tBipartiteMatching bg(n, n);\\n\\trep(i, n) FOR(j, i + 1, n) {\\n\\t\\tif (d[i][j] <= k && ((c[i] + 1) % 26 == c[j] || (c[j] + 1) % 26 == c[i])) {\\n\\t\\t\\tint a = i, b = j;\\n\\t\\t\\tif (c[a] % 2 == 1) swap(a, b);\\n\\t\\t\\tbg.add_edge(a, b);\\n\\t\\t}\\n\\t}\\n\\tout(bg.solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4492,\n \"score_of_the_acc\": -0.279,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1987,"cells":{"group_id":{"kind":"string","value":"aoj_3175_cpp"},"problem_description":{"kind":"string","value":"D - Parallel Sort\n問題文\nこれはインタラクティブな問題です。\n$1$ 以上 $2^N$ 以下の整数を並び替えた順列 $P$ が隠されています。\nあなたは以下の操作を $60$ 回だけ行うことができます。\n操作によって $P$ を特定してください。\n操作\n長さ $2^N$ の整数列 $A$ を宣言する。\n$A$ の要素は $1$ 以上 $2^N$ 以下の整数でなければならない。\n長さ $2^N$ の整数列 $C$ が用意される。\n$C$ の要素ははじめすべて $0$ である。\n各 $i$ $(1 \\le i \\le 2^N)$ について、次が行われる。\n$P_{A_i} > P_i$ のとき、$C_{A_i}$ に $1$ を足す。\nそうでなければ何もしない。\nその後、$C$ の内容があなたに伝えられる。\n制約\n$1 \\leq N \\leq 10$\n$N$ は整数である。\n$P$ は $1$ 以上 $2^N$ 以下の整数を並び替えた順列である。\n入出力\n最初に、$N$ が標準入力から与えられる。\n$N$\nその後、何回か操作を繰り返す。操作では次の形式で標準出力へ出力せよ。\n? $A_1$ $A_2$ $\\ldots$ $A_{2^N}$\nここで、$A_i$ $(1 \\le i \\le 2^N)$ は $1$ 以上 $2^N$ 以下の整数でなければならない。\nこの操作に対する応答は、次の形式で標準入力から与えられる。\n$C_1$ $C_2$ $\\ldots$ $C_{2^N}$\n最後に、特定した順列 $P$ を以下の形式で標準出力へ出力せよ。\n! $P_1$ $P_2$ $\\ldots$ $P_{2^N}$\n注意\n出力の度に標準出力を\nflush\nせよ。そうしない場合、\nTLE\nとなる可能性がある。\n順列 $P$ を出力した後は、プログラムをすぐに終了せよ。従わない場合のジャッジの挙動は未定義である。\n出力形式が正しくない場合のジャッジの挙動は未定義である。\n入出力例\n$N = 2, P = (4, 1, 3, 2)$ としたときの入出力例を以下に示す。\n入力\n出力\n備考\n2\n最初に $N$ が入力される。\n? 4 4 1 1\n2 0 0 1\n$P_4 > P_2$ だから、$C_4$ に $1$ が足される。\n$P_1 > P_3$ だから、$C_1$ に $1$ が足される。\n$P_1 > P_4$ だから、$C_1$ に $1$ が足される。\n? 1 3 3 3\n0 0 2 0\n$P_3 > P_2$ だから、$C_3$ に $1$ が足される。\n$P_3 > P_4$ だから、$C_3$ に $1$ が足される。\n! 4 1 3 2\n最後に順列 $P$ を出力する。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3175_4850876","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acos(-1.0);\n\n\nvector<int> query(vector<int> a) {\n\tcout << \"?\";\n\trep(i, a.size()) {\n\t cout << \" \";\n\t\tcout << a[i]+1;\n\t}\n\tcout << endl;\n\tvector<int> res(a.size());\n\trep(i, a.size())cin >> res[i];\n\treturn res;\n}\nvoid solve() {\n\tint n; cin >> n;\n\tvector<vector<int>> v;\n\trep(i, (1<<n)) {\n\t\tv.push_back({ i });\n\t}\n\tint tmp = 0;\n\twhile (v.size() > 1) {\n\t\ttmp++;\n\t\tvector<vector<int>> ups;\n\t\tvector<vector<vector<int>>> vs;\n\t\tvector<vector<vector<int>>> ts;\n\t\tvector<vector<int>> locs;\n\t\tlocs.resize(v.size() / 2);\n\t\trep(j, locs.size()) {\n\t\t\tlocs[j].resize(v[0].size());\n\t\t}\n\t\trep(i, v.size() / 2) {\n\t\t\tups.push_back({ -1 });\n\t\t\tvs.push_back({ v[2 * i] });\n\t\t\tts.push_back({ v[2 * i + 1] });\n\t\t}\n\t\tvector<bool> ist(1 << n);\n\t\tfor (int i = 1; i < v.size(); i += 2) {\n\t\t\tfor (int id : v[i]) {\n\t\t\t\tist[id] = true;\n\t\t\t}\n\t\t}\n\t\trep(aa, tmp) {\n\t\t\tvector<int> q(1 << n);\n\t\t\trep(i, (1 << n))if (ist[i])q[i] = i;\n\t\t\trep(i, v.size() / 2) {\n\t\t\t\trep(j, vs[i].size()) {\n\t\t\t\t\tif (ts[i][j].empty()) {\n\t\t\t\t\t\tfor (int id : vs[i][j]) {\n\t\t\t\t\t\t\tq[id] = ups[i][j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tint mid = ts[i][j].size() / 2;\n\t\t\t\t\t\tfor (int id : vs[i][j]) {\n\t\t\t\t\t\t\tq[id] = ts[i][j][mid];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tvector<int> c = query(q);\n\t\t\tvector<vector<int>> nup(v.size() / 2);\n\t\t\trep(i, v.size() / 2) {\n\t\t\t\tint s = 0;\n\t\t\t\tint t = 0;\n\n\t\t\t\tvector<vector<int>> nv;\n\t\t\t\tvector<vector<int>> nt;\n\t\t\t\trep(j, vs[i].size()) {\n\t\t\t\t\tif (ts[i][j].empty()) {\n\t\t\t\t\t\tnv.push_back(vs[i][j]);\n\t\t\t\t\t\tnt.push_back(ts[i][j]);\n\t\t\t\t\t\tnup[i].push_back(ups[i][j]);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tint mid = ts[i][j].size() / 2;\n\t\t\t\t\t\tint num = ts[i][j][mid];\n\t\t\t\t\t\tlocs[i][t + mid] = s + c[num];\n\t\t\t\t\t\tvector<int> vl;\n\t\t\t\t\t\tvector<int> vr;\n\t\t\t\t\t\trep(k, vs[i][j].size()) {\n\t\t\t\t\t\t\tif (k < c[num]) {\n\t\t\t\t\t\t\t\tvl.push_back(vs[i][j][k]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse vr.push_back(vs[i][j][k]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tvector<int> tl, tr;\n\t\t\t\t\t\trep(k, ts[i][j].size()) {\n\t\t\t\t\t\t\tif (k < mid)tl.push_back(ts[i][j][k]);\n\t\t\t\t\t\t\telse if (k > mid)tr.push_back(ts[i][j][k]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tnv.push_back(vl); nv.push_back(vr);\n\t\t\t\t\t\tnt.push_back(tl); nt.push_back(tr);\n\t\t\t\t\t\tnup[i].push_back(num);\n\t\t\t\t\t\tnup[i].push_back(num);\n\t\t\t\t\t}\n\n\t\t\t\t\ts += vs[i][j].size();\n\t\t\t\t\tt += ts[i][j].size();\n\t\t\t\t\tif (ups[i][j] >= 0)t++;\n\t\t\t\t}\n\t\t\t\tswap(vs[i], nv);\n\t\t\t\tswap(ts[i], nt);\n\t\t\t}\n\t\t\tswap(ups, nup);\n\t\t}\n\t\tvector<vector<int>> nv;\n\t\trep(i, v.size() / 2) {\n\t\t\tint id = 0;\n\t\t\tvector<int> cv;\n\t\t\trep(j, v[2 * i].size()) {\n\t\t\t\twhile (id < v[2 * i + 1].size() && locs[i][id] <= j) {\n\t\t\t\t\tcv.push_back(v[2 * i + 1][id]);\n\t\t\t\t\tid++;\n\t\t\t\t}\n\t\t\t\tcv.push_back(v[2 * i][j]);\n\t\t\t}\n\t\t\twhile (id < v[2 * i + 1].size()) {\n\t\t\t\tcv.push_back(v[2 * i + 1][id]);\n\t\t\t\tid++;\n\t\t\t}\n\t\t\tnv.push_back(cv);\n\t\t}\n\t\tswap(v, nv);\n\t\t/*rep(i, v.size()) {\n\t\t\trep(j, v[i].size()) {\n\t\t\t\tcout << v[i][j] << \" \";\n\t\t\t}\n\t\t\tcout << \"\\n\";\n\t\t}*/\n\t}\n\t//cout << \"?? \" << v[0].size() << \"\\n\";\n\tvector<int> ans(1<<n);\n\trep(i, (1 << n)) {\n\t\tans[v[0][i]] = i;\n\t}\n\tcout << \"!\";\n\trep(i, (1 << n)) {\n\t\tcout << \" \" << ans[i] + 1;\n\t}\n\tcout << endl;\n}\n\n\n\n\n\nsigned main() {\n\t//ios::sync_with_stdio(false);\n\t//cin.tie(0);\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3436,"score_of_the_acc":-1.0256,"final_rank":10},{"submission_id":"aoj_3175_4846649","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> l_l;\ntypedef pair<int, int> i_i;\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nconst long long INF = 1e18;\n//const ll mod = 1000000007;\n\nconst ll LOCAL = 0;\nll N;\nll C[3000];\nll A[3000];\nvector<ll> ANS;\nvector<vector<ll>> v;\nvector<ll> ans;\nint Timer = 0;\n\nvoid printans() {\n assert(v.size() == 1);\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n if(v[0][j] == i) ans.push_back(j);\n }\n }\n cout << \"!\";\n for(auto tmp : ans) {\n cout << \" \" << tmp + 1;\n }\n cout << endl;\n if(LOCAL) {\n for(int i = 0; i < N; i++) {\n cerr << ANS[v[0][i]] << \" \";\n }\n cerr << endl;\n for(int i = 0; i < N; i++) {\n assert(ANS[v[0][i]] == i);\n assert(ans[i] == ANS[i]);\n }\n }\n}\n\nvoid ask() {\n if(LOCAL) {\n Timer++;\n assert(Timer <= 60);\n for(int i = 0; i < N; i++) C[i] = 0;\n for(int i = 0; i < N; i++) {\n if(ANS[A[i]] > ANS[i]) C[A[i]]++;\n }\n } else {\n cout << \"?\";\n for(int i = 0; i < N; i++) {\n cout << \" \" << A[i] + 1;\n }\n cout << endl;\n for(int i = 0; i < N; i++) {\n cin >> C[i];\n }\n }\n}\n\ntypedef pair<vector<ll>, vector<ll>> V_V;\nint needed = 0;\n\nvector<ll> g(V_V V, vector<ll> ok) {\n vector<ll> ret;\n l_l idx = {0, 0};\n while(idx.first != V.first.size() or idx.second != V.second.size()) {\n if(idx.first == V.first.size()) {\n ret.push_back(V.second[idx.second]);\n idx.second++;\n continue;\n }\n if(idx.second == V.second.size()) {\n ret.push_back(V.first[idx.first]);\n idx.first++;\n continue;\n }\n if(ok[idx.first] <= idx.second) {\n ret.push_back(V.first[idx.first]);\n idx.first++;\n continue;\n }\n if(ok[idx.first] > idx.second) {\n ret.push_back(V.second[idx.second]);\n idx.second++;\n continue;\n }\n assert(0);\n }\n return ret;\n}\n\nvector<vector<ll>> f(vector<V_V> V) {\n /*\n for(auto tmp : V) {\n for(auto tmp2 : tmp.first) cerr << ANS[tmp2] << \" \";\n cerr << endl;\n for(auto tmp2 : tmp.second) cerr << ANS[tmp2] << \" \";\n cerr << endl;\n cerr << endl;\n }\n */\n vector<vector<ll>> ok, ng;\n ok.resize(V.size(), vector<ll>(V[0].first.size(), 0));\n ng.resize(V.size(), vector<ll>(V[0].first.size(), V[0].first.size() + 1));\n needed++;\n for(int _ = 0; _ < needed; _++) {\n vector<vector<ll>> mid;\n mid.resize(V.size());\n for(int i = 0; i < mid.size(); i++) {\n mid[i].resize(V[0].first.size());\n for(int j = 0; j < mid[i].size(); j++) {\n mid[i][j] = (ok[i][j] + ng[i][j]) / 2;\n chmax(mid[i][j], 1LL);\n A[V[i].first[j]] = V[i].second[mid[i][j]-1];\n }\n }\n for(int i = 0; i < mid.size(); i++) {\n for(int j = 0; j < mid[i].size(); j++) {\n A[V[i].second[j]] = V[i].second[j];\n }\n }\n ask();\n for(int i = 0; i < mid.size(); i++) {\n for(int j = 0; j < mid[i].size(); j++) {\n if(C[A[V[i].first[j]]]) {\n C[A[V[i].first[j]]]--;\n ng[i][j] = mid[i][j];\n } else {\n ok[i][j] = mid[i][j];\n }\n }\n }\n /*\n cerr << \"midsize: \" << mid.size() << endl;\n for(int i = 0; i < mid.size(); i++) {\n for(int j = 0; j < mid[i].size(); j++) {\n cerr << \"{\" << ok[i][j] << \", \" << ng[i][j] << \"} \";\n }\n cerr << endl;\n }\n */\n }\n vector<vector<ll>> ret;\n for(int i = 0; i < V.size(); i++) {\n auto tmp = g(V[i], ok[i]);\n ret.push_back(tmp);\n }\n return ret;\n}\n\nint main() {\n cin >> N;\n N = (1 << N);\n if(LOCAL) {\n ANS.resize(N);\n for(int i = 0; i < N; i++) {\n ANS[i] = i;\n }\n std::random_device seed_gen;\n std::mt19937 engine(seed_gen());\n std::shuffle(ANS.begin(), ANS.end(), engine);\n /*\n for(auto tmp : ANS) cerr << tmp << \" \";\n cerr << endl;\n */\n }\n for(int i = 0; i < N; i++) {\n v.push_back({i});\n }\n for(int _ = 0; ; _++) {\n if(v.size() == 1) break;\n vector<pair<vector<ll>, vector<ll>>> V;\n for(int i = 0; i < v.size(); i += 2) {\n V.push_back({v[i], v[i+1]});\n }\n v = f(V);\n }\n printans();\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3724,"score_of_the_acc":-0.5056,"final_rank":9},{"submission_id":"aoj_3175_4846518","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int_fast32_t int32;\ntypedef int_fast64_t int64;\n\nconst int32 inf = 1e9+7;\nconst int32 MOD = 1000000007;\nconst int64 llinf = 1e18;\n\n#define YES(n) cout << ((n) ? \"YES\\n\" : \"NO\\n\" )\n#define Yes(n) cout << ((n) ? \"Yes\\n\" : \"No\\n\" )\n#define POSSIBLE(n) cout << ((n) ? \"POSSIBLE\\n\" : \"IMPOSSIBLE\\n\" )\n#define ANS(n) cout << (n) << \"\\n\"\n#define REP(i,n) for(int64 i=0;i<(n);++i)\n#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)\n#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)\n#define all(obj) (obj).begin(),(obj).end()\n#define rall(obj) (obj).rbegin(),(obj).rend()\n#define fi first\n#define se second\n#define pb(a) push_back(a)\ntypedef pair<int32,int32> pii;\ntypedef pair<int64,int64> pll;\n\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) { a = b; return true; } return false;\n}\n\nint32 n;\nvector<int32> a;\nvector<int32> c;\nvector<set<int32>> large;\nvector<int32> indeg;\n\nvector<int32> topological_sort(vector<set<int32>> G, vector<int32> indegree, int32 V) {\n // トポロジカルソートを記録する配列\n vector<int32> sorted_vertices;\n\n // 入次数が0の頂点を発見したら、処理待ち頂点としてキューに追加する\n queue<int> que;\n for (int i = 0; i < V; i++) {\n if (indegree[i] == 0) {\n que.push(i);\n }\n }\n\n // キューが空になるまで、操作1~3を繰り返す\n while (que.empty() == false) {\n // キューの先頭の頂点を取り出す\n int v = que.front();\n que.pop();\n\n // その頂点と隣接している頂点の入次数を減らし、0になればキューに追加\n for(auto u : G[v]){\n indegree[u] -= 1;\n if (indegree[u] == 0) que.push(u);\n }\n // 頂点vを配列の末尾に追加する \n sorted_vertices.push_back(v);\n }\n\n // トポロジカルソートを返す\n return sorted_vertices;\n}\n\nvoid query(){\n cout << \"?\";\n REP(i,n){\n cout << \" \" << a[i]+1;\n }\n cout << endl;\n REP(i,n)cin >> c[i];\n REP(i,n){\n if(i == a[i])continue;\n if(c[a[i]] == 1){\n if(large[i].count(a[i]) == 0){\n large[i].insert(a[i]);\n indeg[a[i]]++;\n }\n }else{\n if(large[a[i]].count(i) == 0){\n large[a[i]].insert(i);\n indeg[i]++;\n }\n }\n }\n}\n\nint32 pow2(int32 r){\n int32 ret = 1;\n REP(i,r)ret *= 2;\n return ret;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n cin >> n;\n n = pow2(n);\n a.resize(n);\n c.resize(n);\n large.resize(n);\n indeg.resize(n,0);\n REP(i,n)a[i] = (i+1)%n;\n while(true){\n query();\n vector<pii> notyet;\n vector<int32> topo = topological_sort(large,indeg,n);\n REP(i,n-1){\n if(large[topo[i]].count(topo[i+1]) == 0)notyet.emplace_back(topo[i],topo[i+1]);\n }\n // REP(v,n){\n // for(auto u : large[v])cout << v << \" \" << u << endl;\n // }\n // REP(i,n)ANS(indeg[i]);\n // REP(i,n)cout << \" \" << topo[i];\n // cout << endl;\n if(notyet.empty()){\n vector<int32> ans(n);\n REP(i,n){\n ans[topo[i]] = i;\n }\n cout << \"!\";\n REP(i,n)cout << \" \" << ans[i] + 1;\n cout << endl;\n return 0;\n }\n a = vector<int32>(n,-1);\n vector<bool> used(n,false);\n for(auto p : notyet){\n if(a[p.fi] == -1 && !used[p.se]){\n a[p.fi] = p.se;\n used[p.se] = true;\n }else if(a[p.se] == -1 && !used[p.fi]){\n a[p.se] = p.fi;\n used[p.fi] = true;\n }\n }\n int32 j = 0;\n REP(i,n){\n if(a[i] == -1){\n while(used[j])++j;\n a[i] = j;\n ++j;\n }\n }\n }\n return 0;\n}","accuracy":0.3191489361702128,"time_ms":40,"memory_kb":4656,"score_of_the_acc":-1,"final_rank":12},{"submission_id":"aoj_3175_4845964","code_snippet":"//#define NDEBUG\n\n#pragma region cp_template\n\n#include <algorithm>\n#include <cstddef>\n#include <cstdint>\n#include <iostream>\n#include <utility>\n#include <vector>\n\nnamespace n91 {\n\n using i32 = std::int32_t;\n using i64 = std::int64_t;\n using u32 = std::uint32_t;\n using u64 = std::uint64_t;\n using isize = std::ptrdiff_t;\n using usize = std::size_t;\n\n struct rep {\n struct itr {\n usize i;\n constexpr itr(const usize i) noexcept : i(i) {}\n void operator++() noexcept { ++i; }\n constexpr usize operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\n };\n const itr f, l;\n constexpr rep(const usize f, const usize l) noexcept\n : f(std::min(f, l)), l(l) {}\n constexpr auto begin() const noexcept { return f; }\n constexpr auto end() const noexcept { return l; }\n };\n struct revrep {\n struct itr {\n usize i;\n constexpr itr(const usize i) noexcept : i(i) {}\n void operator++() noexcept { --i; }\n constexpr usize operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\n };\n const itr f, l;\n constexpr revrep(const usize f, const usize l) noexcept\n : f(l - 1), l(std::min(f, l) - 1) {}\n constexpr auto begin() const noexcept { return f; }\n constexpr auto end() const noexcept { return l; }\n };\n template <class T> auto md_vec(const usize n, const T& value) {\n return std::vector<T>(n, value);\n }\n template <class... Args> auto md_vec(const usize n, Args... args) {\n return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));\n }\n template <class T> constexpr T difference(const T& a, const T& b) noexcept {\n return a < b ? b - a : a - b;\n }\n template <class T> void chmin(T& a, const T& b) noexcept {\n if (b < a)\n a = b;\n }\n template <class T> void chmax(T& a, const T& b) noexcept {\n if (a < b)\n a = b;\n }\n template <class F> class rec_lambda {\n F f;\n\n public:\n rec_lambda(F&& f) : f(std::move(f)) {}\n template <class... Args> auto operator()(Args&&... args) const {\n return f(*this, std::forward<Args>(args)...);\n }\n };\n template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }\n template <class T> T scan() {\n T ret;\n std::cin >> ret;\n return ret;\n }\n constexpr char eoln = '\\n';\n template <class T> T ceildiv(const T& l, const T& r) {\n return l / r + (l % r != 0 ? 1 : 0);\n }\n\n} // namespace n91\n\n#pragma endregion cp_template\n\nnamespace n91 {\n\n struct sorter {\n usize n;\n std::vector<usize> x;\n // x[i]: 今 i 番目の要素が p の何番目か\n std::vector<std::pair<usize, usize>> cp;\n // first < second になるように cas\n\n sorter(const usize m) : n(1 << m), x(n), cp() {\n for (const usize i : rep(0, n)) {\n x[i] = i;\n }\n }\n\n void cas(usize less, usize greater) { cp.push_back({ less, greater }); }\n void flush() {\n std::vector<usize> a(n);\n for (const auto& e : cp) {\n a[x[e.second]] = x[e.first];\n a[x[e.first]] = x[e.second];\n }\n std::cout << \"?\";\n for (auto e : a) {\n std::cout << \" \" << e + 1;\n }\n std::cout << std::endl;\n std::vector<usize> c(n);\n for (auto& e : c) {\n std::cin >> e;\n }\n for (const auto& e : cp) {\n if (c[x[e.first]] == 1) {\n std::swap(x[e.first], x[e.second]);\n }\n }\n cp.clear();\n }\n void print() {\n std::vector<usize> p(n);\n for (const usize i : rep(0, n)) {\n p[x[i]] = i;\n }\n std::cout << \"!\";\n for (auto e : p) {\n std::cout << \" \" << e + 1;\n }\n std::cout << std::endl;\n }\n };\n\n void main_() {\n /*\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n //*/\n const usize n = scan<usize>();\n sorter s(n);\n for (const usize i : rep(0, n)) {\n const usize swap_wi = 2 << i;\n for (const usize j : rep(0, i + 1)) {\n bool swap_f = true;\n const usize step = 1 << (i - j);\n for (const usize k : rep(0, 1 << n)) {\n if (k % swap_wi == 0) {\n swap_f = !swap_f;\n }\n if (k & step) {\n usize l = k & ~step;\n usize r = k;\n if (swap_f) {\n std::swap(l, r);\n }\n s.cas(l, r);\n }\n }\n s.flush();\n }\n }\n s.print();\n }\n\n} // namespace n91\n\nint main() {\n n91::main_();\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3640,"score_of_the_acc":-0.4385,"final_rank":5},{"submission_id":"aoj_3175_4845701","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstring>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iomanip>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n#include <cstdint>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\n#define MP make_pair\n#define PB push_back\n#define inf 1000000007\n#define rep(i,n) for(int i = 0; i < (int)(n); ++i)\n#define all(x) (x).begin(),(x).end()\n\ntemplate<typename A, size_t N, typename T>\nvoid Fill(A (&array)[N], const T &val){\n std::fill( (T*)array, (T*)(array+N), val );\n}\n \ntemplate<class T> inline bool chmax(T &a, T b){\n if(a<b){\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T> inline bool chmin(T &a, T b){\n if(a>b){\n a = b;\n return true;\n }\n return false;\n}\nint n;\nvector<int> question(vector<int> &a){\n cout << \"? \";\n rep(i,n){\n cout << a[i+1] << \" \";\n }\n cout << endl;\n vector<int> b(n+1);\n rep(i,n){\n cin >> b[i+1];\n }\n return b;\n}\nvoid answer(vector<int> &a){\n cout << \"! \";\n rep(i,n){\n cout << a[i+1] << \" \";\n }\n cout << endl;\n}\nint main(){\n int m;\n cin >> m;\n n = (1<<m);\n vector<int> p(n);\n vector<vector<int> > q;\n rep(i,n){\n p[i] = i+1;\n vector<int> t;\n t.push_back(i+1);\n q.push_back(t);\n }\n \n for(int zz=1;zz<=m;zz++){ \n vector<vector<int> > A;\n vector<vector<int> > B;\n for(int i=0;i<q.size();i+=2){\n A.push_back(q[i]);\n B.push_back(q[i+1]);\n }\n // cerr << A.size() << endl;\n // for(auto x:A){\n // for(auto y:x){\n // cerr << y << \" \" ;\n // }\n // cerr << endl;\n // }\n // cerr << endl;\n // cerr << B.size() << endl;\n // for(auto x:B){\n // for(auto y:x){\n // cerr << y << \" \" ;\n // }\n // cerr << endl;\n // }\n // cerr << endl;\n for(int j=0;j<zz;j++){\n vector<int> q(n+1);\n // sort列 A, B の比較\n \n for(int i=0;i<A.size();i++){\n int len = B[i].size();\n int Qid = B[i][len/2];\n for(auto x: A[i]){\n q[x] = Qid;\n }\n\n }\n for(int i=0;i<B.size();i++){\n for(auto x:B[i]){\n q[x] = x;\n }\n }\n auto X = question(q);\n \n vector<vector<int> > P;\n vector<vector<int> > Q;\n \n for(int i=0;i<A.size();i++){\n int len = B[i].size();\n int Qid = B[i][len/2];\n int cnt = X[Qid];\n vector<int> pp[2];\n for(int k = 0; k<A[i].size();k++){\n if(k < cnt){\n pp[0].push_back(A[i][k]);\n }else{\n pp[1].push_back(A[i][k]);\n }\n }\n vector<int> qq[2];\n for(int k=0;k<B[i].size();k++){\n if(k<len/2||len==1){\n qq[0].push_back(B[i][k]);\n }else{\n qq[1].push_back(B[i][k]);\n }\n }\n P.push_back(pp[0]);\n P.push_back(pp[1]); \n Q.push_back(qq[0]);\n Q.push_back(qq[1]);\n } \n swap(A,P);\n swap(B,Q);\n } \n // cerr << \"TEST\" << endl;\n // cerr << A.size() << endl;\n // for(auto x:A){\n // for(auto y:x){\n // cerr << y << \" \" ;\n // }\n // cerr << endl;\n // }\n // cerr << endl;\n // cerr << B.size() << endl;\n // for(auto x:B){\n // for(auto y:x){\n // cerr << y << \" \" ;\n // }\n // cerr << endl;\n // }\n // cerr << endl;\n \n vector<vector<int> > qqq;\n for(int k=0;k<(n)/(1<<zz);k++){\n vector<int> qq;\n for(int i=0;i<(1<<(zz));i++){\n // i + k*(1<<zz) \n for(auto x:A[i + k*(1<<(zz))]){\n qq.push_back(x);\n }\n for(auto x:B[i + k*(1<<(zz))]){\n qq.push_back(x);\n }\n }\n qqq.push_back(qq);\n }\n swap(q,qqq);\n }\n vector<int> pppp(n+1);\n for(int i=0;i<q[0].size();i++){\n pppp[q[0][i]] = i+ 1;\n }\n answer(pppp);\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3676,"score_of_the_acc":-0.4673,"final_rank":7},{"submission_id":"aoj_3175_4845697","code_snippet":"//#define _GLIBCXX_DEBUG\n//#include \"atcoder/all\"\n//using namespace atcoder;\n#include <bits/stdc++.h>\n#define int long long\n#define ll long long\nusing ull = unsigned long long;\nusing namespace std;\n#define dump(x) \\\n if (dbg) { \\\n cerr << #x << \" = \" << (x) << endl; \\\n }\n#define overload4(_1, _2, _3, _4, name, ...) name\n#define FOR1(n) for (ll i = 0; i < (n); ++i)\n#define FOR2(i, n) for (ll i = 0; i < (n); ++i)\n#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)\n#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\n#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)\n#define bit(n, k) (((n) >> (k)) & 1) /*nのk bit目*/\nnamespace mydef {\nconst int INF = 1ll << 60;\nconst int MOD = 1e9 + 7;\ntemplate <class T>\nbool chmin(T& a, const T& b) {\n if (a > b) {\n a = b;\n return 1;\n } else\n return 0;\n}\ntemplate <class T>\nbool chmax(T& a, const T& b) {\n if (a < b) {\n a = b;\n return 1;\n } else\n return 0;\n}\nvoid Yes(bool flag = true) {\n if (flag)\n cout << \"Yes\" << endl;\n else\n cout << \"No\" << endl;\n}\nvoid No(bool flag = true) {\n Yes(!flag);\n}\nvoid YES(bool flag = true) {\n if (flag)\n cout << \"YES\" << endl;\n else\n cout << \"NO\" << endl;\n}\nvoid NO(bool flag = true) {\n YES(!flag);\n}\ntemplate <typename A, size_t N, typename T>\nvoid Fill(A (&array)[N], const T& val) {\n std::fill((T*)array, (T*)(array + N), val);\n}\nbool dbg = true;\n} // namespace mydef\nusing namespace mydef;\n#define pb push_back\n//#define mp make_pair\n#define eb emplace_back\n#define lb lower_bound\n#define ub upper_bound\n#define all(v) (v).begin(), (v).end()\n#define SZ(x) ((int)(x).size())\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define vp vector<pair<int, int>>\n#define vvp vector<vector<pair<int, int>>>\n#define pi pair<int, int>\n//#define P pair<int, int>\n//#define V vector<int>\n//#define S set<int>\n#define asn ans\n\nvi query;\nint N;\n\ntemplate <typename T>\nstruct edge {\n int to, id;\n T cost;\n edge(int to) : to(to), id(-1), cost(1) {}\n edge(int to, T cost) : to(to), id(-1), cost(cost) {}\n edge(int to, T cost, int id) : to(to), id(id), cost(cost) {}\n operator int() const { return to; }\n /*\n edge& operator=(const int& x) {\n to = x;\n return *this;\n }\n */\n};\ntemplate <typename T>\nclass Graph : public vector<vector<edge<T>>> {\n //--------Basic--------\nprivate:\n using Edge = edge<T>;\n int M; //M:辺の数\n bool undirected = false;\n bool directed = false;\n bool unweighted = false;\n bool weighted = false;\n bool tree = false;\n //\npublic:\n vector<int> A, B;\n vector<T> C;\n //\npublic:\n Graph() = default;\n //unweighted\n void add_edge_undirected(int u, int v, int id = -1) {\n assert(!directed);\n assert(!weighted);\n undirected = true;\n unweighted = true;\n (*this)[u].emplace_back(Edge{v, 1, id});\n (*this)[v].emplace_back(Edge{u, 1, id});\n }\n void build_undirected(int m) {\n assert(!(*this).empty());\n assert(!directed);\n assert(!weighted);\n undirected = true;\n unweighted = true;\n M = m;\n A.resize(m);\n B.resize(m);\n for (int i = 0; i < m; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n A[i] = u;\n B[i] = v;\n (*this)[u].emplace_back(Edge{v, 1, i});\n (*this)[v].emplace_back(Edge{u, 1, i});\n }\n }\n void build_undirected(int n, int m) {\n (*this).resize(n);\n build_undirected(m);\n }\n void add_edge_directed(int u, int v, int id = -1) {\n assert(!undirected);\n assert(!weighted);\n directed = true;\n unweighted = true;\n (*this)[u].emplace_back(Edge{v, 1, id});\n }\n void build_directed(int m) {\n assert(!(*this).empty());\n assert(!undirected);\n assert(!weighted);\n directed = true;\n unweighted = true;\n M = m;\n A.resize(M);\n B.resize(M);\n for (int i = 0; i < m; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n A[i] = u;\n B[i] = v;\n (*this)[u].emplace_back(Edge{v, 1, i});\n }\n }\n void build_directed(int n, int m) {\n (*this).resize(n);\n build_directed(m);\n }\n //weighed\n void add_edge_undirected_weighed(int u, int v, T cost, int id = -1) {\n assert(!directed);\n assert(!unweighted);\n undirected = true;\n weighted = true;\n (*this)[u].emplace_back(Edge{v, cost, id});\n (*this)[v].emplace_back(Edge{u, cost, id});\n }\n void build_undirected_weighted(int m) {\n assert(!(*this).empty());\n assert(!directed);\n assert(!unweighted);\n undirected = true;\n weighted = true;\n M = m;\n A.resize(m);\n B.resize(m);\n C.resize(m);\n for (int i = 0; i < m; i++) {\n int u, v;\n T cost;\n cin >> u >> v >> cost;\n u--;\n v--;\n A[i] = u;\n B[i] = v;\n C[i] = cost;\n (*this)[u].emplace_back(Edge{v, cost, i});\n (*this)[v].emplace_back(Edge{u, cost, i});\n }\n }\n void build_undirected_weighted(int n, int m) {\n (*this).resize(n);\n build_undirected_weighted(m);\n }\n void add_edge_directed_weighted(int u, int v, T cost, int id = -1) {\n assert(!undirected);\n assert(!unweighted);\n directed = true;\n weighted = true;\n (*this)[u].emplace_back(Edge{v, cost, id});\n }\n void build_directed_weighted(int m) {\n assert(!(*this).empty());\n assert(!undirected);\n assert(!unweighted);\n directed = true;\n weighted = true;\n M = m;\n A.resize(m);\n B.resize(m);\n C.resize(m);\n for (int i = 0; i < m; i++) {\n int u, v;\n T cost;\n cin >> u >> v >> cost;\n u--;\n v--;\n A[i] = u;\n B[i] = v;\n C[i] = cost;\n (*this)[u].emplace_back(Edge{v, cost, i});\n }\n }\n void build_directed_weighted(int n, int m) {\n (*this).resize(n);\n build_directed_weighted(m);\n }\n void build(vector<vector<int>> G) {\n int N = G.size();\n (*this).resize(N);\n for (int i = 0; i < N; i++) {\n for (auto& x : G[i]) {\n add_edge_directed(i, x);\n }\n }\n }\n //tree\n void istree() {\n tree = true;\n }\n void build_tree(int n) {\n istree();\n build_undirected(n, n - 1);\n }\n void build_tree_weighted(int n) {\n istree();\n build_undirected_weighted(n, n - 1);\n }\n //print state\n void state() {\n cerr << endl\n << \"Print State\" << endl\n << \"Edge :\" << endl\n << \" Directed : \" << (directed ? \"Yes\" : \"No\") << endl\n << \" Undirected : \" << (undirected ? \"Yes\" : \"No\") << endl\n << \" Weighted : \" << (weighted ? \"Yes\" : \"No\") << endl\n << \" Unweighted : \" << (unweighted ? \"Yes\" : \"No\") << endl\n << \" Tree : \" << (tree ? \"Yes\" : \"No\") << endl\n << \"Test\" << endl\n << \" test_bipartite(verified) : Yes\" << endl\n << \"Usable Functions : Graph\" << endl\n << \" Dijkstra(verified) : Yes\" << endl\n << \" Warshall–Floyd(verified) : Yes\" << endl\n << \" Kruskal(verified) : Yes\" << endl\n << \" TopologicalSort(verified) : Yes\" << endl\n << \" StronglyConnectedComponent(unverified): \" << (StronglyConnectedComponent_ready ? \"Yes\" : \"No\") << endl\n << \"Usable Funcitons : Tree\" << endl\n << \" ReRooting(verified) : Yes\" << endl;\n }\n //\n //--------union-find tree--------\n struct UnionFind {\n vector<int> data;\n UnionFind(int n) {\n data.assign(n, -1);\n }\n bool unite(int x, int y) {\n x = root(x), y = root(y);\n if (x == y)\n return (false);\n if (data[x] > data[y])\n swap(x, y);\n data[x] += data[y];\n data[y] = x;\n return (true);\n }\n int root(int k) {\n if (data[k] < 0)\n return (k);\n return (data[k] = root(data[k]));\n }\n bool same(int x, int y) {\n return root(x) == root(y);\n }\n int size(int k) {\n return (-data[root(k)]);\n }\n };\n //\n //--------test_bipartite--------\n //verified\npublic:\n bool test_bipartite() {\n int N = (*this).size();\n UnionFind uf(N * 2);\n for (int i = 0; i < N; i++) {\n for (auto& e : (*this)[i]) {\n uf.unite(i, e.to + N);\n uf.unite(i + N, e.to);\n }\n }\n for (int i = 0; i < N; i++) {\n if (uf.same(i, i + N))\n return false;\n }\n return true;\n }\n //\n //--------reverse--------\npublic:\n void reverse() {\n int N = (*this).size();\n vector<pair<int, Edge>> V;\n V.reserve(M);\n for (int i = 0; i < N; i++) {\n for (auto& e : (*this)[i]) {\n V.emplace_back(make_pair(i, e));\n }\n }\n (*this).erase((*this).begin(), (*this).end());\n (*this).resize(N);\n for (auto& p : V)\n (*this)[p.second.to].emplace_back(Edge{p.first, p.second.cost, p.second.id});\n }\n //\n //--------Dijkstra--------\n //verified\npublic:\n //pair<vector<T>, vector<int>> Dijkstra(int s) {\n vector<T> Dijkstra(int s) {\n const T INF = numeric_limits<T>::max() / 5;\n using P = pair<T, int>;\n int N = (*this).size();\n vector<T> dist(N, INF);\n //vector<int> bef(N, -1);\n priority_queue<P, vector<P>, greater<P>> que;\n dist[s] = 0;\n que.emplace(dist[s], s);\n while (!que.empty()) {\n P p = que.top();\n que.pop();\n int now = p.second;\n if (dist[now] < p.first)\n continue;\n for (auto& p : (*this)[now]) {\n int nxt = p.to;\n T cost = p.cost;\n if (dist[nxt] > dist[now] + cost) {\n dist[nxt] = dist[now] + cost;\n //bef[nxt] = now;\n que.emplace(dist[nxt], nxt);\n }\n }\n }\n return dist;\n //return make_pair(dist, bef);\n }\n //\n //\n //--------Warshall–Floyd--------\n //verified\npublic:\n vector<vector<T>> WarshallFloyd() {\n int N = (*this).size();\n const T INF = numeric_limits<T>::max() / 3;\n vector<vector<T>> ret(N, vector<T>(N, INF));\n for (int i = 0; i < N; i++) {\n for (auto& e : (*this)[i]) {\n ret[i][e.to] = e.cost;\n }\n ret[i][i] = 0;\n }\n for (int k = 0; k < N; k++) {\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (ret[i][j] > ret[i][k] + ret[k][j])\n ret[i][j] = ret[i][k] + ret[k][j];\n }\n }\n }\n return ret;\n }\n //\n //\n //--------Kruskal--------\n //verified\nprivate:\n vector<int> Kruskal_data;\n bool Kruskal_unite(int x, int y) {\n x = Kruskal_root(x), y = Kruskal_root(y);\n if (x == y)\n return (false);\n if (Kruskal_data[x] > Kruskal_data[y])\n swap(x, y);\n Kruskal_data[x] += Kruskal_data[y];\n Kruskal_data[y] = x;\n return (true);\n }\n int Kruskal_root(int k) {\n if (Kruskal_data[k] < 0)\n return (k);\n return (Kruskal_data[k] = Kruskal_root(Kruskal_data[k]));\n }\n bool Kruskal_same(int x, int y) {\n return Kruskal_root(x) == Kruskal_root(y);\n }\n int Kruskal_size(int k) {\n return (-Kruskal_data[Kruskal_root(k)]);\n }\n //\npublic:\n template <class Compare = less<T>>\n pair<T, vector<bool>> Kruskal(bool flag = false) {\n struct edge2 {\n int from, to;\n T cost;\n bool used;\n int id;\n edge2(int from, int to, T cost, int id) : from(from), to(to), cost(cost), used(false), id(id) {}\n };\n vector<edge2> edges;\n int N = (*this).size();\n Kruskal_data.assign(N, -1);\n for (int i = 0; i < (int)(*this).size(); i++) {\n auto& V = (*this)[i];\n for (auto& e : V) {\n edges.emplace_back(i, e.to, e.cost, e.id);\n }\n }\n sort(edges.begin(), edges.end(), [](const edge2& a, const edge2& b) {\n return Compare()(a.cost, b.cost);\n });\n T ret = 0;\n vector<bool> V;\n if (flag)\n V.resize(M, false);\n for (auto& e : edges) {\n if (Kruskal_unite(e.from, e.to)) {\n ret += e.cost;\n e.used = true;\n }\n }\n if (flag)\n for (auto& e : edges) {\n assert(e.id >= 0 && e.id < M);\n if (e.used)\n V[e.id] = true;\n }\n if (N == Kruskal_size(0))\n return make_pair(ret, V);\n else\n return make_pair(-1, V);\n }\n //\n //--------StronglyConnectedComponent--------\n //Unverified\npublic:\n vector<vector<int>> SCC_R, SCC_T;\n //\nprivate:\n bool StronglyConnectedComponent_ready = false;\n vector<int> SCC_cmp, SCC_ord;\n vector<bool> SCC_used;\n //\npublic:\n int Gbuild_SCC() {\n cerr << \"Please Verify\" << endl;\n assert(!undirected);\n assert(directed);\n int N = (*this).size();\n SCC_R.resize(N);\n for (int i = 0; i < N; i++) {\n for (auto& x : (*this)[i]) {\n SCC_R[x].emplace_back(i);\n }\n }\n SCC_cmp.resize(N);\n fill(SCC_cmp.begin(), SCC_cmp.end(), -1);\n SCC_used.resize(N);\n fill(SCC_used.begin(), SCC_used.end(), false);\n StronglyConnectedComponent_ready = true;\n return build_StronglyConnectedComponent_init();\n }\n int SCC(int k) {\n assert(StronglyConnectedComponent_ready);\n return SCC_cmp[k];\n }\n //\nprivate:\n void build_StronglyConnectedComponent_dfs(int now) {\n if (SCC_used[now])\n return;\n SCC_used[now] = true;\n for (auto nxt : (*this)[now])\n build_StronglyConnectedComponent_dfs(nxt);\n SCC_ord.emplace_back(now);\n }\n void build_StronglyConnectedComponent_rdfs(int now, int count) {\n if (SCC_cmp[now] != -1)\n return;\n SCC_cmp[now] = count;\n for (auto to : SCC_R[now])\n build_StronglyConnectedComponent_rdfs(to, count);\n }\n int build_StronglyConnectedComponent_init() {\n int n = (int)(*this).size();\n for (int i = 0; i < n; i++)\n build_StronglyConnectedComponent_dfs(i);\n std::reverse(SCC_ord.begin(), SCC_ord.end());\n int group = 0;\n for (auto& i : SCC_ord) {\n if (SCC_cmp[i] == -1) {\n build_StronglyConnectedComponent_rdfs(i, group);\n group++;\n }\n }\n SCC_T.resize(group);\n for (int i = 0; i < n; i++) {\n for (auto& to : (*this)[i]) {\n int s = SCC_cmp[i], t = SCC_cmp[to];\n if (s != t)\n SCC_T[s].emplace_back(t);\n }\n }\n return group;\n }\n //\n //\n //\n //--------TopologicalSort--------\n //verified\npublic:\n vector<int> TopologicalSort() {\n assert(!undirected);\n int N = (*this).size();\n vector<int> deg(N);\n for (auto& V : (*this))\n for (auto& e : V)\n deg[e.to]++;\n queue<int> st;\n for (int i = 0; i < N; i++)\n if (deg[i] == 0)\n st.push(i);\n vector<int> ret;\n ret.reserve(N);\n while (!st.empty()) {\n auto x = st.front();\n st.pop();\n ret.emplace_back(x);\n if (st.empty()) {\n query[x] = x;\n } else {\n query[x] = st.front();\n }\n for (auto& e : (*this)[x])\n if (--deg[e.to] == 0)\n st.push(e.to);\n }\n return ret;\n }\n //\n //\n //--------Tree--------\n //\n //\n //--------ReRooting--------\npublic:\n template <typename sum_t>\n pair<vector<sum_t>, vector<vector<sum_t>>>\n Tbuild_ReRooting(\n const function<sum_t(sum_t, sum_t)> f,\n const function<sum_t(sum_t, Edge)> gg,\n sum_t ident) {\n assert(tree);\n int N = (*this).size();\n vector<sum_t> subdp(N, ident), dp(N, ident);\n vector<vector<sum_t>> g_dp(N), g_ndp(N), memo(N);\n vector<vector<bool>> seen(N);\n for (int i = 0; i < N; i++) {\n int S = (*this)[i].size();\n g_dp[i].resize(S, ident);\n g_ndp[i].resize(S, ident);\n memo[i].resize(S);\n seen[i].resize(S, false);\n }\n stack<int> stk;\n stk.push(0);\n vector<int> par(N), ord(N);\n int index = 0;\n par[0] = -1;\n while (!stk.empty()) {\n int node = stk.top();\n stk.pop();\n ord[index++] = node;\n for (auto& e : (*this)[node]) {\n if (e.to == par[node])\n continue;\n stk.push(e.to);\n par[e.to] = node;\n }\n }\n for (int k = ord.size() - 1; k >= 0; k--) {\n int idx = ord[k];\n for (int i = 0; i < (int)((*this)[idx].size()); i++) {\n auto& e = (*this)[idx][i];\n if (e.to == par[idx])\n continue;\n if (!seen[idx][i]) {\n memo[idx][i] = gg(subdp[e.to], e);\n seen[idx][i] = true;\n }\n subdp[idx] = f(subdp[idx], memo[idx][i]);\n }\n }\n vector<sum_t> top(N, ident);\n for (int k = 0; k < (int)(ord.size()); k++) {\n int idx = ord[k];\n sum_t buff{ident};\n for (int i = 0; i < (int)((*this)[idx].size()); i++) {\n auto& e = (*this)[idx][i];\n g_ndp[idx][i] = buff;\n if (!seen[idx][i]) {\n memo[idx][i] = gg(par[idx] == e.to ? top[idx] : subdp[e.to], e);\n seen[idx][i] = true;\n }\n g_dp[idx][i] = memo[idx][i];\n buff = f(buff, g_dp[idx][i]);\n }\n dp[idx] = buff;\n buff = ident;\n for (int i = (*this)[idx].size() - 1; i >= 0; i--) {\n auto& e = (*this)[idx][i];\n if (e.to != par[idx])\n top[e.to] = f(g_ndp[idx][i], buff);\n g_ndp[idx][i] = f(g_ndp[idx][i], buff);\n buff = f(buff, g_dp[idx][i]);\n }\n }\n return make_pair(dp, memo);\n }\n //\n //\n //\n //TODO:lca,centroid,diameter,hl-decomposition\n};\n//グローバルでの使用のみ想定\n\nGraph<int> G;\nint NN;\n\nvoid solve() {\n NN = (1 << N);\n G.resize(NN);\n query.resize(NN);\n int TIME = 60;\n while (TIME--) {\n //queryを計算\n auto A = G.TopologicalSort();\n\n //queryをチェック\n bool flag = true;\n for (int i = 0; i < NN; i++) {\n if (query[i] != i)\n flag = false;\n }\n\n if (flag) {\n //答えを出力\n vi ans(NN);\n for (int i = 0; i < NN; i++) {\n ans[A[i]] = i;\n }\n cout << \"!\";\n for (auto& x : ans)\n cout << \" \" << x + 1;\n cout << endl;\n return;\n }\n\n cout << \"?\";\n for (auto& x : query)\n cout << \" \" << x + 1;\n cout << endl;\n\n vi C(NN);\n for (int i = 0; i < NN; i++) {\n cin >> C[i];\n }\n\n for (int i = 0; i < NN; i++) {\n if (i != query[i]) {\n if (C[query[i]] == 1) {\n G.add_edge_directed(i, query[i]);\n } else {\n G.add_edge_directed(query[i], i);\n }\n }\n }\n }\n assert(false);\n}\n\nsigned main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n cin >> N;\n\n\n solve();\n return 0;\n}","accuracy":0.3191489361702128,"time_ms":40,"memory_kb":3404,"score_of_the_acc":0,"final_rank":11},{"submission_id":"aoj_3175_4845551","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing uint = unsigned;\nusing pcc = pair<char, char>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<ld, ld>;\nusing tuplis = array<ll, 3>;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nconst ll LINF=0x1fffffffffffffff;\nconst ll MINF=0x7fffffffffff;\nconst int INF=0x3fffffff;\nconst int MOD=1000000007;\nconst int MODD=998244353;\nconst ld DINF=numeric_limits<ld>::infinity();\nconst ld EPS=1e-9;\nconst ld PI=3.1415926535897932;\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\n#define overload4(_1,_2,_3,_4,name,...) name\n#define overload3(_1,_2,_3,name,...) name\n#define rep1(n) for(ll i=0;i<n;++i)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(n) for(ll i=n;i--;)\n#define rrep2(i,n) for(ll i=n;i--;)\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\n#define each1(i,a) for(auto&&i:a)\n#define each2(x,y,a) for(auto&&[x,y]:a)\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\n#define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__)\n#define all1(i) begin(i),end(i)\n#define all2(i,a) begin(i),begin(i)+a\n#define all3(i,a,b) begin(i)+a,begin(i)+b\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\n#define rall1(i) (i).rbegin(),(i).rend()\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\n#define Msum(...) accumulate(all(__VA_ARGS__),0_M)\n#define elif else if\n#define unless(a) if(!(a))\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\nll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }\nll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\nvector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\nmap<ll,ll> factor_map(ull x){ map<ll,ll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans[i] = 1; while((x /= i) % i == 0) ans[i]++; } if(x != 1) ans[x] = 1; return ans; }\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\ntemplate<class T> unordered_map<T, ll> press(vector<T> a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\ntemplate<class T> map<T, ll> press_map(vector<T> a){ Uniq(a); map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\nint scan(){ return getchar(); }\nvoid scan(int& a){ scanf(\"%d\", &a); }\nvoid scan(unsigned& a){ scanf(\"%u\", &a); }\nvoid scan(long& a){ scanf(\"%ld\", &a); }\nvoid scan(long long& a){ scanf(\"%lld\", &a); }\nvoid scan(unsigned long long& a){ scanf(\"%llu\", &a); }\nvoid scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\\n'); }\nvoid scan(float& a){ scanf(\"%f\", &a); }\nvoid scan(double& a){ scanf(\"%lf\", &a); }\nvoid scan(long double& a){ scanf(\"%Lf\", &a); }\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\nvoid scan(char a[]){ scanf(\"%s\", a); }\nvoid scan(string& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>&);\ntemplate<class T, size_t size> void scan(array<T, size>&);\ntemplate<class T, class L> void scan(pair<T, L>&);\ntemplate<class T, size_t size> void scan(T(&)[size]);\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(T& a){ cin >> a; }\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(unsigned a){ printf(\"%u\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(unsigned long long a){ printf(\"%llu\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(float a){ printf(\"%.15f\", a); }\nvoid print(double a){ printf(\"%.15f\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\ntemplate<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }\ntemplate<class T> void print(const vector<T>&);\ntemplate<class T, size_t size> void print(const array<T, size>&);\ntemplate<class T, class L> void print(const pair<T, L>& p);\ntemplate<class T, size_t size> void print(const T (&)[size]);\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const T& a){ cout << a; }\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\n#ifdef DEBUG\ninline ll __lg(ull __n){ return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); }\n#define debug(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...) void(0)\n#endif\nint first(bool i = true){ return out(i?\"first\":\"second\"); }\nint First(bool i = true){ return out(i?\"First\":\"Second\"); }\nint yes(bool i = true){ return out(i?\"yes\":\"no\"); }\nint Yes(bool i = true){ return out(i?\"Yes\":\"No\"); }\nint No(){ return out(\"No\"); }\nint YES(bool i = true){ return out(i?\"YES\":\"NO\"); }\nint NO(){ return out(\"NO\"); }\nint Yay(bool i = true){ return out(i?\"Yay!\":\":(\"); }\nint possible(bool i = true){ return out(i?\"possible\":\"impossible\"); }\nint Possible(bool i = true){ return out(i?\"Possible\":\"Impossible\"); }\nint POSSIBLE(bool i = true){ return out(i?\"POSSIBLE\":\"IMPOSSIBLE\"); }\nvoid Case(ll i){ printf(\"Case #%lld: \", i); }\n\n\nvector<ll>A;\nvector<ll> query(const vector<ll>&a,const vector<ll>&s){\n vector<ll>q(a.size());\n rep(a.size())q[s[i]]=s[a[i]]+1;\n print(\"? \");\n out(q);\n fflush(stdout);\n #ifdef DEBUG\n vec(ll,c,a.size());\n rep(a.size())if(A[i]<A[q[i]-1])c[q[i]-1]++;\n #else\n VEC(ll,c,a.size());\n #endif\n vec(ll,d,a.size());\n rep(a.size())d[i]=c[s[i]];\n return d;\n}\nvoid answer(vector<ll>a){\n vector<ll>ans(a.size());\n rep(a.size())ans[a[i]]=i+1;\n print(\"! \");\n out(ans);\n fflush(stdout);\n #ifdef DEBUG\n rep(a.size())assert(A[i]==ans[i]-1);\n #endif\n exit(0);\n}\nsigned main(){\n#ifdef DEBUG\nll n=10;\nA=iota(1<<n);\nshuffle(all(A),random_device{});\n#else\n LL(n);\n#endif\n auto a=iota(1<<n);\n rep(n){\n vec(ll,cnt,1<<n);\n rrep(j,i){\n vec(ll,q,1<<n);\n rep(begin,0,1<<n,2<<i){\n const ll end=begin+(2<<i),cen=begin+(1<<i);\n rep(at,cen,end){\n q[at]=at;\n if(at>>i&1&&(at&(2<<j)-1)==(1<<j)){\n const ll front=cnt[at-(1<<j)],back=at+(1<<j)==end?1<<i:cnt[at+(1<<j)];\n rep(i,front,back)q[begin+i]=at;\n }\n }\n }\n q=query(q,a);\n rep(begin,0,1<<n,2<<i){\n const ll end=begin+(2<<i),cen=begin+(1<<i);\n rep(at,cen,end){\n if(at>>i&1&&(at&(2<<j)-1)==(1<<j)){\n rep(i,at,at+(1<<j))cnt[i]+=q[at];\n }\n }\n }\n }\n vec(ll,q,1<<n);\n rep(j,1<<n)q[j]=(j>>i^1)<<i;\n q=query(q,a);\n rep(j,1<<i,1<<n,2<<i)cnt[j]=q[j];\n rep(begin,0,1<<n,2<<i){\n const ll end=begin+(2<<i),cen=begin+(1<<i);\n ll at=cen;\n vec(ll,b,0);\n rep(j,1<<i){\n while(at<end&&cnt[at]==j){\n b.push_back(a[at]);\n at++;\n }\n b.push_back(a[begin+j]);\n while(at<end&&cnt[at]==j+1){\n b.push_back(a[at]);\n at++;\n }\n }\n rep(j,2<<i)a[begin+j]=b[j];\n }\n }\n answer(a);\n}","accuracy":1,"time_ms":50,"memory_kb":3644,"score_of_the_acc":-0.4417,"final_rank":6},{"submission_id":"aoj_3175_4845185","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define int ll\n\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,b) rng(i,0,b)\n#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)\n#define per(i,b) gnr(i,0,b)\n#define pb push_back\n#define eb emplace_back\n#define a first\n#define b second\n#define bg begin()\n#define ed end()\n#define all(x) x.bg,x.ed\n#define si(x) int(x.size())\n#ifdef LOCAL\n#define dmp(x) cerr<<__LINE__<<\" \"<<#x<<\" \"<<x<<endl\n#else\n#define dmp(x) void(0)\n#endif\n\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\n\ntemplate<class t> using vc=vector<t>;\ntemplate<class t> using vvc=vc<vc<t>>;\n\nusing pi=pair<int,int>;\nusing vi=vc<int>;\n\ntemplate<class t,class u>\nostream& operator<<(ostream& os,const pair<t,u>& p){\n\treturn os<<\"{\"<<p.a<<\",\"<<p.b<<\"}\";\n}\n\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\n\tos<<\"{\";\n\tfor(auto e:v)os<<e<<\",\";\n\treturn os<<\"}\";\n}\n\n#define mp make_pair\n#define mt make_tuple\n#define one(x) memset(x,-1,sizeof(x))\n#define zero(x) memset(x,0,sizeof(x))\n#ifdef LOCAL\nvoid dmpr(ostream&os){os<<endl;}\ntemplate<class T,class... Args>\nvoid dmpr(ostream&os,const T&t,const Args&... args){\n\tos<<t<<\" \";\n\tdmpr(os,args...);\n}\n#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)\n#else\n#define dmp2(...) void(0)\n#endif\n\nusing uint=unsigned;\nusing ull=unsigned long long;\n\ntemplate<class t,size_t n>\nostream& operator<<(ostream&os,const array<t,n>&a){\n\treturn os<<vc<t>(all(a));\n}\n\ntemplate<int i,class T>\nvoid print_tuple(ostream&,const T&){\n}\n\ntemplate<int i,class T,class H,class ...Args>\nvoid print_tuple(ostream&os,const T&t){\n\tif(i)os<<\",\";\n\tos<<get<i>(t);\n\tprint_tuple<i+1,T,Args...>(os,t);\n}\n\ntemplate<class ...Args>\nostream& operator<<(ostream&os,const tuple<Args...>&t){\n\tos<<\"{\";\n\tprint_tuple<0,tuple<Args...>,Args...>(os,t);\n\treturn os<<\"}\";\n}\n\ntemplate<class t>\nvoid print(t x,int suc=1){\n\tcout<<x;\n\tif(suc==1)\n\t\tcout<<\"\\n\";\n\tif(suc==2)\n\t\tcout<<\" \";\n}\n\nll read(){\n\tll i;\n\tcin>>i;\n\treturn i;\n}\n\nvi readvi(int n,int off=0){\n\tvi v(n);\n\trep(i,n)v[i]=read()+off;\n\treturn v;\n}\n\npi readpi(int off=0){\n\tint a,b;cin>>a>>b;\n\treturn pi(a+off,b+off);\n}\n\ntemplate<class T>\nvoid print(const vector<T>&v,int suc=1){\n\trep(i,v.size())\n\t\tprint(v[i],i==int(v.size())-1?suc:2);\n}\n\nstring readString(){\n\tstring s;\n\tcin>>s;\n\treturn s;\n}\n\ntemplate<class T>\nT sq(const T& t){\n\treturn t*t;\n}\n\n//#define CAPITAL\nvoid yes(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"YES\"<<\"\\n\";\n\t#else\n\tcout<<\"Yes\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\nvoid no(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"NO\"<<\"\\n\";\n\t#else\n\tcout<<\"No\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\nvoid possible(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"POSSIBLE\"<<\"\\n\";\n\t#else\n\tcout<<\"Possible\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\nvoid impossible(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"IMPOSSIBLE\"<<\"\\n\";\n\t#else\n\tcout<<\"Impossible\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\n\nconstexpr ll ten(int n){\n\treturn n==0?1:ten(n-1)*10;\n}\n\nconst ll infLL=LLONG_MAX/3;\n\n#ifdef int\nconst int inf=infLL;\n#else\nconst int inf=INT_MAX/2-100;\n#endif\n\nint topbit(signed t){\n\treturn t==0?-1:31-__builtin_clz(t);\n}\nint topbit(ll t){\n\treturn t==0?-1:63-__builtin_clzll(t);\n}\nint botbit(signed a){\n\treturn a==0?32:__builtin_ctz(a);\n}\nint botbit(ll a){\n\treturn a==0?64:__builtin_ctzll(a);\n}\nint popcount(signed t){\n\treturn __builtin_popcount(t);\n}\nint popcount(ll t){\n\treturn __builtin_popcountll(t);\n}\nbool ispow2(int i){\n\treturn i&&(i&-i)==i;\n}\nll mask(int i){\n\treturn (ll(1)<<i)-1;\n}\n\nbool inc(int a,int b,int c){\n\treturn a<=b&&b<=c;\n}\n\ntemplate<class t> void mkuni(vc<t>&v){\n\tsort(all(v));\n\tv.erase(unique(all(v)),v.ed);\n}\n\nll rand_int(ll l, ll r) { //[l, r]\n\t#ifdef LOCAL\n\tstatic mt19937_64 gen;\n\t#else\n\tstatic mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n\t#endif\n\treturn uniform_int_distribution<ll>(l, r)(gen);\n}\n\ntemplate<class t>\nvoid myshuffle(vc<t>&a){\n\trep(i,si(a))swap(a[i],a[rand_int(0,i)]);\n}\n\ntemplate<class t>\nint lwb(const vc<t>&v,const t&a){\n\treturn lower_bound(all(v),a)-v.bg;\n}\n\nvvc<int> readGraph(int n,int m){\n\tvvc<int> g(n);\n\trep(i,m){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\t//sc.read(a,b);\n\t\ta--;b--;\n\t\tg[a].pb(b);\n\t\tg[b].pb(a);\n\t}\n\treturn g;\n}\n\nvvc<int> readTree(int n){\n\treturn readGraph(n,n-1);\n}\n\nsigned main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\tcout<<fixed<<setprecision(20);\n\t\n\tint n;cin>>n;\n\tint s=1<<n;\n\tvi idx(s);iota(all(idx),0);\n\tvvc<pi> a;\n\t//x->small\n\t//y->large\n\tauto waf=[&](int i,int x,int y){\n\t\tif(si(a)<i+1)a.resize(i+1);\n\t\ta[i].eb(x,y);\n\t};\n\tfor(int w=2;w<=s;w*=2){\n\t\tint off=si(a);\n\t\tbool mode=false;\n\t\tfor(int i=0;i<s;i+=w){\n\t\t\tint head=off;\n\t\t\tfor(int h=w/2;h>=1;h/=2){\n\t\t\t\tfor(int j=i;j<i+w;j+=2*h){\n\t\t\t\t\tfor(int k=j;k<j+h;k++){\n\t\t\t\t\t\tif(!mode)waf(head,k,k+h);\n\t\t\t\t\t\telse waf(head,k+h,k);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\thead++;\n\t\t\t}\n\t\t\tmode^=1;\n\t\t}\n\t}\n\tint L=si(a);\n\trep(i,L){\n\t\tassert(si(a[i])==s/2);\n\t\tvi u(s);\n\t\tfor(auto w:a[i]){\n\t\t\tu[w.a]++;\n\t\t\tu[w.b]++;\n\t\t}\n\t\tassert(u==vi(s,1));\n\t}\n\t\n\t//cerr<<L<<endl;\n\t\n\t#ifdef LOCAL\n\trep(_,100){\n\t\tvi p(s);\n\t\tiota(all(p),0);\n\t\tmyshuffle(p);\n\t\trep(i,L){\n\t\t\tfor(auto w:a[i]){\n\t\t\t\tif(p[w.a]>p[w.b]){\n\t\t\t\t\tswap(p[w.a],p[w.b]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tassert(p==idx);\n\t}\n\t#endif\n\t\n\trep(i,L){\n\t\tvi val(s);iota(all(val),0);\n\t\tfor(auto w:a[i]){\n\t\t\tswap(val[idx[w.a]],val[idx[w.b]]);\n\t\t}\n\t\tfor(auto&v:val)v++;\n\t\tcout<<\"? \";\n\t\tprint(val);\n\t\tcout.flush();\n\t\tvi c=readvi(s);\n\t\tfor(auto w:a[i]){\n\t\t\tif(c[idx[w.a]]){\n\t\t\t\tswap(idx[w.a],idx[w.b]);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tcout<<\"! \";\n\tvi ans(s);\n\trep(i,s)ans[idx[i]]=i+1;\n\tprint(ans);\n\tcout.flush();\n}","accuracy":1,"time_ms":50,"memory_kb":3696,"score_of_the_acc":-0.4832,"final_rank":8},{"submission_id":"aoj_3175_4841139","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef long double D;\n//typedef complex<D> P;\n#define F first\n#define S second\nconst ll MOD=1000000007;\n//const ll MOD=998244353;\n\ntemplate<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}\ntemplate<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}\ntemplate<typename T,typename U>ostream & operator << (ostream &o,const pair<T,U> &A){o<<A.F<<\" \"<<A.S; return o;}\ntemplate<typename T>ostream & operator << (ostream &o,const vector<T> &A){int i=A.size(); for(auto &I:A){o<<I<<(--i?\" \":\"\");} return o;}\ntemplate<typename T,typename U>T & chmax(T &a,const U &b){if(a<b){a=b;} return a;}\ntemplate<typename T,typename U>T & chmin(T &a,const U &b){if(b<a){a=b;} return a;}\n\nint middle(int lf,int rg){return (rg-lf)/2+lf;}\n\nint main(){\n \n int N;\n cin>>N;\n int sz=1<<N;\n vector<int> A(sz),C(sz),ans(sz),lw(sz),hg(sz),tmp(sz);\n auto ask=\n [&](){\n for(int i=0;i<sz;i++){tmp[ans[i]]=ans[A[i]]+1;}\n cout<<\"? \"<<tmp<<endl;\n cin>>tmp;\n for(int i=0;i<sz;i++){C[i]=tmp[ans[i]];}\n };\n for(int i=0;i<sz;i++){ans[i]=i;}\n for(int i=1,L=2;i<sz;i<<=1,L<<=1){\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf;j<mid;j++){lw[j]=mid; hg[j]=rg;}\n }\n for(int dif=i;dif>0;dif>>=1){\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf;j<mid;j++){\n A[j]=lw[j]+dif/2;\n A[j+i]=j;\n }\n }\n ask();\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf;j<mid;j++){\n if(C[A[j]]){C[A[j]]--; hg[j]=A[j];}\n else{lw[j]=A[j];}\n }\n }\n }\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf,k=mid,idx=lf;idx<rg;){\n while(j<mid && hg[j]<=k){tmp[idx++]=ans[j++];}\n if(k<rg){tmp[idx++]=ans[k++];}\n }\n }\n ans=tmp;\n }\n for(int i=0;i<sz;i++){tmp[ans[i]]=i+1;}\n cout<<\"! \"<<tmp<<endl;\ncout<<\"uku\";\ncout<<flush;\n \n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3628,"score_of_the_acc":-0.4289,"final_rank":1},{"submission_id":"aoj_3175_4841136","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef long double D;\n//typedef complex<D> P;\n#define F first\n#define S second\nconst ll MOD=1000000007;\n//const ll MOD=998244353;\n\ntemplate<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}\ntemplate<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}\ntemplate<typename T,typename U>ostream & operator << (ostream &o,const pair<T,U> &A){o<<A.F<<\" \"<<A.S; return o;}\ntemplate<typename T>ostream & operator << (ostream &o,const vector<T> &A){int i=A.size(); for(auto &I:A){o<<I<<(--i?\" \":\"\");} return o;}\ntemplate<typename T,typename U>T & chmax(T &a,const U &b){if(a<b){a=b;} return a;}\ntemplate<typename T,typename U>T & chmin(T &a,const U &b){if(b<a){a=b;} return a;}\n\nint middle(int lf,int rg){return (rg-lf)/2+lf;}\n\nint main(){\n \n int N;\n cin>>N;\n int sz=1<<N;\n vector<int> A(sz),C(sz),ans(sz),lw(sz),hg(sz),tmp(sz);\n auto ask=\n [&](){\n for(int i=0;i<sz;i++){tmp[ans[i]]=ans[A[i]]+1;}\n cout<<\"? \"<<tmp<<endl;\n cin>>tmp;\n for(int i=0;i<sz;i++){C[i]=tmp[ans[i]];}\n };\n for(int i=0;i<sz;i++){ans[i]=i;}\n for(int i=1,L=2;i<sz;i<<=1,L<<=1){\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf;j<mid;j++){lw[j]=mid; hg[j]=rg;}\n }\n for(int dif=i;dif>0;dif>>=1){\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf;j<mid;j++){\n A[j]=lw[j]+dif/2;\n A[j+i]=j;\n }\n }\n ask();\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf;j<mid;j++){\n if(C[A[j]]){C[A[j]]--; hg[j]=A[j];}\n else{lw[j]=A[j];}\n }\n }\n }\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf,k=mid,idx=lf;idx<rg;){\n while(j<mid && hg[j]<=k){tmp[idx++]=ans[j++];}\n if(k<rg){tmp[idx++]=ans[k++];}\n }\n }\n ans=tmp;\n }\n for(int i=0;i<sz;i++){tmp[ans[i]]=i+1;}\n cout<<\"! \"<<tmp<<endl;\ncout<<\"uku\";\n \n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3632,"score_of_the_acc":-0.4321,"final_rank":3},{"submission_id":"aoj_3175_4841129","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef long double D;\n//typedef complex<D> P;\n#define F first\n#define S second\nconst ll MOD=1000000007;\n//const ll MOD=998244353;\n\ntemplate<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}\ntemplate<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}\ntemplate<typename T,typename U>ostream & operator << (ostream &o,const pair<T,U> &A){o<<A.F<<\" \"<<A.S; return o;}\ntemplate<typename T>ostream & operator << (ostream &o,const vector<T> &A){int i=A.size(); for(auto &I:A){o<<I<<(--i?\" \":\"\");} return o;}\ntemplate<typename T,typename U>T & chmax(T &a,const U &b){if(a<b){a=b;} return a;}\ntemplate<typename T,typename U>T & chmin(T &a,const U &b){if(b<a){a=b;} return a;}\n\nint middle(int lf,int rg){return (rg-lf)/2+lf;}\n\nint main(){\n \n int N;\n cin>>N;\n int sz=1<<N;\n vector<int> A(sz),C(sz),ans(sz),lw(sz),hg(sz),tmp(sz);\n auto ask=\n [&](){\n for(int i=0;i<sz;i++){tmp[ans[i]]=ans[A[i]]+1;}\n cout<<\"? \"<<tmp<<endl;\n cin>>tmp;\n for(int i=0;i<sz;i++){C[i]=tmp[ans[i]];}\n };\n for(int i=0;i<sz;i++){ans[i]=i;}\n for(int i=1,L=2;i<sz;i<<=1,L<<=1){\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf;j<mid;j++){lw[j]=mid; hg[j]=rg;}\n }\n for(int dif=i;dif>0;dif>>=1){\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf;j<mid;j++){\n A[j]=lw[j]+dif/2;\n A[j+i]=j;\n }\n }\n ask();\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf;j<mid;j++){\n if(C[A[j]]){C[A[j]]--; hg[j]=A[j];}\n else{lw[j]=A[j];}\n }\n }\n }\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\n for(int j=lf,k=mid,idx=lf;idx<rg;){\n while(j<mid && hg[j]<=k){tmp[idx++]=ans[j++];}\n if(k<rg){tmp[idx++]=ans[k++];}\n }\n }\n ans=tmp;\n }\n for(int i=0;i<sz;i++){tmp[ans[i]]=i+1;}\n cout<<\"! \"<<tmp<<endl;\n\n \n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3628,"score_of_the_acc":-0.4289,"final_rank":1},{"submission_id":"aoj_3175_4841121","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n;\n\nvector<int> query(vector<int> &a) {\n cout << \"?\";\n for (int i = 0; i < (1 << n); i++) {\n cout << \" \" << a[i] + 1;\n }\n cout << endl;\n vector<int> c(1 << n);\n for (int i = 0; i < (1 << n); i++) {\n cin >> c[i];\n }\n return c;\n}\n\nvoid answer(vector<int> &p) {\n cout << \"!\";\n for (int i = 0; i < (1 << n); i++) {\n cout << \" \" << p[i] + 1;\n }\n cout << endl;\n}\n\nint main() {\n cin >> n;\n int sz = 1 << n;\n\n vector<vector<int>> v(sz, vector<int>(1));\n for (int i = 0; i < sz; i++) {\n v[i][0] = i;\n }\n\n for (int z = 0; z < n; z++) {\n vector<int> ref(1 << z, 0);\n int pre = 0;\n for (int b = 0; b < z; b++) {\n for (int i = pre; i < pre + (1 << b); i++) {\n if (b < z - 1) ref[2 * i + 1] = ref[i];\n ref[i] += 1 << (z - 1 - b);\n if (b < z - 1) ref[2 * i + 2] = ref[i];\n ref[i]--;\n }\n pre += (1 << b);\n }\n }\n\n vector<int> ret;\n for (int z = 0; z < n; z++) {\n vector<int> a(sz);\n int c = (1 << (n - 1 - z));\n\n for (int k = 0; k < c; k++) {\n vector<int> &s = v[2 * k], &t = v[2 * k + 1];\n for (auto &x : s) a[x] = s[0];\n for (auto &x : t) a[x] = s[0];\n a[t.back()] = s.back();\n }\n ret = query(a);\n for (int k = 0; k < c; k++) {\n if (ret[v[2 * k].back()]) swap(v[2 * k], v[2 * k + 1]);\n }\n\n vector<int> ref(1 << z, 0);\n int pre = 0;\n for (int b = 0; b < z; b++) {\n for (int i = pre; i < pre + (1 << b); i++) {\n if (b < z - 1) ref[2 * i + 1] = ref[i];\n ref[i] += 1 << (z - 1 - b);\n if (b < z - 1) ref[2 * i + 2] = ref[i];\n ref[i]--;\n }\n pre += (1 << b);\n }\n\n vector<vector<int>> num(c, vector<int>(1 << (z + 1)));\n for (int k = 0; k < c; k++) num[k][0] = 1 << z;\n\n pre = 0;\n for (int b = 0; b < z; b++) {\n for (int k = 0; k < c; k++) {\n int sum = 0;\n for (int i = pre; i < pre + (1 << b); i++) {\n for (int j = 0; j < num[k][i]; j++)\n a[v[2 * k][j + sum]] = v[2 * k + 1][ref[i]];\n sum += num[k][i];\n }\n for (auto &x : v[2 * k + 1]) a[x] = v[2 * k][0];\n }\n ret = query(a);\n for (int k = 0; k < c; k++) {\n int sum = 0;\n for (int i = pre; i < pre + (1 << b); i++) {\n int x = ret[v[2 * k + 1][ref[i]]];\n num[k][2 * i + 1] = x;\n num[k][2 * i + 2] = num[k][i] - x;\n }\n }\n pre += (1 << b);\n }\n\n vector<vector<int>> w(c);\n for (int k = 0; k < c; k++) {\n int sum = 0;\n for (int i = 0; i < (1 << z); i++) {\n for (int j = 0; j < num[k][i + (1 << z) - 1]; j++) {\n w[k].push_back(v[2 * k][j + sum]);\n }\n sum += num[k][i + (1 << z) - 1];\n w[k].push_back(v[2 * k + 1][i]);\n }\n }\n\n v = w;\n }\n\n vector<int> ans(sz);\n for (int i = 0; i < sz; i++) ans[v[0][i]] = i;\n answer(ans);\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3632,"score_of_the_acc":-0.4321,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_3175_4850876\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acos(-1.0);\\n\\n\\nvector<int> query(vector<int> a) {\\n\\tcout << \\\"?\\\";\\n\\trep(i, a.size()) {\\n\\t cout << \\\" \\\";\\n\\t\\tcout << a[i]+1;\\n\\t}\\n\\tcout << endl;\\n\\tvector<int> res(a.size());\\n\\trep(i, a.size())cin >> res[i];\\n\\treturn res;\\n}\\nvoid solve() {\\n\\tint n; cin >> n;\\n\\tvector<vector<int>> v;\\n\\trep(i, (1<<n)) {\\n\\t\\tv.push_back({ i });\\n\\t}\\n\\tint tmp = 0;\\n\\twhile (v.size() > 1) {\\n\\t\\ttmp++;\\n\\t\\tvector<vector<int>> ups;\\n\\t\\tvector<vector<vector<int>>> vs;\\n\\t\\tvector<vector<vector<int>>> ts;\\n\\t\\tvector<vector<int>> locs;\\n\\t\\tlocs.resize(v.size() / 2);\\n\\t\\trep(j, locs.size()) {\\n\\t\\t\\tlocs[j].resize(v[0].size());\\n\\t\\t}\\n\\t\\trep(i, v.size() / 2) {\\n\\t\\t\\tups.push_back({ -1 });\\n\\t\\t\\tvs.push_back({ v[2 * i] });\\n\\t\\t\\tts.push_back({ v[2 * i + 1] });\\n\\t\\t}\\n\\t\\tvector<bool> ist(1 << n);\\n\\t\\tfor (int i = 1; i < v.size(); i += 2) {\\n\\t\\t\\tfor (int id : v[i]) {\\n\\t\\t\\t\\tist[id] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(aa, tmp) {\\n\\t\\t\\tvector<int> q(1 << n);\\n\\t\\t\\trep(i, (1 << n))if (ist[i])q[i] = i;\\n\\t\\t\\trep(i, v.size() / 2) {\\n\\t\\t\\t\\trep(j, vs[i].size()) {\\n\\t\\t\\t\\t\\tif (ts[i][j].empty()) {\\n\\t\\t\\t\\t\\t\\tfor (int id : vs[i][j]) {\\n\\t\\t\\t\\t\\t\\t\\tq[id] = ups[i][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tint mid = ts[i][j].size() / 2;\\n\\t\\t\\t\\t\\t\\tfor (int id : vs[i][j]) {\\n\\t\\t\\t\\t\\t\\t\\tq[id] = ts[i][j][mid];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvector<int> c = query(q);\\n\\t\\t\\tvector<vector<int>> nup(v.size() / 2);\\n\\t\\t\\trep(i, v.size() / 2) {\\n\\t\\t\\t\\tint s = 0;\\n\\t\\t\\t\\tint t = 0;\\n\\n\\t\\t\\t\\tvector<vector<int>> nv;\\n\\t\\t\\t\\tvector<vector<int>> nt;\\n\\t\\t\\t\\trep(j, vs[i].size()) {\\n\\t\\t\\t\\t\\tif (ts[i][j].empty()) {\\n\\t\\t\\t\\t\\t\\tnv.push_back(vs[i][j]);\\n\\t\\t\\t\\t\\t\\tnt.push_back(ts[i][j]);\\n\\t\\t\\t\\t\\t\\tnup[i].push_back(ups[i][j]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tint mid = ts[i][j].size() / 2;\\n\\t\\t\\t\\t\\t\\tint num = ts[i][j][mid];\\n\\t\\t\\t\\t\\t\\tlocs[i][t + mid] = s + c[num];\\n\\t\\t\\t\\t\\t\\tvector<int> vl;\\n\\t\\t\\t\\t\\t\\tvector<int> vr;\\n\\t\\t\\t\\t\\t\\trep(k, vs[i][j].size()) {\\n\\t\\t\\t\\t\\t\\t\\tif (k < c[num]) {\\n\\t\\t\\t\\t\\t\\t\\t\\tvl.push_back(vs[i][j][k]);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse vr.push_back(vs[i][j][k]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tvector<int> tl, tr;\\n\\t\\t\\t\\t\\t\\trep(k, ts[i][j].size()) {\\n\\t\\t\\t\\t\\t\\t\\tif (k < mid)tl.push_back(ts[i][j][k]);\\n\\t\\t\\t\\t\\t\\t\\telse if (k > mid)tr.push_back(ts[i][j][k]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tnv.push_back(vl); nv.push_back(vr);\\n\\t\\t\\t\\t\\t\\tnt.push_back(tl); nt.push_back(tr);\\n\\t\\t\\t\\t\\t\\tnup[i].push_back(num);\\n\\t\\t\\t\\t\\t\\tnup[i].push_back(num);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\ts += vs[i][j].size();\\n\\t\\t\\t\\t\\tt += ts[i][j].size();\\n\\t\\t\\t\\t\\tif (ups[i][j] >= 0)t++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tswap(vs[i], nv);\\n\\t\\t\\t\\tswap(ts[i], nt);\\n\\t\\t\\t}\\n\\t\\t\\tswap(ups, nup);\\n\\t\\t}\\n\\t\\tvector<vector<int>> nv;\\n\\t\\trep(i, v.size() / 2) {\\n\\t\\t\\tint id = 0;\\n\\t\\t\\tvector<int> cv;\\n\\t\\t\\trep(j, v[2 * i].size()) {\\n\\t\\t\\t\\twhile (id < v[2 * i + 1].size() && locs[i][id] <= j) {\\n\\t\\t\\t\\t\\tcv.push_back(v[2 * i + 1][id]);\\n\\t\\t\\t\\t\\tid++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcv.push_back(v[2 * i][j]);\\n\\t\\t\\t}\\n\\t\\t\\twhile (id < v[2 * i + 1].size()) {\\n\\t\\t\\t\\tcv.push_back(v[2 * i + 1][id]);\\n\\t\\t\\t\\tid++;\\n\\t\\t\\t}\\n\\t\\t\\tnv.push_back(cv);\\n\\t\\t}\\n\\t\\tswap(v, nv);\\n\\t\\t/*rep(i, v.size()) {\\n\\t\\t\\trep(j, v[i].size()) {\\n\\t\\t\\t\\tcout << v[i][j] << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\tcout << \\\"\\\\n\\\";\\n\\t\\t}*/\\n\\t}\\n\\t//cout << \\\"?? \\\" << v[0].size() << \\\"\\\\n\\\";\\n\\tvector<int> ans(1<<n);\\n\\trep(i, (1 << n)) {\\n\\t\\tans[v[0][i]] = i;\\n\\t}\\n\\tcout << \\\"!\\\";\\n\\trep(i, (1 << n)) {\\n\\t\\tcout << \\\" \\\" << ans[i] + 1;\\n\\t}\\n\\tcout << endl;\\n}\\n\\n\\n\\n\\n\\nsigned main() {\\n\\t//ios::sync_with_stdio(false);\\n\\t//cin.tie(0);\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -1.0256,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3175_4846649\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> l_l;\\ntypedef pair<int, int> i_i;\\ntemplate<class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nconst long long INF = 1e18;\\n//const ll mod = 1000000007;\\n\\nconst ll LOCAL = 0;\\nll N;\\nll C[3000];\\nll A[3000];\\nvector<ll> ANS;\\nvector<vector<ll>> v;\\nvector<ll> ans;\\nint Timer = 0;\\n\\nvoid printans() {\\n assert(v.size() == 1);\\n for(int i = 0; i < N; i++) {\\n for(int j = 0; j < N; j++) {\\n if(v[0][j] == i) ans.push_back(j);\\n }\\n }\\n cout << \\\"!\\\";\\n for(auto tmp : ans) {\\n cout << \\\" \\\" << tmp + 1;\\n }\\n cout << endl;\\n if(LOCAL) {\\n for(int i = 0; i < N; i++) {\\n cerr << ANS[v[0][i]] << \\\" \\\";\\n }\\n cerr << endl;\\n for(int i = 0; i < N; i++) {\\n assert(ANS[v[0][i]] == i);\\n assert(ans[i] == ANS[i]);\\n }\\n }\\n}\\n\\nvoid ask() {\\n if(LOCAL) {\\n Timer++;\\n assert(Timer <= 60);\\n for(int i = 0; i < N; i++) C[i] = 0;\\n for(int i = 0; i < N; i++) {\\n if(ANS[A[i]] > ANS[i]) C[A[i]]++;\\n }\\n } else {\\n cout << \\\"?\\\";\\n for(int i = 0; i < N; i++) {\\n cout << \\\" \\\" << A[i] + 1;\\n }\\n cout << endl;\\n for(int i = 0; i < N; i++) {\\n cin >> C[i];\\n }\\n }\\n}\\n\\ntypedef pair<vector<ll>, vector<ll>> V_V;\\nint needed = 0;\\n\\nvector<ll> g(V_V V, vector<ll> ok) {\\n vector<ll> ret;\\n l_l idx = {0, 0};\\n while(idx.first != V.first.size() or idx.second != V.second.size()) {\\n if(idx.first == V.first.size()) {\\n ret.push_back(V.second[idx.second]);\\n idx.second++;\\n continue;\\n }\\n if(idx.second == V.second.size()) {\\n ret.push_back(V.first[idx.first]);\\n idx.first++;\\n continue;\\n }\\n if(ok[idx.first] <= idx.second) {\\n ret.push_back(V.first[idx.first]);\\n idx.first++;\\n continue;\\n }\\n if(ok[idx.first] > idx.second) {\\n ret.push_back(V.second[idx.second]);\\n idx.second++;\\n continue;\\n }\\n assert(0);\\n }\\n return ret;\\n}\\n\\nvector<vector<ll>> f(vector<V_V> V) {\\n /*\\n for(auto tmp : V) {\\n for(auto tmp2 : tmp.first) cerr << ANS[tmp2] << \\\" \\\";\\n cerr << endl;\\n for(auto tmp2 : tmp.second) cerr << ANS[tmp2] << \\\" \\\";\\n cerr << endl;\\n cerr << endl;\\n }\\n */\\n vector<vector<ll>> ok, ng;\\n ok.resize(V.size(), vector<ll>(V[0].first.size(), 0));\\n ng.resize(V.size(), vector<ll>(V[0].first.size(), V[0].first.size() + 1));\\n needed++;\\n for(int _ = 0; _ < needed; _++) {\\n vector<vector<ll>> mid;\\n mid.resize(V.size());\\n for(int i = 0; i < mid.size(); i++) {\\n mid[i].resize(V[0].first.size());\\n for(int j = 0; j < mid[i].size(); j++) {\\n mid[i][j] = (ok[i][j] + ng[i][j]) / 2;\\n chmax(mid[i][j], 1LL);\\n A[V[i].first[j]] = V[i].second[mid[i][j]-1];\\n }\\n }\\n for(int i = 0; i < mid.size(); i++) {\\n for(int j = 0; j < mid[i].size(); j++) {\\n A[V[i].second[j]] = V[i].second[j];\\n }\\n }\\n ask();\\n for(int i = 0; i < mid.size(); i++) {\\n for(int j = 0; j < mid[i].size(); j++) {\\n if(C[A[V[i].first[j]]]) {\\n C[A[V[i].first[j]]]--;\\n ng[i][j] = mid[i][j];\\n } else {\\n ok[i][j] = mid[i][j];\\n }\\n }\\n }\\n /*\\n cerr << \\\"midsize: \\\" << mid.size() << endl;\\n for(int i = 0; i < mid.size(); i++) {\\n for(int j = 0; j < mid[i].size(); j++) {\\n cerr << \\\"{\\\" << ok[i][j] << \\\", \\\" << ng[i][j] << \\\"} \\\";\\n }\\n cerr << endl;\\n }\\n */\\n }\\n vector<vector<ll>> ret;\\n for(int i = 0; i < V.size(); i++) {\\n auto tmp = g(V[i], ok[i]);\\n ret.push_back(tmp);\\n }\\n return ret;\\n}\\n\\nint main() {\\n cin >> N;\\n N = (1 << N);\\n if(LOCAL) {\\n ANS.resize(N);\\n for(int i = 0; i < N; i++) {\\n ANS[i] = i;\\n }\\n std::random_device seed_gen;\\n std::mt19937 engine(seed_gen());\\n std::shuffle(ANS.begin(), ANS.end(), engine);\\n /*\\n for(auto tmp : ANS) cerr << tmp << \\\" \\\";\\n cerr << endl;\\n */\\n }\\n for(int i = 0; i < N; i++) {\\n v.push_back({i});\\n }\\n for(int _ = 0; ; _++) {\\n if(v.size() == 1) break;\\n vector<pair<vector<ll>, vector<ll>>> V;\\n for(int i = 0; i < v.size(); i += 2) {\\n V.push_back({v[i], v[i+1]});\\n }\\n v = f(V);\\n }\\n printans();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3724,\n \"score_of_the_acc\": -0.5056,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3175_4846518\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int_fast32_t int32;\\ntypedef int_fast64_t int64;\\n\\nconst int32 inf = 1e9+7;\\nconst int32 MOD = 1000000007;\\nconst int64 llinf = 1e18;\\n\\n#define YES(n) cout << ((n) ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\" )\\n#define Yes(n) cout << ((n) ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\" )\\n#define POSSIBLE(n) cout << ((n) ? \\\"POSSIBLE\\\\n\\\" : \\\"IMPOSSIBLE\\\\n\\\" )\\n#define ANS(n) cout << (n) << \\\"\\\\n\\\"\\n#define REP(i,n) for(int64 i=0;i<(n);++i)\\n#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)\\n#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)\\n#define all(obj) (obj).begin(),(obj).end()\\n#define rall(obj) (obj).rbegin(),(obj).rend()\\n#define fi first\\n#define se second\\n#define pb(a) push_back(a)\\ntypedef pair<int32,int32> pii;\\ntypedef pair<int64,int64> pll;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) {\\n if (a < b) { a = b; return true; } return false;\\n}\\ntemplate<class T> inline bool chmin(T& a, T b) {\\n if (a > b) { a = b; return true; } return false;\\n}\\n\\nint32 n;\\nvector<int32> a;\\nvector<int32> c;\\nvector<set<int32>> large;\\nvector<int32> indeg;\\n\\nvector<int32> topological_sort(vector<set<int32>> G, vector<int32> indegree, int32 V) {\\n // トポロジカルソートを記録する配列\\n vector<int32> sorted_vertices;\\n\\n // 入次数が0の頂点を発見したら、処理待ち頂点としてキューに追加する\\n queue<int> que;\\n for (int i = 0; i < V; i++) {\\n if (indegree[i] == 0) {\\n que.push(i);\\n }\\n }\\n\\n // キューが空になるまで、操作1~3を繰り返す\\n while (que.empty() == false) {\\n // キューの先頭の頂点を取り出す\\n int v = que.front();\\n que.pop();\\n\\n // その頂点と隣接している頂点の入次数を減らし、0になればキューに追加\\n for(auto u : G[v]){\\n indegree[u] -= 1;\\n if (indegree[u] == 0) que.push(u);\\n }\\n // 頂点vを配列の末尾に追加する \\n sorted_vertices.push_back(v);\\n }\\n\\n // トポロジカルソートを返す\\n return sorted_vertices;\\n}\\n\\nvoid query(){\\n cout << \\\"?\\\";\\n REP(i,n){\\n cout << \\\" \\\" << a[i]+1;\\n }\\n cout << endl;\\n REP(i,n)cin >> c[i];\\n REP(i,n){\\n if(i == a[i])continue;\\n if(c[a[i]] == 1){\\n if(large[i].count(a[i]) == 0){\\n large[i].insert(a[i]);\\n indeg[a[i]]++;\\n }\\n }else{\\n if(large[a[i]].count(i) == 0){\\n large[a[i]].insert(i);\\n indeg[i]++;\\n }\\n }\\n }\\n}\\n\\nint32 pow2(int32 r){\\n int32 ret = 1;\\n REP(i,r)ret *= 2;\\n return ret;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cin >> n;\\n n = pow2(n);\\n a.resize(n);\\n c.resize(n);\\n large.resize(n);\\n indeg.resize(n,0);\\n REP(i,n)a[i] = (i+1)%n;\\n while(true){\\n query();\\n vector<pii> notyet;\\n vector<int32> topo = topological_sort(large,indeg,n);\\n REP(i,n-1){\\n if(large[topo[i]].count(topo[i+1]) == 0)notyet.emplace_back(topo[i],topo[i+1]);\\n }\\n // REP(v,n){\\n // for(auto u : large[v])cout << v << \\\" \\\" << u << endl;\\n // }\\n // REP(i,n)ANS(indeg[i]);\\n // REP(i,n)cout << \\\" \\\" << topo[i];\\n // cout << endl;\\n if(notyet.empty()){\\n vector<int32> ans(n);\\n REP(i,n){\\n ans[topo[i]] = i;\\n }\\n cout << \\\"!\\\";\\n REP(i,n)cout << \\\" \\\" << ans[i] + 1;\\n cout << endl;\\n return 0;\\n }\\n a = vector<int32>(n,-1);\\n vector<bool> used(n,false);\\n for(auto p : notyet){\\n if(a[p.fi] == -1 && !used[p.se]){\\n a[p.fi] = p.se;\\n used[p.se] = true;\\n }else if(a[p.se] == -1 && !used[p.fi]){\\n a[p.se] = p.fi;\\n used[p.fi] = true;\\n }\\n }\\n int32 j = 0;\\n REP(i,n){\\n if(a[i] == -1){\\n while(used[j])++j;\\n a[i] = j;\\n ++j;\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.3191489361702128,\n \"time_ms\": 40,\n \"memory_kb\": 4656,\n \"score_of_the_acc\": -1,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3175_4845964\",\n \"code_snippet\": \"//#define NDEBUG\\n\\n#pragma region cp_template\\n\\n#include <algorithm>\\n#include <cstddef>\\n#include <cstdint>\\n#include <iostream>\\n#include <utility>\\n#include <vector>\\n\\nnamespace n91 {\\n\\n using i32 = std::int32_t;\\n using i64 = std::int64_t;\\n using u32 = std::uint32_t;\\n using u64 = std::uint64_t;\\n using isize = std::ptrdiff_t;\\n using usize = std::size_t;\\n\\n struct rep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept : i(i) {}\\n void operator++() noexcept { ++i; }\\n constexpr usize operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\\n };\\n const itr f, l;\\n constexpr rep(const usize f, const usize l) noexcept\\n : f(std::min(f, l)), l(l) {}\\n constexpr auto begin() const noexcept { return f; }\\n constexpr auto end() const noexcept { return l; }\\n };\\n struct revrep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept : i(i) {}\\n void operator++() noexcept { --i; }\\n constexpr usize operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\\n };\\n const itr f, l;\\n constexpr revrep(const usize f, const usize l) noexcept\\n : f(l - 1), l(std::min(f, l) - 1) {}\\n constexpr auto begin() const noexcept { return f; }\\n constexpr auto end() const noexcept { return l; }\\n };\\n template <class T> auto md_vec(const usize n, const T& value) {\\n return std::vector<T>(n, value);\\n }\\n template <class... Args> auto md_vec(const usize n, Args... args) {\\n return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));\\n }\\n template <class T> constexpr T difference(const T& a, const T& b) noexcept {\\n return a < b ? b - a : a - b;\\n }\\n template <class T> void chmin(T& a, const T& b) noexcept {\\n if (b < a)\\n a = b;\\n }\\n template <class T> void chmax(T& a, const T& b) noexcept {\\n if (a < b)\\n a = b;\\n }\\n template <class F> class rec_lambda {\\n F f;\\n\\n public:\\n rec_lambda(F&& f) : f(std::move(f)) {}\\n template <class... Args> auto operator()(Args&&... args) const {\\n return f(*this, std::forward<Args>(args)...);\\n }\\n };\\n template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }\\n template <class T> T scan() {\\n T ret;\\n std::cin >> ret;\\n return ret;\\n }\\n constexpr char eoln = '\\\\n';\\n template <class T> T ceildiv(const T& l, const T& r) {\\n return l / r + (l % r != 0 ? 1 : 0);\\n }\\n\\n} // namespace n91\\n\\n#pragma endregion cp_template\\n\\nnamespace n91 {\\n\\n struct sorter {\\n usize n;\\n std::vector<usize> x;\\n // x[i]: 今 i 番目の要素が p の何番目か\\n std::vector<std::pair<usize, usize>> cp;\\n // first < second になるように cas\\n\\n sorter(const usize m) : n(1 << m), x(n), cp() {\\n for (const usize i : rep(0, n)) {\\n x[i] = i;\\n }\\n }\\n\\n void cas(usize less, usize greater) { cp.push_back({ less, greater }); }\\n void flush() {\\n std::vector<usize> a(n);\\n for (const auto& e : cp) {\\n a[x[e.second]] = x[e.first];\\n a[x[e.first]] = x[e.second];\\n }\\n std::cout << \\\"?\\\";\\n for (auto e : a) {\\n std::cout << \\\" \\\" << e + 1;\\n }\\n std::cout << std::endl;\\n std::vector<usize> c(n);\\n for (auto& e : c) {\\n std::cin >> e;\\n }\\n for (const auto& e : cp) {\\n if (c[x[e.first]] == 1) {\\n std::swap(x[e.first], x[e.second]);\\n }\\n }\\n cp.clear();\\n }\\n void print() {\\n std::vector<usize> p(n);\\n for (const usize i : rep(0, n)) {\\n p[x[i]] = i;\\n }\\n std::cout << \\\"!\\\";\\n for (auto e : p) {\\n std::cout << \\\" \\\" << e + 1;\\n }\\n std::cout << std::endl;\\n }\\n };\\n\\n void main_() {\\n /*\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n //*/\\n const usize n = scan<usize>();\\n sorter s(n);\\n for (const usize i : rep(0, n)) {\\n const usize swap_wi = 2 << i;\\n for (const usize j : rep(0, i + 1)) {\\n bool swap_f = true;\\n const usize step = 1 << (i - j);\\n for (const usize k : rep(0, 1 << n)) {\\n if (k % swap_wi == 0) {\\n swap_f = !swap_f;\\n }\\n if (k & step) {\\n usize l = k & ~step;\\n usize r = k;\\n if (swap_f) {\\n std::swap(l, r);\\n }\\n s.cas(l, r);\\n }\\n }\\n s.flush();\\n }\\n }\\n s.print();\\n }\\n\\n} // namespace n91\\n\\nint main() {\\n n91::main_();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -0.4385,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3175_4845701\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <climits>\\n#include <cmath>\\n#include <complex>\\n#include <cstring>\\n#include <deque>\\n#include <functional>\\n#include <iostream>\\n#include <iomanip>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <vector>\\n#include <cstdint>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pii;\\n#define MP make_pair\\n#define PB push_back\\n#define inf 1000000007\\n#define rep(i,n) for(int i = 0; i < (int)(n); ++i)\\n#define all(x) (x).begin(),(x).end()\\n\\ntemplate<typename A, size_t N, typename T>\\nvoid Fill(A (&array)[N], const T &val){\\n std::fill( (T*)array, (T*)(array+N), val );\\n}\\n \\ntemplate<class T> inline bool chmax(T &a, T b){\\n if(a<b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T> inline bool chmin(T &a, T b){\\n if(a>b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\nint n;\\nvector<int> question(vector<int> &a){\\n cout << \\\"? \\\";\\n rep(i,n){\\n cout << a[i+1] << \\\" \\\";\\n }\\n cout << endl;\\n vector<int> b(n+1);\\n rep(i,n){\\n cin >> b[i+1];\\n }\\n return b;\\n}\\nvoid answer(vector<int> &a){\\n cout << \\\"! \\\";\\n rep(i,n){\\n cout << a[i+1] << \\\" \\\";\\n }\\n cout << endl;\\n}\\nint main(){\\n int m;\\n cin >> m;\\n n = (1<<m);\\n vector<int> p(n);\\n vector<vector<int> > q;\\n rep(i,n){\\n p[i] = i+1;\\n vector<int> t;\\n t.push_back(i+1);\\n q.push_back(t);\\n }\\n \\n for(int zz=1;zz<=m;zz++){ \\n vector<vector<int> > A;\\n vector<vector<int> > B;\\n for(int i=0;i<q.size();i+=2){\\n A.push_back(q[i]);\\n B.push_back(q[i+1]);\\n }\\n // cerr << A.size() << endl;\\n // for(auto x:A){\\n // for(auto y:x){\\n // cerr << y << \\\" \\\" ;\\n // }\\n // cerr << endl;\\n // }\\n // cerr << endl;\\n // cerr << B.size() << endl;\\n // for(auto x:B){\\n // for(auto y:x){\\n // cerr << y << \\\" \\\" ;\\n // }\\n // cerr << endl;\\n // }\\n // cerr << endl;\\n for(int j=0;j<zz;j++){\\n vector<int> q(n+1);\\n // sort列 A, B の比較\\n \\n for(int i=0;i<A.size();i++){\\n int len = B[i].size();\\n int Qid = B[i][len/2];\\n for(auto x: A[i]){\\n q[x] = Qid;\\n }\\n\\n }\\n for(int i=0;i<B.size();i++){\\n for(auto x:B[i]){\\n q[x] = x;\\n }\\n }\\n auto X = question(q);\\n \\n vector<vector<int> > P;\\n vector<vector<int> > Q;\\n \\n for(int i=0;i<A.size();i++){\\n int len = B[i].size();\\n int Qid = B[i][len/2];\\n int cnt = X[Qid];\\n vector<int> pp[2];\\n for(int k = 0; k<A[i].size();k++){\\n if(k < cnt){\\n pp[0].push_back(A[i][k]);\\n }else{\\n pp[1].push_back(A[i][k]);\\n }\\n }\\n vector<int> qq[2];\\n for(int k=0;k<B[i].size();k++){\\n if(k<len/2||len==1){\\n qq[0].push_back(B[i][k]);\\n }else{\\n qq[1].push_back(B[i][k]);\\n }\\n }\\n P.push_back(pp[0]);\\n P.push_back(pp[1]); \\n Q.push_back(qq[0]);\\n Q.push_back(qq[1]);\\n } \\n swap(A,P);\\n swap(B,Q);\\n } \\n // cerr << \\\"TEST\\\" << endl;\\n // cerr << A.size() << endl;\\n // for(auto x:A){\\n // for(auto y:x){\\n // cerr << y << \\\" \\\" ;\\n // }\\n // cerr << endl;\\n // }\\n // cerr << endl;\\n // cerr << B.size() << endl;\\n // for(auto x:B){\\n // for(auto y:x){\\n // cerr << y << \\\" \\\" ;\\n // }\\n // cerr << endl;\\n // }\\n // cerr << endl;\\n \\n vector<vector<int> > qqq;\\n for(int k=0;k<(n)/(1<<zz);k++){\\n vector<int> qq;\\n for(int i=0;i<(1<<(zz));i++){\\n // i + k*(1<<zz) \\n for(auto x:A[i + k*(1<<(zz))]){\\n qq.push_back(x);\\n }\\n for(auto x:B[i + k*(1<<(zz))]){\\n qq.push_back(x);\\n }\\n }\\n qqq.push_back(qq);\\n }\\n swap(q,qqq);\\n }\\n vector<int> pppp(n+1);\\n for(int i=0;i<q[0].size();i++){\\n pppp[q[0][i]] = i+ 1;\\n }\\n answer(pppp);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3676,\n \"score_of_the_acc\": -0.4673,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3175_4845697\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n//#include \\\"atcoder/all\\\"\\n//using namespace atcoder;\\n#include <bits/stdc++.h>\\n#define int long long\\n#define ll long long\\nusing ull = unsigned long long;\\nusing namespace std;\\n#define dump(x) \\\\\\n if (dbg) { \\\\\\n cerr << #x << \\\" = \\\" << (x) << endl; \\\\\\n }\\n#define overload4(_1, _2, _3, _4, name, ...) name\\n#define FOR1(n) for (ll i = 0; i < (n); ++i)\\n#define FOR2(i, n) for (ll i = 0; i < (n); ++i)\\n#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)\\n#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))\\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\\n#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)\\n#define bit(n, k) (((n) >> (k)) & 1) /*nのk bit目*/\\nnamespace mydef {\\nconst int INF = 1ll << 60;\\nconst int MOD = 1e9 + 7;\\ntemplate <class T>\\nbool chmin(T& a, const T& b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n } else\\n return 0;\\n}\\ntemplate <class T>\\nbool chmax(T& a, const T& b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n } else\\n return 0;\\n}\\nvoid Yes(bool flag = true) {\\n if (flag)\\n cout << \\\"Yes\\\" << endl;\\n else\\n cout << \\\"No\\\" << endl;\\n}\\nvoid No(bool flag = true) {\\n Yes(!flag);\\n}\\nvoid YES(bool flag = true) {\\n if (flag)\\n cout << \\\"YES\\\" << endl;\\n else\\n cout << \\\"NO\\\" << endl;\\n}\\nvoid NO(bool flag = true) {\\n YES(!flag);\\n}\\ntemplate <typename A, size_t N, typename T>\\nvoid Fill(A (&array)[N], const T& val) {\\n std::fill((T*)array, (T*)(array + N), val);\\n}\\nbool dbg = true;\\n} // namespace mydef\\nusing namespace mydef;\\n#define pb push_back\\n//#define mp make_pair\\n#define eb emplace_back\\n#define lb lower_bound\\n#define ub upper_bound\\n#define all(v) (v).begin(), (v).end()\\n#define SZ(x) ((int)(x).size())\\n#define vi vector<int>\\n#define vvi vector<vector<int>>\\n#define vp vector<pair<int, int>>\\n#define vvp vector<vector<pair<int, int>>>\\n#define pi pair<int, int>\\n//#define P pair<int, int>\\n//#define V vector<int>\\n//#define S set<int>\\n#define asn ans\\n\\nvi query;\\nint N;\\n\\ntemplate <typename T>\\nstruct edge {\\n int to, id;\\n T cost;\\n edge(int to) : to(to), id(-1), cost(1) {}\\n edge(int to, T cost) : to(to), id(-1), cost(cost) {}\\n edge(int to, T cost, int id) : to(to), id(id), cost(cost) {}\\n operator int() const { return to; }\\n /*\\n edge& operator=(const int& x) {\\n to = x;\\n return *this;\\n }\\n */\\n};\\ntemplate <typename T>\\nclass Graph : public vector<vector<edge<T>>> {\\n //--------Basic--------\\nprivate:\\n using Edge = edge<T>;\\n int M; //M:辺の数\\n bool undirected = false;\\n bool directed = false;\\n bool unweighted = false;\\n bool weighted = false;\\n bool tree = false;\\n //\\npublic:\\n vector<int> A, B;\\n vector<T> C;\\n //\\npublic:\\n Graph() = default;\\n //unweighted\\n void add_edge_undirected(int u, int v, int id = -1) {\\n assert(!directed);\\n assert(!weighted);\\n undirected = true;\\n unweighted = true;\\n (*this)[u].emplace_back(Edge{v, 1, id});\\n (*this)[v].emplace_back(Edge{u, 1, id});\\n }\\n void build_undirected(int m) {\\n assert(!(*this).empty());\\n assert(!directed);\\n assert(!weighted);\\n undirected = true;\\n unweighted = true;\\n M = m;\\n A.resize(m);\\n B.resize(m);\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n cin >> u >> v;\\n u--;\\n v--;\\n A[i] = u;\\n B[i] = v;\\n (*this)[u].emplace_back(Edge{v, 1, i});\\n (*this)[v].emplace_back(Edge{u, 1, i});\\n }\\n }\\n void build_undirected(int n, int m) {\\n (*this).resize(n);\\n build_undirected(m);\\n }\\n void add_edge_directed(int u, int v, int id = -1) {\\n assert(!undirected);\\n assert(!weighted);\\n directed = true;\\n unweighted = true;\\n (*this)[u].emplace_back(Edge{v, 1, id});\\n }\\n void build_directed(int m) {\\n assert(!(*this).empty());\\n assert(!undirected);\\n assert(!weighted);\\n directed = true;\\n unweighted = true;\\n M = m;\\n A.resize(M);\\n B.resize(M);\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n cin >> u >> v;\\n u--;\\n v--;\\n A[i] = u;\\n B[i] = v;\\n (*this)[u].emplace_back(Edge{v, 1, i});\\n }\\n }\\n void build_directed(int n, int m) {\\n (*this).resize(n);\\n build_directed(m);\\n }\\n //weighed\\n void add_edge_undirected_weighed(int u, int v, T cost, int id = -1) {\\n assert(!directed);\\n assert(!unweighted);\\n undirected = true;\\n weighted = true;\\n (*this)[u].emplace_back(Edge{v, cost, id});\\n (*this)[v].emplace_back(Edge{u, cost, id});\\n }\\n void build_undirected_weighted(int m) {\\n assert(!(*this).empty());\\n assert(!directed);\\n assert(!unweighted);\\n undirected = true;\\n weighted = true;\\n M = m;\\n A.resize(m);\\n B.resize(m);\\n C.resize(m);\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n T cost;\\n cin >> u >> v >> cost;\\n u--;\\n v--;\\n A[i] = u;\\n B[i] = v;\\n C[i] = cost;\\n (*this)[u].emplace_back(Edge{v, cost, i});\\n (*this)[v].emplace_back(Edge{u, cost, i});\\n }\\n }\\n void build_undirected_weighted(int n, int m) {\\n (*this).resize(n);\\n build_undirected_weighted(m);\\n }\\n void add_edge_directed_weighted(int u, int v, T cost, int id = -1) {\\n assert(!undirected);\\n assert(!unweighted);\\n directed = true;\\n weighted = true;\\n (*this)[u].emplace_back(Edge{v, cost, id});\\n }\\n void build_directed_weighted(int m) {\\n assert(!(*this).empty());\\n assert(!undirected);\\n assert(!unweighted);\\n directed = true;\\n weighted = true;\\n M = m;\\n A.resize(m);\\n B.resize(m);\\n C.resize(m);\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n T cost;\\n cin >> u >> v >> cost;\\n u--;\\n v--;\\n A[i] = u;\\n B[i] = v;\\n C[i] = cost;\\n (*this)[u].emplace_back(Edge{v, cost, i});\\n }\\n }\\n void build_directed_weighted(int n, int m) {\\n (*this).resize(n);\\n build_directed_weighted(m);\\n }\\n void build(vector<vector<int>> G) {\\n int N = G.size();\\n (*this).resize(N);\\n for (int i = 0; i < N; i++) {\\n for (auto& x : G[i]) {\\n add_edge_directed(i, x);\\n }\\n }\\n }\\n //tree\\n void istree() {\\n tree = true;\\n }\\n void build_tree(int n) {\\n istree();\\n build_undirected(n, n - 1);\\n }\\n void build_tree_weighted(int n) {\\n istree();\\n build_undirected_weighted(n, n - 1);\\n }\\n //print state\\n void state() {\\n cerr << endl\\n << \\\"Print State\\\" << endl\\n << \\\"Edge :\\\" << endl\\n << \\\" Directed : \\\" << (directed ? \\\"Yes\\\" : \\\"No\\\") << endl\\n << \\\" Undirected : \\\" << (undirected ? \\\"Yes\\\" : \\\"No\\\") << endl\\n << \\\" Weighted : \\\" << (weighted ? \\\"Yes\\\" : \\\"No\\\") << endl\\n << \\\" Unweighted : \\\" << (unweighted ? \\\"Yes\\\" : \\\"No\\\") << endl\\n << \\\" Tree : \\\" << (tree ? \\\"Yes\\\" : \\\"No\\\") << endl\\n << \\\"Test\\\" << endl\\n << \\\" test_bipartite(verified) : Yes\\\" << endl\\n << \\\"Usable Functions : Graph\\\" << endl\\n << \\\" Dijkstra(verified) : Yes\\\" << endl\\n << \\\" Warshall–Floyd(verified) : Yes\\\" << endl\\n << \\\" Kruskal(verified) : Yes\\\" << endl\\n << \\\" TopologicalSort(verified) : Yes\\\" << endl\\n << \\\" StronglyConnectedComponent(unverified): \\\" << (StronglyConnectedComponent_ready ? \\\"Yes\\\" : \\\"No\\\") << endl\\n << \\\"Usable Funcitons : Tree\\\" << endl\\n << \\\" ReRooting(verified) : Yes\\\" << endl;\\n }\\n //\\n //--------union-find tree--------\\n struct UnionFind {\\n vector<int> data;\\n UnionFind(int n) {\\n data.assign(n, -1);\\n }\\n bool unite(int x, int y) {\\n x = root(x), y = root(y);\\n if (x == y)\\n return (false);\\n if (data[x] > data[y])\\n swap(x, y);\\n data[x] += data[y];\\n data[y] = x;\\n return (true);\\n }\\n int root(int k) {\\n if (data[k] < 0)\\n return (k);\\n return (data[k] = root(data[k]));\\n }\\n bool same(int x, int y) {\\n return root(x) == root(y);\\n }\\n int size(int k) {\\n return (-data[root(k)]);\\n }\\n };\\n //\\n //--------test_bipartite--------\\n //verified\\npublic:\\n bool test_bipartite() {\\n int N = (*this).size();\\n UnionFind uf(N * 2);\\n for (int i = 0; i < N; i++) {\\n for (auto& e : (*this)[i]) {\\n uf.unite(i, e.to + N);\\n uf.unite(i + N, e.to);\\n }\\n }\\n for (int i = 0; i < N; i++) {\\n if (uf.same(i, i + N))\\n return false;\\n }\\n return true;\\n }\\n //\\n //--------reverse--------\\npublic:\\n void reverse() {\\n int N = (*this).size();\\n vector<pair<int, Edge>> V;\\n V.reserve(M);\\n for (int i = 0; i < N; i++) {\\n for (auto& e : (*this)[i]) {\\n V.emplace_back(make_pair(i, e));\\n }\\n }\\n (*this).erase((*this).begin(), (*this).end());\\n (*this).resize(N);\\n for (auto& p : V)\\n (*this)[p.second.to].emplace_back(Edge{p.first, p.second.cost, p.second.id});\\n }\\n //\\n //--------Dijkstra--------\\n //verified\\npublic:\\n //pair<vector<T>, vector<int>> Dijkstra(int s) {\\n vector<T> Dijkstra(int s) {\\n const T INF = numeric_limits<T>::max() / 5;\\n using P = pair<T, int>;\\n int N = (*this).size();\\n vector<T> dist(N, INF);\\n //vector<int> bef(N, -1);\\n priority_queue<P, vector<P>, greater<P>> que;\\n dist[s] = 0;\\n que.emplace(dist[s], s);\\n while (!que.empty()) {\\n P p = que.top();\\n que.pop();\\n int now = p.second;\\n if (dist[now] < p.first)\\n continue;\\n for (auto& p : (*this)[now]) {\\n int nxt = p.to;\\n T cost = p.cost;\\n if (dist[nxt] > dist[now] + cost) {\\n dist[nxt] = dist[now] + cost;\\n //bef[nxt] = now;\\n que.emplace(dist[nxt], nxt);\\n }\\n }\\n }\\n return dist;\\n //return make_pair(dist, bef);\\n }\\n //\\n //\\n //--------Warshall–Floyd--------\\n //verified\\npublic:\\n vector<vector<T>> WarshallFloyd() {\\n int N = (*this).size();\\n const T INF = numeric_limits<T>::max() / 3;\\n vector<vector<T>> ret(N, vector<T>(N, INF));\\n for (int i = 0; i < N; i++) {\\n for (auto& e : (*this)[i]) {\\n ret[i][e.to] = e.cost;\\n }\\n ret[i][i] = 0;\\n }\\n for (int k = 0; k < N; k++) {\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if (ret[i][j] > ret[i][k] + ret[k][j])\\n ret[i][j] = ret[i][k] + ret[k][j];\\n }\\n }\\n }\\n return ret;\\n }\\n //\\n //\\n //--------Kruskal--------\\n //verified\\nprivate:\\n vector<int> Kruskal_data;\\n bool Kruskal_unite(int x, int y) {\\n x = Kruskal_root(x), y = Kruskal_root(y);\\n if (x == y)\\n return (false);\\n if (Kruskal_data[x] > Kruskal_data[y])\\n swap(x, y);\\n Kruskal_data[x] += Kruskal_data[y];\\n Kruskal_data[y] = x;\\n return (true);\\n }\\n int Kruskal_root(int k) {\\n if (Kruskal_data[k] < 0)\\n return (k);\\n return (Kruskal_data[k] = Kruskal_root(Kruskal_data[k]));\\n }\\n bool Kruskal_same(int x, int y) {\\n return Kruskal_root(x) == Kruskal_root(y);\\n }\\n int Kruskal_size(int k) {\\n return (-Kruskal_data[Kruskal_root(k)]);\\n }\\n //\\npublic:\\n template <class Compare = less<T>>\\n pair<T, vector<bool>> Kruskal(bool flag = false) {\\n struct edge2 {\\n int from, to;\\n T cost;\\n bool used;\\n int id;\\n edge2(int from, int to, T cost, int id) : from(from), to(to), cost(cost), used(false), id(id) {}\\n };\\n vector<edge2> edges;\\n int N = (*this).size();\\n Kruskal_data.assign(N, -1);\\n for (int i = 0; i < (int)(*this).size(); i++) {\\n auto& V = (*this)[i];\\n for (auto& e : V) {\\n edges.emplace_back(i, e.to, e.cost, e.id);\\n }\\n }\\n sort(edges.begin(), edges.end(), [](const edge2& a, const edge2& b) {\\n return Compare()(a.cost, b.cost);\\n });\\n T ret = 0;\\n vector<bool> V;\\n if (flag)\\n V.resize(M, false);\\n for (auto& e : edges) {\\n if (Kruskal_unite(e.from, e.to)) {\\n ret += e.cost;\\n e.used = true;\\n }\\n }\\n if (flag)\\n for (auto& e : edges) {\\n assert(e.id >= 0 && e.id < M);\\n if (e.used)\\n V[e.id] = true;\\n }\\n if (N == Kruskal_size(0))\\n return make_pair(ret, V);\\n else\\n return make_pair(-1, V);\\n }\\n //\\n //--------StronglyConnectedComponent--------\\n //Unverified\\npublic:\\n vector<vector<int>> SCC_R, SCC_T;\\n //\\nprivate:\\n bool StronglyConnectedComponent_ready = false;\\n vector<int> SCC_cmp, SCC_ord;\\n vector<bool> SCC_used;\\n //\\npublic:\\n int Gbuild_SCC() {\\n cerr << \\\"Please Verify\\\" << endl;\\n assert(!undirected);\\n assert(directed);\\n int N = (*this).size();\\n SCC_R.resize(N);\\n for (int i = 0; i < N; i++) {\\n for (auto& x : (*this)[i]) {\\n SCC_R[x].emplace_back(i);\\n }\\n }\\n SCC_cmp.resize(N);\\n fill(SCC_cmp.begin(), SCC_cmp.end(), -1);\\n SCC_used.resize(N);\\n fill(SCC_used.begin(), SCC_used.end(), false);\\n StronglyConnectedComponent_ready = true;\\n return build_StronglyConnectedComponent_init();\\n }\\n int SCC(int k) {\\n assert(StronglyConnectedComponent_ready);\\n return SCC_cmp[k];\\n }\\n //\\nprivate:\\n void build_StronglyConnectedComponent_dfs(int now) {\\n if (SCC_used[now])\\n return;\\n SCC_used[now] = true;\\n for (auto nxt : (*this)[now])\\n build_StronglyConnectedComponent_dfs(nxt);\\n SCC_ord.emplace_back(now);\\n }\\n void build_StronglyConnectedComponent_rdfs(int now, int count) {\\n if (SCC_cmp[now] != -1)\\n return;\\n SCC_cmp[now] = count;\\n for (auto to : SCC_R[now])\\n build_StronglyConnectedComponent_rdfs(to, count);\\n }\\n int build_StronglyConnectedComponent_init() {\\n int n = (int)(*this).size();\\n for (int i = 0; i < n; i++)\\n build_StronglyConnectedComponent_dfs(i);\\n std::reverse(SCC_ord.begin(), SCC_ord.end());\\n int group = 0;\\n for (auto& i : SCC_ord) {\\n if (SCC_cmp[i] == -1) {\\n build_StronglyConnectedComponent_rdfs(i, group);\\n group++;\\n }\\n }\\n SCC_T.resize(group);\\n for (int i = 0; i < n; i++) {\\n for (auto& to : (*this)[i]) {\\n int s = SCC_cmp[i], t = SCC_cmp[to];\\n if (s != t)\\n SCC_T[s].emplace_back(t);\\n }\\n }\\n return group;\\n }\\n //\\n //\\n //\\n //--------TopologicalSort--------\\n //verified\\npublic:\\n vector<int> TopologicalSort() {\\n assert(!undirected);\\n int N = (*this).size();\\n vector<int> deg(N);\\n for (auto& V : (*this))\\n for (auto& e : V)\\n deg[e.to]++;\\n queue<int> st;\\n for (int i = 0; i < N; i++)\\n if (deg[i] == 0)\\n st.push(i);\\n vector<int> ret;\\n ret.reserve(N);\\n while (!st.empty()) {\\n auto x = st.front();\\n st.pop();\\n ret.emplace_back(x);\\n if (st.empty()) {\\n query[x] = x;\\n } else {\\n query[x] = st.front();\\n }\\n for (auto& e : (*this)[x])\\n if (--deg[e.to] == 0)\\n st.push(e.to);\\n }\\n return ret;\\n }\\n //\\n //\\n //--------Tree--------\\n //\\n //\\n //--------ReRooting--------\\npublic:\\n template <typename sum_t>\\n pair<vector<sum_t>, vector<vector<sum_t>>>\\n Tbuild_ReRooting(\\n const function<sum_t(sum_t, sum_t)> f,\\n const function<sum_t(sum_t, Edge)> gg,\\n sum_t ident) {\\n assert(tree);\\n int N = (*this).size();\\n vector<sum_t> subdp(N, ident), dp(N, ident);\\n vector<vector<sum_t>> g_dp(N), g_ndp(N), memo(N);\\n vector<vector<bool>> seen(N);\\n for (int i = 0; i < N; i++) {\\n int S = (*this)[i].size();\\n g_dp[i].resize(S, ident);\\n g_ndp[i].resize(S, ident);\\n memo[i].resize(S);\\n seen[i].resize(S, false);\\n }\\n stack<int> stk;\\n stk.push(0);\\n vector<int> par(N), ord(N);\\n int index = 0;\\n par[0] = -1;\\n while (!stk.empty()) {\\n int node = stk.top();\\n stk.pop();\\n ord[index++] = node;\\n for (auto& e : (*this)[node]) {\\n if (e.to == par[node])\\n continue;\\n stk.push(e.to);\\n par[e.to] = node;\\n }\\n }\\n for (int k = ord.size() - 1; k >= 0; k--) {\\n int idx = ord[k];\\n for (int i = 0; i < (int)((*this)[idx].size()); i++) {\\n auto& e = (*this)[idx][i];\\n if (e.to == par[idx])\\n continue;\\n if (!seen[idx][i]) {\\n memo[idx][i] = gg(subdp[e.to], e);\\n seen[idx][i] = true;\\n }\\n subdp[idx] = f(subdp[idx], memo[idx][i]);\\n }\\n }\\n vector<sum_t> top(N, ident);\\n for (int k = 0; k < (int)(ord.size()); k++) {\\n int idx = ord[k];\\n sum_t buff{ident};\\n for (int i = 0; i < (int)((*this)[idx].size()); i++) {\\n auto& e = (*this)[idx][i];\\n g_ndp[idx][i] = buff;\\n if (!seen[idx][i]) {\\n memo[idx][i] = gg(par[idx] == e.to ? top[idx] : subdp[e.to], e);\\n seen[idx][i] = true;\\n }\\n g_dp[idx][i] = memo[idx][i];\\n buff = f(buff, g_dp[idx][i]);\\n }\\n dp[idx] = buff;\\n buff = ident;\\n for (int i = (*this)[idx].size() - 1; i >= 0; i--) {\\n auto& e = (*this)[idx][i];\\n if (e.to != par[idx])\\n top[e.to] = f(g_ndp[idx][i], buff);\\n g_ndp[idx][i] = f(g_ndp[idx][i], buff);\\n buff = f(buff, g_dp[idx][i]);\\n }\\n }\\n return make_pair(dp, memo);\\n }\\n //\\n //\\n //\\n //TODO:lca,centroid,diameter,hl-decomposition\\n};\\n//グローバルでの使用のみ想定\\n\\nGraph<int> G;\\nint NN;\\n\\nvoid solve() {\\n NN = (1 << N);\\n G.resize(NN);\\n query.resize(NN);\\n int TIME = 60;\\n while (TIME--) {\\n //queryを計算\\n auto A = G.TopologicalSort();\\n\\n //queryをチェック\\n bool flag = true;\\n for (int i = 0; i < NN; i++) {\\n if (query[i] != i)\\n flag = false;\\n }\\n\\n if (flag) {\\n //答えを出力\\n vi ans(NN);\\n for (int i = 0; i < NN; i++) {\\n ans[A[i]] = i;\\n }\\n cout << \\\"!\\\";\\n for (auto& x : ans)\\n cout << \\\" \\\" << x + 1;\\n cout << endl;\\n return;\\n }\\n\\n cout << \\\"?\\\";\\n for (auto& x : query)\\n cout << \\\" \\\" << x + 1;\\n cout << endl;\\n\\n vi C(NN);\\n for (int i = 0; i < NN; i++) {\\n cin >> C[i];\\n }\\n\\n for (int i = 0; i < NN; i++) {\\n if (i != query[i]) {\\n if (C[query[i]] == 1) {\\n G.add_edge_directed(i, query[i]);\\n } else {\\n G.add_edge_directed(query[i], i);\\n }\\n }\\n }\\n }\\n assert(false);\\n}\\n\\nsigned main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n cin >> N;\\n\\n\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.3191489361702128,\n \"time_ms\": 40,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": 0,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3175_4845551\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing uint = unsigned;\\nusing pcc = pair<char, char>;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pdd = pair<ld, ld>;\\nusing tuplis = array<ll, 3>;\\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\\nconst ll LINF=0x1fffffffffffffff;\\nconst ll MINF=0x7fffffffffff;\\nconst int INF=0x3fffffff;\\nconst int MOD=1000000007;\\nconst int MODD=998244353;\\nconst ld DINF=numeric_limits<ld>::infinity();\\nconst ld EPS=1e-9;\\nconst ld PI=3.1415926535897932;\\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\\n#define overload4(_1,_2,_3,_4,name,...) name\\n#define overload3(_1,_2,_3,name,...) name\\n#define rep1(n) for(ll i=0;i<n;++i)\\n#define rep2(i,n) for(ll i=0;i<n;++i)\\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\\n#define rrep1(n) for(ll i=n;i--;)\\n#define rrep2(i,n) for(ll i=n;i--;)\\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\\n#define each1(i,a) for(auto&&i:a)\\n#define each2(x,y,a) for(auto&&[x,y]:a)\\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\\n#define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__)\\n#define all1(i) begin(i),end(i)\\n#define all2(i,a) begin(i),begin(i)+a\\n#define all3(i,a,b) begin(i)+a,begin(i)+b\\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\\n#define rall1(i) (i).rbegin(),(i).rend()\\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\\n#define Msum(...) accumulate(all(__VA_ARGS__),0_M)\\n#define elif else if\\n#define unless(a) if(!(a))\\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\\n#define Sort(a) sort(all(a))\\n#define Rev(a) reverse(all(a))\\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type>name(size);in(name)\\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\\nll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }\\nll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\\nvector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }\\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\\nmap<ll,ll> factor_map(ull x){ map<ll,ll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans[i] = 1; while((x /= i) % i == 0) ans[i]++; } if(x != 1) ans[x] = 1; return ans; }\\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\\ntemplate<class T> unordered_map<T, ll> press(vector<T> a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\\ntemplate<class T> map<T, ll> press_map(vector<T> a){ Uniq(a); map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\\nint scan(){ return getchar(); }\\nvoid scan(int& a){ scanf(\\\"%d\\\", &a); }\\nvoid scan(unsigned& a){ scanf(\\\"%u\\\", &a); }\\nvoid scan(long& a){ scanf(\\\"%ld\\\", &a); }\\nvoid scan(long long& a){ scanf(\\\"%lld\\\", &a); }\\nvoid scan(unsigned long long& a){ scanf(\\\"%llu\\\", &a); }\\nvoid scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\\\\n'); }\\nvoid scan(float& a){ scanf(\\\"%f\\\", &a); }\\nvoid scan(double& a){ scanf(\\\"%lf\\\", &a); }\\nvoid scan(long double& a){ scanf(\\\"%Lf\\\", &a); }\\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\\nvoid scan(char a[]){ scanf(\\\"%s\\\", a); }\\nvoid scan(string& a){ cin >> a; }\\ntemplate<class T> void scan(vector<T>&);\\ntemplate<class T, size_t size> void scan(array<T, size>&);\\ntemplate<class T, class L> void scan(pair<T, L>&);\\ntemplate<class T, size_t size> void scan(T(&)[size]);\\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\\ntemplate<class T> void scan(T& a){ cin >> a; }\\nvoid in(){}\\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\\nvoid print(){ putchar(' '); }\\nvoid print(bool a){ printf(\\\"%d\\\", a); }\\nvoid print(int a){ printf(\\\"%d\\\", a); }\\nvoid print(unsigned a){ printf(\\\"%u\\\", a); }\\nvoid print(long a){ printf(\\\"%ld\\\", a); }\\nvoid print(long long a){ printf(\\\"%lld\\\", a); }\\nvoid print(unsigned long long a){ printf(\\\"%llu\\\", a); }\\nvoid print(char a){ printf(\\\"%c\\\", a); }\\nvoid print(char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(const char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(float a){ printf(\\\"%.15f\\\", a); }\\nvoid print(double a){ printf(\\\"%.15f\\\", a); }\\nvoid print(long double a){ printf(\\\"%.15Lf\\\", a); }\\nvoid print(const string& a){ for(auto&& i : a) print(i); }\\ntemplate<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }\\ntemplate<class T> void print(const vector<T>&);\\ntemplate<class T, size_t size> void print(const array<T, size>&);\\ntemplate<class T, class L> void print(const pair<T, L>& p);\\ntemplate<class T, size_t size> void print(const T (&)[size]);\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\\ntemplate<class T> void print(const T& a){ cout << a; }\\nint out(){ putchar('\\\\n'); return 0; }\\ntemplate<class T> int out(const T& t){ print(t); putchar('\\\\n'); return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\\n#ifdef DEBUG\\ninline ll __lg(ull __n){ return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); }\\n#define debug(...) { print(#__VA_ARGS__); print(\\\":\\\"); out(__VA_ARGS__); }\\n#else\\n#define debug(...) void(0)\\n#endif\\nint first(bool i = true){ return out(i?\\\"first\\\":\\\"second\\\"); }\\nint First(bool i = true){ return out(i?\\\"First\\\":\\\"Second\\\"); }\\nint yes(bool i = true){ return out(i?\\\"yes\\\":\\\"no\\\"); }\\nint Yes(bool i = true){ return out(i?\\\"Yes\\\":\\\"No\\\"); }\\nint No(){ return out(\\\"No\\\"); }\\nint YES(bool i = true){ return out(i?\\\"YES\\\":\\\"NO\\\"); }\\nint NO(){ return out(\\\"NO\\\"); }\\nint Yay(bool i = true){ return out(i?\\\"Yay!\\\":\\\":(\\\"); }\\nint possible(bool i = true){ return out(i?\\\"possible\\\":\\\"impossible\\\"); }\\nint Possible(bool i = true){ return out(i?\\\"Possible\\\":\\\"Impossible\\\"); }\\nint POSSIBLE(bool i = true){ return out(i?\\\"POSSIBLE\\\":\\\"IMPOSSIBLE\\\"); }\\nvoid Case(ll i){ printf(\\\"Case #%lld: \\\", i); }\\n\\n\\nvector<ll>A;\\nvector<ll> query(const vector<ll>&a,const vector<ll>&s){\\n vector<ll>q(a.size());\\n rep(a.size())q[s[i]]=s[a[i]]+1;\\n print(\\\"? \\\");\\n out(q);\\n fflush(stdout);\\n #ifdef DEBUG\\n vec(ll,c,a.size());\\n rep(a.size())if(A[i]<A[q[i]-1])c[q[i]-1]++;\\n #else\\n VEC(ll,c,a.size());\\n #endif\\n vec(ll,d,a.size());\\n rep(a.size())d[i]=c[s[i]];\\n return d;\\n}\\nvoid answer(vector<ll>a){\\n vector<ll>ans(a.size());\\n rep(a.size())ans[a[i]]=i+1;\\n print(\\\"! \\\");\\n out(ans);\\n fflush(stdout);\\n #ifdef DEBUG\\n rep(a.size())assert(A[i]==ans[i]-1);\\n #endif\\n exit(0);\\n}\\nsigned main(){\\n#ifdef DEBUG\\nll n=10;\\nA=iota(1<<n);\\nshuffle(all(A),random_device{});\\n#else\\n LL(n);\\n#endif\\n auto a=iota(1<<n);\\n rep(n){\\n vec(ll,cnt,1<<n);\\n rrep(j,i){\\n vec(ll,q,1<<n);\\n rep(begin,0,1<<n,2<<i){\\n const ll end=begin+(2<<i),cen=begin+(1<<i);\\n rep(at,cen,end){\\n q[at]=at;\\n if(at>>i&1&&(at&(2<<j)-1)==(1<<j)){\\n const ll front=cnt[at-(1<<j)],back=at+(1<<j)==end?1<<i:cnt[at+(1<<j)];\\n rep(i,front,back)q[begin+i]=at;\\n }\\n }\\n }\\n q=query(q,a);\\n rep(begin,0,1<<n,2<<i){\\n const ll end=begin+(2<<i),cen=begin+(1<<i);\\n rep(at,cen,end){\\n if(at>>i&1&&(at&(2<<j)-1)==(1<<j)){\\n rep(i,at,at+(1<<j))cnt[i]+=q[at];\\n }\\n }\\n }\\n }\\n vec(ll,q,1<<n);\\n rep(j,1<<n)q[j]=(j>>i^1)<<i;\\n q=query(q,a);\\n rep(j,1<<i,1<<n,2<<i)cnt[j]=q[j];\\n rep(begin,0,1<<n,2<<i){\\n const ll end=begin+(2<<i),cen=begin+(1<<i);\\n ll at=cen;\\n vec(ll,b,0);\\n rep(j,1<<i){\\n while(at<end&&cnt[at]==j){\\n b.push_back(a[at]);\\n at++;\\n }\\n b.push_back(a[begin+j]);\\n while(at<end&&cnt[at]==j+1){\\n b.push_back(a[at]);\\n at++;\\n }\\n }\\n rep(j,2<<i)a[begin+j]=b[j];\\n }\\n }\\n answer(a);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3644,\n \"score_of_the_acc\": -0.4417,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3175_4845185\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll=long long;\\n#define int ll\\n\\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\\n#define rep(i,b) rng(i,0,b)\\n#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)\\n#define per(i,b) gnr(i,0,b)\\n#define pb push_back\\n#define eb emplace_back\\n#define a first\\n#define b second\\n#define bg begin()\\n#define ed end()\\n#define all(x) x.bg,x.ed\\n#define si(x) int(x.size())\\n#ifdef LOCAL\\n#define dmp(x) cerr<<__LINE__<<\\\" \\\"<<#x<<\\\" \\\"<<x<<endl\\n#else\\n#define dmp(x) void(0)\\n#endif\\n\\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\\n\\ntemplate<class t> using vc=vector<t>;\\ntemplate<class t> using vvc=vc<vc<t>>;\\n\\nusing pi=pair<int,int>;\\nusing vi=vc<int>;\\n\\ntemplate<class t,class u>\\nostream& operator<<(ostream& os,const pair<t,u>& p){\\n\\treturn os<<\\\"{\\\"<<p.a<<\\\",\\\"<<p.b<<\\\"}\\\";\\n}\\n\\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\\n\\tos<<\\\"{\\\";\\n\\tfor(auto e:v)os<<e<<\\\",\\\";\\n\\treturn os<<\\\"}\\\";\\n}\\n\\n#define mp make_pair\\n#define mt make_tuple\\n#define one(x) memset(x,-1,sizeof(x))\\n#define zero(x) memset(x,0,sizeof(x))\\n#ifdef LOCAL\\nvoid dmpr(ostream&os){os<<endl;}\\ntemplate<class T,class... Args>\\nvoid dmpr(ostream&os,const T&t,const Args&... args){\\n\\tos<<t<<\\\" \\\";\\n\\tdmpr(os,args...);\\n}\\n#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)\\n#else\\n#define dmp2(...) void(0)\\n#endif\\n\\nusing uint=unsigned;\\nusing ull=unsigned long long;\\n\\ntemplate<class t,size_t n>\\nostream& operator<<(ostream&os,const array<t,n>&a){\\n\\treturn os<<vc<t>(all(a));\\n}\\n\\ntemplate<int i,class T>\\nvoid print_tuple(ostream&,const T&){\\n}\\n\\ntemplate<int i,class T,class H,class ...Args>\\nvoid print_tuple(ostream&os,const T&t){\\n\\tif(i)os<<\\\",\\\";\\n\\tos<<get<i>(t);\\n\\tprint_tuple<i+1,T,Args...>(os,t);\\n}\\n\\ntemplate<class ...Args>\\nostream& operator<<(ostream&os,const tuple<Args...>&t){\\n\\tos<<\\\"{\\\";\\n\\tprint_tuple<0,tuple<Args...>,Args...>(os,t);\\n\\treturn os<<\\\"}\\\";\\n}\\n\\ntemplate<class t>\\nvoid print(t x,int suc=1){\\n\\tcout<<x;\\n\\tif(suc==1)\\n\\t\\tcout<<\\\"\\\\n\\\";\\n\\tif(suc==2)\\n\\t\\tcout<<\\\" \\\";\\n}\\n\\nll read(){\\n\\tll i;\\n\\tcin>>i;\\n\\treturn i;\\n}\\n\\nvi readvi(int n,int off=0){\\n\\tvi v(n);\\n\\trep(i,n)v[i]=read()+off;\\n\\treturn v;\\n}\\n\\npi readpi(int off=0){\\n\\tint a,b;cin>>a>>b;\\n\\treturn pi(a+off,b+off);\\n}\\n\\ntemplate<class T>\\nvoid print(const vector<T>&v,int suc=1){\\n\\trep(i,v.size())\\n\\t\\tprint(v[i],i==int(v.size())-1?suc:2);\\n}\\n\\nstring readString(){\\n\\tstring s;\\n\\tcin>>s;\\n\\treturn s;\\n}\\n\\ntemplate<class T>\\nT sq(const T& t){\\n\\treturn t*t;\\n}\\n\\n//#define CAPITAL\\nvoid yes(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"YES\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Yes\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid no(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"NO\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"No\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid possible(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"POSSIBLE\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Possible\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid impossible(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"IMPOSSIBLE\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Impossible\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\n\\nconstexpr ll ten(int n){\\n\\treturn n==0?1:ten(n-1)*10;\\n}\\n\\nconst ll infLL=LLONG_MAX/3;\\n\\n#ifdef int\\nconst int inf=infLL;\\n#else\\nconst int inf=INT_MAX/2-100;\\n#endif\\n\\nint topbit(signed t){\\n\\treturn t==0?-1:31-__builtin_clz(t);\\n}\\nint topbit(ll t){\\n\\treturn t==0?-1:63-__builtin_clzll(t);\\n}\\nint botbit(signed a){\\n\\treturn a==0?32:__builtin_ctz(a);\\n}\\nint botbit(ll a){\\n\\treturn a==0?64:__builtin_ctzll(a);\\n}\\nint popcount(signed t){\\n\\treturn __builtin_popcount(t);\\n}\\nint popcount(ll t){\\n\\treturn __builtin_popcountll(t);\\n}\\nbool ispow2(int i){\\n\\treturn i&&(i&-i)==i;\\n}\\nll mask(int i){\\n\\treturn (ll(1)<<i)-1;\\n}\\n\\nbool inc(int a,int b,int c){\\n\\treturn a<=b&&b<=c;\\n}\\n\\ntemplate<class t> void mkuni(vc<t>&v){\\n\\tsort(all(v));\\n\\tv.erase(unique(all(v)),v.ed);\\n}\\n\\nll rand_int(ll l, ll r) { //[l, r]\\n\\t#ifdef LOCAL\\n\\tstatic mt19937_64 gen;\\n\\t#else\\n\\tstatic mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n\\t#endif\\n\\treturn uniform_int_distribution<ll>(l, r)(gen);\\n}\\n\\ntemplate<class t>\\nvoid myshuffle(vc<t>&a){\\n\\trep(i,si(a))swap(a[i],a[rand_int(0,i)]);\\n}\\n\\ntemplate<class t>\\nint lwb(const vc<t>&v,const t&a){\\n\\treturn lower_bound(all(v),a)-v.bg;\\n}\\n\\nvvc<int> readGraph(int n,int m){\\n\\tvvc<int> g(n);\\n\\trep(i,m){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\t//sc.read(a,b);\\n\\t\\ta--;b--;\\n\\t\\tg[a].pb(b);\\n\\t\\tg[b].pb(a);\\n\\t}\\n\\treturn g;\\n}\\n\\nvvc<int> readTree(int n){\\n\\treturn readGraph(n,n-1);\\n}\\n\\nsigned main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(0);\\n\\tcout<<fixed<<setprecision(20);\\n\\t\\n\\tint n;cin>>n;\\n\\tint s=1<<n;\\n\\tvi idx(s);iota(all(idx),0);\\n\\tvvc<pi> a;\\n\\t//x->small\\n\\t//y->large\\n\\tauto waf=[&](int i,int x,int y){\\n\\t\\tif(si(a)<i+1)a.resize(i+1);\\n\\t\\ta[i].eb(x,y);\\n\\t};\\n\\tfor(int w=2;w<=s;w*=2){\\n\\t\\tint off=si(a);\\n\\t\\tbool mode=false;\\n\\t\\tfor(int i=0;i<s;i+=w){\\n\\t\\t\\tint head=off;\\n\\t\\t\\tfor(int h=w/2;h>=1;h/=2){\\n\\t\\t\\t\\tfor(int j=i;j<i+w;j+=2*h){\\n\\t\\t\\t\\t\\tfor(int k=j;k<j+h;k++){\\n\\t\\t\\t\\t\\t\\tif(!mode)waf(head,k,k+h);\\n\\t\\t\\t\\t\\t\\telse waf(head,k+h,k);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\thead++;\\n\\t\\t\\t}\\n\\t\\t\\tmode^=1;\\n\\t\\t}\\n\\t}\\n\\tint L=si(a);\\n\\trep(i,L){\\n\\t\\tassert(si(a[i])==s/2);\\n\\t\\tvi u(s);\\n\\t\\tfor(auto w:a[i]){\\n\\t\\t\\tu[w.a]++;\\n\\t\\t\\tu[w.b]++;\\n\\t\\t}\\n\\t\\tassert(u==vi(s,1));\\n\\t}\\n\\t\\n\\t//cerr<<L<<endl;\\n\\t\\n\\t#ifdef LOCAL\\n\\trep(_,100){\\n\\t\\tvi p(s);\\n\\t\\tiota(all(p),0);\\n\\t\\tmyshuffle(p);\\n\\t\\trep(i,L){\\n\\t\\t\\tfor(auto w:a[i]){\\n\\t\\t\\t\\tif(p[w.a]>p[w.b]){\\n\\t\\t\\t\\t\\tswap(p[w.a],p[w.b]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tassert(p==idx);\\n\\t}\\n\\t#endif\\n\\t\\n\\trep(i,L){\\n\\t\\tvi val(s);iota(all(val),0);\\n\\t\\tfor(auto w:a[i]){\\n\\t\\t\\tswap(val[idx[w.a]],val[idx[w.b]]);\\n\\t\\t}\\n\\t\\tfor(auto&v:val)v++;\\n\\t\\tcout<<\\\"? \\\";\\n\\t\\tprint(val);\\n\\t\\tcout.flush();\\n\\t\\tvi c=readvi(s);\\n\\t\\tfor(auto w:a[i]){\\n\\t\\t\\tif(c[idx[w.a]]){\\n\\t\\t\\t\\tswap(idx[w.a],idx[w.b]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tcout<<\\\"! \\\";\\n\\tvi ans(s);\\n\\trep(i,s)ans[idx[i]]=i+1;\\n\\tprint(ans);\\n\\tcout.flush();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3696,\n \"score_of_the_acc\": -0.4832,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3175_4841139\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef unsigned long long int ull;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\ntypedef long double D;\\n//typedef complex<D> P;\\n#define F first\\n#define S second\\nconst ll MOD=1000000007;\\n//const ll MOD=998244353;\\n\\ntemplate<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}\\ntemplate<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}\\ntemplate<typename T,typename U>ostream & operator << (ostream &o,const pair<T,U> &A){o<<A.F<<\\\" \\\"<<A.S; return o;}\\ntemplate<typename T>ostream & operator << (ostream &o,const vector<T> &A){int i=A.size(); for(auto &I:A){o<<I<<(--i?\\\" \\\":\\\"\\\");} return o;}\\ntemplate<typename T,typename U>T & chmax(T &a,const U &b){if(a<b){a=b;} return a;}\\ntemplate<typename T,typename U>T & chmin(T &a,const U &b){if(b<a){a=b;} return a;}\\n\\nint middle(int lf,int rg){return (rg-lf)/2+lf;}\\n\\nint main(){\\n \\n int N;\\n cin>>N;\\n int sz=1<<N;\\n vector<int> A(sz),C(sz),ans(sz),lw(sz),hg(sz),tmp(sz);\\n auto ask=\\n [&](){\\n for(int i=0;i<sz;i++){tmp[ans[i]]=ans[A[i]]+1;}\\n cout<<\\\"? \\\"<<tmp<<endl;\\n cin>>tmp;\\n for(int i=0;i<sz;i++){C[i]=tmp[ans[i]];}\\n };\\n for(int i=0;i<sz;i++){ans[i]=i;}\\n for(int i=1,L=2;i<sz;i<<=1,L<<=1){\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf;j<mid;j++){lw[j]=mid; hg[j]=rg;}\\n }\\n for(int dif=i;dif>0;dif>>=1){\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf;j<mid;j++){\\n A[j]=lw[j]+dif/2;\\n A[j+i]=j;\\n }\\n }\\n ask();\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf;j<mid;j++){\\n if(C[A[j]]){C[A[j]]--; hg[j]=A[j];}\\n else{lw[j]=A[j];}\\n }\\n }\\n }\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf,k=mid,idx=lf;idx<rg;){\\n while(j<mid && hg[j]<=k){tmp[idx++]=ans[j++];}\\n if(k<rg){tmp[idx++]=ans[k++];}\\n }\\n }\\n ans=tmp;\\n }\\n for(int i=0;i<sz;i++){tmp[ans[i]]=i+1;}\\n cout<<\\\"! \\\"<<tmp<<endl;\\ncout<<\\\"uku\\\";\\ncout<<flush;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.4289,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3175_4841136\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef unsigned long long int ull;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\ntypedef long double D;\\n//typedef complex<D> P;\\n#define F first\\n#define S second\\nconst ll MOD=1000000007;\\n//const ll MOD=998244353;\\n\\ntemplate<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}\\ntemplate<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}\\ntemplate<typename T,typename U>ostream & operator << (ostream &o,const pair<T,U> &A){o<<A.F<<\\\" \\\"<<A.S; return o;}\\ntemplate<typename T>ostream & operator << (ostream &o,const vector<T> &A){int i=A.size(); for(auto &I:A){o<<I<<(--i?\\\" \\\":\\\"\\\");} return o;}\\ntemplate<typename T,typename U>T & chmax(T &a,const U &b){if(a<b){a=b;} return a;}\\ntemplate<typename T,typename U>T & chmin(T &a,const U &b){if(b<a){a=b;} return a;}\\n\\nint middle(int lf,int rg){return (rg-lf)/2+lf;}\\n\\nint main(){\\n \\n int N;\\n cin>>N;\\n int sz=1<<N;\\n vector<int> A(sz),C(sz),ans(sz),lw(sz),hg(sz),tmp(sz);\\n auto ask=\\n [&](){\\n for(int i=0;i<sz;i++){tmp[ans[i]]=ans[A[i]]+1;}\\n cout<<\\\"? \\\"<<tmp<<endl;\\n cin>>tmp;\\n for(int i=0;i<sz;i++){C[i]=tmp[ans[i]];}\\n };\\n for(int i=0;i<sz;i++){ans[i]=i;}\\n for(int i=1,L=2;i<sz;i<<=1,L<<=1){\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf;j<mid;j++){lw[j]=mid; hg[j]=rg;}\\n }\\n for(int dif=i;dif>0;dif>>=1){\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf;j<mid;j++){\\n A[j]=lw[j]+dif/2;\\n A[j+i]=j;\\n }\\n }\\n ask();\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf;j<mid;j++){\\n if(C[A[j]]){C[A[j]]--; hg[j]=A[j];}\\n else{lw[j]=A[j];}\\n }\\n }\\n }\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf,k=mid,idx=lf;idx<rg;){\\n while(j<mid && hg[j]<=k){tmp[idx++]=ans[j++];}\\n if(k<rg){tmp[idx++]=ans[k++];}\\n }\\n }\\n ans=tmp;\\n }\\n for(int i=0;i<sz;i++){tmp[ans[i]]=i+1;}\\n cout<<\\\"! \\\"<<tmp<<endl;\\ncout<<\\\"uku\\\";\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.4321,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3175_4841129\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef unsigned long long int ull;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\ntypedef long double D;\\n//typedef complex<D> P;\\n#define F first\\n#define S second\\nconst ll MOD=1000000007;\\n//const ll MOD=998244353;\\n\\ntemplate<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}\\ntemplate<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}\\ntemplate<typename T,typename U>ostream & operator << (ostream &o,const pair<T,U> &A){o<<A.F<<\\\" \\\"<<A.S; return o;}\\ntemplate<typename T>ostream & operator << (ostream &o,const vector<T> &A){int i=A.size(); for(auto &I:A){o<<I<<(--i?\\\" \\\":\\\"\\\");} return o;}\\ntemplate<typename T,typename U>T & chmax(T &a,const U &b){if(a<b){a=b;} return a;}\\ntemplate<typename T,typename U>T & chmin(T &a,const U &b){if(b<a){a=b;} return a;}\\n\\nint middle(int lf,int rg){return (rg-lf)/2+lf;}\\n\\nint main(){\\n \\n int N;\\n cin>>N;\\n int sz=1<<N;\\n vector<int> A(sz),C(sz),ans(sz),lw(sz),hg(sz),tmp(sz);\\n auto ask=\\n [&](){\\n for(int i=0;i<sz;i++){tmp[ans[i]]=ans[A[i]]+1;}\\n cout<<\\\"? \\\"<<tmp<<endl;\\n cin>>tmp;\\n for(int i=0;i<sz;i++){C[i]=tmp[ans[i]];}\\n };\\n for(int i=0;i<sz;i++){ans[i]=i;}\\n for(int i=1,L=2;i<sz;i<<=1,L<<=1){\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf;j<mid;j++){lw[j]=mid; hg[j]=rg;}\\n }\\n for(int dif=i;dif>0;dif>>=1){\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf;j<mid;j++){\\n A[j]=lw[j]+dif/2;\\n A[j+i]=j;\\n }\\n }\\n ask();\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf;j<mid;j++){\\n if(C[A[j]]){C[A[j]]--; hg[j]=A[j];}\\n else{lw[j]=A[j];}\\n }\\n }\\n }\\n for(int lf=0,mid=i,rg=L;lf<sz;lf+=L,mid+=L,rg+=L){\\n for(int j=lf,k=mid,idx=lf;idx<rg;){\\n while(j<mid && hg[j]<=k){tmp[idx++]=ans[j++];}\\n if(k<rg){tmp[idx++]=ans[k++];}\\n }\\n }\\n ans=tmp;\\n }\\n for(int i=0;i<sz;i++){tmp[ans[i]]=i+1;}\\n cout<<\\\"! \\\"<<tmp<<endl;\\n\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.4289,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3175_4841121\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint n;\\n\\nvector<int> query(vector<int> &a) {\\n cout << \\\"?\\\";\\n for (int i = 0; i < (1 << n); i++) {\\n cout << \\\" \\\" << a[i] + 1;\\n }\\n cout << endl;\\n vector<int> c(1 << n);\\n for (int i = 0; i < (1 << n); i++) {\\n cin >> c[i];\\n }\\n return c;\\n}\\n\\nvoid answer(vector<int> &p) {\\n cout << \\\"!\\\";\\n for (int i = 0; i < (1 << n); i++) {\\n cout << \\\" \\\" << p[i] + 1;\\n }\\n cout << endl;\\n}\\n\\nint main() {\\n cin >> n;\\n int sz = 1 << n;\\n\\n vector<vector<int>> v(sz, vector<int>(1));\\n for (int i = 0; i < sz; i++) {\\n v[i][0] = i;\\n }\\n\\n for (int z = 0; z < n; z++) {\\n vector<int> ref(1 << z, 0);\\n int pre = 0;\\n for (int b = 0; b < z; b++) {\\n for (int i = pre; i < pre + (1 << b); i++) {\\n if (b < z - 1) ref[2 * i + 1] = ref[i];\\n ref[i] += 1 << (z - 1 - b);\\n if (b < z - 1) ref[2 * i + 2] = ref[i];\\n ref[i]--;\\n }\\n pre += (1 << b);\\n }\\n }\\n\\n vector<int> ret;\\n for (int z = 0; z < n; z++) {\\n vector<int> a(sz);\\n int c = (1 << (n - 1 - z));\\n\\n for (int k = 0; k < c; k++) {\\n vector<int> &s = v[2 * k], &t = v[2 * k + 1];\\n for (auto &x : s) a[x] = s[0];\\n for (auto &x : t) a[x] = s[0];\\n a[t.back()] = s.back();\\n }\\n ret = query(a);\\n for (int k = 0; k < c; k++) {\\n if (ret[v[2 * k].back()]) swap(v[2 * k], v[2 * k + 1]);\\n }\\n\\n vector<int> ref(1 << z, 0);\\n int pre = 0;\\n for (int b = 0; b < z; b++) {\\n for (int i = pre; i < pre + (1 << b); i++) {\\n if (b < z - 1) ref[2 * i + 1] = ref[i];\\n ref[i] += 1 << (z - 1 - b);\\n if (b < z - 1) ref[2 * i + 2] = ref[i];\\n ref[i]--;\\n }\\n pre += (1 << b);\\n }\\n\\n vector<vector<int>> num(c, vector<int>(1 << (z + 1)));\\n for (int k = 0; k < c; k++) num[k][0] = 1 << z;\\n\\n pre = 0;\\n for (int b = 0; b < z; b++) {\\n for (int k = 0; k < c; k++) {\\n int sum = 0;\\n for (int i = pre; i < pre + (1 << b); i++) {\\n for (int j = 0; j < num[k][i]; j++)\\n a[v[2 * k][j + sum]] = v[2 * k + 1][ref[i]];\\n sum += num[k][i];\\n }\\n for (auto &x : v[2 * k + 1]) a[x] = v[2 * k][0];\\n }\\n ret = query(a);\\n for (int k = 0; k < c; k++) {\\n int sum = 0;\\n for (int i = pre; i < pre + (1 << b); i++) {\\n int x = ret[v[2 * k + 1][ref[i]]];\\n num[k][2 * i + 1] = x;\\n num[k][2 * i + 2] = num[k][i] - x;\\n }\\n }\\n pre += (1 << b);\\n }\\n\\n vector<vector<int>> w(c);\\n for (int k = 0; k < c; k++) {\\n int sum = 0;\\n for (int i = 0; i < (1 << z); i++) {\\n for (int j = 0; j < num[k][i + (1 << z) - 1]; j++) {\\n w[k].push_back(v[2 * k][j + sum]);\\n }\\n sum += num[k][i + (1 << z) - 1];\\n w[k].push_back(v[2 * k + 1][i]);\\n }\\n }\\n\\n v = w;\\n }\\n\\n vector<int> ans(sz);\\n for (int i = 0; i < sz; i++) ans[v[0][i]] = i;\\n answer(ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.4321,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1988,"cells":{"group_id":{"kind":"string","value":"aoj_3171_cpp"},"problem_description":{"kind":"string","value":"H: Traditional Company\n問題\nあなたは Z 社の労働環境委員会の一員である。この役職たるもの、社員の出退勤時間や人間関係のモニタリングは欠かせないものだ。\nZ 社には $N$ 人の社員がいる。それぞれの社員は $1$ から $N$ までの整数で番号付けられており、整数が小さいほど社員として新しいことを表す。社員が違えば仕事効率は十人十色だ。長時間の勤務もものともしない人もいれば、残業が嫌いな人や、そもそも仕事が苦手な人だっているのだ。具体的には、$i$ 番目の社員がすでに $t$ 単位時間働いているとき、単位時間 $\\left[ t, t+1 \\right)$ の間の仕事効率 $c_{i, t}$ は以下のように定められる。なお、$a_i \\geq b_i$ が全ての $i$ について成立すると仮定してよい。\n$c_{i, t} = \\begin{cases} a_i & t < p_i \\\\ b_i & \\text{otherwise} \\end{cases}$\nここで、$i$ 番目の社員の出勤時間を $s_i$、退勤時間を $e_i$ とおこう ($s_i < e_i$)。$i$ 番目の社員の仕事量 $w_i$ は $w_i = \\sum_{t=0}^{e_i-s_i-1} c_{i, t}$ と計算される。勤怠管理システムの都合上、それぞれの社員について出勤・退勤の単位時間 $s_i, e_i$ は\n整数\nでなければならないため、例えば $2.5$ 単位時間勤務したり、時刻 $3.5$ に出勤するなどは認められていない。また、勤務時間 $e_i - s_i$ は\n$1$ 単位時間以上\n必要なので注意しなければならない。\n当然といえば当然なのだが、この社内には仲が良い者同士もいれば悪い者同士もいるし、そのどちらの関係でもない社員の組もある。仲が良い者同士なら一緒に仕事をする時間が欲しいものだが、仲が悪い者同士なら一緒に仕事をしたいとは思わないだろう。具体的には、社員 $i, j$ $(i \\neq j)$ について仲が良い者同士である場合、$1$ 単位時間以上は必ず同時に仕事をしなければならない。また、社員 $i, j$ $(i \\neq j)$ について仲が悪い者同士である場合、同時に仕事をする時間が $1$ 単位時間以上発生しないようにしなければならない。どちらでもない場合に関しては制限はない。例えば社員 $1$ の勤務時間が $[s_1, e_1) = [3, 5)$、社員 $2$ の勤務時間が $[s_2, e_2) = [5, 9)$ であるとき、同時に仕事をした時間が $1$ 単位時間未満であるため、この 2 人が仲が良い者同士である場合はこのような勤務時間帯は採用できない。仲が悪い者同士、あるいはどちらでもない場合はこのような勤務時間帯を採用することができる。\nまた、Z 社は伝統的精神を重んじているため、社員として新しいほど早めに出勤しなければならないルールが確立されている。具体的には、任意の社員の組 $i, j$ $(i < j)$ について、$s_i \\leq s_j$ でなければならない。退勤時刻まで同様の制約をつけると長時間労働の原因となるため、退勤時刻に関しては制限はない。\nさて、労働環境委員会の一員であるあなたの仕事は、会社全体の仕事量、つまり $\\sum_{i} w_i$ を一定以上の水準に保ちつつオフィスの開放時間 $T$ をできるだけ短くすることである。オフィスの開放時間 $T$ は、$\\max_{i} e_i - \\min_{j} s_j$ で定義される。\n入力形式\n以下の形式で与えられる。\n$N$ $M$ $X$\n$a_1$ $b_1$ $p_1$\n$a_2$ $b_2$ $p_2$\n...\n$a_N$ $b_N$ $p_N$\n$u_1$ $v_1$ $f_1$\n$u_2$ $v_2$ $f_2$\n...\n$u_M$ $v_M$ $f_M$\n$1$ 行目の $N$ は Z 社の社員数を表し、$M$ は仲が良い、または仲が悪い人間関係の総数を表す。また、$X$ は会社全体の仕事量の下限を表す。つまり、会社全体の仕事量は $X$ 以上でなければならない。\n$2$ 行目以降 $N$ 行はそれぞれの社員に関する情報を表す。$a_i, b_i$ は問題文中で説明されたように、$i$ 番目の社員の仕事効率に関する値を表し、$p_i$ は $i$ 番目の社員の仕事効率が切り替わる時間を表す。\n$2+N$ 行目以降 $M$ 行は人間関係を表す。$u_i, v_i$ は、$i$ 番目の人間関係が社員 $u_i, v_i$ に関するものであることを表し、$f_i = 1$ であるときは「$u_i, v_i$ は仲が良い者同士である」ことを、$f_i = -1$ であるときは「$u_i, v_i$ は仲が悪い者同士である」ことを表す。なお、この $M$ 個の人間関係で明示されなかった社員の組に関しては、仲が良くも悪くもないと仮定してよい。\n制約\n入力はすべて整数で与えられる\n$1 \\leq N \\leq 100$\n$0 \\leq M \\leq 200$\n$1 \\leq X \\leq 10^6$\n$0 \\leq |a_i|, |b_i| \\leq 10^2$\n$1 \\leq p_i \\leq 10^6$\n$a_i \\geq b_i$\n$1 \\leq u_i < v_i \\leq N$\n$(u_i, v_i) \\neq (u_j, v_j)$ $(i \\neq j)$\n$f_i \\in \\left\\{ -1, 1 \\right\\}$\n出力形式\n人間関係による制約を満たしつつ、会社全体の仕事量を $X$ 以上にできない場合、\n-1\nを出力せよ。そうでない場合、会社全体の仕事量を $X$ 以上にするときのオフィスの開放時間の最小値を出力せよ。\n入力例 1\n3 1 100\n5 3 5\n2 -1 9\n2 1 5\n1 2 -1\n出力例 1\n29\n例えば以下のようにすれば達成可能である。\n社員 $1$ が時刻 $0 $ で出勤、時刻 $20 $ で退勤 (仕事量 $5 \\times 5 + 3 \\times 15 = 70$)\n社員 $2$ が時刻 $20 $ で出勤、時刻 $29 $ で退勤 (仕事量 $2 \\times 9 = 18$)\n社員 $3$ が時刻 $20 $ で出勤、時刻 $29$ で退勤 (仕事量 $2 \\times 5 + 1 \\times 4 = 14$)\n社員 $1, 2$ は仲が悪い者同士であるが、同時に勤務している時間は $1$ 単位時間未満であるので条件を満たしており、また仕事量の合計は $70 + 18 + 14 = 102 (\\geq 100)$ となっている。$29 $ よりも短い時間での達成は不可能であるため、これが答えとなる。$i < j$ ならば $s_i \\leq s_j$ でなければならないことに注意せよ。\n入力例 2\n2 1 50\n-3 -5 3\n2 1 10\n1 2 1\n出力例 2\n43\n例えば以下のようにすれば達\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3171_6169756","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T> using PQ = priority_queue<T>;\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\" \"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(const T &v,ll n,string sv=\" \"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop_front();}cout<<endl;}\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\"[\"<<z.first<<\"]=\"<<z.second<<\",\";cout<<endl;}\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\n auto tmp = v;\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\n}\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\n rearrange(ord, head);\n rearrange(ord, tail...);\n}\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\n return ord;\n}\ntemplate<typename T> vector<int> descend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\n return ord;\n}\nll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}\nll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\nll modulo(ll n,ll d){return (n%d+d)%d;};\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\nint popcount(ll x){return __builtin_popcountll(x);};\nint poplow(ll x){return __builtin_ctzll(x);};\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\nll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}\nll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}\nll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}\ntemplate< typename T = int >\nstruct edge {\n int to;\n T cost;\n int id;\n edge():id(-1){};\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\n operator int() const { return to; }\n};\n\ntemplate<typename T>\nusing Graph = vector<vector<edge<T>>>;\ntemplate<typename T>\nGraph<T>revgraph(const Graph<T> &g){\n Graph<T>ret(g.size());\n for(int i=0;i<g.size();i++){\n for(auto e:g[i]){\n int to = e.to;\n e.to = i;\n ret[to].push_back(e);\n }\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\n Graph<T> ret(n);\n for(int es = 0; es < m; es++){\n int u,v;\n T w=1;\n cin>>u>>v;u-=indexed,v-=indexed;\n if(weighted)cin>>w;\n ret[u].emplace_back(v,w,es);\n if(!directed)ret[v].emplace_back(u,w,es);\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\n Graph<T>ret(n);\n for(int i=1;i<n;i++){\n int p;cin>>p;\n p-=indexed;\n ret[p].emplace_back(i);\n if(!directed)ret[i].emplace_back(p);\n }\n return ret;\n}\n//https://github.com/beet-aizu/library/blob/master/bflow/capacityscaling.cpp\n\n// O(m^2 \\log m \\log U)\n// U: maximum capacity\nenum Objective{\n MINIMIZE = +1,\n MAXIMIZE = -1,\n};\ntemplate<typename Flow, typename Cost,\n Objective objective = Objective::MINIMIZE>\nstruct MinCostFlow{\n template<typename T> inline void chmin(T &x,T y){x=min(x,y);}\n\n struct Edge{\n int src,dst;\n Flow flow,cap;\n Cost cost;\n int rev;\n Edge(int src,int dst,Flow cap,Cost cost,int rev):\n src(src),dst(dst),flow(0),cap(cap),cost(cost),rev(rev){}\n Flow residual_cap()const{return cap-flow;}\n };\n\n struct EdgePtr{\n int v,e;\n EdgePtr(int v,int e):v(v),e(e){}\n };\n\n int n;\n vector<vector<Edge>> G;\n vector<Flow> b;\n vector<Cost> p;\n\n MinCostFlow(int n):n(n),G(n),b(n,0){}\n\n EdgePtr add_edge(int src,int dst,Flow lower,Flow upper,Cost cost){\n int e=G[src].size();\n int r=(src==dst?e+1:G[dst].size());\n assert(lower<=upper);\n G[src].emplace_back(src,dst,+upper,+cost*objective,r);\n G[dst].emplace_back(dst,src,-lower,-cost*objective,e);\n return EdgePtr(src,e);\n }\n\n const Edge &get_edge(EdgePtr ep)const{return G[ep.v][ep.e];}\n\n void push(Edge &e,Flow amount){\n e.flow+=amount;\n G[e.dst][e.rev].flow-=amount;\n }\n\n void add_supply(int v,Flow amount){b[v]+=amount;}\n void add_demand(int v,Flow amount){b[v]-=amount;}\n\n Cost residual_cost(const Edge &e){\n return e.cost+p[e.src]-p[e.dst];\n }\n\n vector<int> excess_vs,deficit_vs;\n void saturate_negative(const Flow delta){\n for(auto &es:G){\n for(auto &e:es){\n Flow cap=e.residual_cap();\n cap-=cap%delta;\n if(cap<0 or residual_cost(e)<0){\n push(e,cap);\n b[e.src]-=cap;\n b[e.dst]+=cap;\n }\n }\n }\n\n excess_vs.clear();\n deficit_vs.clear();\n for(int v=0;v<n;v++){\n if(b[v]>0) excess_vs.emplace_back(v);\n if(b[v]<0) deficit_vs.emplace_back(v);\n }\n }\n\n const Cost unreachable = std::numeric_limits<Cost>::max();\n Cost farthest;\n vector<Cost> dist;\n vector<Edge*> parent;\n\n struct P{\n Cost first;\n int second;\n P(Cost first,int second):first(first),second(second){}\n bool operator<(const P o)const{return first>o.first;}\n };\n\n priority_queue<P> pq;\n\n template<typename Predicate>\n void eliminate(vector<int> &vs,Predicate predicate){\n vs.erase(remove_if(begin(vs),end(vs),predicate),end(vs));\n }\n\n bool dual(const Flow delta){\n eliminate(excess_vs, [&](int v){return b[v]<+delta;});\n eliminate(deficit_vs,[&](int v){return b[v]>-delta;});\n\n dist.assign(n,unreachable);\n for(int v:excess_vs) pq.emplace(dist[v]=0,v);\n\n parent.assign(n,nullptr);\n auto emplace=[&](Edge& e){\n if(e.residual_cap()<delta) return;\n Cost nxt=dist[e.src]+residual_cost(e);\n if(nxt>=dist[e.dst]) return;\n pq.emplace(dist[e.dst]=nxt,e.dst);\n parent[e.dst]=&e;\n };\n\n farthest=0;\n int deficit_count=0;\n while(!pq.empty()){\n Cost d=pq.top().first;\n int v=pq.top().second;\n pq.pop();\n if(dist[v]<d) continue;\n farthest=d;\n\n if(b[v]<=-delta) deficit_count++;\n if(deficit_count>=(int)deficit_vs.size()) break;\n\n for(auto &e:G[v]) emplace(e);\n }\n pq=decltype(pq)();\n\n for(int v=0;v<n;v++)\n p[v]+=min(dist[v],farthest);\n\n return deficit_count>0;\n }\n\n void primal(const Flow delta){\n for(int t:deficit_vs){\n if(dist[t]>farthest) continue;\n Flow f=-b[t];\n int v;\n for(v=t;parent[v];v=parent[v]->src)\n chmin(f,parent[v]->residual_cap());\n chmin(f,b[v]);\n\n f-=f%delta;\n if(f<=0) continue;\n\n for(v=t;parent[v];){\n auto &e=*parent[v];\n push(e,f);\n int u=parent[v]->src;\n if(e.residual_cap()<=0) parent[v]=nullptr;\n v=u;\n }\n b[t]+=f;\n b[v]-=f;\n }\n }\n\n template<Flow SCALING_FACTOR=2>\n bool build(){\n p.resize(n);\n Flow max_flow=1;\n for(auto t:b) max_flow=max({max_flow,t,-t});\n for(auto &es:G)\n for(auto &e:es)\n max_flow=max({max_flow,e.residual_cap(),-e.residual_cap()});\n\n Flow delta=1;\n while(delta<max_flow) delta*=SCALING_FACTOR;\n for(;delta;delta/=SCALING_FACTOR){\n saturate_negative(delta);\n while(dual(delta)) primal(delta);\n }\n\n return excess_vs.empty() and deficit_vs.empty();\n }\n\n template<typename T=Cost>\n T get_cost(){\n T res=0;\n for(auto &es:G)\n for(auto &e:es)\n res+=T(e.flow)*T(e.cost)/T(objective);\n return res/T(2);\n }\n template<typename T=Cost> T get_gain(){return get_cost();}\n\n vector<Cost> get_potential(){\n fill(p.begin(),p.end(),0);\n for(int i=0;i<n;i++)\n for(auto &es:G)\n for(auto &e:es)\n if(e.residual_cap()>0)\n chmin(p[e.dst],p[e.src]+e.cost);\n return p;\n }\n};\n\ntemplate<typename Flow, typename Cost>\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n\tll n,m,x;cin>>n>>m>>x;\n\tvector<ll>a(n),b(n),p(n);\n\trep(i,0,n){\n\t\tcin>>a[i]>>b[i]>>p[i];\n\t}\n\tvector<ll>u(m),v(m),f(m);\n\trep(i,0,m)cin>>u[i]>>v[i]>>f[i],u[i]--,v[i]--;\n\tll inf=1e15;\n\tll tinf=1e7;\n\tll ok=tinf,ng=0;\n\twhile(ok-ng>=2){\n\t\tll mid=(ok+ng)/2;\n\t\tMinCostFlow<ll,ll>mcf(2*n);\n\t\trep(i,0,n){\n\t\t\tmcf.add_edge(0,i+n,0,inf,mid);\n\t\t}\n\t\trep(i,0,n-1){\n\t\t\tmcf.add_edge(i+1,i,0,inf,0);\n\t\t}\n\t\trep(i,0,m){\n\t\t\tif(f[i]==1)mcf.add_edge(u[i]+n,v[i],0,inf,-1);\n\t\t\telse{\n\t\t\t\tmcf.add_edge(v[i],u[i]+n,0,inf,0);\n\t\t\t}\n\t\t}\n\t\trep(i,0,n){\n\t\t\tmcf.add_edge(i+n,i,0,inf,-1);\n\t\t\tmcf.add_edge(i+n,i,a[i],inf,0);\n\t\t\tmcf.add_edge(i,i+n,0,a[i]-b[i],p[i]);\n\t\t}\n\t\tbool sw=mcf.build();\n\t\tif(mcf.build()&&mcf.get_cost()>=x)ok=mid;\n\t\telse ng=mid;\n\t\t//debug(mcf.get_potential());\n\t\t//cout<<sw spa mid spa mcf.get_cost()<<endl;\n\t}\n\t//debug(u);\n\t//debug(v);\n\t//debug(f);\n\tanss(ok,tinf,-1);\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":3568,"score_of_the_acc":-0.76,"final_rank":4},{"submission_id":"aoj_3171_4886075","code_snippet":"#line 1 \"other/h.cpp\"\n#include <bits/extc++.h>\n#if __has_include(<bit>)\n#include <bit>\n#endif\n#line 7 \"Library/alias.hpp\"\nnamespace workspace {\nconstexpr char eol = '\\n';\nusing namespace std;\nusing i32 = int_least32_t;\nusing i64 = int_least64_t;\nusing i128 = __int128_t;\nusing u32 = uint_least32_t;\nusing u64 = uint_least64_t;\nusing u128 = __uint128_t;\ntemplate <class T, class Comp = less<T>>\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\ntemplate <class T> using stack = std::stack<T, vector<T>>;\n} // namespace workspace\n#line 5 \"Library/config.hpp\"\nnamespace config {\nconst auto start_time{std::chrono::system_clock::now()};\nint64_t elapsed() {\n using namespace std::chrono;\n const auto end_time{system_clock::now()};\n return duration_cast<milliseconds>(end_time - start_time).count();\n}\n__attribute__((constructor)) void setup() {\n using namespace std;\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n#ifdef _buffer_check\n atexit([] {\n char bufc;\n if (cin >> bufc)\n cerr << \"\\n\\033[43m\\033[30mwarning: buffer not empty.\\033[0m\\n\\n\";\n });\n#endif\n}\nunsigned cases(), caseid = 1;\ntemplate <class F> void loop(F main) {\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\n}\n} // namespace config\n#line 2 \"Library/option.hpp\"\n#ifdef ONLINE_JUDGE\n #pragma GCC optimize(\"O3\")\n #pragma GCC target(\"avx,avx2\")\n #pragma GCC optimize(\"unroll-loops\")\n#endif\n#line 2 \"Library/utils/binary_search.hpp\"\n#if __cplusplus >= 201703L\n#include <cassert>\n#include <cmath>\n#include <vector>\nnamespace workspace {\n// binary search on a discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\n iter_type>\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\n assert(ok != ng);\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\n while (1 < dist || dist < -1) {\n iter_type mid(ok + dist / 2);\n if (pred(mid))\n ok = mid, dist -= dist / 2;\n else\n ng = mid, dist /= 2;\n }\n return ok;\n}\n// parallel binary search on each discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\n std::vector<bool>>,\n std::vector<iter_type>>\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\n pred_type pred) {\n std::vector<iter_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n iter_type mid(ok + (ng - ok) / 2);\n if (mids[i] != mid) {\n all_found = false;\n mids[i] = mid;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n// binary search on a real number interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\n real_type>\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\n assert(ok != ng);\n while (ok + eps < ng || ng + eps < ok) {\n real_type mid{(ok + ng) / 2};\n (pred(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n// parallel binary search on each real interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<real_type>>,\n std::vector<bool>>,\n std::vector<real_type>>\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\n const real_type eps, pred_type pred) {\n std::vector<real_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n if (ok + eps < ng || ng + eps < ok) {\n all_found = false;\n mids[i] = (ok + ng) / 2;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/casefmt.hpp\"\nnamespace workspace {\nstd::ostream &casefmt(std::ostream& os) { return os << \"Case #\" << config::caseid << \": \"; }\n} // namespace workspace\n#line 3 \"Library/utils/chval.hpp\"\nnamespace workspace {\ntemplate <class T, class Comp = std::less<T>>\nbool chle(T &x, const T &y, Comp comp = Comp()) {\n return comp(y, x) ? x = y, true : false;\n}\ntemplate <class T, class Comp = std::less<T>>\nbool chge(T &x, const T &y, Comp comp = Comp()) {\n return comp(x, y) ? x = y, true : false;\n}\n} // namespace workspace\n#line 5 \"Library/utils/coordinate_compression.hpp\"\n\ntemplate <class T> class coordinate_compression {\n std::vector<T> uniquely;\n std::vector<size_t> compressed;\n\n public:\n coordinate_compression(const std::vector<T> &raw)\n : uniquely(raw), compressed(raw.size()) {\n std::sort(uniquely.begin(), uniquely.end());\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\n uniquely.end());\n for (size_t i = 0; i != size(); ++i)\n compressed[i] =\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\n uniquely.begin();\n }\n\n size_t operator[](const size_t idx) const {\n assert(idx < size());\n return compressed[idx];\n }\n\n size_t size() const { return compressed.size(); }\n\n size_t count() const { return uniquely.size(); }\n\n T value(const size_t ord) const {\n assert(ord < count());\n return uniquely[ord];\n }\n\n size_t order(const T &value) const {\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\n uniquely.begin();\n }\n\n auto begin() { return compressed.begin(); }\n auto end() { return compressed.end(); }\n auto rbegin() { return compressed.rbegin(); }\n auto rend() { return compressed.rend(); }\n};\n#line 3 \"Library/utils/fixed_point.hpp\"\nnamespace workspace {\n// specify the return type of lambda.\ntemplate <class lambda_type> class fixed_point {\n lambda_type func;\n\n public:\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\n template <class... Args> auto operator()(Args &&... args) const {\n return func(*this, std::forward<Args>(args)...);\n }\n};\n} // namespace workspace\n#line 6 \"Library/utils/hash.hpp\"\n\n#line 3 \"Library/utils/sfinae.hpp\"\n#include <type_traits>\n\ntemplate <class type, template <class> class trait>\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\n\ntemplate <class Container>\nusing element_type = typename std::decay<decltype(\n *std::begin(std::declval<Container&>()))>::type;\n\ntemplate <class T, class = int> struct mapped_of {\n using type = element_type<T>;\n};\ntemplate <class T>\nstruct mapped_of<T,\n typename std::pair<int, typename T::mapped_type>::first_type> {\n using type = typename T::mapped_type;\n};\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\n\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\ntemplate <class T>\nstruct is_integral_ext<\n T, typename std::enable_if<std::is_integral<T>::value>::type>\n : std::true_type {};\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\n#if __cplusplus >= 201402\ntemplate <class T>\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\n#endif\n\ntemplate <typename T, typename = void> struct multiplicable_uint {\n using type = uint_least32_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\n using type = uint_least64_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\n using type = __uint128_t;\n};\n#line 8 \"Library/utils/hash.hpp\"\nnamespace workspace {\ntemplate <class T, class = void> struct hash : std::hash<T> {};\n#if __cplusplus >= 201703L\ntemplate <class Unique_bits_type>\nstruct hash<Unique_bits_type,\n enable_if_trait_type<Unique_bits_type,\n std::has_unique_object_representations>> {\n size_t operator()(uint64_t x) const {\n static const uint64_t m = std::random_device{}();\n x ^= x >> 23;\n x ^= m;\n x ^= x >> 47;\n return x - (x >> 32);\n }\n};\n#endif\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\n return seed ^\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\n}\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\n size_t operator()(const std::pair<T1, T2> &pair) const {\n return hash_combine(hash<T1>()(pair.first), pair.second);\n }\n};\ntemplate <class... T> class hash<std::tuple<T...>> {\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\n struct tuple_hash {\n static uint64_t apply(const Tuple &t) {\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\n std::get<index>(t));\n }\n };\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\n static uint64_t apply(const Tuple &t) { return 0; }\n };\n\n public:\n uint64_t operator()(const std::tuple<T...> &t) const {\n return tuple_hash<std::tuple<T...>>::apply(t);\n }\n};\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\n using key_type = typename hash_table::key_type;\n size_t count(const key_type &key) const {\n return hash_table::find(key) != hash_table::end();\n }\n template <class... Args> auto emplace(Args &&... args) {\n return hash_table::insert(typename hash_table::value_type(args...));\n }\n};\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing cc_hash_table =\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing gp_hash_table =\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped>\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\n} // namespace workspace\n#line 2 \"Library/utils/make_vector.hpp\"\n#if __cplusplus >= 201703L\n#include <vector>\nnamespace workspace {\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\n if constexpr (N)\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\n else\n return init;\n}\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\n return make_vector<T, N>((size_t*)sizes, init);\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/random_number_generator.hpp\"\ntemplate <typename num_type> class random_number_generator {\n typename std::conditional<std::is_integral<num_type>::value,\n std::uniform_int_distribution<num_type>,\n std::uniform_real_distribution<num_type>>::type\n unif;\n\n std::mt19937 engine;\n\n public:\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\n num_type max = std::numeric_limits<num_type>::max())\n : unif(min, max), engine(std::random_device{}()) {}\n\n num_type min() const { return unif.min(); }\n\n num_type max() const { return unif.max(); }\n\n // generate a random number in [min(), max()].\n num_type operator()() { return unif(engine); }\n};\n#line 3 \"Library/utils/read.hpp\"\nnamespace workspace {\n// read with std::cin.\ntemplate <class T = void>\nstruct read\n{\n typename std::remove_const<T>::type value;\n template <class... types>\n read(types... args) : value(args...) { std::cin >> value; }\n operator T() const { return value; }\n};\ntemplate <>\nstruct read<void>\n{\n template <class T>\n operator T() const { T value; std::cin >> value; return value; }\n};\n} // namespace workspace\n#line 4 \"Library/utils/stream.hpp\"\n\n#line 6 \"Library/utils/stream.hpp\"\nnamespace std {\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ' ' << p.second;\n}\ntemplate <class tuple_t, size_t index> struct tuple_is {\n static istream &apply(istream &is, tuple_t &t) {\n tuple_is<tuple_t, index - 1>::apply(is, t);\n return is >> get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\n static istream &apply(istream &is, tuple_t &t) { return is; }\n};\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\n t);\n}\ntemplate <class tuple_t, size_t index> struct tuple_os {\n static ostream &apply(ostream &os, const tuple_t &t) {\n tuple_os<tuple_t, index - 1>::apply(os, t);\n return os << ' ' << get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\n static ostream &apply(ostream &os, const tuple_t &t) {\n return os << get<0>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\n};\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\n t);\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n istream &>::type\noperator>>(istream &is, Container &cont) {\n for (auto &&e : cont) is >> e;\n return is;\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n ostream &>::type\noperator<<(ostream &os, const Container &cont) {\n bool head = true;\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\n return os;\n}\n} // namespace std\n#line 4 \"Library/utils/trinary_search.hpp\"\n// trinary search on discrete range.\ntemplate <class iter_type, class comp_type>\niter_type trinary(iter_type first, iter_type last, comp_type comp)\n{\n assert(first < last);\n intmax_t dist(last - first);\n while(dist > 2)\n {\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\n else first = left, dist -= dist / 3;\n }\n if(dist > 1 && comp(first + 1, first)) ++first;\n return first;\n}\n// trinary search on real numbers.\ntemplate <class comp_type>\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\n{\n assert(first < last);\n while(last - first > eps)\n {\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\n if(comp(left, right)) last = right;\n else first = left;\n }\n return first;\n}\n#line 2 \"Library/utils/wrapper.hpp\"\ntemplate <class Container> class reversed {\n Container &ref, copy;\n\n public:\n reversed(Container &ref) : ref(ref) {}\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\n auto begin() const { return ref.rbegin(); }\n auto end() const { return ref.rend(); }\n};\n#line 9 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main();\n}\nint main() { config::loop(workspace::main); }\n\nunsigned config::cases() {\n // return -1; // unspecified\n // int t; std::cin >> t; return t; // given\n return 1;\n}\n\n#line 4 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n\n#line 4 \"Library/graph/directed/flow/base.hpp\"\n// the base class of flow algorithms.\ntemplate <class cap_t, class cost_t> struct flow_base {\n struct edge_t {\n size_t src, dst;\n cap_t cap;\n cost_t cost;\n edge_t *rev;\n edge_t() = default;\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\n : src(src), dst(dst), cap(cap), rev(rev) {}\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\n edge_t *rev)\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\n }; // class edge_t\n\n class adj_type {\n edge_t *fst, *lst, *clst;\n\n public:\n template <class... Args> edge_t *emplace(Args &&... args) {\n if (lst == clst) {\n size_t len(clst - fst);\n edge_t *nfst = lst = new edge_t[len << 1];\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\n p->rev->rev = lst, *lst = *p;\n delete[] fst;\n fst = nfst;\n clst = lst + len;\n }\n *lst = edge_t(args...);\n return lst++;\n }\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\n ~adj_type() { delete[] fst; }\n edge_t &operator[](size_t i) {\n assert(i < size());\n return *(fst + i);\n }\n size_t size() const { return lst - fst; }\n edge_t *begin() const { return fst; }\n edge_t *end() const { return lst; }\n }; // class adj_type\n\n flow_base(size_t n = 0) : adjs(n) {}\n\n flow_base(const flow_base &other) : adjs(other.size()) {\n for (size_t node{}; node != size(); ++node)\n for (const auto &[src, dst, cap, cost, rev] : other[node])\n if (src == node) {\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\n rev->src = nil;\n } else {\n rev->rev->src = node;\n }\n }\n\n flow_base &operator=(const flow_base &rhs) {\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\n return *this;\n }\n\n size_t size() const { return adjs.size(); }\n\n adj_type &operator[](size_t node) {\n assert(node < size());\n return adjs[node];\n }\n const adj_type &operator[](size_t node) const {\n assert(node < size());\n return adjs[node];\n }\n\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) {\n assert(src < size());\n assert(dst < size());\n assert(!(cap < static_cast<cap_t>(0)));\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\n return ptr;\n }\n\n protected:\n constexpr static size_t nil = -1;\n std::vector<adj_type> adjs;\n}; // class flow_base\n#line 6 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n// Successive shortest paths algorithm.\ntemplate <class cap_t, class cost_t, bool density_tag = false>\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\n using base = flow_base<cap_t, cost_t>;\n using edge_t = typename base::edge_t;\n using base::adjs;\n using base::nil;\n\n cost_t min_cost, total_cost;\n std::vector<cap_t> supp;\n std::vector<cost_t> ptnl;\n\n void copy_member(const min_cost_flow &other) {\n min_cost = other.min_cost;\n total_cost = other.total_cost;\n supp = other.supp;\n ptnl = other.ptnl;\n }\n\n void Dijkstra(std::vector<edge_t *> &last) {\n const cost_t infty(total_cost + 1);\n std::vector<cost_t> nptnl(size(), infty);\n if constexpr (density_tag) {\n // O(V^2)\n std::vector<bool> used(size());\n for (size_t src{}; src != size(); ++src) {\n if (static_cast<cap_t>(0) < supp[src]) {\n used[src] = true;\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\n if (e.avbl() && e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = e.cost;\n last[e.dst] = &e;\n }\n }\n }\n }\n for (;;) {\n size_t src{nil};\n cost_t sp{infty};\n for (size_t node{}; node != size(); ++node) {\n if (used[node] || nptnl[node] == infty) continue;\n cost_t dist{nptnl[node] - ptnl[node]};\n if (dist < sp) {\n sp = dist;\n src = node;\n }\n }\n if (src == nil) break;\n used[src] = true;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = nptnl[src] + e.cost;\n last[e.dst] = &e;\n }\n }\n }\n } else {\n // O((V + E)logV)\n struct node_t {\n size_t id;\n cost_t dist;\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\n };\n std::priority_queue<node_t> que;\n for (size_t src{}; src != size(); ++src) {\n if (supp[src] > static_cast<cap_t>(0)) {\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\n if (e.avbl() && nptnl[e.dst] > e.cost) {\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n while (!que.empty()) {\n auto [src, ndist] = que.top();\n que.pop();\n if (ndist + ptnl[src] != nptnl[src]) continue;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\n que.emplace(e.dst,\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n ptnl.swap(nptnl);\n }\n\n public:\n using base::size;\n\n min_cost_flow(size_t n = 0)\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\n\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\n copy_member(other);\n }\n\n min_cost_flow &operator=(const min_cost_flow &other) {\n base::operator=(other);\n copy_member(other);\n return *this;\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) override {\n assert(src != dst);\n if (cost < static_cast<cost_t>(0)) {\n supp[src] -= cap;\n supp[dst] += cap;\n min_cost += cap * cost;\n total_cost -= cap * cost;\n return base::add_edge(dst, src, cap, -cost);\n }\n total_cost += cap * cost;\n return base::add_edge(src, dst, cap, cost);\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\n const cap_t &upper, const cost_t &cost) {\n assert(!(upper < lower));\n supp[src] -= lower;\n supp[dst] += lower;\n min_cost += lower * cost;\n return add_edge(src, dst, upper - lower, cost);\n }\n\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\n assert(node < size());\n return supp[node] += vol;\n }\n\n const cap_t &demand(size_t node, const cap_t &vol) {\n return supply(node, -vol);\n }\n\n bool flow() {\n for (bool aug = true; aug;) {\n aug = false;\n std::vector<edge_t *> last(size());\n Dijkstra(last);\n std::vector<bool> shut(size());\n for (size_t dst{}; dst != size(); ++dst) {\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\n cap_t resid{-supp[dst]};\n size_t src{dst}, block{nil};\n while (last[src] && !shut[src]) {\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\n src = last[src]->src;\n }\n if (shut[src])\n block = src;\n else {\n if (!(resid < supp[src])) {\n resid = supp[src];\n block = src;\n }\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\n e->cap -= resid;\n e->rev->cap += resid;\n }\n supp[src] -= resid;\n supp[dst] += resid;\n min_cost += ptnl[dst] * resid;\n aug = true;\n }\n if (~block) {\n for (size_t node{dst};; node = last[node]->src) {\n shut[node] = true;\n if (node == block) break;\n }\n }\n }\n }\n }\n return std::none_of(begin(supp), end(supp),\n [](const cap_t &s) { return s < 0 || 0 < s; });\n }\n\n cost_t optimal() {\n assert(flow());\n return min_cost;\n }\n}; // class min_cost_flow\n#line 22 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main() {\n // start here!\n const i64 inf = 1e10;\n int n, m, x;\n cin >> n >> m >> x;\n\n min_cost_flow<i64, i64> base(n * 3);\n // make\n {\n for (int i = 0; i < n; i++) {\n int a, b, p;\n cin >> a >> b >> p;\n base.add_edge(3 * i + 1, 3 * i, inf, p);\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\n base.supply(3 * i, -a);\n base.supply(3 * i + 1, a - b);\n base.supply(3 * i + 2, b);\n }\n }\n for (auto j = 0; j < m; ++j) {\n int u, v, f;\n cin >> u >> v >> f;\n --u, --v;\n if (f > 0) {\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\n } else {\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\n }\n }\n\n auto ok = [&](int t) -> bool {\n auto mcf = base;\n for (int i = 0; i < n; i++) {\n mcf.add_edge(3 * i + 2, 0, inf, t);\n }\n if (mcf.flow()) {\n auto opt = mcf.optimal();\n return opt >= x;\n }\n return false;\n };\n \n const int tmax = x + 100 * n * (n - 1); \n\n auto ans = binary_search(tmax + 1, -1, ok);\n if (ans > tmax)\n cout << \"-1\\n\";\n else\n cout << ans << eol;\n}\n}","accuracy":0.4222222222222222,"time_ms":40,"memory_kb":3600,"score_of_the_acc":-0.6148,"final_rank":14},{"submission_id":"aoj_3171_4886073","code_snippet":"#line 1 \"other/h.cpp\"\n#include <bits/extc++.h>\n#if __has_include(<bit>)\n#include <bit>\n#endif\n#line 7 \"Library/alias.hpp\"\nnamespace workspace {\nconstexpr char eol = '\\n';\nusing namespace std;\nusing i32 = int_least32_t;\nusing i64 = int_least64_t;\nusing i128 = __int128_t;\nusing u32 = uint_least32_t;\nusing u64 = uint_least64_t;\nusing u128 = __uint128_t;\ntemplate <class T, class Comp = less<T>>\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\ntemplate <class T> using stack = std::stack<T, vector<T>>;\n} // namespace workspace\n#line 5 \"Library/config.hpp\"\nnamespace config {\nconst auto start_time{std::chrono::system_clock::now()};\nint64_t elapsed() {\n using namespace std::chrono;\n const auto end_time{system_clock::now()};\n return duration_cast<milliseconds>(end_time - start_time).count();\n}\n__attribute__((constructor)) void setup() {\n using namespace std;\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n#ifdef _buffer_check\n atexit([] {\n char bufc;\n if (cin >> bufc)\n cerr << \"\\n\\033[43m\\033[30mwarning: buffer not empty.\\033[0m\\n\\n\";\n });\n#endif\n}\nunsigned cases(), caseid = 1;\ntemplate <class F> void loop(F main) {\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\n}\n} // namespace config\n#line 2 \"Library/option.hpp\"\n#ifdef ONLINE_JUDGE\n #pragma GCC optimize(\"O3\")\n #pragma GCC target(\"avx,avx2\")\n #pragma GCC optimize(\"unroll-loops\")\n#endif\n#line 2 \"Library/utils/binary_search.hpp\"\n#if __cplusplus >= 201703L\n#include <cassert>\n#include <cmath>\n#include <vector>\nnamespace workspace {\n// binary search on a discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\n iter_type>\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\n assert(ok != ng);\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\n while (1 < dist || dist < -1) {\n iter_type mid(ok + dist / 2);\n if (pred(mid))\n ok = mid, dist -= dist / 2;\n else\n ng = mid, dist /= 2;\n }\n return ok;\n}\n// parallel binary search on each discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\n std::vector<bool>>,\n std::vector<iter_type>>\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\n pred_type pred) {\n std::vector<iter_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n iter_type mid(ok + (ng - ok) / 2);\n if (mids[i] != mid) {\n all_found = false;\n mids[i] = mid;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n// binary search on a real number interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\n real_type>\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\n assert(ok != ng);\n while (ok + eps < ng || ng + eps < ok) {\n real_type mid{(ok + ng) / 2};\n (pred(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n// parallel binary search on each real interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<real_type>>,\n std::vector<bool>>,\n std::vector<real_type>>\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\n const real_type eps, pred_type pred) {\n std::vector<real_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n if (ok + eps < ng || ng + eps < ok) {\n all_found = false;\n mids[i] = (ok + ng) / 2;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/casefmt.hpp\"\nnamespace workspace {\nstd::ostream &casefmt(std::ostream& os) { return os << \"Case #\" << config::caseid << \": \"; }\n} // namespace workspace\n#line 3 \"Library/utils/chval.hpp\"\nnamespace workspace {\ntemplate <class T, class Comp = std::less<T>>\nbool chle(T &x, const T &y, Comp comp = Comp()) {\n return comp(y, x) ? x = y, true : false;\n}\ntemplate <class T, class Comp = std::less<T>>\nbool chge(T &x, const T &y, Comp comp = Comp()) {\n return comp(x, y) ? x = y, true : false;\n}\n} // namespace workspace\n#line 5 \"Library/utils/coordinate_compression.hpp\"\n\ntemplate <class T> class coordinate_compression {\n std::vector<T> uniquely;\n std::vector<size_t> compressed;\n\n public:\n coordinate_compression(const std::vector<T> &raw)\n : uniquely(raw), compressed(raw.size()) {\n std::sort(uniquely.begin(), uniquely.end());\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\n uniquely.end());\n for (size_t i = 0; i != size(); ++i)\n compressed[i] =\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\n uniquely.begin();\n }\n\n size_t operator[](const size_t idx) const {\n assert(idx < size());\n return compressed[idx];\n }\n\n size_t size() const { return compressed.size(); }\n\n size_t count() const { return uniquely.size(); }\n\n T value(const size_t ord) const {\n assert(ord < count());\n return uniquely[ord];\n }\n\n size_t order(const T &value) const {\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\n uniquely.begin();\n }\n\n auto begin() { return compressed.begin(); }\n auto end() { return compressed.end(); }\n auto rbegin() { return compressed.rbegin(); }\n auto rend() { return compressed.rend(); }\n};\n#line 3 \"Library/utils/fixed_point.hpp\"\nnamespace workspace {\n// specify the return type of lambda.\ntemplate <class lambda_type> class fixed_point {\n lambda_type func;\n\n public:\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\n template <class... Args> auto operator()(Args &&... args) const {\n return func(*this, std::forward<Args>(args)...);\n }\n};\n} // namespace workspace\n#line 6 \"Library/utils/hash.hpp\"\n\n#line 3 \"Library/utils/sfinae.hpp\"\n#include <type_traits>\n\ntemplate <class type, template <class> class trait>\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\n\ntemplate <class Container>\nusing element_type = typename std::decay<decltype(\n *std::begin(std::declval<Container&>()))>::type;\n\ntemplate <class T, class = int> struct mapped_of {\n using type = element_type<T>;\n};\ntemplate <class T>\nstruct mapped_of<T,\n typename std::pair<int, typename T::mapped_type>::first_type> {\n using type = typename T::mapped_type;\n};\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\n\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\ntemplate <class T>\nstruct is_integral_ext<\n T, typename std::enable_if<std::is_integral<T>::value>::type>\n : std::true_type {};\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\n#if __cplusplus >= 201402\ntemplate <class T>\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\n#endif\n\ntemplate <typename T, typename = void> struct multiplicable_uint {\n using type = uint_least32_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\n using type = uint_least64_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\n using type = __uint128_t;\n};\n#line 8 \"Library/utils/hash.hpp\"\nnamespace workspace {\ntemplate <class T, class = void> struct hash : std::hash<T> {};\n#if __cplusplus >= 201703L\ntemplate <class Unique_bits_type>\nstruct hash<Unique_bits_type,\n enable_if_trait_type<Unique_bits_type,\n std::has_unique_object_representations>> {\n size_t operator()(uint64_t x) const {\n static const uint64_t m = std::random_device{}();\n x ^= x >> 23;\n x ^= m;\n x ^= x >> 47;\n return x - (x >> 32);\n }\n};\n#endif\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\n return seed ^\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\n}\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\n size_t operator()(const std::pair<T1, T2> &pair) const {\n return hash_combine(hash<T1>()(pair.first), pair.second);\n }\n};\ntemplate <class... T> class hash<std::tuple<T...>> {\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\n struct tuple_hash {\n static uint64_t apply(const Tuple &t) {\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\n std::get<index>(t));\n }\n };\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\n static uint64_t apply(const Tuple &t) { return 0; }\n };\n\n public:\n uint64_t operator()(const std::tuple<T...> &t) const {\n return tuple_hash<std::tuple<T...>>::apply(t);\n }\n};\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\n using key_type = typename hash_table::key_type;\n size_t count(const key_type &key) const {\n return hash_table::find(key) != hash_table::end();\n }\n template <class... Args> auto emplace(Args &&... args) {\n return hash_table::insert(typename hash_table::value_type(args...));\n }\n};\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing cc_hash_table =\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing gp_hash_table =\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped>\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\n} // namespace workspace\n#line 2 \"Library/utils/make_vector.hpp\"\n#if __cplusplus >= 201703L\n#include <vector>\nnamespace workspace {\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\n if constexpr (N)\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\n else\n return init;\n}\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\n return make_vector<T, N>((size_t*)sizes, init);\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/random_number_generator.hpp\"\ntemplate <typename num_type> class random_number_generator {\n typename std::conditional<std::is_integral<num_type>::value,\n std::uniform_int_distribution<num_type>,\n std::uniform_real_distribution<num_type>>::type\n unif;\n\n std::mt19937 engine;\n\n public:\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\n num_type max = std::numeric_limits<num_type>::max())\n : unif(min, max), engine(std::random_device{}()) {}\n\n num_type min() const { return unif.min(); }\n\n num_type max() const { return unif.max(); }\n\n // generate a random number in [min(), max()].\n num_type operator()() { return unif(engine); }\n};\n#line 3 \"Library/utils/read.hpp\"\nnamespace workspace {\n// read with std::cin.\ntemplate <class T = void>\nstruct read\n{\n typename std::remove_const<T>::type value;\n template <class... types>\n read(types... args) : value(args...) { std::cin >> value; }\n operator T() const { return value; }\n};\ntemplate <>\nstruct read<void>\n{\n template <class T>\n operator T() const { T value; std::cin >> value; return value; }\n};\n} // namespace workspace\n#line 4 \"Library/utils/stream.hpp\"\n\n#line 6 \"Library/utils/stream.hpp\"\nnamespace std {\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ' ' << p.second;\n}\ntemplate <class tuple_t, size_t index> struct tuple_is {\n static istream &apply(istream &is, tuple_t &t) {\n tuple_is<tuple_t, index - 1>::apply(is, t);\n return is >> get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\n static istream &apply(istream &is, tuple_t &t) { return is; }\n};\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\n t);\n}\ntemplate <class tuple_t, size_t index> struct tuple_os {\n static ostream &apply(ostream &os, const tuple_t &t) {\n tuple_os<tuple_t, index - 1>::apply(os, t);\n return os << ' ' << get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\n static ostream &apply(ostream &os, const tuple_t &t) {\n return os << get<0>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\n};\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\n t);\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n istream &>::type\noperator>>(istream &is, Container &cont) {\n for (auto &&e : cont) is >> e;\n return is;\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n ostream &>::type\noperator<<(ostream &os, const Container &cont) {\n bool head = true;\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\n return os;\n}\n} // namespace std\n#line 4 \"Library/utils/trinary_search.hpp\"\n// trinary search on discrete range.\ntemplate <class iter_type, class comp_type>\niter_type trinary(iter_type first, iter_type last, comp_type comp)\n{\n assert(first < last);\n intmax_t dist(last - first);\n while(dist > 2)\n {\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\n else first = left, dist -= dist / 3;\n }\n if(dist > 1 && comp(first + 1, first)) ++first;\n return first;\n}\n// trinary search on real numbers.\ntemplate <class comp_type>\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\n{\n assert(first < last);\n while(last - first > eps)\n {\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\n if(comp(left, right)) last = right;\n else first = left;\n }\n return first;\n}\n#line 2 \"Library/utils/wrapper.hpp\"\ntemplate <class Container> class reversed {\n Container &ref, copy;\n\n public:\n reversed(Container &ref) : ref(ref) {}\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\n auto begin() const { return ref.rbegin(); }\n auto end() const { return ref.rend(); }\n};\n#line 9 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main();\n}\nint main() { config::loop(workspace::main); }\n\nunsigned config::cases() {\n // return -1; // unspecified\n // int t; std::cin >> t; return t; // given\n return 1;\n}\n\n#line 4 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n\n#line 4 \"Library/graph/directed/flow/base.hpp\"\n// the base class of flow algorithms.\ntemplate <class cap_t, class cost_t> struct flow_base {\n struct edge_t {\n size_t src, dst;\n cap_t cap;\n cost_t cost;\n edge_t *rev;\n edge_t() = default;\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\n : src(src), dst(dst), cap(cap), rev(rev) {}\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\n edge_t *rev)\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\n }; // class edge_t\n\n class adj_type {\n edge_t *fst, *lst, *clst;\n\n public:\n template <class... Args> edge_t *emplace(Args &&... args) {\n if (lst == clst) {\n size_t len(clst - fst);\n edge_t *nfst = lst = new edge_t[len << 1];\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\n p->rev->rev = lst, *lst = *p;\n delete[] fst;\n fst = nfst;\n clst = lst + len;\n }\n *lst = edge_t(args...);\n return lst++;\n }\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\n ~adj_type() { delete[] fst; }\n edge_t &operator[](size_t i) {\n assert(i < size());\n return *(fst + i);\n }\n size_t size() const { return lst - fst; }\n edge_t *begin() const { return fst; }\n edge_t *end() const { return lst; }\n }; // class adj_type\n\n flow_base(size_t n = 0) : adjs(n) {}\n\n flow_base(const flow_base &other) : adjs(other.size()) {\n for (size_t node{}; node != size(); ++node)\n for (const auto &[src, dst, cap, cost, rev] : other[node])\n if (src == node) {\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\n rev->src = nil;\n } else {\n rev->rev->src = node;\n }\n }\n\n flow_base &operator=(const flow_base &rhs) {\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\n return *this;\n }\n\n size_t size() const { return adjs.size(); }\n\n adj_type &operator[](size_t node) {\n assert(node < size());\n return adjs[node];\n }\n const adj_type &operator[](size_t node) const {\n assert(node < size());\n return adjs[node];\n }\n\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) {\n assert(src < size());\n assert(dst < size());\n assert(!(cap < static_cast<cap_t>(0)));\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\n return ptr;\n }\n\n protected:\n constexpr static size_t nil = -1;\n std::vector<adj_type> adjs;\n}; // class flow_base\n#line 6 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n// Successive shortest paths algorithm.\ntemplate <class cap_t, class cost_t, bool density_tag = false>\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\n using base = flow_base<cap_t, cost_t>;\n using edge_t = typename base::edge_t;\n using base::adjs;\n using base::nil;\n\n cost_t min_cost, total_cost;\n std::vector<cap_t> supp;\n std::vector<cost_t> ptnl;\n\n void copy_member(const min_cost_flow &other) {\n min_cost = other.min_cost;\n total_cost = other.total_cost;\n supp = other.supp;\n ptnl = other.ptnl;\n }\n\n void Dijkstra(std::vector<edge_t *> &last) {\n const cost_t infty(total_cost + 1);\n std::vector<cost_t> nptnl(size(), infty);\n if constexpr (density_tag) {\n // O(V^2)\n std::vector<bool> used(size());\n for (size_t src{}; src != size(); ++src) {\n if (static_cast<cap_t>(0) < supp[src]) {\n used[src] = true;\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\n if (e.avbl() && e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = e.cost;\n last[e.dst] = &e;\n }\n }\n }\n }\n for (;;) {\n size_t src{nil};\n cost_t sp{infty};\n for (size_t node{}; node != size(); ++node) {\n if (used[node] || nptnl[node] == infty) continue;\n cost_t dist{nptnl[node] - ptnl[node]};\n if (dist < sp) {\n sp = dist;\n src = node;\n }\n }\n if (src == nil) break;\n used[src] = true;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = nptnl[src] + e.cost;\n last[e.dst] = &e;\n }\n }\n }\n } else {\n // O((V + E)logV)\n struct node_t {\n size_t id;\n cost_t dist;\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\n };\n std::priority_queue<node_t> que;\n for (size_t src{}; src != size(); ++src) {\n if (supp[src] > static_cast<cap_t>(0)) {\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\n if (e.avbl() && nptnl[e.dst] > e.cost) {\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n while (!que.empty()) {\n auto [src, ndist] = que.top();\n que.pop();\n if (ndist + ptnl[src] != nptnl[src]) continue;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\n que.emplace(e.dst,\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n ptnl.swap(nptnl);\n }\n\n public:\n using base::size;\n\n min_cost_flow(size_t n = 0)\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\n\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\n copy_member(other);\n }\n\n min_cost_flow &operator=(const min_cost_flow &other) {\n base::operator=(other);\n copy_member(other);\n return *this;\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) override {\n assert(src != dst);\n if (cost < static_cast<cost_t>(0)) {\n supp[src] -= cap;\n supp[dst] += cap;\n min_cost += cap * cost;\n total_cost -= cap * cost;\n return base::add_edge(dst, src, cap, -cost);\n }\n total_cost += cap * cost;\n return base::add_edge(src, dst, cap, cost);\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\n const cap_t &upper, const cost_t &cost) {\n assert(!(upper < lower));\n supp[src] -= lower;\n supp[dst] += lower;\n min_cost += lower * cost;\n return add_edge(src, dst, upper - lower, cost);\n }\n\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\n assert(node < size());\n return supp[node] += vol;\n }\n\n const cap_t &demand(size_t node, const cap_t &vol) {\n return supply(node, -vol);\n }\n\n bool flow() {\n for (bool aug = true; aug;) {\n aug = false;\n std::vector<edge_t *> last(size());\n Dijkstra(last);\n std::vector<bool> shut(size());\n for (size_t dst{}; dst != size(); ++dst) {\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\n cap_t resid{-supp[dst]};\n size_t src{dst}, block{nil};\n while (last[src] && !shut[src]) {\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\n src = last[src]->src;\n }\n if (shut[src])\n block = src;\n else {\n if (!(resid < supp[src])) {\n resid = supp[src];\n block = src;\n }\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\n e->cap -= resid;\n e->rev->cap += resid;\n }\n supp[src] -= resid;\n supp[dst] += resid;\n min_cost += ptnl[dst] * resid;\n aug = true;\n }\n if (~block) {\n for (size_t node{dst};; node = last[node]->src) {\n shut[node] = true;\n if (node == block) break;\n }\n }\n }\n }\n }\n return std::none_of(begin(supp), end(supp),\n [](const cap_t &s) { return s < 0 || 0 < s; });\n }\n\n cost_t optimal() {\n assert(flow());\n return min_cost;\n }\n}; // class min_cost_flow\n#line 22 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main() {\n // start here!\n const i64 inf = 1e10;\n int n, m, x;\n cin >> n >> m >> x;\n\n min_cost_flow<i64, i64> base(n * 3);\n // make\n {\n for (int i = 0; i < n; i++) {\n int a, b, p;\n cin >> a >> b >> p;\n base.add_edge(3 * i + 1, 3 * i, inf, p);\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\n base.supply(3 * i, -a);\n base.supply(3 * i + 1, a - b);\n base.supply(3 * i + 2, b);\n }\n }\n for (auto j = 0; j < m; ++j) {\n int u, v, f;\n cin >> u >> v >> f;\n --u, --v;\n if (f > 0) {\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\n } else {\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\n }\n }\n\n auto ok = [&](int t) -> bool {\n auto mcf = base;\n for (int i = 0; i < n; i++) {\n mcf.add_edge(3 * i + 2, 0, inf, t);\n }\n if (mcf.flow()) {\n auto opt = mcf.optimal();\n return opt >= x;\n }\n return false;\n };\n\n auto ans = binary_search(x + 200 * (m + n) + 1, -1, ok);\n if (ans > x + 200 * (m + n))\n cout << \"-1\\n\";\n else\n cout << ans << eol;\n}\n}","accuracy":0.4222222222222222,"time_ms":40,"memory_kb":3680,"score_of_the_acc":-0.7518,"final_rank":18},{"submission_id":"aoj_3171_4886072","code_snippet":"#line 1 \"other/h.cpp\"\n#include <bits/extc++.h>\n#if __has_include(<bit>)\n#include <bit>\n#endif\n#line 7 \"Library/alias.hpp\"\nnamespace workspace {\nconstexpr char eol = '\\n';\nusing namespace std;\nusing i32 = int_least32_t;\nusing i64 = int_least64_t;\nusing i128 = __int128_t;\nusing u32 = uint_least32_t;\nusing u64 = uint_least64_t;\nusing u128 = __uint128_t;\ntemplate <class T, class Comp = less<T>>\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\ntemplate <class T> using stack = std::stack<T, vector<T>>;\n} // namespace workspace\n#line 5 \"Library/config.hpp\"\nnamespace config {\nconst auto start_time{std::chrono::system_clock::now()};\nint64_t elapsed() {\n using namespace std::chrono;\n const auto end_time{system_clock::now()};\n return duration_cast<milliseconds>(end_time - start_time).count();\n}\n__attribute__((constructor)) void setup() {\n using namespace std;\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n#ifdef _buffer_check\n atexit([] {\n char bufc;\n if (cin >> bufc)\n cerr << \"\\n\\033[43m\\033[30mwarning: buffer not empty.\\033[0m\\n\\n\";\n });\n#endif\n}\nunsigned cases(), caseid = 1;\ntemplate <class F> void loop(F main) {\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\n}\n} // namespace config\n#line 2 \"Library/option.hpp\"\n#ifdef ONLINE_JUDGE\n #pragma GCC optimize(\"O3\")\n #pragma GCC target(\"avx,avx2\")\n #pragma GCC optimize(\"unroll-loops\")\n#endif\n#line 2 \"Library/utils/binary_search.hpp\"\n#if __cplusplus >= 201703L\n#include <cassert>\n#include <cmath>\n#include <vector>\nnamespace workspace {\n// binary search on a discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\n iter_type>\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\n assert(ok != ng);\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\n while (1 < dist || dist < -1) {\n iter_type mid(ok + dist / 2);\n if (pred(mid))\n ok = mid, dist -= dist / 2;\n else\n ng = mid, dist /= 2;\n }\n return ok;\n}\n// parallel binary search on each discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\n std::vector<bool>>,\n std::vector<iter_type>>\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\n pred_type pred) {\n std::vector<iter_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n iter_type mid(ok + (ng - ok) / 2);\n if (mids[i] != mid) {\n all_found = false;\n mids[i] = mid;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n// binary search on a real number interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\n real_type>\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\n assert(ok != ng);\n while (ok + eps < ng || ng + eps < ok) {\n real_type mid{(ok + ng) / 2};\n (pred(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n// parallel binary search on each real interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<real_type>>,\n std::vector<bool>>,\n std::vector<real_type>>\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\n const real_type eps, pred_type pred) {\n std::vector<real_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n if (ok + eps < ng || ng + eps < ok) {\n all_found = false;\n mids[i] = (ok + ng) / 2;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/casefmt.hpp\"\nnamespace workspace {\nstd::ostream &casefmt(std::ostream& os) { return os << \"Case #\" << config::caseid << \": \"; }\n} // namespace workspace\n#line 3 \"Library/utils/chval.hpp\"\nnamespace workspace {\ntemplate <class T, class Comp = std::less<T>>\nbool chle(T &x, const T &y, Comp comp = Comp()) {\n return comp(y, x) ? x = y, true : false;\n}\ntemplate <class T, class Comp = std::less<T>>\nbool chge(T &x, const T &y, Comp comp = Comp()) {\n return comp(x, y) ? x = y, true : false;\n}\n} // namespace workspace\n#line 5 \"Library/utils/coordinate_compression.hpp\"\n\ntemplate <class T> class coordinate_compression {\n std::vector<T> uniquely;\n std::vector<size_t> compressed;\n\n public:\n coordinate_compression(const std::vector<T> &raw)\n : uniquely(raw), compressed(raw.size()) {\n std::sort(uniquely.begin(), uniquely.end());\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\n uniquely.end());\n for (size_t i = 0; i != size(); ++i)\n compressed[i] =\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\n uniquely.begin();\n }\n\n size_t operator[](const size_t idx) const {\n assert(idx < size());\n return compressed[idx];\n }\n\n size_t size() const { return compressed.size(); }\n\n size_t count() const { return uniquely.size(); }\n\n T value(const size_t ord) const {\n assert(ord < count());\n return uniquely[ord];\n }\n\n size_t order(const T &value) const {\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\n uniquely.begin();\n }\n\n auto begin() { return compressed.begin(); }\n auto end() { return compressed.end(); }\n auto rbegin() { return compressed.rbegin(); }\n auto rend() { return compressed.rend(); }\n};\n#line 3 \"Library/utils/fixed_point.hpp\"\nnamespace workspace {\n// specify the return type of lambda.\ntemplate <class lambda_type> class fixed_point {\n lambda_type func;\n\n public:\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\n template <class... Args> auto operator()(Args &&... args) const {\n return func(*this, std::forward<Args>(args)...);\n }\n};\n} // namespace workspace\n#line 6 \"Library/utils/hash.hpp\"\n\n#line 3 \"Library/utils/sfinae.hpp\"\n#include <type_traits>\n\ntemplate <class type, template <class> class trait>\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\n\ntemplate <class Container>\nusing element_type = typename std::decay<decltype(\n *std::begin(std::declval<Container&>()))>::type;\n\ntemplate <class T, class = int> struct mapped_of {\n using type = element_type<T>;\n};\ntemplate <class T>\nstruct mapped_of<T,\n typename std::pair<int, typename T::mapped_type>::first_type> {\n using type = typename T::mapped_type;\n};\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\n\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\ntemplate <class T>\nstruct is_integral_ext<\n T, typename std::enable_if<std::is_integral<T>::value>::type>\n : std::true_type {};\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\n#if __cplusplus >= 201402\ntemplate <class T>\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\n#endif\n\ntemplate <typename T, typename = void> struct multiplicable_uint {\n using type = uint_least32_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\n using type = uint_least64_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\n using type = __uint128_t;\n};\n#line 8 \"Library/utils/hash.hpp\"\nnamespace workspace {\ntemplate <class T, class = void> struct hash : std::hash<T> {};\n#if __cplusplus >= 201703L\ntemplate <class Unique_bits_type>\nstruct hash<Unique_bits_type,\n enable_if_trait_type<Unique_bits_type,\n std::has_unique_object_representations>> {\n size_t operator()(uint64_t x) const {\n static const uint64_t m = std::random_device{}();\n x ^= x >> 23;\n x ^= m;\n x ^= x >> 47;\n return x - (x >> 32);\n }\n};\n#endif\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\n return seed ^\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\n}\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\n size_t operator()(const std::pair<T1, T2> &pair) const {\n return hash_combine(hash<T1>()(pair.first), pair.second);\n }\n};\ntemplate <class... T> class hash<std::tuple<T...>> {\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\n struct tuple_hash {\n static uint64_t apply(const Tuple &t) {\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\n std::get<index>(t));\n }\n };\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\n static uint64_t apply(const Tuple &t) { return 0; }\n };\n\n public:\n uint64_t operator()(const std::tuple<T...> &t) const {\n return tuple_hash<std::tuple<T...>>::apply(t);\n }\n};\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\n using key_type = typename hash_table::key_type;\n size_t count(const key_type &key) const {\n return hash_table::find(key) != hash_table::end();\n }\n template <class... Args> auto emplace(Args &&... args) {\n return hash_table::insert(typename hash_table::value_type(args...));\n }\n};\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing cc_hash_table =\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing gp_hash_table =\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped>\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\n} // namespace workspace\n#line 2 \"Library/utils/make_vector.hpp\"\n#if __cplusplus >= 201703L\n#include <vector>\nnamespace workspace {\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\n if constexpr (N)\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\n else\n return init;\n}\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\n return make_vector<T, N>((size_t*)sizes, init);\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/random_number_generator.hpp\"\ntemplate <typename num_type> class random_number_generator {\n typename std::conditional<std::is_integral<num_type>::value,\n std::uniform_int_distribution<num_type>,\n std::uniform_real_distribution<num_type>>::type\n unif;\n\n std::mt19937 engine;\n\n public:\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\n num_type max = std::numeric_limits<num_type>::max())\n : unif(min, max), engine(std::random_device{}()) {}\n\n num_type min() const { return unif.min(); }\n\n num_type max() const { return unif.max(); }\n\n // generate a random number in [min(), max()].\n num_type operator()() { return unif(engine); }\n};\n#line 3 \"Library/utils/read.hpp\"\nnamespace workspace {\n// read with std::cin.\ntemplate <class T = void>\nstruct read\n{\n typename std::remove_const<T>::type value;\n template <class... types>\n read(types... args) : value(args...) { std::cin >> value; }\n operator T() const { return value; }\n};\ntemplate <>\nstruct read<void>\n{\n template <class T>\n operator T() const { T value; std::cin >> value; return value; }\n};\n} // namespace workspace\n#line 4 \"Library/utils/stream.hpp\"\n\n#line 6 \"Library/utils/stream.hpp\"\nnamespace std {\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ' ' << p.second;\n}\ntemplate <class tuple_t, size_t index> struct tuple_is {\n static istream &apply(istream &is, tuple_t &t) {\n tuple_is<tuple_t, index - 1>::apply(is, t);\n return is >> get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\n static istream &apply(istream &is, tuple_t &t) { return is; }\n};\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\n t);\n}\ntemplate <class tuple_t, size_t index> struct tuple_os {\n static ostream &apply(ostream &os, const tuple_t &t) {\n tuple_os<tuple_t, index - 1>::apply(os, t);\n return os << ' ' << get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\n static ostream &apply(ostream &os, const tuple_t &t) {\n return os << get<0>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\n};\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\n t);\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n istream &>::type\noperator>>(istream &is, Container &cont) {\n for (auto &&e : cont) is >> e;\n return is;\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n ostream &>::type\noperator<<(ostream &os, const Container &cont) {\n bool head = true;\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\n return os;\n}\n} // namespace std\n#line 4 \"Library/utils/trinary_search.hpp\"\n// trinary search on discrete range.\ntemplate <class iter_type, class comp_type>\niter_type trinary(iter_type first, iter_type last, comp_type comp)\n{\n assert(first < last);\n intmax_t dist(last - first);\n while(dist > 2)\n {\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\n else first = left, dist -= dist / 3;\n }\n if(dist > 1 && comp(first + 1, first)) ++first;\n return first;\n}\n// trinary search on real numbers.\ntemplate <class comp_type>\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\n{\n assert(first < last);\n while(last - first > eps)\n {\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\n if(comp(left, right)) last = right;\n else first = left;\n }\n return first;\n}\n#line 2 \"Library/utils/wrapper.hpp\"\ntemplate <class Container> class reversed {\n Container &ref, copy;\n\n public:\n reversed(Container &ref) : ref(ref) {}\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\n auto begin() const { return ref.rbegin(); }\n auto end() const { return ref.rend(); }\n};\n#line 9 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main();\n}\nint main() { config::loop(workspace::main); }\n\nunsigned config::cases() {\n // return -1; // unspecified\n // int t; std::cin >> t; return t; // given\n return 1;\n}\n\n#line 4 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n\n#line 4 \"Library/graph/directed/flow/base.hpp\"\n// the base class of flow algorithms.\ntemplate <class cap_t, class cost_t> struct flow_base {\n struct edge_t {\n size_t src, dst;\n cap_t cap;\n cost_t cost;\n edge_t *rev;\n edge_t() = default;\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\n : src(src), dst(dst), cap(cap), rev(rev) {}\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\n edge_t *rev)\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\n }; // class edge_t\n\n class adj_type {\n edge_t *fst, *lst, *clst;\n\n public:\n template <class... Args> edge_t *emplace(Args &&... args) {\n if (lst == clst) {\n size_t len(clst - fst);\n edge_t *nfst = lst = new edge_t[len << 1];\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\n p->rev->rev = lst, *lst = *p;\n delete[] fst;\n fst = nfst;\n clst = lst + len;\n }\n *lst = edge_t(args...);\n return lst++;\n }\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\n ~adj_type() { delete[] fst; }\n edge_t &operator[](size_t i) {\n assert(i < size());\n return *(fst + i);\n }\n size_t size() const { return lst - fst; }\n edge_t *begin() const { return fst; }\n edge_t *end() const { return lst; }\n }; // class adj_type\n\n flow_base(size_t n = 0) : adjs(n) {}\n\n flow_base(const flow_base &other) : adjs(other.size()) {\n for (size_t node{}; node != size(); ++node)\n for (const auto &[src, dst, cap, cost, rev] : other[node])\n if (src == node) {\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\n rev->src = nil;\n } else {\n rev->rev->src = node;\n }\n }\n\n flow_base &operator=(const flow_base &rhs) {\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\n return *this;\n }\n\n size_t size() const { return adjs.size(); }\n\n adj_type &operator[](size_t node) {\n assert(node < size());\n return adjs[node];\n }\n const adj_type &operator[](size_t node) const {\n assert(node < size());\n return adjs[node];\n }\n\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) {\n assert(src < size());\n assert(dst < size());\n assert(!(cap < static_cast<cap_t>(0)));\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\n return ptr;\n }\n\n protected:\n constexpr static size_t nil = -1;\n std::vector<adj_type> adjs;\n}; // class flow_base\n#line 6 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n// Successive shortest paths algorithm.\ntemplate <class cap_t, class cost_t, bool density_tag = false>\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\n using base = flow_base<cap_t, cost_t>;\n using edge_t = typename base::edge_t;\n using base::adjs;\n using base::nil;\n\n cost_t min_cost, total_cost;\n std::vector<cap_t> supp;\n std::vector<cost_t> ptnl;\n\n void copy_member(const min_cost_flow &other) {\n min_cost = other.min_cost;\n total_cost = other.total_cost;\n supp = other.supp;\n ptnl = other.ptnl;\n }\n\n void Dijkstra(std::vector<edge_t *> &last) {\n const cost_t infty(total_cost + 1);\n std::vector<cost_t> nptnl(size(), infty);\n if constexpr (density_tag) {\n // O(V^2)\n std::vector<bool> used(size());\n for (size_t src{}; src != size(); ++src) {\n if (static_cast<cap_t>(0) < supp[src]) {\n used[src] = true;\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\n if (e.avbl() && e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = e.cost;\n last[e.dst] = &e;\n }\n }\n }\n }\n for (;;) {\n size_t src{nil};\n cost_t sp{infty};\n for (size_t node{}; node != size(); ++node) {\n if (used[node] || nptnl[node] == infty) continue;\n cost_t dist{nptnl[node] - ptnl[node]};\n if (dist < sp) {\n sp = dist;\n src = node;\n }\n }\n if (src == nil) break;\n used[src] = true;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = nptnl[src] + e.cost;\n last[e.dst] = &e;\n }\n }\n }\n } else {\n // O((V + E)logV)\n struct node_t {\n size_t id;\n cost_t dist;\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\n };\n std::priority_queue<node_t> que;\n for (size_t src{}; src != size(); ++src) {\n if (supp[src] > static_cast<cap_t>(0)) {\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\n if (e.avbl() && nptnl[e.dst] > e.cost) {\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n while (!que.empty()) {\n auto [src, ndist] = que.top();\n que.pop();\n if (ndist + ptnl[src] != nptnl[src]) continue;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\n que.emplace(e.dst,\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n ptnl.swap(nptnl);\n }\n\n public:\n using base::size;\n\n min_cost_flow(size_t n = 0)\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\n\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\n copy_member(other);\n }\n\n min_cost_flow &operator=(const min_cost_flow &other) {\n base::operator=(other);\n copy_member(other);\n return *this;\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) override {\n assert(src != dst);\n if (cost < static_cast<cost_t>(0)) {\n supp[src] -= cap;\n supp[dst] += cap;\n min_cost += cap * cost;\n total_cost -= cap * cost;\n return base::add_edge(dst, src, cap, -cost);\n }\n total_cost += cap * cost;\n return base::add_edge(src, dst, cap, cost);\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\n const cap_t &upper, const cost_t &cost) {\n assert(!(upper < lower));\n supp[src] -= lower;\n supp[dst] += lower;\n min_cost += lower * cost;\n return add_edge(src, dst, upper - lower, cost);\n }\n\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\n assert(node < size());\n return supp[node] += vol;\n }\n\n const cap_t &demand(size_t node, const cap_t &vol) {\n return supply(node, -vol);\n }\n\n bool flow() {\n for (bool aug = true; aug;) {\n aug = false;\n std::vector<edge_t *> last(size());\n Dijkstra(last);\n std::vector<bool> shut(size());\n for (size_t dst{}; dst != size(); ++dst) {\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\n cap_t resid{-supp[dst]};\n size_t src{dst}, block{nil};\n while (last[src] && !shut[src]) {\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\n src = last[src]->src;\n }\n if (shut[src])\n block = src;\n else {\n if (!(resid < supp[src])) {\n resid = supp[src];\n block = src;\n }\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\n e->cap -= resid;\n e->rev->cap += resid;\n }\n supp[src] -= resid;\n supp[dst] += resid;\n min_cost += ptnl[dst] * resid;\n aug = true;\n }\n if (~block) {\n for (size_t node{dst};; node = last[node]->src) {\n shut[node] = true;\n if (node == block) break;\n }\n }\n }\n }\n }\n return std::none_of(begin(supp), end(supp),\n [](const cap_t &s) { return s < 0 || 0 < s; });\n }\n\n cost_t optimal() {\n assert(flow());\n return min_cost;\n }\n}; // class min_cost_flow\n#line 22 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main() {\n // start here!\n const i64 inf = 1e10;\n int n, m, x;\n cin >> n >> m >> x;\n\n min_cost_flow<i64, i64> base(n * 3);\n // make\n {\n for (int i = 0; i < n; i++) {\n int a, b, p;\n cin >> a >> b >> p;\n base.add_edge(3 * i + 1, 3 * i, inf, p);\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\n base.supply(3 * i, -a);\n base.supply(3 * i + 1, a - b);\n base.supply(3 * i + 2, b);\n }\n }\n for (auto j = 0; j < m; ++j) {\n int u, v, f;\n cin >> u >> v >> f;\n --u, --v;\n if (f > 0) {\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\n } else {\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\n }\n }\n\n auto ok = [&](int t) -> bool {\n auto mcf = base;\n for (int i = 0; i < n; i++) {\n mcf.add_edge(3 * i + 2, 0, inf, t);\n }\n if (mcf.flow()) {\n auto opt = mcf.optimal();\n return opt >= x;\n }\n return false;\n };\n\n auto ans = binary_search(x + 100 * (m + n) + 1, -1, ok);\n if (ans > x + 100 * (m + n))\n cout << \"-1\\n\";\n else\n cout << ans << eol;\n}\n}","accuracy":0.4222222222222222,"time_ms":40,"memory_kb":3604,"score_of_the_acc":-0.6216,"final_rank":15},{"submission_id":"aoj_3171_4886068","code_snippet":"#line 1 \"other/h.cpp\"\n#include <bits/extc++.h>\n#if __has_include(<bit>)\n#include <bit>\n#endif\n#line 7 \"Library/alias.hpp\"\nnamespace workspace {\nconstexpr char eol = '\\n';\nusing namespace std;\nusing i32 = int_least32_t;\nusing i64 = int_least64_t;\nusing i128 = __int128_t;\nusing u32 = uint_least32_t;\nusing u64 = uint_least64_t;\nusing u128 = __uint128_t;\ntemplate <class T, class Comp = less<T>>\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\ntemplate <class T> using stack = std::stack<T, vector<T>>;\n} // namespace workspace\n#line 5 \"Library/config.hpp\"\nnamespace config {\nconst auto start_time{std::chrono::system_clock::now()};\nint64_t elapsed() {\n using namespace std::chrono;\n const auto end_time{system_clock::now()};\n return duration_cast<milliseconds>(end_time - start_time).count();\n}\n__attribute__((constructor)) void setup() {\n using namespace std;\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n#ifdef _buffer_check\n atexit([] {\n char bufc;\n if (cin >> bufc)\n cerr << \"\\n\\033[43m\\033[30mwarning: buffer not empty.\\033[0m\\n\\n\";\n });\n#endif\n}\nunsigned cases(), caseid = 1;\ntemplate <class F> void loop(F main) {\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\n}\n} // namespace config\n#line 2 \"Library/option.hpp\"\n#ifdef ONLINE_JUDGE\n #pragma GCC optimize(\"O3\")\n #pragma GCC target(\"avx,avx2\")\n #pragma GCC optimize(\"unroll-loops\")\n#endif\n#line 2 \"Library/utils/binary_search.hpp\"\n#if __cplusplus >= 201703L\n#include <cassert>\n#include <cmath>\n#include <vector>\nnamespace workspace {\n// binary search on a discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\n iter_type>\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\n assert(ok != ng);\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\n while (1 < dist || dist < -1) {\n iter_type mid(ok + dist / 2);\n if (pred(mid))\n ok = mid, dist -= dist / 2;\n else\n ng = mid, dist /= 2;\n }\n return ok;\n}\n// parallel binary search on each discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\n std::vector<bool>>,\n std::vector<iter_type>>\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\n pred_type pred) {\n std::vector<iter_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n iter_type mid(ok + (ng - ok) / 2);\n if (mids[i] != mid) {\n all_found = false;\n mids[i] = mid;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n// binary search on a real number interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\n real_type>\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\n assert(ok != ng);\n while (ok + eps < ng || ng + eps < ok) {\n real_type mid{(ok + ng) / 2};\n (pred(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n// parallel binary search on each real interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<real_type>>,\n std::vector<bool>>,\n std::vector<real_type>>\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\n const real_type eps, pred_type pred) {\n std::vector<real_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n if (ok + eps < ng || ng + eps < ok) {\n all_found = false;\n mids[i] = (ok + ng) / 2;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/casefmt.hpp\"\nnamespace workspace {\nstd::ostream &casefmt(std::ostream& os) { return os << \"Case #\" << config::caseid << \": \"; }\n} // namespace workspace\n#line 3 \"Library/utils/chval.hpp\"\nnamespace workspace {\ntemplate <class T, class Comp = std::less<T>>\nbool chle(T &x, const T &y, Comp comp = Comp()) {\n return comp(y, x) ? x = y, true : false;\n}\ntemplate <class T, class Comp = std::less<T>>\nbool chge(T &x, const T &y, Comp comp = Comp()) {\n return comp(x, y) ? x = y, true : false;\n}\n} // namespace workspace\n#line 5 \"Library/utils/coordinate_compression.hpp\"\n\ntemplate <class T> class coordinate_compression {\n std::vector<T> uniquely;\n std::vector<size_t> compressed;\n\n public:\n coordinate_compression(const std::vector<T> &raw)\n : uniquely(raw), compressed(raw.size()) {\n std::sort(uniquely.begin(), uniquely.end());\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\n uniquely.end());\n for (size_t i = 0; i != size(); ++i)\n compressed[i] =\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\n uniquely.begin();\n }\n\n size_t operator[](const size_t idx) const {\n assert(idx < size());\n return compressed[idx];\n }\n\n size_t size() const { return compressed.size(); }\n\n size_t count() const { return uniquely.size(); }\n\n T value(const size_t ord) const {\n assert(ord < count());\n return uniquely[ord];\n }\n\n size_t order(const T &value) const {\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\n uniquely.begin();\n }\n\n auto begin() { return compressed.begin(); }\n auto end() { return compressed.end(); }\n auto rbegin() { return compressed.rbegin(); }\n auto rend() { return compressed.rend(); }\n};\n#line 3 \"Library/utils/fixed_point.hpp\"\nnamespace workspace {\n// specify the return type of lambda.\ntemplate <class lambda_type> class fixed_point {\n lambda_type func;\n\n public:\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\n template <class... Args> auto operator()(Args &&... args) const {\n return func(*this, std::forward<Args>(args)...);\n }\n};\n} // namespace workspace\n#line 6 \"Library/utils/hash.hpp\"\n\n#line 3 \"Library/utils/sfinae.hpp\"\n#include <type_traits>\n\ntemplate <class type, template <class> class trait>\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\n\ntemplate <class Container>\nusing element_type = typename std::decay<decltype(\n *std::begin(std::declval<Container&>()))>::type;\n\ntemplate <class T, class = int> struct mapped_of {\n using type = element_type<T>;\n};\ntemplate <class T>\nstruct mapped_of<T,\n typename std::pair<int, typename T::mapped_type>::first_type> {\n using type = typename T::mapped_type;\n};\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\n\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\ntemplate <class T>\nstruct is_integral_ext<\n T, typename std::enable_if<std::is_integral<T>::value>::type>\n : std::true_type {};\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\n#if __cplusplus >= 201402\ntemplate <class T>\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\n#endif\n\ntemplate <typename T, typename = void> struct multiplicable_uint {\n using type = uint_least32_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\n using type = uint_least64_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\n using type = __uint128_t;\n};\n#line 8 \"Library/utils/hash.hpp\"\nnamespace workspace {\ntemplate <class T, class = void> struct hash : std::hash<T> {};\n#if __cplusplus >= 201703L\ntemplate <class Unique_bits_type>\nstruct hash<Unique_bits_type,\n enable_if_trait_type<Unique_bits_type,\n std::has_unique_object_representations>> {\n size_t operator()(uint64_t x) const {\n static const uint64_t m = std::random_device{}();\n x ^= x >> 23;\n x ^= m;\n x ^= x >> 47;\n return x - (x >> 32);\n }\n};\n#endif\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\n return seed ^\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\n}\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\n size_t operator()(const std::pair<T1, T2> &pair) const {\n return hash_combine(hash<T1>()(pair.first), pair.second);\n }\n};\ntemplate <class... T> class hash<std::tuple<T...>> {\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\n struct tuple_hash {\n static uint64_t apply(const Tuple &t) {\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\n std::get<index>(t));\n }\n };\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\n static uint64_t apply(const Tuple &t) { return 0; }\n };\n\n public:\n uint64_t operator()(const std::tuple<T...> &t) const {\n return tuple_hash<std::tuple<T...>>::apply(t);\n }\n};\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\n using key_type = typename hash_table::key_type;\n size_t count(const key_type &key) const {\n return hash_table::find(key) != hash_table::end();\n }\n template <class... Args> auto emplace(Args &&... args) {\n return hash_table::insert(typename hash_table::value_type(args...));\n }\n};\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing cc_hash_table =\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing gp_hash_table =\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped>\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\n} // namespace workspace\n#line 2 \"Library/utils/make_vector.hpp\"\n#if __cplusplus >= 201703L\n#include <vector>\nnamespace workspace {\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\n if constexpr (N)\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\n else\n return init;\n}\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\n return make_vector<T, N>((size_t*)sizes, init);\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/random_number_generator.hpp\"\ntemplate <typename num_type> class random_number_generator {\n typename std::conditional<std::is_integral<num_type>::value,\n std::uniform_int_distribution<num_type>,\n std::uniform_real_distribution<num_type>>::type\n unif;\n\n std::mt19937 engine;\n\n public:\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\n num_type max = std::numeric_limits<num_type>::max())\n : unif(min, max), engine(std::random_device{}()) {}\n\n num_type min() const { return unif.min(); }\n\n num_type max() const { return unif.max(); }\n\n // generate a random number in [min(), max()].\n num_type operator()() { return unif(engine); }\n};\n#line 3 \"Library/utils/read.hpp\"\nnamespace workspace {\n// read with std::cin.\ntemplate <class T = void>\nstruct read\n{\n typename std::remove_const<T>::type value;\n template <class... types>\n read(types... args) : value(args...) { std::cin >> value; }\n operator T() const { return value; }\n};\ntemplate <>\nstruct read<void>\n{\n template <class T>\n operator T() const { T value; std::cin >> value; return value; }\n};\n} // namespace workspace\n#line 4 \"Library/utils/stream.hpp\"\n\n#line 6 \"Library/utils/stream.hpp\"\nnamespace std {\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ' ' << p.second;\n}\ntemplate <class tuple_t, size_t index> struct tuple_is {\n static istream &apply(istream &is, tuple_t &t) {\n tuple_is<tuple_t, index - 1>::apply(is, t);\n return is >> get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\n static istream &apply(istream &is, tuple_t &t) { return is; }\n};\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\n t);\n}\ntemplate <class tuple_t, size_t index> struct tuple_os {\n static ostream &apply(ostream &os, const tuple_t &t) {\n tuple_os<tuple_t, index - 1>::apply(os, t);\n return os << ' ' << get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\n static ostream &apply(ostream &os, const tuple_t &t) {\n return os << get<0>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\n};\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\n t);\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n istream &>::type\noperator>>(istream &is, Container &cont) {\n for (auto &&e : cont) is >> e;\n return is;\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n ostream &>::type\noperator<<(ostream &os, const Container &cont) {\n bool head = true;\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\n return os;\n}\n} // namespace std\n#line 4 \"Library/utils/trinary_search.hpp\"\n// trinary search on discrete range.\ntemplate <class iter_type, class comp_type>\niter_type trinary(iter_type first, iter_type last, comp_type comp)\n{\n assert(first < last);\n intmax_t dist(last - first);\n while(dist > 2)\n {\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\n else first = left, dist -= dist / 3;\n }\n if(dist > 1 && comp(first + 1, first)) ++first;\n return first;\n}\n// trinary search on real numbers.\ntemplate <class comp_type>\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\n{\n assert(first < last);\n while(last - first > eps)\n {\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\n if(comp(left, right)) last = right;\n else first = left;\n }\n return first;\n}\n#line 2 \"Library/utils/wrapper.hpp\"\ntemplate <class Container> class reversed {\n Container &ref, copy;\n\n public:\n reversed(Container &ref) : ref(ref) {}\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\n auto begin() const { return ref.rbegin(); }\n auto end() const { return ref.rend(); }\n};\n#line 9 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main();\n}\nint main() { config::loop(workspace::main); }\n\nunsigned config::cases() {\n // return -1; // unspecified\n // int t; std::cin >> t; return t; // given\n return 1;\n}\n\n#line 4 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n\n#line 4 \"Library/graph/directed/flow/base.hpp\"\n// the base class of flow algorithms.\ntemplate <class cap_t, class cost_t> struct flow_base {\n struct edge_t {\n size_t src, dst;\n cap_t cap;\n cost_t cost;\n edge_t *rev;\n edge_t() = default;\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\n : src(src), dst(dst), cap(cap), rev(rev) {}\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\n edge_t *rev)\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\n }; // class edge_t\n\n class adj_type {\n edge_t *fst, *lst, *clst;\n\n public:\n template <class... Args> edge_t *emplace(Args &&... args) {\n if (lst == clst) {\n size_t len(clst - fst);\n edge_t *nfst = lst = new edge_t[len << 1];\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\n p->rev->rev = lst, *lst = *p;\n delete[] fst;\n fst = nfst;\n clst = lst + len;\n }\n *lst = edge_t(args...);\n return lst++;\n }\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\n ~adj_type() { delete[] fst; }\n edge_t &operator[](size_t i) {\n assert(i < size());\n return *(fst + i);\n }\n size_t size() const { return lst - fst; }\n edge_t *begin() const { return fst; }\n edge_t *end() const { return lst; }\n }; // class adj_type\n\n flow_base(size_t n = 0) : adjs(n) {}\n\n flow_base(const flow_base &other) : adjs(other.size()) {\n for (size_t node{}; node != size(); ++node)\n for (const auto &[src, dst, cap, cost, rev] : other[node])\n if (src == node) {\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\n rev->src = nil;\n } else {\n rev->rev->src = node;\n }\n }\n\n flow_base &operator=(const flow_base &rhs) {\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\n return *this;\n }\n\n size_t size() const { return adjs.size(); }\n\n adj_type &operator[](size_t node) {\n assert(node < size());\n return adjs[node];\n }\n const adj_type &operator[](size_t node) const {\n assert(node < size());\n return adjs[node];\n }\n\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) {\n assert(src < size());\n assert(dst < size());\n assert(!(cap < static_cast<cap_t>(0)));\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\n return ptr;\n }\n\n protected:\n constexpr static size_t nil = -1;\n std::vector<adj_type> adjs;\n}; // class flow_base\n#line 6 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n// Successive shortest paths algorithm.\ntemplate <class cap_t, class cost_t, bool density_tag = false>\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\n using base = flow_base<cap_t, cost_t>;\n using edge_t = typename base::edge_t;\n using base::adjs;\n using base::nil;\n\n cost_t min_cost, total_cost;\n std::vector<cap_t> supp;\n std::vector<cost_t> ptnl;\n\n void copy_member(const min_cost_flow &other) {\n min_cost = other.min_cost;\n total_cost = other.total_cost;\n supp = other.supp;\n ptnl = other.ptnl;\n }\n\n void Dijkstra(std::vector<edge_t *> &last) {\n const cost_t infty(total_cost + 1);\n std::vector<cost_t> nptnl(size(), infty);\n if constexpr (density_tag) {\n // O(V^2)\n std::vector<bool> used(size());\n for (size_t src{}; src != size(); ++src) {\n if (static_cast<cap_t>(0) < supp[src]) {\n used[src] = true;\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\n if (e.avbl() && e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = e.cost;\n last[e.dst] = &e;\n }\n }\n }\n }\n for (;;) {\n size_t src{nil};\n cost_t sp{infty};\n for (size_t node{}; node != size(); ++node) {\n if (used[node] || nptnl[node] == infty) continue;\n cost_t dist{nptnl[node] - ptnl[node]};\n if (dist < sp) {\n sp = dist;\n src = node;\n }\n }\n if (src == nil) break;\n used[src] = true;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = nptnl[src] + e.cost;\n last[e.dst] = &e;\n }\n }\n }\n } else {\n // O((V + E)logV)\n struct node_t {\n size_t id;\n cost_t dist;\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\n };\n std::priority_queue<node_t> que;\n for (size_t src{}; src != size(); ++src) {\n if (supp[src] > static_cast<cap_t>(0)) {\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\n if (e.avbl() && nptnl[e.dst] > e.cost) {\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n while (!que.empty()) {\n auto [src, ndist] = que.top();\n que.pop();\n if (ndist + ptnl[src] != nptnl[src]) continue;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\n que.emplace(e.dst,\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n ptnl.swap(nptnl);\n }\n\n public:\n using base::size;\n\n min_cost_flow(size_t n = 0)\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\n\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\n copy_member(other);\n }\n\n min_cost_flow &operator=(const min_cost_flow &other) {\n base::operator=(other);\n copy_member(other);\n return *this;\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) override {\n assert(src != dst);\n if (cost < static_cast<cost_t>(0)) {\n supp[src] -= cap;\n supp[dst] += cap;\n min_cost += cap * cost;\n total_cost -= cap * cost;\n return base::add_edge(dst, src, cap, -cost);\n }\n total_cost += cap * cost;\n return base::add_edge(src, dst, cap, cost);\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\n const cap_t &upper, const cost_t &cost) {\n assert(!(upper < lower));\n supp[src] -= lower;\n supp[dst] += lower;\n min_cost += lower * cost;\n return add_edge(src, dst, upper - lower, cost);\n }\n\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\n assert(node < size());\n return supp[node] += vol;\n }\n\n const cap_t &demand(size_t node, const cap_t &vol) {\n return supply(node, -vol);\n }\n\n bool flow() {\n for (bool aug = true; aug;) {\n aug = false;\n std::vector<edge_t *> last(size());\n Dijkstra(last);\n std::vector<bool> shut(size());\n for (size_t dst{}; dst != size(); ++dst) {\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\n cap_t resid{-supp[dst]};\n size_t src{dst}, block{nil};\n while (last[src] && !shut[src]) {\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\n src = last[src]->src;\n }\n if (shut[src])\n block = src;\n else {\n if (!(resid < supp[src])) {\n resid = supp[src];\n block = src;\n }\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\n e->cap -= resid;\n e->rev->cap += resid;\n }\n supp[src] -= resid;\n supp[dst] += resid;\n min_cost += ptnl[dst] * resid;\n aug = true;\n }\n if (~block) {\n for (size_t node{dst};; node = last[node]->src) {\n shut[node] = true;\n if (node == block) break;\n }\n }\n }\n }\n }\n return std::none_of(begin(supp), end(supp),\n [](const cap_t &s) { return s < 0 || 0 < s; });\n }\n\n cost_t optimal() {\n assert(flow());\n return min_cost;\n }\n}; // class min_cost_flow\n#line 22 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main() {\n // start here!\n const i64 inf = 1e10;\n int n, m, x;\n cin >> n >> m >> x;\n\n min_cost_flow<i64, i64> base(n * 3);\n // make\n {\n for (int i = 0; i < n; i++) {\n int a, b, p;\n cin >> a >> b >> p;\n base.add_edge(3 * i + 1, 3 * i, inf, p);\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\n base.supply(3 * i, -a);\n base.supply(3 * i + 1, a - b);\n base.supply(3 * i + 2, b);\n }\n }\n for (auto j = 0; j < m; ++j) {\n int u, v, f;\n cin >> u >> v >> f;\n --u, --v;\n if (f > 0) {\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\n } else {\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\n }\n }\n\n auto ok = [&](int t) -> bool {\n auto mcf = base;\n for (int i = 0; i < n; i++) {\n mcf.add_edge(3 * i + 2, 0, inf, t);\n }\n if (mcf.flow()) {\n auto opt = mcf.optimal();\n return opt >= x;\n }\n return false;\n };\n\n auto ans = binary_search(x + 100 * n + 1, -1, ok);\n if (ans > x + 100 * n)\n cout << \"-1\\n\";\n else\n cout << ans << eol;\n}\n}","accuracy":0.4222222222222222,"time_ms":40,"memory_kb":3580,"score_of_the_acc":-0.5805,"final_rank":13},{"submission_id":"aoj_3171_4886065","code_snippet":"#line 1 \"other/h.cpp\"\n#include <bits/extc++.h>\n#if __has_include(<bit>)\n#include <bit>\n#endif\n#line 7 \"Library/alias.hpp\"\nnamespace workspace {\nconstexpr char eol = '\\n';\nusing namespace std;\nusing i32 = int_least32_t;\nusing i64 = int_least64_t;\nusing i128 = __int128_t;\nusing u32 = uint_least32_t;\nusing u64 = uint_least64_t;\nusing u128 = __uint128_t;\ntemplate <class T, class Comp = less<T>>\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\ntemplate <class T> using stack = std::stack<T, vector<T>>;\n} // namespace workspace\n#line 5 \"Library/config.hpp\"\nnamespace config {\nconst auto start_time{std::chrono::system_clock::now()};\nint64_t elapsed() {\n using namespace std::chrono;\n const auto end_time{system_clock::now()};\n return duration_cast<milliseconds>(end_time - start_time).count();\n}\n__attribute__((constructor)) void setup() {\n using namespace std;\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n#ifdef _buffer_check\n atexit([] {\n char bufc;\n if (cin >> bufc)\n cerr << \"\\n\\033[43m\\033[30mwarning: buffer not empty.\\033[0m\\n\\n\";\n });\n#endif\n}\nunsigned cases(), caseid = 1;\ntemplate <class F> void loop(F main) {\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\n}\n} // namespace config\n#line 2 \"Library/option.hpp\"\n#ifdef ONLINE_JUDGE\n #pragma GCC optimize(\"O3\")\n #pragma GCC target(\"avx,avx2\")\n #pragma GCC optimize(\"unroll-loops\")\n#endif\n#line 2 \"Library/utils/binary_search.hpp\"\n#if __cplusplus >= 201703L\n#include <cassert>\n#include <cmath>\n#include <vector>\nnamespace workspace {\n// binary search on a discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\n iter_type>\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\n assert(ok != ng);\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\n while (1 < dist || dist < -1) {\n iter_type mid(ok + dist / 2);\n if (pred(mid))\n ok = mid, dist -= dist / 2;\n else\n ng = mid, dist /= 2;\n }\n return ok;\n}\n// parallel binary search on each discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\n std::vector<bool>>,\n std::vector<iter_type>>\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\n pred_type pred) {\n std::vector<iter_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n iter_type mid(ok + (ng - ok) / 2);\n if (mids[i] != mid) {\n all_found = false;\n mids[i] = mid;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n// binary search on a real number interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\n real_type>\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\n assert(ok != ng);\n while (ok + eps < ng || ng + eps < ok) {\n real_type mid{(ok + ng) / 2};\n (pred(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n// parallel binary search on each real interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<real_type>>,\n std::vector<bool>>,\n std::vector<real_type>>\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\n const real_type eps, pred_type pred) {\n std::vector<real_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n if (ok + eps < ng || ng + eps < ok) {\n all_found = false;\n mids[i] = (ok + ng) / 2;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/casefmt.hpp\"\nnamespace workspace {\nstd::ostream &casefmt(std::ostream& os) { return os << \"Case #\" << config::caseid << \": \"; }\n} // namespace workspace\n#line 3 \"Library/utils/chval.hpp\"\nnamespace workspace {\ntemplate <class T, class Comp = std::less<T>>\nbool chle(T &x, const T &y, Comp comp = Comp()) {\n return comp(y, x) ? x = y, true : false;\n}\ntemplate <class T, class Comp = std::less<T>>\nbool chge(T &x, const T &y, Comp comp = Comp()) {\n return comp(x, y) ? x = y, true : false;\n}\n} // namespace workspace\n#line 5 \"Library/utils/coordinate_compression.hpp\"\n\ntemplate <class T> class coordinate_compression {\n std::vector<T> uniquely;\n std::vector<size_t> compressed;\n\n public:\n coordinate_compression(const std::vector<T> &raw)\n : uniquely(raw), compressed(raw.size()) {\n std::sort(uniquely.begin(), uniquely.end());\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\n uniquely.end());\n for (size_t i = 0; i != size(); ++i)\n compressed[i] =\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\n uniquely.begin();\n }\n\n size_t operator[](const size_t idx) const {\n assert(idx < size());\n return compressed[idx];\n }\n\n size_t size() const { return compressed.size(); }\n\n size_t count() const { return uniquely.size(); }\n\n T value(const size_t ord) const {\n assert(ord < count());\n return uniquely[ord];\n }\n\n size_t order(const T &value) const {\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\n uniquely.begin();\n }\n\n auto begin() { return compressed.begin(); }\n auto end() { return compressed.end(); }\n auto rbegin() { return compressed.rbegin(); }\n auto rend() { return compressed.rend(); }\n};\n#line 3 \"Library/utils/fixed_point.hpp\"\nnamespace workspace {\n// specify the return type of lambda.\ntemplate <class lambda_type> class fixed_point {\n lambda_type func;\n\n public:\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\n template <class... Args> auto operator()(Args &&... args) const {\n return func(*this, std::forward<Args>(args)...);\n }\n};\n} // namespace workspace\n#line 6 \"Library/utils/hash.hpp\"\n\n#line 3 \"Library/utils/sfinae.hpp\"\n#include <type_traits>\n\ntemplate <class type, template <class> class trait>\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\n\ntemplate <class Container>\nusing element_type = typename std::decay<decltype(\n *std::begin(std::declval<Container&>()))>::type;\n\ntemplate <class T, class = int> struct mapped_of {\n using type = element_type<T>;\n};\ntemplate <class T>\nstruct mapped_of<T,\n typename std::pair<int, typename T::mapped_type>::first_type> {\n using type = typename T::mapped_type;\n};\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\n\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\ntemplate <class T>\nstruct is_integral_ext<\n T, typename std::enable_if<std::is_integral<T>::value>::type>\n : std::true_type {};\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\n#if __cplusplus >= 201402\ntemplate <class T>\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\n#endif\n\ntemplate <typename T, typename = void> struct multiplicable_uint {\n using type = uint_least32_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\n using type = uint_least64_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\n using type = __uint128_t;\n};\n#line 8 \"Library/utils/hash.hpp\"\nnamespace workspace {\ntemplate <class T, class = void> struct hash : std::hash<T> {};\n#if __cplusplus >= 201703L\ntemplate <class Unique_bits_type>\nstruct hash<Unique_bits_type,\n enable_if_trait_type<Unique_bits_type,\n std::has_unique_object_representations>> {\n size_t operator()(uint64_t x) const {\n static const uint64_t m = std::random_device{}();\n x ^= x >> 23;\n x ^= m;\n x ^= x >> 47;\n return x - (x >> 32);\n }\n};\n#endif\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\n return seed ^\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\n}\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\n size_t operator()(const std::pair<T1, T2> &pair) const {\n return hash_combine(hash<T1>()(pair.first), pair.second);\n }\n};\ntemplate <class... T> class hash<std::tuple<T...>> {\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\n struct tuple_hash {\n static uint64_t apply(const Tuple &t) {\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\n std::get<index>(t));\n }\n };\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\n static uint64_t apply(const Tuple &t) { return 0; }\n };\n\n public:\n uint64_t operator()(const std::tuple<T...> &t) const {\n return tuple_hash<std::tuple<T...>>::apply(t);\n }\n};\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\n using key_type = typename hash_table::key_type;\n size_t count(const key_type &key) const {\n return hash_table::find(key) != hash_table::end();\n }\n template <class... Args> auto emplace(Args &&... args) {\n return hash_table::insert(typename hash_table::value_type(args...));\n }\n};\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing cc_hash_table =\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing gp_hash_table =\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped>\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\n} // namespace workspace\n#line 2 \"Library/utils/make_vector.hpp\"\n#if __cplusplus >= 201703L\n#include <vector>\nnamespace workspace {\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\n if constexpr (N)\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\n else\n return init;\n}\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\n return make_vector<T, N>((size_t*)sizes, init);\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/random_number_generator.hpp\"\ntemplate <typename num_type> class random_number_generator {\n typename std::conditional<std::is_integral<num_type>::value,\n std::uniform_int_distribution<num_type>,\n std::uniform_real_distribution<num_type>>::type\n unif;\n\n std::mt19937 engine;\n\n public:\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\n num_type max = std::numeric_limits<num_type>::max())\n : unif(min, max), engine(std::random_device{}()) {}\n\n num_type min() const { return unif.min(); }\n\n num_type max() const { return unif.max(); }\n\n // generate a random number in [min(), max()].\n num_type operator()() { return unif(engine); }\n};\n#line 3 \"Library/utils/read.hpp\"\nnamespace workspace {\n// read with std::cin.\ntemplate <class T = void>\nstruct read\n{\n typename std::remove_const<T>::type value;\n template <class... types>\n read(types... args) : value(args...) { std::cin >> value; }\n operator T() const { return value; }\n};\ntemplate <>\nstruct read<void>\n{\n template <class T>\n operator T() const { T value; std::cin >> value; return value; }\n};\n} // namespace workspace\n#line 4 \"Library/utils/stream.hpp\"\n\n#line 6 \"Library/utils/stream.hpp\"\nnamespace std {\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ' ' << p.second;\n}\ntemplate <class tuple_t, size_t index> struct tuple_is {\n static istream &apply(istream &is, tuple_t &t) {\n tuple_is<tuple_t, index - 1>::apply(is, t);\n return is >> get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\n static istream &apply(istream &is, tuple_t &t) { return is; }\n};\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\n t);\n}\ntemplate <class tuple_t, size_t index> struct tuple_os {\n static ostream &apply(ostream &os, const tuple_t &t) {\n tuple_os<tuple_t, index - 1>::apply(os, t);\n return os << ' ' << get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\n static ostream &apply(ostream &os, const tuple_t &t) {\n return os << get<0>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\n};\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\n t);\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n istream &>::type\noperator>>(istream &is, Container &cont) {\n for (auto &&e : cont) is >> e;\n return is;\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n ostream &>::type\noperator<<(ostream &os, const Container &cont) {\n bool head = true;\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\n return os;\n}\n} // namespace std\n#line 4 \"Library/utils/trinary_search.hpp\"\n// trinary search on discrete range.\ntemplate <class iter_type, class comp_type>\niter_type trinary(iter_type first, iter_type last, comp_type comp)\n{\n assert(first < last);\n intmax_t dist(last - first);\n while(dist > 2)\n {\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\n else first = left, dist -= dist / 3;\n }\n if(dist > 1 && comp(first + 1, first)) ++first;\n return first;\n}\n// trinary search on real numbers.\ntemplate <class comp_type>\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\n{\n assert(first < last);\n while(last - first > eps)\n {\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\n if(comp(left, right)) last = right;\n else first = left;\n }\n return first;\n}\n#line 2 \"Library/utils/wrapper.hpp\"\ntemplate <class Container> class reversed {\n Container &ref, copy;\n\n public:\n reversed(Container &ref) : ref(ref) {}\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\n auto begin() const { return ref.rbegin(); }\n auto end() const { return ref.rend(); }\n};\n#line 9 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main();\n}\nint main() { config::loop(workspace::main); }\n\nunsigned config::cases() {\n // return -1; // unspecified\n // int t; std::cin >> t; return t; // given\n return 1;\n}\n\n#line 4 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n\n#line 4 \"Library/graph/directed/flow/base.hpp\"\n// the base class of flow algorithms.\ntemplate <class cap_t, class cost_t> struct flow_base {\n struct edge_t {\n size_t src, dst;\n cap_t cap;\n cost_t cost;\n edge_t *rev;\n edge_t() = default;\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\n : src(src), dst(dst), cap(cap), rev(rev) {}\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\n edge_t *rev)\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\n }; // class edge_t\n\n class adj_type {\n edge_t *fst, *lst, *clst;\n\n public:\n template <class... Args> edge_t *emplace(Args &&... args) {\n if (lst == clst) {\n size_t len(clst - fst);\n edge_t *nfst = lst = new edge_t[len << 1];\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\n p->rev->rev = lst, *lst = *p;\n delete[] fst;\n fst = nfst;\n clst = lst + len;\n }\n *lst = edge_t(args...);\n return lst++;\n }\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\n ~adj_type() { delete[] fst; }\n edge_t &operator[](size_t i) {\n assert(i < size());\n return *(fst + i);\n }\n size_t size() const { return lst - fst; }\n edge_t *begin() const { return fst; }\n edge_t *end() const { return lst; }\n }; // class adj_type\n\n flow_base(size_t n = 0) : adjs(n) {}\n\n flow_base(const flow_base &other) : adjs(other.size()) {\n for (size_t node{}; node != size(); ++node)\n for (const auto &[src, dst, cap, cost, rev] : other[node])\n if (src == node) {\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\n rev->src = nil;\n } else {\n rev->rev->src = node;\n }\n }\n\n flow_base &operator=(const flow_base &rhs) {\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\n return *this;\n }\n\n size_t size() const { return adjs.size(); }\n\n adj_type &operator[](size_t node) {\n assert(node < size());\n return adjs[node];\n }\n const adj_type &operator[](size_t node) const {\n assert(node < size());\n return adjs[node];\n }\n\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) {\n assert(src < size());\n assert(dst < size());\n assert(!(cap < static_cast<cap_t>(0)));\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\n return ptr;\n }\n\n protected:\n constexpr static size_t nil = -1;\n std::vector<adj_type> adjs;\n}; // class flow_base\n#line 6 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n// Successive shortest paths algorithm.\ntemplate <class cap_t, class cost_t, bool density_tag = false>\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\n using base = flow_base<cap_t, cost_t>;\n using edge_t = typename base::edge_t;\n using base::adjs;\n using base::nil;\n\n cost_t min_cost, total_cost;\n std::vector<cap_t> supp;\n std::vector<cost_t> ptnl;\n\n void copy_member(const min_cost_flow &other) {\n min_cost = other.min_cost;\n total_cost = other.total_cost;\n supp = other.supp;\n ptnl = other.ptnl;\n }\n\n void Dijkstra(std::vector<edge_t *> &last) {\n const cost_t infty(total_cost + 1);\n std::vector<cost_t> nptnl(size(), infty);\n if constexpr (density_tag) {\n // O(V^2)\n std::vector<bool> used(size());\n for (size_t src{}; src != size(); ++src) {\n if (static_cast<cap_t>(0) < supp[src]) {\n used[src] = true;\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\n if (e.avbl() && e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = e.cost;\n last[e.dst] = &e;\n }\n }\n }\n }\n for (;;) {\n size_t src{nil};\n cost_t sp{infty};\n for (size_t node{}; node != size(); ++node) {\n if (used[node] || nptnl[node] == infty) continue;\n cost_t dist{nptnl[node] - ptnl[node]};\n if (dist < sp) {\n sp = dist;\n src = node;\n }\n }\n if (src == nil) break;\n used[src] = true;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = nptnl[src] + e.cost;\n last[e.dst] = &e;\n }\n }\n }\n } else {\n // O((V + E)logV)\n struct node_t {\n size_t id;\n cost_t dist;\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\n };\n std::priority_queue<node_t> que;\n for (size_t src{}; src != size(); ++src) {\n if (supp[src] > static_cast<cap_t>(0)) {\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\n if (e.avbl() && nptnl[e.dst] > e.cost) {\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n while (!que.empty()) {\n auto [src, ndist] = que.top();\n que.pop();\n if (ndist + ptnl[src] != nptnl[src]) continue;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\n que.emplace(e.dst,\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n ptnl.swap(nptnl);\n }\n\n public:\n using base::size;\n\n min_cost_flow(size_t n = 0)\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\n\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\n copy_member(other);\n }\n\n min_cost_flow &operator=(const min_cost_flow &other) {\n base::operator=(other);\n copy_member(other);\n return *this;\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) override {\n assert(src != dst);\n if (cost < static_cast<cost_t>(0)) {\n supp[src] -= cap;\n supp[dst] += cap;\n min_cost += cap * cost;\n total_cost -= cap * cost;\n return base::add_edge(dst, src, cap, -cost);\n }\n total_cost += cap * cost;\n return base::add_edge(src, dst, cap, cost);\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\n const cap_t &upper, const cost_t &cost) {\n assert(!(upper < lower));\n supp[src] -= lower;\n supp[dst] += lower;\n min_cost += lower * cost;\n return add_edge(src, dst, upper - lower, cost);\n }\n\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\n assert(node < size());\n return supp[node] += vol;\n }\n\n const cap_t &demand(size_t node, const cap_t &vol) {\n return supply(node, -vol);\n }\n\n bool flow() {\n for (bool aug = true; aug;) {\n aug = false;\n std::vector<edge_t *> last(size());\n Dijkstra(last);\n std::vector<bool> shut(size());\n for (size_t dst{}; dst != size(); ++dst) {\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\n cap_t resid{-supp[dst]};\n size_t src{dst}, block{nil};\n while (last[src] && !shut[src]) {\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\n src = last[src]->src;\n }\n if (shut[src])\n block = src;\n else {\n if (!(resid < supp[src])) {\n resid = supp[src];\n block = src;\n }\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\n e->cap -= resid;\n e->rev->cap += resid;\n }\n supp[src] -= resid;\n supp[dst] += resid;\n min_cost += ptnl[dst] * resid;\n aug = true;\n }\n if (~block) {\n for (size_t node{dst};; node = last[node]->src) {\n shut[node] = true;\n if (node == block) break;\n }\n }\n }\n }\n }\n return std::none_of(begin(supp), end(supp),\n [](const cap_t &s) { return s < 0 || 0 < s; });\n }\n\n cost_t optimal() {\n assert(flow());\n return min_cost;\n }\n}; // class min_cost_flow\n#line 22 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main() {\n // start here!\n const i64 inf = 1e11;\n int n, m, x;\n cin >> n >> m >> x;\n\n min_cost_flow<i64, i64> base(n * 3);\n // make\n {\n for (int i = 0; i < n; i++) {\n int a, b, p;\n cin >> a >> b >> p;\n base.add_edge(3 * i + 1, 3 * i, inf, p);\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\n base.supply(3 * i, -a);\n base.supply(3 * i + 1, a - b);\n base.supply(3 * i + 2, b);\n }\n }\n for (auto j = 0; j < m; ++j) {\n int u, v, f;\n cin >> u >> v >> f;\n --u, --v;\n if (f > 0) {\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\n } else {\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\n }\n }\n\n auto ok = [&](int t) -> bool {\n auto mcf = base;\n for (int i = 0; i < n; i++) {\n mcf.add_edge(3 * i + 2, 0, inf, t);\n }\n if (mcf.flow()) {\n auto opt = mcf.optimal();\n return opt >= x;\n }\n return false;\n };\n\n auto ans = binary_search(x + 100 * n + 1, -1, ok);\n if (ans > x + 100 * n)\n cout << \"-1\\n\";\n else\n cout << ans << eol;\n}\n}","accuracy":0.4222222222222222,"time_ms":20,"memory_kb":3664,"score_of_the_acc":-0.6844,"final_rank":16},{"submission_id":"aoj_3171_4886055","code_snippet":"#line 1 \"other/h.cpp\"\n#include <bits/extc++.h>\n#if __has_include(<bit>)\n#include <bit>\n#endif\n#line 7 \"Library/alias.hpp\"\nnamespace workspace {\nconstexpr char eol = '\\n';\nusing namespace std;\nusing i32 = int_least32_t;\nusing i64 = int_least64_t;\nusing i128 = __int128_t;\nusing u32 = uint_least32_t;\nusing u64 = uint_least64_t;\nusing u128 = __uint128_t;\ntemplate <class T, class Comp = less<T>>\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\ntemplate <class T> using stack = std::stack<T, vector<T>>;\n} // namespace workspace\n#line 5 \"Library/config.hpp\"\nnamespace config {\nconst auto start_time{std::chrono::system_clock::now()};\nint64_t elapsed() {\n using namespace std::chrono;\n const auto end_time{system_clock::now()};\n return duration_cast<milliseconds>(end_time - start_time).count();\n}\n__attribute__((constructor)) void setup() {\n using namespace std;\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n#ifdef _buffer_check\n atexit([] {\n char bufc;\n if (cin >> bufc)\n cerr << \"\\n\\033[43m\\033[30mwarning: buffer not empty.\\033[0m\\n\\n\";\n });\n#endif\n}\nunsigned cases(), caseid = 1;\ntemplate <class F> void loop(F main) {\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\n}\n} // namespace config\n#line 2 \"Library/option.hpp\"\n#ifdef ONLINE_JUDGE\n #pragma GCC optimize(\"O3\")\n #pragma GCC target(\"avx,avx2\")\n #pragma GCC optimize(\"unroll-loops\")\n#endif\n#line 2 \"Library/utils/binary_search.hpp\"\n#if __cplusplus >= 201703L\n#include <cassert>\n#include <cmath>\n#include <vector>\nnamespace workspace {\n// binary search on a discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\n iter_type>\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\n assert(ok != ng);\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\n while (1 < dist || dist < -1) {\n iter_type mid(ok + dist / 2);\n if (pred(mid))\n ok = mid, dist -= dist / 2;\n else\n ng = mid, dist /= 2;\n }\n return ok;\n}\n// parallel binary search on each discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\n std::vector<bool>>,\n std::vector<iter_type>>\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\n pred_type pred) {\n std::vector<iter_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n iter_type mid(ok + (ng - ok) / 2);\n if (mids[i] != mid) {\n all_found = false;\n mids[i] = mid;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n// binary search on a real number interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\n real_type>\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\n assert(ok != ng);\n while (ok + eps < ng || ng + eps < ok) {\n real_type mid{(ok + ng) / 2};\n (pred(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n// parallel binary search on each real interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<real_type>>,\n std::vector<bool>>,\n std::vector<real_type>>\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\n const real_type eps, pred_type pred) {\n std::vector<real_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n if (ok + eps < ng || ng + eps < ok) {\n all_found = false;\n mids[i] = (ok + ng) / 2;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/casefmt.hpp\"\nnamespace workspace {\nstd::ostream &casefmt(std::ostream& os) { return os << \"Case #\" << config::caseid << \": \"; }\n} // namespace workspace\n#line 3 \"Library/utils/chval.hpp\"\nnamespace workspace {\ntemplate <class T, class Comp = std::less<T>>\nbool chle(T &x, const T &y, Comp comp = Comp()) {\n return comp(y, x) ? x = y, true : false;\n}\ntemplate <class T, class Comp = std::less<T>>\nbool chge(T &x, const T &y, Comp comp = Comp()) {\n return comp(x, y) ? x = y, true : false;\n}\n} // namespace workspace\n#line 5 \"Library/utils/coordinate_compression.hpp\"\n\ntemplate <class T> class coordinate_compression {\n std::vector<T> uniquely;\n std::vector<size_t> compressed;\n\n public:\n coordinate_compression(const std::vector<T> &raw)\n : uniquely(raw), compressed(raw.size()) {\n std::sort(uniquely.begin(), uniquely.end());\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\n uniquely.end());\n for (size_t i = 0; i != size(); ++i)\n compressed[i] =\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\n uniquely.begin();\n }\n\n size_t operator[](const size_t idx) const {\n assert(idx < size());\n return compressed[idx];\n }\n\n size_t size() const { return compressed.size(); }\n\n size_t count() const { return uniquely.size(); }\n\n T value(const size_t ord) const {\n assert(ord < count());\n return uniquely[ord];\n }\n\n size_t order(const T &value) const {\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\n uniquely.begin();\n }\n\n auto begin() { return compressed.begin(); }\n auto end() { return compressed.end(); }\n auto rbegin() { return compressed.rbegin(); }\n auto rend() { return compressed.rend(); }\n};\n#line 3 \"Library/utils/fixed_point.hpp\"\nnamespace workspace {\n// specify the return type of lambda.\ntemplate <class lambda_type> class fixed_point {\n lambda_type func;\n\n public:\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\n template <class... Args> auto operator()(Args &&... args) const {\n return func(*this, std::forward<Args>(args)...);\n }\n};\n} // namespace workspace\n#line 6 \"Library/utils/hash.hpp\"\n\n#line 3 \"Library/utils/sfinae.hpp\"\n#include <type_traits>\n\ntemplate <class type, template <class> class trait>\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\n\ntemplate <class Container>\nusing element_type = typename std::decay<decltype(\n *std::begin(std::declval<Container&>()))>::type;\n\ntemplate <class T, class = int> struct mapped_of {\n using type = element_type<T>;\n};\ntemplate <class T>\nstruct mapped_of<T,\n typename std::pair<int, typename T::mapped_type>::first_type> {\n using type = typename T::mapped_type;\n};\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\n\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\ntemplate <class T>\nstruct is_integral_ext<\n T, typename std::enable_if<std::is_integral<T>::value>::type>\n : std::true_type {};\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\n#if __cplusplus >= 201402\ntemplate <class T>\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\n#endif\n\ntemplate <typename T, typename = void> struct multiplicable_uint {\n using type = uint_least32_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\n using type = uint_least64_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\n using type = __uint128_t;\n};\n#line 8 \"Library/utils/hash.hpp\"\nnamespace workspace {\ntemplate <class T, class = void> struct hash : std::hash<T> {};\n#if __cplusplus >= 201703L\ntemplate <class Unique_bits_type>\nstruct hash<Unique_bits_type,\n enable_if_trait_type<Unique_bits_type,\n std::has_unique_object_representations>> {\n size_t operator()(uint64_t x) const {\n static const uint64_t m = std::random_device{}();\n x ^= x >> 23;\n x ^= m;\n x ^= x >> 47;\n return x - (x >> 32);\n }\n};\n#endif\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\n return seed ^\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\n}\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\n size_t operator()(const std::pair<T1, T2> &pair) const {\n return hash_combine(hash<T1>()(pair.first), pair.second);\n }\n};\ntemplate <class... T> class hash<std::tuple<T...>> {\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\n struct tuple_hash {\n static uint64_t apply(const Tuple &t) {\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\n std::get<index>(t));\n }\n };\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\n static uint64_t apply(const Tuple &t) { return 0; }\n };\n\n public:\n uint64_t operator()(const std::tuple<T...> &t) const {\n return tuple_hash<std::tuple<T...>>::apply(t);\n }\n};\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\n using key_type = typename hash_table::key_type;\n size_t count(const key_type &key) const {\n return hash_table::find(key) != hash_table::end();\n }\n template <class... Args> auto emplace(Args &&... args) {\n return hash_table::insert(typename hash_table::value_type(args...));\n }\n};\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing cc_hash_table =\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing gp_hash_table =\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped>\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\n} // namespace workspace\n#line 2 \"Library/utils/make_vector.hpp\"\n#if __cplusplus >= 201703L\n#include <vector>\nnamespace workspace {\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\n if constexpr (N)\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\n else\n return init;\n}\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\n return make_vector<T, N>((size_t*)sizes, init);\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/random_number_generator.hpp\"\ntemplate <typename num_type> class random_number_generator {\n typename std::conditional<std::is_integral<num_type>::value,\n std::uniform_int_distribution<num_type>,\n std::uniform_real_distribution<num_type>>::type\n unif;\n\n std::mt19937 engine;\n\n public:\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\n num_type max = std::numeric_limits<num_type>::max())\n : unif(min, max), engine(std::random_device{}()) {}\n\n num_type min() const { return unif.min(); }\n\n num_type max() const { return unif.max(); }\n\n // generate a random number in [min(), max()].\n num_type operator()() { return unif(engine); }\n};\n#line 3 \"Library/utils/read.hpp\"\nnamespace workspace {\n// read with std::cin.\ntemplate <class T = void>\nstruct read\n{\n typename std::remove_const<T>::type value;\n template <class... types>\n read(types... args) : value(args...) { std::cin >> value; }\n operator T() const { return value; }\n};\ntemplate <>\nstruct read<void>\n{\n template <class T>\n operator T() const { T value; std::cin >> value; return value; }\n};\n} // namespace workspace\n#line 4 \"Library/utils/stream.hpp\"\n\n#line 6 \"Library/utils/stream.hpp\"\nnamespace std {\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ' ' << p.second;\n}\ntemplate <class tuple_t, size_t index> struct tuple_is {\n static istream &apply(istream &is, tuple_t &t) {\n tuple_is<tuple_t, index - 1>::apply(is, t);\n return is >> get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\n static istream &apply(istream &is, tuple_t &t) { return is; }\n};\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\n t);\n}\ntemplate <class tuple_t, size_t index> struct tuple_os {\n static ostream &apply(ostream &os, const tuple_t &t) {\n tuple_os<tuple_t, index - 1>::apply(os, t);\n return os << ' ' << get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\n static ostream &apply(ostream &os, const tuple_t &t) {\n return os << get<0>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\n};\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\n t);\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n istream &>::type\noperator>>(istream &is, Container &cont) {\n for (auto &&e : cont) is >> e;\n return is;\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n ostream &>::type\noperator<<(ostream &os, const Container &cont) {\n bool head = true;\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\n return os;\n}\n} // namespace std\n#line 4 \"Library/utils/trinary_search.hpp\"\n// trinary search on discrete range.\ntemplate <class iter_type, class comp_type>\niter_type trinary(iter_type first, iter_type last, comp_type comp)\n{\n assert(first < last);\n intmax_t dist(last - first);\n while(dist > 2)\n {\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\n else first = left, dist -= dist / 3;\n }\n if(dist > 1 && comp(first + 1, first)) ++first;\n return first;\n}\n// trinary search on real numbers.\ntemplate <class comp_type>\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\n{\n assert(first < last);\n while(last - first > eps)\n {\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\n if(comp(left, right)) last = right;\n else first = left;\n }\n return first;\n}\n#line 2 \"Library/utils/wrapper.hpp\"\ntemplate <class Container> class reversed {\n Container &ref, copy;\n\n public:\n reversed(Container &ref) : ref(ref) {}\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\n auto begin() const { return ref.rbegin(); }\n auto end() const { return ref.rend(); }\n};\n#line 9 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main();\n}\nint main() { config::loop(workspace::main); }\n\nunsigned config::cases() {\n // return -1; // unspecified\n // int t; std::cin >> t; return t; // given\n return 1;\n}\n\n#line 4 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n\n#line 4 \"Library/graph/directed/flow/base.hpp\"\n// the base class of flow algorithms.\ntemplate <class cap_t, class cost_t> struct flow_base {\n struct edge_t {\n size_t src, dst;\n cap_t cap;\n cost_t cost;\n edge_t *rev;\n edge_t() = default;\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\n : src(src), dst(dst), cap(cap), rev(rev) {}\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\n edge_t *rev)\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\n }; // class edge_t\n\n class adj_type {\n edge_t *fst, *lst, *clst;\n\n public:\n template <class... Args> edge_t *emplace(Args &&... args) {\n if (lst == clst) {\n size_t len(clst - fst);\n edge_t *nfst = lst = new edge_t[len << 1];\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\n p->rev->rev = lst, *lst = *p;\n delete[] fst;\n fst = nfst;\n clst = lst + len;\n }\n *lst = edge_t(args...);\n return lst++;\n }\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\n ~adj_type() { delete[] fst; }\n edge_t &operator[](size_t i) {\n assert(i < size());\n return *(fst + i);\n }\n size_t size() const { return lst - fst; }\n edge_t *begin() const { return fst; }\n edge_t *end() const { return lst; }\n }; // class adj_type\n\n flow_base(size_t n = 0) : adjs(n) {}\n\n flow_base(const flow_base &other) : adjs(other.size()) {\n for (size_t node{}; node != size(); ++node)\n for (const auto &[src, dst, cap, cost, rev] : other[node])\n if (src == node) {\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\n rev->src = nil;\n } else {\n rev->rev->src = node;\n }\n }\n\n flow_base &operator=(const flow_base &rhs) {\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\n return *this;\n }\n\n size_t size() const { return adjs.size(); }\n\n adj_type &operator[](size_t node) {\n assert(node < size());\n return adjs[node];\n }\n const adj_type &operator[](size_t node) const {\n assert(node < size());\n return adjs[node];\n }\n\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) {\n assert(src < size());\n assert(dst < size());\n assert(!(cap < static_cast<cap_t>(0)));\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\n return ptr;\n }\n\n protected:\n constexpr static size_t nil = -1;\n std::vector<adj_type> adjs;\n}; // class flow_base\n#line 6 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n// Successive shortest paths algorithm.\ntemplate <class cap_t, class cost_t, bool density_tag = false>\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\n using base = flow_base<cap_t, cost_t>;\n using edge_t = typename base::edge_t;\n using base::adjs;\n using base::nil;\n\n cost_t min_cost, total_cost;\n std::vector<cap_t> supp;\n std::vector<cost_t> ptnl;\n\n void copy_member(const min_cost_flow &other) {\n min_cost = other.min_cost;\n total_cost = other.total_cost;\n supp = other.supp;\n ptnl = other.ptnl;\n }\n\n void Dijkstra(std::vector<edge_t *> &last) {\n const cost_t infty(total_cost + 1);\n std::vector<cost_t> nptnl(size(), infty);\n if constexpr (density_tag) {\n // O(V^2)\n std::vector<bool> used(size());\n for (size_t src{}; src != size(); ++src) {\n if (static_cast<cap_t>(0) < supp[src]) {\n used[src] = true;\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\n if (e.avbl() && e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = e.cost;\n last[e.dst] = &e;\n }\n }\n }\n }\n for (;;) {\n size_t src{nil};\n cost_t sp{infty};\n for (size_t node{}; node != size(); ++node) {\n if (used[node] || nptnl[node] == infty) continue;\n cost_t dist{nptnl[node] - ptnl[node]};\n if (dist < sp) {\n sp = dist;\n src = node;\n }\n }\n if (src == nil) break;\n used[src] = true;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = nptnl[src] + e.cost;\n last[e.dst] = &e;\n }\n }\n }\n } else {\n // O((V + E)logV)\n struct node_t {\n size_t id;\n cost_t dist;\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\n };\n std::priority_queue<node_t> que;\n for (size_t src{}; src != size(); ++src) {\n if (supp[src] > static_cast<cap_t>(0)) {\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\n if (e.avbl() && nptnl[e.dst] > e.cost) {\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n while (!que.empty()) {\n auto [src, ndist] = que.top();\n que.pop();\n if (ndist + ptnl[src] != nptnl[src]) continue;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\n que.emplace(e.dst,\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n ptnl.swap(nptnl);\n }\n\n public:\n using base::size;\n\n min_cost_flow(size_t n = 0)\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\n\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\n copy_member(other);\n }\n\n min_cost_flow &operator=(const min_cost_flow &other) {\n base::operator=(other);\n copy_member(other);\n return *this;\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) override {\n assert(src != dst);\n if (cost < static_cast<cost_t>(0)) {\n supp[src] -= cap;\n supp[dst] += cap;\n min_cost += cap * cost;\n total_cost -= cap * cost;\n return base::add_edge(dst, src, cap, -cost);\n }\n total_cost += cap * cost;\n return base::add_edge(src, dst, cap, cost);\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\n const cap_t &upper, const cost_t &cost) {\n assert(!(upper < lower));\n supp[src] -= lower;\n supp[dst] += lower;\n min_cost += lower * cost;\n return add_edge(src, dst, upper - lower, cost);\n }\n\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\n assert(node < size());\n return supp[node] += vol;\n }\n\n const cap_t &demand(size_t node, const cap_t &vol) {\n return supply(node, -vol);\n }\n\n bool flow() {\n for (bool aug = true; aug;) {\n aug = false;\n std::vector<edge_t *> last(size());\n Dijkstra(last);\n std::vector<bool> shut(size());\n for (size_t dst{}; dst != size(); ++dst) {\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\n cap_t resid{-supp[dst]};\n size_t src{dst}, block{nil};\n while (last[src] && !shut[src]) {\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\n src = last[src]->src;\n }\n if (shut[src])\n block = src;\n else {\n if (!(resid < supp[src])) {\n resid = supp[src];\n block = src;\n }\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\n e->cap -= resid;\n e->rev->cap += resid;\n }\n supp[src] -= resid;\n supp[dst] += resid;\n min_cost += ptnl[dst] * resid;\n aug = true;\n }\n if (~block) {\n for (size_t node{dst};; node = last[node]->src) {\n shut[node] = true;\n if (node == block) break;\n }\n }\n }\n }\n }\n return std::none_of(begin(supp), end(supp),\n [](const cap_t &s) { return s < 0 || 0 < s; });\n }\n\n cost_t optimal() {\n assert(flow());\n return min_cost;\n }\n}; // class min_cost_flow\n#line 22 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main() {\n // start here!\n const i64 inf = 1e12;\n int n, m, x;\n cin >> n >> m >> x;\n\n min_cost_flow<i64, i64> base(n * 3);\n // make\n {\n for (int i = 0; i < n; i++) {\n int a, b, p;\n cin >> a >> b >> p;\n base.add_edge(3 * i + 1, 3 * i, inf, p);\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\n base.supply(3 * i, -a);\n base.supply(3 * i + 1, a - b);\n base.supply(3 * i + 2, b);\n }\n }\n for (auto j = 0; j < m; ++j) {\n int u, v, f;\n cin >> u >> v >> f;\n --u, --v;\n if (f > 0) {\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\n } else {\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\n }\n }\n\n auto ok = [&](int t) -> bool {\n auto mcf = base;\n for (int i = 0; i < n; i++) {\n mcf.add_edge(3 * i + 2, 0, inf, t);\n }\n if (mcf.flow()) {\n auto opt = mcf.optimal();\n return opt >= x;\n }\n return false;\n };\n\n auto ans = binary_search(x + 100 * n + 1, -1, ok);\n if (ans > x + 100 * n)\n cout << \"-1\\n\";\n else\n cout << ans << eol;\n}\n}","accuracy":0.4222222222222222,"time_ms":20,"memory_kb":3592,"score_of_the_acc":-0.5611,"final_rank":12},{"submission_id":"aoj_3171_4886053","code_snippet":"#line 1 \"other/h.cpp\"\n#include <bits/extc++.h>\n#if __has_include(<bit>)\n#include <bit>\n#endif\n#line 7 \"Library/alias.hpp\"\nnamespace workspace {\nconstexpr char eol = '\\n';\nusing namespace std;\nusing i32 = int_least32_t;\nusing i64 = int_least64_t;\nusing i128 = __int128_t;\nusing u32 = uint_least32_t;\nusing u64 = uint_least64_t;\nusing u128 = __uint128_t;\ntemplate <class T, class Comp = less<T>>\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\ntemplate <class T> using stack = std::stack<T, vector<T>>;\n} // namespace workspace\n#line 5 \"Library/config.hpp\"\nnamespace config {\nconst auto start_time{std::chrono::system_clock::now()};\nint64_t elapsed() {\n using namespace std::chrono;\n const auto end_time{system_clock::now()};\n return duration_cast<milliseconds>(end_time - start_time).count();\n}\n__attribute__((constructor)) void setup() {\n using namespace std;\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n#ifdef _buffer_check\n atexit([] {\n char bufc;\n if (cin >> bufc)\n cerr << \"\\n\\033[43m\\033[30mwarning: buffer not empty.\\033[0m\\n\\n\";\n });\n#endif\n}\nunsigned cases(), caseid = 1;\ntemplate <class F> void loop(F main) {\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\n}\n} // namespace config\n#line 2 \"Library/option.hpp\"\n#ifdef ONLINE_JUDGE\n #pragma GCC optimize(\"O3\")\n #pragma GCC target(\"avx,avx2\")\n #pragma GCC optimize(\"unroll-loops\")\n#endif\n#line 2 \"Library/utils/binary_search.hpp\"\n#if __cplusplus >= 201703L\n#include <cassert>\n#include <cmath>\n#include <vector>\nnamespace workspace {\n// binary search on a discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\n iter_type>\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\n assert(ok != ng);\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\n while (1 < dist || dist < -1) {\n iter_type mid(ok + dist / 2);\n if (pred(mid))\n ok = mid, dist -= dist / 2;\n else\n ng = mid, dist /= 2;\n }\n return ok;\n}\n// parallel binary search on each discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\n std::vector<bool>>,\n std::vector<iter_type>>\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\n pred_type pred) {\n std::vector<iter_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n iter_type mid(ok + (ng - ok) / 2);\n if (mids[i] != mid) {\n all_found = false;\n mids[i] = mid;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n// binary search on a real number interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\n real_type>\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\n assert(ok != ng);\n while (ok + eps < ng || ng + eps < ok) {\n real_type mid{(ok + ng) / 2};\n (pred(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n// parallel binary search on each real interval.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<real_type>>,\n std::vector<bool>>,\n std::vector<real_type>>\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\n const real_type eps, pred_type pred) {\n std::vector<real_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n if (ok + eps < ng || ng + eps < ok) {\n all_found = false;\n mids[i] = (ok + ng) / 2;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/casefmt.hpp\"\nnamespace workspace {\nstd::ostream &casefmt(std::ostream& os) { return os << \"Case #\" << config::caseid << \": \"; }\n} // namespace workspace\n#line 3 \"Library/utils/chval.hpp\"\nnamespace workspace {\ntemplate <class T, class Comp = std::less<T>>\nbool chle(T &x, const T &y, Comp comp = Comp()) {\n return comp(y, x) ? x = y, true : false;\n}\ntemplate <class T, class Comp = std::less<T>>\nbool chge(T &x, const T &y, Comp comp = Comp()) {\n return comp(x, y) ? x = y, true : false;\n}\n} // namespace workspace\n#line 5 \"Library/utils/coordinate_compression.hpp\"\n\ntemplate <class T> class coordinate_compression {\n std::vector<T> uniquely;\n std::vector<size_t> compressed;\n\n public:\n coordinate_compression(const std::vector<T> &raw)\n : uniquely(raw), compressed(raw.size()) {\n std::sort(uniquely.begin(), uniquely.end());\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\n uniquely.end());\n for (size_t i = 0; i != size(); ++i)\n compressed[i] =\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\n uniquely.begin();\n }\n\n size_t operator[](const size_t idx) const {\n assert(idx < size());\n return compressed[idx];\n }\n\n size_t size() const { return compressed.size(); }\n\n size_t count() const { return uniquely.size(); }\n\n T value(const size_t ord) const {\n assert(ord < count());\n return uniquely[ord];\n }\n\n size_t order(const T &value) const {\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\n uniquely.begin();\n }\n\n auto begin() { return compressed.begin(); }\n auto end() { return compressed.end(); }\n auto rbegin() { return compressed.rbegin(); }\n auto rend() { return compressed.rend(); }\n};\n#line 3 \"Library/utils/fixed_point.hpp\"\nnamespace workspace {\n// specify the return type of lambda.\ntemplate <class lambda_type> class fixed_point {\n lambda_type func;\n\n public:\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\n template <class... Args> auto operator()(Args &&... args) const {\n return func(*this, std::forward<Args>(args)...);\n }\n};\n} // namespace workspace\n#line 6 \"Library/utils/hash.hpp\"\n\n#line 3 \"Library/utils/sfinae.hpp\"\n#include <type_traits>\n\ntemplate <class type, template <class> class trait>\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\n\ntemplate <class Container>\nusing element_type = typename std::decay<decltype(\n *std::begin(std::declval<Container&>()))>::type;\n\ntemplate <class T, class = int> struct mapped_of {\n using type = element_type<T>;\n};\ntemplate <class T>\nstruct mapped_of<T,\n typename std::pair<int, typename T::mapped_type>::first_type> {\n using type = typename T::mapped_type;\n};\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\n\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\ntemplate <class T>\nstruct is_integral_ext<\n T, typename std::enable_if<std::is_integral<T>::value>::type>\n : std::true_type {};\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\n#if __cplusplus >= 201402\ntemplate <class T>\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\n#endif\n\ntemplate <typename T, typename = void> struct multiplicable_uint {\n using type = uint_least32_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\n using type = uint_least64_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\n using type = __uint128_t;\n};\n#line 8 \"Library/utils/hash.hpp\"\nnamespace workspace {\ntemplate <class T, class = void> struct hash : std::hash<T> {};\n#if __cplusplus >= 201703L\ntemplate <class Unique_bits_type>\nstruct hash<Unique_bits_type,\n enable_if_trait_type<Unique_bits_type,\n std::has_unique_object_representations>> {\n size_t operator()(uint64_t x) const {\n static const uint64_t m = std::random_device{}();\n x ^= x >> 23;\n x ^= m;\n x ^= x >> 47;\n return x - (x >> 32);\n }\n};\n#endif\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\n return seed ^\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\n}\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\n size_t operator()(const std::pair<T1, T2> &pair) const {\n return hash_combine(hash<T1>()(pair.first), pair.second);\n }\n};\ntemplate <class... T> class hash<std::tuple<T...>> {\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\n struct tuple_hash {\n static uint64_t apply(const Tuple &t) {\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\n std::get<index>(t));\n }\n };\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\n static uint64_t apply(const Tuple &t) { return 0; }\n };\n\n public:\n uint64_t operator()(const std::tuple<T...> &t) const {\n return tuple_hash<std::tuple<T...>>::apply(t);\n }\n};\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\n using key_type = typename hash_table::key_type;\n size_t count(const key_type &key) const {\n return hash_table::find(key) != hash_table::end();\n }\n template <class... Args> auto emplace(Args &&... args) {\n return hash_table::insert(typename hash_table::value_type(args...));\n }\n};\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing cc_hash_table =\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing gp_hash_table =\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped>\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\n} // namespace workspace\n#line 2 \"Library/utils/make_vector.hpp\"\n#if __cplusplus >= 201703L\n#include <vector>\nnamespace workspace {\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\n if constexpr (N)\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\n else\n return init;\n}\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\n return make_vector<T, N>((size_t*)sizes, init);\n}\n} // namespace workspace\n#endif\n#line 3 \"Library/utils/random_number_generator.hpp\"\ntemplate <typename num_type> class random_number_generator {\n typename std::conditional<std::is_integral<num_type>::value,\n std::uniform_int_distribution<num_type>,\n std::uniform_real_distribution<num_type>>::type\n unif;\n\n std::mt19937 engine;\n\n public:\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\n num_type max = std::numeric_limits<num_type>::max())\n : unif(min, max), engine(std::random_device{}()) {}\n\n num_type min() const { return unif.min(); }\n\n num_type max() const { return unif.max(); }\n\n // generate a random number in [min(), max()].\n num_type operator()() { return unif(engine); }\n};\n#line 3 \"Library/utils/read.hpp\"\nnamespace workspace {\n// read with std::cin.\ntemplate <class T = void>\nstruct read\n{\n typename std::remove_const<T>::type value;\n template <class... types>\n read(types... args) : value(args...) { std::cin >> value; }\n operator T() const { return value; }\n};\ntemplate <>\nstruct read<void>\n{\n template <class T>\n operator T() const { T value; std::cin >> value; return value; }\n};\n} // namespace workspace\n#line 4 \"Library/utils/stream.hpp\"\n\n#line 6 \"Library/utils/stream.hpp\"\nnamespace std {\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ' ' << p.second;\n}\ntemplate <class tuple_t, size_t index> struct tuple_is {\n static istream &apply(istream &is, tuple_t &t) {\n tuple_is<tuple_t, index - 1>::apply(is, t);\n return is >> get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\n static istream &apply(istream &is, tuple_t &t) { return is; }\n};\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\n t);\n}\ntemplate <class tuple_t, size_t index> struct tuple_os {\n static ostream &apply(ostream &os, const tuple_t &t) {\n tuple_os<tuple_t, index - 1>::apply(os, t);\n return os << ' ' << get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\n static ostream &apply(ostream &os, const tuple_t &t) {\n return os << get<0>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\n};\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\n t);\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n istream &>::type\noperator>>(istream &is, Container &cont) {\n for (auto &&e : cont) is >> e;\n return is;\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n ostream &>::type\noperator<<(ostream &os, const Container &cont) {\n bool head = true;\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\n return os;\n}\n} // namespace std\n#line 4 \"Library/utils/trinary_search.hpp\"\n// trinary search on discrete range.\ntemplate <class iter_type, class comp_type>\niter_type trinary(iter_type first, iter_type last, comp_type comp)\n{\n assert(first < last);\n intmax_t dist(last - first);\n while(dist > 2)\n {\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\n else first = left, dist -= dist / 3;\n }\n if(dist > 1 && comp(first + 1, first)) ++first;\n return first;\n}\n// trinary search on real numbers.\ntemplate <class comp_type>\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\n{\n assert(first < last);\n while(last - first > eps)\n {\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\n if(comp(left, right)) last = right;\n else first = left;\n }\n return first;\n}\n#line 2 \"Library/utils/wrapper.hpp\"\ntemplate <class Container> class reversed {\n Container &ref, copy;\n\n public:\n reversed(Container &ref) : ref(ref) {}\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\n auto begin() const { return ref.rbegin(); }\n auto end() const { return ref.rend(); }\n};\n#line 9 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main();\n}\nint main() { config::loop(workspace::main); }\n\nunsigned config::cases() {\n // return -1; // unspecified\n // int t; std::cin >> t; return t; // given\n return 1;\n}\n\n#line 4 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n\n#line 4 \"Library/graph/directed/flow/base.hpp\"\n// the base class of flow algorithms.\ntemplate <class cap_t, class cost_t> struct flow_base {\n struct edge_t {\n size_t src, dst;\n cap_t cap;\n cost_t cost;\n edge_t *rev;\n edge_t() = default;\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\n : src(src), dst(dst), cap(cap), rev(rev) {}\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\n edge_t *rev)\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\n }; // class edge_t\n\n class adj_type {\n edge_t *fst, *lst, *clst;\n\n public:\n template <class... Args> edge_t *emplace(Args &&... args) {\n if (lst == clst) {\n size_t len(clst - fst);\n edge_t *nfst = lst = new edge_t[len << 1];\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\n p->rev->rev = lst, *lst = *p;\n delete[] fst;\n fst = nfst;\n clst = lst + len;\n }\n *lst = edge_t(args...);\n return lst++;\n }\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\n ~adj_type() { delete[] fst; }\n edge_t &operator[](size_t i) {\n assert(i < size());\n return *(fst + i);\n }\n size_t size() const { return lst - fst; }\n edge_t *begin() const { return fst; }\n edge_t *end() const { return lst; }\n }; // class adj_type\n\n flow_base(size_t n = 0) : adjs(n) {}\n\n flow_base(const flow_base &other) : adjs(other.size()) {\n for (size_t node{}; node != size(); ++node)\n for (const auto &[src, dst, cap, cost, rev] : other[node])\n if (src == node) {\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\n rev->src = nil;\n } else {\n rev->rev->src = node;\n }\n }\n\n flow_base &operator=(const flow_base &rhs) {\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\n return *this;\n }\n\n size_t size() const { return adjs.size(); }\n\n adj_type &operator[](size_t node) {\n assert(node < size());\n return adjs[node];\n }\n const adj_type &operator[](size_t node) const {\n assert(node < size());\n return adjs[node];\n }\n\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) {\n assert(src < size());\n assert(dst < size());\n assert(!(cap < static_cast<cap_t>(0)));\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\n return ptr;\n }\n\n protected:\n constexpr static size_t nil = -1;\n std::vector<adj_type> adjs;\n}; // class flow_base\n#line 6 \"Library/graph/directed/flow/min_cost_flow.hpp\"\n// Successive shortest paths algorithm.\ntemplate <class cap_t, class cost_t, bool density_tag = false>\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\n using base = flow_base<cap_t, cost_t>;\n using edge_t = typename base::edge_t;\n using base::adjs;\n using base::nil;\n\n cost_t min_cost, total_cost;\n std::vector<cap_t> supp;\n std::vector<cost_t> ptnl;\n\n void copy_member(const min_cost_flow &other) {\n min_cost = other.min_cost;\n total_cost = other.total_cost;\n supp = other.supp;\n ptnl = other.ptnl;\n }\n\n void Dijkstra(std::vector<edge_t *> &last) {\n const cost_t infty(total_cost + 1);\n std::vector<cost_t> nptnl(size(), infty);\n if constexpr (density_tag) {\n // O(V^2)\n std::vector<bool> used(size());\n for (size_t src{}; src != size(); ++src) {\n if (static_cast<cap_t>(0) < supp[src]) {\n used[src] = true;\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\n if (e.avbl() && e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = e.cost;\n last[e.dst] = &e;\n }\n }\n }\n }\n for (;;) {\n size_t src{nil};\n cost_t sp{infty};\n for (size_t node{}; node != size(); ++node) {\n if (used[node] || nptnl[node] == infty) continue;\n cost_t dist{nptnl[node] - ptnl[node]};\n if (dist < sp) {\n sp = dist;\n src = node;\n }\n }\n if (src == nil) break;\n used[src] = true;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\n nptnl[e.dst] = nptnl[src] + e.cost;\n last[e.dst] = &e;\n }\n }\n }\n } else {\n // O((V + E)logV)\n struct node_t {\n size_t id;\n cost_t dist;\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\n };\n std::priority_queue<node_t> que;\n for (size_t src{}; src != size(); ++src) {\n if (supp[src] > static_cast<cap_t>(0)) {\n nptnl[src] = 0;\n for (edge_t &e : adjs[src]) {\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\n if (e.avbl() && nptnl[e.dst] > e.cost) {\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n while (!que.empty()) {\n auto [src, ndist] = que.top();\n que.pop();\n if (ndist + ptnl[src] != nptnl[src]) continue;\n for (edge_t &e : adjs[src]) {\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\n que.emplace(e.dst,\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\n last[e.dst] = &e;\n }\n }\n }\n }\n ptnl.swap(nptnl);\n }\n\n public:\n using base::size;\n\n min_cost_flow(size_t n = 0)\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\n\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\n copy_member(other);\n }\n\n min_cost_flow &operator=(const min_cost_flow &other) {\n base::operator=(other);\n copy_member(other);\n return *this;\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\n const cost_t &cost) override {\n assert(src != dst);\n if (cost < static_cast<cost_t>(0)) {\n supp[src] -= cap;\n supp[dst] += cap;\n min_cost += cap * cost;\n total_cost -= cap * cost;\n return base::add_edge(dst, src, cap, -cost);\n }\n total_cost += cap * cost;\n return base::add_edge(src, dst, cap, cost);\n }\n\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\n const cap_t &upper, const cost_t &cost) {\n assert(!(upper < lower));\n supp[src] -= lower;\n supp[dst] += lower;\n min_cost += lower * cost;\n return add_edge(src, dst, upper - lower, cost);\n }\n\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\n assert(node < size());\n return supp[node] += vol;\n }\n\n const cap_t &demand(size_t node, const cap_t &vol) {\n return supply(node, -vol);\n }\n\n bool flow() {\n for (bool aug = true; aug;) {\n aug = false;\n std::vector<edge_t *> last(size());\n Dijkstra(last);\n std::vector<bool> shut(size());\n for (size_t dst{}; dst != size(); ++dst) {\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\n cap_t resid{-supp[dst]};\n size_t src{dst}, block{nil};\n while (last[src] && !shut[src]) {\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\n src = last[src]->src;\n }\n if (shut[src])\n block = src;\n else {\n if (!(resid < supp[src])) {\n resid = supp[src];\n block = src;\n }\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\n e->cap -= resid;\n e->rev->cap += resid;\n }\n supp[src] -= resid;\n supp[dst] += resid;\n min_cost += ptnl[dst] * resid;\n aug = true;\n }\n if (~block) {\n for (size_t node{dst};; node = last[node]->src) {\n shut[node] = true;\n if (node == block) break;\n }\n }\n }\n }\n }\n return std::none_of(begin(supp), end(supp),\n [](const cap_t &s) { return s < 0 || 0 < s; });\n }\n\n cost_t optimal() {\n assert(flow());\n return min_cost;\n }\n}; // class min_cost_flow\n#line 22 \"other/h.cpp\"\n\nnamespace workspace {\nvoid main() {\n // start here!\n const int inf = 1e9;\n int n, m, x;\n cin >> n >> m >> x;\n\n min_cost_flow<i64, i64> base(n * 3);\n // make\n {\n for (int i = 0; i < n; i++) {\n int a, b, p;\n cin >> a >> b >> p;\n base.add_edge(3 * i + 1, 3 * i, inf, p);\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\n base.supply(3 * i, -a);\n base.supply(3 * i + 1, a - b);\n base.supply(3 * i + 2, b);\n }\n }\n for (auto j = 0; j < m; ++j) {\n int u, v, f;\n cin >> u >> v >> f;\n --u, --v;\n if (f > 0) {\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\n } else {\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\n }\n }\n\n auto ok = [&](int t) -> bool {\n auto mcf = base;\n for (int i = 0; i < n; i++) {\n mcf.add_edge(3 * i + 2, 0, inf, t);\n }\n if (mcf.flow()) {\n auto opt = mcf.optimal();\n return opt >= x;\n }\n return false;\n };\n\n auto ans = binary_search(x + 100 * n + 1, -1, ok);\n if (ans > x + 100 * n)\n cout << \"-1\\n\";\n else\n cout << ans << eol;\n}\n}","accuracy":0.4222222222222222,"time_ms":40,"memory_kb":3676,"score_of_the_acc":-0.7449,"final_rank":17},{"submission_id":"aoj_3171_4867711","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\n\n// O(m^2 \\log n \\log U)\n// U: maximum capacity\nenum Objective{\n MINIMIZE = +1,\n MAXIMIZE = -1,\n};\ntemplate<typename Flow, typename Cost,\n Objective objective = Objective::MINIMIZE>\nstruct MinCostFlow{\n template<typename T> inline void chmin(T &x,T y){x=min(x,y);}\n\n struct Edge{\n int src,dst;\n Flow flow,cap;\n Cost cost;\n int rev;\n Edge(int src,int dst,Flow cap,Cost cost,int rev):\n src(src),dst(dst),flow(0),cap(cap),cost(cost),rev(rev){}\n Flow residual_cap()const{return cap-flow;}\n };\n\n struct EdgePtr{\n int v,e;\n EdgePtr(int v,int e):v(v),e(e){}\n };\n\n int n;\n vector<vector<Edge>> G;\n vector<Flow> b;\n vector<Cost> p;\n\n MinCostFlow(int n):n(n),G(n),b(n,0){}\n\n EdgePtr add_edge(int src,int dst,Flow lower,Flow upper,Cost cost){\n int e=G[src].size();\n int r=(src==dst?e+1:G[dst].size());\n assert(lower<=upper);\n G[src].emplace_back(src,dst,+upper,+cost*objective,r);\n G[dst].emplace_back(dst,src,-lower,-cost*objective,e);\n return EdgePtr(src,e);\n }\n\n const Edge &get_edge(EdgePtr ep)const{return G[ep.v][ep.e];}\n\n void push(Edge &e,Flow amount){\n e.flow+=amount;\n G[e.dst][e.rev].flow-=amount;\n }\n\n void add_supply(int v,Flow amount){b[v]+=amount;}\n void add_demand(int v,Flow amount){b[v]-=amount;}\n\n Cost residual_cost(const Edge &e){\n return e.cost+p[e.src]-p[e.dst];\n }\n\n vector<int> excess_vs,deficit_vs;\n void saturate_negative(const Flow delta){\n for(auto &es:G){\n for(auto &e:es){\n Flow cap=e.residual_cap();\n cap-=cap%delta;\n if(cap<0 or residual_cost(e)<0){\n push(e,cap);\n b[e.src]-=cap;\n b[e.dst]+=cap;\n }\n }\n }\n\n excess_vs.clear();\n deficit_vs.clear();\n for(int v=0;v<n;v++){\n if(b[v]>0) excess_vs.emplace_back(v);\n if(b[v]<0) deficit_vs.emplace_back(v);\n }\n }\n\n const Cost unreachable = std::numeric_limits<Cost>::max();\n Cost farthest;\n vector<Cost> dist;\n vector<Edge*> parent;\n\n struct P{\n Cost first;\n int second;\n P(Cost first,int second):first(first),second(second){}\n bool operator<(const P o)const{return first>o.first;}\n };\n\n priority_queue<P> pq;\n\n template<typename Predicate>\n void eliminate(vector<int> &vs,Predicate predicate){\n vs.erase(remove_if(begin(vs),end(vs),predicate),end(vs));\n }\n\n bool dual(const Flow delta){\n eliminate(excess_vs, [&](int v){return b[v]<+delta;});\n eliminate(deficit_vs,[&](int v){return b[v]>-delta;});\n\n dist.assign(n,unreachable);\n for(int v:excess_vs) pq.emplace(dist[v]=0,v);\n\n parent.assign(n,nullptr);\n auto emplace=[&](Edge& e){\n if(e.residual_cap()<delta) return;\n Cost nxt=dist[e.src]+residual_cost(e);\n if(nxt>=dist[e.dst]) return;\n pq.emplace(dist[e.dst]=nxt,e.dst);\n parent[e.dst]=&e;\n };\n\n farthest=0;\n int deficit_count=0;\n while(!pq.empty()){\n Cost d=pq.top().first;\n int v=pq.top().second;\n pq.pop();\n if(dist[v]<d) continue;\n farthest=d;\n\n if(b[v]<=-delta) deficit_count++;\n if(deficit_count>=(int)deficit_vs.size()) break;\n\n for(auto &e:G[v]) emplace(e);\n }\n pq=decltype(pq)();\n\n for(int v=0;v<n;v++)\n p[v]+=min(dist[v],farthest);\n\n return deficit_count>0;\n }\n\n void primal(const Flow delta){\n for(int t:deficit_vs){\n if(dist[t]>farthest) continue;\n Flow f=-b[t];\n int v;\n for(v=t;parent[v];v=parent[v]->src)\n chmin(f,parent[v]->residual_cap());\n chmin(f,b[v]);\n\n f-=f%delta;\n if(f<=0) continue;\n\n for(v=t;parent[v];){\n auto &e=*parent[v];\n push(e,f);\n int u=parent[v]->src;\n if(e.residual_cap()<=0) parent[v]=nullptr;\n v=u;\n }\n b[t]+=f;\n b[v]-=f;\n }\n }\n\n template<Flow SCALING_FACTOR=2>\n bool build(){\n p.resize(n);\n Flow max_flow=1;\n for(auto t:b) max_flow=max({max_flow,t,-t});\n for(auto &es:G)\n for(auto &e:es)\n max_flow=max({max_flow,e.residual_cap(),-e.residual_cap()});\n\n Flow delta=1;\n while(delta<max_flow) delta*=SCALING_FACTOR;\n for(;delta;delta/=SCALING_FACTOR){\n saturate_negative(delta);\n while(dual(delta)) primal(delta);\n }\n\n return excess_vs.empty() and deficit_vs.empty();\n }\n\n template<typename T=Cost>\n T get_cost(){\n T res=0;\n for(auto &es:G)\n for(auto &e:es)\n res+=T(e.flow)*T(e.cost)/T(objective);\n return res/T(2);\n }\n template<typename T=Cost> T get_gain(){return get_cost();}\n\n vector<Cost> get_potential(){\n fill(p.begin(),p.end(),0);\n for(int i=0;i<n;i++)\n for(auto &es:G)\n for(auto &e:es)\n if(e.residual_cap()>0)\n chmin(p[e.dst],p[e.src]+e.cost);\n return p;\n }\n};\n\ntemplate<typename Flow, typename Cost>\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\n\n\ntemplate<typename TV, const int N> void read_tuple_impl(TV&) {}\ntemplate<typename TV, const int N, typename Head, typename... Tail>\nvoid read_tuple_impl(TV& ts) {\n get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));\n read_tuple_impl<TV, N+1, Tail...>(ts);\n}\ntemplate<typename... Ts> decltype(auto) read_tuple(size_t n) {\n tuple<vector<Ts>...> ts;\n for(size_t i=0;i<n;i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);\n return ts;\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n using ll = long long;\n\n int n,m,need;\n cin>>n>>m>>need;\n auto [xs,ys,qs]=read_tuple<int, int, int>(n);\n auto [us,vs,fs]=read_tuple<int, int, int>(m);\n\n for(int i=0;i<m;i++) us[i]--,vs[i]--;\n\n auto st=[&](int i){return 0+i;};\n auto en=[&](int i){return n+i;};\n auto check=[&](ll T)->__int128_t{\n int Z=n+n;\n MinCostFlow<ll, ll> G(n+n+1);\n\n const ll INF = 1LL<<50;\n for(int i=0;i<n;i++){\n G.add_edge(st(i),Z,0,INF,0);\n G.add_edge(en(i),st(i),0,INF,-1);\n G.add_edge(Z,en(i),0,INF,T);\n }\n\n for(int i=0;i<m;i++){\n if(fs[i]==+1)\n G.add_edge(en(us[i]),st(vs[i]),0,INF,-1);\n if(fs[i]==-1)\n G.add_edge(st(vs[i]),en(us[i]),0,INF,0);\n }\n\n for(int i=0;i+1<n;i++)\n G.add_edge(st(i+1),st(i),0,INF,0);\n\n for(int i=0;i<n;i++){\n G.add_edge(st(i),en(i),0,xs[i]-ys[i],qs[i]);\n if(xs[i]>=0)\n G.add_edge(en(i),st(i),xs[i],INF,0);\n else\n G.add_edge(st(i),en(i),0,abs(xs[i]),0);\n }\n if(!G.build()) return -1;\n return G.get_cost<__int128_t>();\n };\n\n ll L=0,R=1e12;\n // check(L) < need\n // check(R) >= need\n if(check(R)<need) drop(-1);\n while(L+1<R){\n ll M=(L+R)>>1;\n if(check(M)>=need) R=M;\n else L=M;\n }\n cout<<R<<newl;\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3592,"score_of_the_acc":-0.7611,"final_rank":5},{"submission_id":"aoj_3171_4867708","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\n\n// O(m^2 \\log n \\log U)\n// U: maximum capacity\nenum Objective{\n MINIMIZE = +1,\n MAXIMIZE = -1,\n};\ntemplate<typename Flow, typename Cost,\n Objective objective = Objective::MINIMIZE>\nstruct MinCostFlow{\n template<typename T> inline void chmin(T &x,T y){x=min(x,y);}\n\n struct Edge{\n int src,dst;\n Flow flow,cap;\n Cost cost;\n int rev;\n Edge(int src,int dst,Flow cap,Cost cost,int rev):\n src(src),dst(dst),flow(0),cap(cap),cost(cost),rev(rev){}\n Flow residual_cap()const{return cap-flow;}\n };\n\n struct EdgePtr{\n int v,e;\n EdgePtr(int v,int e):v(v),e(e){}\n };\n\n int n;\n vector<vector<Edge>> G;\n vector<Flow> b;\n vector<Cost> p;\n\n MinCostFlow(int n):n(n),G(n),b(n,0){}\n\n EdgePtr add_edge(int src,int dst,Flow lower,Flow upper,Cost cost){\n int e=G[src].size();\n int r=(src==dst?e+1:G[dst].size());\n assert(lower<=upper);\n G[src].emplace_back(src,dst,+upper,+cost*objective,r);\n G[dst].emplace_back(dst,src,-lower,-cost*objective,e);\n return EdgePtr(src,e);\n }\n\n const Edge &get_edge(EdgePtr ep)const{return G[ep.v][ep.e];}\n\n void push(Edge &e,Flow amount){\n e.flow+=amount;\n G[e.dst][e.rev].flow-=amount;\n }\n\n void add_supply(int v,Flow amount){b[v]+=amount;}\n void add_demand(int v,Flow amount){b[v]-=amount;}\n\n Cost residual_cost(const Edge &e){\n return e.cost+p[e.src]-p[e.dst];\n }\n\n vector<int> excess_vs,deficit_vs;\n void saturate_negative(const Flow delta){\n for(auto &es:G){\n for(auto &e:es){\n Flow cap=e.residual_cap();\n cap-=cap%delta;\n if(cap<0 or residual_cost(e)<0){\n push(e,cap);\n b[e.src]-=cap;\n b[e.dst]+=cap;\n }\n }\n }\n\n excess_vs.clear();\n deficit_vs.clear();\n for(int v=0;v<n;v++){\n if(b[v]>0) excess_vs.emplace_back(v);\n if(b[v]<0) deficit_vs.emplace_back(v);\n }\n }\n\n const Cost unreachable = std::numeric_limits<Cost>::max();\n Cost farthest;\n vector<Cost> dist;\n vector<Edge*> parent;\n\n struct P{\n Cost first;\n int second;\n P(Cost first,int second):first(first),second(second){}\n bool operator<(const P o)const{return first>o.first;}\n };\n\n priority_queue<P> pq;\n\n template<typename Predicate>\n void eliminate(vector<int> &vs,Predicate predicate){\n vs.erase(remove_if(begin(vs),end(vs),predicate),end(vs));\n }\n\n bool dual(const Flow delta){\n eliminate(excess_vs, [&](int v){return b[v]<+delta;});\n eliminate(deficit_vs,[&](int v){return b[v]>-delta;});\n\n dist.assign(n,unreachable);\n for(int v:excess_vs) pq.emplace(dist[v]=0,v);\n\n parent.assign(n,nullptr);\n auto emplace=[&](Edge& e){\n if(e.residual_cap()<delta) return;\n Cost nxt=dist[e.src]+residual_cost(e);\n if(nxt>=dist[e.dst]) return;\n pq.emplace(dist[e.dst]=nxt,e.dst);\n parent[e.dst]=&e;\n };\n\n farthest=0;\n int deficit_count=0;\n while(!pq.empty()){\n Cost d=pq.top().first;\n int v=pq.top().second;\n pq.pop();\n if(dist[v]<d) continue;\n farthest=d;\n\n if(b[v]<=-delta) deficit_count++;\n if(deficit_count>=(int)deficit_vs.size()) break;\n\n for(auto &e:G[v]) emplace(e);\n }\n pq=decltype(pq)();\n\n for(int v=0;v<n;v++)\n p[v]+=min(dist[v],farthest);\n\n return deficit_count>0;\n }\n\n void primal(const Flow delta){\n for(int t:deficit_vs){\n if(dist[t]>farthest) continue;\n Flow f=-b[t];\n int v;\n for(v=t;parent[v];v=parent[v]->src)\n chmin(f,parent[v]->residual_cap());\n chmin(f,b[v]);\n\n f-=f%delta;\n if(f<=0) continue;\n\n for(v=t;parent[v];){\n auto &e=*parent[v];\n push(e,f);\n int u=parent[v]->src;\n if(e.residual_cap()<=0) parent[v]=nullptr;\n v=u;\n }\n b[t]+=f;\n b[v]-=f;\n }\n }\n\n template<Flow SCALING_FACTOR=2>\n bool build(){\n p.resize(n);\n Flow max_flow=1;\n for(auto t:b) max_flow=max({max_flow,t,-t});\n for(auto &es:G)\n for(auto &e:es)\n max_flow=max({max_flow,e.residual_cap(),-e.residual_cap()});\n\n Flow delta=1;\n while(delta<max_flow) delta*=SCALING_FACTOR;\n for(;delta;delta/=SCALING_FACTOR){\n saturate_negative(delta);\n while(dual(delta)) primal(delta);\n }\n\n return excess_vs.empty() and deficit_vs.empty();\n }\n\n template<typename T=Cost>\n T get_cost(){\n T res=0;\n for(auto &es:G)\n for(auto &e:es)\n res+=T(e.flow)*T(e.cost)/T(objective);\n return res/T(2);\n }\n template<typename T=Cost> T get_gain(){return get_cost();}\n\n vector<Cost> get_potential(){\n fill(p.begin(),p.end(),0);\n for(int i=0;i<n;i++)\n for(auto &es:G)\n for(auto &e:es)\n if(e.residual_cap()>0)\n chmin(p[e.dst],p[e.src]+e.cost);\n return p;\n }\n};\n\ntemplate<typename Flow, typename Cost>\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\n\n\ntemplate<typename TV, const int N> void read_tuple_impl(TV&) {}\ntemplate<typename TV, const int N, typename Head, typename... Tail>\nvoid read_tuple_impl(TV& ts) {\n get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));\n read_tuple_impl<TV, N+1, Tail...>(ts);\n}\ntemplate<typename... Ts> decltype(auto) read_tuple(size_t n) {\n tuple<vector<Ts>...> ts;\n for(size_t i=0;i<n;i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);\n return ts;\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n using ll = long long;\n\n int n,m,need;\n cin>>n>>m>>need;\n auto [xs,ys,qs]=read_tuple<int, int, int>(n);\n auto [us,vs,fs]=read_tuple<int, int, int>(m);\n\n for(int i=0;i<m;i++) us[i]--,vs[i]--;\n\n auto st=[&](int i){return 0+i;};\n auto en=[&](int i){return n+i;};\n auto check=[&](ll T)->__int128_t{\n int Z=n+n;\n MinCostFlow<ll, ll> G(n+n+1);\n\n const ll INF = 1LL<<40;\n for(int i=0;i<n;i++){\n G.add_edge(st(i),Z,0,INF,0);\n G.add_edge(en(i),st(i),0,INF,-1);\n G.add_edge(Z,en(i),0,INF,T);\n }\n\n for(int i=0;i<m;i++){\n if(fs[i]==+1)\n G.add_edge(en(us[i]),st(vs[i]),0,INF,-1);\n if(fs[i]==-1)\n G.add_edge(st(vs[i]),en(us[i]),0,INF,0);\n }\n\n for(int i=0;i+1<n;i++)\n G.add_edge(st(i+1),st(i),0,INF,0);\n\n for(int i=0;i<n;i++){\n G.add_edge(st(i),en(i),0,xs[i]-ys[i],qs[i]);\n if(xs[i]>=0)\n G.add_edge(en(i),st(i),xs[i],INF,0);\n else\n G.add_edge(st(i),en(i),0,abs(xs[i]),0);\n }\n if(!G.build()) return -1;\n return G.get_cost<__int128_t>();\n };\n\n ll L=0,R=1e9;\n // check(L) < need\n // check(R) >= need\n if(check(R)<need) drop(-1);\n while(L+1<R){\n ll M=(L+R)>>1;\n if(check(M)>=need) R=M;\n else L=M;\n }\n cout<<R<<newl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3592,"score_of_the_acc":-0.6811,"final_rank":2},{"submission_id":"aoj_3171_4867690","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\n\n// O(m^2 \\log n \\log U)\n// U: maximum capacity\nenum Objective{\n MINIMIZE = +1,\n MAXIMIZE = -1,\n};\ntemplate<typename Flow, typename Cost,\n Objective objective = Objective::MINIMIZE>\nstruct MinCostFlow{\n template<typename T> inline void chmin(T &x,T y){x=min(x,y);}\n\n struct Edge{\n int src,dst;\n Flow flow,cap;\n Cost cost;\n int rev;\n Edge(int src,int dst,Flow cap,Cost cost,int rev):\n src(src),dst(dst),flow(0),cap(cap),cost(cost),rev(rev){}\n Flow residual_cap()const{return cap-flow;}\n };\n\n struct EdgePtr{\n int v,e;\n EdgePtr(int v,int e):v(v),e(e){}\n };\n\n int n;\n vector<vector<Edge>> G;\n vector<Flow> b;\n vector<Cost> p;\n\n MinCostFlow(int n):n(n),G(n),b(n,0){}\n\n EdgePtr add_edge(int src,int dst,Flow lower,Flow upper,Cost cost){\n int e=G[src].size();\n int r=(src==dst?e+1:G[dst].size());\n assert(lower<=upper);\n G[src].emplace_back(src,dst,+upper,+cost*objective,r);\n G[dst].emplace_back(dst,src,-lower,-cost*objective,e);\n return EdgePtr(src,e);\n }\n\n const Edge &get_edge(EdgePtr ep)const{return G[ep.v][ep.e];}\n\n void push(Edge &e,Flow amount){\n e.flow+=amount;\n G[e.dst][e.rev].flow-=amount;\n }\n\n void add_supply(int v,Flow amount){b[v]+=amount;}\n void add_demand(int v,Flow amount){b[v]-=amount;}\n\n Cost residual_cost(const Edge &e){\n return e.cost+p[e.src]-p[e.dst];\n }\n\n vector<int> excess_vs,deficit_vs;\n void saturate_negative(const Flow delta){\n for(auto &es:G){\n for(auto &e:es){\n Flow cap=e.residual_cap();\n cap-=cap%delta;\n if(cap<0 or residual_cost(e)<0){\n push(e,cap);\n b[e.src]-=cap;\n b[e.dst]+=cap;\n }\n }\n }\n\n excess_vs.clear();\n deficit_vs.clear();\n for(int v=0;v<n;v++){\n if(b[v]>0) excess_vs.emplace_back(v);\n if(b[v]<0) deficit_vs.emplace_back(v);\n }\n }\n\n const Cost unreachable = std::numeric_limits<Cost>::max();\n Cost farthest;\n vector<Cost> dist;\n vector<Edge*> parent;\n\n struct P{\n Cost first;\n int second;\n P(Cost first,int second):first(first),second(second){}\n bool operator<(const P o)const{return first>o.first;}\n };\n\n priority_queue<P> pq;\n\n template<typename Predicate>\n void eliminate(vector<int> &vs,Predicate predicate){\n vs.erase(remove_if(begin(vs),end(vs),predicate),end(vs));\n }\n\n bool dual(const Flow delta){\n eliminate(excess_vs, [&](int v){return b[v]<+delta;});\n eliminate(deficit_vs,[&](int v){return b[v]>-delta;});\n\n dist.assign(n,unreachable);\n for(int v:excess_vs) pq.emplace(dist[v]=0,v);\n\n parent.assign(n,nullptr);\n auto emplace=[&](Edge& e){\n if(e.residual_cap()<delta) return;\n Cost nxt=dist[e.src]+residual_cost(e);\n if(nxt>=dist[e.dst]) return;\n pq.emplace(dist[e.dst]=nxt,e.dst);\n parent[e.dst]=&e;\n };\n\n farthest=0;\n int deficit_count=0;\n while(!pq.empty()){\n Cost d=pq.top().first;\n int v=pq.top().second;\n pq.pop();\n if(dist[v]<d) continue;\n farthest=d;\n\n if(b[v]<=-delta) deficit_count++;\n if(deficit_count>=(int)deficit_vs.size()) break;\n\n for(auto &e:G[v]) emplace(e);\n }\n pq=decltype(pq)();\n\n for(int v=0;v<n;v++)\n p[v]+=min(dist[v],farthest);\n\n return deficit_count>0;\n }\n\n void primal(const Flow delta){\n for(int t:deficit_vs){\n if(dist[t]>farthest) continue;\n Flow f=-b[t];\n int v;\n for(v=t;parent[v];v=parent[v]->src)\n chmin(f,parent[v]->residual_cap());\n chmin(f,b[v]);\n\n f-=f%delta;\n if(f<=0) continue;\n\n for(v=t;parent[v];){\n auto &e=*parent[v];\n push(e,f);\n int u=parent[v]->src;\n if(e.residual_cap()<=0) parent[v]=nullptr;\n v=u;\n }\n b[t]+=f;\n b[v]-=f;\n }\n }\n\n template<Flow SCALING_FACTOR=2>\n bool build(){\n p.resize(n);\n Flow max_flow=1;\n for(auto t:b) max_flow=max({max_flow,t,-t});\n for(auto &es:G)\n for(auto &e:es)\n max_flow=max({max_flow,e.residual_cap(),-e.residual_cap()});\n\n Flow delta=1;\n while(delta<max_flow) delta*=SCALING_FACTOR;\n for(;delta;delta/=SCALING_FACTOR){\n saturate_negative(delta);\n while(dual(delta)) primal(delta);\n }\n\n return excess_vs.empty() and deficit_vs.empty();\n }\n\n template<typename T=Cost>\n T get_cost(){\n T res=0;\n for(auto &es:G)\n for(auto &e:es)\n res+=T(e.flow)*T(e.cost)/T(objective);\n return res/T(2);\n }\n template<typename T=Cost> T get_gain(){return get_cost();}\n\n vector<Cost> get_potential(){\n fill(p.begin(),p.end(),0);\n for(int i=0;i<n;i++)\n for(auto &es:G)\n for(auto &e:es)\n if(e.residual_cap()>0)\n chmin(p[e.dst],p[e.src]+e.cost);\n return p;\n }\n};\n\ntemplate<typename Flow, typename Cost>\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\n\n\ntemplate<typename TV, const int N> void read_tuple_impl(TV&) {}\ntemplate<typename TV, const int N, typename Head, typename... Tail>\nvoid read_tuple_impl(TV& ts) {\n get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));\n read_tuple_impl<TV, N+1, Tail...>(ts);\n}\ntemplate<typename... Ts> decltype(auto) read_tuple(size_t n) {\n tuple<vector<Ts>...> ts;\n for(size_t i=0;i<n;i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);\n return ts;\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n using ll = long long;\n\n int n,m,need;\n cin>>n>>m>>need;\n auto [xs,ys,qs]=read_tuple<int, int, int>(n);\n auto [us,vs,fs]=read_tuple<int, int, int>(m);\n\n for(int i=0;i<m;i++) us[i]--,vs[i]--;\n\n auto st=[&](int i){return 0+i;};\n auto en=[&](int i){return n+i;};\n auto check=[&](ll T)->ll{\n int Z=n+n;\n MinCostFlow<ll, ll> G(n+n+1);\n\n const ll INF = 1LL<<60;\n for(int i=0;i<n;i++){\n G.add_edge(st(i),Z,0,INF,0);\n G.add_edge(en(i),st(i),0,INF,-1);\n G.add_edge(Z,en(i),0,INF,T);\n }\n\n for(int i=0;i<m;i++){\n if(fs[i]==+1)\n G.add_edge(en(us[i]),st(vs[i]),0,INF,-1);\n if(fs[i]==-1)\n G.add_edge(st(vs[i]),en(us[i]),0,INF,0);\n }\n\n for(int i=0;i+1<n;i++)\n G.add_edge(st(i+1),st(i),0,INF,0);\n\n for(int i=0;i<n;i++){\n G.add_edge(st(i),en(i),0,xs[i]-ys[i],qs[i]);\n if(xs[i]>=0)\n G.add_edge(en(i),st(i),xs[i],INF,0);\n else\n G.add_edge(st(i),en(i),0,abs(xs[i]),0);\n }\n if(!G.build()) return -1;\n return G.get_cost();\n };\n\n ll L=0,R=1e9;\n // check(L) < need\n // check(R) >= need\n if(check(R)<need) drop(-1);\n while(L+1<R){\n int M=(L+R)>>1;\n if(check(M)>=need) R=M;\n else L=M;\n }\n cout<<R<<newl;\n return 0;\n}","accuracy":0.13333333333333333,"time_ms":10,"memory_kb":3468,"score_of_the_acc":-0.3288,"final_rank":20},{"submission_id":"aoj_3171_4867679","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\n\n// O(m^2 \\log n \\log U)\n// U: maximum capacity\nenum Objective{\n MINIMIZE = +1,\n MAXIMIZE = -1,\n};\ntemplate<typename Flow, typename Cost,\n Objective objective = Objective::MINIMIZE>\nstruct MinCostFlow{\n template<typename T> inline void chmin(T &x,T y){x=min(x,y);}\n\n struct Edge{\n int src,dst;\n Flow flow,cap;\n Cost cost;\n int rev;\n Edge(int src,int dst,Flow cap,Cost cost,int rev):\n src(src),dst(dst),flow(0),cap(cap),cost(cost),rev(rev){}\n Flow residual_cap()const{return cap-flow;}\n };\n\n struct EdgePtr{\n int v,e;\n EdgePtr(int v,int e):v(v),e(e){}\n };\n\n int n;\n vector<vector<Edge>> G;\n vector<Flow> b;\n vector<Cost> p;\n\n MinCostFlow(int n):n(n),G(n),b(n,0){}\n\n EdgePtr add_edge(int src,int dst,Flow lower,Flow upper,Cost cost){\n int e=G[src].size();\n int r=(src==dst?e+1:G[dst].size());\n assert(lower<=upper);\n G[src].emplace_back(src,dst,+upper,+cost*objective,r);\n G[dst].emplace_back(dst,src,-lower,-cost*objective,e);\n return EdgePtr(src,e);\n }\n\n const Edge &get_edge(EdgePtr ep)const{return G[ep.v][ep.e];}\n\n void push(Edge &e,Flow amount){\n e.flow+=amount;\n G[e.dst][e.rev].flow-=amount;\n }\n\n void add_supply(int v,Flow amount){b[v]+=amount;}\n void add_demand(int v,Flow amount){b[v]-=amount;}\n\n Cost residual_cost(const Edge &e){\n return e.cost+p[e.src]-p[e.dst];\n }\n\n vector<int> excess_vs,deficit_vs;\n void saturate_negative(const Flow delta){\n for(auto &es:G){\n for(auto &e:es){\n Flow cap=e.residual_cap();\n cap-=cap%delta;\n if(cap<0 or residual_cost(e)<0){\n push(e,cap);\n b[e.src]-=cap;\n b[e.dst]+=cap;\n }\n }\n }\n\n excess_vs.clear();\n deficit_vs.clear();\n for(int v=0;v<n;v++){\n if(b[v]>0) excess_vs.emplace_back(v);\n if(b[v]<0) deficit_vs.emplace_back(v);\n }\n }\n\n const Cost unreachable = std::numeric_limits<Cost>::max();\n Cost farthest;\n vector<Cost> dist;\n vector<Edge*> parent;\n\n struct P{\n Cost first;\n int second;\n P(Cost first,int second):first(first),second(second){}\n bool operator<(const P o)const{return first>o.first;}\n };\n\n priority_queue<P> pq;\n\n template<typename Predicate>\n void eliminate(vector<int> &vs,Predicate predicate){\n vs.erase(remove_if(begin(vs),end(vs),predicate),end(vs));\n }\n\n bool dual(const Flow delta){\n eliminate(excess_vs, [&](int v){return b[v]<+delta;});\n eliminate(deficit_vs,[&](int v){return b[v]>-delta;});\n\n dist.assign(n,unreachable);\n for(int v:excess_vs) pq.emplace(dist[v]=0,v);\n\n parent.assign(n,nullptr);\n auto emplace=[&](Edge& e){\n if(e.residual_cap()<delta) return;\n Cost nxt=dist[e.src]+residual_cost(e);\n if(nxt>=dist[e.dst]) return;\n pq.emplace(dist[e.dst]=nxt,e.dst);\n parent[e.dst]=&e;\n };\n\n farthest=0;\n int deficit_count=0;\n while(!pq.empty()){\n Cost d=pq.top().first;\n int v=pq.top().second;\n pq.pop();\n if(dist[v]<d) continue;\n farthest=d;\n\n if(b[v]<=-delta) deficit_count++;\n if(deficit_count>=(int)deficit_vs.size()) break;\n\n for(auto &e:G[v]) emplace(e);\n }\n pq=decltype(pq)();\n\n for(int v=0;v<n;v++)\n p[v]+=min(dist[v],farthest);\n\n return deficit_count>0;\n }\n\n void primal(const Flow delta){\n for(int t:deficit_vs){\n if(dist[t]>farthest) continue;\n Flow f=-b[t];\n int v;\n for(v=t;parent[v];v=parent[v]->src)\n chmin(f,parent[v]->residual_cap());\n chmin(f,b[v]);\n\n f-=f%delta;\n if(f<=0) continue;\n\n for(v=t;parent[v];){\n auto &e=*parent[v];\n push(e,f);\n int u=parent[v]->src;\n if(e.residual_cap()<=0) parent[v]=nullptr;\n v=u;\n }\n b[t]+=f;\n b[v]-=f;\n }\n }\n\n template<Flow SCALING_FACTOR=2>\n bool build(){\n p.resize(n);\n Flow max_flow=1;\n for(auto t:b) max_flow=max({max_flow,t,-t});\n for(auto &es:G)\n for(auto &e:es)\n max_flow=max({max_flow,e.residual_cap(),-e.residual_cap()});\n\n Flow delta=1;\n while(delta<max_flow) delta*=SCALING_FACTOR;\n for(;delta;delta/=SCALING_FACTOR){\n saturate_negative(delta);\n while(dual(delta)) primal(delta);\n }\n\n return excess_vs.empty() and deficit_vs.empty();\n }\n\n template<typename T=Cost>\n T get_cost(){\n T res=0;\n for(auto &es:G)\n for(auto &e:es)\n res+=T(e.flow)*T(e.cost)/T(objective);\n return res/T(2);\n }\n template<typename T=Cost> T get_gain(){return get_cost();}\n\n vector<Cost> get_potential(){\n fill(p.begin(),p.end(),0);\n for(int i=0;i<n;i++)\n for(auto &es:G)\n for(auto &e:es)\n if(e.residual_cap()>0)\n chmin(p[e.dst],p[e.src]+e.cost);\n return p;\n }\n};\n\ntemplate<typename Flow, typename Cost>\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\n\n\ntemplate<typename TV, const int N> void read_tuple_impl(TV&) {}\ntemplate<typename TV, const int N, typename Head, typename... Tail>\nvoid read_tuple_impl(TV& ts) {\n get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));\n read_tuple_impl<TV, N+1, Tail...>(ts);\n}\ntemplate<typename... Ts> decltype(auto) read_tuple(size_t n) {\n tuple<vector<Ts>...> ts;\n for(size_t i=0;i<n;i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);\n return ts;\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n using ll = long long;\n\n int n,m,need;\n cin>>n>>m>>need;\n auto [xs,ys,qs]=read_tuple<int, int, int>(n);\n auto [us,vs,fs]=read_tuple<int, int, int>(m);\n\n for(int i=0;i<m;i++) us[i]--,vs[i]--;\n\n auto st=[&](int i){return 0+i;};\n auto en=[&](int i){return n+i;};\n auto check=[&](ll T)->ll{\n int Z=n+n;\n MinCostFlow<ll, ll> G(n+n+1);\n\n const ll INF = 1LL<<40;\n for(int i=0;i<n;i++){\n G.add_edge(st(i),Z,0,INF,0);\n G.add_edge(en(i),st(i),0,INF,-1);\n G.add_edge(Z,en(i),0,INF,T);\n }\n\n for(int i=0;i<m;i++){\n if(fs[i]==+1)\n G.add_edge(en(us[i]),st(vs[i]),0,INF,-1);\n if(fs[i]==-1)\n G.add_edge(st(vs[i]),en(us[i]),0,INF,0);\n }\n\n for(int i=0;i+1<n;i++)\n G.add_edge(st(i+1),st(i),0,INF,0);\n\n for(int i=0;i<n;i++){\n G.add_edge(st(i),en(i),0,xs[i]-ys[i],qs[i]);\n if(xs[i]>=0)\n G.add_edge(en(i),st(i),xs[i],INF,0);\n else\n G.add_edge(st(i),en(i),0,abs(xs[i]),0);\n }\n if(!G.build()) return -1;\n return G.get_cost();\n };\n\n ll L=0,R=1e9;\n // check(L) < need\n // check(R) >= need\n if(check(R)<need) drop(-1);\n while(L+1<R){\n int M=(L+R)>>1;\n if(check(M)>=need) R=M;\n else L=M;\n }\n cout<<R<<newl;\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3584,"score_of_the_acc":-0.6874,"final_rank":3},{"submission_id":"aoj_3171_4853174","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n// Ford-Fulkerson 法による 最大流 O( F |E| )\n// Bellman-Ford 法による 最小費用流 O( F |V| |E| )\n// [条件に注意] Dijkstra 法による 最小費用流 O( F |E| log |V| )\n\ntemplate <typename CapTp=int, typename CostTp=int>\nstruct Edge {\n int to, rev;\n CapTp cap; CostTp cost;\n bool is_rev;\n Edge(int t, bool f, int r, CapTp ca, CostTp co=0)\n : to(t), rev(r), cap(ca), cost(co), is_rev(f) {}\n};\n\ntemplate <typename CapTp=int, typename CostTp=int>\nstruct Flow {\n using Graph = vector< vector< Edge<CapTp, CostTp> > >;\n Graph G; const CapTp IA; const CostTp IO, NIL;\n vector< pair<int, int> > r_edges;\n vector<CostTp> dist, pot;\n vector<int> prevv, preve;\n\n Flow(int N_, CapTp IA_=1<<29, CostTp IO_=1<<29, CostTp NIL_=-1)\n : G(N_), IA(IA_), IO(IO_), NIL(NIL_), r_edges(),\n dist(N_), pot(N_), prevv(N_), preve(N_) {}\n // 辺を追加 (from -> to に流量 ca, コスト co)\n void add_edge(int from, int to, CapTp ca, CostTp co=0) {\n G[from].emplace_back(to, false, G[to].size(), ca, co);\n G[to].emplace_back(from, true, G[from].size() - 1, 0, -co);\n r_edges.emplace_back(to, G[to].size() - 1);\n }\n // k 番目の辺にいくつ流れたか\n CapTp get_flowed_cap(size_t k) {\n if(r_edges.size() <= k) return -1;\n int v, i; tie(v, i) = r_edges[k];\n return G[v][i].cap;\n }\n // s -> t 最大流\n CapTp max_flow(int s, int t) {\n vector<bool> used(G.size());\n auto dfs = [&](auto &&func, int v, int t, CapTp f) -> CapTp {\n if(v == t) return f;\n used[v] = true;\n for(auto &e : G[v]) {\n if(used[e.to] or e.cap == 0) continue;\n CapTp d = func(func, e.to, t, min(f, e.cap));\n if(d == 0) continue;\n e.cap -= d; G[e.to][e.rev].cap += d;\n return d;\n }\n return 0;\n };\n\n CapTp res(0);\n while(true) {\n fill(used.begin(), used.end(), false);\n CapTp delta = dfs(dfs, s, t, IA);\n if(delta == 0) return res;\n res += delta;\n }\n }\n // ベルマンフォードをつかって最小費用流\n CostTp mincost_flow(int s, int t, CapTp f) {\n CostTp res(0);\n while(f > 0) {\n fill(dist.begin(), dist.end(), IO);\n dist[s] = 0;\n while(1) {\n bool upd = false;\n for(int v=0; v<(int)G.size(); v++) {\n if(dist[v] == IO) continue;\n for(size_t i=0; i<G[v].size(); i++) {\n auto &e = G[v][i];\n if(e.cap == 0 or dist[e.to] <= dist[v] + e.cost) continue;\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v, preve[e.to] = i;\n upd = true;\n }\n }\n if(!upd) break;\n }\n\n if(dist[t] == IO) return NIL;\n CapTp d = f;\n for(int v=t; v!=s; v=prevv[v]) d = min(d, G[prevv[v]][preve[v]].cap);\n f -= d; res += d * dist[t];\n for(int v=t; v!=s; v=prevv[v]) {\n auto &e = G[prevv[v]][preve[v]];\n e.cap -= d, G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n // ポテンシャルの導入により、ダイクストラ法で最小費用流を解く\n // [仮定している条件]\n // 1. グラフに負の閉路が存在しない (流量の 0 初期化のため)\n // もし存在するならベルマンフォードで負の閉路を見つけ\n // そこに流せるだけ流してスタート\n // 2. グラフに負の辺が存在しない (pot_0 の計算可能性)\n // もし存在する場合は最初のみベルマンフォードを使う必要あり\n CostTp fast_mincost_flow(int s, int t, CapTp f) {\n CostTp res(0);\n fill(pot.begin(), pot.end(), CostTp(0));\n\n while(f > 0) {\n using PT = pair<CostTp, int>;\n priority_queue< PT, vector<PT>, greater<PT> > que;\n fill(dist.begin(), dist.end(), IO);\n\n dist[s] = 0;\n que.push(make_pair(0, s));\n while(!que.empty()) {\n PT cur = que.top(); que.pop();\n int v = cur.second;\n if(dist[v] < cur.first) continue;\n for(size_t i=0; i<G[v].size(); i++) {\n auto& e = G[v][i];\n if(e.cap > 0 and dist[e.to] > dist[v] + e.cost + pot[v] - pot[e.to]) {\n dist[e.to] = dist[v] + e.cost + pot[v] - pot[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(make_pair(dist[e.to], e.to));\n }\n }\n }\n if(dist[t] == IO) {\n return NIL;\n }\n for(int v=0; v<(int)G.size(); v++) pot[v] += dist[v];\n\n CapTp d = f;\n for(int v=t; v!=s; v=prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * pot[t];\n for(int v=t; v!=s; v=prevv[v]) {\n auto& e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n\ntemplate <typename cap_tp=int, typename cost_tp=int,\n template<typename, typename> class flow_fw=Flow>\nstruct GeneralizedMincostFlow {\nprivate:\n flow_fw<cap_tp, cost_tp> fl;\n vector<cap_tp> D;\n int N, source, sink;\n cap_tp Z_cap;\n cost_tp Z_cost, ofs, ng;\n int edge_id;\n\npublic:\n GeneralizedMincostFlow(int N_,\n cost_tp ng_=-1,\n cap_tp IA=1<<29, cost_tp IO=1<<29,\n cap_tp zero_cap=0, cost_tp zero_cost=0)\n : fl(N_+2, IA, IO, ng_), D(N_), N(N_), source(N_), sink(N_+1),\n Z_cap(zero_cap), Z_cost(zero_cost), ofs(zero_cost), ng(ng_),\n edge_id(0) {}\n\n int add_edge(int u, int v, cap_tp low, cap_tp high, cost_tp cost) {\n assert(low <= high);\n if(low < Z_cap) {\n add_edge(v, u, -low, -low, -cost);\n add_edge(u, v, 0, high - low, +cost);\n return -1; // TODO ?\n }\n int id = -1;\n\n // コストが負の場合\n if(cost < Z_cost) {\n // 流すだけ得なので high 流れたことにする\n ofs += high * cost;\n D[u] -= high; D[v] += high;\n // 目一杯流したのを high - low 分だけキャンセル可能\n if(high - low > Z_cap) {\n id = edge_id++;\n fl.add_edge(v, u, high - low, -cost);\n }\n }\n else {\n // v 側に low 流れたことにする\n ofs += low * cost;\n D[u] -= low; D[v] += low;\n // high - low 分の辺を張る\n if(high - low > Z_cap) {\n id = edge_id++;\n fl.add_edge(u, v, high - low, cost);\n }\n }\n return id;\n }\n int add_edge(int u, int v, cap_tp cap, cost_tp cost) {\n return add_edge(u, v, Z_cap, cap, cost);\n }\n void change_d(int u, cap_tp delta) {\n D[u] += delta;\n }\n\n cost_tp mincost_flow() {\n cap_tp sum_d = 0;\n for(int i=0; i<N; i++) {\n if(D[i] > 0) {\n fl.add_edge(source, i, D[i], 0);\n sum_d += D[i];\n }\n else {\n fl.add_edge(i, sink, -D[i], 0);\n }\n }\n\n cost_tp res = fl.fast_mincost_flow(source, sink, sum_d);\n if(res == fl.NIL) return ng;\n else return ofs + res;\n }\n\n cap_tp get_flowed_cap(size_t k) {\n return fl.get_flowed_cap(k);\n }\n\n cap_tp operator[](size_t k) {\n return fl.pot[k];\n }\n};\n\nconst int INF=1e9;\n\nsigned main(){\n int n,m,x;cin>>n>>m>>x;\n vector<int> a(n),b(n),p(n),u(m),v(m),f(m);\n for(int i=0;i<n;i++){\n cin>>a[i]>>b[i]>>p[i];\n x-=a[i]*p[i];\n }\n for(int i=0;i<m;i++){\n cin>>u[i]>>v[i]>>f[i];\n u[i]--;v[i]--;\n }\n int ng=-1,ok=INF;//ok時間あれば仕事量xを達成できる\n while(ok-ng>1){\n int mid=(ok+ng)>>1;\n GeneralizedMincostFlow<> fl(n*2+1);//[0,n)がs[i]、[n,2n-1)がt[i]、2nがz\n int z=2*n;\n for(int i=0;i<n;i++){\n if(i)fl.add_edge(i,i-1,0,INF,0);\n fl.add_edge(i,z,0,INF,0);\n fl.add_edge(n+i,i,0,INF,-1);\n fl.add_edge(z,n+i,0,INF,mid);\n fl.add_edge(n+i,i,b[i],a[i],-p[i]);\n }\n for(int i=0;i<m;i++){\n if(~f[i])fl.add_edge(u[i]+n,v[i],0,INF,-1);\n else fl.add_edge(v[i],u[i]+n,0,INF,0);\n }\n if(x<=fl.mincost_flow())ok=mid;\n else ng=mid;\n }\n if(ng>1e7)cout<<-1<<endl;\n else cout<<ok<<endl;\n}","accuracy":1,"time_ms":350,"memory_kb":3276,"score_of_the_acc":-0.68,"final_rank":1},{"submission_id":"aoj_3171_4850087","code_snippet":"#include <vector>\n#include <utility>\n#include <tuple>\n#include <queue>\n#include <algorithm>\n#include <cassert>\n#include <iostream>\nusing namespace std;\nusing ll = long long int;\n\n// Ford-Fulkerson 法による 最大流 O( F |E| )\n// Bellman-Ford 法による 最小費用流 O( F |V| |E| )\n// [条件に注意] Dijkstra 法による 最小費用流 O( F |E| log |V| )\n\ntemplate <typename CapTp=int, typename CostTp=int>\nstruct Edge {\n int to, rev;\n CapTp cap; CostTp cost;\n bool is_rev;\n Edge(int t, bool f, int r, CapTp ca, CostTp co=0)\n : to(t), rev(r), cap(ca), cost(co), is_rev(f) {}\n};\n\ntemplate <typename CapTp=int, typename CostTp=int>\nstruct Flow {\n using Graph = vector< vector< Edge<CapTp, CostTp> > >;\n Graph G; const CapTp IA; const CostTp IO, NIL;\n vector< pair<int, int> > r_edges;\n vector<CostTp> dist, pot;\n vector<int> prevv, preve;\n \n Flow(int N_, CapTp IA_=1<<29, CostTp IO_=1<<29, CostTp NIL_=-1)\n : G(N_), IA(IA_), IO(IO_), NIL(NIL_), r_edges(),\n dist(N_), pot(N_), prevv(N_), preve(N_) {}\n // 辺を追加 (from -> to に流量 ca, コスト co)\n void add_edge(int from, int to, CapTp ca, CostTp co=0) {\n G[from].emplace_back(to, false, G[to].size(), ca, co);\n G[to].emplace_back(from, true, G[from].size() - 1, 0, -co);\n r_edges.emplace_back(to, G[to].size() - 1);\n }\n // k 番目の辺にいくつ流れたか\n CapTp get_flowed_cap(size_t k) {\n if(r_edges.size() <= k) return -1;\n int v, i; tie(v, i) = r_edges[k];\n return G[v][i].cap;\n }\n // s -> t 最大流\n CapTp max_flow(int s, int t) {\n vector<bool> used(G.size());\n auto dfs = [&](auto &&func, int v, int t, CapTp f) -> CapTp {\n if(v == t) return f;\n used[v] = true;\n for(auto &e : G[v]) {\n if(used[e.to] or e.cap == 0) continue;\n CapTp d = func(func, e.to, t, min(f, e.cap));\n if(d == 0) continue;\n e.cap -= d; G[e.to][e.rev].cap += d;\n return d;\n }\n return 0;\n };\n\n CapTp res(0);\n while(true) {\n fill(used.begin(), used.end(), false);\n CapTp delta = dfs(dfs, s, t, IA);\n if(delta == 0) return res;\n res += delta;\n }\n }\n // ベルマンフォードをつかって最小費用流\n CostTp mincost_flow(int s, int t, CapTp f) {\n CostTp res(0);\n while(f > 0) {\n fill(dist.begin(), dist.end(), IO);\n dist[s] = 0;\n while(1) {\n bool upd = false;\n for(int v=0; v<(int)G.size(); v++) {\n if(dist[v] == IO) continue;\n for(size_t i=0; i<G[v].size(); i++) {\n auto &e = G[v][i];\n if(e.cap == 0 or dist[e.to] <= dist[v] + e.cost) continue;\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v, preve[e.to] = i;\n upd = true;\n }\n }\n if(!upd) break;\n }\n\n if(dist[t] == IO) return NIL;\n CapTp d = f;\n for(int v=t; v!=s; v=prevv[v]) d = min(d, G[prevv[v]][preve[v]].cap);\n f -= d; res += d * dist[t];\n for(int v=t; v!=s; v=prevv[v]) {\n auto &e = G[prevv[v]][preve[v]];\n e.cap -= d, G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n // ポテンシャルの導入により、ダイクストラ法で最小費用流を解く\n // [仮定している条件]\n // 1. グラフに負の閉路が存在しない (流量の 0 初期化のため)\n // もし存在するならベルマンフォードで負の閉路を見つけ\n // そこに流せるだけ流してスタート\n // 2. グラフに負の辺が存在しない (pot_0 の計算可能性)\n // もし存在する場合は最初のみベルマンフォードを使う必要あり\n CostTp fast_mincost_flow(int s, int t, CapTp f) {\n CostTp res(0);\n fill(pot.begin(), pot.end(), CostTp(0));\n\n while(f > 0) {\n using PT = pair<CostTp, int>;\n priority_queue< PT, vector<PT>, greater<PT> > que;\n fill(dist.begin(), dist.end(), IO);\n\n dist[s] = 0;\n que.push(make_pair(0, s));\n while(!que.empty()) {\n PT cur = que.top(); que.pop();\n int v = cur.second;\n if(dist[v] < cur.first) continue;\n for(size_t i=0; i<G[v].size(); i++) {\n auto& e = G[v][i];\n if(e.cap > 0 and dist[e.to] > dist[v] + e.cost + pot[v] - pot[e.to]) {\n dist[e.to] = dist[v] + e.cost + pot[v] - pot[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(make_pair(dist[e.to], e.to));\n }\n }\n }\n if(dist[t] == IO) {\n return NIL;\n }\n for(int v=0; v<(int)G.size(); v++) pot[v] += dist[v];\n\n CapTp d = f;\n for(int v=t; v!=s; v=prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * pot[t];\n for(int v=t; v!=s; v=prevv[v]) {\n auto& e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n } \n};\n\ntemplate <typename cap_tp=int, typename cost_tp=int,\n template<typename, typename> class flow_fw=Flow>\nstruct GeneralizedMincostFlow {\nprivate:\n flow_fw<cap_tp, cost_tp> fl;\n vector<cap_tp> D;\n int N, source, sink;\n cap_tp Z_cap;\n cost_tp Z_cost, ofs, ng;\n int edge_id;\n\npublic:\n GeneralizedMincostFlow(int N_,\n cost_tp ng_=-1,\n cap_tp IA=1<<29, cost_tp IO=1<<29,\n cap_tp zero_cap=0, cost_tp zero_cost=0)\n : fl(N_+2, IA, IO, ng_), D(N_), N(N_), source(N_), sink(N_+1),\n Z_cap(zero_cap), Z_cost(zero_cost), ofs(zero_cost), ng(ng_),\n edge_id(0) {}\n\n int add_edge(int u, int v, cap_tp low, cap_tp high, cost_tp cost) {\n assert(low <= high);\n if(low < Z_cap) {\n add_edge(v, u, -low, -low, -cost);\n add_edge(u, v, 0, high - low, +cost);\n return -1; // TODO ?\n }\n int id = -1;\n \n // コストが負の場合\n if(cost < Z_cost) {\n // 流すだけ得なので high 流れたことにする\n ofs += high * cost;\n D[u] -= high; D[v] += high;\n // 目一杯流したのを high - low 分だけキャンセル可能\n if(high - low > Z_cap) {\n id = edge_id++;\n fl.add_edge(v, u, high - low, -cost);\n }\n }\n else {\n // v 側に low 流れたことにする\n ofs += low * cost;\n D[u] -= low; D[v] += low;\n // high - low 分の辺を張る\n if(high - low > Z_cap) {\n id = edge_id++;\n fl.add_edge(u, v, high - low, cost);\n }\n }\n return id;\n }\n int add_edge(int u, int v, cap_tp cap, cost_tp cost) {\n return add_edge(u, v, Z_cap, cap, cost);\n }\n void change_d(int u, cap_tp delta) {\n D[u] += delta;\n }\n \n cost_tp mincost_flow() {\n cap_tp sum_d = 0;\n for(int i=0; i<N; i++) {\n if(D[i] > 0) {\n fl.add_edge(source, i, D[i], 0);\n sum_d += D[i];\n }\n else {\n fl.add_edge(i, sink, -D[i], 0);\n }\n }\n\n cost_tp res = fl.fast_mincost_flow(source, sink, sum_d);\n if(res == fl.NIL) return ng;\n else return ofs + res;\n }\n\n cap_tp get_flowed_cap(size_t k) {\n return fl.get_flowed_cap(k);\n }\n\n cap_tp operator[](size_t k) {\n return fl.pot[k];\n }\n};\n\nint main() {\n ll N, M, X; scanf(\"%lld%lld%lld\", &N, &M, &X);\n vector<ll> a(N), b(N), p(N);\n ll ofs = 0;\n for(int i=0; i<N; i++) {\n scanf(\"%lld%lld%lld\", &a[i], &b[i], &p[i]);\n ofs += a[i] * p[i];\n }\n vector<ll> u(M), v(M), f(M);\n for(int i=0; i<M; i++) {\n scanf(\"%lld%lld%lld\", &u[i], &v[i], &f[i]);\n u[i]--; v[i]--;\n }\n\n auto s = [](int k) { return k<<1; };\n auto e = [](int k) { return k<<1|1; };\n\n auto calc = [&a, &b, &p](ll i, ll t) {\n ll res = 0;\n res += ll(1) * min(t, p[i]) * a[i];\n res += ll(1) * max(ll(0), t - p[i]) * b[i];\n return res;\n };\n \n using flow_tp = ll;\n const flow_tp INF = 1LL << 40;\n const flow_tp LONGINF = 1LL << 60;\n\n ll LIM = 2LL * (N*N*100 + X);\n flow_tp ub = LIM, lb = -1;\n while(ub - lb > 1) {\n flow_tp mid = (ub + lb) / 2;\n GeneralizedMincostFlow<flow_tp, flow_tp> fl(2*N + 1, -INF, +LONGINF, +LONGINF);\n int z = 2*N; // additional variable\n for(int i=0; i<N; i++) {\n fl.add_edge(s(i), z, 0, +INF, 0);\n fl.add_edge(e(i), s(i), 0, +INF, -1);\n fl.add_edge(z, e(i), 0, +INF, mid);\n fl.add_edge(e(i), s(i), b[i], a[i], -p[i]);\n }\n for(int i=0; i+1<N; i++) {\n fl.add_edge(s(i+1), s(i), 0, +INF, 0);\n }\n for(int i=0; i<M; i++) {\n if(f[i] == +1) {\n fl.add_edge(e(u[i]), s(v[i]), 0, +INF, -1);\n }\n if(f[i] == -1) {\n fl.add_edge(s(v[i]), e(u[i]), 0, +INF, 0);\n } \n }\n\n flow_tp result = fl.mincost_flow();\n if(result + ofs < X) lb = mid;\n else ub = mid;\n }\n\n if(ub == LIM) puts(\"-1\");\n else cout << ub << endl;\n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":3676,"score_of_the_acc":-1.0849,"final_rank":7},{"submission_id":"aoj_3171_4848740","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <string>\n#include <cmath>\n#include <bitset>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <complex>\n#include <unordered_map>\n#include <unordered_set>\n#include <random>\n#include <cassert>\n#include <fstream>\n#include <utility>\n#include <functional>\n#include <time.h>\n#include <stack>\n#include <array>\n#include <list>\n#define popcount __builtin_popcount\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\ntemplate<typename Flow, typename Cost>\nstruct MinCostFlow{\n\tstruct edge{\n\t\tint to, rev;\n\t\tint num;\n\t\tFlow flow;\n\t\tFlow cap;\n\t\tCost cost;\n\t\tedge(int to, Flow flow, Flow cap, Cost cost, int rev, int num):to(to), flow(flow), cap(cap), cost(cost), rev(rev), num(num){}\n\t};\n\tint n;\n\tvector<vector<edge>> g;\n\tvector<Flow> b;\n\tvector<Cost> h, dist;\n\tvector<int> prevv, preve;\n\tMinCostFlow(int n):n(n), b(n), g(n), h(n), dist(n), prevv(n), preve(n){}\n\tvoid add_edge(int from, int to, Flow lower, Flow upper, Cost cost, int num){\n\t\tint num1=g[to].size(), num2=g[from].size();\n\t\tif(to==from) num1++;\n\t\tg[from].push_back(edge(to, lower, upper, cost, num1, num));\n\t\tg[to].push_back(edge(from, -lower, -lower, -cost, num2, -num));\n\t\tb[from]-=lower;\n\t\tb[to]+=lower;\n\t}\n\tFlow mx;\n\tbool dual(){\n\t\tusing P=pair<Cost, int>;\n\t\tpriority_queue<P, vector<P>, greater<P>> que;\n\t\tconst Cost INF=1e18;\n\t\tfill(dist.begin(), dist.end(), INF);\n\t\tfill(prevv.begin(), prevv.end(), -1);\n\t\tfor(int x=0; x<n; x++){\n\t\t\tif(b[x]>0){\n\t\t\t\tque.push({0, x});\n\t\t\t\tdist[x]=0;\n\t\t\t}\n\t\t}\n\t\tmx=0;\n\t\tint cnt=0;\n\t\twhile(!que.empty()){\n\t\t\tauto p=que.top(); que.pop();\n\t\t\tint x=p.second;\n\t\t\tif(dist[x]<p.first) continue;\n\t\t\tmx=max(mx, dist[x]);\n\t\t\tif(b[x]<0) cnt++;\n\t\t\tfor(int i=0; i<g[x].size(); i++){\n\t\t\t\tedge e=g[x][i];\n\t\t\t\tif(e.cap-e.flow==0) continue;\n\t\t\t\tint y=e.to;\n\t\t\t\tif(dist[y]>dist[x]+e.cost+h[x]-h[y]){\n\t\t\t\t\tdist[y]=dist[x]+e.cost+h[x]-h[y];\n\t\t\t\t\tque.push({dist[y], y});\n\t\t\t\t\tprevv[y]=x;\n\t\t\t\t\tpreve[y]=i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(cnt==0) return false;\n\t\tfor(int x=0; x<n; x++){\n\t\t\th[x]+=min(dist[x], mx);\n\t\t}\n\t\treturn true;\n\t}\n\tvoid primal(){\n\t\tfor(int x=0; x<n; x++){\n\t\t\tif(!(b[x]<0)) continue;\n\t\t\tif(dist[x]>mx) continue;\n\t\t\tFlow f=-b[x];\n\t\t\tint v;\n\t\t\tfor(v=x; prevv[v]!=-1; v=prevv[v]){\n\t\t\t\tedge &e=g[prevv[v]][preve[v]];\n\t\t\t\tf=min(f, e.cap-e.flow);\n\t\t\t}\n\t\t\tf=min(f, b[v]);\n\t\t\tif(f==0) continue;\n\t\t\tfor(v=x; prevv[v]!=-1; v=prevv[v]){\n\t\t\t\tedge &e=g[prevv[v]][preve[v]];\n\t\t\t\te.flow+=f;\n\t\t\t\tg[v][e.rev].flow-=f;\n\t\t\t}\n\t\t\tb[v]-=f;\n\t\t\tb[x]+=f;\n\t\t}\n\t}\n\tbool solve(){\n\t\tfor(int x=0; x<n; x++){\n\t\t\tfor(auto &e:g[x]){\n\t\t\t\tif(e.cost<0 && e.cap-e.flow>0){\n\t\t\t\t\tb[x]-=(e.cap-e.flow);\n\t\t\t\t\tb[e.to]+=(e.cap-e.flow);\n\t\t\t\t\tg[e.to][e.rev].flow-=(e.cap-e.flow);\n\t\t\t\t\te.flow=e.cap;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile(dual()) primal();\n\t\tfor(int x=0; x<n; x++){\n\t\t\tif(b[x]!=0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\ttemplate<typename T>\n\tT calc(){\n\t\tT ans=0;\n\t\tfor(int x=0; x<n; x++){\n\t\t\tfor(auto e:g[x]){\n\t\t\t\tans+=T(e.flow)*T(e.cost);\n\t\t\t}\n\t\t}\n\t\tans/=2;\n\t\treturn ans;\n\t}\n};\nint main()\n{\n\tint n, m; ll x;\n cin>>n>>m>>x;\n int a[101], b[101];\n ll p[101];\n for(int i=0; i<n; i++){\n cin>>a[i]>>b[i]>>p[i];\n }\n int u[202], v[202], f[202];\n for(int i=0; i<m; i++){\n cin>>u[i]>>v[i]>>f[i];\n u[i]--; v[i]--;\n }\n const ll mx=1e9;\n ll tl=0, tr=mx;\n while(tr-tl>1){\n ll t=(tl+tr)/2;\n MinCostFlow<ll, ll> mcf(2*n);\n const ll INF=1e12;\n for(int i=0; i<n; i++){\n mcf.b[i]+=a[i];\n mcf.b[i+n]-=a[i];\n }\n for(int i=0; i<n; i++){\n mcf.add_edge(i, i+n, 0, a[i]-b[i], p[i], 0);\n mcf.add_edge(0, i+n, 0, INF, t, 0);\n mcf.add_edge(i+n, i, 0, INF, -1, 0);\n }\n for(int i=0; i<n; i++){\n for(int j=i+1; j<n; j++){\n mcf.add_edge(j, i, 0, INF, 0, 0);\n }\n }\n for(int i=0; i<m; i++){\n if(f[i]==1){\n mcf.add_edge(u[i]+n, v[i], 0, INF, -1, 0);\n }else{\n mcf.add_edge(v[i], u[i]+n, 0, INF, 0, 0);\n }\n }\n mcf.solve();\n ll res=mcf.calc<ll>();\n if(res>=x) tr=t;\n else tl=t;\n }\n if(tr==mx) cout<<-1<<endl;\n else cout<<tr<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":230,"memory_kb":3860,"score_of_the_acc":-1.44,"final_rank":10},{"submission_id":"aoj_3171_4839509","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int mod = 1e9 + 7;\n// const int mod = 998244353;\n\nconst int64 infll = (1LL << 62) - 1;\n//const int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\n\ntemplate< typename flow_t, typename cost_t >\nstruct edge {\n int src, to;\n flow_t low, high;\n cost_t cost;\n\n edge() = default;\n\n edge(int src, int to, flow_t high, cost_t cost) : src(src), to(to), low(0), high(high), cost(cost) {}\n\n edge(int src, int to, flow_t low, flow_t high, cost_t cost) : src(src), to(to), low(low), high(high), cost(cost) {}\n};\n\n\ntemplate< typename flow_t, typename cost_t, template< typename, typename > class MF >\ncost_t normalized_min_cost_flow(vector< flow_t > D, const vector< edge< flow_t, cost_t > > &E, cost_t NG = -1) {\n const int N = (int) D.size(), M = (int) E.size();\n MF< flow_t, cost_t > flow(N + 2);\n const int S = N, T = N + 1;\n\n cost_t sum = 0;\n for(auto &e : E) {\n if(e.cost < 0) {\n sum += e.cost * e.high;\n D[e.src] -= e.high;\n D[e.to] += e.high;\n flow.add_edge(e.to, e.src, e.high - e.low, -e.cost);\n } else {\n sum += e.cost * e.low;\n D[e.src] -= e.low;\n D[e.to] += e.low;\n flow.add_edge(e.src, e.to, e.high - e.low, e.cost);\n }\n }\n\n flow_t in = 0;\n for(int i = 0; i < N; i++) {\n if(D[i] > 0) {\n flow.add_edge(S, i, D[i], flow_t(0));\n in += D[i];\n } else if(D[i] < 0) {\n flow.add_edge(i, T, -D[i], flow_t(0));\n }\n }\n\n auto ret = flow.min_cost_flow(S, T, in);\n if(ret == -1) return NG;\n return ret + sum;\n}\n\ntemplate< typename flow_t, typename cost_t >\nstruct PrimalDual {\n const cost_t INF;\n\n struct edge {\n int to;\n flow_t cap;\n cost_t cost;\n int rev;\n bool isrev;\n };\n vector< vector< edge > > graph;\n vector< cost_t > potential, min_cost;\n vector< int > prevv, preve;\n\n PrimalDual(int V) : graph(V), INF(numeric_limits< cost_t >::max()) {}\n\n void add_edge(int from, int to, flow_t cap, cost_t cost) {\n graph[from].emplace_back((edge) {to, cap, cost, (int) graph[to].size(), false});\n graph[to].emplace_back((edge) {from, 0, -cost, (int) graph[from].size() - 1, true});\n }\n\n cost_t min_cost_flow(int s, int t, flow_t f) {\n int V = (int) graph.size();\n cost_t ret = 0;\n using Pi = pair< cost_t, int >;\n priority_queue< Pi, vector< Pi >, greater< Pi > > que;\n potential.assign(V, 0);\n preve.assign(V, -1);\n prevv.assign(V, -1);\n\n while(f > 0) {\n min_cost.assign(V, INF);\n que.emplace(0, s);\n min_cost[s] = 0;\n while(!que.empty()) {\n Pi p = que.top();\n que.pop();\n if(min_cost[p.second] < p.first) continue;\n for(int i = 0; i < graph[p.second].size(); i++) {\n edge &e = graph[p.second][i];\n cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];\n if(e.cap > 0 && min_cost[e.to] > nextCost) {\n min_cost[e.to] = nextCost;\n prevv[e.to] = p.second, preve[e.to] = i;\n que.emplace(min_cost[e.to], e.to);\n }\n }\n }\n if(min_cost[t] == INF) return -1;\n for(int v = 0; v < V; v++) potential[v] += min_cost[v];\n flow_t addflow = f;\n for(int v = t; v != s; v = prevv[v]) {\n addflow = min(addflow, graph[prevv[v]][preve[v]].cap);\n }\n f -= addflow;\n ret += addflow * potential[t];\n for(int v = t; v != s; v = prevv[v]) {\n edge &e = graph[prevv[v]][preve[v]];\n e.cap -= addflow;\n graph[v][e.rev].cap += addflow;\n }\n }\n return ret;\n }\n\n void output() {\n for(int i = 0; i < graph.size(); i++) {\n for(auto &e : graph[i]) {\n if(e.isrev) continue;\n auto &rev_e = graph[e.to][e.rev];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << rev_e.cap + e.cap << \")\" << endl;\n }\n }\n }\n};\n\nint main() {\n int N, M, X;\n cin >> N >> M >> X;\n vector< int > A(N), B(N), P(N);\n for(int i = 0; i < N; i++) {\n cin >> A[i] >> B[i] >> P[i];\n }\n vector< int > U(M), V(M), F(M);\n for(int i = 0; i < M; i++) {\n cin >> U[i] >> V[i] >> F[i];\n --U[i], --V[i];\n }\n\n using flow_t = int64;\n using cost_t = int64;\n cost_t inf = 1e15;\n\n auto check = [&](int Y) {\n vector< flow_t > D(N + N + 1);\n int Z = N + N;\n vector< edge< flow_t, cost_t > > E;\n for(int i = 0; i < N; i++) {\n E.emplace_back(i, Z, 0, inf, 0);\n E.emplace_back(i + N, i, inf, -1);\n E.emplace_back(Z, i + N, inf, Y);\n if(i + 1 < N) E.emplace_back(i + 1, i, inf, 0);\n }\n for(int i = 0; i < M; i++) {\n if(F[i] == 1) E.emplace_back(U[i] + N, V[i], inf, -1);\n else E.emplace_back(V[i], U[i] + N, inf, 0);\n }\n for(int i = 0; i < N; i++) {\n E.emplace_back(i, i + N, A[i] - B[i], P[i]);\n if(A[i] >= 0) {\n D[i + N] -= A[i];\n D[i] += A[i];\n E.emplace_back(i + N, i, inf, 0);\n } else {\n E.emplace_back(i, i + N, -A[i], 0);\n }\n }\n return normalized_min_cost_flow< flow_t, cost_t, PrimalDual >(D, E);\n };\n int ok = 1e9, ng = -1;\n if(check(ok) < X) {\n cout << -1 << \"\\n\";\n exit(0);\n }\n while(ok - ng > 1) {\n int mid = (ok + ng) / 2;\n if(check(mid) >= X) ok = mid;\n else ng = mid;\n }\n cout << ok << \"\\n\";\n}","accuracy":1,"time_ms":360,"memory_kb":3368,"score_of_the_acc":-0.8575,"final_rank":6},{"submission_id":"aoj_3171_4838894","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<functional>\n#include<assert.h>\n#include<numeric>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\nusing ll = long long;\nconstexpr ll mod=2e8+7 ;\n\nstruct PrimalDual{\n struct edge{\n int to;ll cap, cost;int rev;\n };\n int n;\n const ll INF = numeric_limits<ll>::max();\n vector<vector<edge>> v;\n vector<ll> pot, dist;\n vector<pair<int,int>> par;\n \n PrimalDual(int n):n(n),v(n),pot(n){}\n \n void add_edge(int from, int to, ll cap, ll cost) {\n v[from].emplace_back((edge) {to, cap, cost, (int) v[to].size()});\n v[to].emplace_back((edge) {from, 0, -cost, (int) v[from].size() - 1});\n }\n \n pair<ll,ll> minimum_road(int s,int t){\n par.assign(n,{-1,-1});\n dist.assign(n,INF);\n dist[s] = 0;\n using P = pair<ll,ll>;\n priority_queue<P,vector<P>,greater<P>> pq;\n pq.emplace(0,s);\n while(!pq.empty()){\n P p = pq.top();pq.pop();\n if(dist[p.second]<p.first)continue;\n rep(i,v[p.second].size()){\n edge& e = v[p.second][i];\n ll nd = dist[p.second]+e.cost+pot[p.second]-pot[e.to];\n if(e.cap>0 && dist[e.to]>nd){\n dist[e.to] = nd;\n par[e.to] = {p.second, i};\n pq.emplace(dist[e.to],e.to);\n }\n }\n }\n if(dist[t]==INF)return {-1,-1};\n rep(i,n)pot[i] += dist[i];\n ll f = INF;\n int cur = t;\n while(cur != s){\n int p = par[cur].first, j = par[cur].second;\n f = min(f, v[p][j].cap);\n cur = p;\n }\n cur = t;\n while(cur != s){\n int p = par[cur].first, j = par[cur].second;\n v[p][j].cap -= f;\n v[cur][v[p][j].rev].cap += f;\n cur = p;\n }\n return {pot[t],f};\n }\n \n ll minimum_cost_flow(int s, int t, ll k){\n ll ret = 0;\n while(k){\n pair<ll,ll> z = minimum_road(s, t);\n if (z.first < 0)return -1;\n if (k<=z.second){\n ret+=z.first*k;\n break;\n }\n k -= z.second;\n ret += z.first*z.second;\n }\n return ret;\n }\n};\n\nint main(){\n int n,m,x;\n cin>>n>>m>>x;\n vector<int> a(n),b(n),p(n);\n rep(i,n)cin>>a[i]>>b[i]>>p[i];\n vector<int> f(m),u(m),v(m);\n rep(i,m){\n cin>>u[i]>>v[i]>>f[i];\n --u[i];--v[i];\n if(u[i]<v[i])swap(u[i],v[i]);\n }\n ll ng = -1, ok = 2e8;\n while(ok-ng>1){\n int mid = (ok+ng)/2;\n PrimalDual pd(3*n+3);\n int s0=3*n, S = 3*n+1, T = 3*n+2;\n vector<ll> cost(3*n+3);\n rep(i,n){\n cost[3*i+0]+=a[i];\n cost[3*i+1]+=b[i]-a[i];\n cost[3*i+2]+=-b[i];\n }\n ll ret = 0;\n rep(i,n){\n pd.add_edge(3*i+2, 3*i+1, 2e8, 0);\n cost[3*i+0]+=2e8;\n cost[3*i+1]-=2e8;\n ret-=2e8;\n pd.add_edge(3*i+0, 3*i+1, 2e8, 1);\n pd.add_edge(3*i+0, 3*i+1, 2e8, p[i]);\n pd.add_edge(s0, 3*i+2, 2e8, mid);\n }\n rep(i,n-1){\n pd.add_edge(3*i+3, 3*i+0, 2e8, 0);\n }\n pd.add_edge(0, s0, 2e8, 0);\n rep(i,m){\n if(f[i]==1){\n ret += -2e8;\n cost[3*v[i]+2]-=2e8;\n cost[3*u[i]+0]+=2e8;\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 2e8, 1);\n } else {\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 2e8, 0);\n }\n }\n ll sum = 0;\n rep(i,3*n+1){\n if(cost[i]>0){\n pd.add_edge(S, i, cost[i], 0);\n sum += cost[i];\n } else {\n pd.add_edge(i, T, -cost[i], 0);\n }\n }\n ll ans = pd.minimum_cost_flow(S, T, sum)+ret;\n if(ans>=x)ok=mid;\n else ng = mid;\n }\n if(ok >= x + 1000000){\n cout<<-1<<endl;\n } else {\n cout << ok << endl;\n }\n\n \n return 0;\n}","accuracy":1,"time_ms":510,"memory_kb":3524,"score_of_the_acc":-1.4247,"final_rank":9},{"submission_id":"aoj_3171_4838886","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<functional>\n#include<assert.h>\n#include<numeric>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\nusing ll = long long;\nconstexpr ll mod=1e8+7 ;\n\nstruct PrimalDual{\n struct edge{\n int to;ll cap, cost;int rev;\n };\n int n;\n const ll INF = numeric_limits<ll>::max();\n vector<vector<edge>> v;\n vector<ll> pot, dist;\n vector<pair<int,int>> par;\n \n PrimalDual(int n):n(n),v(n),pot(n){}\n \n void add_edge(int from, int to, ll cap, ll cost) {\n v[from].emplace_back((edge) {to, cap, cost, (int) v[to].size()});\n v[to].emplace_back((edge) {from, 0, -cost, (int) v[from].size() - 1});\n }\n \n pair<ll,ll> minimum_road(int s,int t){\n par.assign(n,{-1,-1});\n dist.assign(n,INF);\n dist[s] = 0;\n using P = pair<ll,ll>;\n priority_queue<P,vector<P>,greater<P>> pq;\n pq.emplace(0,s);\n while(!pq.empty()){\n P p = pq.top();pq.pop();\n if(dist[p.second]<p.first)continue;\n rep(i,v[p.second].size()){\n edge& e = v[p.second][i];\n ll nd = dist[p.second]+e.cost+pot[p.second]-pot[e.to];\n if(e.cap>0 && dist[e.to]>nd){\n dist[e.to] = nd;\n par[e.to] = {p.second, i};\n pq.emplace(dist[e.to],e.to);\n }\n }\n }\n if(dist[t]==INF)return {-1,-1};\n rep(i,n)pot[i] += dist[i];\n ll f = INF;\n int cur = t;\n while(cur != s){\n int p = par[cur].first, j = par[cur].second;\n f = min(f, v[p][j].cap);\n cur = p;\n }\n cur = t;\n while(cur != s){\n int p = par[cur].first, j = par[cur].second;\n v[p][j].cap -= f;\n v[cur][v[p][j].rev].cap += f;\n cur = p;\n }\n return {pot[t],f};\n }\n \n ll minimum_cost_flow(int s, int t, ll k){\n ll ret = 0;\n while(k){\n pair<ll,ll> z = minimum_road(s, t);\n if (z.first < 0)return -1;\n if (k<=z.second){\n ret+=z.first*k;\n break;\n }\n k -= z.second;\n ret += z.first*z.second;\n }\n return ret;\n }\n};\n\nint main(){\n int n,m,x;\n cin>>n>>m>>x;\n vector<int> a(n),b(n),p(n);\n rep(i,n)cin>>a[i]>>b[i]>>p[i];\n vector<int> f(m),u(m),v(m);\n rep(i,m){\n cin>>u[i]>>v[i]>>f[i];\n --u[i];--v[i];\n if(u[i]<v[i])swap(u[i],v[i]);\n }\n ll ng = -1, ok = 1e8;\n while(ok-ng>1){\n int mid = (ok+ng)/2;\n PrimalDual pd(3*n+3);\n int s0=3*n, S = 3*n+1, T = 3*n+2;\n vector<ll> cost(3*n+3);\n rep(i,n){\n cost[3*i+0]+=a[i];\n cost[3*i+1]+=b[i]-a[i];\n cost[3*i+2]+=-b[i];\n }\n ll ret = 0;\n rep(i,n){\n pd.add_edge(3*i+2, 3*i+1, 1e8, 0);\n cost[3*i+0]+=1e8;\n cost[3*i+1]-=1e8;\n ret-=1e8;\n pd.add_edge(3*i+0, 3*i+1, 1e8, 1);\n pd.add_edge(3*i+0, 3*i+1, 1e8, p[i]);\n pd.add_edge(s0, 3*i+2, 1e8, mid);\n }\n rep(i,n-1){\n pd.add_edge(3*i+3, 3*i+0, 1e8, 0);\n }\n pd.add_edge(0, s0, 1e8, 0);\n rep(i,m){\n if(f[i]==1){\n ret += -1e8;\n cost[3*v[i]+2]-=1e8;\n cost[3*u[i]+0]+=1e8;\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 1e8, 1);\n } else {\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 1e8, 0);\n }\n }\n ll sum = 0;\n rep(i,3*n+1){\n if(cost[i]>0){\n pd.add_edge(S, i, cost[i], 0);\n sum += cost[i];\n } else {\n pd.add_edge(i, T, -cost[i], 0);\n }\n }\n ll ans = pd.minimum_cost_flow(S, T, sum)+ret;\n if(ans>=x)ok=mid;\n else ng = mid;\n }\n if(ok >= x + 100000){\n cout<<-1<<endl;\n } else {\n cout << ok << endl;\n }\n return 0;\n}","accuracy":0.6888888888888889,"time_ms":470,"memory_kb":3568,"score_of_the_acc":-1.42,"final_rank":11},{"submission_id":"aoj_3171_4838812","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<functional>\n#include<assert.h>\n#include<numeric>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\nusing ll = long long;\nconstexpr ll mod=1e7+7 ;\n\nstruct PrimalDual{\n struct edge{\n int to;ll cap, cost;int rev;\n };\n int n;\n const ll INF = numeric_limits<ll>::max();\n vector<vector<edge>> v;\n vector<ll> pot, dist;\n vector<pair<int,int>> par;\n \n PrimalDual(int n):n(n),v(n),pot(n){}\n \n void add_edge(int from, int to, ll cap, ll cost) {\n v[from].emplace_back((edge) {to, cap, cost, (int) v[to].size()});\n v[to].emplace_back((edge) {from, 0, -cost, (int) v[from].size() - 1});\n }\n \n pair<ll,ll> minimum_road(int s,int t){\n par.assign(n,{-1,-1});\n dist.assign(n,INF);\n dist[s] = 0;\n using P = pair<ll,ll>;\n priority_queue<P,vector<P>,greater<P>> pq;\n pq.emplace(0,s);\n while(!pq.empty()){\n P p = pq.top();pq.pop();\n if(dist[p.second]<p.first)continue;\n rep(i,v[p.second].size()){\n edge& e = v[p.second][i];\n ll nd = dist[p.second]+e.cost+pot[p.second]-pot[e.to];\n if(e.cap>0 && dist[e.to]>nd){\n dist[e.to] = nd;\n par[e.to] = {p.second, i};\n pq.emplace(dist[e.to],e.to);\n }\n }\n }\n if(dist[t]==INF)return {-1,-1};\n rep(i,n)pot[i] += dist[i];\n ll f = INF;\n int cur = t;\n while(cur != s){\n int p = par[cur].first, j = par[cur].second;\n f = min(f, v[p][j].cap);\n cur = p;\n }\n cur = t;\n while(cur != s){\n int p = par[cur].first, j = par[cur].second;\n v[p][j].cap -= f;\n v[cur][v[p][j].rev].cap += f;\n cur = p;\n }\n return {pot[t],f};\n }\n \n ll minimum_cost_flow(int s, int t, ll k){\n ll ret = 0;\n while(k){\n pair<ll,ll> z = minimum_road(s, t);\n if (z.first < 0)return -1;\n if (k<=z.second){\n ret+=z.first*k;\n break;\n }\n k -= z.second;\n ret += z.first*z.second;\n }\n return ret;\n }\n};\n\nint main(){\n int n,m,x;\n cin>>n>>m>>x;\n vector<int> a(n),b(n),p(n);\n rep(i,n)cin>>a[i]>>b[i]>>p[i];\n vector<int> f(m),u(m),v(m);\n rep(i,m){\n cin>>u[i]>>v[i]>>f[i];\n --u[i];--v[i];\n if(u[i]<v[i])swap(u[i],v[i]);\n }\n ll ng = -1, ok = 1e7;\n while(ok-ng>1){\n int mid = (ok+ng)/2;\n PrimalDual pd(3*n+3);\n int s0=3*n, S = 3*n+1, T = 3*n+2;\n vector<ll> cost(3*n+3);\n rep(i,n){\n cost[3*i+0]+=a[i];\n cost[3*i+1]+=b[i]-a[i];\n cost[3*i+2]+=-b[i];\n }\n ll ret = 0;\n rep(i,n){\n pd.add_edge(3*i+2, 3*i+1, 1e7, 0);\n cost[3*i+0]+=1e7;\n cost[3*i+1]-=1e7;\n ret-=1e7;\n pd.add_edge(3*i+0, 3*i+1, 1e7, 1);\n pd.add_edge(3*i+0, 3*i+1, 1e7, p[i]);\n pd.add_edge(s0, 3*i+2, 1e7, mid);\n }\n rep(i,n-1){\n pd.add_edge(3*i+3, 3*i+0, 1e7, 0);\n }\n pd.add_edge(0, s0, 1e7, 0);\n rep(i,m){\n if(f[i]==1){\n ret += -1e7;\n cost[3*v[i]+2]-=1e7;\n cost[3*u[i]+0]+=1e7;\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 1e7, 1);\n } else {\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 1e7, 0);\n }\n }\n ll sum = 0;\n rep(i,3*n+1){\n if(cost[i]>0){\n pd.add_edge(S, i, cost[i], 0);\n sum += cost[i];\n } else {\n pd.add_edge(i, T, -cost[i], 0);\n }\n }\n ll ans = pd.minimum_cost_flow(S, T, sum)+ret;\n if(ans>=x)ok=mid;\n else ng = mid;\n }\n if(ok >= x + 100000){\n cout<<-1<<endl;\n } else {\n cout << ok << endl;\n }\n\n \n return 0;\n}","accuracy":0.13333333333333333,"time_ms":10,"memory_kb":3364,"score_of_the_acc":-0.1507,"final_rank":19},{"submission_id":"aoj_3171_4838785","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=Int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\n\ntemplate<typename TF,typename TC>\nstruct PrimalDual{\n struct edge{\n Int to;\n TF cap;\n TC cost;\n Int rev;\n edge(){}\n edge(Int to,TF cap,TC cost,Int rev):\n to(to),cap(cap),cost(cost),rev(rev){}\n };\n\n static const TC INF;\n vector<vector<edge>> G;\n vector<TC> h,dist;\n vector<Int> prevv,preve;\n\n PrimalDual(){}\n PrimalDual(Int n):G(n),h(n),dist(n),prevv(n),preve(n){}\n\n void add_edge(Int u,Int v,TF cap,TC cost){\n G[u].emplace_back(v,cap,cost,G[v].size());\n G[v].emplace_back(u,0,-cost,G[u].size()-1);\n }\n\n void dijkstra(Int s){\n struct P{\n TC first;\n Int second;\n P(TC first,Int second):first(first),second(second){}\n bool operator<(const P&a) const{return a.first<first;}\n };\n priority_queue<P> que;\n fill(dist.begin(),dist.end(),INF);\n\n dist[s]=0;\n que.emplace(dist[s],s);\n while(!que.empty()){\n P p=que.top();que.pop();\n Int v=p.second;\n if(dist[v]<p.first) continue;\n for(Int i=0;i<(Int)G[v].size();i++){\n edge &e=G[v][i];\n if(e.cap==0) continue;\n if(dist[v]+e.cost+h[v]-h[e.to]<dist[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v;\n preve[e.to]=i;\n que.emplace(dist[e.to],e.to);\n }\n }\n }\n }\n\n TC flow(Int s,Int t,TF f,Int &ok){\n TC res=0;\n fill(h.begin(),h.end(),0);\n while(f>0){\n dijkstra(s);\n if(dist[t]==INF){\n ok=0;\n return res;\n }\n\n for(Int v=0;v<(Int)h.size();v++)\n if(dist[v]<INF) h[v]=h[v]+dist[v];\n\n TF d=f;\n for(Int v=t;v!=s;v=prevv[v])\n d=min(d,G[prevv[v]][preve[v]].cap);\n\n f-=d;\n res=res+h[t]*d;\n for(Int v=t;v!=s;v=prevv[v]){\n edge &e=G[prevv[v]][preve[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n }\n ok=1;\n return res;\n }\n};\ntemplate<typename TF, typename TC>\nconst TC PrimalDual<TF, TC>::INF = numeric_limits<TC>::max()/2;\n\n\ntemplate<typename TF,typename TC>\nstruct NegativeEdge{\n PrimalDual<TF, TC> G;\n vector<TF> fs;\n TC sum;\n Int S,T;\n NegativeEdge(){}\n NegativeEdge(Int n):G(n+2),fs(n+2,0),sum(0),S(n),T(n+1){}\n\n void use_edge(Int u,Int v,TF cap,TC cost){\n fs[u]-=cap;\n fs[v]+=cap;\n sum=sum+cost*cap;\n }\n\n void add_edge(Int u,Int v,TF cap,TC cost){\n if(cost<TC(0)){\n use_edge(u,v,cap,cost);\n swap(u,v);\n cost=-cost;\n }\n G.add_edge(u,v,cap,cost);\n }\n\n TC flow(Int &ok){\n TF f=0;\n for(Int i=0;i<S;i++){\n if(fs[i]>0){\n f+=fs[i];\n G.add_edge(S,i,+fs[i],TC(0));\n }\n if(fs[i]<0){\n G.add_edge(i,T,-fs[i],TC(0));\n }\n }\n return sum+G.flow(S,T,f,ok);\n }\n\n TC flow(Int ts,Int tt,TF tf,Int &ok){\n fs[ts]+=tf;\n fs[tt]-=tf;\n return flow(ok);\n }\n};\n\n\ntemplate<typename TV, const Int N> void read_tuple_impl(TV&) {}\ntemplate<typename TV, const Int N, typename Head, typename... Tail>\nvoid read_tuple_impl(TV& ts) {\n get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));\n read_tuple_impl<TV, N+1, Tail...>(ts);\n}\ntemplate<typename... Ts> decltype(auto) read_tuple(size_t n) {\n tuple<vector<Ts>...> ts;\n for(size_t i=0;i<n;i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);\n return ts;\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n Int n,m,need;\n cin>>n>>m>>need;\n auto [xs,ys,qs]=read_tuple<Int, Int, Int>(n);\n auto [us,vs,fs]=read_tuple<Int, Int, Int>(m);\n\n for(Int i=0;i<m;i++) us[i]--,vs[i]--;\n\n const Int INF = 1e15;\n auto st=[&](Int i){return 0+i;};\n auto en=[&](Int i){return n+i;};\n Int Z=n+n;\n auto check=[&](Int T)->Int{\n NegativeEdge<Int, Int> G(n+n+1);\n for(Int i=0;i<n;i++){\n G.add_edge(st(i),Z,INF,0);\n G.add_edge(en(i),st(i),INF,-1);\n G.add_edge(Z,en(i),INF,T);\n }\n for(Int i=0;i<m;i++){\n if(fs[i]==+1)\n G.add_edge(en(us[i]),st(vs[i]),INF,-1);\n if(fs[i]==-1)\n G.add_edge(st(vs[i]),en(us[i]),INF,0);\n }\n for(Int i=0;i+1<n;i++)\n G.add_edge(st(i+1),st(i),INF,0);\n\n for(Int i=0;i<n;i++){\n G.add_edge(st(i),en(i),xs[i]-ys[i],qs[i]);\n if(xs[i]>=0){\n G.use_edge(en(i),st(i),xs[i],0);\n G.add_edge(en(i),st(i),INF,0);\n }else{\n G.add_edge(st(i),en(i),abs(xs[i]),0);\n }\n }\n Int ok;\n Int res=G.flow(ok);\n if(!ok) return -1;\n return res;\n };\n\n Int L=0,R=1e9;\n // check(L) < need\n // check(R) >= need\n if(check(R)<need) drop(-1);\n while(L+1<R){\n Int M=(L+R)>>1;\n if(check(M)>=need) R=M;\n else L=M;\n }\n // cout<<need<<endl;\n // cout<<check(L)<<endl;\n // cout<<check(R)<<endl;\n cout<<R<<newl;\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":3640,"score_of_the_acc":-1.1033,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_3171_6169756\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T> using PQ = priority_queue<T>;\\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \\ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\\\" \\\"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(const T &v,ll n,string sv=\\\" \\\"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop_front();}cout<<endl;}\\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\\\"[\\\"<<z.first<<\\\"]=\\\"<<z.second<<\\\",\\\";cout<<endl;}\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\\n auto tmp = v;\\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\\n}\\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\\n rearrange(ord, head);\\n rearrange(ord, tail...);\\n}\\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\\n return ord;\\n}\\ntemplate<typename T> vector<int> descend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\\n return ord;\\n}\\nll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}\\nll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}\\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\\nll modulo(ll n,ll d){return (n%d+d)%d;};\\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\nint popcount(ll x){return __builtin_popcountll(x);};\\nint poplow(ll x){return __builtin_ctzll(x);};\\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\\nll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}\\nll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}\\nll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}\\ntemplate< typename T = int >\\nstruct edge {\\n int to;\\n T cost;\\n int id;\\n edge():id(-1){};\\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\\n operator int() const { return to; }\\n};\\n\\ntemplate<typename T>\\nusing Graph = vector<vector<edge<T>>>;\\ntemplate<typename T>\\nGraph<T>revgraph(const Graph<T> &g){\\n Graph<T>ret(g.size());\\n for(int i=0;i<g.size();i++){\\n for(auto e:g[i]){\\n int to = e.to;\\n e.to = i;\\n ret[to].push_back(e);\\n }\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\\n Graph<T> ret(n);\\n for(int es = 0; es < m; es++){\\n int u,v;\\n T w=1;\\n cin>>u>>v;u-=indexed,v-=indexed;\\n if(weighted)cin>>w;\\n ret[u].emplace_back(v,w,es);\\n if(!directed)ret[v].emplace_back(u,w,es);\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\\n Graph<T>ret(n);\\n for(int i=1;i<n;i++){\\n int p;cin>>p;\\n p-=indexed;\\n ret[p].emplace_back(i);\\n if(!directed)ret[i].emplace_back(p);\\n }\\n return ret;\\n}\\n//https://github.com/beet-aizu/library/blob/master/bflow/capacityscaling.cpp\\n\\n// O(m^2 \\\\log m \\\\log U)\\n// U: maximum capacity\\nenum Objective{\\n MINIMIZE = +1,\\n MAXIMIZE = -1,\\n};\\ntemplate<typename Flow, typename Cost,\\n Objective objective = Objective::MINIMIZE>\\nstruct MinCostFlow{\\n template<typename T> inline void chmin(T &x,T y){x=min(x,y);}\\n\\n struct Edge{\\n int src,dst;\\n Flow flow,cap;\\n Cost cost;\\n int rev;\\n Edge(int src,int dst,Flow cap,Cost cost,int rev):\\n src(src),dst(dst),flow(0),cap(cap),cost(cost),rev(rev){}\\n Flow residual_cap()const{return cap-flow;}\\n };\\n\\n struct EdgePtr{\\n int v,e;\\n EdgePtr(int v,int e):v(v),e(e){}\\n };\\n\\n int n;\\n vector<vector<Edge>> G;\\n vector<Flow> b;\\n vector<Cost> p;\\n\\n MinCostFlow(int n):n(n),G(n),b(n,0){}\\n\\n EdgePtr add_edge(int src,int dst,Flow lower,Flow upper,Cost cost){\\n int e=G[src].size();\\n int r=(src==dst?e+1:G[dst].size());\\n assert(lower<=upper);\\n G[src].emplace_back(src,dst,+upper,+cost*objective,r);\\n G[dst].emplace_back(dst,src,-lower,-cost*objective,e);\\n return EdgePtr(src,e);\\n }\\n\\n const Edge &get_edge(EdgePtr ep)const{return G[ep.v][ep.e];}\\n\\n void push(Edge &e,Flow amount){\\n e.flow+=amount;\\n G[e.dst][e.rev].flow-=amount;\\n }\\n\\n void add_supply(int v,Flow amount){b[v]+=amount;}\\n void add_demand(int v,Flow amount){b[v]-=amount;}\\n\\n Cost residual_cost(const Edge &e){\\n return e.cost+p[e.src]-p[e.dst];\\n }\\n\\n vector<int> excess_vs,deficit_vs;\\n void saturate_negative(const Flow delta){\\n for(auto &es:G){\\n for(auto &e:es){\\n Flow cap=e.residual_cap();\\n cap-=cap%delta;\\n if(cap<0 or residual_cost(e)<0){\\n push(e,cap);\\n b[e.src]-=cap;\\n b[e.dst]+=cap;\\n }\\n }\\n }\\n\\n excess_vs.clear();\\n deficit_vs.clear();\\n for(int v=0;v<n;v++){\\n if(b[v]>0) excess_vs.emplace_back(v);\\n if(b[v]<0) deficit_vs.emplace_back(v);\\n }\\n }\\n\\n const Cost unreachable = std::numeric_limits<Cost>::max();\\n Cost farthest;\\n vector<Cost> dist;\\n vector<Edge*> parent;\\n\\n struct P{\\n Cost first;\\n int second;\\n P(Cost first,int second):first(first),second(second){}\\n bool operator<(const P o)const{return first>o.first;}\\n };\\n\\n priority_queue<P> pq;\\n\\n template<typename Predicate>\\n void eliminate(vector<int> &vs,Predicate predicate){\\n vs.erase(remove_if(begin(vs),end(vs),predicate),end(vs));\\n }\\n\\n bool dual(const Flow delta){\\n eliminate(excess_vs, [&](int v){return b[v]<+delta;});\\n eliminate(deficit_vs,[&](int v){return b[v]>-delta;});\\n\\n dist.assign(n,unreachable);\\n for(int v:excess_vs) pq.emplace(dist[v]=0,v);\\n\\n parent.assign(n,nullptr);\\n auto emplace=[&](Edge& e){\\n if(e.residual_cap()<delta) return;\\n Cost nxt=dist[e.src]+residual_cost(e);\\n if(nxt>=dist[e.dst]) return;\\n pq.emplace(dist[e.dst]=nxt,e.dst);\\n parent[e.dst]=&e;\\n };\\n\\n farthest=0;\\n int deficit_count=0;\\n while(!pq.empty()){\\n Cost d=pq.top().first;\\n int v=pq.top().second;\\n pq.pop();\\n if(dist[v]<d) continue;\\n farthest=d;\\n\\n if(b[v]<=-delta) deficit_count++;\\n if(deficit_count>=(int)deficit_vs.size()) break;\\n\\n for(auto &e:G[v]) emplace(e);\\n }\\n pq=decltype(pq)();\\n\\n for(int v=0;v<n;v++)\\n p[v]+=min(dist[v],farthest);\\n\\n return deficit_count>0;\\n }\\n\\n void primal(const Flow delta){\\n for(int t:deficit_vs){\\n if(dist[t]>farthest) continue;\\n Flow f=-b[t];\\n int v;\\n for(v=t;parent[v];v=parent[v]->src)\\n chmin(f,parent[v]->residual_cap());\\n chmin(f,b[v]);\\n\\n f-=f%delta;\\n if(f<=0) continue;\\n\\n for(v=t;parent[v];){\\n auto &e=*parent[v];\\n push(e,f);\\n int u=parent[v]->src;\\n if(e.residual_cap()<=0) parent[v]=nullptr;\\n v=u;\\n }\\n b[t]+=f;\\n b[v]-=f;\\n }\\n }\\n\\n template<Flow SCALING_FACTOR=2>\\n bool build(){\\n p.resize(n);\\n Flow max_flow=1;\\n for(auto t:b) max_flow=max({max_flow,t,-t});\\n for(auto &es:G)\\n for(auto &e:es)\\n max_flow=max({max_flow,e.residual_cap(),-e.residual_cap()});\\n\\n Flow delta=1;\\n while(delta<max_flow) delta*=SCALING_FACTOR;\\n for(;delta;delta/=SCALING_FACTOR){\\n saturate_negative(delta);\\n while(dual(delta)) primal(delta);\\n }\\n\\n return excess_vs.empty() and deficit_vs.empty();\\n }\\n\\n template<typename T=Cost>\\n T get_cost(){\\n T res=0;\\n for(auto &es:G)\\n for(auto &e:es)\\n res+=T(e.flow)*T(e.cost)/T(objective);\\n return res/T(2);\\n }\\n template<typename T=Cost> T get_gain(){return get_cost();}\\n\\n vector<Cost> get_potential(){\\n fill(p.begin(),p.end(),0);\\n for(int i=0;i<n;i++)\\n for(auto &es:G)\\n for(auto &e:es)\\n if(e.residual_cap()>0)\\n chmin(p[e.dst],p[e.src]+e.cost);\\n return p;\\n }\\n};\\n\\ntemplate<typename Flow, typename Cost>\\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n\\tll n,m,x;cin>>n>>m>>x;\\n\\tvector<ll>a(n),b(n),p(n);\\n\\trep(i,0,n){\\n\\t\\tcin>>a[i]>>b[i]>>p[i];\\n\\t}\\n\\tvector<ll>u(m),v(m),f(m);\\n\\trep(i,0,m)cin>>u[i]>>v[i]>>f[i],u[i]--,v[i]--;\\n\\tll inf=1e15;\\n\\tll tinf=1e7;\\n\\tll ok=tinf,ng=0;\\n\\twhile(ok-ng>=2){\\n\\t\\tll mid=(ok+ng)/2;\\n\\t\\tMinCostFlow<ll,ll>mcf(2*n);\\n\\t\\trep(i,0,n){\\n\\t\\t\\tmcf.add_edge(0,i+n,0,inf,mid);\\n\\t\\t}\\n\\t\\trep(i,0,n-1){\\n\\t\\t\\tmcf.add_edge(i+1,i,0,inf,0);\\n\\t\\t}\\n\\t\\trep(i,0,m){\\n\\t\\t\\tif(f[i]==1)mcf.add_edge(u[i]+n,v[i],0,inf,-1);\\n\\t\\t\\telse{\\n\\t\\t\\t\\tmcf.add_edge(v[i],u[i]+n,0,inf,0);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i,0,n){\\n\\t\\t\\tmcf.add_edge(i+n,i,0,inf,-1);\\n\\t\\t\\tmcf.add_edge(i+n,i,a[i],inf,0);\\n\\t\\t\\tmcf.add_edge(i,i+n,0,a[i]-b[i],p[i]);\\n\\t\\t}\\n\\t\\tbool sw=mcf.build();\\n\\t\\tif(mcf.build()&&mcf.get_cost()>=x)ok=mid;\\n\\t\\telse ng=mid;\\n\\t\\t//debug(mcf.get_potential());\\n\\t\\t//cout<<sw spa mid spa mcf.get_cost()<<endl;\\n\\t}\\n\\t//debug(u);\\n\\t//debug(v);\\n\\t//debug(f);\\n\\tanss(ok,tinf,-1);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.76,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3171_4886075\",\n \"code_snippet\": \"#line 1 \\\"other/h.cpp\\\"\\n#include <bits/extc++.h>\\n#if __has_include(<bit>)\\n#include <bit>\\n#endif\\n#line 7 \\\"Library/alias.hpp\\\"\\nnamespace workspace {\\nconstexpr char eol = '\\\\n';\\nusing namespace std;\\nusing i32 = int_least32_t;\\nusing i64 = int_least64_t;\\nusing i128 = __int128_t;\\nusing u32 = uint_least32_t;\\nusing u64 = uint_least64_t;\\nusing u128 = __uint128_t;\\ntemplate <class T, class Comp = less<T>>\\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\\ntemplate <class T> using stack = std::stack<T, vector<T>>;\\n} // namespace workspace\\n#line 5 \\\"Library/config.hpp\\\"\\nnamespace config {\\nconst auto start_time{std::chrono::system_clock::now()};\\nint64_t elapsed() {\\n using namespace std::chrono;\\n const auto end_time{system_clock::now()};\\n return duration_cast<milliseconds>(end_time - start_time).count();\\n}\\n__attribute__((constructor)) void setup() {\\n using namespace std;\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n#ifdef _buffer_check\\n atexit([] {\\n char bufc;\\n if (cin >> bufc)\\n cerr << \\\"\\\\n\\\\033[43m\\\\033[30mwarning: buffer not empty.\\\\033[0m\\\\n\\\\n\\\";\\n });\\n#endif\\n}\\nunsigned cases(), caseid = 1;\\ntemplate <class F> void loop(F main) {\\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\\n}\\n} // namespace config\\n#line 2 \\\"Library/option.hpp\\\"\\n#ifdef ONLINE_JUDGE\\n #pragma GCC optimize(\\\"O3\\\")\\n #pragma GCC target(\\\"avx,avx2\\\")\\n #pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#line 2 \\\"Library/utils/binary_search.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <cassert>\\n#include <cmath>\\n#include <vector>\\nnamespace workspace {\\n// binary search on a discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\\n iter_type>\\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\\n assert(ok != ng);\\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\\n while (1 < dist || dist < -1) {\\n iter_type mid(ok + dist / 2);\\n if (pred(mid))\\n ok = mid, dist -= dist / 2;\\n else\\n ng = mid, dist /= 2;\\n }\\n return ok;\\n}\\n// parallel binary search on each discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\\n std::vector<bool>>,\\n std::vector<iter_type>>\\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\\n pred_type pred) {\\n std::vector<iter_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n iter_type mid(ok + (ng - ok) / 2);\\n if (mids[i] != mid) {\\n all_found = false;\\n mids[i] = mid;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n// binary search on a real number interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\\n real_type>\\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\\n assert(ok != ng);\\n while (ok + eps < ng || ng + eps < ok) {\\n real_type mid{(ok + ng) / 2};\\n (pred(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n// parallel binary search on each real interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<real_type>>,\\n std::vector<bool>>,\\n std::vector<real_type>>\\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\\n const real_type eps, pred_type pred) {\\n std::vector<real_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n if (ok + eps < ng || ng + eps < ok) {\\n all_found = false;\\n mids[i] = (ok + ng) / 2;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/casefmt.hpp\\\"\\nnamespace workspace {\\nstd::ostream &casefmt(std::ostream& os) { return os << \\\"Case #\\\" << config::caseid << \\\": \\\"; }\\n} // namespace workspace\\n#line 3 \\\"Library/utils/chval.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class Comp = std::less<T>>\\nbool chle(T &x, const T &y, Comp comp = Comp()) {\\n return comp(y, x) ? x = y, true : false;\\n}\\ntemplate <class T, class Comp = std::less<T>>\\nbool chge(T &x, const T &y, Comp comp = Comp()) {\\n return comp(x, y) ? x = y, true : false;\\n}\\n} // namespace workspace\\n#line 5 \\\"Library/utils/coordinate_compression.hpp\\\"\\n\\ntemplate <class T> class coordinate_compression {\\n std::vector<T> uniquely;\\n std::vector<size_t> compressed;\\n\\n public:\\n coordinate_compression(const std::vector<T> &raw)\\n : uniquely(raw), compressed(raw.size()) {\\n std::sort(uniquely.begin(), uniquely.end());\\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\\n uniquely.end());\\n for (size_t i = 0; i != size(); ++i)\\n compressed[i] =\\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\\n uniquely.begin();\\n }\\n\\n size_t operator[](const size_t idx) const {\\n assert(idx < size());\\n return compressed[idx];\\n }\\n\\n size_t size() const { return compressed.size(); }\\n\\n size_t count() const { return uniquely.size(); }\\n\\n T value(const size_t ord) const {\\n assert(ord < count());\\n return uniquely[ord];\\n }\\n\\n size_t order(const T &value) const {\\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\\n uniquely.begin();\\n }\\n\\n auto begin() { return compressed.begin(); }\\n auto end() { return compressed.end(); }\\n auto rbegin() { return compressed.rbegin(); }\\n auto rend() { return compressed.rend(); }\\n};\\n#line 3 \\\"Library/utils/fixed_point.hpp\\\"\\nnamespace workspace {\\n// specify the return type of lambda.\\ntemplate <class lambda_type> class fixed_point {\\n lambda_type func;\\n\\n public:\\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\\n template <class... Args> auto operator()(Args &&... args) const {\\n return func(*this, std::forward<Args>(args)...);\\n }\\n};\\n} // namespace workspace\\n#line 6 \\\"Library/utils/hash.hpp\\\"\\n\\n#line 3 \\\"Library/utils/sfinae.hpp\\\"\\n#include <type_traits>\\n\\ntemplate <class type, template <class> class trait>\\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\\n\\ntemplate <class Container>\\nusing element_type = typename std::decay<decltype(\\n *std::begin(std::declval<Container&>()))>::type;\\n\\ntemplate <class T, class = int> struct mapped_of {\\n using type = element_type<T>;\\n};\\ntemplate <class T>\\nstruct mapped_of<T,\\n typename std::pair<int, typename T::mapped_type>::first_type> {\\n using type = typename T::mapped_type;\\n};\\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\\n\\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\\ntemplate <class T>\\nstruct is_integral_ext<\\n T, typename std::enable_if<std::is_integral<T>::value>::type>\\n : std::true_type {};\\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\\n#if __cplusplus >= 201402\\ntemplate <class T>\\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\\n#endif\\n\\ntemplate <typename T, typename = void> struct multiplicable_uint {\\n using type = uint_least32_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\\n using type = uint_least64_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\\n using type = __uint128_t;\\n};\\n#line 8 \\\"Library/utils/hash.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class = void> struct hash : std::hash<T> {};\\n#if __cplusplus >= 201703L\\ntemplate <class Unique_bits_type>\\nstruct hash<Unique_bits_type,\\n enable_if_trait_type<Unique_bits_type,\\n std::has_unique_object_representations>> {\\n size_t operator()(uint64_t x) const {\\n static const uint64_t m = std::random_device{}();\\n x ^= x >> 23;\\n x ^= m;\\n x ^= x >> 47;\\n return x - (x >> 32);\\n }\\n};\\n#endif\\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\\n return seed ^\\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\\n}\\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\\n size_t operator()(const std::pair<T1, T2> &pair) const {\\n return hash_combine(hash<T1>()(pair.first), pair.second);\\n }\\n};\\ntemplate <class... T> class hash<std::tuple<T...>> {\\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\\n struct tuple_hash {\\n static uint64_t apply(const Tuple &t) {\\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\\n std::get<index>(t));\\n }\\n };\\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\\n static uint64_t apply(const Tuple &t) { return 0; }\\n };\\n\\n public:\\n uint64_t operator()(const std::tuple<T...> &t) const {\\n return tuple_hash<std::tuple<T...>>::apply(t);\\n }\\n};\\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\\n using key_type = typename hash_table::key_type;\\n size_t count(const key_type &key) const {\\n return hash_table::find(key) != hash_table::end();\\n }\\n template <class... Args> auto emplace(Args &&... args) {\\n return hash_table::insert(typename hash_table::value_type(args...));\\n }\\n};\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing cc_hash_table =\\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing gp_hash_table =\\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped>\\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\\n} // namespace workspace\\n#line 2 \\\"Library/utils/make_vector.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <vector>\\nnamespace workspace {\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\\n if constexpr (N)\\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\\n else\\n return init;\\n}\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\\n return make_vector<T, N>((size_t*)sizes, init);\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/random_number_generator.hpp\\\"\\ntemplate <typename num_type> class random_number_generator {\\n typename std::conditional<std::is_integral<num_type>::value,\\n std::uniform_int_distribution<num_type>,\\n std::uniform_real_distribution<num_type>>::type\\n unif;\\n\\n std::mt19937 engine;\\n\\n public:\\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\\n num_type max = std::numeric_limits<num_type>::max())\\n : unif(min, max), engine(std::random_device{}()) {}\\n\\n num_type min() const { return unif.min(); }\\n\\n num_type max() const { return unif.max(); }\\n\\n // generate a random number in [min(), max()].\\n num_type operator()() { return unif(engine); }\\n};\\n#line 3 \\\"Library/utils/read.hpp\\\"\\nnamespace workspace {\\n// read with std::cin.\\ntemplate <class T = void>\\nstruct read\\n{\\n typename std::remove_const<T>::type value;\\n template <class... types>\\n read(types... args) : value(args...) { std::cin >> value; }\\n operator T() const { return value; }\\n};\\ntemplate <>\\nstruct read<void>\\n{\\n template <class T>\\n operator T() const { T value; std::cin >> value; return value; }\\n};\\n} // namespace workspace\\n#line 4 \\\"Library/utils/stream.hpp\\\"\\n\\n#line 6 \\\"Library/utils/stream.hpp\\\"\\nnamespace std {\\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ' ' << p.second;\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_is {\\n static istream &apply(istream &is, tuple_t &t) {\\n tuple_is<tuple_t, index - 1>::apply(is, t);\\n return is >> get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\\n static istream &apply(istream &is, tuple_t &t) { return is; }\\n};\\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\\n t);\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_os {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n tuple_os<tuple_t, index - 1>::apply(os, t);\\n return os << ' ' << get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n return os << get<0>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\\n};\\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\\n t);\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n istream &>::type\\noperator>>(istream &is, Container &cont) {\\n for (auto &&e : cont) is >> e;\\n return is;\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n ostream &>::type\\noperator<<(ostream &os, const Container &cont) {\\n bool head = true;\\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\\n return os;\\n}\\n} // namespace std\\n#line 4 \\\"Library/utils/trinary_search.hpp\\\"\\n// trinary search on discrete range.\\ntemplate <class iter_type, class comp_type>\\niter_type trinary(iter_type first, iter_type last, comp_type comp)\\n{\\n assert(first < last);\\n intmax_t dist(last - first);\\n while(dist > 2)\\n {\\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\\n else first = left, dist -= dist / 3;\\n }\\n if(dist > 1 && comp(first + 1, first)) ++first;\\n return first;\\n}\\n// trinary search on real numbers.\\ntemplate <class comp_type>\\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\\n{\\n assert(first < last);\\n while(last - first > eps)\\n {\\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\\n if(comp(left, right)) last = right;\\n else first = left;\\n }\\n return first;\\n}\\n#line 2 \\\"Library/utils/wrapper.hpp\\\"\\ntemplate <class Container> class reversed {\\n Container &ref, copy;\\n\\n public:\\n reversed(Container &ref) : ref(ref) {}\\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\\n auto begin() const { return ref.rbegin(); }\\n auto end() const { return ref.rend(); }\\n};\\n#line 9 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main();\\n}\\nint main() { config::loop(workspace::main); }\\n\\nunsigned config::cases() {\\n // return -1; // unspecified\\n // int t; std::cin >> t; return t; // given\\n return 1;\\n}\\n\\n#line 4 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n\\n#line 4 \\\"Library/graph/directed/flow/base.hpp\\\"\\n// the base class of flow algorithms.\\ntemplate <class cap_t, class cost_t> struct flow_base {\\n struct edge_t {\\n size_t src, dst;\\n cap_t cap;\\n cost_t cost;\\n edge_t *rev;\\n edge_t() = default;\\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\\n : src(src), dst(dst), cap(cap), rev(rev) {}\\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\\n edge_t *rev)\\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\\n }; // class edge_t\\n\\n class adj_type {\\n edge_t *fst, *lst, *clst;\\n\\n public:\\n template <class... Args> edge_t *emplace(Args &&... args) {\\n if (lst == clst) {\\n size_t len(clst - fst);\\n edge_t *nfst = lst = new edge_t[len << 1];\\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\\n p->rev->rev = lst, *lst = *p;\\n delete[] fst;\\n fst = nfst;\\n clst = lst + len;\\n }\\n *lst = edge_t(args...);\\n return lst++;\\n }\\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\\n ~adj_type() { delete[] fst; }\\n edge_t &operator[](size_t i) {\\n assert(i < size());\\n return *(fst + i);\\n }\\n size_t size() const { return lst - fst; }\\n edge_t *begin() const { return fst; }\\n edge_t *end() const { return lst; }\\n }; // class adj_type\\n\\n flow_base(size_t n = 0) : adjs(n) {}\\n\\n flow_base(const flow_base &other) : adjs(other.size()) {\\n for (size_t node{}; node != size(); ++node)\\n for (const auto &[src, dst, cap, cost, rev] : other[node])\\n if (src == node) {\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\\n rev->src = nil;\\n } else {\\n rev->rev->src = node;\\n }\\n }\\n\\n flow_base &operator=(const flow_base &rhs) {\\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\\n return *this;\\n }\\n\\n size_t size() const { return adjs.size(); }\\n\\n adj_type &operator[](size_t node) {\\n assert(node < size());\\n return adjs[node];\\n }\\n const adj_type &operator[](size_t node) const {\\n assert(node < size());\\n return adjs[node];\\n }\\n\\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) {\\n assert(src < size());\\n assert(dst < size());\\n assert(!(cap < static_cast<cap_t>(0)));\\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\\n return ptr;\\n }\\n\\n protected:\\n constexpr static size_t nil = -1;\\n std::vector<adj_type> adjs;\\n}; // class flow_base\\n#line 6 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n// Successive shortest paths algorithm.\\ntemplate <class cap_t, class cost_t, bool density_tag = false>\\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\\n using base = flow_base<cap_t, cost_t>;\\n using edge_t = typename base::edge_t;\\n using base::adjs;\\n using base::nil;\\n\\n cost_t min_cost, total_cost;\\n std::vector<cap_t> supp;\\n std::vector<cost_t> ptnl;\\n\\n void copy_member(const min_cost_flow &other) {\\n min_cost = other.min_cost;\\n total_cost = other.total_cost;\\n supp = other.supp;\\n ptnl = other.ptnl;\\n }\\n\\n void Dijkstra(std::vector<edge_t *> &last) {\\n const cost_t infty(total_cost + 1);\\n std::vector<cost_t> nptnl(size(), infty);\\n if constexpr (density_tag) {\\n // O(V^2)\\n std::vector<bool> used(size());\\n for (size_t src{}; src != size(); ++src) {\\n if (static_cast<cap_t>(0) < supp[src]) {\\n used[src] = true;\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\\n if (e.avbl() && e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n for (;;) {\\n size_t src{nil};\\n cost_t sp{infty};\\n for (size_t node{}; node != size(); ++node) {\\n if (used[node] || nptnl[node] == infty) continue;\\n cost_t dist{nptnl[node] - ptnl[node]};\\n if (dist < sp) {\\n sp = dist;\\n src = node;\\n }\\n }\\n if (src == nil) break;\\n used[src] = true;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = nptnl[src] + e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n } else {\\n // O((V + E)logV)\\n struct node_t {\\n size_t id;\\n cost_t dist;\\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\\n };\\n std::priority_queue<node_t> que;\\n for (size_t src{}; src != size(); ++src) {\\n if (supp[src] > static_cast<cap_t>(0)) {\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\\n if (e.avbl() && nptnl[e.dst] > e.cost) {\\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n while (!que.empty()) {\\n auto [src, ndist] = que.top();\\n que.pop();\\n if (ndist + ptnl[src] != nptnl[src]) continue;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\\n que.emplace(e.dst,\\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n ptnl.swap(nptnl);\\n }\\n\\n public:\\n using base::size;\\n\\n min_cost_flow(size_t n = 0)\\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\\n\\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\\n copy_member(other);\\n }\\n\\n min_cost_flow &operator=(const min_cost_flow &other) {\\n base::operator=(other);\\n copy_member(other);\\n return *this;\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) override {\\n assert(src != dst);\\n if (cost < static_cast<cost_t>(0)) {\\n supp[src] -= cap;\\n supp[dst] += cap;\\n min_cost += cap * cost;\\n total_cost -= cap * cost;\\n return base::add_edge(dst, src, cap, -cost);\\n }\\n total_cost += cap * cost;\\n return base::add_edge(src, dst, cap, cost);\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\\n const cap_t &upper, const cost_t &cost) {\\n assert(!(upper < lower));\\n supp[src] -= lower;\\n supp[dst] += lower;\\n min_cost += lower * cost;\\n return add_edge(src, dst, upper - lower, cost);\\n }\\n\\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\\n assert(node < size());\\n return supp[node] += vol;\\n }\\n\\n const cap_t &demand(size_t node, const cap_t &vol) {\\n return supply(node, -vol);\\n }\\n\\n bool flow() {\\n for (bool aug = true; aug;) {\\n aug = false;\\n std::vector<edge_t *> last(size());\\n Dijkstra(last);\\n std::vector<bool> shut(size());\\n for (size_t dst{}; dst != size(); ++dst) {\\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\\n cap_t resid{-supp[dst]};\\n size_t src{dst}, block{nil};\\n while (last[src] && !shut[src]) {\\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\\n src = last[src]->src;\\n }\\n if (shut[src])\\n block = src;\\n else {\\n if (!(resid < supp[src])) {\\n resid = supp[src];\\n block = src;\\n }\\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\\n e->cap -= resid;\\n e->rev->cap += resid;\\n }\\n supp[src] -= resid;\\n supp[dst] += resid;\\n min_cost += ptnl[dst] * resid;\\n aug = true;\\n }\\n if (~block) {\\n for (size_t node{dst};; node = last[node]->src) {\\n shut[node] = true;\\n if (node == block) break;\\n }\\n }\\n }\\n }\\n }\\n return std::none_of(begin(supp), end(supp),\\n [](const cap_t &s) { return s < 0 || 0 < s; });\\n }\\n\\n cost_t optimal() {\\n assert(flow());\\n return min_cost;\\n }\\n}; // class min_cost_flow\\n#line 22 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main() {\\n // start here!\\n const i64 inf = 1e10;\\n int n, m, x;\\n cin >> n >> m >> x;\\n\\n min_cost_flow<i64, i64> base(n * 3);\\n // make\\n {\\n for (int i = 0; i < n; i++) {\\n int a, b, p;\\n cin >> a >> b >> p;\\n base.add_edge(3 * i + 1, 3 * i, inf, p);\\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\\n base.supply(3 * i, -a);\\n base.supply(3 * i + 1, a - b);\\n base.supply(3 * i + 2, b);\\n }\\n }\\n for (auto j = 0; j < m; ++j) {\\n int u, v, f;\\n cin >> u >> v >> f;\\n --u, --v;\\n if (f > 0) {\\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\\n } else {\\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\\n }\\n }\\n\\n auto ok = [&](int t) -> bool {\\n auto mcf = base;\\n for (int i = 0; i < n; i++) {\\n mcf.add_edge(3 * i + 2, 0, inf, t);\\n }\\n if (mcf.flow()) {\\n auto opt = mcf.optimal();\\n return opt >= x;\\n }\\n return false;\\n };\\n \\n const int tmax = x + 100 * n * (n - 1); \\n\\n auto ans = binary_search(tmax + 1, -1, ok);\\n if (ans > tmax)\\n cout << \\\"-1\\\\n\\\";\\n else\\n cout << ans << eol;\\n}\\n}\",\n \"accuracy\": 0.4222222222222222,\n \"time_ms\": 40,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -0.6148,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3171_4886073\",\n \"code_snippet\": \"#line 1 \\\"other/h.cpp\\\"\\n#include <bits/extc++.h>\\n#if __has_include(<bit>)\\n#include <bit>\\n#endif\\n#line 7 \\\"Library/alias.hpp\\\"\\nnamespace workspace {\\nconstexpr char eol = '\\\\n';\\nusing namespace std;\\nusing i32 = int_least32_t;\\nusing i64 = int_least64_t;\\nusing i128 = __int128_t;\\nusing u32 = uint_least32_t;\\nusing u64 = uint_least64_t;\\nusing u128 = __uint128_t;\\ntemplate <class T, class Comp = less<T>>\\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\\ntemplate <class T> using stack = std::stack<T, vector<T>>;\\n} // namespace workspace\\n#line 5 \\\"Library/config.hpp\\\"\\nnamespace config {\\nconst auto start_time{std::chrono::system_clock::now()};\\nint64_t elapsed() {\\n using namespace std::chrono;\\n const auto end_time{system_clock::now()};\\n return duration_cast<milliseconds>(end_time - start_time).count();\\n}\\n__attribute__((constructor)) void setup() {\\n using namespace std;\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n#ifdef _buffer_check\\n atexit([] {\\n char bufc;\\n if (cin >> bufc)\\n cerr << \\\"\\\\n\\\\033[43m\\\\033[30mwarning: buffer not empty.\\\\033[0m\\\\n\\\\n\\\";\\n });\\n#endif\\n}\\nunsigned cases(), caseid = 1;\\ntemplate <class F> void loop(F main) {\\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\\n}\\n} // namespace config\\n#line 2 \\\"Library/option.hpp\\\"\\n#ifdef ONLINE_JUDGE\\n #pragma GCC optimize(\\\"O3\\\")\\n #pragma GCC target(\\\"avx,avx2\\\")\\n #pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#line 2 \\\"Library/utils/binary_search.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <cassert>\\n#include <cmath>\\n#include <vector>\\nnamespace workspace {\\n// binary search on a discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\\n iter_type>\\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\\n assert(ok != ng);\\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\\n while (1 < dist || dist < -1) {\\n iter_type mid(ok + dist / 2);\\n if (pred(mid))\\n ok = mid, dist -= dist / 2;\\n else\\n ng = mid, dist /= 2;\\n }\\n return ok;\\n}\\n// parallel binary search on each discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\\n std::vector<bool>>,\\n std::vector<iter_type>>\\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\\n pred_type pred) {\\n std::vector<iter_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n iter_type mid(ok + (ng - ok) / 2);\\n if (mids[i] != mid) {\\n all_found = false;\\n mids[i] = mid;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n// binary search on a real number interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\\n real_type>\\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\\n assert(ok != ng);\\n while (ok + eps < ng || ng + eps < ok) {\\n real_type mid{(ok + ng) / 2};\\n (pred(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n// parallel binary search on each real interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<real_type>>,\\n std::vector<bool>>,\\n std::vector<real_type>>\\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\\n const real_type eps, pred_type pred) {\\n std::vector<real_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n if (ok + eps < ng || ng + eps < ok) {\\n all_found = false;\\n mids[i] = (ok + ng) / 2;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/casefmt.hpp\\\"\\nnamespace workspace {\\nstd::ostream &casefmt(std::ostream& os) { return os << \\\"Case #\\\" << config::caseid << \\\": \\\"; }\\n} // namespace workspace\\n#line 3 \\\"Library/utils/chval.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class Comp = std::less<T>>\\nbool chle(T &x, const T &y, Comp comp = Comp()) {\\n return comp(y, x) ? x = y, true : false;\\n}\\ntemplate <class T, class Comp = std::less<T>>\\nbool chge(T &x, const T &y, Comp comp = Comp()) {\\n return comp(x, y) ? x = y, true : false;\\n}\\n} // namespace workspace\\n#line 5 \\\"Library/utils/coordinate_compression.hpp\\\"\\n\\ntemplate <class T> class coordinate_compression {\\n std::vector<T> uniquely;\\n std::vector<size_t> compressed;\\n\\n public:\\n coordinate_compression(const std::vector<T> &raw)\\n : uniquely(raw), compressed(raw.size()) {\\n std::sort(uniquely.begin(), uniquely.end());\\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\\n uniquely.end());\\n for (size_t i = 0; i != size(); ++i)\\n compressed[i] =\\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\\n uniquely.begin();\\n }\\n\\n size_t operator[](const size_t idx) const {\\n assert(idx < size());\\n return compressed[idx];\\n }\\n\\n size_t size() const { return compressed.size(); }\\n\\n size_t count() const { return uniquely.size(); }\\n\\n T value(const size_t ord) const {\\n assert(ord < count());\\n return uniquely[ord];\\n }\\n\\n size_t order(const T &value) const {\\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\\n uniquely.begin();\\n }\\n\\n auto begin() { return compressed.begin(); }\\n auto end() { return compressed.end(); }\\n auto rbegin() { return compressed.rbegin(); }\\n auto rend() { return compressed.rend(); }\\n};\\n#line 3 \\\"Library/utils/fixed_point.hpp\\\"\\nnamespace workspace {\\n// specify the return type of lambda.\\ntemplate <class lambda_type> class fixed_point {\\n lambda_type func;\\n\\n public:\\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\\n template <class... Args> auto operator()(Args &&... args) const {\\n return func(*this, std::forward<Args>(args)...);\\n }\\n};\\n} // namespace workspace\\n#line 6 \\\"Library/utils/hash.hpp\\\"\\n\\n#line 3 \\\"Library/utils/sfinae.hpp\\\"\\n#include <type_traits>\\n\\ntemplate <class type, template <class> class trait>\\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\\n\\ntemplate <class Container>\\nusing element_type = typename std::decay<decltype(\\n *std::begin(std::declval<Container&>()))>::type;\\n\\ntemplate <class T, class = int> struct mapped_of {\\n using type = element_type<T>;\\n};\\ntemplate <class T>\\nstruct mapped_of<T,\\n typename std::pair<int, typename T::mapped_type>::first_type> {\\n using type = typename T::mapped_type;\\n};\\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\\n\\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\\ntemplate <class T>\\nstruct is_integral_ext<\\n T, typename std::enable_if<std::is_integral<T>::value>::type>\\n : std::true_type {};\\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\\n#if __cplusplus >= 201402\\ntemplate <class T>\\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\\n#endif\\n\\ntemplate <typename T, typename = void> struct multiplicable_uint {\\n using type = uint_least32_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\\n using type = uint_least64_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\\n using type = __uint128_t;\\n};\\n#line 8 \\\"Library/utils/hash.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class = void> struct hash : std::hash<T> {};\\n#if __cplusplus >= 201703L\\ntemplate <class Unique_bits_type>\\nstruct hash<Unique_bits_type,\\n enable_if_trait_type<Unique_bits_type,\\n std::has_unique_object_representations>> {\\n size_t operator()(uint64_t x) const {\\n static const uint64_t m = std::random_device{}();\\n x ^= x >> 23;\\n x ^= m;\\n x ^= x >> 47;\\n return x - (x >> 32);\\n }\\n};\\n#endif\\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\\n return seed ^\\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\\n}\\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\\n size_t operator()(const std::pair<T1, T2> &pair) const {\\n return hash_combine(hash<T1>()(pair.first), pair.second);\\n }\\n};\\ntemplate <class... T> class hash<std::tuple<T...>> {\\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\\n struct tuple_hash {\\n static uint64_t apply(const Tuple &t) {\\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\\n std::get<index>(t));\\n }\\n };\\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\\n static uint64_t apply(const Tuple &t) { return 0; }\\n };\\n\\n public:\\n uint64_t operator()(const std::tuple<T...> &t) const {\\n return tuple_hash<std::tuple<T...>>::apply(t);\\n }\\n};\\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\\n using key_type = typename hash_table::key_type;\\n size_t count(const key_type &key) const {\\n return hash_table::find(key) != hash_table::end();\\n }\\n template <class... Args> auto emplace(Args &&... args) {\\n return hash_table::insert(typename hash_table::value_type(args...));\\n }\\n};\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing cc_hash_table =\\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing gp_hash_table =\\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped>\\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\\n} // namespace workspace\\n#line 2 \\\"Library/utils/make_vector.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <vector>\\nnamespace workspace {\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\\n if constexpr (N)\\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\\n else\\n return init;\\n}\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\\n return make_vector<T, N>((size_t*)sizes, init);\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/random_number_generator.hpp\\\"\\ntemplate <typename num_type> class random_number_generator {\\n typename std::conditional<std::is_integral<num_type>::value,\\n std::uniform_int_distribution<num_type>,\\n std::uniform_real_distribution<num_type>>::type\\n unif;\\n\\n std::mt19937 engine;\\n\\n public:\\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\\n num_type max = std::numeric_limits<num_type>::max())\\n : unif(min, max), engine(std::random_device{}()) {}\\n\\n num_type min() const { return unif.min(); }\\n\\n num_type max() const { return unif.max(); }\\n\\n // generate a random number in [min(), max()].\\n num_type operator()() { return unif(engine); }\\n};\\n#line 3 \\\"Library/utils/read.hpp\\\"\\nnamespace workspace {\\n// read with std::cin.\\ntemplate <class T = void>\\nstruct read\\n{\\n typename std::remove_const<T>::type value;\\n template <class... types>\\n read(types... args) : value(args...) { std::cin >> value; }\\n operator T() const { return value; }\\n};\\ntemplate <>\\nstruct read<void>\\n{\\n template <class T>\\n operator T() const { T value; std::cin >> value; return value; }\\n};\\n} // namespace workspace\\n#line 4 \\\"Library/utils/stream.hpp\\\"\\n\\n#line 6 \\\"Library/utils/stream.hpp\\\"\\nnamespace std {\\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ' ' << p.second;\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_is {\\n static istream &apply(istream &is, tuple_t &t) {\\n tuple_is<tuple_t, index - 1>::apply(is, t);\\n return is >> get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\\n static istream &apply(istream &is, tuple_t &t) { return is; }\\n};\\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\\n t);\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_os {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n tuple_os<tuple_t, index - 1>::apply(os, t);\\n return os << ' ' << get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n return os << get<0>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\\n};\\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\\n t);\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n istream &>::type\\noperator>>(istream &is, Container &cont) {\\n for (auto &&e : cont) is >> e;\\n return is;\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n ostream &>::type\\noperator<<(ostream &os, const Container &cont) {\\n bool head = true;\\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\\n return os;\\n}\\n} // namespace std\\n#line 4 \\\"Library/utils/trinary_search.hpp\\\"\\n// trinary search on discrete range.\\ntemplate <class iter_type, class comp_type>\\niter_type trinary(iter_type first, iter_type last, comp_type comp)\\n{\\n assert(first < last);\\n intmax_t dist(last - first);\\n while(dist > 2)\\n {\\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\\n else first = left, dist -= dist / 3;\\n }\\n if(dist > 1 && comp(first + 1, first)) ++first;\\n return first;\\n}\\n// trinary search on real numbers.\\ntemplate <class comp_type>\\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\\n{\\n assert(first < last);\\n while(last - first > eps)\\n {\\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\\n if(comp(left, right)) last = right;\\n else first = left;\\n }\\n return first;\\n}\\n#line 2 \\\"Library/utils/wrapper.hpp\\\"\\ntemplate <class Container> class reversed {\\n Container &ref, copy;\\n\\n public:\\n reversed(Container &ref) : ref(ref) {}\\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\\n auto begin() const { return ref.rbegin(); }\\n auto end() const { return ref.rend(); }\\n};\\n#line 9 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main();\\n}\\nint main() { config::loop(workspace::main); }\\n\\nunsigned config::cases() {\\n // return -1; // unspecified\\n // int t; std::cin >> t; return t; // given\\n return 1;\\n}\\n\\n#line 4 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n\\n#line 4 \\\"Library/graph/directed/flow/base.hpp\\\"\\n// the base class of flow algorithms.\\ntemplate <class cap_t, class cost_t> struct flow_base {\\n struct edge_t {\\n size_t src, dst;\\n cap_t cap;\\n cost_t cost;\\n edge_t *rev;\\n edge_t() = default;\\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\\n : src(src), dst(dst), cap(cap), rev(rev) {}\\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\\n edge_t *rev)\\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\\n }; // class edge_t\\n\\n class adj_type {\\n edge_t *fst, *lst, *clst;\\n\\n public:\\n template <class... Args> edge_t *emplace(Args &&... args) {\\n if (lst == clst) {\\n size_t len(clst - fst);\\n edge_t *nfst = lst = new edge_t[len << 1];\\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\\n p->rev->rev = lst, *lst = *p;\\n delete[] fst;\\n fst = nfst;\\n clst = lst + len;\\n }\\n *lst = edge_t(args...);\\n return lst++;\\n }\\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\\n ~adj_type() { delete[] fst; }\\n edge_t &operator[](size_t i) {\\n assert(i < size());\\n return *(fst + i);\\n }\\n size_t size() const { return lst - fst; }\\n edge_t *begin() const { return fst; }\\n edge_t *end() const { return lst; }\\n }; // class adj_type\\n\\n flow_base(size_t n = 0) : adjs(n) {}\\n\\n flow_base(const flow_base &other) : adjs(other.size()) {\\n for (size_t node{}; node != size(); ++node)\\n for (const auto &[src, dst, cap, cost, rev] : other[node])\\n if (src == node) {\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\\n rev->src = nil;\\n } else {\\n rev->rev->src = node;\\n }\\n }\\n\\n flow_base &operator=(const flow_base &rhs) {\\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\\n return *this;\\n }\\n\\n size_t size() const { return adjs.size(); }\\n\\n adj_type &operator[](size_t node) {\\n assert(node < size());\\n return adjs[node];\\n }\\n const adj_type &operator[](size_t node) const {\\n assert(node < size());\\n return adjs[node];\\n }\\n\\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) {\\n assert(src < size());\\n assert(dst < size());\\n assert(!(cap < static_cast<cap_t>(0)));\\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\\n return ptr;\\n }\\n\\n protected:\\n constexpr static size_t nil = -1;\\n std::vector<adj_type> adjs;\\n}; // class flow_base\\n#line 6 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n// Successive shortest paths algorithm.\\ntemplate <class cap_t, class cost_t, bool density_tag = false>\\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\\n using base = flow_base<cap_t, cost_t>;\\n using edge_t = typename base::edge_t;\\n using base::adjs;\\n using base::nil;\\n\\n cost_t min_cost, total_cost;\\n std::vector<cap_t> supp;\\n std::vector<cost_t> ptnl;\\n\\n void copy_member(const min_cost_flow &other) {\\n min_cost = other.min_cost;\\n total_cost = other.total_cost;\\n supp = other.supp;\\n ptnl = other.ptnl;\\n }\\n\\n void Dijkstra(std::vector<edge_t *> &last) {\\n const cost_t infty(total_cost + 1);\\n std::vector<cost_t> nptnl(size(), infty);\\n if constexpr (density_tag) {\\n // O(V^2)\\n std::vector<bool> used(size());\\n for (size_t src{}; src != size(); ++src) {\\n if (static_cast<cap_t>(0) < supp[src]) {\\n used[src] = true;\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\\n if (e.avbl() && e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n for (;;) {\\n size_t src{nil};\\n cost_t sp{infty};\\n for (size_t node{}; node != size(); ++node) {\\n if (used[node] || nptnl[node] == infty) continue;\\n cost_t dist{nptnl[node] - ptnl[node]};\\n if (dist < sp) {\\n sp = dist;\\n src = node;\\n }\\n }\\n if (src == nil) break;\\n used[src] = true;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = nptnl[src] + e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n } else {\\n // O((V + E)logV)\\n struct node_t {\\n size_t id;\\n cost_t dist;\\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\\n };\\n std::priority_queue<node_t> que;\\n for (size_t src{}; src != size(); ++src) {\\n if (supp[src] > static_cast<cap_t>(0)) {\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\\n if (e.avbl() && nptnl[e.dst] > e.cost) {\\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n while (!que.empty()) {\\n auto [src, ndist] = que.top();\\n que.pop();\\n if (ndist + ptnl[src] != nptnl[src]) continue;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\\n que.emplace(e.dst,\\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n ptnl.swap(nptnl);\\n }\\n\\n public:\\n using base::size;\\n\\n min_cost_flow(size_t n = 0)\\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\\n\\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\\n copy_member(other);\\n }\\n\\n min_cost_flow &operator=(const min_cost_flow &other) {\\n base::operator=(other);\\n copy_member(other);\\n return *this;\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) override {\\n assert(src != dst);\\n if (cost < static_cast<cost_t>(0)) {\\n supp[src] -= cap;\\n supp[dst] += cap;\\n min_cost += cap * cost;\\n total_cost -= cap * cost;\\n return base::add_edge(dst, src, cap, -cost);\\n }\\n total_cost += cap * cost;\\n return base::add_edge(src, dst, cap, cost);\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\\n const cap_t &upper, const cost_t &cost) {\\n assert(!(upper < lower));\\n supp[src] -= lower;\\n supp[dst] += lower;\\n min_cost += lower * cost;\\n return add_edge(src, dst, upper - lower, cost);\\n }\\n\\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\\n assert(node < size());\\n return supp[node] += vol;\\n }\\n\\n const cap_t &demand(size_t node, const cap_t &vol) {\\n return supply(node, -vol);\\n }\\n\\n bool flow() {\\n for (bool aug = true; aug;) {\\n aug = false;\\n std::vector<edge_t *> last(size());\\n Dijkstra(last);\\n std::vector<bool> shut(size());\\n for (size_t dst{}; dst != size(); ++dst) {\\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\\n cap_t resid{-supp[dst]};\\n size_t src{dst}, block{nil};\\n while (last[src] && !shut[src]) {\\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\\n src = last[src]->src;\\n }\\n if (shut[src])\\n block = src;\\n else {\\n if (!(resid < supp[src])) {\\n resid = supp[src];\\n block = src;\\n }\\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\\n e->cap -= resid;\\n e->rev->cap += resid;\\n }\\n supp[src] -= resid;\\n supp[dst] += resid;\\n min_cost += ptnl[dst] * resid;\\n aug = true;\\n }\\n if (~block) {\\n for (size_t node{dst};; node = last[node]->src) {\\n shut[node] = true;\\n if (node == block) break;\\n }\\n }\\n }\\n }\\n }\\n return std::none_of(begin(supp), end(supp),\\n [](const cap_t &s) { return s < 0 || 0 < s; });\\n }\\n\\n cost_t optimal() {\\n assert(flow());\\n return min_cost;\\n }\\n}; // class min_cost_flow\\n#line 22 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main() {\\n // start here!\\n const i64 inf = 1e10;\\n int n, m, x;\\n cin >> n >> m >> x;\\n\\n min_cost_flow<i64, i64> base(n * 3);\\n // make\\n {\\n for (int i = 0; i < n; i++) {\\n int a, b, p;\\n cin >> a >> b >> p;\\n base.add_edge(3 * i + 1, 3 * i, inf, p);\\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\\n base.supply(3 * i, -a);\\n base.supply(3 * i + 1, a - b);\\n base.supply(3 * i + 2, b);\\n }\\n }\\n for (auto j = 0; j < m; ++j) {\\n int u, v, f;\\n cin >> u >> v >> f;\\n --u, --v;\\n if (f > 0) {\\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\\n } else {\\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\\n }\\n }\\n\\n auto ok = [&](int t) -> bool {\\n auto mcf = base;\\n for (int i = 0; i < n; i++) {\\n mcf.add_edge(3 * i + 2, 0, inf, t);\\n }\\n if (mcf.flow()) {\\n auto opt = mcf.optimal();\\n return opt >= x;\\n }\\n return false;\\n };\\n\\n auto ans = binary_search(x + 200 * (m + n) + 1, -1, ok);\\n if (ans > x + 200 * (m + n))\\n cout << \\\"-1\\\\n\\\";\\n else\\n cout << ans << eol;\\n}\\n}\",\n \"accuracy\": 0.4222222222222222,\n \"time_ms\": 40,\n \"memory_kb\": 3680,\n \"score_of_the_acc\": -0.7518,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3171_4886072\",\n \"code_snippet\": \"#line 1 \\\"other/h.cpp\\\"\\n#include <bits/extc++.h>\\n#if __has_include(<bit>)\\n#include <bit>\\n#endif\\n#line 7 \\\"Library/alias.hpp\\\"\\nnamespace workspace {\\nconstexpr char eol = '\\\\n';\\nusing namespace std;\\nusing i32 = int_least32_t;\\nusing i64 = int_least64_t;\\nusing i128 = __int128_t;\\nusing u32 = uint_least32_t;\\nusing u64 = uint_least64_t;\\nusing u128 = __uint128_t;\\ntemplate <class T, class Comp = less<T>>\\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\\ntemplate <class T> using stack = std::stack<T, vector<T>>;\\n} // namespace workspace\\n#line 5 \\\"Library/config.hpp\\\"\\nnamespace config {\\nconst auto start_time{std::chrono::system_clock::now()};\\nint64_t elapsed() {\\n using namespace std::chrono;\\n const auto end_time{system_clock::now()};\\n return duration_cast<milliseconds>(end_time - start_time).count();\\n}\\n__attribute__((constructor)) void setup() {\\n using namespace std;\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n#ifdef _buffer_check\\n atexit([] {\\n char bufc;\\n if (cin >> bufc)\\n cerr << \\\"\\\\n\\\\033[43m\\\\033[30mwarning: buffer not empty.\\\\033[0m\\\\n\\\\n\\\";\\n });\\n#endif\\n}\\nunsigned cases(), caseid = 1;\\ntemplate <class F> void loop(F main) {\\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\\n}\\n} // namespace config\\n#line 2 \\\"Library/option.hpp\\\"\\n#ifdef ONLINE_JUDGE\\n #pragma GCC optimize(\\\"O3\\\")\\n #pragma GCC target(\\\"avx,avx2\\\")\\n #pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#line 2 \\\"Library/utils/binary_search.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <cassert>\\n#include <cmath>\\n#include <vector>\\nnamespace workspace {\\n// binary search on a discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\\n iter_type>\\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\\n assert(ok != ng);\\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\\n while (1 < dist || dist < -1) {\\n iter_type mid(ok + dist / 2);\\n if (pred(mid))\\n ok = mid, dist -= dist / 2;\\n else\\n ng = mid, dist /= 2;\\n }\\n return ok;\\n}\\n// parallel binary search on each discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\\n std::vector<bool>>,\\n std::vector<iter_type>>\\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\\n pred_type pred) {\\n std::vector<iter_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n iter_type mid(ok + (ng - ok) / 2);\\n if (mids[i] != mid) {\\n all_found = false;\\n mids[i] = mid;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n// binary search on a real number interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\\n real_type>\\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\\n assert(ok != ng);\\n while (ok + eps < ng || ng + eps < ok) {\\n real_type mid{(ok + ng) / 2};\\n (pred(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n// parallel binary search on each real interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<real_type>>,\\n std::vector<bool>>,\\n std::vector<real_type>>\\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\\n const real_type eps, pred_type pred) {\\n std::vector<real_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n if (ok + eps < ng || ng + eps < ok) {\\n all_found = false;\\n mids[i] = (ok + ng) / 2;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/casefmt.hpp\\\"\\nnamespace workspace {\\nstd::ostream &casefmt(std::ostream& os) { return os << \\\"Case #\\\" << config::caseid << \\\": \\\"; }\\n} // namespace workspace\\n#line 3 \\\"Library/utils/chval.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class Comp = std::less<T>>\\nbool chle(T &x, const T &y, Comp comp = Comp()) {\\n return comp(y, x) ? x = y, true : false;\\n}\\ntemplate <class T, class Comp = std::less<T>>\\nbool chge(T &x, const T &y, Comp comp = Comp()) {\\n return comp(x, y) ? x = y, true : false;\\n}\\n} // namespace workspace\\n#line 5 \\\"Library/utils/coordinate_compression.hpp\\\"\\n\\ntemplate <class T> class coordinate_compression {\\n std::vector<T> uniquely;\\n std::vector<size_t> compressed;\\n\\n public:\\n coordinate_compression(const std::vector<T> &raw)\\n : uniquely(raw), compressed(raw.size()) {\\n std::sort(uniquely.begin(), uniquely.end());\\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\\n uniquely.end());\\n for (size_t i = 0; i != size(); ++i)\\n compressed[i] =\\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\\n uniquely.begin();\\n }\\n\\n size_t operator[](const size_t idx) const {\\n assert(idx < size());\\n return compressed[idx];\\n }\\n\\n size_t size() const { return compressed.size(); }\\n\\n size_t count() const { return uniquely.size(); }\\n\\n T value(const size_t ord) const {\\n assert(ord < count());\\n return uniquely[ord];\\n }\\n\\n size_t order(const T &value) const {\\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\\n uniquely.begin();\\n }\\n\\n auto begin() { return compressed.begin(); }\\n auto end() { return compressed.end(); }\\n auto rbegin() { return compressed.rbegin(); }\\n auto rend() { return compressed.rend(); }\\n};\\n#line 3 \\\"Library/utils/fixed_point.hpp\\\"\\nnamespace workspace {\\n// specify the return type of lambda.\\ntemplate <class lambda_type> class fixed_point {\\n lambda_type func;\\n\\n public:\\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\\n template <class... Args> auto operator()(Args &&... args) const {\\n return func(*this, std::forward<Args>(args)...);\\n }\\n};\\n} // namespace workspace\\n#line 6 \\\"Library/utils/hash.hpp\\\"\\n\\n#line 3 \\\"Library/utils/sfinae.hpp\\\"\\n#include <type_traits>\\n\\ntemplate <class type, template <class> class trait>\\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\\n\\ntemplate <class Container>\\nusing element_type = typename std::decay<decltype(\\n *std::begin(std::declval<Container&>()))>::type;\\n\\ntemplate <class T, class = int> struct mapped_of {\\n using type = element_type<T>;\\n};\\ntemplate <class T>\\nstruct mapped_of<T,\\n typename std::pair<int, typename T::mapped_type>::first_type> {\\n using type = typename T::mapped_type;\\n};\\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\\n\\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\\ntemplate <class T>\\nstruct is_integral_ext<\\n T, typename std::enable_if<std::is_integral<T>::value>::type>\\n : std::true_type {};\\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\\n#if __cplusplus >= 201402\\ntemplate <class T>\\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\\n#endif\\n\\ntemplate <typename T, typename = void> struct multiplicable_uint {\\n using type = uint_least32_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\\n using type = uint_least64_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\\n using type = __uint128_t;\\n};\\n#line 8 \\\"Library/utils/hash.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class = void> struct hash : std::hash<T> {};\\n#if __cplusplus >= 201703L\\ntemplate <class Unique_bits_type>\\nstruct hash<Unique_bits_type,\\n enable_if_trait_type<Unique_bits_type,\\n std::has_unique_object_representations>> {\\n size_t operator()(uint64_t x) const {\\n static const uint64_t m = std::random_device{}();\\n x ^= x >> 23;\\n x ^= m;\\n x ^= x >> 47;\\n return x - (x >> 32);\\n }\\n};\\n#endif\\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\\n return seed ^\\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\\n}\\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\\n size_t operator()(const std::pair<T1, T2> &pair) const {\\n return hash_combine(hash<T1>()(pair.first), pair.second);\\n }\\n};\\ntemplate <class... T> class hash<std::tuple<T...>> {\\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\\n struct tuple_hash {\\n static uint64_t apply(const Tuple &t) {\\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\\n std::get<index>(t));\\n }\\n };\\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\\n static uint64_t apply(const Tuple &t) { return 0; }\\n };\\n\\n public:\\n uint64_t operator()(const std::tuple<T...> &t) const {\\n return tuple_hash<std::tuple<T...>>::apply(t);\\n }\\n};\\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\\n using key_type = typename hash_table::key_type;\\n size_t count(const key_type &key) const {\\n return hash_table::find(key) != hash_table::end();\\n }\\n template <class... Args> auto emplace(Args &&... args) {\\n return hash_table::insert(typename hash_table::value_type(args...));\\n }\\n};\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing cc_hash_table =\\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing gp_hash_table =\\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped>\\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\\n} // namespace workspace\\n#line 2 \\\"Library/utils/make_vector.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <vector>\\nnamespace workspace {\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\\n if constexpr (N)\\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\\n else\\n return init;\\n}\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\\n return make_vector<T, N>((size_t*)sizes, init);\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/random_number_generator.hpp\\\"\\ntemplate <typename num_type> class random_number_generator {\\n typename std::conditional<std::is_integral<num_type>::value,\\n std::uniform_int_distribution<num_type>,\\n std::uniform_real_distribution<num_type>>::type\\n unif;\\n\\n std::mt19937 engine;\\n\\n public:\\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\\n num_type max = std::numeric_limits<num_type>::max())\\n : unif(min, max), engine(std::random_device{}()) {}\\n\\n num_type min() const { return unif.min(); }\\n\\n num_type max() const { return unif.max(); }\\n\\n // generate a random number in [min(), max()].\\n num_type operator()() { return unif(engine); }\\n};\\n#line 3 \\\"Library/utils/read.hpp\\\"\\nnamespace workspace {\\n// read with std::cin.\\ntemplate <class T = void>\\nstruct read\\n{\\n typename std::remove_const<T>::type value;\\n template <class... types>\\n read(types... args) : value(args...) { std::cin >> value; }\\n operator T() const { return value; }\\n};\\ntemplate <>\\nstruct read<void>\\n{\\n template <class T>\\n operator T() const { T value; std::cin >> value; return value; }\\n};\\n} // namespace workspace\\n#line 4 \\\"Library/utils/stream.hpp\\\"\\n\\n#line 6 \\\"Library/utils/stream.hpp\\\"\\nnamespace std {\\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ' ' << p.second;\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_is {\\n static istream &apply(istream &is, tuple_t &t) {\\n tuple_is<tuple_t, index - 1>::apply(is, t);\\n return is >> get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\\n static istream &apply(istream &is, tuple_t &t) { return is; }\\n};\\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\\n t);\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_os {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n tuple_os<tuple_t, index - 1>::apply(os, t);\\n return os << ' ' << get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n return os << get<0>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\\n};\\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\\n t);\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n istream &>::type\\noperator>>(istream &is, Container &cont) {\\n for (auto &&e : cont) is >> e;\\n return is;\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n ostream &>::type\\noperator<<(ostream &os, const Container &cont) {\\n bool head = true;\\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\\n return os;\\n}\\n} // namespace std\\n#line 4 \\\"Library/utils/trinary_search.hpp\\\"\\n// trinary search on discrete range.\\ntemplate <class iter_type, class comp_type>\\niter_type trinary(iter_type first, iter_type last, comp_type comp)\\n{\\n assert(first < last);\\n intmax_t dist(last - first);\\n while(dist > 2)\\n {\\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\\n else first = left, dist -= dist / 3;\\n }\\n if(dist > 1 && comp(first + 1, first)) ++first;\\n return first;\\n}\\n// trinary search on real numbers.\\ntemplate <class comp_type>\\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\\n{\\n assert(first < last);\\n while(last - first > eps)\\n {\\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\\n if(comp(left, right)) last = right;\\n else first = left;\\n }\\n return first;\\n}\\n#line 2 \\\"Library/utils/wrapper.hpp\\\"\\ntemplate <class Container> class reversed {\\n Container &ref, copy;\\n\\n public:\\n reversed(Container &ref) : ref(ref) {}\\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\\n auto begin() const { return ref.rbegin(); }\\n auto end() const { return ref.rend(); }\\n};\\n#line 9 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main();\\n}\\nint main() { config::loop(workspace::main); }\\n\\nunsigned config::cases() {\\n // return -1; // unspecified\\n // int t; std::cin >> t; return t; // given\\n return 1;\\n}\\n\\n#line 4 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n\\n#line 4 \\\"Library/graph/directed/flow/base.hpp\\\"\\n// the base class of flow algorithms.\\ntemplate <class cap_t, class cost_t> struct flow_base {\\n struct edge_t {\\n size_t src, dst;\\n cap_t cap;\\n cost_t cost;\\n edge_t *rev;\\n edge_t() = default;\\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\\n : src(src), dst(dst), cap(cap), rev(rev) {}\\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\\n edge_t *rev)\\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\\n }; // class edge_t\\n\\n class adj_type {\\n edge_t *fst, *lst, *clst;\\n\\n public:\\n template <class... Args> edge_t *emplace(Args &&... args) {\\n if (lst == clst) {\\n size_t len(clst - fst);\\n edge_t *nfst = lst = new edge_t[len << 1];\\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\\n p->rev->rev = lst, *lst = *p;\\n delete[] fst;\\n fst = nfst;\\n clst = lst + len;\\n }\\n *lst = edge_t(args...);\\n return lst++;\\n }\\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\\n ~adj_type() { delete[] fst; }\\n edge_t &operator[](size_t i) {\\n assert(i < size());\\n return *(fst + i);\\n }\\n size_t size() const { return lst - fst; }\\n edge_t *begin() const { return fst; }\\n edge_t *end() const { return lst; }\\n }; // class adj_type\\n\\n flow_base(size_t n = 0) : adjs(n) {}\\n\\n flow_base(const flow_base &other) : adjs(other.size()) {\\n for (size_t node{}; node != size(); ++node)\\n for (const auto &[src, dst, cap, cost, rev] : other[node])\\n if (src == node) {\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\\n rev->src = nil;\\n } else {\\n rev->rev->src = node;\\n }\\n }\\n\\n flow_base &operator=(const flow_base &rhs) {\\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\\n return *this;\\n }\\n\\n size_t size() const { return adjs.size(); }\\n\\n adj_type &operator[](size_t node) {\\n assert(node < size());\\n return adjs[node];\\n }\\n const adj_type &operator[](size_t node) const {\\n assert(node < size());\\n return adjs[node];\\n }\\n\\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) {\\n assert(src < size());\\n assert(dst < size());\\n assert(!(cap < static_cast<cap_t>(0)));\\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\\n return ptr;\\n }\\n\\n protected:\\n constexpr static size_t nil = -1;\\n std::vector<adj_type> adjs;\\n}; // class flow_base\\n#line 6 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n// Successive shortest paths algorithm.\\ntemplate <class cap_t, class cost_t, bool density_tag = false>\\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\\n using base = flow_base<cap_t, cost_t>;\\n using edge_t = typename base::edge_t;\\n using base::adjs;\\n using base::nil;\\n\\n cost_t min_cost, total_cost;\\n std::vector<cap_t> supp;\\n std::vector<cost_t> ptnl;\\n\\n void copy_member(const min_cost_flow &other) {\\n min_cost = other.min_cost;\\n total_cost = other.total_cost;\\n supp = other.supp;\\n ptnl = other.ptnl;\\n }\\n\\n void Dijkstra(std::vector<edge_t *> &last) {\\n const cost_t infty(total_cost + 1);\\n std::vector<cost_t> nptnl(size(), infty);\\n if constexpr (density_tag) {\\n // O(V^2)\\n std::vector<bool> used(size());\\n for (size_t src{}; src != size(); ++src) {\\n if (static_cast<cap_t>(0) < supp[src]) {\\n used[src] = true;\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\\n if (e.avbl() && e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n for (;;) {\\n size_t src{nil};\\n cost_t sp{infty};\\n for (size_t node{}; node != size(); ++node) {\\n if (used[node] || nptnl[node] == infty) continue;\\n cost_t dist{nptnl[node] - ptnl[node]};\\n if (dist < sp) {\\n sp = dist;\\n src = node;\\n }\\n }\\n if (src == nil) break;\\n used[src] = true;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = nptnl[src] + e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n } else {\\n // O((V + E)logV)\\n struct node_t {\\n size_t id;\\n cost_t dist;\\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\\n };\\n std::priority_queue<node_t> que;\\n for (size_t src{}; src != size(); ++src) {\\n if (supp[src] > static_cast<cap_t>(0)) {\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\\n if (e.avbl() && nptnl[e.dst] > e.cost) {\\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n while (!que.empty()) {\\n auto [src, ndist] = que.top();\\n que.pop();\\n if (ndist + ptnl[src] != nptnl[src]) continue;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\\n que.emplace(e.dst,\\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n ptnl.swap(nptnl);\\n }\\n\\n public:\\n using base::size;\\n\\n min_cost_flow(size_t n = 0)\\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\\n\\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\\n copy_member(other);\\n }\\n\\n min_cost_flow &operator=(const min_cost_flow &other) {\\n base::operator=(other);\\n copy_member(other);\\n return *this;\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) override {\\n assert(src != dst);\\n if (cost < static_cast<cost_t>(0)) {\\n supp[src] -= cap;\\n supp[dst] += cap;\\n min_cost += cap * cost;\\n total_cost -= cap * cost;\\n return base::add_edge(dst, src, cap, -cost);\\n }\\n total_cost += cap * cost;\\n return base::add_edge(src, dst, cap, cost);\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\\n const cap_t &upper, const cost_t &cost) {\\n assert(!(upper < lower));\\n supp[src] -= lower;\\n supp[dst] += lower;\\n min_cost += lower * cost;\\n return add_edge(src, dst, upper - lower, cost);\\n }\\n\\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\\n assert(node < size());\\n return supp[node] += vol;\\n }\\n\\n const cap_t &demand(size_t node, const cap_t &vol) {\\n return supply(node, -vol);\\n }\\n\\n bool flow() {\\n for (bool aug = true; aug;) {\\n aug = false;\\n std::vector<edge_t *> last(size());\\n Dijkstra(last);\\n std::vector<bool> shut(size());\\n for (size_t dst{}; dst != size(); ++dst) {\\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\\n cap_t resid{-supp[dst]};\\n size_t src{dst}, block{nil};\\n while (last[src] && !shut[src]) {\\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\\n src = last[src]->src;\\n }\\n if (shut[src])\\n block = src;\\n else {\\n if (!(resid < supp[src])) {\\n resid = supp[src];\\n block = src;\\n }\\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\\n e->cap -= resid;\\n e->rev->cap += resid;\\n }\\n supp[src] -= resid;\\n supp[dst] += resid;\\n min_cost += ptnl[dst] * resid;\\n aug = true;\\n }\\n if (~block) {\\n for (size_t node{dst};; node = last[node]->src) {\\n shut[node] = true;\\n if (node == block) break;\\n }\\n }\\n }\\n }\\n }\\n return std::none_of(begin(supp), end(supp),\\n [](const cap_t &s) { return s < 0 || 0 < s; });\\n }\\n\\n cost_t optimal() {\\n assert(flow());\\n return min_cost;\\n }\\n}; // class min_cost_flow\\n#line 22 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main() {\\n // start here!\\n const i64 inf = 1e10;\\n int n, m, x;\\n cin >> n >> m >> x;\\n\\n min_cost_flow<i64, i64> base(n * 3);\\n // make\\n {\\n for (int i = 0; i < n; i++) {\\n int a, b, p;\\n cin >> a >> b >> p;\\n base.add_edge(3 * i + 1, 3 * i, inf, p);\\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\\n base.supply(3 * i, -a);\\n base.supply(3 * i + 1, a - b);\\n base.supply(3 * i + 2, b);\\n }\\n }\\n for (auto j = 0; j < m; ++j) {\\n int u, v, f;\\n cin >> u >> v >> f;\\n --u, --v;\\n if (f > 0) {\\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\\n } else {\\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\\n }\\n }\\n\\n auto ok = [&](int t) -> bool {\\n auto mcf = base;\\n for (int i = 0; i < n; i++) {\\n mcf.add_edge(3 * i + 2, 0, inf, t);\\n }\\n if (mcf.flow()) {\\n auto opt = mcf.optimal();\\n return opt >= x;\\n }\\n return false;\\n };\\n\\n auto ans = binary_search(x + 100 * (m + n) + 1, -1, ok);\\n if (ans > x + 100 * (m + n))\\n cout << \\\"-1\\\\n\\\";\\n else\\n cout << ans << eol;\\n}\\n}\",\n \"accuracy\": 0.4222222222222222,\n \"time_ms\": 40,\n \"memory_kb\": 3604,\n \"score_of_the_acc\": -0.6216,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3171_4886068\",\n \"code_snippet\": \"#line 1 \\\"other/h.cpp\\\"\\n#include <bits/extc++.h>\\n#if __has_include(<bit>)\\n#include <bit>\\n#endif\\n#line 7 \\\"Library/alias.hpp\\\"\\nnamespace workspace {\\nconstexpr char eol = '\\\\n';\\nusing namespace std;\\nusing i32 = int_least32_t;\\nusing i64 = int_least64_t;\\nusing i128 = __int128_t;\\nusing u32 = uint_least32_t;\\nusing u64 = uint_least64_t;\\nusing u128 = __uint128_t;\\ntemplate <class T, class Comp = less<T>>\\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\\ntemplate <class T> using stack = std::stack<T, vector<T>>;\\n} // namespace workspace\\n#line 5 \\\"Library/config.hpp\\\"\\nnamespace config {\\nconst auto start_time{std::chrono::system_clock::now()};\\nint64_t elapsed() {\\n using namespace std::chrono;\\n const auto end_time{system_clock::now()};\\n return duration_cast<milliseconds>(end_time - start_time).count();\\n}\\n__attribute__((constructor)) void setup() {\\n using namespace std;\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n#ifdef _buffer_check\\n atexit([] {\\n char bufc;\\n if (cin >> bufc)\\n cerr << \\\"\\\\n\\\\033[43m\\\\033[30mwarning: buffer not empty.\\\\033[0m\\\\n\\\\n\\\";\\n });\\n#endif\\n}\\nunsigned cases(), caseid = 1;\\ntemplate <class F> void loop(F main) {\\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\\n}\\n} // namespace config\\n#line 2 \\\"Library/option.hpp\\\"\\n#ifdef ONLINE_JUDGE\\n #pragma GCC optimize(\\\"O3\\\")\\n #pragma GCC target(\\\"avx,avx2\\\")\\n #pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#line 2 \\\"Library/utils/binary_search.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <cassert>\\n#include <cmath>\\n#include <vector>\\nnamespace workspace {\\n// binary search on a discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\\n iter_type>\\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\\n assert(ok != ng);\\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\\n while (1 < dist || dist < -1) {\\n iter_type mid(ok + dist / 2);\\n if (pred(mid))\\n ok = mid, dist -= dist / 2;\\n else\\n ng = mid, dist /= 2;\\n }\\n return ok;\\n}\\n// parallel binary search on each discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\\n std::vector<bool>>,\\n std::vector<iter_type>>\\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\\n pred_type pred) {\\n std::vector<iter_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n iter_type mid(ok + (ng - ok) / 2);\\n if (mids[i] != mid) {\\n all_found = false;\\n mids[i] = mid;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n// binary search on a real number interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\\n real_type>\\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\\n assert(ok != ng);\\n while (ok + eps < ng || ng + eps < ok) {\\n real_type mid{(ok + ng) / 2};\\n (pred(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n// parallel binary search on each real interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<real_type>>,\\n std::vector<bool>>,\\n std::vector<real_type>>\\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\\n const real_type eps, pred_type pred) {\\n std::vector<real_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n if (ok + eps < ng || ng + eps < ok) {\\n all_found = false;\\n mids[i] = (ok + ng) / 2;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/casefmt.hpp\\\"\\nnamespace workspace {\\nstd::ostream &casefmt(std::ostream& os) { return os << \\\"Case #\\\" << config::caseid << \\\": \\\"; }\\n} // namespace workspace\\n#line 3 \\\"Library/utils/chval.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class Comp = std::less<T>>\\nbool chle(T &x, const T &y, Comp comp = Comp()) {\\n return comp(y, x) ? x = y, true : false;\\n}\\ntemplate <class T, class Comp = std::less<T>>\\nbool chge(T &x, const T &y, Comp comp = Comp()) {\\n return comp(x, y) ? x = y, true : false;\\n}\\n} // namespace workspace\\n#line 5 \\\"Library/utils/coordinate_compression.hpp\\\"\\n\\ntemplate <class T> class coordinate_compression {\\n std::vector<T> uniquely;\\n std::vector<size_t> compressed;\\n\\n public:\\n coordinate_compression(const std::vector<T> &raw)\\n : uniquely(raw), compressed(raw.size()) {\\n std::sort(uniquely.begin(), uniquely.end());\\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\\n uniquely.end());\\n for (size_t i = 0; i != size(); ++i)\\n compressed[i] =\\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\\n uniquely.begin();\\n }\\n\\n size_t operator[](const size_t idx) const {\\n assert(idx < size());\\n return compressed[idx];\\n }\\n\\n size_t size() const { return compressed.size(); }\\n\\n size_t count() const { return uniquely.size(); }\\n\\n T value(const size_t ord) const {\\n assert(ord < count());\\n return uniquely[ord];\\n }\\n\\n size_t order(const T &value) const {\\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\\n uniquely.begin();\\n }\\n\\n auto begin() { return compressed.begin(); }\\n auto end() { return compressed.end(); }\\n auto rbegin() { return compressed.rbegin(); }\\n auto rend() { return compressed.rend(); }\\n};\\n#line 3 \\\"Library/utils/fixed_point.hpp\\\"\\nnamespace workspace {\\n// specify the return type of lambda.\\ntemplate <class lambda_type> class fixed_point {\\n lambda_type func;\\n\\n public:\\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\\n template <class... Args> auto operator()(Args &&... args) const {\\n return func(*this, std::forward<Args>(args)...);\\n }\\n};\\n} // namespace workspace\\n#line 6 \\\"Library/utils/hash.hpp\\\"\\n\\n#line 3 \\\"Library/utils/sfinae.hpp\\\"\\n#include <type_traits>\\n\\ntemplate <class type, template <class> class trait>\\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\\n\\ntemplate <class Container>\\nusing element_type = typename std::decay<decltype(\\n *std::begin(std::declval<Container&>()))>::type;\\n\\ntemplate <class T, class = int> struct mapped_of {\\n using type = element_type<T>;\\n};\\ntemplate <class T>\\nstruct mapped_of<T,\\n typename std::pair<int, typename T::mapped_type>::first_type> {\\n using type = typename T::mapped_type;\\n};\\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\\n\\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\\ntemplate <class T>\\nstruct is_integral_ext<\\n T, typename std::enable_if<std::is_integral<T>::value>::type>\\n : std::true_type {};\\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\\n#if __cplusplus >= 201402\\ntemplate <class T>\\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\\n#endif\\n\\ntemplate <typename T, typename = void> struct multiplicable_uint {\\n using type = uint_least32_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\\n using type = uint_least64_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\\n using type = __uint128_t;\\n};\\n#line 8 \\\"Library/utils/hash.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class = void> struct hash : std::hash<T> {};\\n#if __cplusplus >= 201703L\\ntemplate <class Unique_bits_type>\\nstruct hash<Unique_bits_type,\\n enable_if_trait_type<Unique_bits_type,\\n std::has_unique_object_representations>> {\\n size_t operator()(uint64_t x) const {\\n static const uint64_t m = std::random_device{}();\\n x ^= x >> 23;\\n x ^= m;\\n x ^= x >> 47;\\n return x - (x >> 32);\\n }\\n};\\n#endif\\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\\n return seed ^\\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\\n}\\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\\n size_t operator()(const std::pair<T1, T2> &pair) const {\\n return hash_combine(hash<T1>()(pair.first), pair.second);\\n }\\n};\\ntemplate <class... T> class hash<std::tuple<T...>> {\\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\\n struct tuple_hash {\\n static uint64_t apply(const Tuple &t) {\\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\\n std::get<index>(t));\\n }\\n };\\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\\n static uint64_t apply(const Tuple &t) { return 0; }\\n };\\n\\n public:\\n uint64_t operator()(const std::tuple<T...> &t) const {\\n return tuple_hash<std::tuple<T...>>::apply(t);\\n }\\n};\\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\\n using key_type = typename hash_table::key_type;\\n size_t count(const key_type &key) const {\\n return hash_table::find(key) != hash_table::end();\\n }\\n template <class... Args> auto emplace(Args &&... args) {\\n return hash_table::insert(typename hash_table::value_type(args...));\\n }\\n};\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing cc_hash_table =\\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing gp_hash_table =\\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped>\\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\\n} // namespace workspace\\n#line 2 \\\"Library/utils/make_vector.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <vector>\\nnamespace workspace {\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\\n if constexpr (N)\\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\\n else\\n return init;\\n}\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\\n return make_vector<T, N>((size_t*)sizes, init);\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/random_number_generator.hpp\\\"\\ntemplate <typename num_type> class random_number_generator {\\n typename std::conditional<std::is_integral<num_type>::value,\\n std::uniform_int_distribution<num_type>,\\n std::uniform_real_distribution<num_type>>::type\\n unif;\\n\\n std::mt19937 engine;\\n\\n public:\\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\\n num_type max = std::numeric_limits<num_type>::max())\\n : unif(min, max), engine(std::random_device{}()) {}\\n\\n num_type min() const { return unif.min(); }\\n\\n num_type max() const { return unif.max(); }\\n\\n // generate a random number in [min(), max()].\\n num_type operator()() { return unif(engine); }\\n};\\n#line 3 \\\"Library/utils/read.hpp\\\"\\nnamespace workspace {\\n// read with std::cin.\\ntemplate <class T = void>\\nstruct read\\n{\\n typename std::remove_const<T>::type value;\\n template <class... types>\\n read(types... args) : value(args...) { std::cin >> value; }\\n operator T() const { return value; }\\n};\\ntemplate <>\\nstruct read<void>\\n{\\n template <class T>\\n operator T() const { T value; std::cin >> value; return value; }\\n};\\n} // namespace workspace\\n#line 4 \\\"Library/utils/stream.hpp\\\"\\n\\n#line 6 \\\"Library/utils/stream.hpp\\\"\\nnamespace std {\\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ' ' << p.second;\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_is {\\n static istream &apply(istream &is, tuple_t &t) {\\n tuple_is<tuple_t, index - 1>::apply(is, t);\\n return is >> get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\\n static istream &apply(istream &is, tuple_t &t) { return is; }\\n};\\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\\n t);\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_os {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n tuple_os<tuple_t, index - 1>::apply(os, t);\\n return os << ' ' << get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n return os << get<0>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\\n};\\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\\n t);\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n istream &>::type\\noperator>>(istream &is, Container &cont) {\\n for (auto &&e : cont) is >> e;\\n return is;\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n ostream &>::type\\noperator<<(ostream &os, const Container &cont) {\\n bool head = true;\\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\\n return os;\\n}\\n} // namespace std\\n#line 4 \\\"Library/utils/trinary_search.hpp\\\"\\n// trinary search on discrete range.\\ntemplate <class iter_type, class comp_type>\\niter_type trinary(iter_type first, iter_type last, comp_type comp)\\n{\\n assert(first < last);\\n intmax_t dist(last - first);\\n while(dist > 2)\\n {\\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\\n else first = left, dist -= dist / 3;\\n }\\n if(dist > 1 && comp(first + 1, first)) ++first;\\n return first;\\n}\\n// trinary search on real numbers.\\ntemplate <class comp_type>\\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\\n{\\n assert(first < last);\\n while(last - first > eps)\\n {\\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\\n if(comp(left, right)) last = right;\\n else first = left;\\n }\\n return first;\\n}\\n#line 2 \\\"Library/utils/wrapper.hpp\\\"\\ntemplate <class Container> class reversed {\\n Container &ref, copy;\\n\\n public:\\n reversed(Container &ref) : ref(ref) {}\\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\\n auto begin() const { return ref.rbegin(); }\\n auto end() const { return ref.rend(); }\\n};\\n#line 9 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main();\\n}\\nint main() { config::loop(workspace::main); }\\n\\nunsigned config::cases() {\\n // return -1; // unspecified\\n // int t; std::cin >> t; return t; // given\\n return 1;\\n}\\n\\n#line 4 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n\\n#line 4 \\\"Library/graph/directed/flow/base.hpp\\\"\\n// the base class of flow algorithms.\\ntemplate <class cap_t, class cost_t> struct flow_base {\\n struct edge_t {\\n size_t src, dst;\\n cap_t cap;\\n cost_t cost;\\n edge_t *rev;\\n edge_t() = default;\\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\\n : src(src), dst(dst), cap(cap), rev(rev) {}\\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\\n edge_t *rev)\\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\\n }; // class edge_t\\n\\n class adj_type {\\n edge_t *fst, *lst, *clst;\\n\\n public:\\n template <class... Args> edge_t *emplace(Args &&... args) {\\n if (lst == clst) {\\n size_t len(clst - fst);\\n edge_t *nfst = lst = new edge_t[len << 1];\\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\\n p->rev->rev = lst, *lst = *p;\\n delete[] fst;\\n fst = nfst;\\n clst = lst + len;\\n }\\n *lst = edge_t(args...);\\n return lst++;\\n }\\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\\n ~adj_type() { delete[] fst; }\\n edge_t &operator[](size_t i) {\\n assert(i < size());\\n return *(fst + i);\\n }\\n size_t size() const { return lst - fst; }\\n edge_t *begin() const { return fst; }\\n edge_t *end() const { return lst; }\\n }; // class adj_type\\n\\n flow_base(size_t n = 0) : adjs(n) {}\\n\\n flow_base(const flow_base &other) : adjs(other.size()) {\\n for (size_t node{}; node != size(); ++node)\\n for (const auto &[src, dst, cap, cost, rev] : other[node])\\n if (src == node) {\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\\n rev->src = nil;\\n } else {\\n rev->rev->src = node;\\n }\\n }\\n\\n flow_base &operator=(const flow_base &rhs) {\\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\\n return *this;\\n }\\n\\n size_t size() const { return adjs.size(); }\\n\\n adj_type &operator[](size_t node) {\\n assert(node < size());\\n return adjs[node];\\n }\\n const adj_type &operator[](size_t node) const {\\n assert(node < size());\\n return adjs[node];\\n }\\n\\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) {\\n assert(src < size());\\n assert(dst < size());\\n assert(!(cap < static_cast<cap_t>(0)));\\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\\n return ptr;\\n }\\n\\n protected:\\n constexpr static size_t nil = -1;\\n std::vector<adj_type> adjs;\\n}; // class flow_base\\n#line 6 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n// Successive shortest paths algorithm.\\ntemplate <class cap_t, class cost_t, bool density_tag = false>\\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\\n using base = flow_base<cap_t, cost_t>;\\n using edge_t = typename base::edge_t;\\n using base::adjs;\\n using base::nil;\\n\\n cost_t min_cost, total_cost;\\n std::vector<cap_t> supp;\\n std::vector<cost_t> ptnl;\\n\\n void copy_member(const min_cost_flow &other) {\\n min_cost = other.min_cost;\\n total_cost = other.total_cost;\\n supp = other.supp;\\n ptnl = other.ptnl;\\n }\\n\\n void Dijkstra(std::vector<edge_t *> &last) {\\n const cost_t infty(total_cost + 1);\\n std::vector<cost_t> nptnl(size(), infty);\\n if constexpr (density_tag) {\\n // O(V^2)\\n std::vector<bool> used(size());\\n for (size_t src{}; src != size(); ++src) {\\n if (static_cast<cap_t>(0) < supp[src]) {\\n used[src] = true;\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\\n if (e.avbl() && e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n for (;;) {\\n size_t src{nil};\\n cost_t sp{infty};\\n for (size_t node{}; node != size(); ++node) {\\n if (used[node] || nptnl[node] == infty) continue;\\n cost_t dist{nptnl[node] - ptnl[node]};\\n if (dist < sp) {\\n sp = dist;\\n src = node;\\n }\\n }\\n if (src == nil) break;\\n used[src] = true;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = nptnl[src] + e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n } else {\\n // O((V + E)logV)\\n struct node_t {\\n size_t id;\\n cost_t dist;\\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\\n };\\n std::priority_queue<node_t> que;\\n for (size_t src{}; src != size(); ++src) {\\n if (supp[src] > static_cast<cap_t>(0)) {\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\\n if (e.avbl() && nptnl[e.dst] > e.cost) {\\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n while (!que.empty()) {\\n auto [src, ndist] = que.top();\\n que.pop();\\n if (ndist + ptnl[src] != nptnl[src]) continue;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\\n que.emplace(e.dst,\\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n ptnl.swap(nptnl);\\n }\\n\\n public:\\n using base::size;\\n\\n min_cost_flow(size_t n = 0)\\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\\n\\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\\n copy_member(other);\\n }\\n\\n min_cost_flow &operator=(const min_cost_flow &other) {\\n base::operator=(other);\\n copy_member(other);\\n return *this;\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) override {\\n assert(src != dst);\\n if (cost < static_cast<cost_t>(0)) {\\n supp[src] -= cap;\\n supp[dst] += cap;\\n min_cost += cap * cost;\\n total_cost -= cap * cost;\\n return base::add_edge(dst, src, cap, -cost);\\n }\\n total_cost += cap * cost;\\n return base::add_edge(src, dst, cap, cost);\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\\n const cap_t &upper, const cost_t &cost) {\\n assert(!(upper < lower));\\n supp[src] -= lower;\\n supp[dst] += lower;\\n min_cost += lower * cost;\\n return add_edge(src, dst, upper - lower, cost);\\n }\\n\\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\\n assert(node < size());\\n return supp[node] += vol;\\n }\\n\\n const cap_t &demand(size_t node, const cap_t &vol) {\\n return supply(node, -vol);\\n }\\n\\n bool flow() {\\n for (bool aug = true; aug;) {\\n aug = false;\\n std::vector<edge_t *> last(size());\\n Dijkstra(last);\\n std::vector<bool> shut(size());\\n for (size_t dst{}; dst != size(); ++dst) {\\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\\n cap_t resid{-supp[dst]};\\n size_t src{dst}, block{nil};\\n while (last[src] && !shut[src]) {\\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\\n src = last[src]->src;\\n }\\n if (shut[src])\\n block = src;\\n else {\\n if (!(resid < supp[src])) {\\n resid = supp[src];\\n block = src;\\n }\\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\\n e->cap -= resid;\\n e->rev->cap += resid;\\n }\\n supp[src] -= resid;\\n supp[dst] += resid;\\n min_cost += ptnl[dst] * resid;\\n aug = true;\\n }\\n if (~block) {\\n for (size_t node{dst};; node = last[node]->src) {\\n shut[node] = true;\\n if (node == block) break;\\n }\\n }\\n }\\n }\\n }\\n return std::none_of(begin(supp), end(supp),\\n [](const cap_t &s) { return s < 0 || 0 < s; });\\n }\\n\\n cost_t optimal() {\\n assert(flow());\\n return min_cost;\\n }\\n}; // class min_cost_flow\\n#line 22 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main() {\\n // start here!\\n const i64 inf = 1e10;\\n int n, m, x;\\n cin >> n >> m >> x;\\n\\n min_cost_flow<i64, i64> base(n * 3);\\n // make\\n {\\n for (int i = 0; i < n; i++) {\\n int a, b, p;\\n cin >> a >> b >> p;\\n base.add_edge(3 * i + 1, 3 * i, inf, p);\\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\\n base.supply(3 * i, -a);\\n base.supply(3 * i + 1, a - b);\\n base.supply(3 * i + 2, b);\\n }\\n }\\n for (auto j = 0; j < m; ++j) {\\n int u, v, f;\\n cin >> u >> v >> f;\\n --u, --v;\\n if (f > 0) {\\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\\n } else {\\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\\n }\\n }\\n\\n auto ok = [&](int t) -> bool {\\n auto mcf = base;\\n for (int i = 0; i < n; i++) {\\n mcf.add_edge(3 * i + 2, 0, inf, t);\\n }\\n if (mcf.flow()) {\\n auto opt = mcf.optimal();\\n return opt >= x;\\n }\\n return false;\\n };\\n\\n auto ans = binary_search(x + 100 * n + 1, -1, ok);\\n if (ans > x + 100 * n)\\n cout << \\\"-1\\\\n\\\";\\n else\\n cout << ans << eol;\\n}\\n}\",\n \"accuracy\": 0.4222222222222222,\n \"time_ms\": 40,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.5805,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3171_4886065\",\n \"code_snippet\": \"#line 1 \\\"other/h.cpp\\\"\\n#include <bits/extc++.h>\\n#if __has_include(<bit>)\\n#include <bit>\\n#endif\\n#line 7 \\\"Library/alias.hpp\\\"\\nnamespace workspace {\\nconstexpr char eol = '\\\\n';\\nusing namespace std;\\nusing i32 = int_least32_t;\\nusing i64 = int_least64_t;\\nusing i128 = __int128_t;\\nusing u32 = uint_least32_t;\\nusing u64 = uint_least64_t;\\nusing u128 = __uint128_t;\\ntemplate <class T, class Comp = less<T>>\\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\\ntemplate <class T> using stack = std::stack<T, vector<T>>;\\n} // namespace workspace\\n#line 5 \\\"Library/config.hpp\\\"\\nnamespace config {\\nconst auto start_time{std::chrono::system_clock::now()};\\nint64_t elapsed() {\\n using namespace std::chrono;\\n const auto end_time{system_clock::now()};\\n return duration_cast<milliseconds>(end_time - start_time).count();\\n}\\n__attribute__((constructor)) void setup() {\\n using namespace std;\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n#ifdef _buffer_check\\n atexit([] {\\n char bufc;\\n if (cin >> bufc)\\n cerr << \\\"\\\\n\\\\033[43m\\\\033[30mwarning: buffer not empty.\\\\033[0m\\\\n\\\\n\\\";\\n });\\n#endif\\n}\\nunsigned cases(), caseid = 1;\\ntemplate <class F> void loop(F main) {\\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\\n}\\n} // namespace config\\n#line 2 \\\"Library/option.hpp\\\"\\n#ifdef ONLINE_JUDGE\\n #pragma GCC optimize(\\\"O3\\\")\\n #pragma GCC target(\\\"avx,avx2\\\")\\n #pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#line 2 \\\"Library/utils/binary_search.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <cassert>\\n#include <cmath>\\n#include <vector>\\nnamespace workspace {\\n// binary search on a discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\\n iter_type>\\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\\n assert(ok != ng);\\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\\n while (1 < dist || dist < -1) {\\n iter_type mid(ok + dist / 2);\\n if (pred(mid))\\n ok = mid, dist -= dist / 2;\\n else\\n ng = mid, dist /= 2;\\n }\\n return ok;\\n}\\n// parallel binary search on each discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\\n std::vector<bool>>,\\n std::vector<iter_type>>\\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\\n pred_type pred) {\\n std::vector<iter_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n iter_type mid(ok + (ng - ok) / 2);\\n if (mids[i] != mid) {\\n all_found = false;\\n mids[i] = mid;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n// binary search on a real number interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\\n real_type>\\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\\n assert(ok != ng);\\n while (ok + eps < ng || ng + eps < ok) {\\n real_type mid{(ok + ng) / 2};\\n (pred(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n// parallel binary search on each real interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<real_type>>,\\n std::vector<bool>>,\\n std::vector<real_type>>\\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\\n const real_type eps, pred_type pred) {\\n std::vector<real_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n if (ok + eps < ng || ng + eps < ok) {\\n all_found = false;\\n mids[i] = (ok + ng) / 2;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/casefmt.hpp\\\"\\nnamespace workspace {\\nstd::ostream &casefmt(std::ostream& os) { return os << \\\"Case #\\\" << config::caseid << \\\": \\\"; }\\n} // namespace workspace\\n#line 3 \\\"Library/utils/chval.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class Comp = std::less<T>>\\nbool chle(T &x, const T &y, Comp comp = Comp()) {\\n return comp(y, x) ? x = y, true : false;\\n}\\ntemplate <class T, class Comp = std::less<T>>\\nbool chge(T &x, const T &y, Comp comp = Comp()) {\\n return comp(x, y) ? x = y, true : false;\\n}\\n} // namespace workspace\\n#line 5 \\\"Library/utils/coordinate_compression.hpp\\\"\\n\\ntemplate <class T> class coordinate_compression {\\n std::vector<T> uniquely;\\n std::vector<size_t> compressed;\\n\\n public:\\n coordinate_compression(const std::vector<T> &raw)\\n : uniquely(raw), compressed(raw.size()) {\\n std::sort(uniquely.begin(), uniquely.end());\\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\\n uniquely.end());\\n for (size_t i = 0; i != size(); ++i)\\n compressed[i] =\\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\\n uniquely.begin();\\n }\\n\\n size_t operator[](const size_t idx) const {\\n assert(idx < size());\\n return compressed[idx];\\n }\\n\\n size_t size() const { return compressed.size(); }\\n\\n size_t count() const { return uniquely.size(); }\\n\\n T value(const size_t ord) const {\\n assert(ord < count());\\n return uniquely[ord];\\n }\\n\\n size_t order(const T &value) const {\\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\\n uniquely.begin();\\n }\\n\\n auto begin() { return compressed.begin(); }\\n auto end() { return compressed.end(); }\\n auto rbegin() { return compressed.rbegin(); }\\n auto rend() { return compressed.rend(); }\\n};\\n#line 3 \\\"Library/utils/fixed_point.hpp\\\"\\nnamespace workspace {\\n// specify the return type of lambda.\\ntemplate <class lambda_type> class fixed_point {\\n lambda_type func;\\n\\n public:\\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\\n template <class... Args> auto operator()(Args &&... args) const {\\n return func(*this, std::forward<Args>(args)...);\\n }\\n};\\n} // namespace workspace\\n#line 6 \\\"Library/utils/hash.hpp\\\"\\n\\n#line 3 \\\"Library/utils/sfinae.hpp\\\"\\n#include <type_traits>\\n\\ntemplate <class type, template <class> class trait>\\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\\n\\ntemplate <class Container>\\nusing element_type = typename std::decay<decltype(\\n *std::begin(std::declval<Container&>()))>::type;\\n\\ntemplate <class T, class = int> struct mapped_of {\\n using type = element_type<T>;\\n};\\ntemplate <class T>\\nstruct mapped_of<T,\\n typename std::pair<int, typename T::mapped_type>::first_type> {\\n using type = typename T::mapped_type;\\n};\\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\\n\\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\\ntemplate <class T>\\nstruct is_integral_ext<\\n T, typename std::enable_if<std::is_integral<T>::value>::type>\\n : std::true_type {};\\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\\n#if __cplusplus >= 201402\\ntemplate <class T>\\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\\n#endif\\n\\ntemplate <typename T, typename = void> struct multiplicable_uint {\\n using type = uint_least32_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\\n using type = uint_least64_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\\n using type = __uint128_t;\\n};\\n#line 8 \\\"Library/utils/hash.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class = void> struct hash : std::hash<T> {};\\n#if __cplusplus >= 201703L\\ntemplate <class Unique_bits_type>\\nstruct hash<Unique_bits_type,\\n enable_if_trait_type<Unique_bits_type,\\n std::has_unique_object_representations>> {\\n size_t operator()(uint64_t x) const {\\n static const uint64_t m = std::random_device{}();\\n x ^= x >> 23;\\n x ^= m;\\n x ^= x >> 47;\\n return x - (x >> 32);\\n }\\n};\\n#endif\\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\\n return seed ^\\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\\n}\\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\\n size_t operator()(const std::pair<T1, T2> &pair) const {\\n return hash_combine(hash<T1>()(pair.first), pair.second);\\n }\\n};\\ntemplate <class... T> class hash<std::tuple<T...>> {\\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\\n struct tuple_hash {\\n static uint64_t apply(const Tuple &t) {\\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\\n std::get<index>(t));\\n }\\n };\\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\\n static uint64_t apply(const Tuple &t) { return 0; }\\n };\\n\\n public:\\n uint64_t operator()(const std::tuple<T...> &t) const {\\n return tuple_hash<std::tuple<T...>>::apply(t);\\n }\\n};\\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\\n using key_type = typename hash_table::key_type;\\n size_t count(const key_type &key) const {\\n return hash_table::find(key) != hash_table::end();\\n }\\n template <class... Args> auto emplace(Args &&... args) {\\n return hash_table::insert(typename hash_table::value_type(args...));\\n }\\n};\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing cc_hash_table =\\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing gp_hash_table =\\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped>\\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\\n} // namespace workspace\\n#line 2 \\\"Library/utils/make_vector.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <vector>\\nnamespace workspace {\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\\n if constexpr (N)\\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\\n else\\n return init;\\n}\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\\n return make_vector<T, N>((size_t*)sizes, init);\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/random_number_generator.hpp\\\"\\ntemplate <typename num_type> class random_number_generator {\\n typename std::conditional<std::is_integral<num_type>::value,\\n std::uniform_int_distribution<num_type>,\\n std::uniform_real_distribution<num_type>>::type\\n unif;\\n\\n std::mt19937 engine;\\n\\n public:\\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\\n num_type max = std::numeric_limits<num_type>::max())\\n : unif(min, max), engine(std::random_device{}()) {}\\n\\n num_type min() const { return unif.min(); }\\n\\n num_type max() const { return unif.max(); }\\n\\n // generate a random number in [min(), max()].\\n num_type operator()() { return unif(engine); }\\n};\\n#line 3 \\\"Library/utils/read.hpp\\\"\\nnamespace workspace {\\n// read with std::cin.\\ntemplate <class T = void>\\nstruct read\\n{\\n typename std::remove_const<T>::type value;\\n template <class... types>\\n read(types... args) : value(args...) { std::cin >> value; }\\n operator T() const { return value; }\\n};\\ntemplate <>\\nstruct read<void>\\n{\\n template <class T>\\n operator T() const { T value; std::cin >> value; return value; }\\n};\\n} // namespace workspace\\n#line 4 \\\"Library/utils/stream.hpp\\\"\\n\\n#line 6 \\\"Library/utils/stream.hpp\\\"\\nnamespace std {\\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ' ' << p.second;\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_is {\\n static istream &apply(istream &is, tuple_t &t) {\\n tuple_is<tuple_t, index - 1>::apply(is, t);\\n return is >> get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\\n static istream &apply(istream &is, tuple_t &t) { return is; }\\n};\\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\\n t);\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_os {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n tuple_os<tuple_t, index - 1>::apply(os, t);\\n return os << ' ' << get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n return os << get<0>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\\n};\\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\\n t);\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n istream &>::type\\noperator>>(istream &is, Container &cont) {\\n for (auto &&e : cont) is >> e;\\n return is;\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n ostream &>::type\\noperator<<(ostream &os, const Container &cont) {\\n bool head = true;\\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\\n return os;\\n}\\n} // namespace std\\n#line 4 \\\"Library/utils/trinary_search.hpp\\\"\\n// trinary search on discrete range.\\ntemplate <class iter_type, class comp_type>\\niter_type trinary(iter_type first, iter_type last, comp_type comp)\\n{\\n assert(first < last);\\n intmax_t dist(last - first);\\n while(dist > 2)\\n {\\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\\n else first = left, dist -= dist / 3;\\n }\\n if(dist > 1 && comp(first + 1, first)) ++first;\\n return first;\\n}\\n// trinary search on real numbers.\\ntemplate <class comp_type>\\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\\n{\\n assert(first < last);\\n while(last - first > eps)\\n {\\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\\n if(comp(left, right)) last = right;\\n else first = left;\\n }\\n return first;\\n}\\n#line 2 \\\"Library/utils/wrapper.hpp\\\"\\ntemplate <class Container> class reversed {\\n Container &ref, copy;\\n\\n public:\\n reversed(Container &ref) : ref(ref) {}\\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\\n auto begin() const { return ref.rbegin(); }\\n auto end() const { return ref.rend(); }\\n};\\n#line 9 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main();\\n}\\nint main() { config::loop(workspace::main); }\\n\\nunsigned config::cases() {\\n // return -1; // unspecified\\n // int t; std::cin >> t; return t; // given\\n return 1;\\n}\\n\\n#line 4 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n\\n#line 4 \\\"Library/graph/directed/flow/base.hpp\\\"\\n// the base class of flow algorithms.\\ntemplate <class cap_t, class cost_t> struct flow_base {\\n struct edge_t {\\n size_t src, dst;\\n cap_t cap;\\n cost_t cost;\\n edge_t *rev;\\n edge_t() = default;\\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\\n : src(src), dst(dst), cap(cap), rev(rev) {}\\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\\n edge_t *rev)\\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\\n }; // class edge_t\\n\\n class adj_type {\\n edge_t *fst, *lst, *clst;\\n\\n public:\\n template <class... Args> edge_t *emplace(Args &&... args) {\\n if (lst == clst) {\\n size_t len(clst - fst);\\n edge_t *nfst = lst = new edge_t[len << 1];\\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\\n p->rev->rev = lst, *lst = *p;\\n delete[] fst;\\n fst = nfst;\\n clst = lst + len;\\n }\\n *lst = edge_t(args...);\\n return lst++;\\n }\\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\\n ~adj_type() { delete[] fst; }\\n edge_t &operator[](size_t i) {\\n assert(i < size());\\n return *(fst + i);\\n }\\n size_t size() const { return lst - fst; }\\n edge_t *begin() const { return fst; }\\n edge_t *end() const { return lst; }\\n }; // class adj_type\\n\\n flow_base(size_t n = 0) : adjs(n) {}\\n\\n flow_base(const flow_base &other) : adjs(other.size()) {\\n for (size_t node{}; node != size(); ++node)\\n for (const auto &[src, dst, cap, cost, rev] : other[node])\\n if (src == node) {\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\\n rev->src = nil;\\n } else {\\n rev->rev->src = node;\\n }\\n }\\n\\n flow_base &operator=(const flow_base &rhs) {\\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\\n return *this;\\n }\\n\\n size_t size() const { return adjs.size(); }\\n\\n adj_type &operator[](size_t node) {\\n assert(node < size());\\n return adjs[node];\\n }\\n const adj_type &operator[](size_t node) const {\\n assert(node < size());\\n return adjs[node];\\n }\\n\\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) {\\n assert(src < size());\\n assert(dst < size());\\n assert(!(cap < static_cast<cap_t>(0)));\\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\\n return ptr;\\n }\\n\\n protected:\\n constexpr static size_t nil = -1;\\n std::vector<adj_type> adjs;\\n}; // class flow_base\\n#line 6 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n// Successive shortest paths algorithm.\\ntemplate <class cap_t, class cost_t, bool density_tag = false>\\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\\n using base = flow_base<cap_t, cost_t>;\\n using edge_t = typename base::edge_t;\\n using base::adjs;\\n using base::nil;\\n\\n cost_t min_cost, total_cost;\\n std::vector<cap_t> supp;\\n std::vector<cost_t> ptnl;\\n\\n void copy_member(const min_cost_flow &other) {\\n min_cost = other.min_cost;\\n total_cost = other.total_cost;\\n supp = other.supp;\\n ptnl = other.ptnl;\\n }\\n\\n void Dijkstra(std::vector<edge_t *> &last) {\\n const cost_t infty(total_cost + 1);\\n std::vector<cost_t> nptnl(size(), infty);\\n if constexpr (density_tag) {\\n // O(V^2)\\n std::vector<bool> used(size());\\n for (size_t src{}; src != size(); ++src) {\\n if (static_cast<cap_t>(0) < supp[src]) {\\n used[src] = true;\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\\n if (e.avbl() && e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n for (;;) {\\n size_t src{nil};\\n cost_t sp{infty};\\n for (size_t node{}; node != size(); ++node) {\\n if (used[node] || nptnl[node] == infty) continue;\\n cost_t dist{nptnl[node] - ptnl[node]};\\n if (dist < sp) {\\n sp = dist;\\n src = node;\\n }\\n }\\n if (src == nil) break;\\n used[src] = true;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = nptnl[src] + e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n } else {\\n // O((V + E)logV)\\n struct node_t {\\n size_t id;\\n cost_t dist;\\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\\n };\\n std::priority_queue<node_t> que;\\n for (size_t src{}; src != size(); ++src) {\\n if (supp[src] > static_cast<cap_t>(0)) {\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\\n if (e.avbl() && nptnl[e.dst] > e.cost) {\\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n while (!que.empty()) {\\n auto [src, ndist] = que.top();\\n que.pop();\\n if (ndist + ptnl[src] != nptnl[src]) continue;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\\n que.emplace(e.dst,\\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n ptnl.swap(nptnl);\\n }\\n\\n public:\\n using base::size;\\n\\n min_cost_flow(size_t n = 0)\\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\\n\\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\\n copy_member(other);\\n }\\n\\n min_cost_flow &operator=(const min_cost_flow &other) {\\n base::operator=(other);\\n copy_member(other);\\n return *this;\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) override {\\n assert(src != dst);\\n if (cost < static_cast<cost_t>(0)) {\\n supp[src] -= cap;\\n supp[dst] += cap;\\n min_cost += cap * cost;\\n total_cost -= cap * cost;\\n return base::add_edge(dst, src, cap, -cost);\\n }\\n total_cost += cap * cost;\\n return base::add_edge(src, dst, cap, cost);\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\\n const cap_t &upper, const cost_t &cost) {\\n assert(!(upper < lower));\\n supp[src] -= lower;\\n supp[dst] += lower;\\n min_cost += lower * cost;\\n return add_edge(src, dst, upper - lower, cost);\\n }\\n\\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\\n assert(node < size());\\n return supp[node] += vol;\\n }\\n\\n const cap_t &demand(size_t node, const cap_t &vol) {\\n return supply(node, -vol);\\n }\\n\\n bool flow() {\\n for (bool aug = true; aug;) {\\n aug = false;\\n std::vector<edge_t *> last(size());\\n Dijkstra(last);\\n std::vector<bool> shut(size());\\n for (size_t dst{}; dst != size(); ++dst) {\\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\\n cap_t resid{-supp[dst]};\\n size_t src{dst}, block{nil};\\n while (last[src] && !shut[src]) {\\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\\n src = last[src]->src;\\n }\\n if (shut[src])\\n block = src;\\n else {\\n if (!(resid < supp[src])) {\\n resid = supp[src];\\n block = src;\\n }\\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\\n e->cap -= resid;\\n e->rev->cap += resid;\\n }\\n supp[src] -= resid;\\n supp[dst] += resid;\\n min_cost += ptnl[dst] * resid;\\n aug = true;\\n }\\n if (~block) {\\n for (size_t node{dst};; node = last[node]->src) {\\n shut[node] = true;\\n if (node == block) break;\\n }\\n }\\n }\\n }\\n }\\n return std::none_of(begin(supp), end(supp),\\n [](const cap_t &s) { return s < 0 || 0 < s; });\\n }\\n\\n cost_t optimal() {\\n assert(flow());\\n return min_cost;\\n }\\n}; // class min_cost_flow\\n#line 22 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main() {\\n // start here!\\n const i64 inf = 1e11;\\n int n, m, x;\\n cin >> n >> m >> x;\\n\\n min_cost_flow<i64, i64> base(n * 3);\\n // make\\n {\\n for (int i = 0; i < n; i++) {\\n int a, b, p;\\n cin >> a >> b >> p;\\n base.add_edge(3 * i + 1, 3 * i, inf, p);\\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\\n base.supply(3 * i, -a);\\n base.supply(3 * i + 1, a - b);\\n base.supply(3 * i + 2, b);\\n }\\n }\\n for (auto j = 0; j < m; ++j) {\\n int u, v, f;\\n cin >> u >> v >> f;\\n --u, --v;\\n if (f > 0) {\\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\\n } else {\\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\\n }\\n }\\n\\n auto ok = [&](int t) -> bool {\\n auto mcf = base;\\n for (int i = 0; i < n; i++) {\\n mcf.add_edge(3 * i + 2, 0, inf, t);\\n }\\n if (mcf.flow()) {\\n auto opt = mcf.optimal();\\n return opt >= x;\\n }\\n return false;\\n };\\n\\n auto ans = binary_search(x + 100 * n + 1, -1, ok);\\n if (ans > x + 100 * n)\\n cout << \\\"-1\\\\n\\\";\\n else\\n cout << ans << eol;\\n}\\n}\",\n \"accuracy\": 0.4222222222222222,\n \"time_ms\": 20,\n \"memory_kb\": 3664,\n \"score_of_the_acc\": -0.6844,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3171_4886055\",\n \"code_snippet\": \"#line 1 \\\"other/h.cpp\\\"\\n#include <bits/extc++.h>\\n#if __has_include(<bit>)\\n#include <bit>\\n#endif\\n#line 7 \\\"Library/alias.hpp\\\"\\nnamespace workspace {\\nconstexpr char eol = '\\\\n';\\nusing namespace std;\\nusing i32 = int_least32_t;\\nusing i64 = int_least64_t;\\nusing i128 = __int128_t;\\nusing u32 = uint_least32_t;\\nusing u64 = uint_least64_t;\\nusing u128 = __uint128_t;\\ntemplate <class T, class Comp = less<T>>\\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\\ntemplate <class T> using stack = std::stack<T, vector<T>>;\\n} // namespace workspace\\n#line 5 \\\"Library/config.hpp\\\"\\nnamespace config {\\nconst auto start_time{std::chrono::system_clock::now()};\\nint64_t elapsed() {\\n using namespace std::chrono;\\n const auto end_time{system_clock::now()};\\n return duration_cast<milliseconds>(end_time - start_time).count();\\n}\\n__attribute__((constructor)) void setup() {\\n using namespace std;\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n#ifdef _buffer_check\\n atexit([] {\\n char bufc;\\n if (cin >> bufc)\\n cerr << \\\"\\\\n\\\\033[43m\\\\033[30mwarning: buffer not empty.\\\\033[0m\\\\n\\\\n\\\";\\n });\\n#endif\\n}\\nunsigned cases(), caseid = 1;\\ntemplate <class F> void loop(F main) {\\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\\n}\\n} // namespace config\\n#line 2 \\\"Library/option.hpp\\\"\\n#ifdef ONLINE_JUDGE\\n #pragma GCC optimize(\\\"O3\\\")\\n #pragma GCC target(\\\"avx,avx2\\\")\\n #pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#line 2 \\\"Library/utils/binary_search.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <cassert>\\n#include <cmath>\\n#include <vector>\\nnamespace workspace {\\n// binary search on a discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\\n iter_type>\\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\\n assert(ok != ng);\\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\\n while (1 < dist || dist < -1) {\\n iter_type mid(ok + dist / 2);\\n if (pred(mid))\\n ok = mid, dist -= dist / 2;\\n else\\n ng = mid, dist /= 2;\\n }\\n return ok;\\n}\\n// parallel binary search on each discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\\n std::vector<bool>>,\\n std::vector<iter_type>>\\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\\n pred_type pred) {\\n std::vector<iter_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n iter_type mid(ok + (ng - ok) / 2);\\n if (mids[i] != mid) {\\n all_found = false;\\n mids[i] = mid;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n// binary search on a real number interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\\n real_type>\\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\\n assert(ok != ng);\\n while (ok + eps < ng || ng + eps < ok) {\\n real_type mid{(ok + ng) / 2};\\n (pred(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n// parallel binary search on each real interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<real_type>>,\\n std::vector<bool>>,\\n std::vector<real_type>>\\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\\n const real_type eps, pred_type pred) {\\n std::vector<real_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n if (ok + eps < ng || ng + eps < ok) {\\n all_found = false;\\n mids[i] = (ok + ng) / 2;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/casefmt.hpp\\\"\\nnamespace workspace {\\nstd::ostream &casefmt(std::ostream& os) { return os << \\\"Case #\\\" << config::caseid << \\\": \\\"; }\\n} // namespace workspace\\n#line 3 \\\"Library/utils/chval.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class Comp = std::less<T>>\\nbool chle(T &x, const T &y, Comp comp = Comp()) {\\n return comp(y, x) ? x = y, true : false;\\n}\\ntemplate <class T, class Comp = std::less<T>>\\nbool chge(T &x, const T &y, Comp comp = Comp()) {\\n return comp(x, y) ? x = y, true : false;\\n}\\n} // namespace workspace\\n#line 5 \\\"Library/utils/coordinate_compression.hpp\\\"\\n\\ntemplate <class T> class coordinate_compression {\\n std::vector<T> uniquely;\\n std::vector<size_t> compressed;\\n\\n public:\\n coordinate_compression(const std::vector<T> &raw)\\n : uniquely(raw), compressed(raw.size()) {\\n std::sort(uniquely.begin(), uniquely.end());\\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\\n uniquely.end());\\n for (size_t i = 0; i != size(); ++i)\\n compressed[i] =\\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\\n uniquely.begin();\\n }\\n\\n size_t operator[](const size_t idx) const {\\n assert(idx < size());\\n return compressed[idx];\\n }\\n\\n size_t size() const { return compressed.size(); }\\n\\n size_t count() const { return uniquely.size(); }\\n\\n T value(const size_t ord) const {\\n assert(ord < count());\\n return uniquely[ord];\\n }\\n\\n size_t order(const T &value) const {\\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\\n uniquely.begin();\\n }\\n\\n auto begin() { return compressed.begin(); }\\n auto end() { return compressed.end(); }\\n auto rbegin() { return compressed.rbegin(); }\\n auto rend() { return compressed.rend(); }\\n};\\n#line 3 \\\"Library/utils/fixed_point.hpp\\\"\\nnamespace workspace {\\n// specify the return type of lambda.\\ntemplate <class lambda_type> class fixed_point {\\n lambda_type func;\\n\\n public:\\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\\n template <class... Args> auto operator()(Args &&... args) const {\\n return func(*this, std::forward<Args>(args)...);\\n }\\n};\\n} // namespace workspace\\n#line 6 \\\"Library/utils/hash.hpp\\\"\\n\\n#line 3 \\\"Library/utils/sfinae.hpp\\\"\\n#include <type_traits>\\n\\ntemplate <class type, template <class> class trait>\\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\\n\\ntemplate <class Container>\\nusing element_type = typename std::decay<decltype(\\n *std::begin(std::declval<Container&>()))>::type;\\n\\ntemplate <class T, class = int> struct mapped_of {\\n using type = element_type<T>;\\n};\\ntemplate <class T>\\nstruct mapped_of<T,\\n typename std::pair<int, typename T::mapped_type>::first_type> {\\n using type = typename T::mapped_type;\\n};\\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\\n\\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\\ntemplate <class T>\\nstruct is_integral_ext<\\n T, typename std::enable_if<std::is_integral<T>::value>::type>\\n : std::true_type {};\\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\\n#if __cplusplus >= 201402\\ntemplate <class T>\\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\\n#endif\\n\\ntemplate <typename T, typename = void> struct multiplicable_uint {\\n using type = uint_least32_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\\n using type = uint_least64_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\\n using type = __uint128_t;\\n};\\n#line 8 \\\"Library/utils/hash.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class = void> struct hash : std::hash<T> {};\\n#if __cplusplus >= 201703L\\ntemplate <class Unique_bits_type>\\nstruct hash<Unique_bits_type,\\n enable_if_trait_type<Unique_bits_type,\\n std::has_unique_object_representations>> {\\n size_t operator()(uint64_t x) const {\\n static const uint64_t m = std::random_device{}();\\n x ^= x >> 23;\\n x ^= m;\\n x ^= x >> 47;\\n return x - (x >> 32);\\n }\\n};\\n#endif\\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\\n return seed ^\\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\\n}\\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\\n size_t operator()(const std::pair<T1, T2> &pair) const {\\n return hash_combine(hash<T1>()(pair.first), pair.second);\\n }\\n};\\ntemplate <class... T> class hash<std::tuple<T...>> {\\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\\n struct tuple_hash {\\n static uint64_t apply(const Tuple &t) {\\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\\n std::get<index>(t));\\n }\\n };\\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\\n static uint64_t apply(const Tuple &t) { return 0; }\\n };\\n\\n public:\\n uint64_t operator()(const std::tuple<T...> &t) const {\\n return tuple_hash<std::tuple<T...>>::apply(t);\\n }\\n};\\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\\n using key_type = typename hash_table::key_type;\\n size_t count(const key_type &key) const {\\n return hash_table::find(key) != hash_table::end();\\n }\\n template <class... Args> auto emplace(Args &&... args) {\\n return hash_table::insert(typename hash_table::value_type(args...));\\n }\\n};\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing cc_hash_table =\\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing gp_hash_table =\\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped>\\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\\n} // namespace workspace\\n#line 2 \\\"Library/utils/make_vector.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <vector>\\nnamespace workspace {\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\\n if constexpr (N)\\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\\n else\\n return init;\\n}\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\\n return make_vector<T, N>((size_t*)sizes, init);\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/random_number_generator.hpp\\\"\\ntemplate <typename num_type> class random_number_generator {\\n typename std::conditional<std::is_integral<num_type>::value,\\n std::uniform_int_distribution<num_type>,\\n std::uniform_real_distribution<num_type>>::type\\n unif;\\n\\n std::mt19937 engine;\\n\\n public:\\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\\n num_type max = std::numeric_limits<num_type>::max())\\n : unif(min, max), engine(std::random_device{}()) {}\\n\\n num_type min() const { return unif.min(); }\\n\\n num_type max() const { return unif.max(); }\\n\\n // generate a random number in [min(), max()].\\n num_type operator()() { return unif(engine); }\\n};\\n#line 3 \\\"Library/utils/read.hpp\\\"\\nnamespace workspace {\\n// read with std::cin.\\ntemplate <class T = void>\\nstruct read\\n{\\n typename std::remove_const<T>::type value;\\n template <class... types>\\n read(types... args) : value(args...) { std::cin >> value; }\\n operator T() const { return value; }\\n};\\ntemplate <>\\nstruct read<void>\\n{\\n template <class T>\\n operator T() const { T value; std::cin >> value; return value; }\\n};\\n} // namespace workspace\\n#line 4 \\\"Library/utils/stream.hpp\\\"\\n\\n#line 6 \\\"Library/utils/stream.hpp\\\"\\nnamespace std {\\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ' ' << p.second;\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_is {\\n static istream &apply(istream &is, tuple_t &t) {\\n tuple_is<tuple_t, index - 1>::apply(is, t);\\n return is >> get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\\n static istream &apply(istream &is, tuple_t &t) { return is; }\\n};\\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\\n t);\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_os {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n tuple_os<tuple_t, index - 1>::apply(os, t);\\n return os << ' ' << get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n return os << get<0>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\\n};\\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\\n t);\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n istream &>::type\\noperator>>(istream &is, Container &cont) {\\n for (auto &&e : cont) is >> e;\\n return is;\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n ostream &>::type\\noperator<<(ostream &os, const Container &cont) {\\n bool head = true;\\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\\n return os;\\n}\\n} // namespace std\\n#line 4 \\\"Library/utils/trinary_search.hpp\\\"\\n// trinary search on discrete range.\\ntemplate <class iter_type, class comp_type>\\niter_type trinary(iter_type first, iter_type last, comp_type comp)\\n{\\n assert(first < last);\\n intmax_t dist(last - first);\\n while(dist > 2)\\n {\\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\\n else first = left, dist -= dist / 3;\\n }\\n if(dist > 1 && comp(first + 1, first)) ++first;\\n return first;\\n}\\n// trinary search on real numbers.\\ntemplate <class comp_type>\\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\\n{\\n assert(first < last);\\n while(last - first > eps)\\n {\\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\\n if(comp(left, right)) last = right;\\n else first = left;\\n }\\n return first;\\n}\\n#line 2 \\\"Library/utils/wrapper.hpp\\\"\\ntemplate <class Container> class reversed {\\n Container &ref, copy;\\n\\n public:\\n reversed(Container &ref) : ref(ref) {}\\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\\n auto begin() const { return ref.rbegin(); }\\n auto end() const { return ref.rend(); }\\n};\\n#line 9 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main();\\n}\\nint main() { config::loop(workspace::main); }\\n\\nunsigned config::cases() {\\n // return -1; // unspecified\\n // int t; std::cin >> t; return t; // given\\n return 1;\\n}\\n\\n#line 4 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n\\n#line 4 \\\"Library/graph/directed/flow/base.hpp\\\"\\n// the base class of flow algorithms.\\ntemplate <class cap_t, class cost_t> struct flow_base {\\n struct edge_t {\\n size_t src, dst;\\n cap_t cap;\\n cost_t cost;\\n edge_t *rev;\\n edge_t() = default;\\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\\n : src(src), dst(dst), cap(cap), rev(rev) {}\\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\\n edge_t *rev)\\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\\n }; // class edge_t\\n\\n class adj_type {\\n edge_t *fst, *lst, *clst;\\n\\n public:\\n template <class... Args> edge_t *emplace(Args &&... args) {\\n if (lst == clst) {\\n size_t len(clst - fst);\\n edge_t *nfst = lst = new edge_t[len << 1];\\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\\n p->rev->rev = lst, *lst = *p;\\n delete[] fst;\\n fst = nfst;\\n clst = lst + len;\\n }\\n *lst = edge_t(args...);\\n return lst++;\\n }\\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\\n ~adj_type() { delete[] fst; }\\n edge_t &operator[](size_t i) {\\n assert(i < size());\\n return *(fst + i);\\n }\\n size_t size() const { return lst - fst; }\\n edge_t *begin() const { return fst; }\\n edge_t *end() const { return lst; }\\n }; // class adj_type\\n\\n flow_base(size_t n = 0) : adjs(n) {}\\n\\n flow_base(const flow_base &other) : adjs(other.size()) {\\n for (size_t node{}; node != size(); ++node)\\n for (const auto &[src, dst, cap, cost, rev] : other[node])\\n if (src == node) {\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\\n rev->src = nil;\\n } else {\\n rev->rev->src = node;\\n }\\n }\\n\\n flow_base &operator=(const flow_base &rhs) {\\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\\n return *this;\\n }\\n\\n size_t size() const { return adjs.size(); }\\n\\n adj_type &operator[](size_t node) {\\n assert(node < size());\\n return adjs[node];\\n }\\n const adj_type &operator[](size_t node) const {\\n assert(node < size());\\n return adjs[node];\\n }\\n\\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) {\\n assert(src < size());\\n assert(dst < size());\\n assert(!(cap < static_cast<cap_t>(0)));\\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\\n return ptr;\\n }\\n\\n protected:\\n constexpr static size_t nil = -1;\\n std::vector<adj_type> adjs;\\n}; // class flow_base\\n#line 6 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n// Successive shortest paths algorithm.\\ntemplate <class cap_t, class cost_t, bool density_tag = false>\\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\\n using base = flow_base<cap_t, cost_t>;\\n using edge_t = typename base::edge_t;\\n using base::adjs;\\n using base::nil;\\n\\n cost_t min_cost, total_cost;\\n std::vector<cap_t> supp;\\n std::vector<cost_t> ptnl;\\n\\n void copy_member(const min_cost_flow &other) {\\n min_cost = other.min_cost;\\n total_cost = other.total_cost;\\n supp = other.supp;\\n ptnl = other.ptnl;\\n }\\n\\n void Dijkstra(std::vector<edge_t *> &last) {\\n const cost_t infty(total_cost + 1);\\n std::vector<cost_t> nptnl(size(), infty);\\n if constexpr (density_tag) {\\n // O(V^2)\\n std::vector<bool> used(size());\\n for (size_t src{}; src != size(); ++src) {\\n if (static_cast<cap_t>(0) < supp[src]) {\\n used[src] = true;\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\\n if (e.avbl() && e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n for (;;) {\\n size_t src{nil};\\n cost_t sp{infty};\\n for (size_t node{}; node != size(); ++node) {\\n if (used[node] || nptnl[node] == infty) continue;\\n cost_t dist{nptnl[node] - ptnl[node]};\\n if (dist < sp) {\\n sp = dist;\\n src = node;\\n }\\n }\\n if (src == nil) break;\\n used[src] = true;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = nptnl[src] + e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n } else {\\n // O((V + E)logV)\\n struct node_t {\\n size_t id;\\n cost_t dist;\\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\\n };\\n std::priority_queue<node_t> que;\\n for (size_t src{}; src != size(); ++src) {\\n if (supp[src] > static_cast<cap_t>(0)) {\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\\n if (e.avbl() && nptnl[e.dst] > e.cost) {\\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n while (!que.empty()) {\\n auto [src, ndist] = que.top();\\n que.pop();\\n if (ndist + ptnl[src] != nptnl[src]) continue;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\\n que.emplace(e.dst,\\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n ptnl.swap(nptnl);\\n }\\n\\n public:\\n using base::size;\\n\\n min_cost_flow(size_t n = 0)\\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\\n\\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\\n copy_member(other);\\n }\\n\\n min_cost_flow &operator=(const min_cost_flow &other) {\\n base::operator=(other);\\n copy_member(other);\\n return *this;\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) override {\\n assert(src != dst);\\n if (cost < static_cast<cost_t>(0)) {\\n supp[src] -= cap;\\n supp[dst] += cap;\\n min_cost += cap * cost;\\n total_cost -= cap * cost;\\n return base::add_edge(dst, src, cap, -cost);\\n }\\n total_cost += cap * cost;\\n return base::add_edge(src, dst, cap, cost);\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\\n const cap_t &upper, const cost_t &cost) {\\n assert(!(upper < lower));\\n supp[src] -= lower;\\n supp[dst] += lower;\\n min_cost += lower * cost;\\n return add_edge(src, dst, upper - lower, cost);\\n }\\n\\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\\n assert(node < size());\\n return supp[node] += vol;\\n }\\n\\n const cap_t &demand(size_t node, const cap_t &vol) {\\n return supply(node, -vol);\\n }\\n\\n bool flow() {\\n for (bool aug = true; aug;) {\\n aug = false;\\n std::vector<edge_t *> last(size());\\n Dijkstra(last);\\n std::vector<bool> shut(size());\\n for (size_t dst{}; dst != size(); ++dst) {\\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\\n cap_t resid{-supp[dst]};\\n size_t src{dst}, block{nil};\\n while (last[src] && !shut[src]) {\\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\\n src = last[src]->src;\\n }\\n if (shut[src])\\n block = src;\\n else {\\n if (!(resid < supp[src])) {\\n resid = supp[src];\\n block = src;\\n }\\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\\n e->cap -= resid;\\n e->rev->cap += resid;\\n }\\n supp[src] -= resid;\\n supp[dst] += resid;\\n min_cost += ptnl[dst] * resid;\\n aug = true;\\n }\\n if (~block) {\\n for (size_t node{dst};; node = last[node]->src) {\\n shut[node] = true;\\n if (node == block) break;\\n }\\n }\\n }\\n }\\n }\\n return std::none_of(begin(supp), end(supp),\\n [](const cap_t &s) { return s < 0 || 0 < s; });\\n }\\n\\n cost_t optimal() {\\n assert(flow());\\n return min_cost;\\n }\\n}; // class min_cost_flow\\n#line 22 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main() {\\n // start here!\\n const i64 inf = 1e12;\\n int n, m, x;\\n cin >> n >> m >> x;\\n\\n min_cost_flow<i64, i64> base(n * 3);\\n // make\\n {\\n for (int i = 0; i < n; i++) {\\n int a, b, p;\\n cin >> a >> b >> p;\\n base.add_edge(3 * i + 1, 3 * i, inf, p);\\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\\n base.supply(3 * i, -a);\\n base.supply(3 * i + 1, a - b);\\n base.supply(3 * i + 2, b);\\n }\\n }\\n for (auto j = 0; j < m; ++j) {\\n int u, v, f;\\n cin >> u >> v >> f;\\n --u, --v;\\n if (f > 0) {\\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\\n } else {\\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\\n }\\n }\\n\\n auto ok = [&](int t) -> bool {\\n auto mcf = base;\\n for (int i = 0; i < n; i++) {\\n mcf.add_edge(3 * i + 2, 0, inf, t);\\n }\\n if (mcf.flow()) {\\n auto opt = mcf.optimal();\\n return opt >= x;\\n }\\n return false;\\n };\\n\\n auto ans = binary_search(x + 100 * n + 1, -1, ok);\\n if (ans > x + 100 * n)\\n cout << \\\"-1\\\\n\\\";\\n else\\n cout << ans << eol;\\n}\\n}\",\n \"accuracy\": 0.4222222222222222,\n \"time_ms\": 20,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.5611,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3171_4886053\",\n \"code_snippet\": \"#line 1 \\\"other/h.cpp\\\"\\n#include <bits/extc++.h>\\n#if __has_include(<bit>)\\n#include <bit>\\n#endif\\n#line 7 \\\"Library/alias.hpp\\\"\\nnamespace workspace {\\nconstexpr char eol = '\\\\n';\\nusing namespace std;\\nusing i32 = int_least32_t;\\nusing i64 = int_least64_t;\\nusing i128 = __int128_t;\\nusing u32 = uint_least32_t;\\nusing u64 = uint_least64_t;\\nusing u128 = __uint128_t;\\ntemplate <class T, class Comp = less<T>>\\nusing priority_queue = std::priority_queue<T, vector<T>, Comp>;\\ntemplate <class T> using stack = std::stack<T, vector<T>>;\\n} // namespace workspace\\n#line 5 \\\"Library/config.hpp\\\"\\nnamespace config {\\nconst auto start_time{std::chrono::system_clock::now()};\\nint64_t elapsed() {\\n using namespace std::chrono;\\n const auto end_time{system_clock::now()};\\n return duration_cast<milliseconds>(end_time - start_time).count();\\n}\\n__attribute__((constructor)) void setup() {\\n using namespace std;\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n#ifdef _buffer_check\\n atexit([] {\\n char bufc;\\n if (cin >> bufc)\\n cerr << \\\"\\\\n\\\\033[43m\\\\033[30mwarning: buffer not empty.\\\\033[0m\\\\n\\\\n\\\";\\n });\\n#endif\\n}\\nunsigned cases(), caseid = 1;\\ntemplate <class F> void loop(F main) {\\n for (const unsigned total = cases(); caseid <= total; ++caseid) main();\\n}\\n} // namespace config\\n#line 2 \\\"Library/option.hpp\\\"\\n#ifdef ONLINE_JUDGE\\n #pragma GCC optimize(\\\"O3\\\")\\n #pragma GCC target(\\\"avx,avx2\\\")\\n #pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#line 2 \\\"Library/utils/binary_search.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <cassert>\\n#include <cmath>\\n#include <vector>\\nnamespace workspace {\\n// binary search on a discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\\n iter_type>\\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\\n assert(ok != ng);\\n std::make_signed_t<decltype(ng - ok)> dist(ng - ok);\\n while (1 < dist || dist < -1) {\\n iter_type mid(ok + dist / 2);\\n if (pred(mid))\\n ok = mid, dist -= dist / 2;\\n else\\n ng = mid, dist /= 2;\\n }\\n return ok;\\n}\\n// parallel binary search on each discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\\n std::vector<bool>>,\\n std::vector<iter_type>>\\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\\n pred_type pred) {\\n std::vector<iter_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n iter_type mid(ok + (ng - ok) / 2);\\n if (mids[i] != mid) {\\n all_found = false;\\n mids[i] = mid;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n// binary search on a real number interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\\n real_type>\\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\\n assert(ok != ng);\\n while (ok + eps < ng || ng + eps < ok) {\\n real_type mid{(ok + ng) / 2};\\n (pred(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n// parallel binary search on each real interval.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<real_type>>,\\n std::vector<bool>>,\\n std::vector<real_type>>\\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\\n const real_type eps, pred_type pred) {\\n std::vector<real_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n if (ok + eps < ng || ng + eps < ok) {\\n all_found = false;\\n mids[i] = (ok + ng) / 2;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/casefmt.hpp\\\"\\nnamespace workspace {\\nstd::ostream &casefmt(std::ostream& os) { return os << \\\"Case #\\\" << config::caseid << \\\": \\\"; }\\n} // namespace workspace\\n#line 3 \\\"Library/utils/chval.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class Comp = std::less<T>>\\nbool chle(T &x, const T &y, Comp comp = Comp()) {\\n return comp(y, x) ? x = y, true : false;\\n}\\ntemplate <class T, class Comp = std::less<T>>\\nbool chge(T &x, const T &y, Comp comp = Comp()) {\\n return comp(x, y) ? x = y, true : false;\\n}\\n} // namespace workspace\\n#line 5 \\\"Library/utils/coordinate_compression.hpp\\\"\\n\\ntemplate <class T> class coordinate_compression {\\n std::vector<T> uniquely;\\n std::vector<size_t> compressed;\\n\\n public:\\n coordinate_compression(const std::vector<T> &raw)\\n : uniquely(raw), compressed(raw.size()) {\\n std::sort(uniquely.begin(), uniquely.end());\\n uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),\\n uniquely.end());\\n for (size_t i = 0; i != size(); ++i)\\n compressed[i] =\\n std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -\\n uniquely.begin();\\n }\\n\\n size_t operator[](const size_t idx) const {\\n assert(idx < size());\\n return compressed[idx];\\n }\\n\\n size_t size() const { return compressed.size(); }\\n\\n size_t count() const { return uniquely.size(); }\\n\\n T value(const size_t ord) const {\\n assert(ord < count());\\n return uniquely[ord];\\n }\\n\\n size_t order(const T &value) const {\\n return std::lower_bound(uniquely.begin(), uniquely.end(), value) -\\n uniquely.begin();\\n }\\n\\n auto begin() { return compressed.begin(); }\\n auto end() { return compressed.end(); }\\n auto rbegin() { return compressed.rbegin(); }\\n auto rend() { return compressed.rend(); }\\n};\\n#line 3 \\\"Library/utils/fixed_point.hpp\\\"\\nnamespace workspace {\\n// specify the return type of lambda.\\ntemplate <class lambda_type> class fixed_point {\\n lambda_type func;\\n\\n public:\\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\\n template <class... Args> auto operator()(Args &&... args) const {\\n return func(*this, std::forward<Args>(args)...);\\n }\\n};\\n} // namespace workspace\\n#line 6 \\\"Library/utils/hash.hpp\\\"\\n\\n#line 3 \\\"Library/utils/sfinae.hpp\\\"\\n#include <type_traits>\\n\\ntemplate <class type, template <class> class trait>\\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\\n\\ntemplate <class Container>\\nusing element_type = typename std::decay<decltype(\\n *std::begin(std::declval<Container&>()))>::type;\\n\\ntemplate <class T, class = int> struct mapped_of {\\n using type = element_type<T>;\\n};\\ntemplate <class T>\\nstruct mapped_of<T,\\n typename std::pair<int, typename T::mapped_type>::first_type> {\\n using type = typename T::mapped_type;\\n};\\ntemplate <class T> using mapped_type = typename mapped_of<T>::type;\\n\\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\\ntemplate <class T>\\nstruct is_integral_ext<\\n T, typename std::enable_if<std::is_integral<T>::value>::type>\\n : std::true_type {};\\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\\n#if __cplusplus >= 201402\\ntemplate <class T>\\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\\n#endif\\n\\ntemplate <typename T, typename = void> struct multiplicable_uint {\\n using type = uint_least32_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\\n using type = uint_least64_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\\n using type = __uint128_t;\\n};\\n#line 8 \\\"Library/utils/hash.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class = void> struct hash : std::hash<T> {};\\n#if __cplusplus >= 201703L\\ntemplate <class Unique_bits_type>\\nstruct hash<Unique_bits_type,\\n enable_if_trait_type<Unique_bits_type,\\n std::has_unique_object_representations>> {\\n size_t operator()(uint64_t x) const {\\n static const uint64_t m = std::random_device{}();\\n x ^= x >> 23;\\n x ^= m;\\n x ^= x >> 47;\\n return x - (x >> 32);\\n }\\n};\\n#endif\\ntemplate <class Key> size_t hash_combine(const size_t &seed, const Key &key) {\\n return seed ^\\n (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);\\n}\\ntemplate <class T1, class T2> struct hash<std::pair<T1, T2>> {\\n size_t operator()(const std::pair<T1, T2> &pair) const {\\n return hash_combine(hash<T1>()(pair.first), pair.second);\\n }\\n};\\ntemplate <class... T> class hash<std::tuple<T...>> {\\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>\\n struct tuple_hash {\\n static uint64_t apply(const Tuple &t) {\\n return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),\\n std::get<index>(t));\\n }\\n };\\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {\\n static uint64_t apply(const Tuple &t) { return 0; }\\n };\\n\\n public:\\n uint64_t operator()(const std::tuple<T...> &t) const {\\n return tuple_hash<std::tuple<T...>>::apply(t);\\n }\\n};\\ntemplate <class hash_table> struct hash_table_wrapper : hash_table {\\n using key_type = typename hash_table::key_type;\\n size_t count(const key_type &key) const {\\n return hash_table::find(key) != hash_table::end();\\n }\\n template <class... Args> auto emplace(Args &&... args) {\\n return hash_table::insert(typename hash_table::value_type(args...));\\n }\\n};\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing cc_hash_table =\\n hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing gp_hash_table =\\n hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped>\\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\\ntemplate <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;\\n} // namespace workspace\\n#line 2 \\\"Library/utils/make_vector.hpp\\\"\\n#if __cplusplus >= 201703L\\n#include <vector>\\nnamespace workspace {\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\\n if constexpr (N)\\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\\n else\\n return init;\\n}\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\\n return make_vector<T, N>((size_t*)sizes, init);\\n}\\n} // namespace workspace\\n#endif\\n#line 3 \\\"Library/utils/random_number_generator.hpp\\\"\\ntemplate <typename num_type> class random_number_generator {\\n typename std::conditional<std::is_integral<num_type>::value,\\n std::uniform_int_distribution<num_type>,\\n std::uniform_real_distribution<num_type>>::type\\n unif;\\n\\n std::mt19937 engine;\\n\\n public:\\n random_number_generator(num_type min = std::numeric_limits<num_type>::min(),\\n num_type max = std::numeric_limits<num_type>::max())\\n : unif(min, max), engine(std::random_device{}()) {}\\n\\n num_type min() const { return unif.min(); }\\n\\n num_type max() const { return unif.max(); }\\n\\n // generate a random number in [min(), max()].\\n num_type operator()() { return unif(engine); }\\n};\\n#line 3 \\\"Library/utils/read.hpp\\\"\\nnamespace workspace {\\n// read with std::cin.\\ntemplate <class T = void>\\nstruct read\\n{\\n typename std::remove_const<T>::type value;\\n template <class... types>\\n read(types... args) : value(args...) { std::cin >> value; }\\n operator T() const { return value; }\\n};\\ntemplate <>\\nstruct read<void>\\n{\\n template <class T>\\n operator T() const { T value; std::cin >> value; return value; }\\n};\\n} // namespace workspace\\n#line 4 \\\"Library/utils/stream.hpp\\\"\\n\\n#line 6 \\\"Library/utils/stream.hpp\\\"\\nnamespace std {\\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ' ' << p.second;\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_is {\\n static istream &apply(istream &is, tuple_t &t) {\\n tuple_is<tuple_t, index - 1>::apply(is, t);\\n return is >> get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\\n static istream &apply(istream &is, tuple_t &t) { return is; }\\n};\\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\\n t);\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_os {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n tuple_os<tuple_t, index - 1>::apply(os, t);\\n return os << ' ' << get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n return os << get<0>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\\n};\\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\\n t);\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n istream &>::type\\noperator>>(istream &is, Container &cont) {\\n for (auto &&e : cont) is >> e;\\n return is;\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n ostream &>::type\\noperator<<(ostream &os, const Container &cont) {\\n bool head = true;\\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\\n return os;\\n}\\n} // namespace std\\n#line 4 \\\"Library/utils/trinary_search.hpp\\\"\\n// trinary search on discrete range.\\ntemplate <class iter_type, class comp_type>\\niter_type trinary(iter_type first, iter_type last, comp_type comp)\\n{\\n assert(first < last);\\n intmax_t dist(last - first);\\n while(dist > 2)\\n {\\n iter_type left(first + dist / 3), right(first + dist * 2 / 3);\\n if(comp(left, right)) last = right, dist = dist * 2 / 3;\\n else first = left, dist -= dist / 3;\\n }\\n if(dist > 1 && comp(first + 1, first)) ++first;\\n return first;\\n}\\n// trinary search on real numbers.\\ntemplate <class comp_type>\\nlong double trinary(long double first, long double last, const long double eps, comp_type comp)\\n{\\n assert(first < last);\\n while(last - first > eps)\\n {\\n long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};\\n if(comp(left, right)) last = right;\\n else first = left;\\n }\\n return first;\\n}\\n#line 2 \\\"Library/utils/wrapper.hpp\\\"\\ntemplate <class Container> class reversed {\\n Container &ref, copy;\\n\\n public:\\n reversed(Container &ref) : ref(ref) {}\\n reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}\\n auto begin() const { return ref.rbegin(); }\\n auto end() const { return ref.rend(); }\\n};\\n#line 9 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main();\\n}\\nint main() { config::loop(workspace::main); }\\n\\nunsigned config::cases() {\\n // return -1; // unspecified\\n // int t; std::cin >> t; return t; // given\\n return 1;\\n}\\n\\n#line 4 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n\\n#line 4 \\\"Library/graph/directed/flow/base.hpp\\\"\\n// the base class of flow algorithms.\\ntemplate <class cap_t, class cost_t> struct flow_base {\\n struct edge_t {\\n size_t src, dst;\\n cap_t cap;\\n cost_t cost;\\n edge_t *rev;\\n edge_t() = default;\\n edge_t(size_t src, size_t dst, const cap_t &cap, edge_t *rev)\\n : src(src), dst(dst), cap(cap), rev(rev) {}\\n edge_t(size_t src, size_t dst, const cap_t &cap, const cost_t &cost,\\n edge_t *rev)\\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\\n const cap_t &flow(const cap_t &f = 0) { return cap -= f, rev->cap += f; }\\n bool avbl() const { return static_cast<cap_t>(0) < cap; }\\n }; // class edge_t\\n\\n class adj_type {\\n edge_t *fst, *lst, *clst;\\n\\n public:\\n template <class... Args> edge_t *emplace(Args &&... args) {\\n if (lst == clst) {\\n size_t len(clst - fst);\\n edge_t *nfst = lst = new edge_t[len << 1];\\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\\n p->rev->rev = lst, *lst = *p;\\n delete[] fst;\\n fst = nfst;\\n clst = lst + len;\\n }\\n *lst = edge_t(args...);\\n return lst++;\\n }\\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\\n ~adj_type() { delete[] fst; }\\n edge_t &operator[](size_t i) {\\n assert(i < size());\\n return *(fst + i);\\n }\\n size_t size() const { return lst - fst; }\\n edge_t *begin() const { return fst; }\\n edge_t *end() const { return lst; }\\n }; // class adj_type\\n\\n flow_base(size_t n = 0) : adjs(n) {}\\n\\n flow_base(const flow_base &other) : adjs(other.size()) {\\n for (size_t node{}; node != size(); ++node)\\n for (const auto &[src, dst, cap, cost, rev] : other[node])\\n if (src == node) {\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\\n rev->src = nil;\\n } else {\\n rev->rev->src = node;\\n }\\n }\\n\\n flow_base &operator=(const flow_base &rhs) {\\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\\n return *this;\\n }\\n\\n size_t size() const { return adjs.size(); }\\n\\n adj_type &operator[](size_t node) {\\n assert(node < size());\\n return adjs[node];\\n }\\n const adj_type &operator[](size_t node) const {\\n assert(node < size());\\n return adjs[node];\\n }\\n\\n virtual edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) {\\n assert(src < size());\\n assert(dst < size());\\n assert(!(cap < static_cast<cap_t>(0)));\\n if (!(static_cast<cap_t>(0) < cap) || src == dst) return nullptr;\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\\n return ptr;\\n }\\n\\n protected:\\n constexpr static size_t nil = -1;\\n std::vector<adj_type> adjs;\\n}; // class flow_base\\n#line 6 \\\"Library/graph/directed/flow/min_cost_flow.hpp\\\"\\n// Successive shortest paths algorithm.\\ntemplate <class cap_t, class cost_t, bool density_tag = false>\\nclass min_cost_flow : public flow_base<cap_t, cost_t> {\\n using base = flow_base<cap_t, cost_t>;\\n using edge_t = typename base::edge_t;\\n using base::adjs;\\n using base::nil;\\n\\n cost_t min_cost, total_cost;\\n std::vector<cap_t> supp;\\n std::vector<cost_t> ptnl;\\n\\n void copy_member(const min_cost_flow &other) {\\n min_cost = other.min_cost;\\n total_cost = other.total_cost;\\n supp = other.supp;\\n ptnl = other.ptnl;\\n }\\n\\n void Dijkstra(std::vector<edge_t *> &last) {\\n const cost_t infty(total_cost + 1);\\n std::vector<cost_t> nptnl(size(), infty);\\n if constexpr (density_tag) {\\n // O(V^2)\\n std::vector<bool> used(size());\\n for (size_t src{}; src != size(); ++src) {\\n if (static_cast<cap_t>(0) < supp[src]) {\\n used[src] = true;\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (static_cast<cap_t>(0) < supp[e.dst]) continue;\\n if (e.avbl() && e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n for (;;) {\\n size_t src{nil};\\n cost_t sp{infty};\\n for (size_t node{}; node != size(); ++node) {\\n if (used[node] || nptnl[node] == infty) continue;\\n cost_t dist{nptnl[node] - ptnl[node]};\\n if (dist < sp) {\\n sp = dist;\\n src = node;\\n }\\n }\\n if (src == nil) break;\\n used[src] = true;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[src] + e.cost < nptnl[e.dst]) {\\n nptnl[e.dst] = nptnl[src] + e.cost;\\n last[e.dst] = &e;\\n }\\n }\\n }\\n } else {\\n // O((V + E)logV)\\n struct node_t {\\n size_t id;\\n cost_t dist;\\n node_t(size_t id, cost_t dist) : id(id), dist(dist) {}\\n bool operator<(const node_t &rhs) const { return rhs.dist < dist; }\\n };\\n std::priority_queue<node_t> que;\\n for (size_t src{}; src != size(); ++src) {\\n if (supp[src] > static_cast<cap_t>(0)) {\\n nptnl[src] = 0;\\n for (edge_t &e : adjs[src]) {\\n if (supp[e.dst] > static_cast<cap_t>(0)) continue;\\n if (e.avbl() && nptnl[e.dst] > e.cost) {\\n que.emplace(e.dst, (nptnl[e.dst] = e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n while (!que.empty()) {\\n auto [src, ndist] = que.top();\\n que.pop();\\n if (ndist + ptnl[src] != nptnl[src]) continue;\\n for (edge_t &e : adjs[src]) {\\n if (e.avbl() && nptnl[e.dst] > nptnl[src] + e.cost) {\\n que.emplace(e.dst,\\n (nptnl[e.dst] = nptnl[src] + e.cost) - ptnl[e.dst]);\\n last[e.dst] = &e;\\n }\\n }\\n }\\n }\\n ptnl.swap(nptnl);\\n }\\n\\n public:\\n using base::size;\\n\\n min_cost_flow(size_t n = 0)\\n : base::flow_base(n), min_cost(0), total_cost(0), supp(n), ptnl(n) {}\\n\\n min_cost_flow(const min_cost_flow &other) : base::flow_base(other) {\\n copy_member(other);\\n }\\n\\n min_cost_flow &operator=(const min_cost_flow &other) {\\n base::operator=(other);\\n copy_member(other);\\n return *this;\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cost_t &cost);\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &cap,\\n const cost_t &cost) override {\\n assert(src != dst);\\n if (cost < static_cast<cost_t>(0)) {\\n supp[src] -= cap;\\n supp[dst] += cap;\\n min_cost += cap * cost;\\n total_cost -= cap * cost;\\n return base::add_edge(dst, src, cap, -cost);\\n }\\n total_cost += cap * cost;\\n return base::add_edge(src, dst, cap, cost);\\n }\\n\\n edge_t *add_edge(size_t src, size_t dst, const cap_t &lower,\\n const cap_t &upper, const cost_t &cost) {\\n assert(!(upper < lower));\\n supp[src] -= lower;\\n supp[dst] += lower;\\n min_cost += lower * cost;\\n return add_edge(src, dst, upper - lower, cost);\\n }\\n\\n const cap_t &supply(size_t node, const cap_t &vol = 0) {\\n assert(node < size());\\n return supp[node] += vol;\\n }\\n\\n const cap_t &demand(size_t node, const cap_t &vol) {\\n return supply(node, -vol);\\n }\\n\\n bool flow() {\\n for (bool aug = true; aug;) {\\n aug = false;\\n std::vector<edge_t *> last(size());\\n Dijkstra(last);\\n std::vector<bool> shut(size());\\n for (size_t dst{}; dst != size(); ++dst) {\\n if (supp[dst] < static_cast<cap_t>(0) and last[dst]) {\\n cap_t resid{-supp[dst]};\\n size_t src{dst}, block{nil};\\n while (last[src] && !shut[src]) {\\n if (!(resid < last[src]->cap)) resid = last[block = src]->cap;\\n src = last[src]->src;\\n }\\n if (shut[src])\\n block = src;\\n else {\\n if (!(resid < supp[src])) {\\n resid = supp[src];\\n block = src;\\n }\\n for (edge_t *e{last[dst]}; e; e = last[e->src]) {\\n e->cap -= resid;\\n e->rev->cap += resid;\\n }\\n supp[src] -= resid;\\n supp[dst] += resid;\\n min_cost += ptnl[dst] * resid;\\n aug = true;\\n }\\n if (~block) {\\n for (size_t node{dst};; node = last[node]->src) {\\n shut[node] = true;\\n if (node == block) break;\\n }\\n }\\n }\\n }\\n }\\n return std::none_of(begin(supp), end(supp),\\n [](const cap_t &s) { return s < 0 || 0 < s; });\\n }\\n\\n cost_t optimal() {\\n assert(flow());\\n return min_cost;\\n }\\n}; // class min_cost_flow\\n#line 22 \\\"other/h.cpp\\\"\\n\\nnamespace workspace {\\nvoid main() {\\n // start here!\\n const int inf = 1e9;\\n int n, m, x;\\n cin >> n >> m >> x;\\n\\n min_cost_flow<i64, i64> base(n * 3);\\n // make\\n {\\n for (int i = 0; i < n; i++) {\\n int a, b, p;\\n cin >> a >> b >> p;\\n base.add_edge(3 * i + 1, 3 * i, inf, p);\\n base.add_edge(3 * i, 3 * i + 1, inf, -1);\\n base.add_edge(3 * i + 1, 3 * i + 2, inf, 0);\\n if (i) base.add_edge(3 * (i - 1), 3 * i, inf, 0);\\n base.supply(3 * i, -a);\\n base.supply(3 * i + 1, a - b);\\n base.supply(3 * i + 2, b);\\n }\\n }\\n for (auto j = 0; j < m; ++j) {\\n int u, v, f;\\n cin >> u >> v >> f;\\n --u, --v;\\n if (f > 0) {\\n base.add_edge(3 * v, 3 * u + 2, inf, 1);\\n } else {\\n base.add_edge(3 * u + 2, 3 * v, inf, 0);\\n }\\n }\\n\\n auto ok = [&](int t) -> bool {\\n auto mcf = base;\\n for (int i = 0; i < n; i++) {\\n mcf.add_edge(3 * i + 2, 0, inf, t);\\n }\\n if (mcf.flow()) {\\n auto opt = mcf.optimal();\\n return opt >= x;\\n }\\n return false;\\n };\\n\\n auto ans = binary_search(x + 100 * n + 1, -1, ok);\\n if (ans > x + 100 * n)\\n cout << \\\"-1\\\\n\\\";\\n else\\n cout << ans << eol;\\n}\\n}\",\n \"accuracy\": 0.4222222222222222,\n \"time_ms\": 40,\n \"memory_kb\": 3676,\n \"score_of_the_acc\": -0.7449,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3171_4867711\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\n\\n// O(m^2 \\\\log n \\\\log U)\\n// U: maximum capacity\\nenum Objective{\\n MINIMIZE = +1,\\n MAXIMIZE = -1,\\n};\\ntemplate<typename Flow, typename Cost,\\n Objective objective = Objective::MINIMIZE>\\nstruct MinCostFlow{\\n template<typename T> inline void chmin(T &x,T y){x=min(x,y);}\\n\\n struct Edge{\\n int src,dst;\\n Flow flow,cap;\\n Cost cost;\\n int rev;\\n Edge(int src,int dst,Flow cap,Cost cost,int rev):\\n src(src),dst(dst),flow(0),cap(cap),cost(cost),rev(rev){}\\n Flow residual_cap()const{return cap-flow;}\\n };\\n\\n struct EdgePtr{\\n int v,e;\\n EdgePtr(int v,int e):v(v),e(e){}\\n };\\n\\n int n;\\n vector<vector<Edge>> G;\\n vector<Flow> b;\\n vector<Cost> p;\\n\\n MinCostFlow(int n):n(n),G(n),b(n,0){}\\n\\n EdgePtr add_edge(int src,int dst,Flow lower,Flow upper,Cost cost){\\n int e=G[src].size();\\n int r=(src==dst?e+1:G[dst].size());\\n assert(lower<=upper);\\n G[src].emplace_back(src,dst,+upper,+cost*objective,r);\\n G[dst].emplace_back(dst,src,-lower,-cost*objective,e);\\n return EdgePtr(src,e);\\n }\\n\\n const Edge &get_edge(EdgePtr ep)const{return G[ep.v][ep.e];}\\n\\n void push(Edge &e,Flow amount){\\n e.flow+=amount;\\n G[e.dst][e.rev].flow-=amount;\\n }\\n\\n void add_supply(int v,Flow amount){b[v]+=amount;}\\n void add_demand(int v,Flow amount){b[v]-=amount;}\\n\\n Cost residual_cost(const Edge &e){\\n return e.cost+p[e.src]-p[e.dst];\\n }\\n\\n vector<int> excess_vs,deficit_vs;\\n void saturate_negative(const Flow delta){\\n for(auto &es:G){\\n for(auto &e:es){\\n Flow cap=e.residual_cap();\\n cap-=cap%delta;\\n if(cap<0 or residual_cost(e)<0){\\n push(e,cap);\\n b[e.src]-=cap;\\n b[e.dst]+=cap;\\n }\\n }\\n }\\n\\n excess_vs.clear();\\n deficit_vs.clear();\\n for(int v=0;v<n;v++){\\n if(b[v]>0) excess_vs.emplace_back(v);\\n if(b[v]<0) deficit_vs.emplace_back(v);\\n }\\n }\\n\\n const Cost unreachable = std::numeric_limits<Cost>::max();\\n Cost farthest;\\n vector<Cost> dist;\\n vector<Edge*> parent;\\n\\n struct P{\\n Cost first;\\n int second;\\n P(Cost first,int second):first(first),second(second){}\\n bool operator<(const P o)const{return first>o.first;}\\n };\\n\\n priority_queue<P> pq;\\n\\n template<typename Predicate>\\n void eliminate(vector<int> &vs,Predicate predicate){\\n vs.erase(remove_if(begin(vs),end(vs),predicate),end(vs));\\n }\\n\\n bool dual(const Flow delta){\\n eliminate(excess_vs, [&](int v){return b[v]<+delta;});\\n eliminate(deficit_vs,[&](int v){return b[v]>-delta;});\\n\\n dist.assign(n,unreachable);\\n for(int v:excess_vs) pq.emplace(dist[v]=0,v);\\n\\n parent.assign(n,nullptr);\\n auto emplace=[&](Edge& e){\\n if(e.residual_cap()<delta) return;\\n Cost nxt=dist[e.src]+residual_cost(e);\\n if(nxt>=dist[e.dst]) return;\\n pq.emplace(dist[e.dst]=nxt,e.dst);\\n parent[e.dst]=&e;\\n };\\n\\n farthest=0;\\n int deficit_count=0;\\n while(!pq.empty()){\\n Cost d=pq.top().first;\\n int v=pq.top().second;\\n pq.pop();\\n if(dist[v]<d) continue;\\n farthest=d;\\n\\n if(b[v]<=-delta) deficit_count++;\\n if(deficit_count>=(int)deficit_vs.size()) break;\\n\\n for(auto &e:G[v]) emplace(e);\\n }\\n pq=decltype(pq)();\\n\\n for(int v=0;v<n;v++)\\n p[v]+=min(dist[v],farthest);\\n\\n return deficit_count>0;\\n }\\n\\n void primal(const Flow delta){\\n for(int t:deficit_vs){\\n if(dist[t]>farthest) continue;\\n Flow f=-b[t];\\n int v;\\n for(v=t;parent[v];v=parent[v]->src)\\n chmin(f,parent[v]->residual_cap());\\n chmin(f,b[v]);\\n\\n f-=f%delta;\\n if(f<=0) continue;\\n\\n for(v=t;parent[v];){\\n auto &e=*parent[v];\\n push(e,f);\\n int u=parent[v]->src;\\n if(e.residual_cap()<=0) parent[v]=nullptr;\\n v=u;\\n }\\n b[t]+=f;\\n b[v]-=f;\\n }\\n }\\n\\n template<Flow SCALING_FACTOR=2>\\n bool build(){\\n p.resize(n);\\n Flow max_flow=1;\\n for(auto t:b) max_flow=max({max_flow,t,-t});\\n for(auto &es:G)\\n for(auto &e:es)\\n max_flow=max({max_flow,e.residual_cap(),-e.residual_cap()});\\n\\n Flow delta=1;\\n while(delta<max_flow) delta*=SCALING_FACTOR;\\n for(;delta;delta/=SCALING_FACTOR){\\n saturate_negative(delta);\\n while(dual(delta)) primal(delta);\\n }\\n\\n return excess_vs.empty() and deficit_vs.empty();\\n }\\n\\n template<typename T=Cost>\\n T get_cost(){\\n T res=0;\\n for(auto &es:G)\\n for(auto &e:es)\\n res+=T(e.flow)*T(e.cost)/T(objective);\\n return res/T(2);\\n }\\n template<typename T=Cost> T get_gain(){return get_cost();}\\n\\n vector<Cost> get_potential(){\\n fill(p.begin(),p.end(),0);\\n for(int i=0;i<n;i++)\\n for(auto &es:G)\\n for(auto &e:es)\\n if(e.residual_cap()>0)\\n chmin(p[e.dst],p[e.src]+e.cost);\\n return p;\\n }\\n};\\n\\ntemplate<typename Flow, typename Cost>\\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\\n\\n\\ntemplate<typename TV, const int N> void read_tuple_impl(TV&) {}\\ntemplate<typename TV, const int N, typename Head, typename... Tail>\\nvoid read_tuple_impl(TV& ts) {\\n get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));\\n read_tuple_impl<TV, N+1, Tail...>(ts);\\n}\\ntemplate<typename... Ts> decltype(auto) read_tuple(size_t n) {\\n tuple<vector<Ts>...> ts;\\n for(size_t i=0;i<n;i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);\\n return ts;\\n}\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n using ll = long long;\\n\\n int n,m,need;\\n cin>>n>>m>>need;\\n auto [xs,ys,qs]=read_tuple<int, int, int>(n);\\n auto [us,vs,fs]=read_tuple<int, int, int>(m);\\n\\n for(int i=0;i<m;i++) us[i]--,vs[i]--;\\n\\n auto st=[&](int i){return 0+i;};\\n auto en=[&](int i){return n+i;};\\n auto check=[&](ll T)->__int128_t{\\n int Z=n+n;\\n MinCostFlow<ll, ll> G(n+n+1);\\n\\n const ll INF = 1LL<<50;\\n for(int i=0;i<n;i++){\\n G.add_edge(st(i),Z,0,INF,0);\\n G.add_edge(en(i),st(i),0,INF,-1);\\n G.add_edge(Z,en(i),0,INF,T);\\n }\\n\\n for(int i=0;i<m;i++){\\n if(fs[i]==+1)\\n G.add_edge(en(us[i]),st(vs[i]),0,INF,-1);\\n if(fs[i]==-1)\\n G.add_edge(st(vs[i]),en(us[i]),0,INF,0);\\n }\\n\\n for(int i=0;i+1<n;i++)\\n G.add_edge(st(i+1),st(i),0,INF,0);\\n\\n for(int i=0;i<n;i++){\\n G.add_edge(st(i),en(i),0,xs[i]-ys[i],qs[i]);\\n if(xs[i]>=0)\\n G.add_edge(en(i),st(i),xs[i],INF,0);\\n else\\n G.add_edge(st(i),en(i),0,abs(xs[i]),0);\\n }\\n if(!G.build()) return -1;\\n return G.get_cost<__int128_t>();\\n };\\n\\n ll L=0,R=1e12;\\n // check(L) < need\\n // check(R) >= need\\n if(check(R)<need) drop(-1);\\n while(L+1<R){\\n ll M=(L+R)>>1;\\n if(check(M)>=need) R=M;\\n else L=M;\\n }\\n cout<<R<<newl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.7611,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3171_4867708\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\n\\n// O(m^2 \\\\log n \\\\log U)\\n// U: maximum capacity\\nenum Objective{\\n MINIMIZE = +1,\\n MAXIMIZE = -1,\\n};\\ntemplate<typename Flow, typename Cost,\\n Objective objective = Objective::MINIMIZE>\\nstruct MinCostFlow{\\n template<typename T> inline void chmin(T &x,T y){x=min(x,y);}\\n\\n struct Edge{\\n int src,dst;\\n Flow flow,cap;\\n Cost cost;\\n int rev;\\n Edge(int src,int dst,Flow cap,Cost cost,int rev):\\n src(src),dst(dst),flow(0),cap(cap),cost(cost),rev(rev){}\\n Flow residual_cap()const{return cap-flow;}\\n };\\n\\n struct EdgePtr{\\n int v,e;\\n EdgePtr(int v,int e):v(v),e(e){}\\n };\\n\\n int n;\\n vector<vector<Edge>> G;\\n vector<Flow> b;\\n vector<Cost> p;\\n\\n MinCostFlow(int n):n(n),G(n),b(n,0){}\\n\\n EdgePtr add_edge(int src,int dst,Flow lower,Flow upper,Cost cost){\\n int e=G[src].size();\\n int r=(src==dst?e+1:G[dst].size());\\n assert(lower<=upper);\\n G[src].emplace_back(src,dst,+upper,+cost*objective,r);\\n G[dst].emplace_back(dst,src,-lower,-cost*objective,e);\\n return EdgePtr(src,e);\\n }\\n\\n const Edge &get_edge(EdgePtr ep)const{return G[ep.v][ep.e];}\\n\\n void push(Edge &e,Flow amount){\\n e.flow+=amount;\\n G[e.dst][e.rev].flow-=amount;\\n }\\n\\n void add_supply(int v,Flow amount){b[v]+=amount;}\\n void add_demand(int v,Flow amount){b[v]-=amount;}\\n\\n Cost residual_cost(const Edge &e){\\n return e.cost+p[e.src]-p[e.dst];\\n }\\n\\n vector<int> excess_vs,deficit_vs;\\n void saturate_negative(const Flow delta){\\n for(auto &es:G){\\n for(auto &e:es){\\n Flow cap=e.residual_cap();\\n cap-=cap%delta;\\n if(cap<0 or residual_cost(e)<0){\\n push(e,cap);\\n b[e.src]-=cap;\\n b[e.dst]+=cap;\\n }\\n }\\n }\\n\\n excess_vs.clear();\\n deficit_vs.clear();\\n for(int v=0;v<n;v++){\\n if(b[v]>0) excess_vs.emplace_back(v);\\n if(b[v]<0) deficit_vs.emplace_back(v);\\n }\\n }\\n\\n const Cost unreachable = std::numeric_limits<Cost>::max();\\n Cost farthest;\\n vector<Cost> dist;\\n vector<Edge*> parent;\\n\\n struct P{\\n Cost first;\\n int second;\\n P(Cost first,int second):first(first),second(second){}\\n bool operator<(const P o)const{return first>o.first;}\\n };\\n\\n priority_queue<P> pq;\\n\\n template<typename Predicate>\\n void eliminate(vector<int> &vs,Predicate predicate){\\n vs.erase(remove_if(begin(vs),end(vs),predicate),end(vs));\\n }\\n\\n bool dual(const Flow delta){\\n eliminate(excess_vs, [&](int v){return b[v]<+delta;});\\n eliminate(deficit_vs,[&](int v){return b[v]>-delta;});\\n\\n dist.assign(n,unreachable);\\n for(int v:excess_vs) pq.emplace(dist[v]=0,v);\\n\\n parent.assign(n,nullptr);\\n auto emplace=[&](Edge& e){\\n if(e.residual_cap()<delta) return;\\n Cost nxt=dist[e.src]+residual_cost(e);\\n if(nxt>=dist[e.dst]) return;\\n pq.emplace(dist[e.dst]=nxt,e.dst);\\n parent[e.dst]=&e;\\n };\\n\\n farthest=0;\\n int deficit_count=0;\\n while(!pq.empty()){\\n Cost d=pq.top().first;\\n int v=pq.top().second;\\n pq.pop();\\n if(dist[v]<d) continue;\\n farthest=d;\\n\\n if(b[v]<=-delta) deficit_count++;\\n if(deficit_count>=(int)deficit_vs.size()) break;\\n\\n for(auto &e:G[v]) emplace(e);\\n }\\n pq=decltype(pq)();\\n\\n for(int v=0;v<n;v++)\\n p[v]+=min(dist[v],farthest);\\n\\n return deficit_count>0;\\n }\\n\\n void primal(const Flow delta){\\n for(int t:deficit_vs){\\n if(dist[t]>farthest) continue;\\n Flow f=-b[t];\\n int v;\\n for(v=t;parent[v];v=parent[v]->src)\\n chmin(f,parent[v]->residual_cap());\\n chmin(f,b[v]);\\n\\n f-=f%delta;\\n if(f<=0) continue;\\n\\n for(v=t;parent[v];){\\n auto &e=*parent[v];\\n push(e,f);\\n int u=parent[v]->src;\\n if(e.residual_cap()<=0) parent[v]=nullptr;\\n v=u;\\n }\\n b[t]+=f;\\n b[v]-=f;\\n }\\n }\\n\\n template<Flow SCALING_FACTOR=2>\\n bool build(){\\n p.resize(n);\\n Flow max_flow=1;\\n for(auto t:b) max_flow=max({max_flow,t,-t});\\n for(auto &es:G)\\n for(auto &e:es)\\n max_flow=max({max_flow,e.residual_cap(),-e.residual_cap()});\\n\\n Flow delta=1;\\n while(delta<max_flow) delta*=SCALING_FACTOR;\\n for(;delta;delta/=SCALING_FACTOR){\\n saturate_negative(delta);\\n while(dual(delta)) primal(delta);\\n }\\n\\n return excess_vs.empty() and deficit_vs.empty();\\n }\\n\\n template<typename T=Cost>\\n T get_cost(){\\n T res=0;\\n for(auto &es:G)\\n for(auto &e:es)\\n res+=T(e.flow)*T(e.cost)/T(objective);\\n return res/T(2);\\n }\\n template<typename T=Cost> T get_gain(){return get_cost();}\\n\\n vector<Cost> get_potential(){\\n fill(p.begin(),p.end(),0);\\n for(int i=0;i<n;i++)\\n for(auto &es:G)\\n for(auto &e:es)\\n if(e.residual_cap()>0)\\n chmin(p[e.dst],p[e.src]+e.cost);\\n return p;\\n }\\n};\\n\\ntemplate<typename Flow, typename Cost>\\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\\n\\n\\ntemplate<typename TV, const int N> void read_tuple_impl(TV&) {}\\ntemplate<typename TV, const int N, typename Head, typename... Tail>\\nvoid read_tuple_impl(TV& ts) {\\n get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));\\n read_tuple_impl<TV, N+1, Tail...>(ts);\\n}\\ntemplate<typename... Ts> decltype(auto) read_tuple(size_t n) {\\n tuple<vector<Ts>...> ts;\\n for(size_t i=0;i<n;i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);\\n return ts;\\n}\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n using ll = long long;\\n\\n int n,m,need;\\n cin>>n>>m>>need;\\n auto [xs,ys,qs]=read_tuple<int, int, int>(n);\\n auto [us,vs,fs]=read_tuple<int, int, int>(m);\\n\\n for(int i=0;i<m;i++) us[i]--,vs[i]--;\\n\\n auto st=[&](int i){return 0+i;};\\n auto en=[&](int i){return n+i;};\\n auto check=[&](ll T)->__int128_t{\\n int Z=n+n;\\n MinCostFlow<ll, ll> G(n+n+1);\\n\\n const ll INF = 1LL<<40;\\n for(int i=0;i<n;i++){\\n G.add_edge(st(i),Z,0,INF,0);\\n G.add_edge(en(i),st(i),0,INF,-1);\\n G.add_edge(Z,en(i),0,INF,T);\\n }\\n\\n for(int i=0;i<m;i++){\\n if(fs[i]==+1)\\n G.add_edge(en(us[i]),st(vs[i]),0,INF,-1);\\n if(fs[i]==-1)\\n G.add_edge(st(vs[i]),en(us[i]),0,INF,0);\\n }\\n\\n for(int i=0;i+1<n;i++)\\n G.add_edge(st(i+1),st(i),0,INF,0);\\n\\n for(int i=0;i<n;i++){\\n G.add_edge(st(i),en(i),0,xs[i]-ys[i],qs[i]);\\n if(xs[i]>=0)\\n G.add_edge(en(i),st(i),xs[i],INF,0);\\n else\\n G.add_edge(st(i),en(i),0,abs(xs[i]),0);\\n }\\n if(!G.build()) return -1;\\n return G.get_cost<__int128_t>();\\n };\\n\\n ll L=0,R=1e9;\\n // check(L) < need\\n // check(R) >= need\\n if(check(R)<need) drop(-1);\\n while(L+1<R){\\n ll M=(L+R)>>1;\\n if(check(M)>=need) R=M;\\n else L=M;\\n }\\n cout<<R<<newl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.6811,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3171_4867690\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\n\\n// O(m^2 \\\\log n \\\\log U)\\n// U: maximum capacity\\nenum Objective{\\n MINIMIZE = +1,\\n MAXIMIZE = -1,\\n};\\ntemplate<typename Flow, typename Cost,\\n Objective objective = Objective::MINIMIZE>\\nstruct MinCostFlow{\\n template<typename T> inline void chmin(T &x,T y){x=min(x,y);}\\n\\n struct Edge{\\n int src,dst;\\n Flow flow,cap;\\n Cost cost;\\n int rev;\\n Edge(int src,int dst,Flow cap,Cost cost,int rev):\\n src(src),dst(dst),flow(0),cap(cap),cost(cost),rev(rev){}\\n Flow residual_cap()const{return cap-flow;}\\n };\\n\\n struct EdgePtr{\\n int v,e;\\n EdgePtr(int v,int e):v(v),e(e){}\\n };\\n\\n int n;\\n vector<vector<Edge>> G;\\n vector<Flow> b;\\n vector<Cost> p;\\n\\n MinCostFlow(int n):n(n),G(n),b(n,0){}\\n\\n EdgePtr add_edge(int src,int dst,Flow lower,Flow upper,Cost cost){\\n int e=G[src].size();\\n int r=(src==dst?e+1:G[dst].size());\\n assert(lower<=upper);\\n G[src].emplace_back(src,dst,+upper,+cost*objective,r);\\n G[dst].emplace_back(dst,src,-lower,-cost*objective,e);\\n return EdgePtr(src,e);\\n }\\n\\n const Edge &get_edge(EdgePtr ep)const{return G[ep.v][ep.e];}\\n\\n void push(Edge &e,Flow amount){\\n e.flow+=amount;\\n G[e.dst][e.rev].flow-=amount;\\n }\\n\\n void add_supply(int v,Flow amount){b[v]+=amount;}\\n void add_demand(int v,Flow amount){b[v]-=amount;}\\n\\n Cost residual_cost(const Edge &e){\\n return e.cost+p[e.src]-p[e.dst];\\n }\\n\\n vector<int> excess_vs,deficit_vs;\\n void saturate_negative(const Flow delta){\\n for(auto &es:G){\\n for(auto &e:es){\\n Flow cap=e.residual_cap();\\n cap-=cap%delta;\\n if(cap<0 or residual_cost(e)<0){\\n push(e,cap);\\n b[e.src]-=cap;\\n b[e.dst]+=cap;\\n }\\n }\\n }\\n\\n excess_vs.clear();\\n deficit_vs.clear();\\n for(int v=0;v<n;v++){\\n if(b[v]>0) excess_vs.emplace_back(v);\\n if(b[v]<0) deficit_vs.emplace_back(v);\\n }\\n }\\n\\n const Cost unreachable = std::numeric_limits<Cost>::max();\\n Cost farthest;\\n vector<Cost> dist;\\n vector<Edge*> parent;\\n\\n struct P{\\n Cost first;\\n int second;\\n P(Cost first,int second):first(first),second(second){}\\n bool operator<(const P o)const{return first>o.first;}\\n };\\n\\n priority_queue<P> pq;\\n\\n template<typename Predicate>\\n void eliminate(vector<int> &vs,Predicate predicate){\\n vs.erase(remove_if(begin(vs),end(vs),predicate),end(vs));\\n }\\n\\n bool dual(const Flow delta){\\n eliminate(excess_vs, [&](int v){return b[v]<+delta;});\\n eliminate(deficit_vs,[&](int v){return b[v]>-delta;});\\n\\n dist.assign(n,unreachable);\\n for(int v:excess_vs) pq.emplace(dist[v]=0,v);\\n\\n parent.assign(n,nullptr);\\n auto emplace=[&](Edge& e){\\n if(e.residual_cap()<delta) return;\\n Cost nxt=dist[e.src]+residual_cost(e);\\n if(nxt>=dist[e.dst]) return;\\n pq.emplace(dist[e.dst]=nxt,e.dst);\\n parent[e.dst]=&e;\\n };\\n\\n farthest=0;\\n int deficit_count=0;\\n while(!pq.empty()){\\n Cost d=pq.top().first;\\n int v=pq.top().second;\\n pq.pop();\\n if(dist[v]<d) continue;\\n farthest=d;\\n\\n if(b[v]<=-delta) deficit_count++;\\n if(deficit_count>=(int)deficit_vs.size()) break;\\n\\n for(auto &e:G[v]) emplace(e);\\n }\\n pq=decltype(pq)();\\n\\n for(int v=0;v<n;v++)\\n p[v]+=min(dist[v],farthest);\\n\\n return deficit_count>0;\\n }\\n\\n void primal(const Flow delta){\\n for(int t:deficit_vs){\\n if(dist[t]>farthest) continue;\\n Flow f=-b[t];\\n int v;\\n for(v=t;parent[v];v=parent[v]->src)\\n chmin(f,parent[v]->residual_cap());\\n chmin(f,b[v]);\\n\\n f-=f%delta;\\n if(f<=0) continue;\\n\\n for(v=t;parent[v];){\\n auto &e=*parent[v];\\n push(e,f);\\n int u=parent[v]->src;\\n if(e.residual_cap()<=0) parent[v]=nullptr;\\n v=u;\\n }\\n b[t]+=f;\\n b[v]-=f;\\n }\\n }\\n\\n template<Flow SCALING_FACTOR=2>\\n bool build(){\\n p.resize(n);\\n Flow max_flow=1;\\n for(auto t:b) max_flow=max({max_flow,t,-t});\\n for(auto &es:G)\\n for(auto &e:es)\\n max_flow=max({max_flow,e.residual_cap(),-e.residual_cap()});\\n\\n Flow delta=1;\\n while(delta<max_flow) delta*=SCALING_FACTOR;\\n for(;delta;delta/=SCALING_FACTOR){\\n saturate_negative(delta);\\n while(dual(delta)) primal(delta);\\n }\\n\\n return excess_vs.empty() and deficit_vs.empty();\\n }\\n\\n template<typename T=Cost>\\n T get_cost(){\\n T res=0;\\n for(auto &es:G)\\n for(auto &e:es)\\n res+=T(e.flow)*T(e.cost)/T(objective);\\n return res/T(2);\\n }\\n template<typename T=Cost> T get_gain(){return get_cost();}\\n\\n vector<Cost> get_potential(){\\n fill(p.begin(),p.end(),0);\\n for(int i=0;i<n;i++)\\n for(auto &es:G)\\n for(auto &e:es)\\n if(e.residual_cap()>0)\\n chmin(p[e.dst],p[e.src]+e.cost);\\n return p;\\n }\\n};\\n\\ntemplate<typename Flow, typename Cost>\\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\\n\\n\\ntemplate<typename TV, const int N> void read_tuple_impl(TV&) {}\\ntemplate<typename TV, const int N, typename Head, typename... Tail>\\nvoid read_tuple_impl(TV& ts) {\\n get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));\\n read_tuple_impl<TV, N+1, Tail...>(ts);\\n}\\ntemplate<typename... Ts> decltype(auto) read_tuple(size_t n) {\\n tuple<vector<Ts>...> ts;\\n for(size_t i=0;i<n;i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);\\n return ts;\\n}\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n using ll = long long;\\n\\n int n,m,need;\\n cin>>n>>m>>need;\\n auto [xs,ys,qs]=read_tuple<int, int, int>(n);\\n auto [us,vs,fs]=read_tuple<int, int, int>(m);\\n\\n for(int i=0;i<m;i++) us[i]--,vs[i]--;\\n\\n auto st=[&](int i){return 0+i;};\\n auto en=[&](int i){return n+i;};\\n auto check=[&](ll T)->ll{\\n int Z=n+n;\\n MinCostFlow<ll, ll> G(n+n+1);\\n\\n const ll INF = 1LL<<60;\\n for(int i=0;i<n;i++){\\n G.add_edge(st(i),Z,0,INF,0);\\n G.add_edge(en(i),st(i),0,INF,-1);\\n G.add_edge(Z,en(i),0,INF,T);\\n }\\n\\n for(int i=0;i<m;i++){\\n if(fs[i]==+1)\\n G.add_edge(en(us[i]),st(vs[i]),0,INF,-1);\\n if(fs[i]==-1)\\n G.add_edge(st(vs[i]),en(us[i]),0,INF,0);\\n }\\n\\n for(int i=0;i+1<n;i++)\\n G.add_edge(st(i+1),st(i),0,INF,0);\\n\\n for(int i=0;i<n;i++){\\n G.add_edge(st(i),en(i),0,xs[i]-ys[i],qs[i]);\\n if(xs[i]>=0)\\n G.add_edge(en(i),st(i),xs[i],INF,0);\\n else\\n G.add_edge(st(i),en(i),0,abs(xs[i]),0);\\n }\\n if(!G.build()) return -1;\\n return G.get_cost();\\n };\\n\\n ll L=0,R=1e9;\\n // check(L) < need\\n // check(R) >= need\\n if(check(R)<need) drop(-1);\\n while(L+1<R){\\n int M=(L+R)>>1;\\n if(check(M)>=need) R=M;\\n else L=M;\\n }\\n cout<<R<<newl;\\n return 0;\\n}\",\n \"accuracy\": 0.13333333333333333,\n \"time_ms\": 10,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -0.3288,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3171_4867679\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\n\\n// O(m^2 \\\\log n \\\\log U)\\n// U: maximum capacity\\nenum Objective{\\n MINIMIZE = +1,\\n MAXIMIZE = -1,\\n};\\ntemplate<typename Flow, typename Cost,\\n Objective objective = Objective::MINIMIZE>\\nstruct MinCostFlow{\\n template<typename T> inline void chmin(T &x,T y){x=min(x,y);}\\n\\n struct Edge{\\n int src,dst;\\n Flow flow,cap;\\n Cost cost;\\n int rev;\\n Edge(int src,int dst,Flow cap,Cost cost,int rev):\\n src(src),dst(dst),flow(0),cap(cap),cost(cost),rev(rev){}\\n Flow residual_cap()const{return cap-flow;}\\n };\\n\\n struct EdgePtr{\\n int v,e;\\n EdgePtr(int v,int e):v(v),e(e){}\\n };\\n\\n int n;\\n vector<vector<Edge>> G;\\n vector<Flow> b;\\n vector<Cost> p;\\n\\n MinCostFlow(int n):n(n),G(n),b(n,0){}\\n\\n EdgePtr add_edge(int src,int dst,Flow lower,Flow upper,Cost cost){\\n int e=G[src].size();\\n int r=(src==dst?e+1:G[dst].size());\\n assert(lower<=upper);\\n G[src].emplace_back(src,dst,+upper,+cost*objective,r);\\n G[dst].emplace_back(dst,src,-lower,-cost*objective,e);\\n return EdgePtr(src,e);\\n }\\n\\n const Edge &get_edge(EdgePtr ep)const{return G[ep.v][ep.e];}\\n\\n void push(Edge &e,Flow amount){\\n e.flow+=amount;\\n G[e.dst][e.rev].flow-=amount;\\n }\\n\\n void add_supply(int v,Flow amount){b[v]+=amount;}\\n void add_demand(int v,Flow amount){b[v]-=amount;}\\n\\n Cost residual_cost(const Edge &e){\\n return e.cost+p[e.src]-p[e.dst];\\n }\\n\\n vector<int> excess_vs,deficit_vs;\\n void saturate_negative(const Flow delta){\\n for(auto &es:G){\\n for(auto &e:es){\\n Flow cap=e.residual_cap();\\n cap-=cap%delta;\\n if(cap<0 or residual_cost(e)<0){\\n push(e,cap);\\n b[e.src]-=cap;\\n b[e.dst]+=cap;\\n }\\n }\\n }\\n\\n excess_vs.clear();\\n deficit_vs.clear();\\n for(int v=0;v<n;v++){\\n if(b[v]>0) excess_vs.emplace_back(v);\\n if(b[v]<0) deficit_vs.emplace_back(v);\\n }\\n }\\n\\n const Cost unreachable = std::numeric_limits<Cost>::max();\\n Cost farthest;\\n vector<Cost> dist;\\n vector<Edge*> parent;\\n\\n struct P{\\n Cost first;\\n int second;\\n P(Cost first,int second):first(first),second(second){}\\n bool operator<(const P o)const{return first>o.first;}\\n };\\n\\n priority_queue<P> pq;\\n\\n template<typename Predicate>\\n void eliminate(vector<int> &vs,Predicate predicate){\\n vs.erase(remove_if(begin(vs),end(vs),predicate),end(vs));\\n }\\n\\n bool dual(const Flow delta){\\n eliminate(excess_vs, [&](int v){return b[v]<+delta;});\\n eliminate(deficit_vs,[&](int v){return b[v]>-delta;});\\n\\n dist.assign(n,unreachable);\\n for(int v:excess_vs) pq.emplace(dist[v]=0,v);\\n\\n parent.assign(n,nullptr);\\n auto emplace=[&](Edge& e){\\n if(e.residual_cap()<delta) return;\\n Cost nxt=dist[e.src]+residual_cost(e);\\n if(nxt>=dist[e.dst]) return;\\n pq.emplace(dist[e.dst]=nxt,e.dst);\\n parent[e.dst]=&e;\\n };\\n\\n farthest=0;\\n int deficit_count=0;\\n while(!pq.empty()){\\n Cost d=pq.top().first;\\n int v=pq.top().second;\\n pq.pop();\\n if(dist[v]<d) continue;\\n farthest=d;\\n\\n if(b[v]<=-delta) deficit_count++;\\n if(deficit_count>=(int)deficit_vs.size()) break;\\n\\n for(auto &e:G[v]) emplace(e);\\n }\\n pq=decltype(pq)();\\n\\n for(int v=0;v<n;v++)\\n p[v]+=min(dist[v],farthest);\\n\\n return deficit_count>0;\\n }\\n\\n void primal(const Flow delta){\\n for(int t:deficit_vs){\\n if(dist[t]>farthest) continue;\\n Flow f=-b[t];\\n int v;\\n for(v=t;parent[v];v=parent[v]->src)\\n chmin(f,parent[v]->residual_cap());\\n chmin(f,b[v]);\\n\\n f-=f%delta;\\n if(f<=0) continue;\\n\\n for(v=t;parent[v];){\\n auto &e=*parent[v];\\n push(e,f);\\n int u=parent[v]->src;\\n if(e.residual_cap()<=0) parent[v]=nullptr;\\n v=u;\\n }\\n b[t]+=f;\\n b[v]-=f;\\n }\\n }\\n\\n template<Flow SCALING_FACTOR=2>\\n bool build(){\\n p.resize(n);\\n Flow max_flow=1;\\n for(auto t:b) max_flow=max({max_flow,t,-t});\\n for(auto &es:G)\\n for(auto &e:es)\\n max_flow=max({max_flow,e.residual_cap(),-e.residual_cap()});\\n\\n Flow delta=1;\\n while(delta<max_flow) delta*=SCALING_FACTOR;\\n for(;delta;delta/=SCALING_FACTOR){\\n saturate_negative(delta);\\n while(dual(delta)) primal(delta);\\n }\\n\\n return excess_vs.empty() and deficit_vs.empty();\\n }\\n\\n template<typename T=Cost>\\n T get_cost(){\\n T res=0;\\n for(auto &es:G)\\n for(auto &e:es)\\n res+=T(e.flow)*T(e.cost)/T(objective);\\n return res/T(2);\\n }\\n template<typename T=Cost> T get_gain(){return get_cost();}\\n\\n vector<Cost> get_potential(){\\n fill(p.begin(),p.end(),0);\\n for(int i=0;i<n;i++)\\n for(auto &es:G)\\n for(auto &e:es)\\n if(e.residual_cap()>0)\\n chmin(p[e.dst],p[e.src]+e.cost);\\n return p;\\n }\\n};\\n\\ntemplate<typename Flow, typename Cost>\\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\\n\\n\\ntemplate<typename TV, const int N> void read_tuple_impl(TV&) {}\\ntemplate<typename TV, const int N, typename Head, typename... Tail>\\nvoid read_tuple_impl(TV& ts) {\\n get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));\\n read_tuple_impl<TV, N+1, Tail...>(ts);\\n}\\ntemplate<typename... Ts> decltype(auto) read_tuple(size_t n) {\\n tuple<vector<Ts>...> ts;\\n for(size_t i=0;i<n;i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);\\n return ts;\\n}\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n using ll = long long;\\n\\n int n,m,need;\\n cin>>n>>m>>need;\\n auto [xs,ys,qs]=read_tuple<int, int, int>(n);\\n auto [us,vs,fs]=read_tuple<int, int, int>(m);\\n\\n for(int i=0;i<m;i++) us[i]--,vs[i]--;\\n\\n auto st=[&](int i){return 0+i;};\\n auto en=[&](int i){return n+i;};\\n auto check=[&](ll T)->ll{\\n int Z=n+n;\\n MinCostFlow<ll, ll> G(n+n+1);\\n\\n const ll INF = 1LL<<40;\\n for(int i=0;i<n;i++){\\n G.add_edge(st(i),Z,0,INF,0);\\n G.add_edge(en(i),st(i),0,INF,-1);\\n G.add_edge(Z,en(i),0,INF,T);\\n }\\n\\n for(int i=0;i<m;i++){\\n if(fs[i]==+1)\\n G.add_edge(en(us[i]),st(vs[i]),0,INF,-1);\\n if(fs[i]==-1)\\n G.add_edge(st(vs[i]),en(us[i]),0,INF,0);\\n }\\n\\n for(int i=0;i+1<n;i++)\\n G.add_edge(st(i+1),st(i),0,INF,0);\\n\\n for(int i=0;i<n;i++){\\n G.add_edge(st(i),en(i),0,xs[i]-ys[i],qs[i]);\\n if(xs[i]>=0)\\n G.add_edge(en(i),st(i),xs[i],INF,0);\\n else\\n G.add_edge(st(i),en(i),0,abs(xs[i]),0);\\n }\\n if(!G.build()) return -1;\\n return G.get_cost();\\n };\\n\\n ll L=0,R=1e9;\\n // check(L) < need\\n // check(R) >= need\\n if(check(R)<need) drop(-1);\\n while(L+1<R){\\n int M=(L+R)>>1;\\n if(check(M)>=need) R=M;\\n else L=M;\\n }\\n cout<<R<<newl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.6874,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3171_4853174\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\n// Ford-Fulkerson 法による 最大流 O( F |E| )\\n// Bellman-Ford 法による 最小費用流 O( F |V| |E| )\\n// [条件に注意] Dijkstra 法による 最小費用流 O( F |E| log |V| )\\n\\ntemplate <typename CapTp=int, typename CostTp=int>\\nstruct Edge {\\n int to, rev;\\n CapTp cap; CostTp cost;\\n bool is_rev;\\n Edge(int t, bool f, int r, CapTp ca, CostTp co=0)\\n : to(t), rev(r), cap(ca), cost(co), is_rev(f) {}\\n};\\n\\ntemplate <typename CapTp=int, typename CostTp=int>\\nstruct Flow {\\n using Graph = vector< vector< Edge<CapTp, CostTp> > >;\\n Graph G; const CapTp IA; const CostTp IO, NIL;\\n vector< pair<int, int> > r_edges;\\n vector<CostTp> dist, pot;\\n vector<int> prevv, preve;\\n\\n Flow(int N_, CapTp IA_=1<<29, CostTp IO_=1<<29, CostTp NIL_=-1)\\n : G(N_), IA(IA_), IO(IO_), NIL(NIL_), r_edges(),\\n dist(N_), pot(N_), prevv(N_), preve(N_) {}\\n // 辺を追加 (from -> to に流量 ca, コスト co)\\n void add_edge(int from, int to, CapTp ca, CostTp co=0) {\\n G[from].emplace_back(to, false, G[to].size(), ca, co);\\n G[to].emplace_back(from, true, G[from].size() - 1, 0, -co);\\n r_edges.emplace_back(to, G[to].size() - 1);\\n }\\n // k 番目の辺にいくつ流れたか\\n CapTp get_flowed_cap(size_t k) {\\n if(r_edges.size() <= k) return -1;\\n int v, i; tie(v, i) = r_edges[k];\\n return G[v][i].cap;\\n }\\n // s -> t 最大流\\n CapTp max_flow(int s, int t) {\\n vector<bool> used(G.size());\\n auto dfs = [&](auto &&func, int v, int t, CapTp f) -> CapTp {\\n if(v == t) return f;\\n used[v] = true;\\n for(auto &e : G[v]) {\\n if(used[e.to] or e.cap == 0) continue;\\n CapTp d = func(func, e.to, t, min(f, e.cap));\\n if(d == 0) continue;\\n e.cap -= d; G[e.to][e.rev].cap += d;\\n return d;\\n }\\n return 0;\\n };\\n\\n CapTp res(0);\\n while(true) {\\n fill(used.begin(), used.end(), false);\\n CapTp delta = dfs(dfs, s, t, IA);\\n if(delta == 0) return res;\\n res += delta;\\n }\\n }\\n // ベルマンフォードをつかって最小費用流\\n CostTp mincost_flow(int s, int t, CapTp f) {\\n CostTp res(0);\\n while(f > 0) {\\n fill(dist.begin(), dist.end(), IO);\\n dist[s] = 0;\\n while(1) {\\n bool upd = false;\\n for(int v=0; v<(int)G.size(); v++) {\\n if(dist[v] == IO) continue;\\n for(size_t i=0; i<G[v].size(); i++) {\\n auto &e = G[v][i];\\n if(e.cap == 0 or dist[e.to] <= dist[v] + e.cost) continue;\\n dist[e.to] = dist[v] + e.cost;\\n prevv[e.to] = v, preve[e.to] = i;\\n upd = true;\\n }\\n }\\n if(!upd) break;\\n }\\n\\n if(dist[t] == IO) return NIL;\\n CapTp d = f;\\n for(int v=t; v!=s; v=prevv[v]) d = min(d, G[prevv[v]][preve[v]].cap);\\n f -= d; res += d * dist[t];\\n for(int v=t; v!=s; v=prevv[v]) {\\n auto &e = G[prevv[v]][preve[v]];\\n e.cap -= d, G[v][e.rev].cap += d;\\n }\\n }\\n return res;\\n }\\n // ポテンシャルの導入により、ダイクストラ法で最小費用流を解く\\n // [仮定している条件]\\n // 1. グラフに負の閉路が存在しない (流量の 0 初期化のため)\\n // もし存在するならベルマンフォードで負の閉路を見つけ\\n // そこに流せるだけ流してスタート\\n // 2. グラフに負の辺が存在しない (pot_0 の計算可能性)\\n // もし存在する場合は最初のみベルマンフォードを使う必要あり\\n CostTp fast_mincost_flow(int s, int t, CapTp f) {\\n CostTp res(0);\\n fill(pot.begin(), pot.end(), CostTp(0));\\n\\n while(f > 0) {\\n using PT = pair<CostTp, int>;\\n priority_queue< PT, vector<PT>, greater<PT> > que;\\n fill(dist.begin(), dist.end(), IO);\\n\\n dist[s] = 0;\\n que.push(make_pair(0, s));\\n while(!que.empty()) {\\n PT cur = que.top(); que.pop();\\n int v = cur.second;\\n if(dist[v] < cur.first) continue;\\n for(size_t i=0; i<G[v].size(); i++) {\\n auto& e = G[v][i];\\n if(e.cap > 0 and dist[e.to] > dist[v] + e.cost + pot[v] - pot[e.to]) {\\n dist[e.to] = dist[v] + e.cost + pot[v] - pot[e.to];\\n prevv[e.to] = v;\\n preve[e.to] = i;\\n que.push(make_pair(dist[e.to], e.to));\\n }\\n }\\n }\\n if(dist[t] == IO) {\\n return NIL;\\n }\\n for(int v=0; v<(int)G.size(); v++) pot[v] += dist[v];\\n\\n CapTp d = f;\\n for(int v=t; v!=s; v=prevv[v]) {\\n d = min(d, G[prevv[v]][preve[v]].cap);\\n }\\n f -= d;\\n res += d * pot[t];\\n for(int v=t; v!=s; v=prevv[v]) {\\n auto& e = G[prevv[v]][preve[v]];\\n e.cap -= d;\\n G[v][e.rev].cap += d;\\n }\\n }\\n return res;\\n }\\n};\\n\\ntemplate <typename cap_tp=int, typename cost_tp=int,\\n template<typename, typename> class flow_fw=Flow>\\nstruct GeneralizedMincostFlow {\\nprivate:\\n flow_fw<cap_tp, cost_tp> fl;\\n vector<cap_tp> D;\\n int N, source, sink;\\n cap_tp Z_cap;\\n cost_tp Z_cost, ofs, ng;\\n int edge_id;\\n\\npublic:\\n GeneralizedMincostFlow(int N_,\\n cost_tp ng_=-1,\\n cap_tp IA=1<<29, cost_tp IO=1<<29,\\n cap_tp zero_cap=0, cost_tp zero_cost=0)\\n : fl(N_+2, IA, IO, ng_), D(N_), N(N_), source(N_), sink(N_+1),\\n Z_cap(zero_cap), Z_cost(zero_cost), ofs(zero_cost), ng(ng_),\\n edge_id(0) {}\\n\\n int add_edge(int u, int v, cap_tp low, cap_tp high, cost_tp cost) {\\n assert(low <= high);\\n if(low < Z_cap) {\\n add_edge(v, u, -low, -low, -cost);\\n add_edge(u, v, 0, high - low, +cost);\\n return -1; // TODO ?\\n }\\n int id = -1;\\n\\n // コストが負の場合\\n if(cost < Z_cost) {\\n // 流すだけ得なので high 流れたことにする\\n ofs += high * cost;\\n D[u] -= high; D[v] += high;\\n // 目一杯流したのを high - low 分だけキャンセル可能\\n if(high - low > Z_cap) {\\n id = edge_id++;\\n fl.add_edge(v, u, high - low, -cost);\\n }\\n }\\n else {\\n // v 側に low 流れたことにする\\n ofs += low * cost;\\n D[u] -= low; D[v] += low;\\n // high - low 分の辺を張る\\n if(high - low > Z_cap) {\\n id = edge_id++;\\n fl.add_edge(u, v, high - low, cost);\\n }\\n }\\n return id;\\n }\\n int add_edge(int u, int v, cap_tp cap, cost_tp cost) {\\n return add_edge(u, v, Z_cap, cap, cost);\\n }\\n void change_d(int u, cap_tp delta) {\\n D[u] += delta;\\n }\\n\\n cost_tp mincost_flow() {\\n cap_tp sum_d = 0;\\n for(int i=0; i<N; i++) {\\n if(D[i] > 0) {\\n fl.add_edge(source, i, D[i], 0);\\n sum_d += D[i];\\n }\\n else {\\n fl.add_edge(i, sink, -D[i], 0);\\n }\\n }\\n\\n cost_tp res = fl.fast_mincost_flow(source, sink, sum_d);\\n if(res == fl.NIL) return ng;\\n else return ofs + res;\\n }\\n\\n cap_tp get_flowed_cap(size_t k) {\\n return fl.get_flowed_cap(k);\\n }\\n\\n cap_tp operator[](size_t k) {\\n return fl.pot[k];\\n }\\n};\\n\\nconst int INF=1e9;\\n\\nsigned main(){\\n int n,m,x;cin>>n>>m>>x;\\n vector<int> a(n),b(n),p(n),u(m),v(m),f(m);\\n for(int i=0;i<n;i++){\\n cin>>a[i]>>b[i]>>p[i];\\n x-=a[i]*p[i];\\n }\\n for(int i=0;i<m;i++){\\n cin>>u[i]>>v[i]>>f[i];\\n u[i]--;v[i]--;\\n }\\n int ng=-1,ok=INF;//ok時間あれば仕事量xを達成できる\\n while(ok-ng>1){\\n int mid=(ok+ng)>>1;\\n GeneralizedMincostFlow<> fl(n*2+1);//[0,n)がs[i]、[n,2n-1)がt[i]、2nがz\\n int z=2*n;\\n for(int i=0;i<n;i++){\\n if(i)fl.add_edge(i,i-1,0,INF,0);\\n fl.add_edge(i,z,0,INF,0);\\n fl.add_edge(n+i,i,0,INF,-1);\\n fl.add_edge(z,n+i,0,INF,mid);\\n fl.add_edge(n+i,i,b[i],a[i],-p[i]);\\n }\\n for(int i=0;i<m;i++){\\n if(~f[i])fl.add_edge(u[i]+n,v[i],0,INF,-1);\\n else fl.add_edge(v[i],u[i]+n,0,INF,0);\\n }\\n if(x<=fl.mincost_flow())ok=mid;\\n else ng=mid;\\n }\\n if(ng>1e7)cout<<-1<<endl;\\n else cout<<ok<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 3276,\n \"score_of_the_acc\": -0.68,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3171_4850087\",\n \"code_snippet\": \"#include <vector>\\n#include <utility>\\n#include <tuple>\\n#include <queue>\\n#include <algorithm>\\n#include <cassert>\\n#include <iostream>\\nusing namespace std;\\nusing ll = long long int;\\n\\n// Ford-Fulkerson 法による 最大流 O( F |E| )\\n// Bellman-Ford 法による 最小費用流 O( F |V| |E| )\\n// [条件に注意] Dijkstra 法による 最小費用流 O( F |E| log |V| )\\n\\ntemplate <typename CapTp=int, typename CostTp=int>\\nstruct Edge {\\n int to, rev;\\n CapTp cap; CostTp cost;\\n bool is_rev;\\n Edge(int t, bool f, int r, CapTp ca, CostTp co=0)\\n : to(t), rev(r), cap(ca), cost(co), is_rev(f) {}\\n};\\n\\ntemplate <typename CapTp=int, typename CostTp=int>\\nstruct Flow {\\n using Graph = vector< vector< Edge<CapTp, CostTp> > >;\\n Graph G; const CapTp IA; const CostTp IO, NIL;\\n vector< pair<int, int> > r_edges;\\n vector<CostTp> dist, pot;\\n vector<int> prevv, preve;\\n \\n Flow(int N_, CapTp IA_=1<<29, CostTp IO_=1<<29, CostTp NIL_=-1)\\n : G(N_), IA(IA_), IO(IO_), NIL(NIL_), r_edges(),\\n dist(N_), pot(N_), prevv(N_), preve(N_) {}\\n // 辺を追加 (from -> to に流量 ca, コスト co)\\n void add_edge(int from, int to, CapTp ca, CostTp co=0) {\\n G[from].emplace_back(to, false, G[to].size(), ca, co);\\n G[to].emplace_back(from, true, G[from].size() - 1, 0, -co);\\n r_edges.emplace_back(to, G[to].size() - 1);\\n }\\n // k 番目の辺にいくつ流れたか\\n CapTp get_flowed_cap(size_t k) {\\n if(r_edges.size() <= k) return -1;\\n int v, i; tie(v, i) = r_edges[k];\\n return G[v][i].cap;\\n }\\n // s -> t 最大流\\n CapTp max_flow(int s, int t) {\\n vector<bool> used(G.size());\\n auto dfs = [&](auto &&func, int v, int t, CapTp f) -> CapTp {\\n if(v == t) return f;\\n used[v] = true;\\n for(auto &e : G[v]) {\\n if(used[e.to] or e.cap == 0) continue;\\n CapTp d = func(func, e.to, t, min(f, e.cap));\\n if(d == 0) continue;\\n e.cap -= d; G[e.to][e.rev].cap += d;\\n return d;\\n }\\n return 0;\\n };\\n\\n CapTp res(0);\\n while(true) {\\n fill(used.begin(), used.end(), false);\\n CapTp delta = dfs(dfs, s, t, IA);\\n if(delta == 0) return res;\\n res += delta;\\n }\\n }\\n // ベルマンフォードをつかって最小費用流\\n CostTp mincost_flow(int s, int t, CapTp f) {\\n CostTp res(0);\\n while(f > 0) {\\n fill(dist.begin(), dist.end(), IO);\\n dist[s] = 0;\\n while(1) {\\n bool upd = false;\\n for(int v=0; v<(int)G.size(); v++) {\\n if(dist[v] == IO) continue;\\n for(size_t i=0; i<G[v].size(); i++) {\\n auto &e = G[v][i];\\n if(e.cap == 0 or dist[e.to] <= dist[v] + e.cost) continue;\\n dist[e.to] = dist[v] + e.cost;\\n prevv[e.to] = v, preve[e.to] = i;\\n upd = true;\\n }\\n }\\n if(!upd) break;\\n }\\n\\n if(dist[t] == IO) return NIL;\\n CapTp d = f;\\n for(int v=t; v!=s; v=prevv[v]) d = min(d, G[prevv[v]][preve[v]].cap);\\n f -= d; res += d * dist[t];\\n for(int v=t; v!=s; v=prevv[v]) {\\n auto &e = G[prevv[v]][preve[v]];\\n e.cap -= d, G[v][e.rev].cap += d;\\n }\\n }\\n return res;\\n }\\n // ポテンシャルの導入により、ダイクストラ法で最小費用流を解く\\n // [仮定している条件]\\n // 1. グラフに負の閉路が存在しない (流量の 0 初期化のため)\\n // もし存在するならベルマンフォードで負の閉路を見つけ\\n // そこに流せるだけ流してスタート\\n // 2. グラフに負の辺が存在しない (pot_0 の計算可能性)\\n // もし存在する場合は最初のみベルマンフォードを使う必要あり\\n CostTp fast_mincost_flow(int s, int t, CapTp f) {\\n CostTp res(0);\\n fill(pot.begin(), pot.end(), CostTp(0));\\n\\n while(f > 0) {\\n using PT = pair<CostTp, int>;\\n priority_queue< PT, vector<PT>, greater<PT> > que;\\n fill(dist.begin(), dist.end(), IO);\\n\\n dist[s] = 0;\\n que.push(make_pair(0, s));\\n while(!que.empty()) {\\n PT cur = que.top(); que.pop();\\n int v = cur.second;\\n if(dist[v] < cur.first) continue;\\n for(size_t i=0; i<G[v].size(); i++) {\\n auto& e = G[v][i];\\n if(e.cap > 0 and dist[e.to] > dist[v] + e.cost + pot[v] - pot[e.to]) {\\n dist[e.to] = dist[v] + e.cost + pot[v] - pot[e.to];\\n prevv[e.to] = v;\\n preve[e.to] = i;\\n que.push(make_pair(dist[e.to], e.to));\\n }\\n }\\n }\\n if(dist[t] == IO) {\\n return NIL;\\n }\\n for(int v=0; v<(int)G.size(); v++) pot[v] += dist[v];\\n\\n CapTp d = f;\\n for(int v=t; v!=s; v=prevv[v]) {\\n d = min(d, G[prevv[v]][preve[v]].cap);\\n }\\n f -= d;\\n res += d * pot[t];\\n for(int v=t; v!=s; v=prevv[v]) {\\n auto& e = G[prevv[v]][preve[v]];\\n e.cap -= d;\\n G[v][e.rev].cap += d;\\n }\\n }\\n return res;\\n } \\n};\\n\\ntemplate <typename cap_tp=int, typename cost_tp=int,\\n template<typename, typename> class flow_fw=Flow>\\nstruct GeneralizedMincostFlow {\\nprivate:\\n flow_fw<cap_tp, cost_tp> fl;\\n vector<cap_tp> D;\\n int N, source, sink;\\n cap_tp Z_cap;\\n cost_tp Z_cost, ofs, ng;\\n int edge_id;\\n\\npublic:\\n GeneralizedMincostFlow(int N_,\\n cost_tp ng_=-1,\\n cap_tp IA=1<<29, cost_tp IO=1<<29,\\n cap_tp zero_cap=0, cost_tp zero_cost=0)\\n : fl(N_+2, IA, IO, ng_), D(N_), N(N_), source(N_), sink(N_+1),\\n Z_cap(zero_cap), Z_cost(zero_cost), ofs(zero_cost), ng(ng_),\\n edge_id(0) {}\\n\\n int add_edge(int u, int v, cap_tp low, cap_tp high, cost_tp cost) {\\n assert(low <= high);\\n if(low < Z_cap) {\\n add_edge(v, u, -low, -low, -cost);\\n add_edge(u, v, 0, high - low, +cost);\\n return -1; // TODO ?\\n }\\n int id = -1;\\n \\n // コストが負の場合\\n if(cost < Z_cost) {\\n // 流すだけ得なので high 流れたことにする\\n ofs += high * cost;\\n D[u] -= high; D[v] += high;\\n // 目一杯流したのを high - low 分だけキャンセル可能\\n if(high - low > Z_cap) {\\n id = edge_id++;\\n fl.add_edge(v, u, high - low, -cost);\\n }\\n }\\n else {\\n // v 側に low 流れたことにする\\n ofs += low * cost;\\n D[u] -= low; D[v] += low;\\n // high - low 分の辺を張る\\n if(high - low > Z_cap) {\\n id = edge_id++;\\n fl.add_edge(u, v, high - low, cost);\\n }\\n }\\n return id;\\n }\\n int add_edge(int u, int v, cap_tp cap, cost_tp cost) {\\n return add_edge(u, v, Z_cap, cap, cost);\\n }\\n void change_d(int u, cap_tp delta) {\\n D[u] += delta;\\n }\\n \\n cost_tp mincost_flow() {\\n cap_tp sum_d = 0;\\n for(int i=0; i<N; i++) {\\n if(D[i] > 0) {\\n fl.add_edge(source, i, D[i], 0);\\n sum_d += D[i];\\n }\\n else {\\n fl.add_edge(i, sink, -D[i], 0);\\n }\\n }\\n\\n cost_tp res = fl.fast_mincost_flow(source, sink, sum_d);\\n if(res == fl.NIL) return ng;\\n else return ofs + res;\\n }\\n\\n cap_tp get_flowed_cap(size_t k) {\\n return fl.get_flowed_cap(k);\\n }\\n\\n cap_tp operator[](size_t k) {\\n return fl.pot[k];\\n }\\n};\\n\\nint main() {\\n ll N, M, X; scanf(\\\"%lld%lld%lld\\\", &N, &M, &X);\\n vector<ll> a(N), b(N), p(N);\\n ll ofs = 0;\\n for(int i=0; i<N; i++) {\\n scanf(\\\"%lld%lld%lld\\\", &a[i], &b[i], &p[i]);\\n ofs += a[i] * p[i];\\n }\\n vector<ll> u(M), v(M), f(M);\\n for(int i=0; i<M; i++) {\\n scanf(\\\"%lld%lld%lld\\\", &u[i], &v[i], &f[i]);\\n u[i]--; v[i]--;\\n }\\n\\n auto s = [](int k) { return k<<1; };\\n auto e = [](int k) { return k<<1|1; };\\n\\n auto calc = [&a, &b, &p](ll i, ll t) {\\n ll res = 0;\\n res += ll(1) * min(t, p[i]) * a[i];\\n res += ll(1) * max(ll(0), t - p[i]) * b[i];\\n return res;\\n };\\n \\n using flow_tp = ll;\\n const flow_tp INF = 1LL << 40;\\n const flow_tp LONGINF = 1LL << 60;\\n\\n ll LIM = 2LL * (N*N*100 + X);\\n flow_tp ub = LIM, lb = -1;\\n while(ub - lb > 1) {\\n flow_tp mid = (ub + lb) / 2;\\n GeneralizedMincostFlow<flow_tp, flow_tp> fl(2*N + 1, -INF, +LONGINF, +LONGINF);\\n int z = 2*N; // additional variable\\n for(int i=0; i<N; i++) {\\n fl.add_edge(s(i), z, 0, +INF, 0);\\n fl.add_edge(e(i), s(i), 0, +INF, -1);\\n fl.add_edge(z, e(i), 0, +INF, mid);\\n fl.add_edge(e(i), s(i), b[i], a[i], -p[i]);\\n }\\n for(int i=0; i+1<N; i++) {\\n fl.add_edge(s(i+1), s(i), 0, +INF, 0);\\n }\\n for(int i=0; i<M; i++) {\\n if(f[i] == +1) {\\n fl.add_edge(e(u[i]), s(v[i]), 0, +INF, -1);\\n }\\n if(f[i] == -1) {\\n fl.add_edge(s(v[i]), e(u[i]), 0, +INF, 0);\\n } \\n }\\n\\n flow_tp result = fl.mincost_flow();\\n if(result + ofs < X) lb = mid;\\n else ub = mid;\\n }\\n\\n if(ub == LIM) puts(\\\"-1\\\");\\n else cout << ub << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3676,\n \"score_of_the_acc\": -1.0849,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3171_4848740\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <iostream>\\n#include <string>\\n#include <cmath>\\n#include <bitset>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <complex>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <random>\\n#include <cassert>\\n#include <fstream>\\n#include <utility>\\n#include <functional>\\n#include <time.h>\\n#include <stack>\\n#include <array>\\n#include <list>\\n#define popcount __builtin_popcount\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntemplate<typename Flow, typename Cost>\\nstruct MinCostFlow{\\n\\tstruct edge{\\n\\t\\tint to, rev;\\n\\t\\tint num;\\n\\t\\tFlow flow;\\n\\t\\tFlow cap;\\n\\t\\tCost cost;\\n\\t\\tedge(int to, Flow flow, Flow cap, Cost cost, int rev, int num):to(to), flow(flow), cap(cap), cost(cost), rev(rev), num(num){}\\n\\t};\\n\\tint n;\\n\\tvector<vector<edge>> g;\\n\\tvector<Flow> b;\\n\\tvector<Cost> h, dist;\\n\\tvector<int> prevv, preve;\\n\\tMinCostFlow(int n):n(n), b(n), g(n), h(n), dist(n), prevv(n), preve(n){}\\n\\tvoid add_edge(int from, int to, Flow lower, Flow upper, Cost cost, int num){\\n\\t\\tint num1=g[to].size(), num2=g[from].size();\\n\\t\\tif(to==from) num1++;\\n\\t\\tg[from].push_back(edge(to, lower, upper, cost, num1, num));\\n\\t\\tg[to].push_back(edge(from, -lower, -lower, -cost, num2, -num));\\n\\t\\tb[from]-=lower;\\n\\t\\tb[to]+=lower;\\n\\t}\\n\\tFlow mx;\\n\\tbool dual(){\\n\\t\\tusing P=pair<Cost, int>;\\n\\t\\tpriority_queue<P, vector<P>, greater<P>> que;\\n\\t\\tconst Cost INF=1e18;\\n\\t\\tfill(dist.begin(), dist.end(), INF);\\n\\t\\tfill(prevv.begin(), prevv.end(), -1);\\n\\t\\tfor(int x=0; x<n; x++){\\n\\t\\t\\tif(b[x]>0){\\n\\t\\t\\t\\tque.push({0, x});\\n\\t\\t\\t\\tdist[x]=0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmx=0;\\n\\t\\tint cnt=0;\\n\\t\\twhile(!que.empty()){\\n\\t\\t\\tauto p=que.top(); que.pop();\\n\\t\\t\\tint x=p.second;\\n\\t\\t\\tif(dist[x]<p.first) continue;\\n\\t\\t\\tmx=max(mx, dist[x]);\\n\\t\\t\\tif(b[x]<0) cnt++;\\n\\t\\t\\tfor(int i=0; i<g[x].size(); i++){\\n\\t\\t\\t\\tedge e=g[x][i];\\n\\t\\t\\t\\tif(e.cap-e.flow==0) continue;\\n\\t\\t\\t\\tint y=e.to;\\n\\t\\t\\t\\tif(dist[y]>dist[x]+e.cost+h[x]-h[y]){\\n\\t\\t\\t\\t\\tdist[y]=dist[x]+e.cost+h[x]-h[y];\\n\\t\\t\\t\\t\\tque.push({dist[y], y});\\n\\t\\t\\t\\t\\tprevv[y]=x;\\n\\t\\t\\t\\t\\tpreve[y]=i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(cnt==0) return false;\\n\\t\\tfor(int x=0; x<n; x++){\\n\\t\\t\\th[x]+=min(dist[x], mx);\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\\n\\tvoid primal(){\\n\\t\\tfor(int x=0; x<n; x++){\\n\\t\\t\\tif(!(b[x]<0)) continue;\\n\\t\\t\\tif(dist[x]>mx) continue;\\n\\t\\t\\tFlow f=-b[x];\\n\\t\\t\\tint v;\\n\\t\\t\\tfor(v=x; prevv[v]!=-1; v=prevv[v]){\\n\\t\\t\\t\\tedge &e=g[prevv[v]][preve[v]];\\n\\t\\t\\t\\tf=min(f, e.cap-e.flow);\\n\\t\\t\\t}\\n\\t\\t\\tf=min(f, b[v]);\\n\\t\\t\\tif(f==0) continue;\\n\\t\\t\\tfor(v=x; prevv[v]!=-1; v=prevv[v]){\\n\\t\\t\\t\\tedge &e=g[prevv[v]][preve[v]];\\n\\t\\t\\t\\te.flow+=f;\\n\\t\\t\\t\\tg[v][e.rev].flow-=f;\\n\\t\\t\\t}\\n\\t\\t\\tb[v]-=f;\\n\\t\\t\\tb[x]+=f;\\n\\t\\t}\\n\\t}\\n\\tbool solve(){\\n\\t\\tfor(int x=0; x<n; x++){\\n\\t\\t\\tfor(auto &e:g[x]){\\n\\t\\t\\t\\tif(e.cost<0 && e.cap-e.flow>0){\\n\\t\\t\\t\\t\\tb[x]-=(e.cap-e.flow);\\n\\t\\t\\t\\t\\tb[e.to]+=(e.cap-e.flow);\\n\\t\\t\\t\\t\\tg[e.to][e.rev].flow-=(e.cap-e.flow);\\n\\t\\t\\t\\t\\te.flow=e.cap;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile(dual()) primal();\\n\\t\\tfor(int x=0; x<n; x++){\\n\\t\\t\\tif(b[x]!=0) return false;\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\\n\\ttemplate<typename T>\\n\\tT calc(){\\n\\t\\tT ans=0;\\n\\t\\tfor(int x=0; x<n; x++){\\n\\t\\t\\tfor(auto e:g[x]){\\n\\t\\t\\t\\tans+=T(e.flow)*T(e.cost);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tans/=2;\\n\\t\\treturn ans;\\n\\t}\\n};\\nint main()\\n{\\n\\tint n, m; ll x;\\n cin>>n>>m>>x;\\n int a[101], b[101];\\n ll p[101];\\n for(int i=0; i<n; i++){\\n cin>>a[i]>>b[i]>>p[i];\\n }\\n int u[202], v[202], f[202];\\n for(int i=0; i<m; i++){\\n cin>>u[i]>>v[i]>>f[i];\\n u[i]--; v[i]--;\\n }\\n const ll mx=1e9;\\n ll tl=0, tr=mx;\\n while(tr-tl>1){\\n ll t=(tl+tr)/2;\\n MinCostFlow<ll, ll> mcf(2*n);\\n const ll INF=1e12;\\n for(int i=0; i<n; i++){\\n mcf.b[i]+=a[i];\\n mcf.b[i+n]-=a[i];\\n }\\n for(int i=0; i<n; i++){\\n mcf.add_edge(i, i+n, 0, a[i]-b[i], p[i], 0);\\n mcf.add_edge(0, i+n, 0, INF, t, 0);\\n mcf.add_edge(i+n, i, 0, INF, -1, 0);\\n }\\n for(int i=0; i<n; i++){\\n for(int j=i+1; j<n; j++){\\n mcf.add_edge(j, i, 0, INF, 0, 0);\\n }\\n }\\n for(int i=0; i<m; i++){\\n if(f[i]==1){\\n mcf.add_edge(u[i]+n, v[i], 0, INF, -1, 0);\\n }else{\\n mcf.add_edge(v[i], u[i]+n, 0, INF, 0, 0);\\n }\\n }\\n mcf.solve();\\n ll res=mcf.calc<ll>();\\n if(res>=x) tr=t;\\n else tl=t;\\n }\\n if(tr==mx) cout<<-1<<endl;\\n else cout<<tr<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 3860,\n \"score_of_the_acc\": -1.44,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3171_4839509\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\nconst int mod = 1e9 + 7;\\n// const int mod = 998244353;\\n\\nconst int64 infll = (1LL << 62) - 1;\\n//const int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\n\\ntemplate< typename flow_t, typename cost_t >\\nstruct edge {\\n int src, to;\\n flow_t low, high;\\n cost_t cost;\\n\\n edge() = default;\\n\\n edge(int src, int to, flow_t high, cost_t cost) : src(src), to(to), low(0), high(high), cost(cost) {}\\n\\n edge(int src, int to, flow_t low, flow_t high, cost_t cost) : src(src), to(to), low(low), high(high), cost(cost) {}\\n};\\n\\n\\ntemplate< typename flow_t, typename cost_t, template< typename, typename > class MF >\\ncost_t normalized_min_cost_flow(vector< flow_t > D, const vector< edge< flow_t, cost_t > > &E, cost_t NG = -1) {\\n const int N = (int) D.size(), M = (int) E.size();\\n MF< flow_t, cost_t > flow(N + 2);\\n const int S = N, T = N + 1;\\n\\n cost_t sum = 0;\\n for(auto &e : E) {\\n if(e.cost < 0) {\\n sum += e.cost * e.high;\\n D[e.src] -= e.high;\\n D[e.to] += e.high;\\n flow.add_edge(e.to, e.src, e.high - e.low, -e.cost);\\n } else {\\n sum += e.cost * e.low;\\n D[e.src] -= e.low;\\n D[e.to] += e.low;\\n flow.add_edge(e.src, e.to, e.high - e.low, e.cost);\\n }\\n }\\n\\n flow_t in = 0;\\n for(int i = 0; i < N; i++) {\\n if(D[i] > 0) {\\n flow.add_edge(S, i, D[i], flow_t(0));\\n in += D[i];\\n } else if(D[i] < 0) {\\n flow.add_edge(i, T, -D[i], flow_t(0));\\n }\\n }\\n\\n auto ret = flow.min_cost_flow(S, T, in);\\n if(ret == -1) return NG;\\n return ret + sum;\\n}\\n\\ntemplate< typename flow_t, typename cost_t >\\nstruct PrimalDual {\\n const cost_t INF;\\n\\n struct edge {\\n int to;\\n flow_t cap;\\n cost_t cost;\\n int rev;\\n bool isrev;\\n };\\n vector< vector< edge > > graph;\\n vector< cost_t > potential, min_cost;\\n vector< int > prevv, preve;\\n\\n PrimalDual(int V) : graph(V), INF(numeric_limits< cost_t >::max()) {}\\n\\n void add_edge(int from, int to, flow_t cap, cost_t cost) {\\n graph[from].emplace_back((edge) {to, cap, cost, (int) graph[to].size(), false});\\n graph[to].emplace_back((edge) {from, 0, -cost, (int) graph[from].size() - 1, true});\\n }\\n\\n cost_t min_cost_flow(int s, int t, flow_t f) {\\n int V = (int) graph.size();\\n cost_t ret = 0;\\n using Pi = pair< cost_t, int >;\\n priority_queue< Pi, vector< Pi >, greater< Pi > > que;\\n potential.assign(V, 0);\\n preve.assign(V, -1);\\n prevv.assign(V, -1);\\n\\n while(f > 0) {\\n min_cost.assign(V, INF);\\n que.emplace(0, s);\\n min_cost[s] = 0;\\n while(!que.empty()) {\\n Pi p = que.top();\\n que.pop();\\n if(min_cost[p.second] < p.first) continue;\\n for(int i = 0; i < graph[p.second].size(); i++) {\\n edge &e = graph[p.second][i];\\n cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];\\n if(e.cap > 0 && min_cost[e.to] > nextCost) {\\n min_cost[e.to] = nextCost;\\n prevv[e.to] = p.second, preve[e.to] = i;\\n que.emplace(min_cost[e.to], e.to);\\n }\\n }\\n }\\n if(min_cost[t] == INF) return -1;\\n for(int v = 0; v < V; v++) potential[v] += min_cost[v];\\n flow_t addflow = f;\\n for(int v = t; v != s; v = prevv[v]) {\\n addflow = min(addflow, graph[prevv[v]][preve[v]].cap);\\n }\\n f -= addflow;\\n ret += addflow * potential[t];\\n for(int v = t; v != s; v = prevv[v]) {\\n edge &e = graph[prevv[v]][preve[v]];\\n e.cap -= addflow;\\n graph[v][e.rev].cap += addflow;\\n }\\n }\\n return ret;\\n }\\n\\n void output() {\\n for(int i = 0; i < graph.size(); i++) {\\n for(auto &e : graph[i]) {\\n if(e.isrev) continue;\\n auto &rev_e = graph[e.to][e.rev];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << rev_e.cap + e.cap << \\\")\\\" << endl;\\n }\\n }\\n }\\n};\\n\\nint main() {\\n int N, M, X;\\n cin >> N >> M >> X;\\n vector< int > A(N), B(N), P(N);\\n for(int i = 0; i < N; i++) {\\n cin >> A[i] >> B[i] >> P[i];\\n }\\n vector< int > U(M), V(M), F(M);\\n for(int i = 0; i < M; i++) {\\n cin >> U[i] >> V[i] >> F[i];\\n --U[i], --V[i];\\n }\\n\\n using flow_t = int64;\\n using cost_t = int64;\\n cost_t inf = 1e15;\\n\\n auto check = [&](int Y) {\\n vector< flow_t > D(N + N + 1);\\n int Z = N + N;\\n vector< edge< flow_t, cost_t > > E;\\n for(int i = 0; i < N; i++) {\\n E.emplace_back(i, Z, 0, inf, 0);\\n E.emplace_back(i + N, i, inf, -1);\\n E.emplace_back(Z, i + N, inf, Y);\\n if(i + 1 < N) E.emplace_back(i + 1, i, inf, 0);\\n }\\n for(int i = 0; i < M; i++) {\\n if(F[i] == 1) E.emplace_back(U[i] + N, V[i], inf, -1);\\n else E.emplace_back(V[i], U[i] + N, inf, 0);\\n }\\n for(int i = 0; i < N; i++) {\\n E.emplace_back(i, i + N, A[i] - B[i], P[i]);\\n if(A[i] >= 0) {\\n D[i + N] -= A[i];\\n D[i] += A[i];\\n E.emplace_back(i + N, i, inf, 0);\\n } else {\\n E.emplace_back(i, i + N, -A[i], 0);\\n }\\n }\\n return normalized_min_cost_flow< flow_t, cost_t, PrimalDual >(D, E);\\n };\\n int ok = 1e9, ng = -1;\\n if(check(ok) < X) {\\n cout << -1 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n while(ok - ng > 1) {\\n int mid = (ok + ng) / 2;\\n if(check(mid) >= X) ok = mid;\\n else ng = mid;\\n }\\n cout << ok << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.8575,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3171_4838894\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<functional>\\n#include<assert.h>\\n#include<numeric>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\\n#define rep(i,n) REP(i,0,n)\\nusing ll = long long;\\nconstexpr ll mod=2e8+7 ;\\n\\nstruct PrimalDual{\\n struct edge{\\n int to;ll cap, cost;int rev;\\n };\\n int n;\\n const ll INF = numeric_limits<ll>::max();\\n vector<vector<edge>> v;\\n vector<ll> pot, dist;\\n vector<pair<int,int>> par;\\n \\n PrimalDual(int n):n(n),v(n),pot(n){}\\n \\n void add_edge(int from, int to, ll cap, ll cost) {\\n v[from].emplace_back((edge) {to, cap, cost, (int) v[to].size()});\\n v[to].emplace_back((edge) {from, 0, -cost, (int) v[from].size() - 1});\\n }\\n \\n pair<ll,ll> minimum_road(int s,int t){\\n par.assign(n,{-1,-1});\\n dist.assign(n,INF);\\n dist[s] = 0;\\n using P = pair<ll,ll>;\\n priority_queue<P,vector<P>,greater<P>> pq;\\n pq.emplace(0,s);\\n while(!pq.empty()){\\n P p = pq.top();pq.pop();\\n if(dist[p.second]<p.first)continue;\\n rep(i,v[p.second].size()){\\n edge& e = v[p.second][i];\\n ll nd = dist[p.second]+e.cost+pot[p.second]-pot[e.to];\\n if(e.cap>0 && dist[e.to]>nd){\\n dist[e.to] = nd;\\n par[e.to] = {p.second, i};\\n pq.emplace(dist[e.to],e.to);\\n }\\n }\\n }\\n if(dist[t]==INF)return {-1,-1};\\n rep(i,n)pot[i] += dist[i];\\n ll f = INF;\\n int cur = t;\\n while(cur != s){\\n int p = par[cur].first, j = par[cur].second;\\n f = min(f, v[p][j].cap);\\n cur = p;\\n }\\n cur = t;\\n while(cur != s){\\n int p = par[cur].first, j = par[cur].second;\\n v[p][j].cap -= f;\\n v[cur][v[p][j].rev].cap += f;\\n cur = p;\\n }\\n return {pot[t],f};\\n }\\n \\n ll minimum_cost_flow(int s, int t, ll k){\\n ll ret = 0;\\n while(k){\\n pair<ll,ll> z = minimum_road(s, t);\\n if (z.first < 0)return -1;\\n if (k<=z.second){\\n ret+=z.first*k;\\n break;\\n }\\n k -= z.second;\\n ret += z.first*z.second;\\n }\\n return ret;\\n }\\n};\\n\\nint main(){\\n int n,m,x;\\n cin>>n>>m>>x;\\n vector<int> a(n),b(n),p(n);\\n rep(i,n)cin>>a[i]>>b[i]>>p[i];\\n vector<int> f(m),u(m),v(m);\\n rep(i,m){\\n cin>>u[i]>>v[i]>>f[i];\\n --u[i];--v[i];\\n if(u[i]<v[i])swap(u[i],v[i]);\\n }\\n ll ng = -1, ok = 2e8;\\n while(ok-ng>1){\\n int mid = (ok+ng)/2;\\n PrimalDual pd(3*n+3);\\n int s0=3*n, S = 3*n+1, T = 3*n+2;\\n vector<ll> cost(3*n+3);\\n rep(i,n){\\n cost[3*i+0]+=a[i];\\n cost[3*i+1]+=b[i]-a[i];\\n cost[3*i+2]+=-b[i];\\n }\\n ll ret = 0;\\n rep(i,n){\\n pd.add_edge(3*i+2, 3*i+1, 2e8, 0);\\n cost[3*i+0]+=2e8;\\n cost[3*i+1]-=2e8;\\n ret-=2e8;\\n pd.add_edge(3*i+0, 3*i+1, 2e8, 1);\\n pd.add_edge(3*i+0, 3*i+1, 2e8, p[i]);\\n pd.add_edge(s0, 3*i+2, 2e8, mid);\\n }\\n rep(i,n-1){\\n pd.add_edge(3*i+3, 3*i+0, 2e8, 0);\\n }\\n pd.add_edge(0, s0, 2e8, 0);\\n rep(i,m){\\n if(f[i]==1){\\n ret += -2e8;\\n cost[3*v[i]+2]-=2e8;\\n cost[3*u[i]+0]+=2e8;\\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 2e8, 1);\\n } else {\\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 2e8, 0);\\n }\\n }\\n ll sum = 0;\\n rep(i,3*n+1){\\n if(cost[i]>0){\\n pd.add_edge(S, i, cost[i], 0);\\n sum += cost[i];\\n } else {\\n pd.add_edge(i, T, -cost[i], 0);\\n }\\n }\\n ll ans = pd.minimum_cost_flow(S, T, sum)+ret;\\n if(ans>=x)ok=mid;\\n else ng = mid;\\n }\\n if(ok >= x + 1000000){\\n cout<<-1<<endl;\\n } else {\\n cout << ok << endl;\\n }\\n\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 510,\n \"memory_kb\": 3524,\n \"score_of_the_acc\": -1.4247,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3171_4838886\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<functional>\\n#include<assert.h>\\n#include<numeric>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\\n#define rep(i,n) REP(i,0,n)\\nusing ll = long long;\\nconstexpr ll mod=1e8+7 ;\\n\\nstruct PrimalDual{\\n struct edge{\\n int to;ll cap, cost;int rev;\\n };\\n int n;\\n const ll INF = numeric_limits<ll>::max();\\n vector<vector<edge>> v;\\n vector<ll> pot, dist;\\n vector<pair<int,int>> par;\\n \\n PrimalDual(int n):n(n),v(n),pot(n){}\\n \\n void add_edge(int from, int to, ll cap, ll cost) {\\n v[from].emplace_back((edge) {to, cap, cost, (int) v[to].size()});\\n v[to].emplace_back((edge) {from, 0, -cost, (int) v[from].size() - 1});\\n }\\n \\n pair<ll,ll> minimum_road(int s,int t){\\n par.assign(n,{-1,-1});\\n dist.assign(n,INF);\\n dist[s] = 0;\\n using P = pair<ll,ll>;\\n priority_queue<P,vector<P>,greater<P>> pq;\\n pq.emplace(0,s);\\n while(!pq.empty()){\\n P p = pq.top();pq.pop();\\n if(dist[p.second]<p.first)continue;\\n rep(i,v[p.second].size()){\\n edge& e = v[p.second][i];\\n ll nd = dist[p.second]+e.cost+pot[p.second]-pot[e.to];\\n if(e.cap>0 && dist[e.to]>nd){\\n dist[e.to] = nd;\\n par[e.to] = {p.second, i};\\n pq.emplace(dist[e.to],e.to);\\n }\\n }\\n }\\n if(dist[t]==INF)return {-1,-1};\\n rep(i,n)pot[i] += dist[i];\\n ll f = INF;\\n int cur = t;\\n while(cur != s){\\n int p = par[cur].first, j = par[cur].second;\\n f = min(f, v[p][j].cap);\\n cur = p;\\n }\\n cur = t;\\n while(cur != s){\\n int p = par[cur].first, j = par[cur].second;\\n v[p][j].cap -= f;\\n v[cur][v[p][j].rev].cap += f;\\n cur = p;\\n }\\n return {pot[t],f};\\n }\\n \\n ll minimum_cost_flow(int s, int t, ll k){\\n ll ret = 0;\\n while(k){\\n pair<ll,ll> z = minimum_road(s, t);\\n if (z.first < 0)return -1;\\n if (k<=z.second){\\n ret+=z.first*k;\\n break;\\n }\\n k -= z.second;\\n ret += z.first*z.second;\\n }\\n return ret;\\n }\\n};\\n\\nint main(){\\n int n,m,x;\\n cin>>n>>m>>x;\\n vector<int> a(n),b(n),p(n);\\n rep(i,n)cin>>a[i]>>b[i]>>p[i];\\n vector<int> f(m),u(m),v(m);\\n rep(i,m){\\n cin>>u[i]>>v[i]>>f[i];\\n --u[i];--v[i];\\n if(u[i]<v[i])swap(u[i],v[i]);\\n }\\n ll ng = -1, ok = 1e8;\\n while(ok-ng>1){\\n int mid = (ok+ng)/2;\\n PrimalDual pd(3*n+3);\\n int s0=3*n, S = 3*n+1, T = 3*n+2;\\n vector<ll> cost(3*n+3);\\n rep(i,n){\\n cost[3*i+0]+=a[i];\\n cost[3*i+1]+=b[i]-a[i];\\n cost[3*i+2]+=-b[i];\\n }\\n ll ret = 0;\\n rep(i,n){\\n pd.add_edge(3*i+2, 3*i+1, 1e8, 0);\\n cost[3*i+0]+=1e8;\\n cost[3*i+1]-=1e8;\\n ret-=1e8;\\n pd.add_edge(3*i+0, 3*i+1, 1e8, 1);\\n pd.add_edge(3*i+0, 3*i+1, 1e8, p[i]);\\n pd.add_edge(s0, 3*i+2, 1e8, mid);\\n }\\n rep(i,n-1){\\n pd.add_edge(3*i+3, 3*i+0, 1e8, 0);\\n }\\n pd.add_edge(0, s0, 1e8, 0);\\n rep(i,m){\\n if(f[i]==1){\\n ret += -1e8;\\n cost[3*v[i]+2]-=1e8;\\n cost[3*u[i]+0]+=1e8;\\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 1e8, 1);\\n } else {\\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 1e8, 0);\\n }\\n }\\n ll sum = 0;\\n rep(i,3*n+1){\\n if(cost[i]>0){\\n pd.add_edge(S, i, cost[i], 0);\\n sum += cost[i];\\n } else {\\n pd.add_edge(i, T, -cost[i], 0);\\n }\\n }\\n ll ans = pd.minimum_cost_flow(S, T, sum)+ret;\\n if(ans>=x)ok=mid;\\n else ng = mid;\\n }\\n if(ok >= x + 100000){\\n cout<<-1<<endl;\\n } else {\\n cout << ok << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.6888888888888889,\n \"time_ms\": 470,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -1.42,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3171_4838812\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<functional>\\n#include<assert.h>\\n#include<numeric>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\\n#define rep(i,n) REP(i,0,n)\\nusing ll = long long;\\nconstexpr ll mod=1e7+7 ;\\n\\nstruct PrimalDual{\\n struct edge{\\n int to;ll cap, cost;int rev;\\n };\\n int n;\\n const ll INF = numeric_limits<ll>::max();\\n vector<vector<edge>> v;\\n vector<ll> pot, dist;\\n vector<pair<int,int>> par;\\n \\n PrimalDual(int n):n(n),v(n),pot(n){}\\n \\n void add_edge(int from, int to, ll cap, ll cost) {\\n v[from].emplace_back((edge) {to, cap, cost, (int) v[to].size()});\\n v[to].emplace_back((edge) {from, 0, -cost, (int) v[from].size() - 1});\\n }\\n \\n pair<ll,ll> minimum_road(int s,int t){\\n par.assign(n,{-1,-1});\\n dist.assign(n,INF);\\n dist[s] = 0;\\n using P = pair<ll,ll>;\\n priority_queue<P,vector<P>,greater<P>> pq;\\n pq.emplace(0,s);\\n while(!pq.empty()){\\n P p = pq.top();pq.pop();\\n if(dist[p.second]<p.first)continue;\\n rep(i,v[p.second].size()){\\n edge& e = v[p.second][i];\\n ll nd = dist[p.second]+e.cost+pot[p.second]-pot[e.to];\\n if(e.cap>0 && dist[e.to]>nd){\\n dist[e.to] = nd;\\n par[e.to] = {p.second, i};\\n pq.emplace(dist[e.to],e.to);\\n }\\n }\\n }\\n if(dist[t]==INF)return {-1,-1};\\n rep(i,n)pot[i] += dist[i];\\n ll f = INF;\\n int cur = t;\\n while(cur != s){\\n int p = par[cur].first, j = par[cur].second;\\n f = min(f, v[p][j].cap);\\n cur = p;\\n }\\n cur = t;\\n while(cur != s){\\n int p = par[cur].first, j = par[cur].second;\\n v[p][j].cap -= f;\\n v[cur][v[p][j].rev].cap += f;\\n cur = p;\\n }\\n return {pot[t],f};\\n }\\n \\n ll minimum_cost_flow(int s, int t, ll k){\\n ll ret = 0;\\n while(k){\\n pair<ll,ll> z = minimum_road(s, t);\\n if (z.first < 0)return -1;\\n if (k<=z.second){\\n ret+=z.first*k;\\n break;\\n }\\n k -= z.second;\\n ret += z.first*z.second;\\n }\\n return ret;\\n }\\n};\\n\\nint main(){\\n int n,m,x;\\n cin>>n>>m>>x;\\n vector<int> a(n),b(n),p(n);\\n rep(i,n)cin>>a[i]>>b[i]>>p[i];\\n vector<int> f(m),u(m),v(m);\\n rep(i,m){\\n cin>>u[i]>>v[i]>>f[i];\\n --u[i];--v[i];\\n if(u[i]<v[i])swap(u[i],v[i]);\\n }\\n ll ng = -1, ok = 1e7;\\n while(ok-ng>1){\\n int mid = (ok+ng)/2;\\n PrimalDual pd(3*n+3);\\n int s0=3*n, S = 3*n+1, T = 3*n+2;\\n vector<ll> cost(3*n+3);\\n rep(i,n){\\n cost[3*i+0]+=a[i];\\n cost[3*i+1]+=b[i]-a[i];\\n cost[3*i+2]+=-b[i];\\n }\\n ll ret = 0;\\n rep(i,n){\\n pd.add_edge(3*i+2, 3*i+1, 1e7, 0);\\n cost[3*i+0]+=1e7;\\n cost[3*i+1]-=1e7;\\n ret-=1e7;\\n pd.add_edge(3*i+0, 3*i+1, 1e7, 1);\\n pd.add_edge(3*i+0, 3*i+1, 1e7, p[i]);\\n pd.add_edge(s0, 3*i+2, 1e7, mid);\\n }\\n rep(i,n-1){\\n pd.add_edge(3*i+3, 3*i+0, 1e7, 0);\\n }\\n pd.add_edge(0, s0, 1e7, 0);\\n rep(i,m){\\n if(f[i]==1){\\n ret += -1e7;\\n cost[3*v[i]+2]-=1e7;\\n cost[3*u[i]+0]+=1e7;\\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 1e7, 1);\\n } else {\\n pd.add_edge(3*u[i]+0, 3*v[i]+2, 1e7, 0);\\n }\\n }\\n ll sum = 0;\\n rep(i,3*n+1){\\n if(cost[i]>0){\\n pd.add_edge(S, i, cost[i], 0);\\n sum += cost[i];\\n } else {\\n pd.add_edge(i, T, -cost[i], 0);\\n }\\n }\\n ll ans = pd.minimum_cost_flow(S, T, sum)+ret;\\n if(ans>=x)ok=mid;\\n else ng = mid;\\n }\\n if(ok >= x + 100000){\\n cout<<-1<<endl;\\n } else {\\n cout << ok << endl;\\n }\\n\\n \\n return 0;\\n}\",\n \"accuracy\": 0.13333333333333333,\n \"time_ms\": 10,\n \"memory_kb\": 3364,\n \"score_of_the_acc\": -0.1507,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3171_4838785\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=Int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\n\\ntemplate<typename TF,typename TC>\\nstruct PrimalDual{\\n struct edge{\\n Int to;\\n TF cap;\\n TC cost;\\n Int rev;\\n edge(){}\\n edge(Int to,TF cap,TC cost,Int rev):\\n to(to),cap(cap),cost(cost),rev(rev){}\\n };\\n\\n static const TC INF;\\n vector<vector<edge>> G;\\n vector<TC> h,dist;\\n vector<Int> prevv,preve;\\n\\n PrimalDual(){}\\n PrimalDual(Int n):G(n),h(n),dist(n),prevv(n),preve(n){}\\n\\n void add_edge(Int u,Int v,TF cap,TC cost){\\n G[u].emplace_back(v,cap,cost,G[v].size());\\n G[v].emplace_back(u,0,-cost,G[u].size()-1);\\n }\\n\\n void dijkstra(Int s){\\n struct P{\\n TC first;\\n Int second;\\n P(TC first,Int second):first(first),second(second){}\\n bool operator<(const P&a) const{return a.first<first;}\\n };\\n priority_queue<P> que;\\n fill(dist.begin(),dist.end(),INF);\\n\\n dist[s]=0;\\n que.emplace(dist[s],s);\\n while(!que.empty()){\\n P p=que.top();que.pop();\\n Int v=p.second;\\n if(dist[v]<p.first) continue;\\n for(Int i=0;i<(Int)G[v].size();i++){\\n edge &e=G[v][i];\\n if(e.cap==0) continue;\\n if(dist[v]+e.cost+h[v]-h[e.to]<dist[e.to]){\\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\\n prevv[e.to]=v;\\n preve[e.to]=i;\\n que.emplace(dist[e.to],e.to);\\n }\\n }\\n }\\n }\\n\\n TC flow(Int s,Int t,TF f,Int &ok){\\n TC res=0;\\n fill(h.begin(),h.end(),0);\\n while(f>0){\\n dijkstra(s);\\n if(dist[t]==INF){\\n ok=0;\\n return res;\\n }\\n\\n for(Int v=0;v<(Int)h.size();v++)\\n if(dist[v]<INF) h[v]=h[v]+dist[v];\\n\\n TF d=f;\\n for(Int v=t;v!=s;v=prevv[v])\\n d=min(d,G[prevv[v]][preve[v]].cap);\\n\\n f-=d;\\n res=res+h[t]*d;\\n for(Int v=t;v!=s;v=prevv[v]){\\n edge &e=G[prevv[v]][preve[v]];\\n e.cap-=d;\\n G[v][e.rev].cap+=d;\\n }\\n }\\n ok=1;\\n return res;\\n }\\n};\\ntemplate<typename TF, typename TC>\\nconst TC PrimalDual<TF, TC>::INF = numeric_limits<TC>::max()/2;\\n\\n\\ntemplate<typename TF,typename TC>\\nstruct NegativeEdge{\\n PrimalDual<TF, TC> G;\\n vector<TF> fs;\\n TC sum;\\n Int S,T;\\n NegativeEdge(){}\\n NegativeEdge(Int n):G(n+2),fs(n+2,0),sum(0),S(n),T(n+1){}\\n\\n void use_edge(Int u,Int v,TF cap,TC cost){\\n fs[u]-=cap;\\n fs[v]+=cap;\\n sum=sum+cost*cap;\\n }\\n\\n void add_edge(Int u,Int v,TF cap,TC cost){\\n if(cost<TC(0)){\\n use_edge(u,v,cap,cost);\\n swap(u,v);\\n cost=-cost;\\n }\\n G.add_edge(u,v,cap,cost);\\n }\\n\\n TC flow(Int &ok){\\n TF f=0;\\n for(Int i=0;i<S;i++){\\n if(fs[i]>0){\\n f+=fs[i];\\n G.add_edge(S,i,+fs[i],TC(0));\\n }\\n if(fs[i]<0){\\n G.add_edge(i,T,-fs[i],TC(0));\\n }\\n }\\n return sum+G.flow(S,T,f,ok);\\n }\\n\\n TC flow(Int ts,Int tt,TF tf,Int &ok){\\n fs[ts]+=tf;\\n fs[tt]-=tf;\\n return flow(ok);\\n }\\n};\\n\\n\\ntemplate<typename TV, const Int N> void read_tuple_impl(TV&) {}\\ntemplate<typename TV, const Int N, typename Head, typename... Tail>\\nvoid read_tuple_impl(TV& ts) {\\n get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));\\n read_tuple_impl<TV, N+1, Tail...>(ts);\\n}\\ntemplate<typename... Ts> decltype(auto) read_tuple(size_t n) {\\n tuple<vector<Ts>...> ts;\\n for(size_t i=0;i<n;i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);\\n return ts;\\n}\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n Int n,m,need;\\n cin>>n>>m>>need;\\n auto [xs,ys,qs]=read_tuple<Int, Int, Int>(n);\\n auto [us,vs,fs]=read_tuple<Int, Int, Int>(m);\\n\\n for(Int i=0;i<m;i++) us[i]--,vs[i]--;\\n\\n const Int INF = 1e15;\\n auto st=[&](Int i){return 0+i;};\\n auto en=[&](Int i){return n+i;};\\n Int Z=n+n;\\n auto check=[&](Int T)->Int{\\n NegativeEdge<Int, Int> G(n+n+1);\\n for(Int i=0;i<n;i++){\\n G.add_edge(st(i),Z,INF,0);\\n G.add_edge(en(i),st(i),INF,-1);\\n G.add_edge(Z,en(i),INF,T);\\n }\\n for(Int i=0;i<m;i++){\\n if(fs[i]==+1)\\n G.add_edge(en(us[i]),st(vs[i]),INF,-1);\\n if(fs[i]==-1)\\n G.add_edge(st(vs[i]),en(us[i]),INF,0);\\n }\\n for(Int i=0;i+1<n;i++)\\n G.add_edge(st(i+1),st(i),INF,0);\\n\\n for(Int i=0;i<n;i++){\\n G.add_edge(st(i),en(i),xs[i]-ys[i],qs[i]);\\n if(xs[i]>=0){\\n G.use_edge(en(i),st(i),xs[i],0);\\n G.add_edge(en(i),st(i),INF,0);\\n }else{\\n G.add_edge(st(i),en(i),abs(xs[i]),0);\\n }\\n }\\n Int ok;\\n Int res=G.flow(ok);\\n if(!ok) return -1;\\n return res;\\n };\\n\\n Int L=0,R=1e9;\\n // check(L) < need\\n // check(R) >= need\\n if(check(R)<need) drop(-1);\\n while(L+1<R){\\n Int M=(L+R)>>1;\\n if(check(M)>=need) R=M;\\n else L=M;\\n }\\n // cout<<need<<endl;\\n // cout<<check(L)<<endl;\\n // cout<<check(R)<<endl;\\n cout<<R<<newl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -1.1033,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1989,"cells":{"group_id":{"kind":"string","value":"aoj_3177_cpp"},"problem_description":{"kind":"string","value":"F Painting\n問題文\n$N$ 個のマスが横一列に並んでいます。マスは左から順に $1, 2, \\ldots N$ と番号がつけられています。\n各マスは赤、青、黄、緑のいずれか $1$ 色で塗られています。\n現在のマスの状態は長さ $N$ の文字列で表され、$S$ の $i$ 文字目がマス $i$ の色を表しています。(\nR\n、\nB\n、\nY\n、\nG\nがそれぞれ赤、青、黄、緑に対応します。)\nheno 君はこのマス目に対して以下の操作を何度でも行うことができます。\n操作 : $1\\leq i \\leq N-1$ かつマス $i$ とマス $i+1$ の色が異なるような $i$ を選ぶ。マス $i$ とマス $i+1$ を、どちらにも用いられていない $2$ 色で$1$ つずつ塗る。(マス $i$ とマス $i+1$ を同じ色で塗ることはできない。) (具体的な操作については入出力を参考にしてください。) (15:05 更新)\nheno 君の目標はマス目を文字列 $T$ で表される状態にすることです。これが可能か判定してください。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$\n$S$\n$T$\n制約\n$2 \\leq N \\leq 10^6$\n$S, T$ は\nR\n,\nB\n,\nY\n,\nG\nのみからなる長さ $N$ の文字列\n出力\nheno くんが目標を達成することが可能ならば\nYes\n、不可能ならば\nNo\nと $1$ 行に出力してください。\n入力例1\n4\nRGRB\nYRGG\n出力例1\nYes\n例えば以下のように操作を行うとよいです。\nRGRB\n→\nRGYG\n→\nYBYG\n→\nYRGG\n入力例2\n5\nRRRRR\nYYYYY\n出力例2\nNo\n入力例3\n10\nRRGBYRBYYG\nBGRRYGGGGY\n出力例3\nYes"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3177_6452179","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline ll time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint u(char c){\n if(c == 'R')return 0;\n else if(c == 'B')return 1;\n else if(c == 'Y')return 2;\n else return 3;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n; cin >> n;\n string s,t; cin >> s >> t;\n {\n auto r = s;\n sort(r.begin(), r.end());\n if(r[0] == r.back()){\n if(s == t){\n cout << \"Yes\" << \"\\n\";\n }\n else{\n cout << \"No\" << \"\\n\";\n }\n return 0;\n }\n r = t;\n sort(r.begin(), r.end());\n if(r[0] == r.back()){\n if(s == t){\n cout << \"Yes\" << \"\\n\";\n }\n else{\n cout << \"No\" << \"\\n\";\n }\n return 0;\n }\n }\n int g = 0, gg = 0;\n for(char c:s){\n g ^= u(c);\n }\n for(char c:t){\n gg ^= u(c);\n }\n if(g == gg){\n cout << \"Yes\" << \"\\n\";\n }\n else{\n cout << \"No\" << \"\\n\";\n }\n}","accuracy":1,"time_ms":30,"memory_kb":6576,"score_of_the_acc":-0.6013,"final_rank":9},{"submission_id":"aoj_3177_4875831","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n;\n cin>>n;\n string s,t;\n cin>>s>>t;\n if(s==t) drop(\"Yes\");\n if(s==string(n,s[0])) drop(\"No\");\n\n map<char,int> num;\n num['R']=0;\n num['B']=1;\n num['Y']=2;\n num['G']=3;\n\n int ss=0,st=0;\n for(char c:s) ss^=num[c];\n for(char c:t) st^=num[c];\n\n // cout<<ss<<' '<<st<<newl;\n cout<<((ss%4)==(st%4)?\"Yes\":\"No\")<<newl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6464,"score_of_the_acc":-0.5238,"final_rank":7},{"submission_id":"aoj_3177_4864217","code_snippet":"#include <bits/stdc++.h>\n//#include <chrono>\n//#pragma GCC optimize(\"Ofast\")\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\n#define Rrep(i,n) Rreps(i,n,0)\n#define ALL(a) a.begin(), a.end()\n#define fi first\n#define se second\n\nusing ll = long long;\nusing vec = vector<ll>;\nusing mat = vector<vec>;\n\nll N,M,H,W,Q,K,A,B;\nstring S;\ntypedef pair<ll, ll> P;\nconst ll INF = (1LL<<60);\n\nvoid yes() {cout<<\"Yes\"<<endl; exit(0);}\nvoid no() {cout<<\"No\"<<endl; exit(0);}\n\nint main() {\n string T;\n cin>>N>>S>>T;\n if(S == T) yes();\n vec n1(4, 0), n2(4, 0);\n map<char, int> ci = {{'R', 0}, {'G', 1}, {'B', 2}, {'Y', 3}};\n rep(i, N){\n ++n1[ci[S[i]]];\n ++n2[ci[T[i]]];\n }\n if(*max_element(ALL(n1)) == N || *max_element(ALL(n2)) == N) no();\n int judge(0);\n rep(i, 4){\n if(abs(n1[i] - n2[i])&1) ++judge;\n }\n if(judge == 2) no();\n else yes();\n}","accuracy":1,"time_ms":50,"memory_kb":5588,"score_of_the_acc":-0.024,"final_rank":2},{"submission_id":"aoj_3177_4849988","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n//----------------------- Print Function ----------------------//\n\ninline void print() {\n cout << '\\n';\n}\ntemplate <typename First, typename... Rest>\nvoid print(const First &first, const Rest &... rest) {\n cout << first << ' ';\n print(rest...);\n}\n\ntemplate <typename T>\nvoid print(const T &a) {\n for (auto e : a) cout << e << ' ';\n cout << '\\n';\n}\n\n//------------------------- Libraries -------------------------//\n\n//--------------------------- Solve ---------------------------//\n\nint conv(char c) {\n if (c == 'R') return 0;\n if (c == 'B') return 1;\n if (c == 'Y') return 2;\n if (c == 'G') return 3;\n else return -1;\n}\n\nvoid solve() {\n int n; cin >> n;\n string s, t; cin >> s >> t;\n\n if (s == t) {\n cout << \"Yes\" << '\\n';\n return;\n }\n\n set<char> ss, st; \n int s_xor = 0, t_xor = 0;\n for (char c : s) {\n ss.insert(c);\n s_xor ^= conv(c);\n }\n for (char c : t) {\n st.insert(c);\n t_xor ^= conv(c);\n }\n\n if (ss.size() == 1 || st.size() == 1) {\n cout << \"No\" << '\\n';\n }\n else {\n if (s_xor == t_xor) cout << \"Yes\" << '\\n';\n else cout << \"No\" << '\\n';\n }\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":6496,"score_of_the_acc":-0.5483,"final_rank":8},{"submission_id":"aoj_3177_4849720","code_snippet":"#include <iostream>\n#include <string>\nusing namespace std;\nint cnt[2][4] = {};\nint main(){\n int i,n; cin >> n;\n string s,t; cin >> s >> t;\n for(i=0;i<n;i++){\n if(s[i]=='R') cnt[0][0]++;\n if(s[i]=='B') cnt[0][1]++;\n if(s[i]=='G') cnt[0][2]++;\n if(s[i]=='Y') cnt[0][3]++;\n if(t[i]=='R') cnt[1][0]++;\n if(t[i]=='B') cnt[1][1]++;\n if(t[i]=='G') cnt[1][2]++;\n if(t[i]=='Y') cnt[1][3]++;\n }\n int a = 0,b = 0;\n for(i=0;i<4;i++){\n if(cnt[0][i]) a++;\n if(cnt[1][i]) b++;\n }\n if(a==1 || b==1){\n bool f = true;\n for(i=0;i<4;i++){\n if(cnt[0][i]!=cnt[1][i]) f = false; \n }\n if(f) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n }else{\n int c = 0;\n for(i=0;i<4;i++){\n if((cnt[0][i] - cnt[1][i]) & 1) c++;\n }\n if(c==0 || c==4) cout << \"Yes\" << endl;\n else cout <<\"No\" << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":6940,"score_of_the_acc":-0.818,"final_rank":10},{"submission_id":"aoj_3177_4849718","code_snippet":"#include <iostream>\n#include <string>\nusing namespace std;\nint cnt[2][4] = {};\nint main(){\n int i,n; cin >> n;\n string s,t; cin >> s >> t;\n for(i=0;i<n;i++){\n if(s[i]=='R') cnt[0][0]++;\n if(s[i]=='B') cnt[0][1]++;\n if(s[i]=='G') cnt[0][2]++;\n if(s[i]=='Y') cnt[0][3]++;\n if(t[i]=='R') cnt[1][0]++;\n if(t[i]=='B') cnt[1][1]++;\n if(t[i]=='G') cnt[1][2]++;\n if(t[i]=='Y') cnt[1][3]++;\n }\n int a = 0,b = 0;\n for(i=0;i<4;i++){\n if(cnt[0][i]) a++;\n if(cnt[1][i]) b++;\n }\n if(a==1 || b==1){\n bool f = true;\n for(i=0;i<n;i++){\n if(cnt[0][i]!=cnt[1][i]) f = false; \n }\n if(f) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n }else{\n int c = 0;\n for(i=0;i<4;i++){\n if((cnt[0][i] - cnt[1][i]) & 1) c++;\n }\n if(c==0 || c==4) cout << \"Yes\" << endl;\n else cout <<\"No\" << endl;\n }\n}","accuracy":0.4716981132075472,"time_ms":30,"memory_kb":6972,"score_of_the_acc":-0.837,"final_rank":20},{"submission_id":"aoj_3177_4849625","code_snippet":"#pragma GCC optimize(\"O3\")\n#include<bits/stdc++.h> \nusing namespace std;\nusing ll=long long;\nusing P=pair<ll,ll>;\ntemplate<class T> using V=vector<T>; \n#define fi first\n#define se second\n#define all(v) (v).begin(),(v).end()\nconst ll inf=(1e18);\n//const ll mod=998244353;\nconst ll mod=1000000007;\nconst vector<int> dy={-1,0,1,0},dx={0,-1,0,1};\nll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}\nll LCM(ll c,ll d){return c/GCD(c,d)*d;}\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} __init;\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T>void debag(const vector<T> &a){cerr<<\"debag :\";for(auto v:a)cerr<<v<<\" \";cerr<<\"\\n\";}\ntemplate<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<\" \";cout<<\"\\n\";}\nint main(){\n int n;\n string s,t;\n cin>>n;\n cin>>s>>t;\n map<char,int> mp;\n string str=\"RGBY\";\n for(int i=0;i<4;i++){\n mp[str[i]]=i;\n }\n V<int> d(4,0),e(4,0);\n for(int i=0;i<n;i++){\n d[mp[s[i]]]++;\n e[mp[t[i]]]++;\n }\n s.erase(unique(all(s)),s.end());\n t.erase(unique(all(t)),t.end());\n if(s.size()==1||t.size()==1){\n if(s==t){\n cout<<\"Yes\"<<\"\\n\";\n }else{\n cout<<\"No\"<<\"\\n\";\n }\n return 0;\n }\n V<ll> res(4,0);\n ll sum=0;\n for(int i=0;i<4;i++){\n res[i]=d[i]-e[i];\n sum+=res[i];\n }\n if(sum!=0){\n cout<<\"No\"<<\"\\n\";\n return 0;\n }\n V<int> cnt(2,0);\n for(int i=0;i<4;i++){\n cnt[abs(res[i])%2]++;\n }\n if(cnt[0]>0&&cnt[1]>0){\n cout<<\"No\"<<\"\\n\";\n }else{\n cout<<\"Yes\"<<\"\\n\";\n }\n}","accuracy":1,"time_ms":20,"memory_kb":6292,"score_of_the_acc":-0.4268,"final_rank":5},{"submission_id":"aoj_3177_4849501","code_snippet":"#pragma GCC optimize (\"O3\")\n#include <iostream>\n#include <iomanip>\n#include <istream>\n#include <ostream>\n#include <sstream>\n#include <iterator>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <deque>\n#include <list>\n#include <stack>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <bitset>\n#include <utility>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <string>\n#include <ctime>\n#include <cctype>\n#include <cstdlib>\n#include <numeric>\n#define IINF 1000000000\n#define INF 3223372036854775807\n#define MOD 1000000007\n#define mod 1000000007\n#define INT_MAX_ 2147483647\n#define EPS (1e-10)\n#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)\n#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)\n//#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define Endl endl\n#define fi first\n#define se second\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n#define eb emplace_back\n#define mmax(x,y)(x>y?x:y)\n#define mmin(x,y)(x<y?x:y)\n#define chmax(x,y) x=mmax(x,y)\n#define chmin(x,y) x=mmin(x,y)\n#define all(x) (x).begin(),(x).end()\n#define siz(x) (ll)(x).size()\n#define PI acos(-1.0)\n#define me memset\n#define bit(n,k) ((n>>k)&1)\n#define lg length()\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\ntypedef long double ld;\ntypedef pair<int,int>Pin;\ntypedef pair<ll,ll>Pll;\ntemplate<class T> using V=vector<T>;\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;\nlong long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}\nlong long LCM(long long a, long long b) {return a/GCD(a,b)*b;}\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\n#define invp(a,p)pom(a,p-2,p)\nint dx[4]={-1,0,1,0};\nint dy[4]={0,-1,0,1};\nint ddx[8]={-1,0,1,0,1,1,-1,-1};\nint ddy[8]={0,-1,0,1,1,-1,1,-1};\nll cmp1(pair<Pll,ll> a,pair<Pll,ll> b){\n return a.fi.se>b.fi.se;\n}\nll cmp2(pair<ll,ll> a,pair<ll,ll> b){\n if(a.fi!=b.fi)\n return a.se<b.se;\n else\n return a.se>b.se;\n}\n//----------------------------------------------------------------------\nll cal(char c){\n if(c=='R')return 0;\n else if(c=='G')return 1;\n else if(c=='B')return 2;\n else return 3;\n}\n//----------------------------------------------------------------------\nint main(int argc, char * argv[]){\n cin.tie(0);\n ios::sync_with_stdio(false);\n //------------------------------- \n //ll begin_t=clock();\n //freopen(\"big.txt\", \"r\", stdin);\n //freopen(\"out3.txt\", \"w\", stdout);\n //------------------------------\n ll n;cin>>n;\n string s,t;cin>>s>>t;\n bool a=1,b=1;\n for(ll i=1;i<n;i++){\n if(s[i]!=s[0])a=0;\n if(t[i]!=t[0])b=0;\n }\n if(a==1||b==1){\n if(s==t){\n cout<<\"Yes\"<<endl;\n }\n else cout<<\"No\"<<Endl;\n return 0;\n }\n\n ll axor=0,bxor=0;\n for(ll i=0;i<n;i++){\n axor^=cal(s[i]);\n bxor^=cal(t[i]);\n }\n if(axor==bxor){\n cout<<\"Yes\"<<endl;\n }\n else cout<<\"No\"<<Endl;\n //------------------------------\n //fclose(stdin);\n //fclose(stdout);\n //ll end_t=clock();cout<<\"time=\"<<end_t-begin_t<<\"ms\"<<endl;\n //------------------------------- \n return 0;\n}\n//----------------------------------------------------------------------","accuracy":1,"time_ms":10,"memory_kb":6040,"score_of_the_acc":-0.2714,"final_rank":3},{"submission_id":"aoj_3177_4849497","code_snippet":"#pragma GCC optimize (\"O3\")\n#include <iostream>\n#include <iomanip>\n#include <istream>\n#include <ostream>\n#include <sstream>\n#include <iterator>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <deque>\n#include <list>\n#include <stack>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <bitset>\n#include <utility>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <string>\n#include <ctime>\n#include <cctype>\n#include <cstdlib>\n#include <numeric>\n#define IINF 1000000000\n#define INF 3223372036854775807\n#define MOD 1000000007\n#define mod 1000000007\n#define INT_MAX_ 2147483647\n#define EPS (1e-10)\n#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)\n#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)\n//#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define Endl endl\n#define fi first\n#define se second\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n#define eb emplace_back\n#define mmax(x,y)(x>y?x:y)\n#define mmin(x,y)(x<y?x:y)\n#define chmax(x,y) x=mmax(x,y)\n#define chmin(x,y) x=mmin(x,y)\n#define all(x) (x).begin(),(x).end()\n#define siz(x) (ll)(x).size()\n#define PI acos(-1.0)\n#define me memset\n#define bit(n,k) ((n>>k)&1)\n#define lg length()\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\ntypedef long double ld;\ntypedef pair<int,int>Pin;\ntypedef pair<ll,ll>Pll;\ntemplate<class T> using V=vector<T>;\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;\nlong long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}\nlong long LCM(long long a, long long b) {return a/GCD(a,b)*b;}\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\n#define invp(a,p)pom(a,p-2,p)\nint dx[4]={-1,0,1,0};\nint dy[4]={0,-1,0,1};\nint ddx[8]={-1,0,1,0,1,1,-1,-1};\nint ddy[8]={0,-1,0,1,1,-1,1,-1};\nll cmp1(pair<Pll,ll> a,pair<Pll,ll> b){\n return a.fi.se>b.fi.se;\n}\nll cmp2(pair<ll,ll> a,pair<ll,ll> b){\n if(a.fi!=b.fi)\n return a.se<b.se;\n else\n return a.se>b.se;\n}\n//----------------------------------------------------------------------\nll cal(char c){\n if(c=='R')return 0;\n else if(c=='G')return 1;\n else if(c=='B')return 2;\n else return 3;\n}\n//----------------------------------------------------------------------\nint main(int argc, char * argv[]){\n cin.tie(0);\n ios::sync_with_stdio(false);\n //------------------------------- \n //ll begin_t=clock();\n //freopen(\"big.txt\", \"r\", stdin);\n //freopen(\"out3.txt\", \"w\", stdout);\n //------------------------------\n ll n;cin>>n;\n string s,t;cin>>s>>t;\n bool a=1,b=1;\n for(ll i=1;i<n;i++){\n if(s[i]!=s[0])a=0;\n if(t[i]!=t[0])b=0;\n }\n if(a==1&&b==1){\n if(s[0]==t[0]){\n cout<<\"Yes\"<<endl;\n }\n else cout<<\"No\"<<Endl;\n return 0;\n }\n\n ll axor=0,bxor=0;\n for(ll i=0;i<n;i++){\n axor^=cal(s[i]);\n bxor^=cal(t[i]);\n }\n if(axor==bxor){\n cout<<\"Yes\"<<endl;\n }\n else cout<<\"No\"<<Endl;\n //------------------------------\n //fclose(stdin);\n //fclose(stdout);\n //ll end_t=clock();cout<<\"time=\"<<end_t-begin_t<<\"ms\"<<endl;\n //------------------------------- \n return 0;\n}\n//----------------------------------------------------------------------","accuracy":0.6792452830188679,"time_ms":10,"memory_kb":6044,"score_of_the_acc":-0.2738,"final_rank":18},{"submission_id":"aoj_3177_4849243","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n\nvoid solve() {\n int n;\n std::string s, t;\n std::cin >> n >> s >> t;\n\n if (std::all_of(s.begin(), s.end(),\n [&](char c) { return s.front() == c; })) {\n std::cout << (s == t ? \"Yes\" : \"No\") << \"\\n\";\n return;\n }\n\n int x = 0;\n s += t;\n for (char c : s) {\n for (int i = 0; i < 4; ++i) {\n if (c == \"RBYG\"[i]) x ^= i;\n }\n }\n\n std::cout << (x == 0 ? \"Yes\" : \"No\") << \"\\n\";\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":7264,"score_of_the_acc":-1,"final_rank":14},{"submission_id":"aoj_3177_4847988","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acos(-1.0);\n\n\n\nstring c = \"RBYG\";\nvoid solve() {\n\tint n; string s, t; cin >> n >> s >> t;\n\tif (s == t) {\n\t\tcout << \"Yes\\n\"; return;\n\t}\n\tint xs = 0, xt = 0;\n\trep(i, n) {\n\t\txs ^= c.find(s[i]);\n\t\txt ^= c.find(t[i]);\n\t}\n\tif (xs != xt) {\n\t\tcout << \"No\\n\"; return;\n\t}\n\tbool sexi = false;\n\tbool texi = false;\n\trep(i, n-1) {\n\t\tif (s[i] != s[i + 1])sexi = true;\n\t\tif (t[i] != t[i + 1])texi = true;\n\t}\n\tif (!sexi||!texi) {\n\t\tcout << \"No\\n\";\n\t}\n\telse {\n\t\tcout << \"Yes\\n\";\n\t}\n}\n\n\n\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6396,"score_of_the_acc":-0.4833,"final_rank":6},{"submission_id":"aoj_3177_4847986","code_snippet":"#include <bits/stdc++.h>\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\n#define rep(i, n) For((i), 0, (n))\n#define rrep(i, n) rFor((i), (n), 0)\n#define fi first\n#define se second\nusing namespace std;\ntypedef long long lint;\ntypedef unsigned long long ulint;\ntypedef pair<int, int> pii;\ntypedef pair<lint, lint> pll;\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nT div_floor(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a >= 0 ? a / b : (a + 1) / b - 1;\n}\ntemplate <class T>\nT div_ceil(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a > 0 ? (a - 1) / b + 1 : a / b;\n}\n\nconstexpr lint mod = 1000000007;\nconstexpr lint INF = mod * mod;\nconstexpr int MAX = 100010;\n\nint char_to_int(char c) {\n if (c == 'R')\n return 0;\n else if (c == 'B')\n return 1;\n else if (c == 'Y')\n return 2;\n else\n return 3;\n}\n\nbool all_same(string &s) {\n rep(i, s.size() - 1) if (s[i] != s[i + 1]) return false;\n return true;\n}\n\nint main() {\n int n;\n string s, t;\n cin >> n >> s >> t;\n if (all_same(s) || all_same(t)) {\n puts(s == t ? \"Yes\" : \"No\");\n } else {\n int x = 0, y = 0;\n rep(i, n) x ^= char_to_int(s[i]), y ^= char_to_int(t[i]);\n puts(x == y ? \"Yes\" : \"No\");\n }\n}","accuracy":1,"time_ms":30,"memory_kb":6960,"score_of_the_acc":-0.8299,"final_rank":11},{"submission_id":"aoj_3177_4847793","code_snippet":"#include <iostream>\n#include <string>\n#include <sstream>\n#include <stack>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <bitset>\n#include <iomanip>\n#include <limits>\n#include <chrono>\n#include <random>\n#include <array>\n#include <unordered_map>\n#include <functional>\n#include <complex>\n#include <numeric>\n#include <cctype>\n#include <map>\n#include <set>\n#include <cstdlib>\n#include <bitset>\n#include <tuple>\n#include <assert.h>\n#include <deque>\n#include <utility>\n#include <fstream>\n\nusing namespace std;\ntypedef long long ll;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }\n//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\n\nconstexpr long long INF = 1LL << 60;\nconstexpr int inf = 1000000007;\n//constexpr long long mod = 1000000007LL;\nconstexpr long long mod = 998244353;\nconstexpr int MAX = 5000000;\n\nint main()\n{\n\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tint n; cin >> n;\n\tstring s; cin >> s;\n\tstring t; cin >> t;\n\n\t{\n\t\tstring ts = s;\n\t\tstring tt = t;\n\t\tsort(ts.begin(), ts.end());\n\t\tsort(tt.begin(), tt.end());\n\t\tif (ts[0] == ts.back() or tt[0] == tt.back()) {\n\t\t\tif (s == t) {\n\t\t\t\tcout << \"Yes\" << \"\\n\";\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << \"No\" << \"\\n\";\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tauto cnv = [](char c)->int {\n\t\tif (c == 'R') return 0;\n\t\tif (c == 'B') return 1;\n\t\tif (c == 'G') return 2;\n\t\tif (c == 'Y') return 3;\n\t\treturn -1;\n\t};\n\tint xs = 0;\n\tint ts = 0;\n\tfor (int i = 0; i < n; i++) xs ^= cnv(s[i]);\n\tfor (int i = 0; i < n; i++) ts ^= cnv(t[i]);\n\tif (xs != ts) cout << \"No\" << \"\\n\";\n\telse cout << \"Yes\" << \"\\n\";\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":7240,"score_of_the_acc":-1.0019,"final_rank":15},{"submission_id":"aoj_3177_4847773","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\")\n#pragma GCC optimize(\"unroll-loops\")\n//#pragma warning(disable : 4996)\n\n#ifdef _MSC_VER\n#include <intrin.h>\n\n#define __builtin_popcount __popcnt\n#define __builtin_popcountll __popcnt64\n#endif\n\n#include <limits.h>\n#include <math.h>\n#include <time.h>\n\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <complex>\n#include <cstdio>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n//#include<atcoder/all>\n\nusing namespace std;\n\n//using namespace atcoder;\n\n#define REP(i, n) for (int i = 0; i < (n); ++i)\n#define REPR(i, n) for (int i = n - 1; i >= 0; --i)\n#define FOR(i, m, n) for (int i = m; i < n; ++i)\n#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)\n#define SORT(v, n) sort(v, v + n);\n#define VSORT(v) sort(v.begin(), v.end());\n#define REVERSE(v, n) reverse(v, v + n);\n#define VREVERSE(v) reverse(v.begin(), v.end())\n#define ll long long\n#define print(x) cout << (x) << endl\n#define pe(x) cout << (x) << \" \"\n#define DEBUG(x) cout << #x << \": \" << x << endl\n#define lb(v, n) lower_bound(v.begin(), v.end(), (n))\n#define ub(v, n) upper_bound(v.begin(), v.end(), (n))\n#define int long long\n//#define double long double\n#define all(x) (x).begin(), (x).end()\n#define print_space(v) REP(i, v.size()) cout << v[i] << \" \\n\"[i==(int)v.size()-1]\ntemplate <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }\ntemplate <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }\ntypedef pair<int, int> pii;\ntypedef pair<long long, long long> pll;\nstd::random_device rd;\nstd::mt19937 mt(rd());\nconstexpr ll MOD = 1e9 + 7;\nconstexpr int MAX = 500050;\nconst double pi = acos(-1);\nconstexpr double EPS = 1e-8;\nconstexpr ll LINF = 1e18 + 1;\nconstexpr int INF = 1e9 + 1;\nvoid Yes(bool cond) { cout << (cond ? \"Yes\" : \"No\") << '\\n'; }\nvoid YES(bool cond) { cout << (cond ? \"YES\" : \"NO\") << '\\n'; }\n\n\nint id[300];\nvoid solve() {\n\tint N; cin >> N;\n\tstring S;\n\tstring T;\n\tcin >> S >> T;\n\tid['R'] = 0;\n\tid['B'] = 1;\n\tid['Y'] = 2;\n\tid['G'] = 3;\n\tint a = 0, b = 0;\n\tmap<char, int>mps, mpt;\n\tfor (auto c : S) {\n\t\tmps[c]++;\n\t}\n\tfor (auto c : T) {\n\t\tmpt[c]++;\n\t}\n\tif (mps.size() == 1 || mpt.size() == 1) {\n\t\tif (mps.size() > 1 || mpt.size() > 1) {\n\t\t\tprint(\"No\"); return;\n\t\t}\n\t\telse {\n\t\t\tYes(S[0] == T[0]);\n\t\t\treturn;\n\t\t}\n\t}\n\tfor (auto c : S)a ^= id[c];\n\tfor (auto c : T)b ^= id[c];\n\tif (a == b)print(\"Yes\");\n\telse print(\"No\");\n}\n\n\n\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\t//int q;\n\t//cin >> q;\n\t//while (q--)\n\tsolve();\n\n}","accuracy":1,"time_ms":20,"memory_kb":6132,"score_of_the_acc":-0.3316,"final_rank":4},{"submission_id":"aoj_3177_4847394","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n//----------------------- Print Function ----------------------//\n\ninline void print() {\n cout << '\\n';\n}\ntemplate <typename First, typename... Rest>\nvoid print(const First &first, const Rest &... rest) {\n cout << first << ' ';\n print(rest...);\n}\n\ntemplate <typename T>\nvoid print(const T &a) {\n for (auto e : a) cout << e << ' ';\n cout << '\\n';\n}\n\n//------------------------- Libraries -------------------------//\n\n//--------------------------- Solve ---------------------------//\n\nint conv(char c) {\n if (c == 'R') return 0;\n if (c == 'B') return 1;\n if (c == 'Y') return 2;\n if (c == 'G') return 3;\n else return -1;\n}\n\nvoid solve() {\n int n; cin >> n;\n string s, t; cin >> s >> t;\n set<char> ss, st; \n int s_xor = 0, t_xor = 0;\n for (char c : s) {\n ss.insert(c);\n s_xor ^= conv(c);\n }\n for (char c : t) {\n st.insert(c);\n t_xor ^= conv(c);\n }\n\n if (ss.size() == 1 || st.size() == 1) {\n cout << \"No\" << '\\n';\n }\n else {\n if (s_xor == t_xor) cout << \"Yes\" << '\\n';\n else cout << \"No\" << '\\n';\n }\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":0.49056603773584906,"time_ms":20,"memory_kb":6320,"score_of_the_acc":-0.4435,"final_rank":19},{"submission_id":"aoj_3177_4847217","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n int n;\n cin >> n;\n string s, t;\n cin >> s >> t;\n int same1 = 1, same2 = 1;\n for (int i = 0; i+1 < n; ++i) {\n if(s[i] != s[i+1]) same1 = 0;\n if(t[i] != t[i+1]) same2 = 0;\n }\n array<int, 256> val{};\n val['B'] = 1, val['Y'] = 2; val['G'] = 3;\n if(same1 || same2){\n puts(s == t ? \"Yes\" : \"No\");\n }else {\n int k = 0;\n for (auto &&i : s) k ^= val[i];\n for (auto &&i : t) k ^= val[i];\n puts(k ? \"No\" : \"Yes\");\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":5584,"score_of_the_acc":-0.0162,"final_rank":1},{"submission_id":"aoj_3177_4847204","code_snippet":"#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\nusing ll = long long;\nconstexpr int INF = 0x3f3f3f3f;\nconstexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr double EPS = 1e-8;\nconstexpr int MOD = 1000000007;\n// constexpr int MOD = 998244353;\nconstexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\nconstexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\nstruct IOSetup {\n IOSetup() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n }\n} iosetup;\n\nbool has_one_color(string s) {\n sort(ALL(s));\n s.erase(unique(ALL(s)), s.end());\n return s.length() == 1;\n}\n\nint main() {\n int n; string s, t; cin >> n >> s >> t;\n if (has_one_color(s) || has_one_color(t)) {\n cout << (has_one_color(s) && has_one_color(t) && s[0] == t[0] ? \"Yes\\n\" : \"No\\n\");\n return 0;\n }\n map<char, int> mp{{'R', 0}, {'B', 1}, {'Y', 2}, {'G', 3}};\n int s_xor = 0, t_xor = 0;\n for (char c : s) s_xor ^= mp[c];\n for (char c : t) t_xor ^= mp[c];\n cout << (s_xor == t_xor ? \"Yes\\n\" : \"No\\n\");\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":7244,"score_of_the_acc":-1.0043,"final_rank":16},{"submission_id":"aoj_3177_4847123","code_snippet":"#include\"bits/stdc++.h\"\nusing namespace std;\n#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)\n#define rep(i,n) REP((i),0,(n))\nusing ll = long long;\n\nvector<int> counter(string s) {\n vector<int> count(4, 0);\n map<int, int> mp;\n mp['R'] = 0;\n mp['G'] = 1;\n mp['B'] = 2;\n mp['Y'] = 3;\n for (char c : s) count[mp[c]]++;\n return count;\n}\n\nvoid shrink(vector<int>& count) {\n if (count[0] > 1) {\n if (count[1] == 0 && count[2] == 0) {\n assert(count[3] > 0);\n count[0]--;\n count[1]++;\n count[2]++;\n count[3]--;\n }\n if (count[1] > 0 || count[2] > 0) {\n while (count[0] > 1) {\n count[0] -= 2;\n count[3] += 2;\n }\n }\n else {\n assert(false);\n }\n }\n if (count[1] > 1) {\n if (count[0] == 0 && count[2] == 0) {\n assert(count[3] > 0);\n count[0]++;\n count[1]--;\n count[2]++;\n count[3]--;\n }\n if (count[0] > 0 || count[2] > 0) {\n while (count[1] > 1) {\n count[1] -= 2;\n count[3] += 2;\n }\n }\n else {\n assert(false);\n }\n }\n if (count[2] > 1) {\n if (count[0] == 0 && count[1] == 0) {\n assert(count[3] > 0);\n count[0]++;\n count[1]++;\n count[2]--;\n count[3]--;\n }\n if (count[0] > 0 || count[1] > 0) {\n while (count[2] > 1) {\n count[2] -= 2;\n count[3] += 2;\n }\n }\n else {\n assert(false);\n }\n }\n /*\n rep(i, 3) {\n int mov = (count[i] / 2) * 2;\n count[i] -= mov;\n count[3] += mov;\n }\n */\n if (count[0] == 1) {\n if (count[1] == 1) {\n count[0] = 0;\n count[1] = 0;\n count[2]++;\n count[3]++;\n }\n else if (count[2] == 1) {\n count[0] = 0;\n count[1]++;\n count[2] = 0;\n count[3]++;\n }\n else if (count[3] > 0) {\n count[0] = 0;\n count[1]++;\n count[2]++;\n count[3]--;\n }\n }\n assert(count[0] == 0);\n assert(0 <= count[1] && count[1] <= 2);\n assert(0 <= count[2] && count[2] <= 2);\n}\n\nbool little_case(string& S, string& T) {\n using namespace chrono;\n const int N = S.size();\n random_device rnd;\n mt19937 mt(rnd());\n uniform_int_distribution<> rndN(0, N - 2), rnd2(0, 1);\n\n auto start = system_clock::now();\n while (duration_cast<milliseconds>(system_clock::now() - start).count() < 1800) {\n if (S == T)return true;\n // swap対象の検索\n int tgtIdx = rndN(mt);\n if (S[tgtIdx] == S[tgtIdx + 1])continue;\n\n set<char> color = { 'R','G','B', 'Y' };\n REP(i, tgtIdx, tgtIdx + 2)color.erase(S[i]);\n bool rev = rnd2(mt);\n if (!rev) {\n auto itr = color.begin();\n S[tgtIdx] = *itr;\n ++itr;\n S[tgtIdx + 1] = *itr;\n }\n else {\n auto itr = color.begin();\n S[tgtIdx + 1] = *itr;\n ++itr;\n S[tgtIdx] = *itr;\n }\n }\n return false;\n}\n\n\nint main()\n{\n int N;\n string S, T;\n cin >> N >> S >> T;\n {\n set<char> sts, stt;\n for (char c : S)sts.insert(c);\n for (char c : T)stt.insert(c);\n if (sts.size() == 1 || stt.size() == 1) {\n if (sts.size() == 1 && stt.size() == 1) {\n char s1 = *sts.begin();\n char s2 = *stt.begin();\n cout << (s1 == s2 ? \"Yes\" : \"No\") << endl;\n }\n else {\n cout << \"No\" << endl;\n }\n return 0;\n }\n }\n if (N <= 6) {\n cout << (little_case(S, T) ? \"Yes\" : \"No\") << endl;\n return 0;\n }\n auto countS = counter(S);\n auto countT = counter(T);\n shrink(countS);\n shrink(countT);\n cout << (countS == countT ? \"Yes\" : \"No\") << endl;\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":6996,"score_of_the_acc":-0.8675,"final_rank":13},{"submission_id":"aoj_3177_4847032","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n#define REP(k, m, n) for (int(k) = (m); (k) < (n); (k)++)\n#define rep(i, n) REP((i), 0, (n))\nusing ll = long long;\n\nvector<int> counter(string s) {\n vector<int> count(4, 0);\n map<int, int> mp;\n mp['R'] = 0;\n mp['G'] = 1;\n mp['B'] = 2;\n mp['Y'] = 3;\n for (char c : s) count[mp[c]]++;\n return count;\n}\n\nbool fail(vector<int>& v) {\n for (auto num : v)\n if (num < 0) return true;\n return false;\n}\n\nvoid shrink(vector<int>& count) {\n if (count[0] > 1) {\n if (count[1] == 0 && count[2] == 0) {\n assert(count[3] > 0);\n count[0]--;\n count[1]++;\n count[2]++;\n count[3]--;\n }\n if (count[1] > 0 || count[2] > 0) {\n while (count[0] > 1) {\n count[0] -= 2;\n count[3] += 2;\n }\n } else {\n assert(false);\n }\n }\n if (count[1] > 1) {\n if (count[0] == 0 && count[2] == 0) {\n assert(count[3] > 0);\n count[0]++;\n count[1]--;\n count[2]++;\n count[3]--;\n }\n if (count[0] > 0 || count[2] > 0) {\n while (count[1] > 1) {\n count[1] -= 2;\n count[3] += 2;\n }\n } else {\n assert(false);\n }\n }\n if (count[2] > 1) {\n if (count[0] == 0 && count[1] == 0) {\n assert(count[3] > 0);\n count[0]++;\n count[1]++;\n count[2]--;\n count[3]--;\n }\n if (count[0] > 0 || count[1] > 0) {\n while (count[2] > 1) {\n count[2] -= 2;\n count[3] += 2;\n }\n } else {\n assert(false);\n }\n }\n}\n\nbool little_case(string& S, string& T) {\n using namespace chrono;\n const int N = S.size();\n random_device rnd;\n mt19937 mt(rnd());\n uniform_int_distribution<> rndN(0, N - 2), rnd2(0, 1);\n\n auto start = system_clock::now();\n while (duration_cast<milliseconds>(system_clock::now() - start).count() <\n 1800) {\n if (S == T) return true;\n // swap対象の検索\n int tgtIdx = rndN(mt);\n if (S[tgtIdx] == S[tgtIdx + 1]) continue;\n\n set<char> color = {'R', 'G', 'B', 'Y'};\n REP(i, tgtIdx, tgtIdx + 2) color.erase(S[i]);\n bool rev = rnd2(mt);\n if (!rev) {\n auto itr = color.begin();\n S[tgtIdx] = *itr;\n ++itr;\n S[tgtIdx + 1] = *itr;\n } else {\n auto itr = color.begin();\n S[tgtIdx + 1] = *itr;\n ++itr;\n S[tgtIdx] = *itr;\n }\n }\n return false;\n}\n\nstring parse(vector<int> count) {\n string s = \"\";\n rep(i, count[0]) s += \"R\";\n rep(i, count[1]) s += \"G\";\n rep(i, count[2]) s += \"B\";\n for (int i = 0; i < count[3]; ++i) s += \"Y\";\n return s;\n}\n\nint main() {\n int N;\n string S, T;\n cin >> N >> S >> T;\n {\n set<char> sts, stt;\n for (char c : S) sts.insert(c);\n for (char c : T) stt.insert(c);\n if (sts.size() == 1 || stt.size() == 1) {\n if (sts.size() == 1 && stt.size() == 1) {\n char s1 = *sts.begin();\n char s2 = *stt.begin();\n cout << (s1 == s2 ? \"Yes\" : \"No\") << endl;\n } else {\n cout << \"No\" << endl;\n }\n return 0;\n }\n }\n if (N <= 8) {\n cout << (little_case(S, T) ? \"Yes\" : \"No\") << endl;\n return 0;\n }\n auto countS = counter(S);\n auto countT = counter(T);\n shrink(countS);\n shrink(countT);\n {\n int now = min(countS[3], countT[3]);\n countS[3] -= now, countT[3] -= now;\n }\n S = parse(countS);\n T = parse(countT);\n assert(S.size() == T.size());\n\n cout << (little_case(S, T) ? \"Yes\" : \"No\") << endl;\n return 0;\n}","accuracy":1,"time_ms":1860,"memory_kb":6980,"score_of_the_acc":-1.831,"final_rank":17},{"submission_id":"aoj_3177_4847024","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\nint main() {\n int n;\n string s, t;\n cin >> n >> s >> t;\n {\n set<char> sts, stt;\n for (char c : s) sts.insert(c);\n for (char c : t) stt.insert(c);\n if (sts.size() == 1 || stt.size() == 1) {\n if (sts.size() == 1 && stt.size() == 1) {\n char s1 = *sts.begin();\n char s2 = *stt.begin();\n cout << (s1 == s2 ? \"Yes\" : \"No\") << endl;\n } else {\n cout << \"No\" << endl;\n }\n return 0;\n }\n }\n map<int, int> mp;\n mp['R'] = 0;\n mp['G'] = 1;\n mp['B'] = 2;\n mp['Y'] = 3;\n int res = 0;\n for (auto c : s) res ^= mp[c];\n for (auto c : t) res ^= mp[c];\n if (!res)\n cout << \"Yes\" << endl;\n else\n cout << \"No\" << endl;\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":6968,"score_of_the_acc":-0.8508,"final_rank":12}],"string":"[\n {\n \"submission_id\": \"aoj_3177_6452179\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline ll time() {\\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nint u(char c){\\n if(c == 'R')return 0;\\n else if(c == 'B')return 1;\\n else if(c == 'Y')return 2;\\n else return 3;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n; cin >> n;\\n string s,t; cin >> s >> t;\\n {\\n auto r = s;\\n sort(r.begin(), r.end());\\n if(r[0] == r.back()){\\n if(s == t){\\n cout << \\\"Yes\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n cout << \\\"No\\\" << \\\"\\\\n\\\";\\n }\\n return 0;\\n }\\n r = t;\\n sort(r.begin(), r.end());\\n if(r[0] == r.back()){\\n if(s == t){\\n cout << \\\"Yes\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n cout << \\\"No\\\" << \\\"\\\\n\\\";\\n }\\n return 0;\\n }\\n }\\n int g = 0, gg = 0;\\n for(char c:s){\\n g ^= u(c);\\n }\\n for(char c:t){\\n gg ^= u(c);\\n }\\n if(g == gg){\\n cout << \\\"Yes\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n cout << \\\"No\\\" << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6576,\n \"score_of_the_acc\": -0.6013,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3177_4875831\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int n;\\n cin>>n;\\n string s,t;\\n cin>>s>>t;\\n if(s==t) drop(\\\"Yes\\\");\\n if(s==string(n,s[0])) drop(\\\"No\\\");\\n\\n map<char,int> num;\\n num['R']=0;\\n num['B']=1;\\n num['Y']=2;\\n num['G']=3;\\n\\n int ss=0,st=0;\\n for(char c:s) ss^=num[c];\\n for(char c:t) st^=num[c];\\n\\n // cout<<ss<<' '<<st<<newl;\\n cout<<((ss%4)==(st%4)?\\\"Yes\\\":\\\"No\\\")<<newl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6464,\n \"score_of_the_acc\": -0.5238,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3177_4864217\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <chrono>\\n//#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\\n#define Rrep(i,n) Rreps(i,n,0)\\n#define ALL(a) a.begin(), a.end()\\n#define fi first\\n#define se second\\n\\nusing ll = long long;\\nusing vec = vector<ll>;\\nusing mat = vector<vec>;\\n\\nll N,M,H,W,Q,K,A,B;\\nstring S;\\ntypedef pair<ll, ll> P;\\nconst ll INF = (1LL<<60);\\n\\nvoid yes() {cout<<\\\"Yes\\\"<<endl; exit(0);}\\nvoid no() {cout<<\\\"No\\\"<<endl; exit(0);}\\n\\nint main() {\\n string T;\\n cin>>N>>S>>T;\\n if(S == T) yes();\\n vec n1(4, 0), n2(4, 0);\\n map<char, int> ci = {{'R', 0}, {'G', 1}, {'B', 2}, {'Y', 3}};\\n rep(i, N){\\n ++n1[ci[S[i]]];\\n ++n2[ci[T[i]]];\\n }\\n if(*max_element(ALL(n1)) == N || *max_element(ALL(n2)) == N) no();\\n int judge(0);\\n rep(i, 4){\\n if(abs(n1[i] - n2[i])&1) ++judge;\\n }\\n if(judge == 2) no();\\n else yes();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5588,\n \"score_of_the_acc\": -0.024,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3177_4849988\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n//----------------------- Print Function ----------------------//\\n\\ninline void print() {\\n cout << '\\\\n';\\n}\\ntemplate <typename First, typename... Rest>\\nvoid print(const First &first, const Rest &... rest) {\\n cout << first << ' ';\\n print(rest...);\\n}\\n\\ntemplate <typename T>\\nvoid print(const T &a) {\\n for (auto e : a) cout << e << ' ';\\n cout << '\\\\n';\\n}\\n\\n//------------------------- Libraries -------------------------//\\n\\n//--------------------------- Solve ---------------------------//\\n\\nint conv(char c) {\\n if (c == 'R') return 0;\\n if (c == 'B') return 1;\\n if (c == 'Y') return 2;\\n if (c == 'G') return 3;\\n else return -1;\\n}\\n\\nvoid solve() {\\n int n; cin >> n;\\n string s, t; cin >> s >> t;\\n\\n if (s == t) {\\n cout << \\\"Yes\\\" << '\\\\n';\\n return;\\n }\\n\\n set<char> ss, st; \\n int s_xor = 0, t_xor = 0;\\n for (char c : s) {\\n ss.insert(c);\\n s_xor ^= conv(c);\\n }\\n for (char c : t) {\\n st.insert(c);\\n t_xor ^= conv(c);\\n }\\n\\n if (ss.size() == 1 || st.size() == 1) {\\n cout << \\\"No\\\" << '\\\\n';\\n }\\n else {\\n if (s_xor == t_xor) cout << \\\"Yes\\\" << '\\\\n';\\n else cout << \\\"No\\\" << '\\\\n';\\n }\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6496,\n \"score_of_the_acc\": -0.5483,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3177_4849720\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\nusing namespace std;\\nint cnt[2][4] = {};\\nint main(){\\n int i,n; cin >> n;\\n string s,t; cin >> s >> t;\\n for(i=0;i<n;i++){\\n if(s[i]=='R') cnt[0][0]++;\\n if(s[i]=='B') cnt[0][1]++;\\n if(s[i]=='G') cnt[0][2]++;\\n if(s[i]=='Y') cnt[0][3]++;\\n if(t[i]=='R') cnt[1][0]++;\\n if(t[i]=='B') cnt[1][1]++;\\n if(t[i]=='G') cnt[1][2]++;\\n if(t[i]=='Y') cnt[1][3]++;\\n }\\n int a = 0,b = 0;\\n for(i=0;i<4;i++){\\n if(cnt[0][i]) a++;\\n if(cnt[1][i]) b++;\\n }\\n if(a==1 || b==1){\\n bool f = true;\\n for(i=0;i<4;i++){\\n if(cnt[0][i]!=cnt[1][i]) f = false; \\n }\\n if(f) cout << \\\"Yes\\\" << endl;\\n else cout << \\\"No\\\" << endl;\\n }else{\\n int c = 0;\\n for(i=0;i<4;i++){\\n if((cnt[0][i] - cnt[1][i]) & 1) c++;\\n }\\n if(c==0 || c==4) cout << \\\"Yes\\\" << endl;\\n else cout <<\\\"No\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6940,\n \"score_of_the_acc\": -0.818,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3177_4849718\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\nusing namespace std;\\nint cnt[2][4] = {};\\nint main(){\\n int i,n; cin >> n;\\n string s,t; cin >> s >> t;\\n for(i=0;i<n;i++){\\n if(s[i]=='R') cnt[0][0]++;\\n if(s[i]=='B') cnt[0][1]++;\\n if(s[i]=='G') cnt[0][2]++;\\n if(s[i]=='Y') cnt[0][3]++;\\n if(t[i]=='R') cnt[1][0]++;\\n if(t[i]=='B') cnt[1][1]++;\\n if(t[i]=='G') cnt[1][2]++;\\n if(t[i]=='Y') cnt[1][3]++;\\n }\\n int a = 0,b = 0;\\n for(i=0;i<4;i++){\\n if(cnt[0][i]) a++;\\n if(cnt[1][i]) b++;\\n }\\n if(a==1 || b==1){\\n bool f = true;\\n for(i=0;i<n;i++){\\n if(cnt[0][i]!=cnt[1][i]) f = false; \\n }\\n if(f) cout << \\\"Yes\\\" << endl;\\n else cout << \\\"No\\\" << endl;\\n }else{\\n int c = 0;\\n for(i=0;i<4;i++){\\n if((cnt[0][i] - cnt[1][i]) & 1) c++;\\n }\\n if(c==0 || c==4) cout << \\\"Yes\\\" << endl;\\n else cout <<\\\"No\\\" << endl;\\n }\\n}\",\n \"accuracy\": 0.4716981132075472,\n \"time_ms\": 30,\n \"memory_kb\": 6972,\n \"score_of_the_acc\": -0.837,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3177_4849625\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#include<bits/stdc++.h> \\nusing namespace std;\\nusing ll=long long;\\nusing P=pair<ll,ll>;\\ntemplate<class T> using V=vector<T>; \\n#define fi first\\n#define se second\\n#define all(v) (v).begin(),(v).end()\\nconst ll inf=(1e18);\\n//const ll mod=998244353;\\nconst ll mod=1000000007;\\nconst vector<int> dy={-1,0,1,0},dx={0,-1,0,1};\\nll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}\\nll LCM(ll c,ll d){return c/GCD(c,d)*d;}\\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} __init;\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T>void debag(const vector<T> &a){cerr<<\\\"debag :\\\";for(auto v:a)cerr<<v<<\\\" \\\";cerr<<\\\"\\\\n\\\";}\\ntemplate<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<\\\" \\\";cout<<\\\"\\\\n\\\";}\\nint main(){\\n int n;\\n string s,t;\\n cin>>n;\\n cin>>s>>t;\\n map<char,int> mp;\\n string str=\\\"RGBY\\\";\\n for(int i=0;i<4;i++){\\n mp[str[i]]=i;\\n }\\n V<int> d(4,0),e(4,0);\\n for(int i=0;i<n;i++){\\n d[mp[s[i]]]++;\\n e[mp[t[i]]]++;\\n }\\n s.erase(unique(all(s)),s.end());\\n t.erase(unique(all(t)),t.end());\\n if(s.size()==1||t.size()==1){\\n if(s==t){\\n cout<<\\\"Yes\\\"<<\\\"\\\\n\\\";\\n }else{\\n cout<<\\\"No\\\"<<\\\"\\\\n\\\";\\n }\\n return 0;\\n }\\n V<ll> res(4,0);\\n ll sum=0;\\n for(int i=0;i<4;i++){\\n res[i]=d[i]-e[i];\\n sum+=res[i];\\n }\\n if(sum!=0){\\n cout<<\\\"No\\\"<<\\\"\\\\n\\\";\\n return 0;\\n }\\n V<int> cnt(2,0);\\n for(int i=0;i<4;i++){\\n cnt[abs(res[i])%2]++;\\n }\\n if(cnt[0]>0&&cnt[1]>0){\\n cout<<\\\"No\\\"<<\\\"\\\\n\\\";\\n }else{\\n cout<<\\\"Yes\\\"<<\\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6292,\n \"score_of_the_acc\": -0.4268,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3177_4849501\",\n \"code_snippet\": \"#pragma GCC optimize (\\\"O3\\\")\\n#include <iostream>\\n#include <iomanip>\\n#include <istream>\\n#include <ostream>\\n#include <sstream>\\n#include <iterator>\\n#include <vector>\\n#include <algorithm>\\n#include <queue>\\n#include <deque>\\n#include <list>\\n#include <stack>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <bitset>\\n#include <utility>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <string>\\n#include <ctime>\\n#include <cctype>\\n#include <cstdlib>\\n#include <numeric>\\n#define IINF 1000000000\\n#define INF 3223372036854775807\\n#define MOD 1000000007\\n#define mod 1000000007\\n#define INT_MAX_ 2147483647\\n#define EPS (1e-10)\\n#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)\\n#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)\\n//#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)\\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\\n#define Endl endl\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define eb emplace_back\\n#define mmax(x,y)(x>y?x:y)\\n#define mmin(x,y)(x<y?x:y)\\n#define chmax(x,y) x=mmax(x,y)\\n#define chmin(x,y) x=mmin(x,y)\\n#define all(x) (x).begin(),(x).end()\\n#define siz(x) (ll)(x).size()\\n#define PI acos(-1.0)\\n#define me memset\\n#define bit(n,k) ((n>>k)&1)\\n#define lg length()\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\ntypedef long double ld;\\ntypedef pair<int,int>Pin;\\ntypedef pair<ll,ll>Pll;\\ntemplate<class T> using V=vector<T>;\\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;\\nlong long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}\\nlong long LCM(long long a, long long b) {return a/GCD(a,b)*b;}\\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\\n#define invp(a,p)pom(a,p-2,p)\\nint dx[4]={-1,0,1,0};\\nint dy[4]={0,-1,0,1};\\nint ddx[8]={-1,0,1,0,1,1,-1,-1};\\nint ddy[8]={0,-1,0,1,1,-1,1,-1};\\nll cmp1(pair<Pll,ll> a,pair<Pll,ll> b){\\n return a.fi.se>b.fi.se;\\n}\\nll cmp2(pair<ll,ll> a,pair<ll,ll> b){\\n if(a.fi!=b.fi)\\n return a.se<b.se;\\n else\\n return a.se>b.se;\\n}\\n//----------------------------------------------------------------------\\nll cal(char c){\\n if(c=='R')return 0;\\n else if(c=='G')return 1;\\n else if(c=='B')return 2;\\n else return 3;\\n}\\n//----------------------------------------------------------------------\\nint main(int argc, char * argv[]){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n //------------------------------- \\n //ll begin_t=clock();\\n //freopen(\\\"big.txt\\\", \\\"r\\\", stdin);\\n //freopen(\\\"out3.txt\\\", \\\"w\\\", stdout);\\n //------------------------------\\n ll n;cin>>n;\\n string s,t;cin>>s>>t;\\n bool a=1,b=1;\\n for(ll i=1;i<n;i++){\\n if(s[i]!=s[0])a=0;\\n if(t[i]!=t[0])b=0;\\n }\\n if(a==1||b==1){\\n if(s==t){\\n cout<<\\\"Yes\\\"<<endl;\\n }\\n else cout<<\\\"No\\\"<<Endl;\\n return 0;\\n }\\n\\n ll axor=0,bxor=0;\\n for(ll i=0;i<n;i++){\\n axor^=cal(s[i]);\\n bxor^=cal(t[i]);\\n }\\n if(axor==bxor){\\n cout<<\\\"Yes\\\"<<endl;\\n }\\n else cout<<\\\"No\\\"<<Endl;\\n //------------------------------\\n //fclose(stdin);\\n //fclose(stdout);\\n //ll end_t=clock();cout<<\\\"time=\\\"<<end_t-begin_t<<\\\"ms\\\"<<endl;\\n //------------------------------- \\n return 0;\\n}\\n//----------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6040,\n \"score_of_the_acc\": -0.2714,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3177_4849497\",\n \"code_snippet\": \"#pragma GCC optimize (\\\"O3\\\")\\n#include <iostream>\\n#include <iomanip>\\n#include <istream>\\n#include <ostream>\\n#include <sstream>\\n#include <iterator>\\n#include <vector>\\n#include <algorithm>\\n#include <queue>\\n#include <deque>\\n#include <list>\\n#include <stack>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <bitset>\\n#include <utility>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <string>\\n#include <ctime>\\n#include <cctype>\\n#include <cstdlib>\\n#include <numeric>\\n#define IINF 1000000000\\n#define INF 3223372036854775807\\n#define MOD 1000000007\\n#define mod 1000000007\\n#define INT_MAX_ 2147483647\\n#define EPS (1e-10)\\n#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)\\n#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)\\n//#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)\\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\\n#define Endl endl\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define eb emplace_back\\n#define mmax(x,y)(x>y?x:y)\\n#define mmin(x,y)(x<y?x:y)\\n#define chmax(x,y) x=mmax(x,y)\\n#define chmin(x,y) x=mmin(x,y)\\n#define all(x) (x).begin(),(x).end()\\n#define siz(x) (ll)(x).size()\\n#define PI acos(-1.0)\\n#define me memset\\n#define bit(n,k) ((n>>k)&1)\\n#define lg length()\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\ntypedef long double ld;\\ntypedef pair<int,int>Pin;\\ntypedef pair<ll,ll>Pll;\\ntemplate<class T> using V=vector<T>;\\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;\\nlong long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}\\nlong long LCM(long long a, long long b) {return a/GCD(a,b)*b;}\\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\\n#define invp(a,p)pom(a,p-2,p)\\nint dx[4]={-1,0,1,0};\\nint dy[4]={0,-1,0,1};\\nint ddx[8]={-1,0,1,0,1,1,-1,-1};\\nint ddy[8]={0,-1,0,1,1,-1,1,-1};\\nll cmp1(pair<Pll,ll> a,pair<Pll,ll> b){\\n return a.fi.se>b.fi.se;\\n}\\nll cmp2(pair<ll,ll> a,pair<ll,ll> b){\\n if(a.fi!=b.fi)\\n return a.se<b.se;\\n else\\n return a.se>b.se;\\n}\\n//----------------------------------------------------------------------\\nll cal(char c){\\n if(c=='R')return 0;\\n else if(c=='G')return 1;\\n else if(c=='B')return 2;\\n else return 3;\\n}\\n//----------------------------------------------------------------------\\nint main(int argc, char * argv[]){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n //------------------------------- \\n //ll begin_t=clock();\\n //freopen(\\\"big.txt\\\", \\\"r\\\", stdin);\\n //freopen(\\\"out3.txt\\\", \\\"w\\\", stdout);\\n //------------------------------\\n ll n;cin>>n;\\n string s,t;cin>>s>>t;\\n bool a=1,b=1;\\n for(ll i=1;i<n;i++){\\n if(s[i]!=s[0])a=0;\\n if(t[i]!=t[0])b=0;\\n }\\n if(a==1&&b==1){\\n if(s[0]==t[0]){\\n cout<<\\\"Yes\\\"<<endl;\\n }\\n else cout<<\\\"No\\\"<<Endl;\\n return 0;\\n }\\n\\n ll axor=0,bxor=0;\\n for(ll i=0;i<n;i++){\\n axor^=cal(s[i]);\\n bxor^=cal(t[i]);\\n }\\n if(axor==bxor){\\n cout<<\\\"Yes\\\"<<endl;\\n }\\n else cout<<\\\"No\\\"<<Endl;\\n //------------------------------\\n //fclose(stdin);\\n //fclose(stdout);\\n //ll end_t=clock();cout<<\\\"time=\\\"<<end_t-begin_t<<\\\"ms\\\"<<endl;\\n //------------------------------- \\n return 0;\\n}\\n//----------------------------------------------------------------------\",\n \"accuracy\": 0.6792452830188679,\n \"time_ms\": 10,\n \"memory_kb\": 6044,\n \"score_of_the_acc\": -0.2738,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3177_4849243\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n\\nvoid solve() {\\n int n;\\n std::string s, t;\\n std::cin >> n >> s >> t;\\n\\n if (std::all_of(s.begin(), s.end(),\\n [&](char c) { return s.front() == c; })) {\\n std::cout << (s == t ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\";\\n return;\\n }\\n\\n int x = 0;\\n s += t;\\n for (char c : s) {\\n for (int i = 0; i < 4; ++i) {\\n if (c == \\\"RBYG\\\"[i]) x ^= i;\\n }\\n }\\n\\n std::cout << (x == 0 ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7264,\n \"score_of_the_acc\": -1,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3177_4847988\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acos(-1.0);\\n\\n\\n\\nstring c = \\\"RBYG\\\";\\nvoid solve() {\\n\\tint n; string s, t; cin >> n >> s >> t;\\n\\tif (s == t) {\\n\\t\\tcout << \\\"Yes\\\\n\\\"; return;\\n\\t}\\n\\tint xs = 0, xt = 0;\\n\\trep(i, n) {\\n\\t\\txs ^= c.find(s[i]);\\n\\t\\txt ^= c.find(t[i]);\\n\\t}\\n\\tif (xs != xt) {\\n\\t\\tcout << \\\"No\\\\n\\\"; return;\\n\\t}\\n\\tbool sexi = false;\\n\\tbool texi = false;\\n\\trep(i, n-1) {\\n\\t\\tif (s[i] != s[i + 1])sexi = true;\\n\\t\\tif (t[i] != t[i + 1])texi = true;\\n\\t}\\n\\tif (!sexi||!texi) {\\n\\t\\tcout << \\\"No\\\\n\\\";\\n\\t}\\n\\telse {\\n\\t\\tcout << \\\"Yes\\\\n\\\";\\n\\t}\\n}\\n\\n\\n\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6396,\n \"score_of_the_acc\": -0.4833,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3177_4847986\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\\n#define rep(i, n) For((i), 0, (n))\\n#define rrep(i, n) rFor((i), (n), 0)\\n#define fi first\\n#define se second\\nusing namespace std;\\ntypedef long long lint;\\ntypedef unsigned long long ulint;\\ntypedef pair<int, int> pii;\\ntypedef pair<lint, lint> pll;\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nT div_floor(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a >= 0 ? a / b : (a + 1) / b - 1;\\n}\\ntemplate <class T>\\nT div_ceil(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a > 0 ? (a - 1) / b + 1 : a / b;\\n}\\n\\nconstexpr lint mod = 1000000007;\\nconstexpr lint INF = mod * mod;\\nconstexpr int MAX = 100010;\\n\\nint char_to_int(char c) {\\n if (c == 'R')\\n return 0;\\n else if (c == 'B')\\n return 1;\\n else if (c == 'Y')\\n return 2;\\n else\\n return 3;\\n}\\n\\nbool all_same(string &s) {\\n rep(i, s.size() - 1) if (s[i] != s[i + 1]) return false;\\n return true;\\n}\\n\\nint main() {\\n int n;\\n string s, t;\\n cin >> n >> s >> t;\\n if (all_same(s) || all_same(t)) {\\n puts(s == t ? \\\"Yes\\\" : \\\"No\\\");\\n } else {\\n int x = 0, y = 0;\\n rep(i, n) x ^= char_to_int(s[i]), y ^= char_to_int(t[i]);\\n puts(x == y ? \\\"Yes\\\" : \\\"No\\\");\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6960,\n \"score_of_the_acc\": -0.8299,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3177_4847793\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <sstream>\\n#include <stack>\\n#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <bitset>\\n#include <iomanip>\\n#include <limits>\\n#include <chrono>\\n#include <random>\\n#include <array>\\n#include <unordered_map>\\n#include <functional>\\n#include <complex>\\n#include <numeric>\\n#include <cctype>\\n#include <map>\\n#include <set>\\n#include <cstdlib>\\n#include <bitset>\\n#include <tuple>\\n#include <assert.h>\\n#include <deque>\\n#include <utility>\\n#include <fstream>\\n\\nusing namespace std;\\ntypedef long long ll;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }\\n//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\\n\\nconstexpr long long INF = 1LL << 60;\\nconstexpr int inf = 1000000007;\\n//constexpr long long mod = 1000000007LL;\\nconstexpr long long mod = 998244353;\\nconstexpr int MAX = 5000000;\\n\\nint main()\\n{\\n\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\n\\tint n; cin >> n;\\n\\tstring s; cin >> s;\\n\\tstring t; cin >> t;\\n\\n\\t{\\n\\t\\tstring ts = s;\\n\\t\\tstring tt = t;\\n\\t\\tsort(ts.begin(), ts.end());\\n\\t\\tsort(tt.begin(), tt.end());\\n\\t\\tif (ts[0] == ts.back() or tt[0] == tt.back()) {\\n\\t\\t\\tif (s == t) {\\n\\t\\t\\t\\tcout << \\\"Yes\\\" << \\\"\\\\n\\\";\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tcout << \\\"No\\\" << \\\"\\\\n\\\";\\n\\t\\t\\t}\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\tauto cnv = [](char c)->int {\\n\\t\\tif (c == 'R') return 0;\\n\\t\\tif (c == 'B') return 1;\\n\\t\\tif (c == 'G') return 2;\\n\\t\\tif (c == 'Y') return 3;\\n\\t\\treturn -1;\\n\\t};\\n\\tint xs = 0;\\n\\tint ts = 0;\\n\\tfor (int i = 0; i < n; i++) xs ^= cnv(s[i]);\\n\\tfor (int i = 0; i < n; i++) ts ^= cnv(t[i]);\\n\\tif (xs != ts) cout << \\\"No\\\" << \\\"\\\\n\\\";\\n\\telse cout << \\\"Yes\\\" << \\\"\\\\n\\\";\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7240,\n \"score_of_the_acc\": -1.0019,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3177_4847773\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#pragma warning(disable : 4996)\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n\\n#define __builtin_popcount __popcnt\\n#define __builtin_popcountll __popcnt64\\n#endif\\n\\n#include <limits.h>\\n#include <math.h>\\n#include <time.h>\\n\\n#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <complex>\\n#include <cstdio>\\n#include <cstring>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <vector>\\n\\n//#include<atcoder/all>\\n\\nusing namespace std;\\n\\n//using namespace atcoder;\\n\\n#define REP(i, n) for (int i = 0; i < (n); ++i)\\n#define REPR(i, n) for (int i = n - 1; i >= 0; --i)\\n#define FOR(i, m, n) for (int i = m; i < n; ++i)\\n#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)\\n#define SORT(v, n) sort(v, v + n);\\n#define VSORT(v) sort(v.begin(), v.end());\\n#define REVERSE(v, n) reverse(v, v + n);\\n#define VREVERSE(v) reverse(v.begin(), v.end())\\n#define ll long long\\n#define print(x) cout << (x) << endl\\n#define pe(x) cout << (x) << \\\" \\\"\\n#define DEBUG(x) cout << #x << \\\": \\\" << x << endl\\n#define lb(v, n) lower_bound(v.begin(), v.end(), (n))\\n#define ub(v, n) upper_bound(v.begin(), v.end(), (n))\\n#define int long long\\n//#define double long double\\n#define all(x) (x).begin(), (x).end()\\n#define print_space(v) REP(i, v.size()) cout << v[i] << \\\" \\\\n\\\"[i==(int)v.size()-1]\\ntemplate <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }\\ntemplate <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }\\ntypedef pair<int, int> pii;\\ntypedef pair<long long, long long> pll;\\nstd::random_device rd;\\nstd::mt19937 mt(rd());\\nconstexpr ll MOD = 1e9 + 7;\\nconstexpr int MAX = 500050;\\nconst double pi = acos(-1);\\nconstexpr double EPS = 1e-8;\\nconstexpr ll LINF = 1e18 + 1;\\nconstexpr int INF = 1e9 + 1;\\nvoid Yes(bool cond) { cout << (cond ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid YES(bool cond) { cout << (cond ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\n\\n\\nint id[300];\\nvoid solve() {\\n\\tint N; cin >> N;\\n\\tstring S;\\n\\tstring T;\\n\\tcin >> S >> T;\\n\\tid['R'] = 0;\\n\\tid['B'] = 1;\\n\\tid['Y'] = 2;\\n\\tid['G'] = 3;\\n\\tint a = 0, b = 0;\\n\\tmap<char, int>mps, mpt;\\n\\tfor (auto c : S) {\\n\\t\\tmps[c]++;\\n\\t}\\n\\tfor (auto c : T) {\\n\\t\\tmpt[c]++;\\n\\t}\\n\\tif (mps.size() == 1 || mpt.size() == 1) {\\n\\t\\tif (mps.size() > 1 || mpt.size() > 1) {\\n\\t\\t\\tprint(\\\"No\\\"); return;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tYes(S[0] == T[0]);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\tfor (auto c : S)a ^= id[c];\\n\\tfor (auto c : T)b ^= id[c];\\n\\tif (a == b)print(\\\"Yes\\\");\\n\\telse print(\\\"No\\\");\\n}\\n\\n\\n\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\t//int q;\\n\\t//cin >> q;\\n\\t//while (q--)\\n\\tsolve();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6132,\n \"score_of_the_acc\": -0.3316,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3177_4847394\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n//----------------------- Print Function ----------------------//\\n\\ninline void print() {\\n cout << '\\\\n';\\n}\\ntemplate <typename First, typename... Rest>\\nvoid print(const First &first, const Rest &... rest) {\\n cout << first << ' ';\\n print(rest...);\\n}\\n\\ntemplate <typename T>\\nvoid print(const T &a) {\\n for (auto e : a) cout << e << ' ';\\n cout << '\\\\n';\\n}\\n\\n//------------------------- Libraries -------------------------//\\n\\n//--------------------------- Solve ---------------------------//\\n\\nint conv(char c) {\\n if (c == 'R') return 0;\\n if (c == 'B') return 1;\\n if (c == 'Y') return 2;\\n if (c == 'G') return 3;\\n else return -1;\\n}\\n\\nvoid solve() {\\n int n; cin >> n;\\n string s, t; cin >> s >> t;\\n set<char> ss, st; \\n int s_xor = 0, t_xor = 0;\\n for (char c : s) {\\n ss.insert(c);\\n s_xor ^= conv(c);\\n }\\n for (char c : t) {\\n st.insert(c);\\n t_xor ^= conv(c);\\n }\\n\\n if (ss.size() == 1 || st.size() == 1) {\\n cout << \\\"No\\\" << '\\\\n';\\n }\\n else {\\n if (s_xor == t_xor) cout << \\\"Yes\\\" << '\\\\n';\\n else cout << \\\"No\\\" << '\\\\n';\\n }\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 0.49056603773584906,\n \"time_ms\": 20,\n \"memory_kb\": 6320,\n \"score_of_the_acc\": -0.4435,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3177_4847217\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <stack>\\n#include <numeric>\\n#include <bitset>\\n#include <cmath>\\n\\nstatic const int MOD = 1000000007;\\nusing ll = long long;\\nusing u32 = unsigned;\\nusing u64 = unsigned long long;\\nusing namespace std;\\n\\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\\n\\nint main() {\\n int n;\\n cin >> n;\\n string s, t;\\n cin >> s >> t;\\n int same1 = 1, same2 = 1;\\n for (int i = 0; i+1 < n; ++i) {\\n if(s[i] != s[i+1]) same1 = 0;\\n if(t[i] != t[i+1]) same2 = 0;\\n }\\n array<int, 256> val{};\\n val['B'] = 1, val['Y'] = 2; val['G'] = 3;\\n if(same1 || same2){\\n puts(s == t ? \\\"Yes\\\" : \\\"No\\\");\\n }else {\\n int k = 0;\\n for (auto &&i : s) k ^= val[i];\\n for (auto &&i : t) k ^= val[i];\\n puts(k ? \\\"No\\\" : \\\"Yes\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5584,\n \"score_of_the_acc\": -0.0162,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3177_4847204\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(v) (v).begin(),(v).end()\\nusing ll = long long;\\nconstexpr int INF = 0x3f3f3f3f;\\nconstexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL;\\nconstexpr double EPS = 1e-8;\\nconstexpr int MOD = 1000000007;\\n// constexpr int MOD = 998244353;\\nconstexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\\nconstexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};\\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\\nstruct IOSetup {\\n IOSetup() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n }\\n} iosetup;\\n\\nbool has_one_color(string s) {\\n sort(ALL(s));\\n s.erase(unique(ALL(s)), s.end());\\n return s.length() == 1;\\n}\\n\\nint main() {\\n int n; string s, t; cin >> n >> s >> t;\\n if (has_one_color(s) || has_one_color(t)) {\\n cout << (has_one_color(s) && has_one_color(t) && s[0] == t[0] ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\");\\n return 0;\\n }\\n map<char, int> mp{{'R', 0}, {'B', 1}, {'Y', 2}, {'G', 3}};\\n int s_xor = 0, t_xor = 0;\\n for (char c : s) s_xor ^= mp[c];\\n for (char c : t) t_xor ^= mp[c];\\n cout << (s_xor == t_xor ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\");\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7244,\n \"score_of_the_acc\": -1.0043,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3177_4847123\",\n \"code_snippet\": \"#include\\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)\\n#define rep(i,n) REP((i),0,(n))\\nusing ll = long long;\\n\\nvector<int> counter(string s) {\\n vector<int> count(4, 0);\\n map<int, int> mp;\\n mp['R'] = 0;\\n mp['G'] = 1;\\n mp['B'] = 2;\\n mp['Y'] = 3;\\n for (char c : s) count[mp[c]]++;\\n return count;\\n}\\n\\nvoid shrink(vector<int>& count) {\\n if (count[0] > 1) {\\n if (count[1] == 0 && count[2] == 0) {\\n assert(count[3] > 0);\\n count[0]--;\\n count[1]++;\\n count[2]++;\\n count[3]--;\\n }\\n if (count[1] > 0 || count[2] > 0) {\\n while (count[0] > 1) {\\n count[0] -= 2;\\n count[3] += 2;\\n }\\n }\\n else {\\n assert(false);\\n }\\n }\\n if (count[1] > 1) {\\n if (count[0] == 0 && count[2] == 0) {\\n assert(count[3] > 0);\\n count[0]++;\\n count[1]--;\\n count[2]++;\\n count[3]--;\\n }\\n if (count[0] > 0 || count[2] > 0) {\\n while (count[1] > 1) {\\n count[1] -= 2;\\n count[3] += 2;\\n }\\n }\\n else {\\n assert(false);\\n }\\n }\\n if (count[2] > 1) {\\n if (count[0] == 0 && count[1] == 0) {\\n assert(count[3] > 0);\\n count[0]++;\\n count[1]++;\\n count[2]--;\\n count[3]--;\\n }\\n if (count[0] > 0 || count[1] > 0) {\\n while (count[2] > 1) {\\n count[2] -= 2;\\n count[3] += 2;\\n }\\n }\\n else {\\n assert(false);\\n }\\n }\\n /*\\n rep(i, 3) {\\n int mov = (count[i] / 2) * 2;\\n count[i] -= mov;\\n count[3] += mov;\\n }\\n */\\n if (count[0] == 1) {\\n if (count[1] == 1) {\\n count[0] = 0;\\n count[1] = 0;\\n count[2]++;\\n count[3]++;\\n }\\n else if (count[2] == 1) {\\n count[0] = 0;\\n count[1]++;\\n count[2] = 0;\\n count[3]++;\\n }\\n else if (count[3] > 0) {\\n count[0] = 0;\\n count[1]++;\\n count[2]++;\\n count[3]--;\\n }\\n }\\n assert(count[0] == 0);\\n assert(0 <= count[1] && count[1] <= 2);\\n assert(0 <= count[2] && count[2] <= 2);\\n}\\n\\nbool little_case(string& S, string& T) {\\n using namespace chrono;\\n const int N = S.size();\\n random_device rnd;\\n mt19937 mt(rnd());\\n uniform_int_distribution<> rndN(0, N - 2), rnd2(0, 1);\\n\\n auto start = system_clock::now();\\n while (duration_cast<milliseconds>(system_clock::now() - start).count() < 1800) {\\n if (S == T)return true;\\n // swap対象の検索\\n int tgtIdx = rndN(mt);\\n if (S[tgtIdx] == S[tgtIdx + 1])continue;\\n\\n set<char> color = { 'R','G','B', 'Y' };\\n REP(i, tgtIdx, tgtIdx + 2)color.erase(S[i]);\\n bool rev = rnd2(mt);\\n if (!rev) {\\n auto itr = color.begin();\\n S[tgtIdx] = *itr;\\n ++itr;\\n S[tgtIdx + 1] = *itr;\\n }\\n else {\\n auto itr = color.begin();\\n S[tgtIdx + 1] = *itr;\\n ++itr;\\n S[tgtIdx] = *itr;\\n }\\n }\\n return false;\\n}\\n\\n\\nint main()\\n{\\n int N;\\n string S, T;\\n cin >> N >> S >> T;\\n {\\n set<char> sts, stt;\\n for (char c : S)sts.insert(c);\\n for (char c : T)stt.insert(c);\\n if (sts.size() == 1 || stt.size() == 1) {\\n if (sts.size() == 1 && stt.size() == 1) {\\n char s1 = *sts.begin();\\n char s2 = *stt.begin();\\n cout << (s1 == s2 ? \\\"Yes\\\" : \\\"No\\\") << endl;\\n }\\n else {\\n cout << \\\"No\\\" << endl;\\n }\\n return 0;\\n }\\n }\\n if (N <= 6) {\\n cout << (little_case(S, T) ? \\\"Yes\\\" : \\\"No\\\") << endl;\\n return 0;\\n }\\n auto countS = counter(S);\\n auto countT = counter(T);\\n shrink(countS);\\n shrink(countT);\\n cout << (countS == countT ? \\\"Yes\\\" : \\\"No\\\") << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 6996,\n \"score_of_the_acc\": -0.8675,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3177_4847032\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#define REP(k, m, n) for (int(k) = (m); (k) < (n); (k)++)\\n#define rep(i, n) REP((i), 0, (n))\\nusing ll = long long;\\n\\nvector<int> counter(string s) {\\n vector<int> count(4, 0);\\n map<int, int> mp;\\n mp['R'] = 0;\\n mp['G'] = 1;\\n mp['B'] = 2;\\n mp['Y'] = 3;\\n for (char c : s) count[mp[c]]++;\\n return count;\\n}\\n\\nbool fail(vector<int>& v) {\\n for (auto num : v)\\n if (num < 0) return true;\\n return false;\\n}\\n\\nvoid shrink(vector<int>& count) {\\n if (count[0] > 1) {\\n if (count[1] == 0 && count[2] == 0) {\\n assert(count[3] > 0);\\n count[0]--;\\n count[1]++;\\n count[2]++;\\n count[3]--;\\n }\\n if (count[1] > 0 || count[2] > 0) {\\n while (count[0] > 1) {\\n count[0] -= 2;\\n count[3] += 2;\\n }\\n } else {\\n assert(false);\\n }\\n }\\n if (count[1] > 1) {\\n if (count[0] == 0 && count[2] == 0) {\\n assert(count[3] > 0);\\n count[0]++;\\n count[1]--;\\n count[2]++;\\n count[3]--;\\n }\\n if (count[0] > 0 || count[2] > 0) {\\n while (count[1] > 1) {\\n count[1] -= 2;\\n count[3] += 2;\\n }\\n } else {\\n assert(false);\\n }\\n }\\n if (count[2] > 1) {\\n if (count[0] == 0 && count[1] == 0) {\\n assert(count[3] > 0);\\n count[0]++;\\n count[1]++;\\n count[2]--;\\n count[3]--;\\n }\\n if (count[0] > 0 || count[1] > 0) {\\n while (count[2] > 1) {\\n count[2] -= 2;\\n count[3] += 2;\\n }\\n } else {\\n assert(false);\\n }\\n }\\n}\\n\\nbool little_case(string& S, string& T) {\\n using namespace chrono;\\n const int N = S.size();\\n random_device rnd;\\n mt19937 mt(rnd());\\n uniform_int_distribution<> rndN(0, N - 2), rnd2(0, 1);\\n\\n auto start = system_clock::now();\\n while (duration_cast<milliseconds>(system_clock::now() - start).count() <\\n 1800) {\\n if (S == T) return true;\\n // swap対象の検索\\n int tgtIdx = rndN(mt);\\n if (S[tgtIdx] == S[tgtIdx + 1]) continue;\\n\\n set<char> color = {'R', 'G', 'B', 'Y'};\\n REP(i, tgtIdx, tgtIdx + 2) color.erase(S[i]);\\n bool rev = rnd2(mt);\\n if (!rev) {\\n auto itr = color.begin();\\n S[tgtIdx] = *itr;\\n ++itr;\\n S[tgtIdx + 1] = *itr;\\n } else {\\n auto itr = color.begin();\\n S[tgtIdx + 1] = *itr;\\n ++itr;\\n S[tgtIdx] = *itr;\\n }\\n }\\n return false;\\n}\\n\\nstring parse(vector<int> count) {\\n string s = \\\"\\\";\\n rep(i, count[0]) s += \\\"R\\\";\\n rep(i, count[1]) s += \\\"G\\\";\\n rep(i, count[2]) s += \\\"B\\\";\\n for (int i = 0; i < count[3]; ++i) s += \\\"Y\\\";\\n return s;\\n}\\n\\nint main() {\\n int N;\\n string S, T;\\n cin >> N >> S >> T;\\n {\\n set<char> sts, stt;\\n for (char c : S) sts.insert(c);\\n for (char c : T) stt.insert(c);\\n if (sts.size() == 1 || stt.size() == 1) {\\n if (sts.size() == 1 && stt.size() == 1) {\\n char s1 = *sts.begin();\\n char s2 = *stt.begin();\\n cout << (s1 == s2 ? \\\"Yes\\\" : \\\"No\\\") << endl;\\n } else {\\n cout << \\\"No\\\" << endl;\\n }\\n return 0;\\n }\\n }\\n if (N <= 8) {\\n cout << (little_case(S, T) ? \\\"Yes\\\" : \\\"No\\\") << endl;\\n return 0;\\n }\\n auto countS = counter(S);\\n auto countT = counter(T);\\n shrink(countS);\\n shrink(countT);\\n {\\n int now = min(countS[3], countT[3]);\\n countS[3] -= now, countT[3] -= now;\\n }\\n S = parse(countS);\\n T = parse(countT);\\n assert(S.size() == T.size());\\n\\n cout << (little_case(S, T) ? \\\"Yes\\\" : \\\"No\\\") << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1860,\n \"memory_kb\": 6980,\n \"score_of_the_acc\": -1.831,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3177_4847024\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\nint main() {\\n int n;\\n string s, t;\\n cin >> n >> s >> t;\\n {\\n set<char> sts, stt;\\n for (char c : s) sts.insert(c);\\n for (char c : t) stt.insert(c);\\n if (sts.size() == 1 || stt.size() == 1) {\\n if (sts.size() == 1 && stt.size() == 1) {\\n char s1 = *sts.begin();\\n char s2 = *stt.begin();\\n cout << (s1 == s2 ? \\\"Yes\\\" : \\\"No\\\") << endl;\\n } else {\\n cout << \\\"No\\\" << endl;\\n }\\n return 0;\\n }\\n }\\n map<int, int> mp;\\n mp['R'] = 0;\\n mp['G'] = 1;\\n mp['B'] = 2;\\n mp['Y'] = 3;\\n int res = 0;\\n for (auto c : s) res ^= mp[c];\\n for (auto c : t) res ^= mp[c];\\n if (!res)\\n cout << \\\"Yes\\\" << endl;\\n else\\n cout << \\\"No\\\" << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 6968,\n \"score_of_the_acc\": -0.8508,\n \"final_rank\": 12\n }\n]","isConversational":false}}},{"rowIdx":1990,"cells":{"group_id":{"kind":"string","value":"aoj_3178_cpp"},"problem_description":{"kind":"string","value":"G Katsusando\n問題文\nお腹がすいたhenoくんは、カツサンドを食べることにしました。\n直線上にカツが $N$ 個あります。 $i$ 個目のカツは位置 $X_i$ にあり、その重さは $W_i$ です。henoくんは、次のようにしてカツサンドを作ります。\nパンを $1$ 個ずつ持ったやむなくくんとてんぷらくんを、直線上の好きな位置に配置する。 $2$ 人を同じ位置に配置してもよい。この操作にかかる時間は $1$ 秒である。カツのある位置に配置した場合、彼らはその場にあるカツを拾い、パンの上に載せる。 $2$ 人が同じ位置にいる場合は、やむなくくんがカツを拾う。カツを拾うのにかかる時間は無視できる。\nやむなくくんとてんぷらくんが同じ位置にいる場合、 $2$ 人を回収し、彼らの持っているパンと(存在すれば)カツを合わせてカツサンドにし、食べる。この操作にかかる時間は $K$ 秒である。カツがもう直線上に存在しない場合は終了する。そうでない場合、1に戻る。\n2でないとき、やむなくくんとてんぷらくんの好きな方を選び、左右好きな方に距離 $1$ だけ動かす。この操作にかかる時間は( $1+$ 移動させる人のパンの上に載っているカツの重さの総和 ) 秒である。移動先にカツがある場合、その場にあるカツを拾い、パンの上に載せる。カツを拾うのにかかる時間は無視できる。\nhenoくんが適切に操作を行ったとき、すべてのカツを食べきるのにかかる最短の時間は何秒でしょうか。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$ $K$\n$X_1$ $W_1$\n$X_2$ $W_2$\n$\\vdots$\n$X_N$ $W_N$\n制約\n入力はすべて整数である。\n$1 \\leq N \\leq 2000$\n$1 \\leq K \\leq 10^9$\n$1 \\leq X_1 \\lt X_2 \\lt \\cdots \\lt X_N \\leq 10^5$\n$1 \\leq W_i \\leq 10^5 \\ (1 \\leq i \\leq N)$\n出力\n答えを 1 行に出力せよ。\n入力例1\n3 10\n3 8\n10 3\n12 2\n出力例1\n28\n次のような行動が最適です。\n位置 $3$ にやむなくくんとてんぷらくんを配置する。やむなくくんがカツ $1$ を拾う。 $2$ 人は同じ位置にいるので、カツサンドが完成し、henoくんがそれを食べる。これには $1+10=11$ 秒かかる。\n位置$10$にやむなくくんを、位置 $12$ にてんぷらくんを配置する。 $2$ 人はそれぞれカツ $2$ 、カツ $3$ を拾う。これには $1$ 秒かかる。\nその後、てんぷらくんを $(1+2) \\times (12-10) = 6$ 秒かけて位置 $10$ に動かす。これでカツサンドが完成し、henoくんが $10$ 秒かけてそれを食べる。\n全体でかかった時間は $28$ 秒となります。\n入力例2\n1 334\n7 7\n出力例2\n335\n入力例3\n7 870894047\n2163 41212\n15706 26852\n19284 72177\n38949 13577\n45702 69074\n80014 45456\n86152 80205\n出力例3\n3785073673"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3178_10356303","code_snippet":"// AOJ #3178 Katsu Sando\n// 2025.4.7\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1LL << 60;\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nint main(){\n int n = Cin();\n ll K = Cin();\n\n vector<ll> X(n+1), W(n+1);\n for(int i = 1; i <= n; i++) X[i] = Cin(), W[i] = Cin();\n\n vector<ll> A(n+1,0);\n for(int i = 1; i <= n; i++) A[i] = A[i-1] + W[i];\n\n vector<ll> P(n+1, 0);\n for(int i = 1; i <= n-1; i++){\n ll d = X[i+1] - X[i];\n P[i] = P[i-1] + d * A[i];\n }\n P[n] = P[n-1];\n\n vector<vector<ll>> cost(n+1, vector<ll>(n+1, 0));\n for(int l = 1; l <= n; l++){\n cost[l][l] = 0;\n int m_opt = l;\n for(int r = l+1; r <= n; r++){\n auto f = [&](int m) -> ll {\n return (X[m] - X[l]) * (1 - A[l-1])\n + (X[r] - X[m]) * (1 + A[r])\n + 2 * P[m-1] - P[l-1] - P[r-1];\n };\n while(m_opt < r && f(m_opt+1) < f(m_opt)) m_opt++;\n cost[l][r] = f(m_opt);\n }\n }\n\n vector<ll> dp(n+1, INF);\n dp[0] = 0;\n for(int i = 1; i <= n; i++){\n for(int j = 0; j < i; j++){\n ll phase = 1 + cost[j+1][i] + K;\n dp[i] = min(dp[i], dp[j] + phase);\n }\n }\n printf(\"%lld\\n\", dp[n]);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":34996,"score_of_the_acc":-0.3793,"final_rank":7},{"submission_id":"aoj_3178_10353484","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define Endl endl\n#define all(a) a.begin(), a.end()\n#define pr(i, j) make_pair(i, j)\n#define isin(x, l, r) (l <= x && x < r)\n#define chmin(a, b) a = min(a, b)\n#define chmax(a, b) a = max(a, b)\n#define srt(ar) sort(ar.begin(), ar.end())\n#define rev(ar) reverse(ar.begin(), ar.end())\n#define jge(f, s, t) cout << (f ? s : t) << endl\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define printar(ar) \\\n do \\\n { \\\n for (auto dbg : ar) \\\n { \\\n cout << dbg << \" \"; \\\n } \\\n cout << endl; \\\n } while (0)\nconst ll inf = 1e18;\nconst ld pi = 3.14159265358979;\nconst ld eps = 1e-9;\ntemplate <class T, ll n, ll idx = 0>\nauto make_vec(const ll (&d)[n], const T &init) noexcept\n{\n if constexpr (idx < n)\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else\n return init;\n}\n\ntemplate <class T, ll n>\nauto make_vec(const ll (&d)[n]) noexcept\n{\n return make_vec(d, T{});\n}\n//////////////// 以下を貼る ////////////////\ntemplate <class T>\nsize_t HashCombine(const size_t seed, const T &v)\n{\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\n}\n/* pair用 */\ntemplate <class T, class S>\nstruct std::hash<std::pair<T, S>>\n{\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\n {\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\n }\n};\n////////////////////////////////////////////\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n, K;\n cin >> n >> K;\n vector<ll> x(n);\n vector<ll> w(n);\n rep(i, 0, n)\n {\n cin >> x[i] >> w[i];\n }\n vector<ll> dp(n + 1, inf);\n dp[0] = 0;\n vector<vector<ll>> dp2(n, vector<ll>(n, inf));\n vector<vector<ll>> dp3(n, vector<ll>(n, inf));\n rep(i, 0, n)\n {\n dp3[i][i] = 0;\n ll spd = 1 + w[i];\n ll t = 0;\n rep(j, i + 1, n)\n {\n t += (x[j] - x[j - 1]) * spd;\n dp3[i][j] = t;\n spd += w[j];\n }\n spd = 1 + w[i];\n t = 0;\n drep(j, i, 0)\n {\n t += (x[j + 1] - x[j]) * spd;\n dp3[i][j] = t;\n spd += w[j];\n }\n }\n rep(i, 0, n)\n {\n ll x = i;\n rep(j, i, n)\n {\n while (true)\n {\n if (x == j)\n {\n break;\n }\n if (dp3[i][x] + dp3[j][x] < dp3[i][x + 1] + dp3[j][x + 1])\n {\n break;\n }\n x++;\n }\n dp2[i][j] = dp3[i][x] + dp3[j][x];\n }\n }\n rep(i, 0, n)\n {\n rep(j, 0, i + 1)\n {\n chmin(dp[i + 1], dp[j] + 1 + dp2[j][i] + K);\n }\n }\n cout << dp[n] << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":66048,"score_of_the_acc":-0.7516,"final_rank":15},{"submission_id":"aoj_3178_10199995","code_snippet":"// AOJ #3178\n// Katsu Sando 2025.2.6\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n \nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N; \n ll K;\n cin >> N >> K;\n vector<int> X(N), W(N);\n for (int i = 0; i < N; i++){\n cin >> X[i] >> W[i];\n }\n // 前計算：P[i] = W[0] + W[1] + ... + W[i]\n vector<ll> P(N, 0);\n P[0] = W[0];\n for (int i = 1; i < N; i++){\n P[i] = P[i-1] + W[i];\n }\n \n vector<vector<ll>> Lcost(N, vector<ll>(N, 0));\n for (int i = 0; i < N; i++){\n Lcost[i][i] = 0;\n for (int j = i+1; j < N; j++){\n ll sumWeights = (i==0 ? P[j-1] : P[j-1] - P[i-1]);\n Lcost[i][j] = Lcost[i][j-1] + (ll)(X[j] - X[j-1]) * (1 + sumWeights);\n }\n }\n\n vector<vector<ll>> Rcost(N, vector<ll>(N, 0));\n for (int j = 0; j < N; j++){\n Rcost[j][j] = 0;\n for (int m = j-1; m >= 0; m--){\n ll sumWeights = (m==0 ? P[j] : P[j] - P[m]);\n Rcost[j][m] = Rcost[j][m+1] + (ll)(X[m+1]-X[m]) * (1 + sumWeights);\n }\n }\n \n const ll INF = 1LL << 60;\n vector<ll> dp(N, INF);\n\n auto bestForSegment = [&](int i, int j) -> ll {\n int lo = i, hi = j;\n while(hi - lo >= 3){\n int m1 = lo + (hi - lo) / 3;\n int m2 = hi - (hi - lo) / 3;\n ll f1 = Lcost[i][m1] + Rcost[j][m1];\n ll f2 = Lcost[i][m2] + Rcost[j][m2];\n if(f1 > f2)\n lo = m1;\n else\n hi = m2;\n }\n ll best = INF;\n for (int m = lo; m <= hi; m++){\n best = min(best, Lcost[i][m] + Rcost[j][m]);\n }\n return best;\n };\n\n for (int j = 0; j < N; j++){\n for (int i = 0; i <= j; i++){\n ll segTime = 1 + K + bestForSegment(i, j);\n ll prev = (i-1 >= 0 ? dp[i-1] : 0);\n dp[j] = min(dp[j], prev + segTime);\n }\n }\n cout << dp[N-1] << endl;\n return 0;\n}","accuracy":0.9166666666666666,"time_ms":220,"memory_kb":65908,"score_of_the_acc":-1.6549,"final_rank":20},{"submission_id":"aoj_3178_5813478","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 2005\n\nll N,K;\nll X[SIZE],W[SIZE],dp[SIZE];\nll SUM[SIZE],rui_W[SIZE];\nll COST[SIZE][SIZE];\n\nll to_R(int left,int right){\n\n\treturn SUM[right]-SUM[left]-rui_W[left]*(X[right]-X[left]);\n}\n\nll to_L(int left,int right){\n\n\treturn (rui_W[right+1]-rui_W[left])*(X[right]-X[left])-to_R(left,right);\n}\n\nll func(int left,int right,int k){\n\n\treturn to_R(left,k) + to_L(k,right);\n}\n\nint main(){\n\n\tscanf(\"%lld %lld\",&N,&K);\n\n\tfor(ll i = 0; i < N; i++){\n\n\t\tscanf(\"%lld %lld\",&X[i],&W[i]);\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\trui_W[i+1] = rui_W[i]+W[i];\n\t\tSUM[i+1] = SUM[i] + rui_W[i+1]*(X[i+1]-X[i]);\n\t}\n\n\tfor(int left = 0; left < N; left++){\n\t\tint k = left;\n\t\tfor(int right = left; right < N; right++){\n\t\t\twhile(k < right && func(left,right,k) > func(left,right,k+1)){\n\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tCOST[left][right] = func(left,right,k) + (X[right]-X[left]) + K+1;\n\t\t}\n\t}\n\n\tfor(int i = 0; i <= N; i++){\n\n\t\tdp[i] = HUGE_NUM;\n\t}\n\n\tdp[0] = 0;\n\tfor(int i = 1; i <= N; i++){\n\t\tfor(int j = 0; j < i; j++){\n\n\t\t\tdp[i] = min(dp[i],dp[j]+COST[j][i-1]);\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",dp[N]);\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":25904,"score_of_the_acc":-0.3318,"final_rank":6},{"submission_id":"aoj_3178_4906139","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n ll n,k;cin>>n>>k;\n vector<ll>x(n),w(n);\n rep(i,0,n)cin>>x[i]>>w[i];\n auto dp=vec(n+1,n+1,INF);\n dp[0][0]=0;\n vector<ll>y(n+1);\n rep(i,0,n)y[i+1]=y[i]+x[i];\n rep(i,0,n){\n ll mi=INF;\n rep(j,0,n+1){\n if(j<n)chmin(mi,dp[i][j]-x[j]);\n chmin(dp[i+1][j],dp[i][j]);\n if(j>0)chmin(dp[i+1][j],mi+k+x[j-1]+1);\n if(j<n)mi+=abs(x[j]-x[i])*w[j];\n }\n }\n //debug(dp,n+1,n+1);\n cout<<dp[n][n]<<endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":34320,"score_of_the_acc":-0.3246,"final_rank":4},{"submission_id":"aoj_3178_4875832","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=Int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\n//INSERT ABOVE HERE\nconst Int MAX = 2020;\nInt dpL[MAX][MAX]={};\nInt dpR[MAX][MAX]={};\nInt cst[MAX][MAX]={};\n\nInt dp[MAX]={};\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n Int n,k;\n cin>>n>>k;\n vector<Int> xs(n),ws(n);\n for(Int i=0;i<n;i++) cin>>xs[i]>>ws[i];\n\n // dpL: [i, j]\n for(Int i=0;i<n;i++){\n Int res=0,wei=1;\n dpL[i][i]=res;\n wei+=ws[i];\n for(Int j=i+1;j<n;j++){\n res+=wei*abs(xs[j]-xs[j-1]);\n dpL[i][j]=res;\n wei+=ws[j];\n }\n }\n\n // dpR: [i, j]\n for(Int j=n-1;j>=0;j--){\n Int res=0,wei=1;\n dpL[j][j]=res;\n wei+=ws[j];\n for(Int i=j-1;i>=0;i--){\n res+=wei*abs(xs[i]-xs[i+1]);\n dpR[i][j]=res;\n wei+=ws[i];\n }\n }\n\n for(Int i=0;i<n;i++){\n for(Int j=i;j<n;j++){\n if(i==j){\n cst[i][j]=0;\n continue;\n }\n auto calc=[&](Int m){return dpL[i][m]+dpR[m][j];};\n Int l=i,r=j;\n while(l+1<r){\n Int m=(l+r)>>1;\n if(calc(m)<calc(m+1)) r=m;\n else l=m;\n }\n cst[i][j]=min(calc(l),calc(r));\n }\n }\n\n const Int INF = 1e18;\n fill(dp,dp+MAX,INF);\n dp[0]=0;\n for(Int i=0;i<n;i++)\n for(Int j=i;j<n;j++)\n chmin(dp[j+1],dp[i]+(1+cst[i][j]+k));\n cout<<dp[n]<<endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":97988,"score_of_the_acc":-1.1808,"final_rank":19},{"submission_id":"aoj_3178_4864963","code_snippet":"#include <bits/stdc++.h>\n//#include <chrono>\n//#pragma GCC optimize(\"Ofast\")\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\n#define Rrep(i,n) Rreps(i,n,0)\n#define ALL(a) a.begin(), a.end()\n#define fi first\n#define se second\n\nusing ll = long long;\nusing vec = vector<ll>;\nusing mat = vector<vec>;\n\nll N,M,H,W,Q,K,A,B;\nstring S;\ntypedef pair<ll, ll> P;\nconst ll INF = (1LL<<60);\n\ntemplate<class T> bool chmin(T &a, const T &b){\n if(a > b) {a = b; return true;}\n else return false;\n}\n\nvoid fill_memo(vec &x, vec &w, mat &memo){\n vec ws(N + 1), muls(N), muls_rev(N);\n ws[0] = muls[0] = muls_rev[N-1] = 0;\n rep(i, N) {\n ws[i+1] = ws[i] + w[i];\n if(i != N - 1) muls[i+1] = muls[i] + ws[i + 1] * (x[i+1] - x[i]);\n }\n Rrep(i, N - 1) muls_rev[i] = muls_rev[i+1] + (ws[N] - ws[i + 1]) * (x[i+1] - x[i]);\n rep(l, N){\n reps(r, l + 1, N + 1){\n int id = lower_bound(ALL(ws), (ws[l] + ws[r] + 1) / 2) - (ws.begin() + 1);\n //[l,id] : left, [id, r) : right\n memo[l][r] = K + 1 + (x[r-1] - x[l]) + (muls[id] - muls[l] - ws[l] * (x[id] - x[l])) + (muls_rev[id] - muls_rev[r-1] - (ws[N] - ws[r]) * (x[r-1] - x[id]));\n }\n }\n}\n\nint main() {\n cin>>N>>K;\n mat memo(N, vec(N + 1));\n vec x(N), w(N);\n rep(i, N) cin>>x[i]>>w[i];\n fill_memo(x, w, memo);\n vec dp(N + 1, INF);\n dp[0] = 0;\n reps(i, 1, N + 1){\n rep(j, i) chmin(dp[i], dp[j] + memo[j][i]);\n }\n cout<<dp[N]<<endl;\n}","accuracy":1,"time_ms":70,"memory_kb":34452,"score_of_the_acc":-0.6117,"final_rank":13},{"submission_id":"aoj_3178_4864960","code_snippet":"#include <bits/stdc++.h>\n//#include <chrono>\n//#pragma GCC optimize(\"Ofast\")\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\n#define Rrep(i,n) Rreps(i,n,0)\n#define ALL(a) a.begin(), a.end()\n#define fi first\n#define se second\n\nusing ll = long long;\nusing vec = vector<ll>;\nusing mat = vector<vec>;\n\nll N,M,H,W,Q,K,A,B;\nstring S;\ntypedef pair<ll, ll> P;\nconst ll INF = (1LL<<60);\n\ntemplate<class T> bool chmin(T &a, const T &b){\n if(a > b) {a = b; return true;}\n else return false;\n}\ntemplate<class T> bool chmax(T &a, const T &b){\n if(a < b) {a = b; return true;}\n else return false;\n}\n\nvoid fill_memo(vec &x, vec &w, mat &memo){\n vec ws(N), muls(N), muls_rev(N);\n ws[0] = w[0];\n muls[0] = muls_rev[N-1] = 0;\n rep(i, N - 1) {\n ws[i+1] = ws[i] + w[i + 1];\n muls[i+1] = muls[i] + ws[i] * (x[i+1] - x[i]);\n }\n Rrep(i, N - 1) muls_rev[i] = muls_rev[i+1] + (ws[N-1] - ws[i]) * (x[i+1] - x[i]);\n rep(l, N){\n reps(r, l + 1, N + 1){\n int id = lower_bound(ALL(ws), ((l == 0 ? 0LL : ws[l-1]) + ws[r-1] + 1) / 2) - ws.begin();\n //[l,id] : left, [id, r) : right\n memo[l][r] = K + 1 + (x[r-1] - x[l]) + (muls[id] - muls[l] - (l==0 ? 0 : ws[l-1]) * (x[id] - x[l])) + (muls_rev[id] - muls_rev[r-1] - (ws[N-1] - ws[r-1]) * (x[r-1] - x[id]));\n //cout<<l<<' '<<r<<' '<<id<<' '<<memo[l][r]<<endl;\n }\n }\n}\n\nint main() {\n cin>>N>>K;\n mat memo(N, vec(N + 1));\n vec x(N), w(N);\n rep(i, N) cin>>x[i]>>w[i];\n fill_memo(x, w, memo);\n vec dp(N + 1, INF);\n dp[0] = 0;\n reps(i, 1, N + 1){\n rep(j, i) chmin(dp[i], dp[j] + memo[j][i]);\n }\n cout<<dp[N]<<endl;\n}","accuracy":1,"time_ms":60,"memory_kb":34452,"score_of_the_acc":-0.5641,"final_rank":11},{"submission_id":"aoj_3178_4855066","code_snippet":"#pragma region Macros\n#pragma GCC optimize(\"O3\")\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define pb push_back\n#define eb emplace_back\n#define vi vector<int>\n#define vll vector<ll>\n#define vpi vector<pii>\n#define vpll vector<pll>\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n#define fi first\n#define se second\n#define all(c) begin(c), end(c)\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\nusing namespace std;\nstring YES[2] = {\"NO\", \"YES\"};\nstring Yes[2] = {\"No\", \"Yes\"};\nstring yes[2] = {\"no\", \"yes\"};\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n#define si(c) (int)(c).size()\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\n scan(head);\n IN(tail...);\n}\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\nvi iota(int n) {\n vi a(n);\n iota(all(a), 0);\n return a;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n sort(all(y));\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\nint popcount(ll x) { return __builtin_popcountll(x); }\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n }\n} setup_io;\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return move(res);\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return move(res);\n}\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n for(auto &e : v) cout << e << \" \";\n cout << endl;\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n cout << \"(\" << p.fi << \", \" << p.se << \")\";\n return os;\n}\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\ntemplate <class A> string to_string(A v) {\n if(v.empty()) return \"{}\";\n string ret = \"{\";\n for(auto &x : v) ret += to_string(x) + \",\";\n ret.back() = '}';\n return ret;\n}\n\nvoid dump() { cerr << endl; }\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#define endl '\\n'\n#ifdef _LOCAL\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\n#define debug(x)\n#endif\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\n#pragma endregion\n\nint main() {\n INT(n);\n LL(k);\n vll x(n), w(n);\n rep(i, n) cin >> x[i] >> w[i];\n vll dp(n + 1, LLONG_MAX);\n dp[0] = 0;\n vll rui(n + 1), W(n + 1);\n rep(i, n) rui[i + 1] = rui[i] + x[i] * w[i];\n rep(i, n) W[i + 1] = w[i] + W[i];\n auto sum = [&](int l, int r) { return rui[r] - rui[l]; };\n auto wsum = [&](int l, int r) { return W[r] - W[l]; };\n rep(i, n) {\n int t = i;\n rep2(j, i + 1, n) {\n while(t < n and wsum(i, t + 1) < wsum(t + 1, j)) t++;\n ll cost = LLONG_MAX;\n chmin(cost, (x[j - 1] - x[i]) + (wsum(i, t + 1) * x[t] - sum(i, t + 1)) + (sum(t + 1, j) - wsum(t + 1, j) * x[t]) + k);\n chmin(dp[j], dp[i] + cost + 1);\n }\n }\n cout << dp[n] << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3540,"score_of_the_acc":-0.0028,"final_rank":2},{"submission_id":"aoj_3178_4849435","code_snippet":"#include <iostream>\n#include <vector>\n\ntemplate <class T>\nstd::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }\n\nusing lint = long long;\nconstexpr lint INF = 1LL << 60;\n\nvoid solve() {\n int n, k;\n std::cin >> n >> k;\n\n std::vector<lint> xs(n + 1), ws(n + 1);\n for (int i = 1; i <= n; ++i) std::cin >> xs[i] >> ws[i];\n\n // [i, j]を左から右へ移動するときのコスト\n auto lcost = vec(n + 1, vec(n + 1, 0LL));\n for (int l = 1; l <= n; ++l) {\n lint sum = ws[l] + 1;\n for (int r = l + 1; r <= n; ++r) {\n lcost[l][r] = lcost[l][r - 1] + sum * (xs[r] - xs[r - 1]);\n sum += ws[r];\n }\n }\n\n // [i, j]を右から左へ移動するときのコスト\n auto rcost = vec(n + 1, vec(n + 1, 0LL));\n for (int r = 1; r <= n; ++r) {\n lint sum = ws[r] + 1;\n for (int l = r - 1; l >= 1; --l) {\n rcost[l][r] = rcost[l + 1][r] + sum * (xs[l + 1] - xs[l]);\n sum += ws[l];\n }\n }\n\n std::vector<lint> bdp(n + 1, INF), rdp(n + 1, INF);\n // 文章中で定義したDPテーブル2つ\n bdp[0] = 0;\n\n for (int i = 1; i <= n; ++i) {\n for (int l = 0; l < i; ++l) {\n rdp[i] = std::min(rdp[i], bdp[l] + 1 + lcost[l + 1][i]);\n }\n\n for (int l = 1; l <= i; ++l) {\n bdp[i] = std::min(bdp[i], rdp[l] + rcost[l][i] + k);\n }\n }\n\n std::cout << bdp[n] << \"\\n\";\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":66016,"score_of_the_acc":-0.7989,"final_rank":16},{"submission_id":"aoj_3178_4849244","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n\ntemplate <class T>\nstd::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }\n\nusing lint = long long;\nconstexpr lint INF = 1LL << 60;\n\nvoid solve() {\n int n, k;\n std::cin >> n >> k;\n\n std::vector<lint> xs(n + 1), ws(n + 1);\n for (int i = 1; i <= n; ++i) std::cin >> xs[i] >> ws[i];\n\n auto lcost = vec(n + 1, vec(n + 1, 0LL));\n for (int l = 1; l <= n; ++l) {\n lint sum = ws[l] + 1;\n for (int r = l + 1; r <= n; ++r) {\n lcost[l][r] = lcost[l][r - 1] + sum * (xs[r] - xs[r - 1]);\n sum += ws[r];\n }\n }\n\n auto rcost = vec(n + 1, vec(n + 1, 0LL));\n for (int r = 1; r <= n; ++r) {\n lint sum = ws[r] + 1;\n for (int l = r - 1; l >= 1; --l) {\n rcost[l][r] = rcost[l + 1][r] + sum * (xs[l + 1] - xs[l]);\n sum += ws[l];\n }\n }\n\n std::vector<lint> dp0(n + 1, INF), dp1(n + 1, INF);\n dp0[0] = 0;\n\n for (int i = 1; i <= n; ++i) {\n for (int l = 0; l < i; ++l) {\n dp1[i] = std::min(dp1[i], dp0[l] + 1 + lcost[l + 1][i]);\n }\n\n for (int l = 1; l <= i; ++l) {\n dp0[i] = std::min(dp0[i], dp1[l] + rcost[l][i] + k);\n }\n }\n\n std::cout << dp0[n] << \"\\n\";\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":66016,"score_of_the_acc":-0.7989,"final_rank":16},{"submission_id":"aoj_3178_4849140","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using vvec = vec<vec<T>>;\n\nconst ll inf = 1e18;\n\nint main() {\n int N,K;\n cin >> N >> K;\n vec<ll> X(N),W(N),WS(N+1),S(N+1);\n for(int i=0;i<N;i++){\n cin >> X[i] >> W[i];\n S[i+1] = S[i]+W[i]*X[i];\n WS[i+1] = WS[i]+W[i];\n }\n vvec<ll> cost(N+1,vec<ll>(N+1));\n \n auto val = [&](int l,int r,int id){\n assert(l<=id && id<r);\n ll res = (WS[id+1]-WS[l]+1)*X[id]-(S[id+1]-S[l]+X[l]);\n res += S[r]-S[id]+X[r-1]-(WS[r]-WS[id]+1)*X[id];\n return res;\n };\n\n for(int l=0;l<N;l++){\n int k = l;\n for(int r=l+1;r<=N;r++){\n while(k+1<r && val(l,r,k)>=val(l,r,k+1)) k++;\n cost[l][r] = val(l,r,k);\n }\n }\n\n vec<ll> dp(N+1,inf);\n dp[0] = 0;\n for(int i=0;i<N;i++){\n for(int j=0;j<=i;j++) dp[i+1] = min(dp[i+1],dp[j]+cost[j][i+1]+K+1);\n }\n cout << dp[N] << \"\\n\";\n}","accuracy":1,"time_ms":30,"memory_kb":34856,"score_of_the_acc":-0.4254,"final_rank":10},{"submission_id":"aoj_3178_4849080","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 1020000;\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\nconst double pi = acos(-1);\nconst double eps = 1e-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << \"debug: \" << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << \"debug: \" << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nll cost[2020][2020];\n\nint main(){\n\tll n,k; cin >> n >> k;\n\tvl x(n), w(n);\n\trep(i,n) cin >> x[i] >> w[i];\n\tfor(int i=0; i<n; i++){\n\t\tll S = w[i] + 1;\n\t\tfor(int j=i+1; j<n; j++){\n\t\t\tcost[i][j] = cost[i][j-1] + S * (x[j] - x[j-1]);\n\t\t\tS += w[j];\n\t\t}\n\t\tS = w[i] + 1;\n\t\tfor(int j=i-1; j>=0; j--){\n\t\t\tcost[i][j] = cost[i][j+1] + S * (x[j+1] - x[j]);\n\t\t\tS += w[j];\n\t\t}\n\t}\n\tvl dp(n+1,linf);\n\tdp[0] = 0;\n\trep(i,n){\n\t\tll mn = dp[i];\n\t\tint m = i;\n\t\tfor(int j=i-1; j>=0; j--){\n\t\t\twhile(m > j && cost[j][m] + cost[i][m] > cost[j][m-1] + cost[i][m-1]) m--;\n\t\t\tchmin(mn, dp[j] + cost[j][m] + cost[i][m]);\n\t\t}\n\t\tchmin(dp[i+1], mn + k + 1);\n\t}\n\tcout << dp[n] << \"\\n\";\n}","accuracy":1,"time_ms":30,"memory_kb":34732,"score_of_the_acc":-0.4242,"final_rank":8},{"submission_id":"aoj_3178_4848980","code_snippet":"#include <bits/stdc++.h>\n#define inf (long long)(1e17)\nusing namespace std;\n\nlong long n, k;\nvector<long long> x, w, dp;\nvector<vector<long long>> cost;\n\nlong long solve();\n\nint main() {\n cin >> n >> k;\n x.resize(n);\n w.resize(n);\n for (int i = 0; i < n; ++i) cin >> x[i] >> w[i];\n cout << solve() << endl;\n return 0;\n}\n\nlong long solve() {\n { // calc cost from i to j\n cost.assign(n, vector<long long>(n, inf));\n for (int i = 0; i < n; ++i) {\n long long now = 0;\n // i >= j(left)\n for (int j = i; j < n; ++j) {\n now += w[j] * (x[j] - x[i]);\n cost[j][i] = now + x[j] - x[i];\n }\n // i <= j(right)\n now = 0;\n for (int j = i; j >= 0; --j) {\n now += w[j] * (x[i] - x[j]);\n cost[j][i] = now + x[i] - x[j];\n }\n }\n }\n dp.assign(n + 1, inf);\n dp[0] = 0;\n for (int i = 0; i < n; ++i) {\n long long now = inf;\n for (int j = 0; j <= i; ++j) now = min(now, dp[j] + cost[j][i]);\n for (int j = i; j < n; ++j)\n dp[j + 1] = min(dp[j + 1], now + cost[j][i] + k + 1);\n }\n return dp[n];\n}","accuracy":1,"time_ms":30,"memory_kb":34804,"score_of_the_acc":-0.4249,"final_rank":9},{"submission_id":"aoj_3178_4848979","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n#include <cassert>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\nint main() {\n int n, k;\n cin >> n >> k;\n vector<int> X(n), W(n);\n for (int i = 0; i < n; ++i) {\n scanf(\"%d %d\", &X[i], &W[i]);\n }\n vector<ll> dp(n+1, INF<ll>);\n dp[0] = 0;\n vector<ll> sumW(n+1);\n for (int i = 0; i < n; ++i) sumW[i+1] = sumW[i]+ W[i];\n for (int i = 0; i < n; ++i) {\n int cur = i; ll val = k+1, d = 2*W[i];\n for (int j = i; j < n; ++j) {\n d -= W[j];\n val += (ll)(X[j] - X[cur])*W[j];\n if(j != i) val += (X[j]-X[j-1]);\n while(d < 0) {\n val += d*(X[cur+1]-X[cur]);\n d += W[++cur]*2;\n }\n chmin(dp[j+1], dp[i]+val);\n }\n }\n cout << dp.back() << \"\\n\";\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3276,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_3178_4848744","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nll dp[2020][2020][3];\n\nint main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tint n; cin >> n;\n\tll K; cin >> K;\n\tvector<ll> x(n),w(n);\n\tvector<ll> s(n+1,0);\n\tfor(int i=0;i<n;i++){\n\t\tcin >> x[i] >> w[i];\n\t\ts[i+1]=s[i]+w[i];\n\t}\n\tfor(int i=0;i<2020;i++){\n\t\tfor(int j=0;j<2020;j++){\n\t\t\tfor(int k=0;k<3;k++){\n\t\t\t\tdp[i][j][k]=1e18;\n\t\t\t}\n\t\t}\n\t}\n\tdp[0][0][0]=1;\n\tdp[0][0][1]=1;\n\tdp[0][0][2]=K+1;\n\tfor(int i=1;i<n;i++){\n\t\tfor(int j=0;j<i;j++){\n\t\t\tfor(int k=0;k<3;k++){\n\t\t\t\tif(k==0){\n\t\t\t\t\tdp[i][j][0]=min(dp[i][j][0],dp[i-1][j][0]+(x[i]-x[i-1])*(s[i]-s[j]));\n\t\t\t\t\tdp[i][i][1]=min(dp[i][i][1],dp[i-1][j][0]+(x[i]-x[i-1])*(s[i]-s[j])+(x[i]-x[j]));\n\t\t\t\t\tdp[i][i][2]=min(dp[i][i][2],dp[i-1][j][0]+(x[i]-x[i-1])*(s[i]-s[j])+K+(x[i]-x[j]));\n\t\t\t\t}\n\t\t\t\telse if(k==1){\n\t\t\t\t\tdp[i][j][1]=min(dp[i][j][1],dp[i-1][j][1]+(w[i])*(x[i]-x[j]));\n\t\t\t\t\tdp[i][i][2]=min(dp[i][i][2],dp[i-1][j][1]+(w[i])*(x[i]-x[j])+K+(x[i]-x[j]));\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tif(i-1==j){\n\t\t\t\t\t\tdp[i][i][0]=min(dp[i][i][0],dp[i-1][j][k]+1);\n\t\t\t\t\t\tdp[i][i][1]=min(dp[i][i][1],dp[i-1][j][k]+1);\n\t\t\t\t\t\tdp[i][i][2]=min(dp[i][i][2],dp[i-1][j][k]+K+1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << dp[n-1][n-1][2] << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":98912,"score_of_the_acc":-1.0952,"final_rank":18},{"submission_id":"aoj_3178_4848331","code_snippet":"#include <bits/stdc++.h>\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\n#define rep(i, n) For((i), 0, (n))\n#define rrep(i, n) rFor((i), (n), 0)\n#define fi first\n#define se second\nusing namespace std;\ntypedef long long lint;\ntypedef unsigned long long ulint;\ntypedef pair<int, int> pii;\ntypedef pair<lint, lint> pll;\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nT div_floor(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a >= 0 ? a / b : (a + 1) / b - 1;\n}\ntemplate <class T>\nT div_ceil(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a > 0 ? (a - 1) / b + 1 : a / b;\n}\n\nconstexpr lint mod = 1000000007;\nconstexpr lint INF = mod * mod;\nconstexpr int MAX = 100010;\n\nint n;\nlint K;\nint x[2020];\nlint w[2020];\nlint cost[2020][2020], dp[2020];\n\nint main() {\n scanf(\"%d%lld\", &n, &K);\n rep(i, n) scanf(\"%d%lld\", &x[i], &w[i]);\n\n rep(l, n) {\n lint lsum, rsum, tmp_cost;\n lsum = rsum = tmp_cost = 0;\n int pos = l;\n For(r, l, n) {\n if (pos == r)\n lsum += w[r];\n else\n rsum += w[r];\n tmp_cost += w[r] * (x[r] - x[pos]);\n while (pos + 1 <= r && (lsum - rsum) * (x[pos + 1] - x[pos]) < 0) {\n tmp_cost += (lsum - rsum) * (x[pos + 1] - x[pos]);\n rsum -= w[pos + 1];\n lsum += w[pos + 1];\n ++pos;\n }\n cost[l][r] = tmp_cost + x[r] - x[l];\n }\n }\n\n rep(i, n) {\n dp[i] = cost[0][i] + 1 + K;\n rep(j, i) chmin(dp[i], dp[j] + cost[j + 1][i] + 1 + K);\n }\n printf(\"%lld\\n\", dp[n - 1]);\n}","accuracy":1,"time_ms":10,"memory_kb":34528,"score_of_the_acc":-0.3268,"final_rank":5},{"submission_id":"aoj_3178_4848301","code_snippet":"/**\n * author: otera \n**/\n#include<iostream>\n#include<string> \n#include<cstdio>\n#include<cstring>\n#include<vector>\n#include<cmath>\n#include<algorithm> \n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<deque>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\n#define int long long\ntypedef long long ll;\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\ntypedef long double ld;\nconst int inf=1e9+7;\nconst ll INF=1LL<<60 ;\nconst ll mod=1e9+7 ;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef complex<ld> Point;\nconst ld eps = 1e-8;\nconst ld pi = acos(-1.0);\ntypedef pair<int, int> P;\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define debug(x) cerr << #x << \" = \" << (x) << endl;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nvoid solve() {\n\tint n, k; cin >> n >> k;\n vector<int> x(n), w(n);\n rep(i, n) {\n cin >> x[i] >> w[i];\n }\n vector<int> left(n, 0), right(n + 1, 0);\n int sum = 0;\n vector<int> lsum(n + 1, 0), rsum(n + 1, 0);\n rep(i, n) {\n lsum[i + 1] = lsum[i] + w[i];\n }\n for(int i = n - 1; i >= 0; -- i) {\n rsum[i] = rsum[i + 1] + w[i];\n }\n for(int i = 1; i < n; ++ i) {\n sum += w[i - 1];\n left[i] = left[i - 1] + sum * abs(x[i] - x[i - 1]);\n }\n sum = 0;\n for(int i = n - 2; i >= 0; -- i) {\n sum += w[i + 1];\n right[i] = right[i + 1] + sum * abs(x[i + 1] - x[i]);\n }\n static int dp[2020];\n rep(i, 2020) dp[i] = INF;\n dp[0] = 0;\n for(int i = 0; i < n; ++ i) {\n for(int j = i + 1; j <= n; ++ j) {\n int ok = i, ng = j;\n while(ng - ok > 1) {\n int mid = (ok + ng) / 2;\n if(lsum[mid] - lsum[i] < lsum[j] - lsum[mid]) ok = mid;\n else ng = mid;\n }\n int ss = left[ok] - left[i] - (x[ok] - x[i]) * lsum[i];\n ss += right[ok] - right[j - 1] - (x[j - 1] - x[ok]) * rsum[j];\n chmin(dp[j],dp[i] + ss + 1 + k + x[j - 1] - x[i]);\n }\n }\n cout << dp[n] << endl;\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//int t; cin >> t; rep(i, t)solve();\n\tsolve();\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3348,"score_of_the_acc":-0.2388,"final_rank":3},{"submission_id":"aoj_3178_4848018","code_snippet":"#include <stdio.h>\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define Inf 1000000000000000000\n\nstruct absolute_minima{\n\tusing ll = long long;\n\t\n\tpriority_queue<pair<ll,ll>> pQ;\n\tpriority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> sQ;\n\tll pSum=0,sSum=0,pCnt=0,sCnt=0;\n\t\n\tvoid add(long long x,long long w){\n\t\tsQ.emplace(x,w);\n\t\tsSum += x*w;\n\t\tsCnt += w;\n\t\twhile(true){\n\t\t\tif(pQ.size()>0&&sQ.size()>0){\n\t\t\t\tif(pQ.top().first>sQ.top().first){\n\t\t\t\t\tmove(pCnt > sCnt);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\telse if(pCnt > sCnt){\n\t\t\t\t\tmove(true);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\telse if(pCnt + sQ.top().second <= sCnt - sQ.top().second){\n\t\t\t\t\tmove(false);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(sQ.size()==0){\n\t\t\t\t\tmove(true);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tif(sQ.top().second <= sCnt - sQ.top().second){\n\t\t\t\t\t\tmove(false);\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\tvoid add(ll x){\n\t\tadd(x,1LL);\n\t}\n\t\n\tll median(){\n\t\treturn sQ.top().first;\n\t}\n\t\n\tvector<ll> medians(){\n\t\tvector<ll> ret;\n\t\tif((pCnt+sCnt)%2==0){\n\t\t\tif(pCnt==sCnt)ret.push_back(pQ.top().first);\n\t\t\telse ret.push_back(sQ.top().first);\n\t\t}\n\t\tret.push_back(median());\n\t\treturn ret;\n\t}\n\t\n\tll distance_sum(){\n\t\tll ret = 0LL;\n\t\tret -= pSum;\n\t\tret += sSum;\n\t\tret += pCnt * median();\n\t\tret -= sCnt * median();\n\t\treturn ret;\n\t}\n\t\n\tvoid move(bool f){\n\t\tif(f){\n\t\t\tif(pQ.size()>0){\n\t\t\t\tpair<ll,ll> p = pQ.top();\n\t\t\t\tpQ.pop();\n\t\t\t\tpSum -= p.first*p.second;\n\t\t\t\tpCnt -= p.second;\n\t\t\t\tsQ.push(p);\n\t\t\t\tsSum += p.first*p.second;\n\t\t\t\tsCnt += p.second;\n\t\t\t}\n\t\t}\n\t\telse{\n\t\t\tif(sQ.size()>0){\n\t\t\t\tpair<ll,ll> p = sQ.top();\n\t\t\t\tsQ.pop();\n\t\t\t\tsSum -= p.first*p.second;\n\t\t\t\tsCnt -= p.second;\n\t\t\t\tpQ.push(p);\n\t\t\t\tpSum += p.first*p.second;\n\t\t\t\tpCnt += p.second;\n\t\t\t}\n\t\t}\n\t}\n\t\n};\n\nint main(){\n\t\n\tint N;\n\tcin>>N;\n\tlong long K;\n\tcin>>K;\n\t\n\tvector<long long> X(N),W(N);\n\trep(i,N){\n\t\tcin>>X[i]>>W[i];\n\t}\n\t\n\tvector<long long> dp(N+1,Inf);\n\tdp[0] = 0LL;\n\t\n\trep(i,N){\n\t\tabsolute_minima A;\n\t\tfor(int j=i+1;j>=1;j--){\n\t\t\tA.add(X[j-1],W[j-1]);\n\t\t\tdp[i+1] = min(dp[i+1],1LL + A.distance_sum() + dp[j-1] + K + abs(X[i]-A.median()) + abs(X[j-1]-A.median()));\n\t\t}\n\t}\n\t\n\tcout<<dp.back()<<endl;\n\t\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":3544,"score_of_the_acc":-0.6695,"final_rank":14},{"submission_id":"aoj_3178_4847795","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\")\n#pragma GCC optimize(\"unroll-loops\")\n//#pragma warning(disable : 4996)\n\n#ifdef _MSC_VER\n#include <intrin.h>\n\n#define __builtin_popcount __popcnt\n#define __builtin_popcountll __popcnt64\n#endif\n\n#include <limits.h>\n#include <math.h>\n#include <time.h>\n\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <complex>\n#include <cstdio>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n//#include<atcoder/all>\n\nusing namespace std;\n\n//using namespace atcoder;\n\n#define REP(i, n) for (int i = 0; i < (n); ++i)\n#define REPR(i, n) for (int i = n - 1; i >= 0; --i)\n#define FOR(i, m, n) for (int i = m; i < n; ++i)\n#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)\n#define SORT(v, n) sort(v, v + n);\n#define VSORT(v) sort(v.begin(), v.end());\n#define REVERSE(v, n) reverse(v, v + n);\n#define VREVERSE(v) reverse(v.begin(), v.end())\n#define ll long long\n#define print(x) cout << (x) << endl\n#define pe(x) cout << (x) << \" \"\n#define DEBUG(x) cout << #x << \": \" << x << endl\n#define lb(v, n) lower_bound(v.begin(), v.end(), (n))\n#define ub(v, n) upper_bound(v.begin(), v.end(), (n))\n#define int long long\n//#define double long double\n#define all(x) (x).begin(), (x).end()\n#define print_space(v) REP(i, v.size()) cout << v[i] << \" \\n\"[i==(int)v.size()-1]\ntemplate <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }\ntemplate <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }\ntypedef pair<int, int> pii;\ntypedef pair<long long, long long> pll;\nstd::random_device rd;\nstd::mt19937 mt(rd());\nconstexpr ll MOD = 1e9 + 7;\nconstexpr int MAX = 500050;\nconst double pi = acos(-1);\nconstexpr double EPS = 1e-8;\nconstexpr ll LINF = 1e18 + 1;\nconstexpr int INF = 1e9 + 1;\nvoid Yes(bool cond) { cout << (cond ? \"Yes\" : \"No\") << '\\n'; }\nvoid YES(bool cond) { cout << (cond ? \"YES\" : \"NO\") << '\\n'; }\n\n\n\nint X[2020], W[2020];\nint ccl[2020], wcl[2020];//[0,i)\nint ccr[2020], wcr[2020];//[i,N)\nll dp[2020];\nint N, K;\nll f(int l, int r) {\n\tint sum = wcl[r+1] - wcl[l];\n\n\tint ok = r, ng = l-1;\n\twhile (abs(ok - ng) > 1) {\n\t\tint mid = (ok + ng) / 2;\n\t\tif (wcl[mid+1] - wcl[l] >= sum / 2)ok = mid;\n\t\telse ng = mid;\n\t}\n\t//DEBUG(l);\n\t//DEBUG(r);\n\t//DEBUG(sum);\n\t//DEBUG(ok);\n\t//DEBUG(ccl[ok]);\n\t//DEBUG(ccl[l]);\n\t//DEBUG(ccr[ok]);\n\t//DEBUG(ccr[r]);\n\tll lc = ccl[ok] - ccl[l] - (wcl[l] * (X[ok] - X[l]));\n\tll rc = ccr[ok] - ccr[r] - wcr[r+1] * (X[r] - X[ok]);\n\t//DEBUG(lc);\n\t//DEBUG(rc);\n\treturn lc+rc + X[r] - X[l] + K;\n}\nvoid solve() {\n\tcin >> N >> K;\n\tREP(i, N) {\n\t\tcin >> X[i] >> W[i];\n\t}\n\tX[N] = LINF;\n\tW[N] = LINF;\n\tREP(i, N) {\n\t\twcl[i + 1] =wcl[i] + W[i];\n\t\tccl[i + 1] =ccl[i]+wcl[i+1] * (X[i + 1] - X[i]);\n\t}\n\tREPR(i, N) {\n\t\twcr[i] = wcr[i + 1] + W[i];\n\t\tif (i < N - 1)ccr[i] = ccr[i + 1] + wcr[i + 1] * (X[i + 1] - X[i]);\n\t}\n\tREP(i, N + 1)dp[i] = LINF;\n\tdp[0] = 0;\n\tREP(i, N) {\n\t\tFOR(j, i, N + 1) {\n\t\t\tint res = f(i, j);\n\t\t\t//cerr << i << \" \" << j << \" \" << res<< endl;\n\t\t}\n\t}\n\tREP(i, N) {\n\t\tREP(j, i + 1) {\n\t\t\tchmin(dp[i + 1], dp[j] + f(j, i)+1);\n\t\t}\n\t}\n\tprint(dp[N]);\n}\n\n\n\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\t//int q;\n\t//cin >> q;\n\t//while (q--)\n\tsolve();\n\n}","accuracy":1,"time_ms":130,"memory_kb":3368,"score_of_the_acc":-0.5724,"final_rank":12}],"string":"[\n {\n \"submission_id\": \"aoj_3178_10356303\",\n \"code_snippet\": \"// AOJ #3178 Katsu Sando\\n// 2025.4.7\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst ll INF = 1LL << 60;\\n#define gc() getchar_unlocked()\\n\\nint Cin() {\\n\\tint n = 0; int c = gc();\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nint main(){\\n int n = Cin();\\n ll K = Cin();\\n\\n vector<ll> X(n+1), W(n+1);\\n for(int i = 1; i <= n; i++) X[i] = Cin(), W[i] = Cin();\\n\\n vector<ll> A(n+1,0);\\n for(int i = 1; i <= n; i++) A[i] = A[i-1] + W[i];\\n\\n vector<ll> P(n+1, 0);\\n for(int i = 1; i <= n-1; i++){\\n ll d = X[i+1] - X[i];\\n P[i] = P[i-1] + d * A[i];\\n }\\n P[n] = P[n-1];\\n\\n vector<vector<ll>> cost(n+1, vector<ll>(n+1, 0));\\n for(int l = 1; l <= n; l++){\\n cost[l][l] = 0;\\n int m_opt = l;\\n for(int r = l+1; r <= n; r++){\\n auto f = [&](int m) -> ll {\\n return (X[m] - X[l]) * (1 - A[l-1])\\n + (X[r] - X[m]) * (1 + A[r])\\n + 2 * P[m-1] - P[l-1] - P[r-1];\\n };\\n while(m_opt < r && f(m_opt+1) < f(m_opt)) m_opt++;\\n cost[l][r] = f(m_opt);\\n }\\n }\\n\\n vector<ll> dp(n+1, INF);\\n dp[0] = 0;\\n for(int i = 1; i <= n; i++){\\n for(int j = 0; j < i; j++){\\n ll phase = 1 + cost[j+1][i] + K;\\n dp[i] = min(dp[i], dp[j] + phase);\\n }\\n }\\n printf(\\\"%lld\\\\n\\\", dp[n]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 34996,\n \"score_of_the_acc\": -0.3793,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3178_10353484\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\\n#define Endl endl\\n#define all(a) a.begin(), a.end()\\n#define pr(i, j) make_pair(i, j)\\n#define isin(x, l, r) (l <= x && x < r)\\n#define chmin(a, b) a = min(a, b)\\n#define chmax(a, b) a = max(a, b)\\n#define srt(ar) sort(ar.begin(), ar.end())\\n#define rev(ar) reverse(ar.begin(), ar.end())\\n#define jge(f, s, t) cout << (f ? s : t) << endl\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#define printar(ar) \\\\\\n do \\\\\\n { \\\\\\n for (auto dbg : ar) \\\\\\n { \\\\\\n cout << dbg << \\\" \\\"; \\\\\\n } \\\\\\n cout << endl; \\\\\\n } while (0)\\nconst ll inf = 1e18;\\nconst ld pi = 3.14159265358979;\\nconst ld eps = 1e-9;\\ntemplate <class T, ll n, ll idx = 0>\\nauto make_vec(const ll (&d)[n], const T &init) noexcept\\n{\\n if constexpr (idx < n)\\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\\n else\\n return init;\\n}\\n\\ntemplate <class T, ll n>\\nauto make_vec(const ll (&d)[n]) noexcept\\n{\\n return make_vec(d, T{});\\n}\\n//////////////// 以下を貼る ////////////////\\ntemplate <class T>\\nsize_t HashCombine(const size_t seed, const T &v)\\n{\\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\\n}\\n/* pair用 */\\ntemplate <class T, class S>\\nstruct std::hash<std::pair<T, S>>\\n{\\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\\n {\\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\\n }\\n};\\n////////////////////////////////////////////\\nint main()\\n{\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n ll n, K;\\n cin >> n >> K;\\n vector<ll> x(n);\\n vector<ll> w(n);\\n rep(i, 0, n)\\n {\\n cin >> x[i] >> w[i];\\n }\\n vector<ll> dp(n + 1, inf);\\n dp[0] = 0;\\n vector<vector<ll>> dp2(n, vector<ll>(n, inf));\\n vector<vector<ll>> dp3(n, vector<ll>(n, inf));\\n rep(i, 0, n)\\n {\\n dp3[i][i] = 0;\\n ll spd = 1 + w[i];\\n ll t = 0;\\n rep(j, i + 1, n)\\n {\\n t += (x[j] - x[j - 1]) * spd;\\n dp3[i][j] = t;\\n spd += w[j];\\n }\\n spd = 1 + w[i];\\n t = 0;\\n drep(j, i, 0)\\n {\\n t += (x[j + 1] - x[j]) * spd;\\n dp3[i][j] = t;\\n spd += w[j];\\n }\\n }\\n rep(i, 0, n)\\n {\\n ll x = i;\\n rep(j, i, n)\\n {\\n while (true)\\n {\\n if (x == j)\\n {\\n break;\\n }\\n if (dp3[i][x] + dp3[j][x] < dp3[i][x + 1] + dp3[j][x + 1])\\n {\\n break;\\n }\\n x++;\\n }\\n dp2[i][j] = dp3[i][x] + dp3[j][x];\\n }\\n }\\n rep(i, 0, n)\\n {\\n rep(j, 0, i + 1)\\n {\\n chmin(dp[i + 1], dp[j] + 1 + dp2[j][i] + K);\\n }\\n }\\n cout << dp[n] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 66048,\n \"score_of_the_acc\": -0.7516,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3178_10199995\",\n \"code_snippet\": \"// AOJ #3178\\n// Katsu Sando 2025.2.6\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n \\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n \\n int N; \\n ll K;\\n cin >> N >> K;\\n vector<int> X(N), W(N);\\n for (int i = 0; i < N; i++){\\n cin >> X[i] >> W[i];\\n }\\n // 前計算：P[i] = W[0] + W[1] + ... + W[i]\\n vector<ll> P(N, 0);\\n P[0] = W[0];\\n for (int i = 1; i < N; i++){\\n P[i] = P[i-1] + W[i];\\n }\\n \\n vector<vector<ll>> Lcost(N, vector<ll>(N, 0));\\n for (int i = 0; i < N; i++){\\n Lcost[i][i] = 0;\\n for (int j = i+1; j < N; j++){\\n ll sumWeights = (i==0 ? P[j-1] : P[j-1] - P[i-1]);\\n Lcost[i][j] = Lcost[i][j-1] + (ll)(X[j] - X[j-1]) * (1 + sumWeights);\\n }\\n }\\n\\n vector<vector<ll>> Rcost(N, vector<ll>(N, 0));\\n for (int j = 0; j < N; j++){\\n Rcost[j][j] = 0;\\n for (int m = j-1; m >= 0; m--){\\n ll sumWeights = (m==0 ? P[j] : P[j] - P[m]);\\n Rcost[j][m] = Rcost[j][m+1] + (ll)(X[m+1]-X[m]) * (1 + sumWeights);\\n }\\n }\\n \\n const ll INF = 1LL << 60;\\n vector<ll> dp(N, INF);\\n\\n auto bestForSegment = [&](int i, int j) -> ll {\\n int lo = i, hi = j;\\n while(hi - lo >= 3){\\n int m1 = lo + (hi - lo) / 3;\\n int m2 = hi - (hi - lo) / 3;\\n ll f1 = Lcost[i][m1] + Rcost[j][m1];\\n ll f2 = Lcost[i][m2] + Rcost[j][m2];\\n if(f1 > f2)\\n lo = m1;\\n else\\n hi = m2;\\n }\\n ll best = INF;\\n for (int m = lo; m <= hi; m++){\\n best = min(best, Lcost[i][m] + Rcost[j][m]);\\n }\\n return best;\\n };\\n\\n for (int j = 0; j < N; j++){\\n for (int i = 0; i <= j; i++){\\n ll segTime = 1 + K + bestForSegment(i, j);\\n ll prev = (i-1 >= 0 ? dp[i-1] : 0);\\n dp[j] = min(dp[j], prev + segTime);\\n }\\n }\\n cout << dp[N-1] << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.9166666666666666,\n \"time_ms\": 220,\n \"memory_kb\": 65908,\n \"score_of_the_acc\": -1.6549,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3178_5813478\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n//#include <atcoder/all>\\n//using namespace atcoder;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 2005\\n\\nll N,K;\\nll X[SIZE],W[SIZE],dp[SIZE];\\nll SUM[SIZE],rui_W[SIZE];\\nll COST[SIZE][SIZE];\\n\\nll to_R(int left,int right){\\n\\n\\treturn SUM[right]-SUM[left]-rui_W[left]*(X[right]-X[left]);\\n}\\n\\nll to_L(int left,int right){\\n\\n\\treturn (rui_W[right+1]-rui_W[left])*(X[right]-X[left])-to_R(left,right);\\n}\\n\\nll func(int left,int right,int k){\\n\\n\\treturn to_R(left,k) + to_L(k,right);\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%lld %lld\\\",&N,&K);\\n\\n\\tfor(ll i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lld %lld\\\",&X[i],&W[i]);\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\trui_W[i+1] = rui_W[i]+W[i];\\n\\t\\tSUM[i+1] = SUM[i] + rui_W[i+1]*(X[i+1]-X[i]);\\n\\t}\\n\\n\\tfor(int left = 0; left < N; left++){\\n\\t\\tint k = left;\\n\\t\\tfor(int right = left; right < N; right++){\\n\\t\\t\\twhile(k < right && func(left,right,k) > func(left,right,k+1)){\\n\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t}\\n\\t\\t\\tCOST[left][right] = func(left,right,k) + (X[right]-X[left]) + K+1;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i <= N; i++){\\n\\n\\t\\tdp[i] = HUGE_NUM;\\n\\t}\\n\\n\\tdp[0] = 0;\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tfor(int j = 0; j < i; j++){\\n\\n\\t\\t\\tdp[i] = min(dp[i],dp[j]+COST[j][i-1]);\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",dp[N]);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 25904,\n \"score_of_the_acc\": -0.3318,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3178_4906139\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n ll n,k;cin>>n>>k;\\n vector<ll>x(n),w(n);\\n rep(i,0,n)cin>>x[i]>>w[i];\\n auto dp=vec(n+1,n+1,INF);\\n dp[0][0]=0;\\n vector<ll>y(n+1);\\n rep(i,0,n)y[i+1]=y[i]+x[i];\\n rep(i,0,n){\\n ll mi=INF;\\n rep(j,0,n+1){\\n if(j<n)chmin(mi,dp[i][j]-x[j]);\\n chmin(dp[i+1][j],dp[i][j]);\\n if(j>0)chmin(dp[i+1][j],mi+k+x[j-1]+1);\\n if(j<n)mi+=abs(x[j]-x[i])*w[j];\\n }\\n }\\n //debug(dp,n+1,n+1);\\n cout<<dp[n][n]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 34320,\n \"score_of_the_acc\": -0.3246,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3178_4875832\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=Int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\n//INSERT ABOVE HERE\\nconst Int MAX = 2020;\\nInt dpL[MAX][MAX]={};\\nInt dpR[MAX][MAX]={};\\nInt cst[MAX][MAX]={};\\n\\nInt dp[MAX]={};\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n Int n,k;\\n cin>>n>>k;\\n vector<Int> xs(n),ws(n);\\n for(Int i=0;i<n;i++) cin>>xs[i]>>ws[i];\\n\\n // dpL: [i, j]\\n for(Int i=0;i<n;i++){\\n Int res=0,wei=1;\\n dpL[i][i]=res;\\n wei+=ws[i];\\n for(Int j=i+1;j<n;j++){\\n res+=wei*abs(xs[j]-xs[j-1]);\\n dpL[i][j]=res;\\n wei+=ws[j];\\n }\\n }\\n\\n // dpR: [i, j]\\n for(Int j=n-1;j>=0;j--){\\n Int res=0,wei=1;\\n dpL[j][j]=res;\\n wei+=ws[j];\\n for(Int i=j-1;i>=0;i--){\\n res+=wei*abs(xs[i]-xs[i+1]);\\n dpR[i][j]=res;\\n wei+=ws[i];\\n }\\n }\\n\\n for(Int i=0;i<n;i++){\\n for(Int j=i;j<n;j++){\\n if(i==j){\\n cst[i][j]=0;\\n continue;\\n }\\n auto calc=[&](Int m){return dpL[i][m]+dpR[m][j];};\\n Int l=i,r=j;\\n while(l+1<r){\\n Int m=(l+r)>>1;\\n if(calc(m)<calc(m+1)) r=m;\\n else l=m;\\n }\\n cst[i][j]=min(calc(l),calc(r));\\n }\\n }\\n\\n const Int INF = 1e18;\\n fill(dp,dp+MAX,INF);\\n dp[0]=0;\\n for(Int i=0;i<n;i++)\\n for(Int j=i;j<n;j++)\\n chmin(dp[j+1],dp[i]+(1+cst[i][j]+k));\\n cout<<dp[n]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 97988,\n \"score_of_the_acc\": -1.1808,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3178_4864963\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <chrono>\\n//#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\\n#define Rrep(i,n) Rreps(i,n,0)\\n#define ALL(a) a.begin(), a.end()\\n#define fi first\\n#define se second\\n\\nusing ll = long long;\\nusing vec = vector<ll>;\\nusing mat = vector<vec>;\\n\\nll N,M,H,W,Q,K,A,B;\\nstring S;\\ntypedef pair<ll, ll> P;\\nconst ll INF = (1LL<<60);\\n\\ntemplate<class T> bool chmin(T &a, const T &b){\\n if(a > b) {a = b; return true;}\\n else return false;\\n}\\n\\nvoid fill_memo(vec &x, vec &w, mat &memo){\\n vec ws(N + 1), muls(N), muls_rev(N);\\n ws[0] = muls[0] = muls_rev[N-1] = 0;\\n rep(i, N) {\\n ws[i+1] = ws[i] + w[i];\\n if(i != N - 1) muls[i+1] = muls[i] + ws[i + 1] * (x[i+1] - x[i]);\\n }\\n Rrep(i, N - 1) muls_rev[i] = muls_rev[i+1] + (ws[N] - ws[i + 1]) * (x[i+1] - x[i]);\\n rep(l, N){\\n reps(r, l + 1, N + 1){\\n int id = lower_bound(ALL(ws), (ws[l] + ws[r] + 1) / 2) - (ws.begin() + 1);\\n //[l,id] : left, [id, r) : right\\n memo[l][r] = K + 1 + (x[r-1] - x[l]) + (muls[id] - muls[l] - ws[l] * (x[id] - x[l])) + (muls_rev[id] - muls_rev[r-1] - (ws[N] - ws[r]) * (x[r-1] - x[id]));\\n }\\n }\\n}\\n\\nint main() {\\n cin>>N>>K;\\n mat memo(N, vec(N + 1));\\n vec x(N), w(N);\\n rep(i, N) cin>>x[i]>>w[i];\\n fill_memo(x, w, memo);\\n vec dp(N + 1, INF);\\n dp[0] = 0;\\n reps(i, 1, N + 1){\\n rep(j, i) chmin(dp[i], dp[j] + memo[j][i]);\\n }\\n cout<<dp[N]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 34452,\n \"score_of_the_acc\": -0.6117,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3178_4864960\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <chrono>\\n//#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\\n#define Rrep(i,n) Rreps(i,n,0)\\n#define ALL(a) a.begin(), a.end()\\n#define fi first\\n#define se second\\n\\nusing ll = long long;\\nusing vec = vector<ll>;\\nusing mat = vector<vec>;\\n\\nll N,M,H,W,Q,K,A,B;\\nstring S;\\ntypedef pair<ll, ll> P;\\nconst ll INF = (1LL<<60);\\n\\ntemplate<class T> bool chmin(T &a, const T &b){\\n if(a > b) {a = b; return true;}\\n else return false;\\n}\\ntemplate<class T> bool chmax(T &a, const T &b){\\n if(a < b) {a = b; return true;}\\n else return false;\\n}\\n\\nvoid fill_memo(vec &x, vec &w, mat &memo){\\n vec ws(N), muls(N), muls_rev(N);\\n ws[0] = w[0];\\n muls[0] = muls_rev[N-1] = 0;\\n rep(i, N - 1) {\\n ws[i+1] = ws[i] + w[i + 1];\\n muls[i+1] = muls[i] + ws[i] * (x[i+1] - x[i]);\\n }\\n Rrep(i, N - 1) muls_rev[i] = muls_rev[i+1] + (ws[N-1] - ws[i]) * (x[i+1] - x[i]);\\n rep(l, N){\\n reps(r, l + 1, N + 1){\\n int id = lower_bound(ALL(ws), ((l == 0 ? 0LL : ws[l-1]) + ws[r-1] + 1) / 2) - ws.begin();\\n //[l,id] : left, [id, r) : right\\n memo[l][r] = K + 1 + (x[r-1] - x[l]) + (muls[id] - muls[l] - (l==0 ? 0 : ws[l-1]) * (x[id] - x[l])) + (muls_rev[id] - muls_rev[r-1] - (ws[N-1] - ws[r-1]) * (x[r-1] - x[id]));\\n //cout<<l<<' '<<r<<' '<<id<<' '<<memo[l][r]<<endl;\\n }\\n }\\n}\\n\\nint main() {\\n cin>>N>>K;\\n mat memo(N, vec(N + 1));\\n vec x(N), w(N);\\n rep(i, N) cin>>x[i]>>w[i];\\n fill_memo(x, w, memo);\\n vec dp(N + 1, INF);\\n dp[0] = 0;\\n reps(i, 1, N + 1){\\n rep(j, i) chmin(dp[i], dp[j] + memo[j][i]);\\n }\\n cout<<dp[N]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 34452,\n \"score_of_the_acc\": -0.5641,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3178_4855066\",\n \"code_snippet\": \"#pragma region Macros\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define ll long long\\n#define ld long double\\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vll vector<ll>\\n#define vpi vector<pii>\\n#define vpll vector<pll>\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n#define fi first\\n#define se second\\n#define all(c) begin(c), end(c)\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\nusing namespace std;\\nstring YES[2] = {\\\"NO\\\", \\\"YES\\\"};\\nstring Yes[2] = {\\\"No\\\", \\\"Yes\\\"};\\nstring yes[2] = {\\\"no\\\", \\\"yes\\\"};\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\n#define si(c) (int)(c).size()\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\\n scan(head);\\n IN(tail...);\\n}\\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\nvi iota(int n) {\\n vi a(n);\\n iota(all(a), 0);\\n return a;\\n}\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n sort(all(y));\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\nint popcount(ll x) { return __builtin_popcountll(x); }\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(15);\\n }\\n} setup_io;\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return move(res);\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n cin >> a >> b >> c;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return move(res);\\n}\\n\\n#define i128 __int128_t\\n#define ull unsigned long long int\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n for(auto &e : v) cout << e << \\\" \\\";\\n cout << endl;\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n cout << \\\"(\\\" << p.fi << \\\", \\\" << p.se << \\\")\\\";\\n return os;\\n}\\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \\\"(\\\" + to_string(p.first) + \\\",\\\" + to_string(p.second) + \\\")\\\"; }\\ntemplate <class A> string to_string(A v) {\\n if(v.empty()) return \\\"{}\\\";\\n string ret = \\\"{\\\";\\n for(auto &x : v) ret += to_string(x) + \\\",\\\";\\n ret.back() = '}';\\n return ret;\\n}\\n\\nvoid dump() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\\n cerr << to_string(head) << \\\" \\\";\\n dump(tail...);\\n}\\n#define endl '\\\\n'\\n#ifdef _LOCAL\\n#undef endl\\n#define debug(x) \\\\\\n cout << #x << \\\": \\\"; \\\\\\n dump(x)\\n#else\\n#define debug(x)\\n#endif\\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\\n\\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\n#pragma endregion\\n\\nint main() {\\n INT(n);\\n LL(k);\\n vll x(n), w(n);\\n rep(i, n) cin >> x[i] >> w[i];\\n vll dp(n + 1, LLONG_MAX);\\n dp[0] = 0;\\n vll rui(n + 1), W(n + 1);\\n rep(i, n) rui[i + 1] = rui[i] + x[i] * w[i];\\n rep(i, n) W[i + 1] = w[i] + W[i];\\n auto sum = [&](int l, int r) { return rui[r] - rui[l]; };\\n auto wsum = [&](int l, int r) { return W[r] - W[l]; };\\n rep(i, n) {\\n int t = i;\\n rep2(j, i + 1, n) {\\n while(t < n and wsum(i, t + 1) < wsum(t + 1, j)) t++;\\n ll cost = LLONG_MAX;\\n chmin(cost, (x[j - 1] - x[i]) + (wsum(i, t + 1) * x[t] - sum(i, t + 1)) + (sum(t + 1, j) - wsum(t + 1, j) * x[t]) + k);\\n chmin(dp[j], dp[i] + cost + 1);\\n }\\n }\\n cout << dp[n] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3540,\n \"score_of_the_acc\": -0.0028,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3178_4849435\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n\\ntemplate <class T>\\nstd::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }\\n\\nusing lint = long long;\\nconstexpr lint INF = 1LL << 60;\\n\\nvoid solve() {\\n int n, k;\\n std::cin >> n >> k;\\n\\n std::vector<lint> xs(n + 1), ws(n + 1);\\n for (int i = 1; i <= n; ++i) std::cin >> xs[i] >> ws[i];\\n\\n // [i, j]を左から右へ移動するときのコスト\\n auto lcost = vec(n + 1, vec(n + 1, 0LL));\\n for (int l = 1; l <= n; ++l) {\\n lint sum = ws[l] + 1;\\n for (int r = l + 1; r <= n; ++r) {\\n lcost[l][r] = lcost[l][r - 1] + sum * (xs[r] - xs[r - 1]);\\n sum += ws[r];\\n }\\n }\\n\\n // [i, j]を右から左へ移動するときのコスト\\n auto rcost = vec(n + 1, vec(n + 1, 0LL));\\n for (int r = 1; r <= n; ++r) {\\n lint sum = ws[r] + 1;\\n for (int l = r - 1; l >= 1; --l) {\\n rcost[l][r] = rcost[l + 1][r] + sum * (xs[l + 1] - xs[l]);\\n sum += ws[l];\\n }\\n }\\n\\n std::vector<lint> bdp(n + 1, INF), rdp(n + 1, INF);\\n // 文章中で定義したDPテーブル2つ\\n bdp[0] = 0;\\n\\n for (int i = 1; i <= n; ++i) {\\n for (int l = 0; l < i; ++l) {\\n rdp[i] = std::min(rdp[i], bdp[l] + 1 + lcost[l + 1][i]);\\n }\\n\\n for (int l = 1; l <= i; ++l) {\\n bdp[i] = std::min(bdp[i], rdp[l] + rcost[l][i] + k);\\n }\\n }\\n\\n std::cout << bdp[n] << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 66016,\n \"score_of_the_acc\": -0.7989,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3178_4849244\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n\\ntemplate <class T>\\nstd::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }\\n\\nusing lint = long long;\\nconstexpr lint INF = 1LL << 60;\\n\\nvoid solve() {\\n int n, k;\\n std::cin >> n >> k;\\n\\n std::vector<lint> xs(n + 1), ws(n + 1);\\n for (int i = 1; i <= n; ++i) std::cin >> xs[i] >> ws[i];\\n\\n auto lcost = vec(n + 1, vec(n + 1, 0LL));\\n for (int l = 1; l <= n; ++l) {\\n lint sum = ws[l] + 1;\\n for (int r = l + 1; r <= n; ++r) {\\n lcost[l][r] = lcost[l][r - 1] + sum * (xs[r] - xs[r - 1]);\\n sum += ws[r];\\n }\\n }\\n\\n auto rcost = vec(n + 1, vec(n + 1, 0LL));\\n for (int r = 1; r <= n; ++r) {\\n lint sum = ws[r] + 1;\\n for (int l = r - 1; l >= 1; --l) {\\n rcost[l][r] = rcost[l + 1][r] + sum * (xs[l + 1] - xs[l]);\\n sum += ws[l];\\n }\\n }\\n\\n std::vector<lint> dp0(n + 1, INF), dp1(n + 1, INF);\\n dp0[0] = 0;\\n\\n for (int i = 1; i <= n; ++i) {\\n for (int l = 0; l < i; ++l) {\\n dp1[i] = std::min(dp1[i], dp0[l] + 1 + lcost[l + 1][i]);\\n }\\n\\n for (int l = 1; l <= i; ++l) {\\n dp0[i] = std::min(dp0[i], dp1[l] + rcost[l][i] + k);\\n }\\n }\\n\\n std::cout << dp0[n] << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 66016,\n \"score_of_the_acc\": -0.7989,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3178_4849140\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using vvec = vec<vec<T>>;\\n\\nconst ll inf = 1e18;\\n\\nint main() {\\n int N,K;\\n cin >> N >> K;\\n vec<ll> X(N),W(N),WS(N+1),S(N+1);\\n for(int i=0;i<N;i++){\\n cin >> X[i] >> W[i];\\n S[i+1] = S[i]+W[i]*X[i];\\n WS[i+1] = WS[i]+W[i];\\n }\\n vvec<ll> cost(N+1,vec<ll>(N+1));\\n \\n auto val = [&](int l,int r,int id){\\n assert(l<=id && id<r);\\n ll res = (WS[id+1]-WS[l]+1)*X[id]-(S[id+1]-S[l]+X[l]);\\n res += S[r]-S[id]+X[r-1]-(WS[r]-WS[id]+1)*X[id];\\n return res;\\n };\\n\\n for(int l=0;l<N;l++){\\n int k = l;\\n for(int r=l+1;r<=N;r++){\\n while(k+1<r && val(l,r,k)>=val(l,r,k+1)) k++;\\n cost[l][r] = val(l,r,k);\\n }\\n }\\n\\n vec<ll> dp(N+1,inf);\\n dp[0] = 0;\\n for(int i=0;i<N;i++){\\n for(int j=0;j<=i;j++) dp[i+1] = min(dp[i+1],dp[j]+cost[j][i+1]+K+1);\\n }\\n cout << dp[N] << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 34856,\n \"score_of_the_acc\": -0.4254,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3178_4849080\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 1020000;\\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nll cost[2020][2020];\\n\\nint main(){\\n\\tll n,k; cin >> n >> k;\\n\\tvl x(n), w(n);\\n\\trep(i,n) cin >> x[i] >> w[i];\\n\\tfor(int i=0; i<n; i++){\\n\\t\\tll S = w[i] + 1;\\n\\t\\tfor(int j=i+1; j<n; j++){\\n\\t\\t\\tcost[i][j] = cost[i][j-1] + S * (x[j] - x[j-1]);\\n\\t\\t\\tS += w[j];\\n\\t\\t}\\n\\t\\tS = w[i] + 1;\\n\\t\\tfor(int j=i-1; j>=0; j--){\\n\\t\\t\\tcost[i][j] = cost[i][j+1] + S * (x[j+1] - x[j]);\\n\\t\\t\\tS += w[j];\\n\\t\\t}\\n\\t}\\n\\tvl dp(n+1,linf);\\n\\tdp[0] = 0;\\n\\trep(i,n){\\n\\t\\tll mn = dp[i];\\n\\t\\tint m = i;\\n\\t\\tfor(int j=i-1; j>=0; j--){\\n\\t\\t\\twhile(m > j && cost[j][m] + cost[i][m] > cost[j][m-1] + cost[i][m-1]) m--;\\n\\t\\t\\tchmin(mn, dp[j] + cost[j][m] + cost[i][m]);\\n\\t\\t}\\n\\t\\tchmin(dp[i+1], mn + k + 1);\\n\\t}\\n\\tcout << dp[n] << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 34732,\n \"score_of_the_acc\": -0.4242,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3178_4848980\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define inf (long long)(1e17)\\nusing namespace std;\\n\\nlong long n, k;\\nvector<long long> x, w, dp;\\nvector<vector<long long>> cost;\\n\\nlong long solve();\\n\\nint main() {\\n cin >> n >> k;\\n x.resize(n);\\n w.resize(n);\\n for (int i = 0; i < n; ++i) cin >> x[i] >> w[i];\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nlong long solve() {\\n { // calc cost from i to j\\n cost.assign(n, vector<long long>(n, inf));\\n for (int i = 0; i < n; ++i) {\\n long long now = 0;\\n // i >= j(left)\\n for (int j = i; j < n; ++j) {\\n now += w[j] * (x[j] - x[i]);\\n cost[j][i] = now + x[j] - x[i];\\n }\\n // i <= j(right)\\n now = 0;\\n for (int j = i; j >= 0; --j) {\\n now += w[j] * (x[i] - x[j]);\\n cost[j][i] = now + x[i] - x[j];\\n }\\n }\\n }\\n dp.assign(n + 1, inf);\\n dp[0] = 0;\\n for (int i = 0; i < n; ++i) {\\n long long now = inf;\\n for (int j = 0; j <= i; ++j) now = min(now, dp[j] + cost[j][i]);\\n for (int j = i; j < n; ++j)\\n dp[j + 1] = min(dp[j + 1], now + cost[j][i] + k + 1);\\n }\\n return dp[n];\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 34804,\n \"score_of_the_acc\": -0.4249,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3178_4848979\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <stack>\\n#include <numeric>\\n#include <bitset>\\n#include <cmath>\\n#include <cassert>\\n\\nstatic const int MOD = 1000000007;\\nusing ll = long long;\\nusing u32 = unsigned;\\nusing u64 = unsigned long long;\\nusing namespace std;\\n\\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\\n\\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\\n\\nint main() {\\n int n, k;\\n cin >> n >> k;\\n vector<int> X(n), W(n);\\n for (int i = 0; i < n; ++i) {\\n scanf(\\\"%d %d\\\", &X[i], &W[i]);\\n }\\n vector<ll> dp(n+1, INF<ll>);\\n dp[0] = 0;\\n vector<ll> sumW(n+1);\\n for (int i = 0; i < n; ++i) sumW[i+1] = sumW[i]+ W[i];\\n for (int i = 0; i < n; ++i) {\\n int cur = i; ll val = k+1, d = 2*W[i];\\n for (int j = i; j < n; ++j) {\\n d -= W[j];\\n val += (ll)(X[j] - X[cur])*W[j];\\n if(j != i) val += (X[j]-X[j-1]);\\n while(d < 0) {\\n val += d*(X[cur+1]-X[cur]);\\n d += W[++cur]*2;\\n }\\n chmin(dp[j+1], dp[i]+val);\\n }\\n }\\n cout << dp.back() << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3276,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3178_4848744\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\nll dp[2020][2020][3];\\n\\nint main(){\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\tint n; cin >> n;\\n\\tll K; cin >> K;\\n\\tvector<ll> x(n),w(n);\\n\\tvector<ll> s(n+1,0);\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tcin >> x[i] >> w[i];\\n\\t\\ts[i+1]=s[i]+w[i];\\n\\t}\\n\\tfor(int i=0;i<2020;i++){\\n\\t\\tfor(int j=0;j<2020;j++){\\n\\t\\t\\tfor(int k=0;k<3;k++){\\n\\t\\t\\t\\tdp[i][j][k]=1e18;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tdp[0][0][0]=1;\\n\\tdp[0][0][1]=1;\\n\\tdp[0][0][2]=K+1;\\n\\tfor(int i=1;i<n;i++){\\n\\t\\tfor(int j=0;j<i;j++){\\n\\t\\t\\tfor(int k=0;k<3;k++){\\n\\t\\t\\t\\tif(k==0){\\n\\t\\t\\t\\t\\tdp[i][j][0]=min(dp[i][j][0],dp[i-1][j][0]+(x[i]-x[i-1])*(s[i]-s[j]));\\n\\t\\t\\t\\t\\tdp[i][i][1]=min(dp[i][i][1],dp[i-1][j][0]+(x[i]-x[i-1])*(s[i]-s[j])+(x[i]-x[j]));\\n\\t\\t\\t\\t\\tdp[i][i][2]=min(dp[i][i][2],dp[i-1][j][0]+(x[i]-x[i-1])*(s[i]-s[j])+K+(x[i]-x[j]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(k==1){\\n\\t\\t\\t\\t\\tdp[i][j][1]=min(dp[i][j][1],dp[i-1][j][1]+(w[i])*(x[i]-x[j]));\\n\\t\\t\\t\\t\\tdp[i][i][2]=min(dp[i][i][2],dp[i-1][j][1]+(w[i])*(x[i]-x[j])+K+(x[i]-x[j]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tif(i-1==j){\\n\\t\\t\\t\\t\\t\\tdp[i][i][0]=min(dp[i][i][0],dp[i-1][j][k]+1);\\n\\t\\t\\t\\t\\t\\tdp[i][i][1]=min(dp[i][i][1],dp[i-1][j][k]+1);\\n\\t\\t\\t\\t\\t\\tdp[i][i][2]=min(dp[i][i][2],dp[i-1][j][k]+K+1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << dp[n-1][n-1][2] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 98912,\n \"score_of_the_acc\": -1.0952,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3178_4848331\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\\n#define rep(i, n) For((i), 0, (n))\\n#define rrep(i, n) rFor((i), (n), 0)\\n#define fi first\\n#define se second\\nusing namespace std;\\ntypedef long long lint;\\ntypedef unsigned long long ulint;\\ntypedef pair<int, int> pii;\\ntypedef pair<lint, lint> pll;\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nT div_floor(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a >= 0 ? a / b : (a + 1) / b - 1;\\n}\\ntemplate <class T>\\nT div_ceil(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a > 0 ? (a - 1) / b + 1 : a / b;\\n}\\n\\nconstexpr lint mod = 1000000007;\\nconstexpr lint INF = mod * mod;\\nconstexpr int MAX = 100010;\\n\\nint n;\\nlint K;\\nint x[2020];\\nlint w[2020];\\nlint cost[2020][2020], dp[2020];\\n\\nint main() {\\n scanf(\\\"%d%lld\\\", &n, &K);\\n rep(i, n) scanf(\\\"%d%lld\\\", &x[i], &w[i]);\\n\\n rep(l, n) {\\n lint lsum, rsum, tmp_cost;\\n lsum = rsum = tmp_cost = 0;\\n int pos = l;\\n For(r, l, n) {\\n if (pos == r)\\n lsum += w[r];\\n else\\n rsum += w[r];\\n tmp_cost += w[r] * (x[r] - x[pos]);\\n while (pos + 1 <= r && (lsum - rsum) * (x[pos + 1] - x[pos]) < 0) {\\n tmp_cost += (lsum - rsum) * (x[pos + 1] - x[pos]);\\n rsum -= w[pos + 1];\\n lsum += w[pos + 1];\\n ++pos;\\n }\\n cost[l][r] = tmp_cost + x[r] - x[l];\\n }\\n }\\n\\n rep(i, n) {\\n dp[i] = cost[0][i] + 1 + K;\\n rep(j, i) chmin(dp[i], dp[j] + cost[j + 1][i] + 1 + K);\\n }\\n printf(\\\"%lld\\\\n\\\", dp[n - 1]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 34528,\n \"score_of_the_acc\": -0.3268,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3178_4848301\",\n \"code_snippet\": \"/**\\n * author: otera \\n**/\\n#include<iostream>\\n#include<string> \\n#include<cstdio>\\n#include<cstring>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm> \\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<deque>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\n#define int long long\\ntypedef long long ll;\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\ntypedef long double ld;\\nconst int inf=1e9+7;\\nconst ll INF=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-8;\\nconst ld pi = acos(-1.0);\\ntypedef pair<int, int> P;\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define pb push_back\\n#define debug(x) cerr << #x << \\\" = \\\" << (x) << endl;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nvoid solve() {\\n\\tint n, k; cin >> n >> k;\\n vector<int> x(n), w(n);\\n rep(i, n) {\\n cin >> x[i] >> w[i];\\n }\\n vector<int> left(n, 0), right(n + 1, 0);\\n int sum = 0;\\n vector<int> lsum(n + 1, 0), rsum(n + 1, 0);\\n rep(i, n) {\\n lsum[i + 1] = lsum[i] + w[i];\\n }\\n for(int i = n - 1; i >= 0; -- i) {\\n rsum[i] = rsum[i + 1] + w[i];\\n }\\n for(int i = 1; i < n; ++ i) {\\n sum += w[i - 1];\\n left[i] = left[i - 1] + sum * abs(x[i] - x[i - 1]);\\n }\\n sum = 0;\\n for(int i = n - 2; i >= 0; -- i) {\\n sum += w[i + 1];\\n right[i] = right[i + 1] + sum * abs(x[i + 1] - x[i]);\\n }\\n static int dp[2020];\\n rep(i, 2020) dp[i] = INF;\\n dp[0] = 0;\\n for(int i = 0; i < n; ++ i) {\\n for(int j = i + 1; j <= n; ++ j) {\\n int ok = i, ng = j;\\n while(ng - ok > 1) {\\n int mid = (ok + ng) / 2;\\n if(lsum[mid] - lsum[i] < lsum[j] - lsum[mid]) ok = mid;\\n else ng = mid;\\n }\\n int ss = left[ok] - left[i] - (x[ok] - x[i]) * lsum[i];\\n ss += right[ok] - right[j - 1] - (x[j - 1] - x[ok]) * rsum[j];\\n chmin(dp[j],dp[i] + ss + 1 + k + x[j - 1] - x[i]);\\n }\\n }\\n cout << dp[n] << endl;\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//int t; cin >> t; rep(i, t)solve();\\n\\tsolve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3348,\n \"score_of_the_acc\": -0.2388,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3178_4848018\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\n#define Inf 1000000000000000000\\n\\nstruct absolute_minima{\\n\\tusing ll = long long;\\n\\t\\n\\tpriority_queue<pair<ll,ll>> pQ;\\n\\tpriority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> sQ;\\n\\tll pSum=0,sSum=0,pCnt=0,sCnt=0;\\n\\t\\n\\tvoid add(long long x,long long w){\\n\\t\\tsQ.emplace(x,w);\\n\\t\\tsSum += x*w;\\n\\t\\tsCnt += w;\\n\\t\\twhile(true){\\n\\t\\t\\tif(pQ.size()>0&&sQ.size()>0){\\n\\t\\t\\t\\tif(pQ.top().first>sQ.top().first){\\n\\t\\t\\t\\t\\tmove(pCnt > sCnt);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(pCnt > sCnt){\\n\\t\\t\\t\\t\\tmove(true);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(pCnt + sQ.top().second <= sCnt - sQ.top().second){\\n\\t\\t\\t\\t\\tmove(false);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tif(sQ.size()==0){\\n\\t\\t\\t\\t\\tmove(true);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tif(sQ.top().second <= sCnt - sQ.top().second){\\n\\t\\t\\t\\t\\t\\tmove(false);\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tvoid add(ll x){\\n\\t\\tadd(x,1LL);\\n\\t}\\n\\t\\n\\tll median(){\\n\\t\\treturn sQ.top().first;\\n\\t}\\n\\t\\n\\tvector<ll> medians(){\\n\\t\\tvector<ll> ret;\\n\\t\\tif((pCnt+sCnt)%2==0){\\n\\t\\t\\tif(pCnt==sCnt)ret.push_back(pQ.top().first);\\n\\t\\t\\telse ret.push_back(sQ.top().first);\\n\\t\\t}\\n\\t\\tret.push_back(median());\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tll distance_sum(){\\n\\t\\tll ret = 0LL;\\n\\t\\tret -= pSum;\\n\\t\\tret += sSum;\\n\\t\\tret += pCnt * median();\\n\\t\\tret -= sCnt * median();\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tvoid move(bool f){\\n\\t\\tif(f){\\n\\t\\t\\tif(pQ.size()>0){\\n\\t\\t\\t\\tpair<ll,ll> p = pQ.top();\\n\\t\\t\\t\\tpQ.pop();\\n\\t\\t\\t\\tpSum -= p.first*p.second;\\n\\t\\t\\t\\tpCnt -= p.second;\\n\\t\\t\\t\\tsQ.push(p);\\n\\t\\t\\t\\tsSum += p.first*p.second;\\n\\t\\t\\t\\tsCnt += p.second;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tif(sQ.size()>0){\\n\\t\\t\\t\\tpair<ll,ll> p = sQ.top();\\n\\t\\t\\t\\tsQ.pop();\\n\\t\\t\\t\\tsSum -= p.first*p.second;\\n\\t\\t\\t\\tsCnt -= p.second;\\n\\t\\t\\t\\tpQ.push(p);\\n\\t\\t\\t\\tpSum += p.first*p.second;\\n\\t\\t\\t\\tpCnt += p.second;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n};\\n\\nint main(){\\n\\t\\n\\tint N;\\n\\tcin>>N;\\n\\tlong long K;\\n\\tcin>>K;\\n\\t\\n\\tvector<long long> X(N),W(N);\\n\\trep(i,N){\\n\\t\\tcin>>X[i]>>W[i];\\n\\t}\\n\\t\\n\\tvector<long long> dp(N+1,Inf);\\n\\tdp[0] = 0LL;\\n\\t\\n\\trep(i,N){\\n\\t\\tabsolute_minima A;\\n\\t\\tfor(int j=i+1;j>=1;j--){\\n\\t\\t\\tA.add(X[j-1],W[j-1]);\\n\\t\\t\\tdp[i+1] = min(dp[i+1],1LL + A.distance_sum() + dp[j-1] + K + abs(X[i]-A.median()) + abs(X[j-1]-A.median()));\\n\\t\\t}\\n\\t}\\n\\t\\n\\tcout<<dp.back()<<endl;\\n\\t\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3544,\n \"score_of_the_acc\": -0.6695,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3178_4847795\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#pragma warning(disable : 4996)\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n\\n#define __builtin_popcount __popcnt\\n#define __builtin_popcountll __popcnt64\\n#endif\\n\\n#include <limits.h>\\n#include <math.h>\\n#include <time.h>\\n\\n#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <complex>\\n#include <cstdio>\\n#include <cstring>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <vector>\\n\\n//#include<atcoder/all>\\n\\nusing namespace std;\\n\\n//using namespace atcoder;\\n\\n#define REP(i, n) for (int i = 0; i < (n); ++i)\\n#define REPR(i, n) for (int i = n - 1; i >= 0; --i)\\n#define FOR(i, m, n) for (int i = m; i < n; ++i)\\n#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)\\n#define SORT(v, n) sort(v, v + n);\\n#define VSORT(v) sort(v.begin(), v.end());\\n#define REVERSE(v, n) reverse(v, v + n);\\n#define VREVERSE(v) reverse(v.begin(), v.end())\\n#define ll long long\\n#define print(x) cout << (x) << endl\\n#define pe(x) cout << (x) << \\\" \\\"\\n#define DEBUG(x) cout << #x << \\\": \\\" << x << endl\\n#define lb(v, n) lower_bound(v.begin(), v.end(), (n))\\n#define ub(v, n) upper_bound(v.begin(), v.end(), (n))\\n#define int long long\\n//#define double long double\\n#define all(x) (x).begin(), (x).end()\\n#define print_space(v) REP(i, v.size()) cout << v[i] << \\\" \\\\n\\\"[i==(int)v.size()-1]\\ntemplate <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }\\ntemplate <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }\\ntypedef pair<int, int> pii;\\ntypedef pair<long long, long long> pll;\\nstd::random_device rd;\\nstd::mt19937 mt(rd());\\nconstexpr ll MOD = 1e9 + 7;\\nconstexpr int MAX = 500050;\\nconst double pi = acos(-1);\\nconstexpr double EPS = 1e-8;\\nconstexpr ll LINF = 1e18 + 1;\\nconstexpr int INF = 1e9 + 1;\\nvoid Yes(bool cond) { cout << (cond ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid YES(bool cond) { cout << (cond ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\n\\n\\n\\nint X[2020], W[2020];\\nint ccl[2020], wcl[2020];//[0,i)\\nint ccr[2020], wcr[2020];//[i,N)\\nll dp[2020];\\nint N, K;\\nll f(int l, int r) {\\n\\tint sum = wcl[r+1] - wcl[l];\\n\\n\\tint ok = r, ng = l-1;\\n\\twhile (abs(ok - ng) > 1) {\\n\\t\\tint mid = (ok + ng) / 2;\\n\\t\\tif (wcl[mid+1] - wcl[l] >= sum / 2)ok = mid;\\n\\t\\telse ng = mid;\\n\\t}\\n\\t//DEBUG(l);\\n\\t//DEBUG(r);\\n\\t//DEBUG(sum);\\n\\t//DEBUG(ok);\\n\\t//DEBUG(ccl[ok]);\\n\\t//DEBUG(ccl[l]);\\n\\t//DEBUG(ccr[ok]);\\n\\t//DEBUG(ccr[r]);\\n\\tll lc = ccl[ok] - ccl[l] - (wcl[l] * (X[ok] - X[l]));\\n\\tll rc = ccr[ok] - ccr[r] - wcr[r+1] * (X[r] - X[ok]);\\n\\t//DEBUG(lc);\\n\\t//DEBUG(rc);\\n\\treturn lc+rc + X[r] - X[l] + K;\\n}\\nvoid solve() {\\n\\tcin >> N >> K;\\n\\tREP(i, N) {\\n\\t\\tcin >> X[i] >> W[i];\\n\\t}\\n\\tX[N] = LINF;\\n\\tW[N] = LINF;\\n\\tREP(i, N) {\\n\\t\\twcl[i + 1] =wcl[i] + W[i];\\n\\t\\tccl[i + 1] =ccl[i]+wcl[i+1] * (X[i + 1] - X[i]);\\n\\t}\\n\\tREPR(i, N) {\\n\\t\\twcr[i] = wcr[i + 1] + W[i];\\n\\t\\tif (i < N - 1)ccr[i] = ccr[i + 1] + wcr[i + 1] * (X[i + 1] - X[i]);\\n\\t}\\n\\tREP(i, N + 1)dp[i] = LINF;\\n\\tdp[0] = 0;\\n\\tREP(i, N) {\\n\\t\\tFOR(j, i, N + 1) {\\n\\t\\t\\tint res = f(i, j);\\n\\t\\t\\t//cerr << i << \\\" \\\" << j << \\\" \\\" << res<< endl;\\n\\t\\t}\\n\\t}\\n\\tREP(i, N) {\\n\\t\\tREP(j, i + 1) {\\n\\t\\t\\tchmin(dp[i + 1], dp[j] + f(j, i)+1);\\n\\t\\t}\\n\\t}\\n\\tprint(dp[N]);\\n}\\n\\n\\n\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\t//int q;\\n\\t//cin >> q;\\n\\t//while (q--)\\n\\tsolve();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.5724,\n \"final_rank\": 12\n }\n]","isConversational":false}}},{"rowIdx":1991,"cells":{"group_id":{"kind":"string","value":"aoj_3179_cpp"},"problem_description":{"kind":"string","value":"H Tree Queries\n問題文\numgくんは、 $N$ 頂点の木を持っています。頂点 $i \\ (1\\leq i \\leq N)$ の重みは $v_i$ です。 $j \\ (1 \\leq j \\leq N-1)$ 番目の辺は、頂点 $a_i$ と頂点 $b_i$ を結び、その重みは $w_i$ です。さらに、木全体の重みを「 $\\sum_{1\\leq a \\lt b \\leq N} \\mathrm{dist}(a,b) v_a v_b$ を $998244353$ で割った余り」で定めます。 (15:05 更新) \nここで、 $\\mathrm{dist}(a,b)$ というのは、頂点 $a$ から頂点 $b$ の最短経路上に存在する辺の重みの和を表しています。\numgくんはまず、今持っている木全体の重みを知りたいです。さらに、 $Q$ 個の変更クエリが与えられます。クエリの種類は以下の2つです。\n頂点クエリ : 頂点 $c \\ (1\\leq c \\leq N)$ の重みを $x$ 増やす。その後、現在の木全体の重みを出力する。\n辺クエリ : 辺 $e \\ (1\\leq e \\leq N-1)$ の重みを $x$ 増やす。その後、現在の木全体の重みを出力する。\nこれらのクエリを処理してください。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$\n$v_1$ $v_2$ $\\cdots$ $v_N$\n$a_1$ $b_1$ $w_1$\n$a_2$ $b_2$ $w_2$\n$\\vdots$\n$a_{N-1}$ $b_{N-1}$ $w_{N-1}$\n$Q$\n$query_1$\n$query_2$\n$\\vdots$\n$query_Q$\n$query_i$の入力形式は以下の2つのいずれかである。\n頂点クエリ\n$1$ $c$ $x$\n辺クエリ\n$2$ $e$ $x$\n制約\n入力はすべて整数である。\n$1 \\leq N \\leq 2 \\times 10^5$\n$1 \\leq v_i \\leq 10^8 \\ (1\\leq i \\leq N)$\n$1 \\leq Q \\leq 10^5$\n$1 \\leq a_i,b_i \\leq N$\n$1 \\leq w_i \\leq 10^8 \\ (1\\leq i \\leq N-1)$\n与えられるグラフは木である。\nクエリ1の$c$は$1\\leq c \\leq N$を満たす。\nクエリ2の$e$は$1\\leq e \\leq N-1$を満たす。\nクエリ1,2の$x$は$1\\leq x \\leq 10^8$を満たす。\nクエリ1の数は20000以下である。\n出力\n答えを $Q+1$ 行に出力せよ。$1$行目には木の最初の状態で木全体の重み、$i+1$行目には、$i$番目の変更クエリ後の木全体の重みを出力せよ。\n入力例1\n3\n1 2 4\n1 2 1\n2 3 2\n2\n1 1 1\n2 2 2\n出力例1\n30\n44\n76\n例えば、木の最初の状態の木全体の重みは、 $\\mathrm{dist}(1,2) \\times 1 \\times 2 + \\mathrm{dist}(1,3) \\times 1 \\times 4 + \\mathrm{dist}(2,3) \\times 2 \\times 4 = 2+12+16=30$ です。\n入力例2\n4\n2 2 3 3\n1 2 4\n1 3 3\n1 4 1\n3\n2 3 4\n1 4 1\n2 1 10\n出力例2\n148\n232\n284\n464"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3179_5786720","code_snippet":"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3179\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\ntemplate<typename T, T MOD = 1000000007>\nstruct Mint{\n inline static constexpr T mod = MOD;\n T v;\n Mint():v(0){}\n Mint(signed v):v(v){}\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\n\n Mint pow(long long k){\n Mint res(1),tmp(v);\n while(k){\n if(k&1) res*=tmp;\n tmp*=tmp;\n k>>=1;\n }\n return res;\n }\n\n static Mint add_identity(){return Mint(0);}\n static Mint mul_identity(){return Mint(1);}\n\n Mint inv(){return pow(MOD-2);}\n\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\n\n Mint operator+(Mint a) const{return Mint(v)+=a;}\n Mint operator-(Mint a) const{return Mint(v)-=a;}\n Mint operator*(Mint a) const{return Mint(v)*=a;}\n Mint operator/(Mint a) const{return Mint(v)/=a;}\n\n Mint operator+() const{return *this;}\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\n\n bool operator==(const Mint a)const{return v==a.v;}\n bool operator!=(const Mint a)const{return v!=a.v;}\n\n static Mint comb(long long n,int k){\n Mint num(1),dom(1);\n for(int i=0;i<k;i++){\n num*=Mint(n-i);\n dom*=Mint(i+1);\n }\n return num/dom;\n }\n};\ntemplate<typename T, T MOD>\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\n\ntemplate<typename Vertex, typename Cluster, size_t N>\nstruct TopTree{\n enum Type { Compress, Rake, Edge };\n struct Node{\n Vertex* vs[2];\n Cluster dat;\n Node* p;\n Node* q;\n Node* ch[2];\n bool rev,guard;\n Type type;\n Node():p(nullptr),q(nullptr),rev(false),guard(false){}\n };\n\n inline static array<Vertex, 2*N> pool_vertex;\n inline static size_t ptr_vertex = 0;\n\n inline static array<Node, 4*N> pool_node;\n inline static size_t ptr_node = 0;\n\n Cluster id;\n\n template<typename ...Args>\n inline Vertex* create(Args ...args){\n auto t=&pool_vertex[ptr_vertex++];\n auto dummy=&pool_vertex[ptr_vertex++];\n *t=Vertex(forward<Args>(args)...);\n link(t,id,dummy);\n return t;\n }\n\n Node* recycle=nullptr;\n inline void dispose_node(Node* t){\n t->p=recycle;\n recycle=t;\n }\n\n inline Node* get_new_node(){\n if(recycle) return new(exchange(recycle,recycle->p)) Node;\n return &(pool_node[ptr_node++]);\n }\n\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\n auto t=get_new_node();\n t->vs[0]=u;t->vs[1]=v;t->dat=w;t->type=Type::Edge;\n return pushup(t);\n }\n\n inline Node* compress(Node* l,Node* r){\n auto t=get_new_node();\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Compress;\n return pushup(t);\n }\n\n inline Node* rake(Node* l,Node* r){\n auto t=get_new_node();\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Rake;\n return pushup(t);\n }\n\n int parent_dir(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->guard) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n int parent_dir_ignore_guard(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n inline Node* pushup(Node* const t){\n Node* const l=t->ch[0];\n Node* const r=t->ch[1];\n\n if(t->type==Type::Compress){\n assert(l->vs[1]==r->vs[0]);\n t->vs[0]=l->vs[0];\n t->vs[1]=r->vs[1];\n\n Cluster lf=l->dat;\n if(t->q){\n assert(l->vs[1]==t->q->vs[1]);\n lf=Cluster::rake(l->dat,t->q->dat);\n }\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\n\n l->vs[1]->handle=t;\n }\n\n if(t->type==Type::Rake){\n propagate(t);\n assert(l->vs[1]==r->vs[1]);\n t->vs[0]=l->vs[0];\n t->vs[1]=l->vs[1];\n t->dat=Cluster::rake(l->dat,r->dat);\n }else{\n if(!t->p){\n t->vs[0]->handle=t;\n t->vs[1]->handle=t;\n }else if(t->p->type==Type::Compress){\n if(parent_dir(t)==-1)\n t->vs[0]->handle=t;\n }else if(t->p->type==Type::Rake){\n t->vs[0]->handle=t;\n }\n }\n return t;\n }\n\n inline void toggle(Node* t){\n if(t->type==Type::Edge){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n }else if(t->type==Type::Compress){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n t->rev^=true;\n }else if(t->type==Type::Rake){\n }else abort();\n }\n\n inline void propagate(Node* t){\n if(t->type==Type::Compress){\n if(t->rev){\n assert(t->ch[0] and t->ch[1]);\n swap(t->ch[0],t->ch[1]);\n toggle(t->ch[0]);\n toggle(t->ch[1]);\n t->rev=false;\n }\n }\n }\n\n void set_toggle(Node* v){\n toggle(v);propagate(v);\n }\n\n void pushdown(Node* t){\n if(!t) return;\n pushdown(t->p);\n propagate(t);\n }\n\n void rotate(Node* t,Node* x,size_t dir){\n Node* y=x->p;\n int par=parent_dir_ignore_guard(x);\n propagate(t->ch[dir]);\n x->ch[dir^1]=t->ch[dir];\n t->ch[dir]->p=x;\n t->ch[dir]=x;\n x->p=t;\n t->p=y;\n if(~par) y->ch[par]=t;\n else if(y and y->type==Type::Compress) y->q=t;\n pushup(x);pushup(t);\n if(y and !y->guard) pushup(y);\n }\n\n void splay(Node* t){\n assert(t->type!=Type::Edge);\n propagate(t);\n\n while(~parent_dir(t)){\n Node* q=t->p;\n if(q->type!=t->type) break;\n if(~parent_dir(q) and q->p and q->p->type==q->type){\n Node* r=q->p;\n if(r->p) propagate(r->p);\n propagate(r);propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n int rq_dir=parent_dir(q);\n if(rq_dir==qt_dir){\n rotate(q,r,rq_dir^1);\n rotate(t,q,qt_dir^1);\n }else{\n rotate(t,q,qt_dir^1);\n rotate(t,r,rq_dir^1);\n }\n }else{\n if(q->p) propagate(q->p);\n propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n rotate(t,q,qt_dir^1);\n }\n }\n }\n\n Node* expose(Node* t){\n pushdown(t);\n while(true){\n assert(t->type!=Type::Rake);\n if(t->type==Type::Compress) splay(t);\n Node* n=nullptr;\n {\n Node* p=t->p;\n if(!p) break;\n if(p->type==Type::Rake){\n propagate(p);\n splay(p);\n n=p->p;\n }\n if(p->type==Type::Compress){\n propagate(p);\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\n n=p;\n }\n }\n splay(n);\n int dir=parent_dir_ignore_guard(n);\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\n\n Node* const c=n->ch[dir];\n if(dir==1){\n set_toggle(c);\n set_toggle(t);\n }\n int n_dir=parent_dir(t);\n if(~n_dir){\n Node* const r=t->p;\n propagate(c);\n propagate(r);\n r->ch[n_dir]=c;\n c->p=r;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(r);pushup(t);pushup(n);\n splay(r);\n }else{\n propagate(c);\n n->q=c;\n c->p=n;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(t);pushup(n);\n }\n if(t->type==Type::Edge) t=n;\n }\n return t;\n }\n\n Node* expose(Vertex* v){\n return expose((Node*)(v->handle));\n }\n\n void soft_expose(Vertex* u,Vertex* v){\n pushdown((Node*)u->handle);\n pushdown((Node*)v->handle);\n Node* rt=expose(u);\n\n if(u->handle==v->handle){\n if(rt->vs[1]==u or rt->vs[0]==v)\n set_toggle(rt);\n return;\n }\n\n rt->guard=true;\n Node* soft=expose(v);\n rt->guard=false;\n\n pushup(rt);\n if(parent_dir(soft)==0) set_toggle(rt);\n }\n\n void bring(Node* rt){\n Node* rk=rt->q;\n if(!rk){\n Node* ll=rt->ch[0];\n dispose_node(ll->p);\n ll->p=nullptr;\n pushup(ll);\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\n Node* nr=rk;\n set_toggle(nr);\n rt->ch[1]=nr;\n nr->p=rt;\n rt->q=nullptr;\n\n pushup(nr);pushup(rt);\n }else if(rk->type==Type::Rake){\n propagate(rk);\n while(rk->ch[1]->type==Type::Rake){\n propagate(rk->ch[1]);\n rk=rk->ch[1];\n }\n pushdown(rk);\n\n rt->guard=true;\n splay(rk);\n rt->guard=false;\n\n Node* ll=rk->ch[0];\n Node* rr=rk->ch[1];\n propagate(ll);\n set_toggle(rr);\n\n rt->ch[1]=rr;\n rr->p=rt;\n\n rt->q=ll;\n ll->p=rt;\n\n dispose_node(rk);\n pushup(ll);pushup(rr);pushup(rt);\n }\n }\n\n Node* link(Vertex* u,Cluster w,Vertex* v){\n if(!u->handle and !v->handle) return edge(u,w,v);\n\n Node* nnu=(Node*)u->handle;\n Node* nnv=(Node*)v->handle;\n Node* ee=edge(u,w,v);\n Node* ll=nullptr;\n\n assert(nnv);\n Node* vv=expose(nnv);\n propagate(vv);\n if(vv->vs[1]==v) set_toggle(vv);\n if(vv->vs[0]==v){\n Node* nv=compress(ee,vv);\n ee->p=nv;\n pushup(ee);\n vv->p=nv;\n pushup(vv);pushup(nv);\n ll=nv;\n }else{\n Node* nv=vv;\n Node* ch=nv->ch[0];\n propagate(ch);\n nv->ch[0]=ee;\n ee->p=nv;\n pushup(ee);\n\n Node* bt=nv->q;\n Node* rk=nullptr;\n if(bt){\n propagate(bt);\n rk=rake(bt,ch);\n bt->p=rk;\n ch->p=rk;\n pushup(bt);pushup(ch);\n }else{\n rk=ch;\n }\n nv->q=rk;\n rk->p=nv;\n pushup(rk);pushup(nv);\n ll=nv;\n }\n\n assert(nnu);\n Node* uu=expose(nnu);\n propagate(uu);\n if(uu->vs[0]==u) set_toggle(uu);\n if(uu->vs[1]==u){\n Node* tp=compress(uu,ll);\n uu->p=tp;\n ll->p=tp;\n pushup(uu);pushup(ll);pushup(tp);\n }else{\n Node* nu=uu;\n Node* ch=nu->ch[1];\n toggle(ch);\n propagate(ch);\n\n nu->ch[1]=ll;\n ll->p=nu;\n pushup(ll);\n\n Node* al=nu->q;\n Node* rk=nullptr;\n if(al){\n propagate(al);\n rk=rake(al,ch);\n al->p=rk;\n ch->p=rk;\n pushup(al);pushup(ch);\n }else{\n rk=ch;\n }\n nu->q=rk;\n rk->p=nu;\n pushup(rk);pushup(nu);\n }\n return ee;\n }\n\n void cut(Vertex* u,Vertex *v){\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n Node* rr=rt->ch[1];\n rr->p=nullptr;\n set_toggle(rr);\n assert(rr->ch[1]->type==Type::Edge);\n dispose_node(rr->ch[1]);\n bring(rr);bring(rt);\n }\n\n Node* path(Vertex* u,Vertex* v){\n assert(u!=v);\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n propagate(rt->ch[1]);\n return rt->ch[1]->ch[0];\n }\n\n void set_vertex(Vertex* u,Vertex v){\n auto t=expose(u);\n *u=v;\n pushup(t);\n }\n\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\n auto t=path(u,v);\n assert(t->type==Type::Edge);\n t->dat=w;\n while(t) pushup(t),t=t->p;\n }\n\n Cluster get_path(Vertex* u,Vertex* v){\n return path(u,v)->dat;\n }\n\n Cluster get_subtree(Vertex* v){\n return expose(v)->dat;\n }\n\n // subtree of v when p is root\n Cluster get_subtree(Vertex* p,Vertex* v){\n Node* t=path(p,v);\n Cluster res=t->p->ch[1]->dat;\n res.toggle();\n Node* rk=t->p->q;\n if(t->p->q){\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\n res=Cluster::rake(res,rk->dat);\n }\n return res;\n }\n};\n\n#undef call_from_test\nusing M = Mint<int, 998244353>;\n\nstruct Vertex{\n M v;\n void* handle;\n Vertex():v(0),handle(nullptr){}\n Vertex(M v):v(v),handle(nullptr){}\n};\n\nstruct Cluster{\n M len;\n M sum_v;\n M sum_l,sum_r;\n M rake_v,rake_d;\n Cluster(M len=M(0)):len(len),sum_v(0),sum_l(0),sum_r(0),rake_v(0),rake_d(0){}\n void toggle(){\n swap(sum_l,sum_r);\n }\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\n Cluster nxt(x.len+y.len);\n nxt.sum_v=x.sum_v+x.rake_v+(v->v)+y.sum_v;\n nxt.sum_l=x.sum_l+x.rake_d+y.sum_l+(x.sum_v+(v->v)+x.rake_v)*y.len;\n nxt.sum_r=x.sum_r+x.rake_d+y.sum_r+(y.sum_v+(v->v)+x.rake_v)*x.len;\n return nxt;\n }\n static Cluster rake(Cluster x,Cluster y){\n x.rake_v+=y.sum_v+y.rake_v;\n x.rake_d+=y.sum_l+y.rake_d;\n return x;\n }\n};\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n const char newl ='\\n';\n\n int n;\n cin>>n;\n\n vector<M> vs(n);\n for(int i=0;i<n;i++) cin>>vs[i].v;\n\n vector<int> as(n),bs(n);\n vector<M> ws(n);\n for(int i=1;i<n;i++){\n cin>>as[i]>>bs[i]>>ws[i].v;\n as[i]--;bs[i]--;\n }\n\n const size_t N = 2e5;\n TopTree<Vertex, Cluster, N> G;\n\n vector<Vertex*> ptr(n);\n for(int i=0;i<n;i++) ptr[i]=G.create(vs[i]);\n\n for(int i=1;i<n;i++)\n G.link(ptr[as[i]],Cluster(0),ptr[bs[i]]);\n\n M ans{0};\n for(int i=1;i<n;i++){\n Cluster x=G.get_subtree(ptr[bs[i]],ptr[as[i]]);\n Cluster y=G.get_subtree(ptr[as[i]],ptr[bs[i]]);\n ans+=ws[i]*(x.sum_v+x.rake_v+vs[as[i]])*(y.sum_v+y.rake_v+vs[bs[i]]);\n G.set_edge(ptr[as[i]],ptr[bs[i]],Cluster(ws[i]));\n }\n cout<<ans<<newl;\n\n Vertex* rt=G.create(Vertex(0));\n\n int q;\n cin>>q;\n for(int i=0;i<q;i++){\n int t;\n cin>>t;\n if(t==1){\n int c,a;\n cin>>c>>a;\n c--;\n G.link(rt,Cluster(0),ptr[c]);\n Cluster x=G.get_subtree(rt,ptr[c]);\n G.cut(rt,ptr[c]);\n ans+=M(a)*(x.sum_l+x.rake_d);\n vs[c]+=M(a);\n G.set_vertex(ptr[c],Vertex(vs[c]));\n }\n\n if(t==2){\n int e,a;\n cin>>e>>a;\n\n Cluster x=G.get_subtree(ptr[bs[e]],ptr[as[e]]);\n Cluster y=G.get_subtree(ptr[as[e]],ptr[bs[e]]);\n ans+=M(a)*(x.sum_v+x.rake_v+vs[as[e]])*(y.sum_v+y.rake_v+vs[bs[e]]);\n\n ws[e]+=M(a);\n G.set_edge(ptr[as[e]],ptr[bs[e]],Cluster(ws[e]));\n }\n cout<<ans<<newl;\n }\n return 0;\n}","accuracy":1,"time_ms":1370,"memory_kb":79596,"score_of_the_acc":-1.4468,"final_rank":10},{"submission_id":"aoj_3179_5702994","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T> using PQ = priority_queue<T>;\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\" \"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(const T &v,ll n,string sv=\" \"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop_front();}cout<<endl;}\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\"[\"<<z.first<<\"]=\"<<z.second<<\",\";cout<<endl;}\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\n auto tmp = v;\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\n}\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\n rearrange(ord, head);\n rearrange(ord, tail...);\n}\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\n return ord;\n}\ntemplate<typename T> vector<int> descend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\n return ord;\n}\nll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}\nll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\nint popcount(ll x){return __builtin_popcountll(x);};\nint poplow(ll x){return __builtin_ctzll(x);};\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\ntemplate< typename T = int >\nstruct edge {\n int to;\n T cost;\n int id;\n edge():id(-1){};\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\n operator int() const { return to; }\n};\n\ntemplate<typename T>\nusing Graph = vector<vector<edge<T>>>;\ntemplate<typename T>\nGraph<T>revgraph(const Graph<T> &g){\n Graph<T>ret(g.size());\n for(int i=0;i<g.size();i++){\n for(auto e:g[i]){\n int to = e.to;\n e.to = i;\n ret[to].push_back(e);\n }\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\n Graph<T> ret(n);\n for(int es = 0; es < m; es++){\n int u,v;\n T w=1;\n cin>>u>>v;u-=indexed,v-=indexed;\n if(weighted)cin>>w;\n ret[u].emplace_back(v,w,es);\n if(!directed)ret[v].emplace_back(u,w,es);\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\n Graph<T>ret(n);\n for(int i=1;i<n;i++){\n int p;cin>>p;\n p-=indexed;\n ret[p].emplace_back(i);\n if(!directed)ret[i].emplace_back(p);\n }\n return ret;\n}\ntemplate< int mod >\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n\n friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) += rhs;\n }\n friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) -= rhs;\n }\n friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) *= rhs;\n }\n friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) /= rhs;\n }\n\n bool operator==(const ModInt &p) const { return x == p.x; }\n\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\nusing modint = ModInt< MOD9 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}\n//using modint=ld;\ntemplate< typename Monoid, typename OperatorMonoid,typename F, typename G, typename H>\nstruct LazySegmentTree {\n ll sz, height, n;\n vector< Monoid > data;\n vector< OperatorMonoid > lazy;\n const F f;\n const G g;\n const H h;\n Monoid M1;\n OperatorMonoid OM0;\n LazySegmentTree(ll n, const F &f,const G &g, const H &h, Monoid M1, OperatorMonoid OM0):n(n),f(f),g(g),h(h),M1(M1),OM0(OM0){\n sz = 1;\n height = 0;\n while(sz < n) sz <<= 1, height++;\n data.assign(2 * sz, M1);\n lazy.assign(2 * sz, OM0);\n }\n\n void set(ll k, const Monoid &x) {\n data[k + sz] = x;\n }\n\n void build() {\n for(ll k = sz - 1; k > 0; k--) {\n data[k] = f(data[2 * k + 0], data[2 * k + 1]);\n }\n }\n\n inline void propagate(ll k) {\n if(lazy[k] != OM0) {\n lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);\n lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);\n data[k] = reflect(k);\n lazy[k] = OM0;\n }\n }\n\n inline Monoid reflect(ll k) {\n return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);\n }\n\n inline void recalc(ll k) {\n while(k >>= 1) data[k] = f(reflect(2 * k + 0), reflect(2 * k + 1));\n }\n\n inline void thrust(ll k) {\n for(ll i = height; i > 0; i--) propagate(k >> i);\n }\n\n void update(ll a, ll b, const OperatorMonoid &x) {\n\tif(a>=b)return;\n thrust(a += sz);\n thrust(b += sz - 1);\n for(ll l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\n if(l & 1) lazy[l] = h(lazy[l], x), ++l;\n if(r & 1) --r, lazy[r] = h(lazy[r], x);\n }\n recalc(a);\n recalc(b);\n }\n \n void update(ll a,const Monoid &x){\n thrust(a += sz);\n data[a] = x;\n lazy[a] = OM0;\n recalc(a);\n }\n\n Monoid query(ll a, ll b) {\n\tif(a>=b)return M1;\n thrust(a += sz);\n thrust(b += sz - 1);\n Monoid L = M1, R = M1;\n for(ll l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\n if(l & 1) L = f(L, reflect(l++));\n if(r & 1) R = f(reflect(--r), R);\n }\n return f(L, R);\n }\n\n Monoid operator[](const ll &k) {\n return query(k, k + 1);\n }\n\n template< typename C >\n ll find_subtree(ll a, const C &check, Monoid &M, bool type) {\n while(a < sz) {\n propagate(a);\n Monoid nxt = type ? f(reflect(2 * a + type), M) : f(M, reflect(2 * a + type));\n if(check(nxt)) a = 2 * a + type;\n else M = nxt, a = 2 * a + 1 - type;\n }\n return a - sz;\n }\n\n template< typename C >\n ll find_first(ll a, const C &check) {\n Monoid L = M1;\n if(a <= 0) {\n if(check(f(L, reflect(1)))) return find_subtree(1, check, L, false);\n return -1;\n }\n thrust(a + sz);\n ll b = sz;\n for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n if(a & 1) {\n Monoid nxt = f(L, reflect(a));\n if(check(nxt)) return find_subtree(a, check, L, false);\n L = nxt;\n ++a;\n }\n }\n return -1;\n }\n\n\n template< typename C >\n ll find_last(ll b, const C &check) {\n Monoid R = M1;\n if(b >= sz) {\n if(check(f(reflect(1), R))) return find_subtree(1, check, R, true);\n return -1;\n }\n thrust(b + sz - 1);\n ll a = sz;\n for(b += sz; a < b; a >>= 1, b >>= 1) {\n if(b & 1) {\n Monoid nxt = f(reflect(--b), R);\n if(check(nxt)) return find_subtree(b, check, R, true);\n R = nxt;\n }\n }\n return -1;\n }\n void print(){\n for(ll i=0;i<n;i++)if((*this)[i]==M1)cout<<\"x|\";else cout<<(*this)[i]<<\"|\";\n cout<<endl;\n }\n};\ntemplate<typename T>\nstruct HLD{\n using D=long long;\n int n;\n vector<int>sz;//部分木サイズ\n vector<D>dep;\n vector<int>par;\n vector<int>head;\n Graph<T> &g;//隣接リスト\n vector<edge<T>>edges;//データ構造に乗せるedge列\n vector<int>in,out;//[in,out)で部分木、[ina,inb]でa~bのパス(aが上)\n vector<int>comp;//連結成分の根\n //inは頂点のindexを表す。また、edge列の下側の頂点である\n HLD(Graph<T> &g,int r=-1):g(g),n(g.size()){\n hld_build(r);\n }\n void hld_build(int root = -1){\n in.assign(n,-1);out.assign(n,-1);dep.assign(n,0);\n par.assign(n,-1);head.assign(n,-1);sz.assign(n,-1);comp.assign(n,-1);\n edges.assign(n,edge<T>());\n if(root == -1){//根がどこでも良い場合(森でも可)\n for(int i=0;i<n;i++){\n if(sz[i] == -1){\n head[i] = i;\n dfs_sz(i, 0, i);\n dfs_hld(i);\n }\n }\n }\n else{\n head[root] = root;\n dfs_sz(root, 0, root);\n dfs_hld(root);\n }\n }\n void dfs_sz(int k, D d,int r){\n sz[k] = 1;\n comp[k] = r;\n\tdep[k] = d;\n for(auto &e: g[k]){\n if(e.to == par[k])continue;\n par[e.to] = k;\n dfs_sz(e.to, d+e.cost, r);\n sz[k] += sz[e.to];\n if(sz[e.to] > sz[g[k][0].to])swap(e, g[k][0]);\n }\n }\n int time = 0;\n void dfs_hld(int k){\n in[k] = time++;\n for(auto e:g[k]){\n if(e.to == par[k])continue;\n head[e.to] = (e.to == g[k][0].to ? head[k]: e.to);\n edges[time] = e;\n dfs_hld(e.to);\n }\n out[k] = time;\n }\n int lca(int p,int q){\n while(1){\n if(in[p] < in[q])swap(p,q);\n if(head[p] == head[q])return q;\n p = par[head[p]];\n }\n }\n vector<pair<int,int>>query_path(int p,int q,bool isEdge){\n int r=lca(p,q);\n vector<pair<int,int>>ret;\n for(int i=0;i<2;i++){\n if(i == 1)swap(p,q);\n while(1){\n if(isEdge&&p==r)break;\n if(head[p]==head[r]){\n ret.emplace_back(in[r]+(isEdge?1:i),in[p]+1);\n break;\n }\n ret.emplace_back(in[head[p]],in[p]+1);\n p = par[head[p]];\n }\n }\n return ret;\n }\n vector<vector<pair<int,int>>>query_order_path(int p,int q,bool isEdge){\n\t//非可換クエリ用、配列0を順番を反転したデータ構造に、配列1を通常のデータ構造に\n vector<vector<pair<int,int>>>ret(2);\n int r=lca(p,q);\n for(int i=0;i<2;i++){\n if(i == 1)swap(p,q);\n while(1){\n if(isEdge&&p==r)break;\n if(head[p]==head[r]){\n if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[r]+(isEdge?1:i)));\n else ret[i].emplace_back(in[r]+(isEdge?1:i),in[p]+1);\n break;\n }\n if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[head[p]]));\n else ret[i].emplace_back(in[head[p]],in[p]+1);\n p = par[head[p]];\n }\n }\n reverse(ret[1].begin(), ret[1].end());\n return ret;\n }\n pair<int,int>query_subtree(int p,bool isEdge){\n return make_pair(in[p]+isEdge,out[p]);\n }\n //uのv方向の子 子孫関係は前もって確認すること(in,outを見る)\n int child(int u,int v){\n while(1){\n if(head[u]==head[v]){\n v=g[u][0].to;\n break;\n }\n v=head[v];\n if(par[v]==u)break;\n v=par[v];\n }\n return v;\n }\n //uをv方向に一つ進めた頂点\n int move(int u,int v){\n assert(u!=v);\n if(in[u]<in[v]&&in[v]<out[u])return child(u,v);\n else return par[u];\n }\n D dist(int u,int v){\n return dep[u]+dep[v]-2*dep[lca(u,v)];\n }\n vector<int>rev_in;\n int climb(int u,int k){\n if(rev_in.empty()){\n rev_in.resize(n);\n for(int i=0;i<n;i++)rev_in[in[i]]=i;\n }\n int nd=max<int>(dep[u]-k, 0);\n while(dep[u]>nd){\n if(dep[head[u]]>nd){\n u=par[head[u]];\n }\n else{\n u=rev_in[in[head[u]]+nd-dep[head[u]]];\n }\n }\n return u;\n }\n template<typename I>\n Graph<T>lca_tree(vector<I>&v){\n auto compare=[&](int x,int y){return in[x]<in[y];};\n sort(v.begin(),v.end(),compare);\n int sz1=v.size();\n for(int i=0;i<sz1-1;i++)v.push_back(lca(v[i],v[i+1]));\n sort(v.begin(),v.end(),compare);\n v.erase(unique(v.begin(),v.end()),v.end());\n int sz2=v.size();\n Graph<T>ret(sz2);\n stack<int>st;\n for(int i=0;i<sz2;i++){\n while(!st.empty()&&out[v[st.top()]]<=in[v[i]])st.pop();\n if(!st.empty())ret[st.top()].emplace_back(i,dep[v[i]]-dep[v[st.top()]]);\n st.push(i);\n }\n return ret;\n }\n};\nnamespace add_sum{\n struct M{\n modint vs,es,sum,sz;\n };\n using PM=pair<modint,modint>;\n auto f=[](M x,M y)->M{\n return {x.vs+y.vs,x.es+y.es,x.sum+y.sum,x.sz+y.sz};\n };\n auto g=[](M x,PM y)->M{\n return {x.vs+x.sz*y.fi,\n x.es+x.sz*y.se,\n x.sum+x.vs*y.se+x.es*y.fi+x.sz*y.fi*y.se,\n x.sz};\n };\n auto h=[](PM x,PM y)->PM{\n return MP(x.fi+y.fi,x.se+y.se);\n };\n LazySegmentTree<M,PM,decltype(f),decltype(g),decltype(h)>make(int n){\n return {n,f,g,h,{0,0,0,0},MP(0,0)};\n }\n}\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n ll n;cin>>n;\n vector<ll>vw(n);\n rep(i,0,n)cin>>vw[i];\n auto g=readGraph<int>(n,n-1,1,false,true);\n HLD hld(g);\n auto up=add_sum::make(n);\n auto down=add_sum::make(n);\n auto ord=ascend(hld.in);\n vector<ll>epos(n-1);\n up.build();\n down.build();\n modint ret=0;\n modint allsz=0;\n rep(i,0,n)allsz+=vw[i];\n vector<modint>subsz(n,0);\n {\n auto dfs=[&](auto &&f,ll k,ll par)->void{\n subsz[k]=vw[k];\n for(auto to:g[k]){\n if(to==par)continue;\n f(f,to,k);\n subsz[k]+=subsz[to];\n }\n };\n dfs(dfs,0,-1);\n }\n rep(i,1,n){\n modint sz=subsz[ord[i]];\n epos[hld.edges[i].id]=i;\n up.set(i,{allsz-sz,hld.edges[i].cost,(allsz-sz)*hld.edges[i].cost,1});\n down.set(i,{sz,hld.edges[i].cost,sz*hld.edges[i].cost,1});\n ret+=hld.edges[i].cost*sz*(allsz-sz);\n }\n up.build();\n down.build();\n cout<<ret<<endl;\n ll q;cin>>q;\n while(q--){\n ll t,k,w;cin>>t>>k>>w;k--;\n if(t==1){\n modint add=down.query(1,n).sum;\n auto tmp=hld.query_path(0,k,true);\n //cout<<q spa add spa k spa tmp.size()<<endl;\n for(auto z:tmp){\n add-=down.query(z.fi,z.se).sum;\n //cout<<q spa add<<endl;\n add+=up.query(z.fi,z.se).sum;\n //cout<<q spa add<<endl;\n }\n ret+=add*w;\n up.update(1,n,MP(w,0));\n for(auto z:tmp){\n up.update(z.fi,z.se,MP(-w,0));\n down.update(z.fi,z.se,MP(w,0));\n }\n vw[k]+=w;\n allsz+=w;\n }\n if(t==2){\n modint sz=down[epos[k]].vs;\n ret+=sz*(allsz-sz)*w;\n up.update(epos[k],epos[k]+1,MP(0,w));\n down.update(epos[k],epos[k]+1,MP(0,w));\n }\n cout<<ret<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":66772,"score_of_the_acc":-0.5258,"final_rank":2},{"submission_id":"aoj_3179_4875833","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\ntemplate<typename Vertex, typename Cluster, size_t LIM>\nstruct TopTree{\n enum Type { Compress, Rake, Edge };\n struct Node{\n Vertex* vs[2];\n Cluster dat;\n Node* p;\n Node* q;\n Node* ch[2];\n bool rev,guard;\n Type type;\n Node():p(nullptr),q(nullptr),rev(false),guard(false){}\n };\n\n static array<Vertex, LIM> pool_v;\n static array<Node, LIM> pool_c;\n size_t ptr_v,ptr_c;\n\n Cluster id;\n TopTree():ptr_v(0),ptr_c(0),id(){}\n\n inline Vertex* create(Vertex v=Vertex()){\n auto t=&pool_v[ptr_v++];\n auto dummy=&pool_v[ptr_v++];\n *t=v;\n link(t,id,dummy);\n return t;\n }\n\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\n auto t=&(pool_c[ptr_c++]);\n t->vs[0]=u;t->vs[1]=v;t->dat=w;t->type=Type::Edge;\n return pushup(t);\n }\n\n inline Node* compress(Node* l,Node* r){\n auto t=&(pool_c[ptr_c++]);\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Compress;\n return pushup(t);\n }\n\n inline Node* rake(Node* l,Node* r){\n auto t=&(pool_c[ptr_c++]);\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Rake;\n return pushup(t);\n }\n\n int parent_dir(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->guard) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n int parent_dir_ignore_guard(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n inline Node* pushup(Node* const t){\n Node* const l=t->ch[0];\n Node* const r=t->ch[1];\n\n if(t->type==Type::Compress){\n assert(l->vs[1]==r->vs[0]);\n t->vs[0]=l->vs[0];\n t->vs[1]=r->vs[1];\n\n Cluster lf=l->dat;\n if(t->q){\n assert(l->vs[1]==t->q->vs[1]);\n lf=Cluster::rake(l->dat,t->q->dat);\n }\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\n\n l->vs[1]->handle=t;\n }\n\n if(t->type==Type::Rake){\n propagate(t);\n assert(l->vs[1]==r->vs[1]);\n t->vs[0]=l->vs[0];\n t->vs[1]=l->vs[1];\n t->dat=Cluster::rake(l->dat,r->dat);\n }else{\n if(!t->p){\n t->vs[0]->handle=t;\n t->vs[1]->handle=t;\n }else if(t->p->type==Type::Compress){\n if(parent_dir(t)==-1)\n t->vs[0]->handle=t;\n }else if(t->p->type==Type::Rake){\n t->vs[0]->handle=t;\n }\n }\n return t;\n }\n\n inline void toggle(Node* t){\n if(t->type==Type::Edge){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n }else if(t->type==Type::Compress){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n t->rev^=true;\n }else if(t->type==Type::Rake){\n }else abort();\n }\n\n inline void propagate(Node* t){\n if(t->type==Type::Compress){\n if(t->rev){\n assert(t->ch[0] and t->ch[1]);\n swap(t->ch[0],t->ch[1]);\n toggle(t->ch[0]);\n toggle(t->ch[1]);\n t->rev=false;\n }\n }\n }\n\n void set_toggle(Node* v){\n toggle(v);propagate(v);\n }\n\n void pushdown(Node* t){\n if(!t) return;\n pushdown(t->p);\n propagate(t);\n }\n\n void rotate(Node* t,Node* x,size_t dir){\n Node* y=x->p;\n int par=parent_dir_ignore_guard(x);\n propagate(t->ch[dir]);\n x->ch[dir^1]=t->ch[dir];\n t->ch[dir]->p=x;\n t->ch[dir]=x;\n x->p=t;\n t->p=y;\n if(~par) y->ch[par]=t;\n else if(y and y->type==Type::Compress) y->q=t;\n pushup(x);pushup(t);\n if(y and !y->guard) pushup(y);\n }\n\n void splay(Node* t){\n assert(t->type!=Type::Edge);\n propagate(t);\n\n while(~parent_dir(t)){\n Node* q=t->p;\n if(q->type!=t->type) break;\n if(~parent_dir(q) and q->p and q->p->type==q->type){\n Node* r=q->p;\n if(r->p) propagate(r->p);\n propagate(r);propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n int rq_dir=parent_dir(q);\n if(rq_dir==qt_dir){\n rotate(q,r,rq_dir^1);\n rotate(t,q,qt_dir^1);\n }else{\n rotate(t,q,qt_dir^1);\n rotate(t,r,rq_dir^1);\n }\n }else{\n if(q->p) propagate(q->p);\n propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n rotate(t,q,qt_dir^1);\n }\n }\n }\n\n Node* expose(Node* t){\n pushdown(t);\n while(true){\n assert(t->type!=Type::Rake);\n if(t->type==Type::Compress) splay(t);\n Node* n=nullptr;\n {\n Node* p=t->p;\n if(!p) break;\n if(p->type==Type::Rake){\n propagate(p);\n splay(p);\n n=p->p;\n }\n if(p->type==Type::Compress){\n propagate(p);\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\n n=p;\n }\n }\n splay(n);\n int dir=parent_dir_ignore_guard(n);\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\n\n Node* const c=n->ch[dir];\n if(dir==1){\n set_toggle(c);\n set_toggle(t);\n }\n int n_dir=parent_dir(t);\n if(~n_dir){\n Node* const r=t->p;\n propagate(c);\n propagate(r);\n r->ch[n_dir]=c;\n c->p=r;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(r);pushup(t);pushup(n);\n splay(r);\n }else{\n propagate(c);\n n->q=c;\n c->p=n;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(t);pushup(n);\n }\n if(t->type==Type::Edge) t=n;\n }\n return t;\n }\n\n Node* expose(Vertex* v){\n return expose((Node*)(v->handle));\n }\n\n void soft_expose(Vertex* u,Vertex* v){\n pushdown((Node*)u->handle);\n pushdown((Node*)v->handle);\n Node* rt=expose(u);\n\n if(u->handle==v->handle){\n if(rt->vs[1]==u or rt->vs[0]==v)\n set_toggle(rt);\n return;\n }\n\n rt->guard=true;\n Node* soft=expose(v);\n rt->guard=false;\n\n pushup(rt);\n if(parent_dir(soft)==0) set_toggle(rt);\n }\n\n void bring(Node* rt){\n Node* rk=rt->q;\n if(!rk){\n Node* ll=rt->ch[0];\n ll->p=nullptr;\n pushup(ll);\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\n propagate(rk);\n\n Node* nr=rk;\n set_toggle(nr);\n rt->ch[1]=nr;\n nr->p=rt;\n rt->q=nullptr;\n\n pushup(nr);pushup(rt);\n }else if(rk->type==Type::Rake){\n propagate(rk);\n while(rk->ch[1]->type==Type::Rake){\n propagate(rk->ch[1]);\n rk=rk->ch[1];\n }\n pushdown(rk);\n\n rt->guard=true;\n splay(rk);\n rt->guard=false;\n\n Node* ll=rk->ch[0];\n Node* rr=rk->ch[1];\n propagate(ll);\n set_toggle(rr);\n\n rt->ch[1]=rr;\n rr->p=rt;\n\n rt->q=ll;\n ll->p=rt;\n\n pushup(ll);pushup(rr);pushup(rt);\n }\n }\n\n Node* link(Vertex* u,Cluster w,Vertex* v){\n if(!u->handle and !v->handle) return edge(u,w,v);\n\n Node* nnu=(Node*)u->handle;\n Node* nnv=(Node*)v->handle;\n Node* ee=edge(u,w,v);\n Node* ll=nullptr;\n\n if(!nnv) ll=ee;\n else{\n Node* vv=expose(nnv);\n propagate(vv);\n if(vv->vs[1]==v) set_toggle(vv);\n if(vv->vs[0]==v){\n Node* nv=compress(ee,vv);\n ee->p=nv;\n pushup(ee);\n vv->p=nv;\n pushup(vv);pushup(nv);\n ll=nv;\n }else{\n Node* nv=vv;\n Node* ch=nv->ch[0];\n propagate(ch);\n nv->ch[0]=ee;\n ee->p=nv;\n pushup(ee);\n\n Node* bt=nv->q;\n Node* rk=nullptr;\n if(bt){\n propagate(bt);\n rk=rake(bt,ch);\n bt->p=rk;\n ch->p=rk;\n pushup(bt);pushup(ch);\n }else{\n rk=ch;\n }\n nv->q=rk;\n rk->p=nv;\n pushup(rk);pushup(nv);\n ll=nv;\n }\n }\n\n if(nnu){\n Node* uu=expose(nnu);\n propagate(uu);\n if(uu->vs[0]==u) set_toggle(uu);\n if(uu->vs[1]==u){\n Node* tp=compress(uu,ll);\n uu->p=tp;\n ll->p=tp;\n pushup(uu);pushup(ll);pushup(tp);\n }else{\n Node* nu=uu;\n Node* ch=nu->ch[1];\n toggle(ch);\n propagate(ch);\n\n nu->ch[1]=ll;\n ll->p=nu;\n pushup(ll);\n\n Node* al=nu->q;\n Node* rk=nullptr;\n if(al){\n propagate(al);\n rk=rake(al,ch);\n al->p=rk;\n ch->p=rk;\n pushup(al);pushup(ch);\n }else{\n rk=ch;\n }\n nu->q=rk;\n rk->p=nu;\n pushup(rk);pushup(nu);\n }\n }\n return ee;\n }\n\n void cut(Vertex* u,Vertex *v){\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n Node* rr=rt->ch[1];\n rr->p=nullptr;\n set_toggle(rr);\n bring(rr);bring(rt);\n }\n\n Node* path(Vertex* u,Vertex* v){\n assert(u!=v);\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n propagate(rt->ch[1]);\n return rt->ch[1]->ch[0];\n }\n\n void set_vertex(Vertex* u,Vertex v){\n auto t=expose(u);\n *u=v;\n pushup(t);\n }\n\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\n auto t=path(u,v);\n assert(t->type==Type::Edge);\n t->dat=w;\n while(t) pushup(t),t=t->p;\n }\n\n Cluster get_path(Vertex* u,Vertex* v){\n return path(u,v)->dat;\n }\n\n Cluster get_subtree(Vertex* v){\n return expose(v)->dat;\n }\n\n // subtree of v when p is root\n Cluster get_subtree(Vertex* p,Vertex* v){\n Node* t=path(p,v);\n Cluster res=t->p->ch[1]->dat;\n res.toggle();\n Node* rk=t->p->q;\n if(t->p->q){\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\n res=Cluster::rake(res,rk->dat);\n }\n return res;\n }\n};\ntemplate<typename Vertex, typename Cluster, size_t LIM>\narray<Vertex, LIM> TopTree<Vertex, Cluster, LIM>::pool_v;\ntemplate<typename Vertex, typename Cluster, size_t LIM>\narray<typename TopTree<Vertex, Cluster, LIM>::Node, LIM>\nTopTree<Vertex, Cluster, LIM>::pool_c;\n\n\n\ntemplate<typename T,T MOD = 1000000007>\nstruct Mint{\n static constexpr T mod = MOD;\n T v;\n Mint():v(0){}\n Mint(signed v):v(v){}\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\n\n Mint pow(long long k){\n Mint res(1),tmp(v);\n while(k){\n if(k&1) res*=tmp;\n tmp*=tmp;\n k>>=1;\n }\n return res;\n }\n\n static Mint add_identity(){return Mint(0);}\n static Mint mul_identity(){return Mint(1);}\n\n Mint inv(){return pow(MOD-2);}\n\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\n\n Mint operator+(Mint a) const{return Mint(v)+=a;}\n Mint operator-(Mint a) const{return Mint(v)-=a;}\n Mint operator*(Mint a) const{return Mint(v)*=a;}\n Mint operator/(Mint a) const{return Mint(v)/=a;}\n\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\n\n bool operator==(const Mint a)const{return v==a.v;}\n bool operator!=(const Mint a)const{return v!=a.v;}\n bool operator <(const Mint a)const{return v <a.v;}\n\n static Mint comb(long long n,int k){\n Mint num(1),dom(1);\n for(int i=0;i<k;i++){\n num*=Mint(n-i);\n dom*=Mint(i+1);\n }\n return num/dom;\n }\n};\ntemplate<typename T,T MOD> constexpr T Mint<T, MOD>::mod;\ntemplate<typename T,T MOD>\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\n\nusing M = Mint<int, 998244353>;\n\nstruct Vertex{\n M v;\n void* handle;\n Vertex():v(0),handle(nullptr){}\n Vertex(M v):v(v),handle(nullptr){}\n};\n\nstruct Cluster{\n M len;\n M sum_v;\n M sum_l,sum_r;\n M rake_v,rake_d;\n Cluster(M len=M(0)):len(len),sum_v(0),sum_l(0),sum_r(0),rake_v(0),rake_d(0){}\n void toggle(){\n swap(sum_l,sum_r);\n }\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\n Cluster nxt(x.len+y.len);\n nxt.sum_v=x.sum_v+x.rake_v+(v->v)+y.sum_v;\n nxt.sum_l=x.sum_l+x.rake_d+y.sum_l+(x.sum_v+(v->v)+x.rake_v)*y.len;\n nxt.sum_r=x.sum_r+x.rake_d+y.sum_r+(y.sum_v+(v->v)+x.rake_v)*x.len;\n return nxt;\n }\n static Cluster rake(Cluster x,Cluster y){\n x.rake_v+=y.sum_v+y.rake_v;\n x.rake_d+=y.sum_l+y.rake_d;\n return x;\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n;\n cin>>n;\n\n vector<M> vs(n);\n for(int i=0;i<n;i++) cin>>vs[i].v;\n\n vector<int> as(n),bs(n);\n vector<M> ws(n);\n for(int i=1;i<n;i++){\n cin>>as[i]>>bs[i]>>ws[i].v;\n as[i]--;bs[i]--;\n }\n\n const size_t LIM = 1e6;\n TopTree<Vertex, Cluster, LIM> G;\n\n vector<Vertex*> ptr(n);\n for(int i=0;i<n;i++) ptr[i]=G.create(Vertex(vs[i]));\n\n for(int i=1;i<n;i++)\n G.link(ptr[as[i]],Cluster(0),ptr[bs[i]]);\n\n M ans{0};\n for(int i=1;i<n;i++){\n Cluster x=G.get_subtree(ptr[bs[i]],ptr[as[i]]);\n Cluster y=G.get_subtree(ptr[as[i]],ptr[bs[i]]);\n ans+=ws[i]*(x.sum_v+x.rake_v+vs[as[i]])*(y.sum_v+y.rake_v+vs[bs[i]]);\n G.set_edge(ptr[as[i]],ptr[bs[i]],Cluster(ws[i]));\n }\n cout<<ans<<newl;\n\n Vertex* rt=G.create(Vertex(0));\n\n int q;\n cin>>q;\n for(int i=0;i<q;i++){\n int t;\n cin>>t;\n if(t==1){\n int c,a;\n cin>>c>>a;\n c--;\n G.link(rt,Cluster(0),ptr[c]);\n Cluster x=G.get_subtree(rt,ptr[c]);\n G.cut(rt,ptr[c]);\n // cout<<x.sum_l<<' '<<x.sum_r<<' '<<x.rake_d<<newl;\n ans+=M(a)*(x.sum_l+x.rake_d);\n vs[c]+=M(a);\n G.set_vertex(ptr[c],Vertex(vs[c]));\n }\n\n if(t==2){\n int e,a;\n cin>>e>>a;\n\n Cluster x=G.get_subtree(ptr[bs[e]],ptr[as[e]]);\n Cluster y=G.get_subtree(ptr[as[e]],ptr[bs[e]]);\n ans+=M(a)*(x.sum_v+x.rake_v+vs[as[e]])*(y.sum_v+y.rake_v+vs[bs[e]]);\n\n ws[e]+=M(a);\n G.set_edge(ptr[as[e]],ptr[bs[e]],Cluster(ws[e]));\n }\n cout<<ans<<newl;\n }\n return 0;\n}","accuracy":1,"time_ms":1400,"memory_kb":104672,"score_of_the_acc":-1.7651,"final_rank":11},{"submission_id":"aoj_3179_4849270","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <string>\n#include <cmath>\n#include <bitset>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <complex>\n#include <unordered_map>\n#include <unordered_set>\n#include <random>\n#include <cassert>\n#include <fstream>\n#include <utility>\n#include <functional>\n#include <time.h>\n#include <stack>\n#include <array>\n#include <list>\n#define popcount __builtin_popcount\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntemplate<int MOD>\nstruct ModInt{\n\tint x;\n\tModInt(): x(0){}\n\tModInt(ll y): x(y>=0 ? y%MOD : (MOD-(-y)%MOD)%MOD){}\n\n\tModInt &operator+=(const ModInt &p){\n\t\tif((x+=p.x)>=MOD) x-=MOD;\n\t\treturn *this;\n\t}\n\tModInt &operator-=(const ModInt &p){\n\t\tif((x+=MOD-p.x)>=MOD) x-=MOD;\n\t\treturn *this;\n\t}\n\tModInt &operator*=(const ModInt &p){\n\t\tx=(int)(1ll*x*p.x%MOD);\n\t\treturn *this;\n\t}\n\tModInt &operator/=(const ModInt &p){\n\t\t*this*=p.inv();\n\t\treturn *this;\n\t}\n\n\tModInt operator-() const{ return ModInt(-x);}\n\tModInt operator+(const ModInt &p) const{ return ModInt(*this)+=p;}\n\tModInt operator-(const ModInt &p) const{ return ModInt(*this)-=p;}\n\tModInt operator*(const ModInt &p) const{ return ModInt(*this)*=p;}\n\tModInt operator/(const ModInt &p) const{ return ModInt(*this)/=p;}\n\tbool operator==(const ModInt &p) const{ return x==p.x;}\n\tbool operator!=(const ModInt &p) const{ return x!=p.x;}\n\n\tModInt pow(ll n) const{\n\t\tModInt ret(1), p(x);\n\t\twhile(n){\n\t\t\tif(n&1) ret*=p;\n\t\t\tp*=p;\n\t\t\tn>>=1;\n\t\t}\n\t\treturn ret;\n\t}\n\tModInt inv() const{\n\t\treturn pow(MOD-2);\n\t}\n};\nconst int MOD=998244353;\nusing mint=ModInt<MOD>;\nstruct LinkCutTree{\n\tstruct Node{\n\t\tNode *l, *r, *p;\n\t\tbool rev;\n\t\tint idx;\n\t\tmint val, sz, szl;\n\t\tmint cost, sum, suml, costs, sum2;\n\t\tNode(mint val, int idx, mint cost):cost(cost), costs(cost), sum(0), sum2(0), suml(0), idx(idx), val(val), sz(val), szl(0), rev(false), l(nullptr), r(nullptr), p(nullptr){}\n\t\tbool is_root(){\n\t\t\treturn !p || (p->l!=this && p->r!=this);\n\t\t}\n\t};\n\tvector<Node*> v;\n\tLinkCutTree(int n){\n\t\tv.resize(n);\n\t\tfor(int i=0; i<n; i++) v[i]=new Node(mint(0), i, mint(0));\n\t}\n\tvoid toggle(Node *t){\n\t\tif(!t) return;\n\t\tswap(t->sum, t->sum2);\n\t\tswap(t->l, t->r);\n\t\tt->rev^=true;\n\t}\n\tvoid push(Node *t){\n\t\tif(!t) return;\n\t\tif(t->rev){\n\t\t\ttoggle(t->l);\n\t\t\ttoggle(t->r);\n\t\t\tt->rev=false;\n\t\t}\n\t}\n\tvoid update(Node *t){\n\t\tt->sz=t->val+t->szl, t->costs=t->cost;\n\t\tif(t->l) t->sz+=t->l->sz, t->costs+=t->l->costs;\n\t\tif(t->r) t->sz+=t->r->sz, t->costs+=t->r->costs;\n\t\tt->sum=t->suml+t->cost*t->szl;\n\t\tt->sum2=t->suml+t->cost*t->szl;\n\t\tif(t->l) t->sum+=t->l->sum, t->sum2+=t->l->sum2, t->sum+=t->l->costs*(t->val+t->szl), t->sum2+=t->l->sz*t->cost;\n\t\tif(t->r) t->sum+=t->r->sum, t->sum2+=t->r->sum2, t->sum+=t->r->sz*t->cost, t->sum2+=t->r->costs*(t->val+t->szl);\n\t\tif(t->l && t->r) t->sum+=t->l->costs*t->r->sz, t->sum2+=t->r->costs*t->l->sz;\n\t}\n\tvoid rotate(Node *t){\n\t\tNode *p=t->p, *pp=p->p, *ch;\n\t\tif(p->l==t) ch=t->r;\n\t\telse ch=t->l;\n\t\tif(pp){\n\t\t\tif(pp->l==p) pp->l=t;\n\t\t\telse if(pp->r==p) pp->r=t;\n\t\t}\n\t\tt->p=pp;\n\t\tif(p->l==t) t->r=p;\n\t\telse t->l=p;\n\t\tp->p=t;\n\t\tif(p->l==t) p->l=ch;\n\t\telse p->r=ch;\n\t\tif(ch) ch->p=p;\n\t\tupdate(p);\n\t\tupdate(t);\n\t}\n\tint state(Node *t){\n\t\tif(t->is_root()) return 0;\n\t\telse if(t->p->l==t) return 1;\n\t\telse return -1;\n\t}\n\tvoid splay(Node *t){\n\t\tpush(t);\n\t\twhile(state(t)){\n\t\t\tif(!state(t->p)){\n\t\t\t\tpush(t->p); push(t);\n\t\t\t\trotate(t);\n\t\t\t}else{\n\t\t\t\tpush(t->p->p); push(t->p); push(t);\n\t\t\t\tif(state(t->p)==state(t)){\n\t\t\t\t\trotate(t->p);\n\t\t\t\t\trotate(t);\n\t\t\t\t}else{\n\t\t\t\t\trotate(t);\n\t\t\t\t\trotate(t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tNode *expose(Node *t){\n\t\tNode *rp=nullptr;\n\t\tfor(Node *now=t; now; now=now->p){\n\t\t\tsplay(now);\n\t\t\tif(rp){\n\t\t\t\tnow->szl-=rp->sz;\n\t\t\t\tnow->suml-=rp->sum;\n\t\t\t}\n\t\t\tif(now->r){\n\t\t\t\tnow->szl+=now->r->sz;\n\t\t\t\tnow->suml+=now->r->sum;\n\t\t\t}\n\t\t\tnow->r=rp;\n\t\t\tupdate(now);\n\t\t\trp=now;\n\t\t}\n\t\tsplay(t);\n\t\treturn rp;\n\t}\n\tvoid link(Node *c, Node *p){\n\t\texpose(c);\n\t\texpose(p);\n\t\tp->r=c;\n\t\tc->p=p;\n\t\tupdate(p);\n\t}\n\tvoid cut(Node *c){\n\t\texpose(c);\n\t\tc->l->p=nullptr;\n\t\tc->l=nullptr;\n\t\tupdate(c);\n\t}\n\tvoid evert(Node *t){\n\t\texpose(t);\n\t\ttoggle(t);\n\t\tpush(t);\n\t}\n};\nint main()\n{\n\tint n; cin>>n;\n\tLinkCutTree lct(n);\n\tusing node=LinkCutTree::Node;\n\tfor(int i=0; i<n; i++){\n\t\tint v; cin>>v;\n\t\tlct.v[i]->val=mint(v);\n\t}\n\tint a[200020], b[200020];\n for(int i=0; i<n-1; i++){\n int w;\n\t\tcin>>a[i]>>b[i]>>w;\n a[i]--; b[i]--;\n node *e=new node(mint(0), i+n, mint(w));\n lct.v.push_back(e);\n\t\tlct.link(e, lct.v[a[i]]);\n\t\tlct.evert(e);\n\t\tlct.link(e, lct.v[b[i]]);\n }\n\tmint sum(0), sv(0);\n\tfor(int i=0; i<n; i++){\n\t\tsv+=lct.v[i]->val;\n\t\tlct.evert(lct.v[i]);\n\t\tsum+=lct.v[i]->val*lct.v[i]->sum;\n\t}\n\tsum/=mint(2);\n\tprintf(\"%d\\n\", sum.x);\n\tint q; cin>>q;\n while(q--){\n int t, c, x; cin>>t>>c>>x;\n\t\tc--;\n if(t==1){\n\t\t\tlct.evert(lct.v[c]);\n\t\t\tsum+=mint(x)*lct.v[c]->sum;\n\t\t\tlct.v[c]->val+=mint(x);\n\t\t\tsv+=mint(x);\n }else{\n\t\t\tlct.evert(lct.v[a[c]]);\n\t\t\tlct.cut(lct.v[c+n]);\n\t\t\tmint sl=lct.v[a[c]]->sz;\n\t\t\tlct.v[c+n]->cost+=mint(x);\n\t\t\tlct.link(lct.v[c+n], lct.v[a[c]]);\n sum+=sl*(sv-sl)*mint(x);\n }\n\t\tprintf(\"%d\\n\", sum.x);\n }\n\treturn 0;\n}","accuracy":1,"time_ms":1140,"memory_kb":39164,"score_of_the_acc":-0.7797,"final_rank":5},{"submission_id":"aoj_3179_4849134","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using vvec = vec<vec<T>>;\n\nconstexpr ll mod = 998244353;\nstruct mint {\n ll x;\n mint(ll x=0):x((x%mod+mod)%mod){}\n \n friend ostream &operator<<(ostream& os,const mint& a){\n return os << a.x;\n }\n\n friend istream &operator>>(istream& is,mint& a){\n ll t;\n is >> t;\n a = mint(t);\n return (is);\n }\n\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) {\n (x *= a.x) %= mod;\n return *this;\n }\n mint operator+(const mint a) const {\n mint res(*this);\n return res+=a;\n }\n mint operator-(const mint a) const {\n mint res(*this);\n return res-=a;\n }\n mint operator*(const mint a) const {\n mint res(*this);\n return res*=a;\n }\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n // for prime mod\n mint inv() const {\n return pow(mod-2);\n }\n mint& operator/=(const mint a) {\n return (*this) *= a.inv();\n }\n mint operator/(const mint a) const {\n mint res(*this);\n return res/=a;\n }\n bool operator==(const mint& a)const{\n return x==a.x;\n }\n};\n\n\ntemplate<typename Monoid,typename OperatorMonoid,typename F,typename G,typename H>\nclass LazySegmentTree {\nprivate:\n int sz,height;\n vec<Monoid> data;\n vec<OperatorMonoid> lazy;\n const F op;\n const G homo;\n const H comp;\n const Monoid e;\n const OperatorMonoid Oe;\npublic:\n LazySegmentTree(int n,const F op,const G homo,const H comp,\n const Monoid &e,const OperatorMonoid Oe)\n : op(op),homo(homo),comp(comp),e(e),Oe(Oe) {\n sz = 1;\n height = 0;\n while(sz<=n) sz <<= 1,height++;\n data.assign(2*sz,e);\n lazy.assign(2*sz,Oe);\n }\n\n void set(int k,const Monoid &x) {\n data[k+sz] = x;\n }\n\n void build() {\n for(int k=sz-1;k>0;k--) {\n data[k] = op(data[2*k], data[2*k+1]);\n }\n }\n\n inline void propagate(int k) {\n if(lazy[k]!=Oe) {\n lazy[2*k] = comp(lazy[2*k], lazy[k]);\n lazy[2*k+1] = comp(lazy[2*k+1], lazy[k]);\n data[k] = reflect(k);\n lazy[k] = Oe;\n }\n }\n\n inline Monoid reflect(int k) {\n return lazy[k] == Oe? data[k]:homo(data[k],lazy[k]);\n }\n\n inline void recalc(int k) {\n while(k>>=1) data[k] = op(reflect(2*k), reflect(2*k+1));\n }\n\n inline void thrust(int k) {\n for(int i=height;i>0;i--) propagate(k>>i);\n }\n\n void update(int a, int b, const OperatorMonoid &x) {\n thrust(a+=sz);\n thrust(b+=sz-1);\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) lazy[l] = comp(lazy[l],x),++l;\n if(r&1) --r, lazy[r] = comp(lazy[r],x);\n }\n recalc(a);\n recalc(b);\n }\n\n Monoid query(int a, int b) {\n thrust(a+=sz);\n thrust(b+=sz-1);\n Monoid L = e, R = e;\n for(int l=a, r=b+1;l<r;l>>= 1,r>>=1) {\n if(l&1) L = op(L,reflect(l++));\n if(r&1) R = op(reflect(--r),R);\n }\n return op(L,R);\n }\n\n Monoid operator[](const int &k) {\n return query(k,k+1);\n }\n};\n\nstruct edge{\n int to,id;\n ll dist;\n edge(int to,ll dist=1,int id=1):to(to),id(id),dist(dist){};\n};\n\nclass HeavLightDecomposition{\nprivate:\n vvec<edge> g;\n vec<int> sz,in,out,head,par,depth;\n int pos;\n\n void dfs_sz(int cur,int p){\n sz[cur] = 1;\n par[cur] = p;\n for(auto& e:g[cur]) if(e.to!=p){\n depth[e.to] = depth[cur]+1;\n dfs_sz(e.to,cur);\n sz[cur] += sz[e.to];\n if(sz[e.to]>sz[g[cur][0].to]) swap(e,g[cur][0]);\n }\n }\n\n void dfs_hld(int cur,int p){\n in[cur] = pos++;\n for(auto& e:g[cur]) if(e.to!=p){\n head[e.to] = (e.to==g[cur][0].to? head[cur]:e.to);\n dfs_hld(e.to,cur);\n }\n out[cur] = pos;\n }\npublic:\n HeavLightDecomposition(){}\n HeavLightDecomposition(int N,int root,vvec<edge> tree):\n g(tree),sz(N),in(N),out(N),head(N),par(N),depth(N){\n pos = 0;\n depth[root] = 0;\n dfs_sz(root,-1);\n dfs_hld(root,-1);\n }\n\n int lca(int u,int v){\n while(true){\n if(in[u]>in[v]) swap(u,v);\n if(head[u]==head[v]) return u;\n v = par[head[v]];\n }\n }\n\n template<class T,class G>\n void update(int u,int v,const T& x,const G& g, bool isedge=false){\n while(true){\n if(in[u]>in[v]) swap(u,v);\n if(head[u]==head[v]) break;\n g(in[head[v]],in[v]+1,x);\n v = par[head[v]];\n }\n g(in[u]+isedge,in[v]+1,x);\n }\n\n\n template<class T,class F,class Q>\n T query(int u,int v,const T &e,const F& f,const Q& q,bool isedge=false){\n T l = e,r = e;\n while(true){\n if(in[u]>in[v]){\n swap(u,v); swap(l,r);\n }\n if(head[u]==head[v]) break;\n l = f(q(in[head[v]],in[v]+1),l);\n v = par[head[v]];\n }\n //非可換演算のときは左を反転！\n //f(rev(f(q(a,b),l),r);\n return f(f(q(in[u]+isedge,in[v]+1),l),r);\n }\n\n int dep(int n){return depth[n];}\n int get_in(int n){return in[n];}\n};\n\nstruct state{\n mint e,c,cc,ec,ecc;\n int len;\n};\n\nauto op = [](state L,state R)->state{\n mint e = L.e+R.e;\n mint c = L.c+R.c;\n mint cc = L.cc+R.cc;\n mint ec = L.ec+R.ec;\n mint ecc = L.ecc+R.ecc;\n int len = L.len+R.len;\n return {e,c,cc,ec,ecc,len};\n};\n\nauto func = [](state S,pair<mint,mint> p)->state{\n mint dc = p.first,de = p.second;\n //update by dc\n S.cc += dc*dc*S.len+S.c*dc*2;\n S.c += dc*S.len;\n S.ecc += S.e*dc*dc+S.ec*dc*2;\n S.ec += S.e*dc;\n // update by de;\n S.e += de*S.len;\n S.ec += S.c*de;\n S.ecc += S.cc*de;\n return S;\n};\n\nauto comp = [](pair<mint,mint> p,pair<mint,mint> q)->pair<mint,mint>{\n return {p.first+q.first,p.second+q.second};\n};\n\nint main() {\n int N;\n cin >> N;\n mint sum = 0;\n vec<mint> V(N);\n for(auto& x:V){\n cin >> x;\n sum += x;\n }\n vvec<edge> g(N);\n vec<int> A(N-1),B(N-1);\n vec<ll> W(N-1);\n for(int i=0;i<N-1;i++){\n int a,b;\n cin >> a >> b >> W[i];\n a--; b--;\n g[a].emplace_back(b,W[i],i);\n g[b].emplace_back(a,W[i],i);\n A[i] = a,B[i] = b;\n }\n LazySegmentTree<state,pair<mint,mint>,decltype(op),decltype(func),decltype(comp)>\n seg(N,op,func,comp,(state){0,0,0,0,0,0},(pair<mint,mint>){0,0});\n HeavLightDecomposition HLD(N,0,g);\n vec<mint> c(N);\n {\n auto dfs = [&](auto&& self,int cur,int par)->void{\n c[cur] = V[cur];\n for(auto& e:g[cur]) if(e.to!=par){\n self(self,e.to,cur);\n c[cur] += c[e.to];\n }\n };\n dfs(dfs,0,-1);\n }\n\n auto make_state = [&](mint E,mint C)->state{\n mint e = E;\n mint c = C;\n mint cc = C*C;\n mint ec = E*C;\n mint ecc = E*C*C;\n int len = 1;\n return {e,c,cc,ec,ecc,len};\n };\n\n for(int i=0;i<N-1;i++){\n if(HLD.dep(A[i])>HLD.dep(B[i])) swap(A[i],B[i]);\n seg.set(HLD.get_in(B[i]),make_state(W[i],c[B[i]]));\n }\n seg.build();\n auto calc = [&]()->mint{\n state S = seg.query(0,N);\n return S.ec*sum-S.ecc;\n };\n\n auto update = [&](int l,int r,pair<mint,mint> p){\n seg.update(l,r,p);\n };\n\n int Q;\n cin >> Q;\n cout << calc() << \"\\n\";\n for(int i=0;i<Q;i++){\n int t;\n cin >> t;\n if(t==1){\n int v,x;\n cin >> v >> x;\n v--;\n HLD.update(0,v,(pair<mint,mint>){x,0},update,true);\n sum += x;\n }else if(t==2){\n int v,x;\n cin >> v >> x;\n v--;\n HLD.update(B[v],A[v],(pair<mint,mint>){0,x},update,true);\n }\n cout << calc() << \"\\n\";\n }\n}","accuracy":1,"time_ms":520,"memory_kb":102296,"score_of_the_acc":-0.9916,"final_rank":7},{"submission_id":"aoj_3179_4847412","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 998244353;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m) {\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\n\nconst int max_n = 1 << 18;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nusing mP = pair<modint, modint>;\n\nstruct BIT {\nprivate:\n\tvector<modint> node, node2; int n;\npublic:\n\tBIT(int n_) {\n\t\tn = n_; node.resize(n, 0); node2.resize(n, 0);\n\t}\n\t//0-indexed\n\tvoid add(int a, int b, modint w) {\n\t\tfor (int i = a; i < n; i |= i + 1)node[i] += (modint)-a * w;\n\t\tfor (int i = b; i < n; i |= i + 1)node[i] += (modint)b * w;\n\t\tfor (int i = a; i < n; i |= i + 1)node2[i] += w;\n\t\tfor (int i = b; i < n; i |= i + 1)node2[i] += -w;\n\t}\n\tmodint sum(int a) {\n\t\tll ret = 0;\n\t\tfor (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i];\n\t\tfor (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += (modint)a * node2[i];\n\t\treturn ret;\n\t}\n\tmodint sum(int a, int b) {\n\t\treturn sum(b) - sum(a);\n\t}\n};\n\n\nvector<mP> ori;\nstruct SegT {\nprivate:\n\tint n; vector<mP> node;\n\tvector<modint> lazy;\n\tconst mP init_c = { 0,0 };\npublic:\n\tSegT(vector<int> v) {\n\t\tint sz = v.size();\n\t\tn = 1;\n\t\twhile (n < sz)n <<= 1;\n\t\tnode.resize(2 * n - 1, init_c);\n\t\tlazy.resize(2 * n - 1, 0);\n\t\trep(i, sz) {\n\t\t\tmodint e = ori[v[i]].first;\n\t\t\tmodint c = ori[v[i]].second;\n\t\t\tnode[i + n - 1] = { e * c,e };\n\t\t}\n\t\tper(i, n - 1) {\n\t\t\tnode[i] = f(node[2 * i + 1], node[2 * i + 2]);\n\t\t}\n\t}\n\tmP f(mP a, mP b) {\n\t\treturn { a.first + b.first,a.second + b.second };\n\t}\n\tvoid eval(int k, int l, int r) {\n\t\tif (lazy[k] == (modint)0)return;\n\t\tnode[k].first += node[k].second * lazy[k];\n\t\tif (r - l > 1) {\n\t\t\tlazy[2 * k + 1] += lazy[k];\n\t\t\tlazy[2 * k + 2] += lazy[k];\n\t\t}\n\t\tlazy[k] = 0;\n\t}\n\tvoid add(modint x, int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = n;\n\t\teval(k, l, r);\n\t\tif (r <= a || b <= l)return;\n\t\tif (a <= l && r <= b) {\n\t\t\tlazy[k] += x; eval(k, l, r);\n\t\t}\n\t\telse {\n\t\t\tadd(x, a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tadd(x, a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tmP query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = n;\n\t\teval(k, l, r);\n\t\tif (r <= a || b <= l)return init_c;\n\t\tif (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tmP vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tmP vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n\tvoid update(int loc, mP x) {\n\t\tint k = 0, l = 0, r = n;\n\t\tvector<P> st;\n\t\twhile (k < n - 1) {\n\t\t\teval(k, l, r);\n\t\t\tst.push_back({ l,r });\n\t\t\tif (loc < (l + r) / 2) {\n\t\t\t\tk = 2 * k + 1;\n\t\t\t\tr = (l + r) / 2;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tk = 2 * k + 2;\n\t\t\t\tl = (l + r) / 2;\n\t\t\t}\n\t\t}\n\t\teval(k, l, r);\n\t\tst.push_back({ l,r });\n\t\tmodint e = x.first, c = x.second;\n\t\tnode[k] = { e * c,e };\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tst.pop_back();\n\t\t\tl = st.back().first, r = st.back().second;\n\t\t\teval(2 * k + 1, l, (l + r) / 2);\n\t\t\teval(2 * k + 2, (l + r) / 2, r);\n\t\t\tnode[k] = f(node[2 * k + 1], node[2 * k + 2]);\n\t\t}\n\t}\n};\n\n\nstruct edge {\n\tint to;\n};\nusing edges = vector<edge>;\nusing Graph = vector<edges>;\nstruct HLDecomposition {\n\tstruct Chain {\n\t\tint depth;\n\t\tP parent;//chain number,index\n\t\tvector<P> child;//child chain number,parent index\n\t\tvector<int> mapfrom;\n\t\tSegT stree;\n\n\t\t//Chain() { ; }\n\t\tChain(vector<int> seq) :stree(seq) { ; }\n\t};\n\tGraph baseG;\n\tvector<Chain> chains;\n\tvector<P> mapto;//raw index->chain number &index\n\tvector<vector<int>> mapfrom;//chain number & index ->raw index\n\n\tHLDecomposition() { ; }\n\tHLDecomposition(const Graph& g) {\n\t\tbaseG = g;\n\t\tconst int n = baseG.size();\n\t\tmapto = vector<P>(n, P{ -1,-1 });\n\t\tmapfrom.clear();\n\t\tvector<int> sz(n, 0);\n\t\tint start = 0;\n\t\t//assert(start != -1);\n\t\tsize_check_bfs(start, sz);\n\t\tdecomposition(start, start, 0, 0, 0, sz);\n\t}\n\tint depth(int t) {\n\t\treturn chains[mapto[t].first].depth;\n\t}\n\nprivate:\n\tvoid size_check_bfs(int start, vector<int>& sz) {\n\t\tconst int n = baseG.size();\n\t\tqueue<P> que;\n\t\tque.push({ start,start });\n\t\tint cnt = 0; vector<int> ord(n, -1);\n\t\twhile (!que.empty()) {\n\t\t\tint from, parent;\n\t\t\ttie(from, parent) = que.front(); que.pop();\n\t\t\tord[cnt++] = from;\n\t\t\tfor (edge e : baseG[from]) {\n\t\t\t\tif (e.to == parent)continue;\n\t\t\t\tque.push({ e.to,from });\n\t\t\t}\n\t\t}\n\t\t//assert(cnt == n);\n\t\treverse(all(ord));\n\t\trep(i, n) {\n\t\t\tint from = ord[i];\n\t\t\tsz[from] = 1; for (edge e : baseG[from])sz[from] += sz[e.to];\n\t\t}\n\t}\n\tint decomposition(int from, int parent, int depth, int pnumber, int pindex, const vector<int>& sz) {\n\t\tvector<int> seq;\n\t\tbfs(from, parent, seq, sz);\n\t\tconst int c = chains.size();\n\t\tchains.push_back(Chain(seq));\n\t\t//chains.push_back(Chain());\n\t\tchains[c].depth = depth;\n\t\tchains[c].parent = { pnumber,pindex };\n\t\trep(i, seq.size()) {\n\t\t\tmapto[seq[i]] = { c,i };\n\t\t\tchains[c].mapfrom.push_back(seq[i]);\n\t\t}\n\t\tmapfrom.push_back(chains[c].mapfrom);\n\t\trep(i, seq.size()) {\n\t\t\tfor (edge e : baseG[seq[i]]) {\n\t\t\t\tif (mapto[e.to].first != -1)continue;\n\t\t\t\tint nc = decomposition(e.to, seq[i], depth + 1, c, i, sz);\n\t\t\t\tchains[c].child.push_back({ nc,i });\n\t\t\t}\n\t\t}\n\t\treturn c;\n\t}\n\tvoid bfs(int from, int parent, vector<int>& seq, const vector<int>& sz) {\n\t\tfor (;;) {\n\t\t\tseq.push_back(from);\n\t\t\tint best = -1, next = -1;\n\t\t\tfor (edge e : baseG[from]) {\n\t\t\t\tif (e.to == parent)continue;\n\t\t\t\tif (best < sz[e.to]) {\n\t\t\t\t\tbest = sz[e.to]; next = e.to;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (next == -1)break;\n\t\t\tparent = from; from = next;\n\t\t}\n\t}\n\tvector<pair<int, P>> all_edge(int u, int v) {\n\t\tvector<pair<int, P>> res;\n\t\tif (depth(u) > depth(v))swap(u, v);\n\t\twhile (depth(v) > depth(u)) {\n\t\t\tres.push_back({ mapto[v].first,{ 0,mapto[v].second + 1 } });\n\t\t\tP par = chains[mapto[v].first].parent;\n\t\t\tv = mapfrom[par.first][par.second];\n\t\t}\n\t\twhile (mapto[v].first != mapto[u].first) {\n\t\t\tres.push_back({ mapto[v].first,{ 0,mapto[v].second + 1 } });\n\t\t\tP par = chains[mapto[v].first].parent;\n\t\t\tv = mapfrom[par.first][par.second];\n\t\t\tres.push_back({ mapto[u].first,{ 0,mapto[u].second + 1 } });\n\t\t\tpar = chains[mapto[u].first].parent;\n\t\t\tu = mapfrom[par.first][par.second];\n\t\t}\n\t\tP p = minmax(mapto[v].second, mapto[u].second);\n\t\tres.push_back({ mapto[v].first,{ p.first + 1,p.second + 1 } });\n\t\treturn res;\n\t}\n\npublic:\n\n\tvoid edge_add(int u, int v, int a) {\n\t\tvector<pair<int, P>> es = all_edge(u, v);\n\t\trep(i, es.size()) {\n\t\t\tint id = es[i].first;\n\t\t\tint l = es[i].second.first; int r = es[i].second.second;\n\t\t\tchains[id].stree.add(a, l, r);\n\t\t}\n\t}\n\tvoid edge_update(int u, mP a) {\n\t\tchains[mapto[u].first].stree.update(mapto[u].second, a);\n\t}\n\tmodint edge_sum(int u, int v) {\n\t\tvector<pair<int, P>> es = all_edge(u, v);\n\t\tmodint res = 0;\n\t\trep(i, es.size()) {\n\t\t\tint id = es[i].first;\n\t\t\tint l = es[i].second.first; int r = es[i].second.second;\n\t\t\tres += chains[id].stree.query(l, r).first;\n\t\t}\n\t\treturn res;\n\t}\n\n\n};\n\nstruct edge2 {\n\tint to; modint cost; int id;\n};\nvector<vector<edge2>> G;\nvoid solve() {\n\tint n; cin >> n; G.resize(n); ori.resize(n);\n\tvector<ll> v(n);\n\trep(i, n)cin >> v[i];\n\tvector<modint> costs(n);\n\trep(i, n - 1) {\n\t\tint a, b, c; cin >> a >> b >> c; a--; b--;\n\t\tG[a].push_back({ b,c,i });\n\t\tG[b].push_back({ a,c,i });\n\t}\n\tvector<int> trans(n);\n\tvector<int> ri(n);\n\n\tvector<int> edgeloc(n - 1);\n\n\tBIT fromcost(n);\n\tBIT vsum(n);\n\n\tGraph g(n);\n\n\tmodint ans = 0;\n\tmodint al = 0; rep(i, n)al += v[i];\n\tint tmp = 0;\n\tfunction<void(int, int)> dfs = [&](int id, int fr) {\n\t\ttrans[id] = tmp; tmp++;\n\t\tfor (edge2 e : G[id])if (e.to != fr) {\n\t\t\tdfs(e.to, id);\n\t\t\tedgeloc[e.id] = trans[e.to];\n\t\t\tcosts[trans[e.to]] = e.cost;\n\n\t\t\tfromcost.add(trans[e.to], ri[trans[e.to]], e.cost);\n\n\t\t\tg[trans[id]].push_back({ trans[e.to] });\n\t\t\tg[trans[e.to]].push_back({ trans[id] });\n\n\t\t\tmodint tosum = vsum.sum(trans[e.to], ri[trans[e.to]]);\n\t\t\tori[trans[e.to]] = { e.cost,tosum };\n\t\t\tans += e.cost * tosum * (al - tosum);\n\t\t}\n\t\tvsum.add(trans[id], trans[id] + 1, v[id]);\n\t\tri[trans[id]] = tmp;\n\t};\n\tdfs(0, -1);\n\n\tHLDecomposition hld(g);\n\n\tmodint fromsum = 0;\n\trep(i, n) {\n\t\tfromsum += fromcost.sum(trans[i], trans[i] + 1) * (modint)v[i];\n\t}\n\n\t//infolist\n\t//hld.add:v\n\t//hld.update:e\n\t//fromcost:e\n\t//fromsum:e,v\n\t//vsum:v\n\t//al :v\n\t//costs:e\n\tcout << ans << \"\\n\";\n\tint q; cin >> q;\n\trep(i, q) {\n\t\tint t; cin >> t;\n\t\tif (t == 1) {\n\t\t\tint a; modint x; ll in; cin >> a >> in; a--; x = in;\n\t\t\ta = trans[a];\n\n\t\t\t//update answer\n\t\t\tmodint d = fromcost.sum(a, a + 1);\n\t\t\tans += d * x * al;\n\t\t\tans += x * fromsum;\n\t\t\tans -= (modint)2 * x * hld.edge_sum(0, a);\n\n\t\t\t//update info\n\t\t\thld.edge_add(0, a, x);\n\t\t\tfromsum += d * x;\n\t\t\tvsum.add(a, a + 1, x);\n\t\t\tal += x;\n\t\t}\n\t\telse if (t == 2) {\n\t\t\tint a; modint x; ll in; cin >> a >> in; a--; x = in;\n\t\t\ta = edgeloc[a];\n\n\t\t\t//update answer\n\t\t\tmodint b = vsum.sum(a, ri[a]);\n\t\t\tans += (al - b) * b * x;\n\n\t\t\t//update info\n\t\t\tcosts[a] += x;\n\t\t\thld.edge_update(a, { costs[a],b });\n\t\t\tfromcost.add(a, ri[a], x);\n\t\t\tfromsum += x * b;\n\t\t}\n\t\tcout << ans << \"\\n\";\n\t}\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(15);\n\t//init_f();\n\t//expr();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":320,"memory_kb":124784,"score_of_the_acc":-1.0847,"final_rank":8},{"submission_id":"aoj_3179_4846550","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 998244353;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <u32 M>\nstruct modint {\n u32 val;\npublic:\n static modint raw(int v) { modint x; x.val = v; return x; }\n modint() : val(0) {}\n template <class T>\n modint(T v) { ll x = (ll)(v%(ll)(M)); if (x < 0) x += M; val = u32(x); }\n modint(bool v) { val = ((unsigned int)(v) % M); }\n modint& operator++() { val++; if (val == M) val = 0; return *this; }\n modint& operator--() { if (val == 0) val = M; val--; return *this; }\n modint operator++(int) { modint result = *this; ++*this; return result; }\n modint operator--(int) { modint result = *this; --*this; return result; }\n modint& operator+=(const modint& b) { val += b.val; if (val >= M) val -= M; return *this; }\n modint& operator-=(const modint& b) { val -= b.val; if (val >= M) val += M; return *this; }\n modint& operator*=(const modint& b) { u64 z = val; z *= b.val; val = (u32)(z % M); return *this; }\n modint& operator/=(const modint& b) { return *this = *this * b.inv(); }\n modint operator+() const { return *this; }\n modint operator-() const { return modint() - *this; }\n modint pow(long long n) const { modint x = *this, r = 1; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }\n modint inv() const { return pow(M-2); }\n friend modint operator+(const modint& a, const modint& b) { return modint(a) += b; }\n friend modint operator-(const modint& a, const modint& b) { return modint(a) -= b; }\n friend modint operator*(const modint& a, const modint& b) { return modint(a) *= b; }\n friend modint operator/(const modint& a, const modint& b) { return modint(a) /= b; }\n friend bool operator==(const modint& a, const modint& b) { return a.val == b.val; }\n friend bool operator!=(const modint& a, const modint& b) { return a.val != b.val; }\n};\nusing mint = modint<MOD>;\n\nclass HeavyLightDecomposition {\n void dfs_sz(int v){\n for (auto &&u : G[v]) {\n if(u == par[v]) continue;\n par[u] = v; dep[u] = dep[v] + 1;\n dfs_sz(u);\n sub_size[v] += sub_size[u];\n if(sub_size[u] > sub_size[G[v][0]]) swap(u, G[v][0]);\n }\n }\n\n void dfs_hld(int v, int c, int &pos){\n id[v] = pos++;\n id_inv[id[v]]= v;\n tree_id[v] = c;\n for (auto &&u : G[v]) {\n if(u == par[v]) continue;\n head[u] = (u == G[v][0] ? head[v] : u);\n dfs_hld(u, c, pos);\n }\n }\n\npublic:\n int n;\n vector<vector<int>> G;\n vector<int> par, dep, sub_size, id, id_inv, tree_id, head;\n explicit HeavyLightDecomposition(int n) : n(n), G(n), par(n), dep(n), sub_size(n, 1),\n id(n), id_inv(n), tree_id(n), head(n){}\n explicit HeavyLightDecomposition(vector<vector<int>> &G) :\n G(G), n(G.size()), par(n), dep(n) , sub_size(n, 1), id(n), id_inv(n), tree_id(n), head(n) {}\n\n void add_edge(int u, int v){\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n }\n\n void build(vector<int> roots = {0}){\n int c = 0, pos = 0;\n for (auto &&i : roots) {\n dfs_sz(i);\n head[i] = i;\n dfs_hld(i, c++, pos);\n }\n }\n\n int lca(int u, int v){\n while(true){\n if(id[u] > id[v]) swap(u, v);\n if(head[u] == head[v]) return u;\n v = par[head[v]];\n }\n }\n\n int distance(int u, int v){\n return dep[u] + dep[v] - 2*dep[lca(u, v)];\n }\n\n\n template<typename F>\n void query(int u, int v, const F &f){\n while(true){\n if(id[u] > id[v]) swap(u, v);\n f(max(id[head[v]], id[u]), id[v]+1);\n if(head[u] == head[v]) break;\n v = par[head[v]];\n }\n }\n\n template<typename F>\n void query_edge(int u, int v, const F &f){\n while(true){\n if(id[u] > id[v]) swap(u, v);\n if(head[u] != head[v]) {\n f(id[head[v]], id[v]+1);\n v = par[head[v]];\n }else {\n if(u != v) f(id[u]+1, id[v]+1);\n break;\n }\n }\n }\n\n template<typename T, typename Q, typename F>\n T query(int u, int v, const T &e, const Q &q, const F &f){\n T l = e, r = e;\n while(true){\n if(id[u] > id[v]) swap(u, v), swap(l, r);\n l = f(l, q(max(id[head[v]], id[u]), id[v]+1));\n if(head[u] != head[v]) v = par[head[v]];\n else break;\n }\n return f(l, r);\n }\n\n};\n\ntemplate <class M>\nstruct LazySegmentTree{\n using T = typename M::T;\n using L = typename M::L;\n int sz, n, height{};\n vector<T> seg; vector<L> lazy;\n explicit LazySegmentTree(int n) : n(n) {\n sz = 1; while(sz < n) sz <<= 1, height++;\n seg.assign(2*sz, M::e());\n lazy.assign(2*sz, M::l());\n }\n\n void set(int k, const T &x){ seg[k + sz] = x; }\n\n void build(){\n for (int i = sz-1; i > 0; --i) seg[i] = M::f(seg[i<<1], seg[(i<<1)|1]);\n }\n\n T reflect(int k){ return lazy[k] == M::l() ? seg[k] : M::g(seg[k], lazy[k]); }\n\n void eval(int k){\n if(lazy[k] == M::l()) return;\n if(k < sz){\n lazy[(k<<1)|0] = M::h(lazy[(k<<1)|0], lazy[k]);\n lazy[(k<<1)|1] = M::h(lazy[(k<<1)|1], lazy[k]);\n }\n seg[k] = reflect(k);\n lazy[k] = M::l();\n }\n void thrust(int k){ for (int i = height; i; --i) eval(k>>i); }\n void recalc(int k) { while(k >>= 1) seg[k] = M::f(reflect((k<<1)|0), reflect((k<<1)|1));}\n\n void update(int a, const T &x){\n thrust(a += sz);\n seg[a] = x;\n recalc(a);\n }\n\n void update(int a, int b, const L &x){\n thrust(a += sz); thrust(b += sz-1);\n for (int l = a, r = b+1;l < r; l >>=1, r >>= 1) {\n if(l&1) lazy[l] = M::h(lazy[l], x), l++;\n if(r&1) --r, lazy[r] = M::h(lazy[r], x);\n }\n recalc(a);\n recalc(b);\n }\n\n T query(int a, int b){ // [l, r)\n thrust(a += sz);\n thrust(b += sz-1);\n T ll = M::e(), rr = M::e();\n for(int l = a, r = b+1; l < r; l >>=1, r>>=1) {\n if (l & 1) ll = M::f(ll, reflect(l++));\n if (r & 1) rr = M::f(reflect(--r), rr);\n }\n return M::f(ll, rr);\n }\n\n template<class F>\n int search_right(int l, F cond){\n if(l == n) return n;\n thrust(l += sz);\n T val = M::e();\n do {\n while(!(l&1)) l >>= 1;\n if(!cond(M::f(val, seg[l]))){\n while(l < sz) {\n eval(l); l <<= 1;\n if (cond(M::f(val, reflect(l)))){\n val = M::f(val, reflect(l++));\n }\n }\n return l - sz;\n }\n val = M::f(val, reflect(l++));\n } while((l & -l) != l);\n return n;\n }\n\n template<class F>\n int search_left(int r, F cond){\n if(r <= 0) return 0;\n thrust((r += sz)-1);\n T val = M::e();\n do {\n r--;\n while(r > 1 && r&1) r >>= 1;\n if(!cond(M::f(reflect(r), val))){\n while(r < sz) {\n eval(r);\n r = ((r << 1)|1);\n if (cond(M::f(reflect(r), val))){\n val = M::f(reflect(r--), val);\n }\n }\n return r + 1 - sz;\n }\n val = M::f(reflect(r), val);\n } while((r & -r) != r);\n return 0;\n }\n};\n\nstruct Monoid{\n\n using T = array<mint, 6>; // len, x, y, xy, y^2, xy^2\n using L = array<mint, 2>; // dx, dy;\n static T f(T a, T b) {\n T ret{};\n for (int i = 0; i < 6; ++i) ret[i] = a[i]+b[i];\n return ret;\n }\n static T g(T a, L b) {\n T ret = {\n a[0],\n a[1]+b[0],\n a[2]+b[1],\n a[3] + a[1]*b[1] + a[2]*b[0] + b[0]*b[1]*a[0],\n a[4] + a[2]*b[1]*2 + b[1]*b[1]*a[0],\n a[5] + b[1]*(b[1]*(a[0]*b[0]+a[1])+(b[0]*a[2]+a[3])*2) + b[0]*a[4]\n };\n return ret;\n }\n static L h(L a, L b) {\n return {a[0]+b[0], a[1]+b[1]};\n }\n static T e() { return {}; }\n static L l() { return {}; }\n};\n\nint main() {\n int n;\n cin >> n;\n mint s = 0;\n vector<int> v(n);\n for (auto &&i : v) scanf(\"%d\", &i), s += i;\n HeavyLightDecomposition hld(n);\n vector<int> a(n-1), b(n-1), w(n-1);\n vector<vector<pair<int, int>>> G(n);\n for (int i = 0; i < n-1; ++i) {\n cin >> a[i] >> b[i] >> w[i];\n a[i]--; b[i]--;\n hld.add_edge(a[i], b[i]);\n G[a[i]].emplace_back(b[i], i*2);\n G[b[i]].emplace_back(a[i], i*2+1);\n }\n vector<int> to(n-1); // どの頂点に辺を任せるか\n hld.build();\n vector<mint> dp(n);\n for (int i = 0; i < n; ++i) dp[i] = v[i];\n LazySegmentTree<Monoid> seg(n);\n auto dfs = [&](int x, int par, auto &&f) -> void {\n for (auto &&i : G[x]) {\n if(i.first != par){\n to[i.second/2] = i.first;\n f(i.first, x, f);\n dp[x] += dp[i.first];\n seg.set(hld.id[i.first], {1, w[i.second/2], dp[i.first], w[i.second/2]*dp[i.first], dp[i.first]*dp[i.first],w[i.second/2]*dp[i.first]*dp[i.first]});\n }\n }\n };\n dfs(0, -1, dfs);\n seg.build();\n int q;\n cin >> q;\n auto ans = [&](){\n auto res = seg.query(0, n);\n printf(\"%d\\n\", (s*res[3]-res[5]).val);\n };\n ans();\n while(q--){\n int t, x, y;\n scanf(\"%d %d %d\", &t, &x, &y);\n x--;\n if(t == 2){\n seg.update(hld.id[to[x]], hld.id[to[x]]+1, {y, 0});\n }else {\n s += y;\n hld.query_edge(0, x, [&](int l, int r){ seg.update(l, r, {0, y}); });\n }\n ans();\n }\n return 0;\n}","accuracy":1,"time_ms":570,"memory_kb":59652,"score_of_the_acc":-0.5359,"final_rank":3},{"submission_id":"aoj_3179_4845769","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define int ll\n\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,b) rng(i,0,b)\n#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)\n#define per(i,b) gnr(i,0,b)\n#define pb push_back\n#define eb emplace_back\n#define a first\n#define b second\n#define bg begin()\n#define ed end()\n#define all(x) x.bg,x.ed\n#define si(x) int(x.size())\n#ifdef LOCAL\n#define dmp(x) cerr<<__LINE__<<\" \"<<#x<<\" \"<<x<<endl\n#else\n#define dmp(x) void(0)\n#endif\n\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\n\ntemplate<class t> using vc=vector<t>;\ntemplate<class t> using vvc=vc<vc<t>>;\n\nusing pi=pair<int,int>;\nusing vi=vc<int>;\n\ntemplate<class t,class u>\nostream& operator<<(ostream& os,const pair<t,u>& p){\n\treturn os<<\"{\"<<p.a<<\",\"<<p.b<<\"}\";\n}\n\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\n\tos<<\"{\";\n\tfor(auto e:v)os<<e<<\",\";\n\treturn os<<\"}\";\n}\n\n#define mp make_pair\n#define mt make_tuple\n#define one(x) memset(x,-1,sizeof(x))\n#define zero(x) memset(x,0,sizeof(x))\n#ifdef LOCAL\nvoid dmpr(ostream&os){os<<endl;}\ntemplate<class T,class... Args>\nvoid dmpr(ostream&os,const T&t,const Args&... args){\n\tos<<t<<\" \";\n\tdmpr(os,args...);\n}\n#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)\n#else\n#define dmp2(...) void(0)\n#endif\n\nusing uint=unsigned;\nusing ull=unsigned long long;\n\ntemplate<class t,size_t n>\nostream& operator<<(ostream&os,const array<t,n>&a){\n\treturn os<<vc<t>(all(a));\n}\n\ntemplate<int i,class T>\nvoid print_tuple(ostream&,const T&){\n}\n\ntemplate<int i,class T,class H,class ...Args>\nvoid print_tuple(ostream&os,const T&t){\n\tif(i)os<<\",\";\n\tos<<get<i>(t);\n\tprint_tuple<i+1,T,Args...>(os,t);\n}\n\ntemplate<class ...Args>\nostream& operator<<(ostream&os,const tuple<Args...>&t){\n\tos<<\"{\";\n\tprint_tuple<0,tuple<Args...>,Args...>(os,t);\n\treturn os<<\"}\";\n}\n\ntemplate<class t>\nvoid print(t x,int suc=1){\n\tcout<<x;\n\tif(suc==1)\n\t\tcout<<\"\\n\";\n\tif(suc==2)\n\t\tcout<<\" \";\n}\n\nll read(){\n\tll i;\n\tcin>>i;\n\treturn i;\n}\n\nvi readvi(int n,int off=0){\n\tvi v(n);\n\trep(i,n)v[i]=read()+off;\n\treturn v;\n}\n\npi readpi(int off=0){\n\tint a,b;cin>>a>>b;\n\treturn pi(a+off,b+off);\n}\n\ntemplate<class T>\nvoid print(const vector<T>&v,int suc=1){\n\trep(i,v.size())\n\t\tprint(v[i],i==int(v.size())-1?suc:2);\n}\n\nstring readString(){\n\tstring s;\n\tcin>>s;\n\treturn s;\n}\n\ntemplate<class T>\nT sq(const T& t){\n\treturn t*t;\n}\n\n//#define CAPITAL\nvoid yes(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"YES\"<<\"\\n\";\n\t#else\n\tcout<<\"Yes\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\nvoid no(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"NO\"<<\"\\n\";\n\t#else\n\tcout<<\"No\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\nvoid possible(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"POSSIBLE\"<<\"\\n\";\n\t#else\n\tcout<<\"Possible\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\nvoid impossible(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"IMPOSSIBLE\"<<\"\\n\";\n\t#else\n\tcout<<\"Impossible\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\n\nconstexpr ll ten(int n){\n\treturn n==0?1:ten(n-1)*10;\n}\n\nconst ll infLL=LLONG_MAX/3;\n\n#ifdef int\nconst int inf=infLL;\n#else\nconst int inf=INT_MAX/2-100;\n#endif\n\nint topbit(signed t){\n\treturn t==0?-1:31-__builtin_clz(t);\n}\nint topbit(ll t){\n\treturn t==0?-1:63-__builtin_clzll(t);\n}\nint botbit(signed a){\n\treturn a==0?32:__builtin_ctz(a);\n}\nint botbit(ll a){\n\treturn a==0?64:__builtin_ctzll(a);\n}\nint popcount(signed t){\n\treturn __builtin_popcount(t);\n}\nint popcount(ll t){\n\treturn __builtin_popcountll(t);\n}\nbool ispow2(int i){\n\treturn i&&(i&-i)==i;\n}\nll mask(int i){\n\treturn (ll(1)<<i)-1;\n}\n\nbool inc(int a,int b,int c){\n\treturn a<=b&&b<=c;\n}\n\ntemplate<class t> void mkuni(vc<t>&v){\n\tsort(all(v));\n\tv.erase(unique(all(v)),v.ed);\n}\n\nll rand_int(ll l, ll r) { //[l, r]\n\t#ifdef LOCAL\n\tstatic mt19937_64 gen;\n\t#else\n\tstatic mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n\t#endif\n\treturn uniform_int_distribution<ll>(l, r)(gen);\n}\n\ntemplate<class t>\nvoid myshuffle(vc<t>&a){\n\trep(i,si(a))swap(a[i],a[rand_int(0,i)]);\n}\n\ntemplate<class t>\nint lwb(const vc<t>&v,const t&a){\n\treturn lower_bound(all(v),a)-v.bg;\n}\n\nvvc<int> readGraph(int n,int m){\n\tvvc<int> g(n);\n\trep(i,m){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\t//sc.read(a,b);\n\t\ta--;b--;\n\t\tg[a].pb(b);\n\t\tg[b].pb(a);\n\t}\n\treturn g;\n}\n\nvvc<int> readTree(int n){\n\treturn readGraph(n,n-1);\n}\n\nstruct modinfo{uint mod,root;};\ntemplate<modinfo const&ref>\nstruct modular{\n\tstatic constexpr uint const &mod=ref.mod;\n\tstatic modular root(){return modular(ref.root);}\n\tuint v;\n\t//modular(initializer_list<uint>ls):v(*ls.bg){}\n\tmodular(ll vv=0){s(vv%mod+mod);}\n\tmodular& s(uint vv){\n\t\tv=vv<mod?vv:vv-mod;\n\t\treturn *this;\n\t}\n\tmodular operator-()const{return modular()-*this;}\n\tmodular& operator+=(const modular&rhs){return s(v+rhs.v);}\n\tmodular&operator-=(const modular&rhs){return s(v+mod-rhs.v);}\n\tmodular&operator*=(const modular&rhs){\n\t\tv=ull(v)*rhs.v%mod;\n\t\treturn *this;\n\t}\n\tmodular&operator/=(const modular&rhs){return *this*=rhs.inv();}\n\tmodular operator+(const modular&rhs)const{return modular(*this)+=rhs;}\n\tmodular operator-(const modular&rhs)const{return modular(*this)-=rhs;}\n\tmodular operator*(const modular&rhs)const{return modular(*this)*=rhs;}\n\tmodular operator/(const modular&rhs)const{return modular(*this)/=rhs;}\n\tmodular pow(int n)const{\n\t\tmodular res(1),x(*this);\n\t\twhile(n){\n\t\t\tif(n&1)res*=x;\n\t\t\tx*=x;\n\t\t\tn>>=1;\n\t\t}\n\t\treturn res;\n\t}\n\tmodular inv()const{return pow(mod-2);}\n\t/*modular inv()const{\n\t\tint x,y;\n\t\tint g=extgcd<ll>(v,mod,x,y);\n\t\tassert(g==1);\n\t\tif(x<0)x+=mod;\n\t\treturn modular(x);\n\t}*/\n\tfriend modular operator+(int x,const modular&y){\n\t\treturn modular(x)+y;\n\t}\n\tfriend modular operator-(int x,const modular&y){\n\t\treturn modular(x)-y;\n\t}\n\tfriend modular operator*(int x,const modular&y){\n\t\treturn modular(x)*y;\n\t}\n\tfriend modular operator/(int x,const modular&y){\n\t\treturn modular(x)/y;\n\t}\n\tfriend ostream& operator<<(ostream&os,const modular&m){\n\t\treturn os<<m.v;\n\t}\n\tfriend istream& operator>>(istream&is,modular&m){\n\t\tll x;is>>x;\n\t\tm=modular(x);\n\t\treturn is;\n\t}\n\tbool operator<(const modular&r)const{return v<r.v;}\n\tbool operator==(const modular&r)const{return v==r.v;}\n\tbool operator!=(const modular&r)const{return v!=r.v;}\n\texplicit operator bool()const{\n\t\treturn v;\n\t}\n};\n\nextern constexpr modinfo base{998244353,3};\n//extern constexpr modinfo base{1000000007,0};\n//modinfo base{1,0};\nusing mint=modular<base>;\n\n//内部でグラフをいじるから in,out を使うときは注意\n//VERIFY: yosupo\n//CF530F\n//CodeChef Persistent Oak\n//AOJ GRL5C\ntemplate<class E>\nstruct HLD{\n\tvvc<E> g;\n\tint n,rt,cnt;\n\tvi sub,in,out,par,head,dep;\n\tvc<E> pare;\n\tint dfs1(int v,int p,E pe,int d){\n\t\tpar[v]=p;\n\t\tpare[v]=pe;\n\t\tdep[v]=d;\n\t\tg[v].erase(remove(all(g[v]),p),g[v].ed);\n\t\tfor(auto&e:g[v]){\n\t\t\tsub[v]+=dfs1(e,v,e,d+1);\n\t\t\tif(sub[g[v][0]]<sub[e])\n\t\t\t\tswap(g[v][0],e);\n\t\t}\n\t\treturn sub[v];\n\t}\n\tvoid dfs2(int v,int h){\n\t\tin[v]=cnt++;\n\t\thead[v]=h;\n\t\tfor(int to:g[v])\n\t\t\tdfs2(to,to==g[v][0]?h:to);\n\t\tout[v]=cnt;\n\t}\n\tHLD(){}\n\tHLD(const vvc<E>&gg,int rr):g(gg),n(g.size()),rt(rr),cnt(0),\n\t\tsub(n,1),in(n),out(n),par(n,-1),head(n),dep(n),pare(n){\n\t\tdfs1(rt,-1,E(),0);\n\t\tdfs2(rt,rt);\n\t}\n\tint lca(int a,int b){\n\t\twhile(head[a]!=head[b]){\n\t\t\tif(dep[head[a]]>dep[head[b]])\n\t\t\t\tswap(a,b);\n\t\t\tb=par[head[b]];\n\t\t}\n\t\tif(dep[a]>dep[b])\n\t\t\tswap(a,b);\n\t\treturn a;\n\t}\n\tint len(int a,int b){\n\t\treturn dep[a]+dep[b]-dep[lca(a,b)]*2;\n\t}\n\tbool asde(int a,int b){\n\t\treturn in[a]<=in[b]&&out[b]<=out[a];\n\t}\n\t//XX Opencup GP of Korea\n\t//CF625 F\n\t//2020 Multi-Uni Contest Day5 G\n\t//CF415E\n\tvi index;\n\t//vs を含む virtual tree を返す\n\t//返すのは virtual tree に使われた頂点と，辺の集合\n\t//辺の端点は，virtual tree における番号\n\t//元の木における番号を virtual tree の頂点番号に写すのが，index という変数\n\t//辺は ch->par の順\n\t//virtual tree は行き掛け順で番号がついている\n\t//特に，頂点 0 が根になるようにできている\n\tpair<vi,vc<pi>> tree_compress(vi vs){\n\t\tif(si(index)==0)index.resize(n);\n\t\tassert(index.size());\n\t\tauto comp = [&](int x,int y){\n\t\t\treturn in[x] < in[y];\n\t\t};\n\t\tsort(all(vs),comp);\n\t\tvs.erase(unique(all(vs)),vs.ed);\n\t\tint k = vs.size();\n\t\trep(i,k-1){\n\t\t\tvs.pb(lca(vs[i],vs[i+1]));\n\t\t}\n\t\tsort(all(vs),comp);\n\t\tvs.erase(unique(all(vs)),vs.ed);\n\t\tk = vs.size();\n\t\trep(i,k) index[vs[i]] = i;\n\t\tvc<pi> es;\n\t\trng(i,1,k){\n\t\t\tint p = lca(vs[i-1],vs[i]);\n\t\t\tes.eb(i,index[p]);\n\t\t}\n\t\treturn mp(vs,es);\n\t}\n};\n\n//merge で片方が inactive のときはもう片方をそのまま返す，\n//といったときに，lazy の情報までコピーして渡さないようにする\n\n//get の最後の引数は単位元と口では言いつつ・・・？\n//たとえば min で最後の引数を 0 にしても 1 とかが返ってくることはある（一敗）\n\n//VERIFY: yosupo\n//KUPC2017I\n//HDU 5306 Gorgeous Sequence\n//findmin/max CF458E\ntemplate<class N>\nstruct segbeats{\n\tvc<N> x;\n\tint s;\n\tsegbeats(){}\n\ttemplate<class T>\n\tsegbeats(const vc<T>& a){\n\t\tint n=a.size();\n\t\ts=1;\n\t\twhile(s<n)s*=2;\n\t\tx.resize(s*2);\n\t\trep(i,n)\n\t\t\tx[s+i]=N(a[i]);\n\t\tgnr(i,1,s)\n\t\t\tupd(i);\n\t}\n\tvoid push(int i){\n\t\tx[i].push(x[i*2],x[i*2+1]);\n\t}\n\tvoid upd(int i){\n\t\tx[i]=N::merge(x[i*2],x[i*2+1]);\n\t}\n\ttemplate<class F,class... Args>\n\tvoid chr(int l,int r,int i,int b,int e,F f,Args&&... args){\n\t\tif(e<=l||r<=b)\n\t\t\treturn;\n\t\tif(b<=l&&r<=e&&(x[i].*f)(forward<Args>(args)...))\n\t\t\treturn;\n\t\tpush(i);\n\t\tint m=(l+r)/2;\n\t\tchr(l,m,i*2,b,e,f,forward<Args>(args)...);\n\t\tchr(m,r,i*2+1,b,e,f,forward<Args>(args)...);\n\t\tupd(i);\n\t}\n\ttemplate<class F,class... Args>\n\tvoid ch(int b,int e,F f,Args&&... args){\n\t\tassert(b<=e);\n\t\tchr(0,s,1,b,e,f,forward<Args>(args)...);\n\t}\n\t//use decltype((declval<N>().*F())()) for old-fashioned judges\n\ttemplate<class F,class G,class H>\n\tauto getr(int l,int r,int i,int b,int e,F f,G g,H h){\n\t\tif(e<=l||r<=b)\n\t\t\treturn h;\n\t\tif(b<=l&&r<=e)\n\t\t\treturn (x[i].*f)();\n\t\tpush(i);\n\t\tint m=(l+r)/2;\n\t\treturn g(getr(l,m,i*2,b,e,f,g,h),getr(m,r,i*2+1,b,e,f,g,h));\n\t}\n\ttemplate<class F,class G,class H>\n\tauto get(int b,int e,F f,G g,H h){\n\t\tassert(b<=e);\n\t\treturn getr(0,s,1,b,e,f,g,h);\n\t}\n\tauto compositer(int l,int r,int i,int b,int e){\n\t\tif(e<=l||r<=b)assert(0);\n\t\tif(b<=l&&r<=e)\n\t\t\treturn x[i];\n\t\tpush(i);\n\t\tint m=(l+r)/2;\n\t\tif(e<=m)return compositer(l,m,i*2,b,e);\n\t\tif(m<=b)return compositer(m,r,i*2+1,b,e);\n\t\treturn N::merge(compositer(l,m,i*2,b,e),compositer(m,r,i*2+1,b,e));\n\t}\n\t//work without identity node\n\tauto composite(int b,int e){\n\t\tassert(b<e);\n\t\treturn compositer(0,s,1,b,e);\n\t}\n\tN getall(){return x[1];}\n\t//return minimum index\n\ttemplate<class F,class...Args>\n\tpair<int,N> findminr(int i,int l,int r,int b,int e,F f,Args&&...args){\n\t\tif(e<=l||r<=b)return {e,N()};\n\t\tif(b<=l&&r<=e){\n\t\t\tif(!(x[i].*f)(forward<Args>(args)...))return {e,N()};\n\t\t\tif(r-l==1)return {l,x[i]};\n\t\t}\n\t\tpush(i);\n\t\tint m=(l+r)/2;\n\t\tauto a=findminr(i*2,l,m,b,e,f,forward<Args>(args)...);\n\t\tif(a.a<e)return a;\n\t\treturn findminr(i*2+1,m,r,b,e,f,forward<Args>(args)...);\n\t}\n\ttemplate<class F,class...Args>\n\tpair<int,N> findmin(int b,int e,F f,Args&&...args){\n\t\tassert(b<=e);\n\t\treturn findminr(1,0,s,b,e,f,forward<Args>(args)...);\n\t}\n\t//return maximum index\n\ttemplate<class F,class...Args>\n\tpair<int,N> findmaxr(int i,int l,int r,int b,int e,F f,Args&&...args){\n\t\tif(e<=l||r<=b)return {b-1,N()};\n\t\tif(b<=l&&r<=e){\n\t\t\tif(!(x[i].*f)(forward<Args>(args)...))return {b-1,N()};\n\t\t\tif(r-l==1)return {l,x[i]};\n\t\t}\n\t\tpush(i);\n\t\tint m=(l+r)/2;\n\t\tauto a=findmaxr(i*2+1,m,r,b,e,f,forward<Args>(args)...);\n\t\tif(a.a>=b)return a;\n\t\treturn findmaxr(i*2,l,m,b,e,f,forward<Args>(args)...);\n\t}\n\ttemplate<class F,class...Args>\n\tpair<int,N> findmax(int b,int e,F f,Args&&...args){\n\t\tassert(b<=e);\n\t\treturn findmaxr(1,0,s,b,e,f,forward<Args>(args)...);\n\t}\n\tvoid enumerater(int l,int r,int i,int b,int e,vc<N>&dst){\n\t\tif(e<=l||r<=b)\n\t\t\treturn;\n\t\tif(l+1==r){\n\t\t\tdst.pb(x[i]);\n\t\t\treturn;\n\t\t}\n\t\tpush(i);\n\t\tint m=(l+r)/2;\n\t\tenumerater(l,m,i*2,b,e,dst);\n\t\tenumerater(m,r,i*2+1,b,e,dst);\n\t}\n\tvoid enumerate(int b,int e,vc<N>&dst){\n\t\tassert(b<=e);\n\t\treturn enumerater(0,s,1,b,e,dst);\n\t}\n\t\n\t//KUPC 2020 G\n\ttemplate<class F,class...Args>\n\tvoid enumerate_by_findr(int l,int r,int i,int b,int e,vc<pair<int,N>>&dst,F f,Args&&...args){\n\t\tif(e<=l||r<=b||!(x[i].*f)(forward<Args>(args)...))\n\t\t\treturn;\n\t\tif(l+1==r){\n\t\t\tdst.eb(l,x[i]);\n\t\t\treturn;\n\t\t}\n\t\tpush(i);\n\t\tint m=(l+r)/2;\n\t\tenumerate_by_findr(l,m,i*2,b,e,dst,f,forward<Args>(args)...);\n\t\tenumerate_by_findr(m,r,i*2+1,b,e,dst,f,forward<Args>(args)...);\n\t}\n\ttemplate<class F,class...Args>\n\tvoid enumerate_by_find(int b,int e,vc<pair<int,N>>&dst,F f,Args&&...args){\n\t\tassert(b<=e);\n\t\tenumerate_by_findr(0,s,1,b,e,dst,f,forward<Args>(args)...);\n\t}\n\tvoid prepare(int i){\n\t\tif(i/=2){\n\t\t\tprepare(i);\n\t\t\tpush(i);\n\t\t}\n\t}\n\t//point_update と lazy を組み合わせたらどうなるかは，わからない・・・\n\tvoid point_update(int i,N w){\n\t\ti+=s;\n\t\tprepare(i);\n\t\tx[i]=w;\n\t\twhile(i/=2)\n\t\t\tupd(i);\n\t}\n};\n\n//N::push\n//pushしたあとはclearする\n//N::merge\n\n//simple range max\nstruct N{\n\tmint w,sum,lz;\n\tN(mint v=0):w(v),sum(0),lz(0){}\n\tbool addw(mint v){\n\t\tw+=v;\n\t\tsum+=lz*v;\n\t\treturn true;\n\t}\n\tbool addlz(mint v){\n\t\tsum+=w*v;\n\t\tlz+=v;\n\t\treturn true;\n\t}\n\tvoid push(N&x,N&y){\n\t\tx.addlz(lz);\n\t\ty.addlz(lz);\n\t\tlz=0;\n\t}\n\tstatic N merge(N x,N y){\n\t\tN res;\n\t\tres.w=x.w+y.w;\n\t\tres.sum=x.sum+y.sum;\n\t\treturn res;\n\t}\n\tmint getsum(){\n\t\treturn sum;\n\t}\n};\n\ntemplate<class t>\nstruct BIT{\n\tvc<t> buf;\n\tint s;\n\tBIT(int n=0){init(n);}\n\tvoid init(int n){buf.assign(s=n,0);}\n\tvoid add(int i,t v){\n\t\tfor(;i<s;i+=(i+1)&(-i-1))\n\t\t\tbuf[i]+=v;\n\t}\n\tt get(int i){\n\t\tt res=0;\n\t\tfor(;i>=0;i-=(i+1)&(-i-1))\n\t\t\tres+=buf[i];\n\t\treturn res;\n\t}\n\tt sum(int b,int e){\n\t\treturn get(e-1)-get(b-1);\n\t}\n\tint kth(int k){\n\t\tint res=0;\n\t\tfor(int i=topbit(s);i>=0;i--){\n\t\t\tint w=res+(1<<i);\n\t\t\tif(w<=s&&buf[w-1]<=k){\n\t\t\t\tk-=buf[w-1];\n\t\t\t\tres=w;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\t//yukicoder No.1024\n\tint kth_helper(int k,int i){\n\t\treturn kth(k+get(i-1));\n\t}\n};\n\nstruct E{\n\tint to,idx;\n\toperator int()const{return to;}\n};\n\nsigned main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\tcout<<fixed<<setprecision(20);\n\t\n\tint n;cin>>n;\n\tvc<mint> rwv(n);\n\trep(i,n)cin>>rwv[i];\n\tvc<mint> rwe(n-1);\n\tvvc<E> t(n);\n\trep(i,n-1){\n\t\tint a,b;cin>>a>>b;\n\t\ta--;b--;\n\t\tt[a].pb({b,i});\n\t\tt[b].pb({a,i});\n\t\tmint c;cin>>c;\n\t\trwe[i]=c;\n\t}\n\tBIT<mint> cur(n),dep(n);\n\tHLD<E> hld(t,0);\n\tsegbeats<N> seg(vc<mint>(n,0));\n\tmint ans=0,sum=0,tot=0;\n\tauto add_vert=[&](int i,mint w){\n\t\tmint d=dep.get(hld.in[i]);\n\t\tmint g=0;\n\t\t{\n\t\t\tint x=i;\n\t\t\twhile(x!=-1){\n\t\t\t\tint h=hld.head[x];\n\t\t\t\tint p=hld.par[h];\n\t\t\t\tint l=hld.in[h]+(p==-1),r=hld.in[x]+1;\n\t\t\t\tif(l<r){\n\t\t\t\t\tg+=seg.get(l,r,&N::getsum,\n\t\t\t\t\t[](mint a,mint b){return a+b;},mint(0));\n\t\t\t\t}\n\t\t\t\tx=p;\n\t\t\t}\n\t\t}\n\t\tmint a=cur.sum(hld.in[i],hld.in[i]+1);\n\t\tdmp2(d,a,g,sum,tot);\n\t\tans+=(sum+tot*d-g*2)*w;\n\t\tsum+=d*w;\n\t\tcur.add(hld.in[i],w);\n\t\ttot+=w;\n\t\t{\n\t\t\tint x=i;\n\t\t\twhile(x!=-1){\n\t\t\t\tint h=hld.head[x];\n\t\t\t\tint p=hld.par[h];\n\t\t\t\tint l=hld.in[h]+(p==-1),r=hld.in[x]+1;\n\t\t\t\tif(l<r)seg.ch(l,r,&N::addlz,w);\n\t\t\t\tx=p;\n\t\t\t}\n\t\t}\n\t};\n\tvi cv(n-1);\n\trng(i,1,n)cv[hld.pare[i].idx]=i;\n\tauto add_edge=[&](int i,mint w){\n\t\tint v=cv[i],u=hld.par[v];\n\t\tmint sub=cur.sum(hld.in[v],hld.out[v]);\n\t\tdmp2(sub,tot,w);\n\t\tans+=sub*(tot-sub)*w;\n\t\tdep.add(hld.in[v],w);\n\t\tdep.add(hld.out[v],-w);\n\t\tseg.ch(hld.in[v],hld.in[v]+1,&N::addw,w);\n\t\tsum+=w*sub;\n\t};\n\trep(i,n)add_vert(i,rwv[i]);\n\tdmp(ans);\n\trep(i,n-1)add_edge(i,rwe[i]);\n\tint q;cin>>q;\n\tprint(ans);\n\trep(_,q){\n\t\tint tp;cin>>tp;\n\t\tint i;cin>>i;i--;\n\t\tmint x;cin>>x;\n\t\tif(tp==1){\n\t\t\tadd_vert(i,x);\n\t\t}else{\n\t\t\tadd_edge(i,x);\n\t\t}\n\t\tprint(ans);\n\t}\n}","accuracy":1,"time_ms":850,"memory_kb":69240,"score_of_the_acc":-0.8852,"final_rank":6},{"submission_id":"aoj_3179_4845651","code_snippet":"#include <bits/extc++.h>\n\nstruct graph {\n struct edge {\n int src, dst;\n int64_t cost;\n\n int operator-(int v) const {\n assert(v == src or v == dst);\n return src ^ dst ^ v;\n }\n };\n\n int n, m;\n std::vector<edge> edges;\n std::vector<std::vector<std::pair<int, int>>> adj;\n std::function<bool(int)> ignore;\n\n graph(int _n = 0) : n(_n), m(0), adj(n), ignore([](int) { return false; }) {}\n\n int add(const edge& e, bool directed) {\n assert(0 <= e.src), assert(e.src < n);\n assert(0 <= e.dst), assert(e.dst < n);\n edges.push_back(e);\n adj[e.src].emplace_back(m, e.dst);\n if (not directed) adj[e.dst].emplace_back(m, e.src);\n return m++;\n }\n};\n\nstruct dfs_forest : graph {\n using cost_t = decltype(edge::cost);\n\n std::vector<int> root, pv, pe, sz, depth, min_depth, last, order, in, out;\n std::vector<cost_t> dist;\n int trials;\n\n dfs_forest(int _n = 0) : graph(_n), dist(n), trials(0) {\n for (auto p : {&root, &pv, &pe, &sz, &depth, &min_depth, &last, &in, &out})\n p->assign(n, -1);\n }\n\n int add(const edge& e) { return graph::add(e, false); }\n void build(int r, bool clear_order = true) {\n assert(0 <= r), assert(r < n);\n root[r] = r, pv[r] = pe[r] = -1, depth[r] = 0, dist[r] = cost_t{};\n if (clear_order) order.clear();\n dfs(r);\n ++trials;\n }\n void build() {\n fill(begin(root), end(root), -1);\n for (int v = 0; v < n; ++v)\n if (root[v] == -1) build(v, v == 0);\n }\n int deeper(int id) const {\n assert(0 <= id), assert(id < m), assert(not ignore(id));\n int u = edges[id].src, v = edges[id].dst;\n return depth[u] < depth[v] ? v : u;\n }\n bool is_tree_edge(int id) const {\n assert(0 <= id), assert(id < m), assert(not ignore(id));\n return id == pe[deeper(id)];\n }\n bool is_ancestor(int u, int v) const {\n assert(0 <= u), assert(u < n);\n assert(0 <= v), assert(v < n);\n return in[u] <= in[v] and out[v] <= out[u];\n }\n\n private:\n void dfs(int v) {\n sz[v] = 1, min_depth[v] = depth[v], last[v] = trials;\n in[v] = size(order), order.push_back(v);\n for (auto [id, u] : adj[v]) {\n if (ignore(id) or id == pe[v]) continue;\n if (last[u] == trials) {\n min_depth[v] = std::min(min_depth[v], depth[u]);\n continue;\n }\n root[u] = root[v], pv[u] = v, pe[u] = id, depth[u] = depth[v] + 1;\n dist[u] = dist[v] + edges[id].cost;\n dfs(u);\n sz[v] += sz[u], min_depth[v] = std::min(min_depth[v], min_depth[u]);\n }\n out[v] = size(order);\n }\n};\n\nstruct hld_forest : dfs_forest {\n std::vector<int> head;\n\n hld_forest(int _n = 0) : dfs_forest(_n), head(n) {}\n\n void build_hld(int r, bool clear_order = true) {\n assert(0 <= r), assert(r < n);\n build(r, clear_order);\n order.erase(end(order) - sz[r], end(order));\n head[r] = r;\n dfs_hld(r);\n }\n void build_hld() {\n fill(begin(root), end(root), -1);\n for (int v = 0; v < n; ++v)\n if (root[v] == -1) build_hld(v, v == 0);\n }\n int lca(int u, int v) const {\n assert(0 <= u), assert(u < n);\n assert(0 <= v), assert(v < n);\n assert(root[u] == root[v]);\n while (true) {\n if (in[u] > in[v]) std::swap(u, v);\n if (head[u] == head[v]) return u;\n v = pv[head[v]];\n }\n }\n int d(int u, int v) const {\n assert(0 <= u), assert(u < n);\n assert(0 <= v), assert(v < n);\n assert(root[u] == root[v]);\n return depth[u] + depth[v] - 2 * depth[lca(u, v)];\n }\n cost_t distance(int u, int v) const {\n assert(0 <= u), assert(u < n);\n assert(0 <= v), assert(v < n);\n assert(root[u] == root[v]);\n return dist[u] + dist[v] - 2 * dist[lca(u, v)];\n }\n int la(int v, int d) const {\n assert(0 <= v), assert(v < n);\n assert(0 <= d), assert(d <= depth[v]);\n while (depth[head[v]] > d) v = pv[head[v]];\n return order[in[head[v]] + (d - depth[head[v]])];\n }\n int next(int src, int dst) const {\n assert(0 <= src), assert(src < n);\n assert(0 <= dst), assert(dst < n);\n assert(root[src] == root[dst]);\n assert(src != dst);\n if (not is_ancestor(src, dst)) return pv[src];\n return la(dst, depth[src] + 1);\n }\n int next(int src, int dst, int k) const {\n assert(0 <= src), assert(src < n);\n assert(0 <= dst), assert(dst < n);\n assert(root[src] == root[dst]);\n assert(k >= 0);\n int v = lca(src, dst);\n if (k <= depth[src] - depth[v]) return la(src, depth[src] - k);\n k -= depth[src] - depth[v];\n assert(k <= depth[dst] - depth[v]);\n return la(dst, depth[v] + k);\n }\n template <class Function>\n void apply(int src, int dst, bool vertex, Function func) const {\n assert(0 <= src), assert(src < n);\n assert(0 <= dst), assert(dst < n);\n assert(root[src] == root[dst]);\n int v = lca(src, dst);\n for (auto [a, b] : ascend(src, v)) func(a + 1, b);\n if (vertex) func(in[v], in[v] + 1);\n for (auto [a, b] : descend(v, dst)) func(a, b + 1);\n }\n\n private:\n void dfs_hld(int v) {\n in[v] = size(order), order.push_back(v);\n sort(begin(adj[v]), end(adj[v]), [&](auto a, auto b) {\n int au = a.second, bu = b.second;\n return (a.first == pe[au]) * sz[au] > (b.first == pe[bu]) * sz[bu];\n });\n for (auto [id, u] : adj[v]) {\n if (ignore(id) or id == pe[v] or not is_tree_edge(id)) continue;\n head[u] = u == adj[v][0].second ? head[v] : u;\n dfs_hld(u);\n }\n out[v] = size(order);\n }\n auto ascend(int src, int dst) const {\n std::vector<std::pair<int, int>> res;\n while (head[src] != head[dst]) {\n res.emplace_back(in[src], in[head[src]]);\n src = pv[head[src]];\n }\n if (src != dst) res.emplace_back(in[src], in[dst] + 1);\n return res;\n }\n std::vector<std::pair<int, int>> descend(int src, int dst) const {\n if (src == dst) return {};\n if (head[src] == head[dst]) return {{in[src] + 1, in[dst]}};\n auto res = descend(src, pv[head[dst]]);\n res.emplace_back(in[head[dst]], in[dst]);\n return res;\n }\n};\n\ntemplate <uint32_t Modulus>\nstruct modular {\n static_assert(int(Modulus) > 0, \"Modulus must be in the range [1, 2^31)\");\n static constexpr int modulus() { return Modulus; }\n\n modular() : v(0) {}\n modular(int64_t x) : v(x % Modulus) {\n if (int(v) < 0) v += Modulus;\n }\n\n explicit operator int() const { return v; }\n modular& operator++() { return ++v == Modulus ? v = 0 : 0, *this; }\n modular& operator--() { return --(v ? v : v = Modulus), *this; }\n modular operator+() const { return *this; }\n modular operator-() const {\n modular res;\n res.v = v ? Modulus - v : 0;\n return res;\n }\n modular& operator*=(modular b) {\n v = uint64_t(v) * b.v % Modulus;\n return *this;\n }\n modular& operator/=(modular b) {\n auto [x, gcd] = extgcd(b.v, Modulus);\n assert(gcd == 1);\n return *this *= x;\n }\n modular& operator+=(modular b) {\n v += b.v - Modulus;\n if (int(v) < 0) v += Modulus;\n return *this;\n }\n modular& operator-=(modular b) {\n v -= b.v;\n if (int(v) < 0) v += Modulus;\n return *this;\n }\n\n friend modular operator++(modular& a, int) {\n return std::exchange(a, ++modular(a));\n }\n friend modular operator--(modular& a, int) {\n return std::exchange(a, --modular(a));\n }\n friend modular operator*(modular a, modular b) { return a *= b; }\n friend modular operator/(modular a, modular b) { return a /= b; }\n friend modular operator+(modular a, modular b) { return a += b; }\n friend modular operator-(modular a, modular b) { return a -= b; }\n friend std::istream& operator>>(std::istream& is, modular& b) {\n int64_t x;\n return is >> x, b = x, is;\n }\n friend std::ostream& operator<<(std::ostream& os, modular b) {\n return os << b.v;\n }\n friend bool operator==(modular a, modular b) { return a.v == b.v; }\n friend bool operator!=(modular a, modular b) { return a.v != b.v; }\n\n private:\n static std::pair<int, int> extgcd(int a, int b) {\n std::array x{1, 0};\n while (b) {\n int q = a / b;\n std::swap(x[0] -= q * x[1], x[1]);\n std::swap(a -= q * b, b);\n }\n return {x[0], a};\n }\n\n uint32_t v;\n};\n\ntemplate <class T>\nstruct fenwick {\n fenwick() {}\n template <class Generator>\n fenwick(int n, Generator gen) : tree(n) {\n for (int i = 0; i < n; ++i) tree[i] = gen(i);\n for (int i = 0; i < n; ++i)\n if (int j = i | (i + 1); j < n) tree[j] += tree[i];\n }\n\n int size() const { return std::size(tree); }\n void add(int i, T a) {\n assert(0 <= i), assert(i < size());\n for (; i < size(); i |= i + 1) tree[i] += a;\n }\n T sum(int i) const {\n assert(0 <= i), assert(i <= size());\n T res{};\n for (; i; i &= i - 1) res += tree[i - 1];\n return res;\n }\n T sum(int l, int r) const {\n assert(0 <= l), assert(l <= r), assert(r <= size());\n return sum(r) - sum(l);\n }\n T get(int i) const {\n assert(0 <= i), assert(i < size());\n return sum(i, i + 1);\n }\n\n private:\n std::vector<T> tree;\n};\n\nstruct segment_tree_base {\n virtual int size() const = 0;\n\n protected:\n template <class F>\n void forward(int l, int r, F f) const {\n int h = h1(l += size() - 1, r += size());\n for (int s = 0; s < h; ++s)\n if (int i = l >> s; ~i & 1) f(i + 1);\n for (int s = h; s--;)\n if (int i = r >> s; i & 1) f(i - 1);\n }\n template <class F>\n void forward(int l, int r, F f) {\n const_cast<const segment_tree_base*>(this)->forward(l, r, f);\n }\n template <class F>\n void backward(int l, int r, F f) const {\n int h = h1(l += size() - 1, r += size());\n for (int s = 0; s < h; ++s)\n if (int i = r >> s; i & 1) f(i - 1);\n for (int s = h; s--;)\n if (int i = l >> s; ~i & 1) f(i + 1);\n }\n template <class F>\n void backward(int l, int r, F f) {\n const_cast<const segment_tree_base*>(this)->backward(l, r, f);\n }\n template <class F>\n void downward(int l, int r, F f) const {\n if (l == r or (l == 0 and r == size())) return;\n int h = h2(l += size(), r += size());\n for (int s = std::__lg(l); s > h; --s) f(l >> s);\n for (int s = h; s > __builtin_ctz(l); --s) f(l >> s);\n for (int s = h; s > __builtin_ctz(r); --s) f(r >> s);\n }\n template <class F>\n void downward(int l, int r, F f) {\n const_cast<const segment_tree_base*>(this)->downward(l, r, f);\n }\n template <class F>\n void upward(int l, int r, F f) const {\n if (l == r or (l == 0 and r == size())) return;\n int h = h2(l += size(), r += size());\n for (int s = __builtin_ctz(r); s++ < h;) f(r >> s);\n for (int s = __builtin_ctz(l); s++ < h;) f(l >> s);\n for (int s = h; s++ < std::__lg(l);) f(l >> s);\n }\n template <class F>\n void upward(int l, int r, F f) {\n const_cast<const segment_tree_base*>(this)->upward(l, r, f);\n }\n\n private:\n static int h1(int l, int r) {\n for (int h = 0;; ++h)\n if ((r >> h) - (l >> h) == 1) return h;\n }\n static int h2(int l, int r) {\n l <<= std::__lg(l) < std::__lg(r);\n return std::__lg(l ^ r);\n }\n};\n\ntemplate <class T, class Action>\nstruct lazy_segment_tree : segment_tree_base {\n lazy_segment_tree() {}\n template <class Generator>\n lazy_segment_tree(int n, Generator gen) : tree(2 * n), lazy(n) {\n for (int i = 0; i < n; ++i) tree[n + i] = gen(i);\n for (int i = n; i-- > 1;) pull(i);\n }\n\n int size() const override { return std::size(lazy); }\n T fold(int l, int r) {\n assert(0 <= l), assert(l <= r), assert(r <= size());\n downward(l, r, [&](int i) { push(i); });\n T res{};\n forward(l, r, [&](int i) { res = res * tree[i]; });\n return res;\n }\n T get(int i) {\n assert(0 <= i), assert(i < size());\n return fold(i, i + 1);\n }\n T fold_all_rotated() const { return size() ? tree[1] : T{}; }\n template <class Function>\n void update(int i, Function func) {\n assert(0 <= i), assert(i < size());\n downward(i, i + 1, [&](int j) { push(j); });\n tree[size() + i] = func(tree[size() + i]);\n upward(i, i + 1, [&](int j) { pull(j); });\n }\n void act(int l, int r, const Action& f) {\n assert(0 <= l), assert(l <= r), assert(r <= size());\n downward(l, r, [&](int i) { push(i); });\n forward(l, r, [&](int i) { apply(i, f); });\n upward(l, r, [&](int i) { pull(i); });\n }\n template <class Predicate>\n int forward_search(int l, int r, Predicate pred) {\n assert(0 <= l), assert(l <= r), assert(r <= size());\n downward(l, r, [&](int i) { push(i); });\n T a{};\n assert(pred(a));\n int res = r;\n forward(l, r, [&](int i) {\n if (res < r) return;\n if (T na = a * tree[i]; pred(na)) {\n a = na;\n return;\n }\n while (i < size()) {\n push(i);\n if (T na = a * tree[i *= 2]; pred(na)) a = na, ++i;\n }\n res = i - size();\n });\n return res;\n }\n template <class Predicate>\n int backward_search(int l, int r, Predicate pred) {\n assert(0 <= l), assert(l <= r), assert(r <= size());\n downward(l, r, [&](int i) { push(i); });\n T a{};\n assert(pred(a));\n int res = l - 1;\n backward(l, r, [&](int i) {\n if (res >= l) return;\n if (T na = a * tree[i]; pred(na)) {\n a = na;\n return;\n }\n while (i < size()) {\n push(i);\n if (T na = a * tree[i = 2 * i + 1]; pred(na)) a = na, --i;\n }\n res = i - size();\n });\n return res;\n }\n\n private:\n std::vector<T> tree;\n std::vector<Action> lazy;\n\n void apply(int i, const Action& f) {\n tree[i] = f(tree[i]);\n if (i < size()) lazy[i] = lazy[i] * f;\n }\n void push(int i) {\n apply(2 * i, lazy[i]), apply(2 * i + 1, lazy[i]);\n lazy[i] = Action{};\n }\n void pull(int i) { tree[i] = tree[2 * i] * tree[2 * i + 1]; }\n};\n\nusing mint = modular<998244353>;\n\nstruct node {\n mint sum, coeff;\n friend node operator*(const node& a, const node& b) {\n return {a.sum + b.sum, a.coeff + b.coeff};\n }\n};\nstruct action {\n mint v;\n node operator()(node x) const {\n x.sum += x.coeff * v;\n return x;\n }\n friend action operator*(const action& f, const action& g) {\n return {f.v + g.v};\n }\n};\n\nint main() {\n using namespace std;\n cin.tie(nullptr)->sync_with_stdio(false);\n int n;\n cin >> n;\n vector<int> initial_v(n);\n for (auto&& e : initial_v) cin >> e;\n hld_forest g(n);\n for (int _ = n - 1; _--;) {\n int u, v, w;\n cin >> u >> v >> w;\n --u, --v;\n g.add({u, v, w});\n }\n g.build_hld();\n\n fenwick<mint> fv(n, [&](int i) -> mint { return initial_v[g.order[i]]; });\n fenwick<mint> fe(\n n, [&](int i) -> mint { return i ? g.edges[g.pe[g.order[i]]].cost : 0; });\n lazy_segment_tree<node, action> seg(n, [&](int i) -> node {\n if (i == 0) return {};\n int v = g.order[i];\n int temp = g.edges[g.pe[v]].cost;\n return {fv.sum(g.in[v], g.out[v]) * temp, temp};\n });\n\n mint ans;\n for (int id = 0; id < n - 1; ++id) {\n int v = g.deeper(id);\n auto temp = fv.sum(g.in[v], g.out[v]);\n ans += g.edges[id].cost * temp * (fv.sum(n) - temp);\n }\n cout << ans << '\\n';\n\n int q;\n cin >> q;\n while (q--) {\n int type;\n cin >> type;\n if (type == 1) {\n int v, x;\n cin >> v >> x;\n --v;\n ans += seg.fold_all_rotated().sum * x;\n mint path;\n g.apply(0, v, false, [&](int l, int r) {\n if (l > r) swap(l, r);\n ans -= seg.fold(l, r).sum * x * 2;\n path += fe.sum(l, r);\n });\n ans += fv.sum(n) * path * x;\n fv.add(g.in[v], x);\n g.apply(0, v, false, [&](int l, int r) {\n if (l > r) swap(l, r);\n seg.act(l, r, {x});\n });\n } else if (type == 2) {\n int id, x;\n cin >> id >> x;\n --id;\n int v = g.deeper(id);\n auto temp = fv.sum(g.in[v], g.out[v]);\n ans += x * temp * (fv.sum(n) - temp);\n fe.add(g.in[v], x);\n seg.update(g.in[v], [&](node e) -> node {\n e.sum += temp * x;\n e.coeff += x;\n return e;\n });\n } else\n assert(false);\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":220,"memory_kb":52340,"score_of_the_acc":-0.1539,"final_rank":1},{"submission_id":"aoj_3179_4845289","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\n// const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\ntemplate< typename SUM, typename KEY >\nstruct LinkCutTreeSubtree {\n\n struct Node {\n Node *l, *r, *p;\n\n KEY key;\n SUM sum;\n\n bool rev;\n int sz;\n\n bool is_root() const {\n return !p || (p->l != this && p->r != this);\n }\n\n Node(const KEY &key, const SUM &sum) :\n key(key), sum(sum), rev(false), sz(1),\n l(nullptr), r(nullptr), p(nullptr) {}\n };\n\n const SUM ident;\n\n LinkCutTreeSubtree(const SUM &ident) : ident(ident) {}\n\n Node *make_node(const KEY &key) {\n auto ret = new Node(key, ident);\n update(ret);\n return ret;\n }\n\n Node *set_key(Node *t, const KEY &key) {\n expose(t);\n t->key = key;\n update(t);\n return t;\n }\n\n void toggle(Node *t) {\n swap(t->l, t->r);\n t->sum.toggle();\n t->rev ^= true;\n }\n\n void push(Node *t) {\n if(t->rev) {\n if(t->l) toggle(t->l);\n if(t->r) toggle(t->r);\n t->rev = false;\n }\n }\n\n\n void update(Node *t) {\n t->sz = 1;\n if(t->l) t->sz += t->l->sz;\n if(t->r) t->sz += t->r->sz;\n t->sum.merge(t->key, t->l ? t->l->sum : ident, t->r ? t->r->sum : ident);\n }\n\n void rotr(Node *t) {\n auto *x = t->p, *y = x->p;\n if((x->l = t->r)) t->r->p = x;\n t->r = x, x->p = t;\n update(x), update(t);\n if((t->p = y)) {\n if(y->l == x) y->l = t;\n if(y->r == x) y->r = t;\n update(y);\n }\n }\n\n void rotl(Node *t) {\n auto *x = t->p, *y = x->p;\n if((x->r = t->l)) t->l->p = x;\n t->l = x, x->p = t;\n update(x), update(t);\n if((t->p = y)) {\n if(y->l == x) y->l = t;\n if(y->r == x) y->r = t;\n update(y);\n }\n }\n\n\n void splay(Node *t) {\n push(t);\n while(!t->is_root()) {\n auto *q = t->p;\n if(q->is_root()) {\n push(q), push(t);\n if(q->l == t) rotr(t);\n else rotl(t);\n } else {\n auto *r = q->p;\n push(r), push(q), push(t);\n if(r->l == q) {\n if(q->l == t) rotr(q), rotr(t);\n else rotl(t), rotr(t);\n } else {\n if(q->r == t) rotl(q), rotl(t);\n else rotr(t), rotl(t);\n }\n }\n }\n }\n\n\n Node *expose(Node *t) {\n Node *rp = nullptr;\n for(auto *cur = t; cur; cur = cur->p) {\n splay(cur);\n if(cur->r) cur->sum.add(cur->r->sum);\n cur->r = rp;\n if(cur->r) cur->sum.erase(cur->r->sum);\n update(cur);\n rp = cur;\n }\n splay(t);\n return rp;\n }\n\n void link(Node *child, Node *parent) {\n expose(child);\n expose(parent);\n child->p = parent;\n parent->r = child;\n }\n\n void cut(Node *child) {\n expose(child);\n auto *parent = child->l;\n child->l = nullptr;\n parent->p = nullptr;\n update(child);\n }\n\n void evert(Node *t) {\n expose(t);\n toggle(t);\n push(t);\n }\n\n Node *lca(Node *u, Node *v) {\n if(get_root(u) != get_root(v)) return nullptr;\n expose(u);\n return expose(v);\n }\n\n\n Node *get_kth(Node *x, int k) {\n expose(x);\n while(x) {\n push(x);\n if(x->r && x->r->sz > k) {\n x = x->r;\n } else {\n if(x->r) k -= x->r->sz;\n if(k == 0) return x;\n k -= 1;\n x = x->l;\n }\n }\n return nullptr;\n }\n\n Node *get_root(Node *x) {\n expose(x);\n while(x->l) {\n push(x);\n x = x->l;\n }\n return x;\n }\n};\n\ntemplate< int mod >\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\n bool operator==(const ModInt &p) const { return x == p.x; }\n\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\n\nusing modint = ModInt< mod >;\n\n\nint main() {\n\n\n struct Sum {\n modint all, pdist, cdist, sz, mdist, msz;\n modint v_sum, m_sum;\n\n Sum() : all(0), pdist(0), cdist(0), sz(0), mdist(0), msz(0), v_sum(0), m_sum(0) {}\n\n void toggle() {\n swap(pdist, cdist);\n }\n\n void merge(int64 key, const Sum &parent, const Sum &child) {\n int64 sw = 0;\n v_sum = parent.v_sum + child.v_sum + m_sum;\n if(key < 0) {\n sw = -key;\n v_sum += sw;\n key = 0;\n }\n all = parent.all + key + child.all;\n pdist = parent.pdist + (child.all + key) * (parent.sz + sw + msz) + child.pdist + mdist;\n cdist = child.cdist + (parent.all + key) * (child.sz + sw + msz) + parent.cdist + mdist;\n sz = parent.sz + child.sz + msz + sw;\n }\n\n void add(const Sum &chsum) {\n mdist += chsum.cdist;\n msz += chsum.sz;\n m_sum += chsum.v_sum;\n }\n\n void erase(const Sum &chsum) {\n mdist -= chsum.cdist;\n msz -= chsum.sz;\n m_sum -= chsum.v_sum;\n }\n } e;\n int N;\n cin >> N;\n vector< int64 > V(N);\n cin >> V;\n using LCT = LinkCutTreeSubtree< Sum, int64 >;\n LCT lct(e);\n vector< LCT::Node * > vs(N), es(N);\n for(int i = 0; i < N; i++) {\n vs[i] = lct.make_node(-V[i]);\n }\n vector< int > S(N), T(N);\n for(int i = 0; i + 1 < N; i++) {\n int a, b, w;\n cin >> a >> b >> w;\n --a, --b;\n lct.evert(vs[a]);\n lct.evert(vs[b]);\n es[i] = lct.make_node(w);\n lct.link(vs[a], es[i]);\n lct.link(vs[b], es[i]);\n S[i] = a;\n T[i] = b;\n }\n modint all = 0;\n // v[i]を増やすとv[i]からの全点間なんとかを求めれば良い\n for(int i = 0; i < N; i++) {\n lct.evert(vs[i]);\n all += vs[i]->sum.cdist * V[i];\n }\n all /= 2;\n cout << all << \"\\n\";\n int Q;\n cin >> Q;\n while(Q--) {\n int t, a, b;\n cin >> t >> a >> b;\n --a;\n if(t == 1) {\n lct.evert(vs[a]);\n all -= vs[a]->sum.cdist * -vs[a]->key;\n vs[a]->key -= b;\n lct.update(vs[a]);\n all += vs[a]->sum.cdist * -vs[a]->key;\n } else {\n lct.evert(es[a]);\n lct.cut(vs[S[a]]);\n lct.cut(vs[T[a]]);\n modint latte = vs[S[a]]->sum.v_sum;\n modint malta = vs[T[a]]->sum.v_sum;\n all += latte * malta * b;\n es[a]->key += b;\n lct.link(vs[S[a]], es[a]);\n lct.link(vs[T[a]], es[a]);\n }\n cout << all << \"\\n\";\n }\n}","accuracy":1,"time_ms":840,"memory_kb":40580,"score_of_the_acc":-0.542,"final_rank":4},{"submission_id":"aoj_3179_4840436","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )\n#define rep(i,n) REP(i,0,n)\ntypedef long long ll;\ntypedef pair<int,int> pint;\ntypedef pair<ll,int> pli;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=998244353 ;\nint dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;\n\nstruct Node {\n ll abc,ab,ac,bc,a,b,c;\n Node(ll a,ll b, ll c):a(a),b(b),c(c) {\n ab = a * b % mod;\n ac = a * c % mod;\n bc = b * c % mod;\n abc = ab * c % mod;\n }\n};\n\nstruct Op {\n ll a, b, c;\n};\n\ntemplate<typename T, typename S>\nstruct LazySegmentTree{\n int n;\n vector<T> node;\n vector<S> lazy;\n T E0;\n S E1;\n\n inline void updatef(S& lazy,S& value){\n //lazy += value;\n lazy.a += value.a;\n if(lazy.a >= mod) lazy.a -= mod;\n lazy.b += value.b;\n if(lazy.b >= mod) lazy.b -= mod;\n lazy.c += value.c;\n if(lazy.c >= mod) lazy.c -= mod;\n //lazy = max(lazy, value);\n //lazy = min(lazy, value);\n }\n inline void calculatef(T& node,S& lazy,int len){\n //node += lazy * len; //区間sumはこっち\n // node += lazy ; //区間maxとか\n if(lazy.a) {\n node.abc = (node.abc + node.bc * lazy.a) % mod;\n node.ab = (node.ab + node.b * lazy.a) % mod;\n node.ac = (node.ac + node.c * lazy.a) % mod;\n node.a += lazy.a;\n if(node.a >= mod)node.a -= mod;\n }\n if(lazy.b) {\n node.abc = (node.abc + node.ac * lazy.b) % mod;\n node.bc = (node.bc + node.c * lazy.b) % mod;\n node.ab = (node.ab + node.a * lazy.b) % mod;\n node.b += lazy.b;\n if(node.b >= mod)node.b -= mod;\n }\n if(lazy.c) {\n node.abc = (node.abc + node.ab * lazy.c) % mod;\n node.ac = (node.ac + node.a * lazy.c) % mod;\n node.bc = (node.bc + node.b * lazy.c) % mod;\n node.c += lazy.c;\n if(node.c >= mod)node.c -= mod;\n }\n }\n inline T queryf(T& x,T& y){\n //return x + y;\n //return x * y;\n //return max(x, y);\n Node z(0,0,0);\n z.abc = x.abc + y.abc;\n if(z.abc>=mod)z.abc -= mod;\n z.ab = x.ab + y.ab;\n if(z.ab>=mod)z.ab -= mod;\n z.ac = x.ac + y.ac;\n if(z.ac>=mod)z.ac -= mod;\n z.bc = x.bc + y.bc;\n if(z.bc>=mod)z.bc -= mod;\n z.a = x.a + y.a;\n if(z.a>=mod)z.a -= mod;\n z.b = x.b + y.b;\n if(z.b>=mod)z.b -= mod;\n z.c = x.c + y.c;\n if(z.c>=mod)z.c -= mod;\n return z;\n }\npublic:\n LazySegmentTree(int sz,T nodeE,S lazyE ):E0(nodeE), E1(lazyE){\n n=1;\n while(n<sz)n<<=1;\n node.resize(2*n-1,E0);\n lazy.resize(2*n-1,E1);\n }\n\n LazySegmentTree(vector<T>& v,T E0,S E1 ):E0(E0),E1(E1){\n n=1;\n int sz=v.size();\n while(n<sz)n<<=1;\n node.resize(2*n-1,E0);\n lazy.resize(2*n-1,E1);\n rep(i,sz)node[i+n-1] = v[i];\n for(int i=n-2; i>=0; --i){\n node[i] = queryf(node[2*i+1],node[2*i+2]);\n }\n }\n\n void eval(int k,int l,int r){\n if(!lazy[k].a && !lazy[k].b && !lazy[k].c )return ;\n calculatef(node[k], lazy[k], r-l);\n if(r-l>1){\n updatef(lazy[2*k+1], lazy[k]);\n updatef(lazy[2*k+2], lazy[k]);\n }\n lazy[k]=E1;\n }\n\n void update(int a, int b, S x,int k=0,int l=0,int r=-1){\n if(r<0)r=n;\n eval(k,l,r);\n if(r<=a||b<=l)return;\n if(a<=l&&r<=b){\n updatef(lazy[k], x);\n eval(k,l,r);\n }\n else {\n update(a,b,x,2*k+1,l,(l+r)/2);\n update(a,b,x,2*k+2,(l+r)/2,r);\n node[k]=queryf(node[2*k+1], node[2*k+2]);\n }\n }\n\n T query(int a,int b,int k=0,int l=0,int r=-1){\n if(r<0)r=n;\n eval(k,l,r);\n if(r<=a||b<=l)return E0;\n if(a<=l&&r<=b)return node[k];\n T xl=query(a,b,2*k+1,l,(l+r)/2);\n T xr=query(a,b,2*k+2,(l+r)/2,r);\n return queryf(xl, xr);\n }\n};\nLazySegmentTree<Node, Op> sg(1,Node(0,0,0), {0,0,0});\n\nstruct HLDecomposition{\n int n,pos;\n vector<vector<int>> v;\n vector<int> idx,head,sz,hvy,par,depth,inv,type;\n \n HLDecomposition(){};\n HLDecomposition(int s):\n n(s),pos(0),v(n),idx(n,-1),head(n),sz(n,1),\n hvy(n,-1),par(n),depth(n),inv(n),type(n){}\n \n void addedge(int x,int y){\n v[x].push_back(y);\n v[y].push_back(x);\n }\n \n void dfs1(int rt){\n par[rt]=-1;\n depth[rt]=0;\n stack<pint> st;\n st.push({rt,0});\n while(!st.empty()){\n int x=st.top().first;\n int& i=st.top().second;\n if(i<(int)v[x].size()){\n int to=v[x][i++];\n if(to==par[x])continue;\n par[to]=x;\n depth[to]=depth[x]+1;\n st.push({to,0});\n }\n else {\n st.pop();\n int res=0;\n for(int to:v[x]){\n if(to==par[x])continue;\n sz[x]+=sz[to];\n if(sz[to]>res)res=sz[to],hvy[x]=to;\n }\n }\n }\n }\n void dfs2(int r,int c){\n int &k=pos;\n stack<int> st;\n st.push(r);\n while(!st.empty()){\n int h=st.top();st.pop();\n for(int x=h;x!=-1;x=hvy[x]){\n type[x]=c;\n head[x]=h;\n idx[x]=k++;\n inv[idx[x]]=x;\n for(int to:v[x])\n if(to!=par[x]&&to!=hvy[x])st.push(to);\n }\n }\n }\n \n void build(vector<int> rs=vector<int>(1,0)){\n int c=0;\n for(int r:rs){\n dfs1(r);\n dfs2(r,c++);\n }\n }\n void f(int x,int y, ll z){\n //ここに何か書く！！！\n sg.update(x,y+1, {0,z,mod-z});\n }\n \n /*void for_v(int x,int y){\n while(1){\n if(idx[x]>idx[y])swap(x,y);\n f(max(idx[head[y]],idx[x]),idx[y]);\n if(head[x]!=head[y])y=par[head[y]];\n else break;\n }\n }*/\n \n void for_edge(int x,int y, ll z){\n ll ret=0;\n while(1){\n if(idx[x]>idx[y])swap(x,y);\n if(head[x]!=head[y]){\n f(idx[head[y]],idx[y], z);\n y=par[head[y]];\n }\n else{\n if(x!=y)f(idx[x]+1,idx[y], z);\n break;\n }\n }\n }\n int lca(int x,int y){\n while(1){\n if(idx[x]>idx[y])swap(x,y);\n if(head[x]==head[y])return x;\n y=par[head[y]];\n }\n }\n \n int dist(int x,int y){\n return depth[x]+depth[y]-2*depth[lca(x,y)];\n }\n};\n\nvector<vector<pair<int,int>>> v(202020);\nvector<ll> w(202020);\nvoid dfs(int x, int p) {\n for(auto to : v[x]){\n if(to.first == p) continue;\n dfs(to.first, x);\n w[x] += w[to.first];\n if(w[x]>=mod)w[x]-=mod;\n }\n}\nint main(){\n int n;\n cin>>n;\n rep(i,n)cin>>w[i];\n HLDecomposition hl(n);\n vector<int> a(n-1), b(n-1), u(n-1);\n rep(i,n-1){\n int x,y,z;\n cin>>x>>y>>z;\n --x;--y;\n v[x].emplace_back(y,z);\n v[y].emplace_back(x,z);\n hl.addedge(x,y);\n a[i] = x;\n b[i] = y;\n u[i] = z;\n }\n dfs(0, -1);\n hl.build();\n vector<Node> node(n, Node(0,0,0));\n rep(i,n-1){\n if(hl.idx[a[i]]>hl.idx[b[i]])swap(a[i],b[i]);\n int id = hl.idx[b[i]];\n node[id] = Node(u[i],w[b[i]], (w[0]+mod-w[b[i]])%mod);\n }\n sg = LazySegmentTree<Node, Op>(node, Node(0,0,0), {0,0,0});\n int size = sg.n;\n cout << sg.query(0, size).abc << endl;\n int q;\n cin >> q;\n while(q--){\n int t, x, z;\n cin >> t >> x >> z;\n --x;\n if(t == 1) {\n sg.update(0,size, {0,0,z});\n hl.for_edge(0, x, z);\n\n } else {\n int id = hl.idx[b[x]];\n sg.update(id, id + 1, {z,0,0});\n }\n cout << sg.query(0,size).abc << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":690,"memory_kb":98820,"score_of_the_acc":-1.0951,"final_rank":9},{"submission_id":"aoj_3179_4840423","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )\n#define rep(i,n) REP(i,0,n)\ntypedef long long ll;\ntypedef pair<int,int> pint;\ntypedef pair<ll,int> pli;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=998244353 ;\nint dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;\n\nstruct Node {\n ll abc,ab,ac,bc,a,b,c;\n Node(ll a,ll b, ll c):a(a),b(b),c(c) {\n ab = a * b % mod;\n ac = a * c % mod;\n bc = b * c % mod;\n abc = ab * c % mod;\n }\n};\n\nstruct Op {\n ll a, b, c;\n};\n\ntemplate<typename T, typename S>\nstruct LazySegmentTree{\n int n;\n vector<T> node;\n vector<S> lazy;\n T E0;\n S E1;\n\n inline void updatef(S& lazy,S& value){\n //lazy += value;\n lazy.a += value.a;\n if(lazy.a >= mod) lazy.a -= mod;\n lazy.b += value.b;\n if(lazy.b >= mod) lazy.b -= mod;\n lazy.c += value.c;\n if(lazy.c >= mod) lazy.c -= mod;\n //lazy = max(lazy, value);\n //lazy = min(lazy, value);\n }\n inline void calculatef(T& node,S& lazy,int len){\n //node += lazy * len; //区間sumはこっち\n // node += lazy ; //区間maxとか\n if(lazy.a) {\n node.abc = (node.abc + node.bc * lazy.a) % mod;\n node.ab = (node.ab + node.b * lazy.a) % mod;\n node.ac = (node.ac + node.c * lazy.a) % mod;\n node.a += lazy.a;\n if(node.a >= mod)node.a -= mod;\n }\n if(lazy.b) {\n node.abc = (node.abc + node.ac * lazy.b) % mod;\n node.bc = (node.bc + node.c * lazy.b) % mod;\n node.ab = (node.ab + node.a * lazy.b) % mod;\n node.b += lazy.b;\n if(node.b >= mod)node.b -= mod;\n }\n if(lazy.c) {\n node.abc = (node.abc + node.ab * lazy.c) % mod;\n node.ac = (node.ac + node.a * lazy.c) % mod;\n node.bc = (node.bc + node.b * lazy.c) % mod;\n node.c += lazy.c;\n if(node.c >= mod)node.c -= mod;\n }\n }\n inline T queryf(T& x,T& y){\n //return x + y;\n //return x * y;\n //return max(x, y);\n Node z(0,0,0);\n z.abc = x.abc + y.abc;\n if(z.abc>=mod)z.abc -= mod;\n z.ab = x.ab + y.ab;\n if(z.ab>=mod)z.ab -= mod;\n z.ac = x.ac + y.ac;\n if(z.ac>=mod)z.ac -= mod;\n z.bc = x.bc + y.bc;\n if(z.bc>=mod)z.bc -= mod;\n z.a = x.a + y.a;\n if(z.a>=mod)z.a -= mod;\n z.b = x.b + y.b;\n if(z.b>=mod)z.b -= mod;\n z.c = x.c + y.c;\n if(z.c>=mod)z.c -= mod;\n return z;\n }\npublic:\n LazySegmentTree(int sz,T nodeE,S lazyE ):E0(nodeE), E1(lazyE){\n n=1;\n while(n<sz)n<<=1;\n node.resize(2*n-1,E0);\n lazy.resize(2*n-1,E1);\n }\n\n LazySegmentTree(vector<T>& v,T E0,S E1 ):E0(E0),E1(E1){\n n=1;\n int sz=v.size();\n while(n<sz)n<<=1;\n node.resize(2*n-1,E0);\n lazy.resize(2*n-1,E1);\n rep(i,sz)node[i+n-1] = v[i];\n for(int i=n-2; i>=0; --i){\n node[i] = queryf(node[2*i+1],node[2*i+2]);\n }\n }\n\n void eval(int k,int l,int r){\n if(!lazy[k].a && !lazy[k].b && !lazy[k].c )return ;\n calculatef(node[k], lazy[k], r-l);\n if(r-l>1){\n updatef(lazy[2*k+1], lazy[k]);\n updatef(lazy[2*k+2], lazy[k]);\n }\n lazy[k]=E1;\n }\n\n void update(int a, int b, S x,int k=0,int l=0,int r=-1){\n if(r<0)r=n;\n eval(k,l,r);\n if(r<=a||b<=l)return;\n if(a<=l&&r<=b){\n updatef(lazy[k], x);\n eval(k,l,r);\n }\n else {\n update(a,b,x,2*k+1,l,(l+r)/2);\n update(a,b,x,2*k+2,(l+r)/2,r);\n node[k]=queryf(node[2*k+1], node[2*k+2]);\n }\n }\n\n T query(int a,int b,int k=0,int l=0,int r=-1){\n if(r<0)r=n;\n eval(k,l,r);\n if(r<=a||b<=l)return E0;\n if(a<=l&&r<=b)return node[k];\n T xl=query(a,b,2*k+1,l,(l+r)/2);\n T xr=query(a,b,2*k+2,(l+r)/2,r);\n return queryf(xl, xr);\n }\n};\nLazySegmentTree<Node, Op> sg(1,Node(0,0,0), {0,0,0});\n\nstruct HLDecomposition{\n int n,pos;\n vector<vector<int>> v;\n vector<int> idx,head,sz,hvy,par,depth,inv,type;\n \n HLDecomposition(){};\n HLDecomposition(int s):\n n(s),pos(0),v(n),idx(n,-1),head(n),sz(n,1),\n hvy(n,-1),par(n),depth(n),inv(n),type(n){}\n \n void addedge(int x,int y){\n v[x].push_back(y);\n v[y].push_back(x);\n }\n \n void dfs1(int rt){\n par[rt]=-1;\n depth[rt]=0;\n stack<pint> st;\n st.push({rt,0});\n while(!st.empty()){\n int x=st.top().first;\n int& i=st.top().second;\n if(i<(int)v[x].size()){\n int to=v[x][i++];\n if(to==par[x])continue;\n par[to]=x;\n depth[to]=depth[x]+1;\n st.push({to,0});\n }\n else {\n st.pop();\n int res=0;\n for(int to:v[x]){\n if(to==par[x])continue;\n sz[x]+=sz[to];\n if(sz[to]>res)res=sz[to],hvy[x]=to;\n }\n }\n }\n }\n void dfs2(int r,int c){\n int &k=pos;\n stack<int> st;\n st.push(r);\n while(!st.empty()){\n int h=st.top();st.pop();\n for(int x=h;x!=-1;x=hvy[x]){\n type[x]=c;\n head[x]=h;\n idx[x]=k++;\n inv[idx[x]]=x;\n for(int to:v[x])\n if(to!=par[x]&&to!=hvy[x])st.push(to);\n }\n }\n }\n \n void build(vector<int> rs=vector<int>(1,0)){\n int c=0;\n for(int r:rs){\n dfs1(r);\n dfs2(r,c++);\n }\n }\n void f(int x,int y, ll z){\n //ここに何か書く！！！\n sg.update(x,y+1, {0,z,mod-z});\n }\n \n /*void for_v(int x,int y){\n while(1){\n if(idx[x]>idx[y])swap(x,y);\n f(max(idx[head[y]],idx[x]),idx[y]);\n if(head[x]!=head[y])y=par[head[y]];\n else break;\n }\n }*/\n \n void for_edge(int x,int y, ll z){\n ll ret=0;\n while(1){\n if(idx[x]>idx[y])swap(x,y);\n if(head[x]!=head[y]){\n f(idx[head[y]],idx[y], z);\n y=par[head[y]];\n }\n else{\n if(x!=y)f(idx[x]+1,idx[y], z);\n break;\n }\n }\n }\n int lca(int x,int y){\n while(1){\n if(idx[x]>idx[y])swap(x,y);\n if(head[x]==head[y])return x;\n y=par[head[y]];\n }\n }\n \n int dist(int x,int y){\n return depth[x]+depth[y]-2*depth[lca(x,y)];\n }\n};\n\nvector<vector<pair<int,int>>> v(202020);\nvector<ll> w(202020);\nvoid dfs(int x, int p) {\n for(auto to : v[x]){\n if(to.first == p) continue;\n dfs(to.first, x);\n w[x] += w[to.first];\n if(w[x]>=mod)w[x]-=mod;\n }\n}\nint main(){\n int n;\n cin>>n;\n rep(i,n)cin>>w[i];\n HLDecomposition hl(n);\n vector<int> a(n-1), b(n-1), u(n-1);\n rep(i,n-1){\n int x,y,z;\n cin>>x>>y>>z;\n --x;--y;\n v[x].emplace_back(y,z);\n v[y].emplace_back(x,z);\n hl.addedge(x,y);\n a[i] = x;\n b[i] = y;\n u[i] = z;\n }\n dfs(0, -1);\n hl.build();\n vector<Node> node(n, Node(0,0,0));\n rep(i,n-1){\n if(hl.idx[a[i]]>hl.idx[b[i]])swap(a[i],b[i]);\n int id = hl.idx[b[i]];\n node[id] = Node(u[i],w[b[i]]%mod, (w[0]-w[b[i]])%mod);\n }\n sg = LazySegmentTree<Node, Op>(node, Node(0,0,0), {0,0,0});\n int size = sg.n;\n cout << sg.query(0, size).abc << endl;\n int q;\n cin >> q;\n while(q--){\n int t, x, z;\n cin >> t >> x >> z;\n --x;\n if(t == 1) {\n sg.update(0,size, {0,0,z});\n hl.for_edge(0, x, z);\n\n } else {\n int id = hl.idx[b[x]];\n sg.update(id, id + 1, {z,0,0});\n }\n cout << sg.query(0,size).abc << endl;\n }\n return 0;\n}","accuracy":0.07692307692307693,"time_ms":670,"memory_kb":88424,"score_of_the_acc":-0.9567,"final_rank":12},{"submission_id":"aoj_3179_4840406","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )\n#define rep(i,n) REP(i,0,n)\ntypedef long long ll;\ntypedef pair<int,int> pint;\ntypedef pair<ll,int> pli;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=998244353 ;\nint dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;\n\nstruct Node {\n ll abc,ab,ac,bc,a,b,c;\n Node(ll a,ll b, ll c):a(a),b(b),c(c) {\n ab = a * b % mod;\n ac = a * c % mod;\n bc = b * c % mod;\n abc = ab * c % mod;\n }\n};\n\nstruct Op {\n ll a, b, c;\n};\n\ntemplate<typename T, typename S>\nstruct LazySegmentTree{\n int n;\n vector<T> node;\n vector<S> lazy;\n T E0;\n S E1;\n\n inline void updatef(S& lazy,S& value){\n //lazy += value;\n lazy.a += value.a;\n if(lazy.a >= mod) lazy.a -= mod;\n lazy.b += value.b;\n if(lazy.b >= mod) lazy.b -= mod;\n lazy.c += value.c;\n if(lazy.c >= mod) lazy.c -= mod;\n //lazy = max(lazy, value);\n //lazy = min(lazy, value);\n }\n inline void calculatef(T& node,S& lazy,int len){\n //node += lazy * len; //区間sumはこっち\n // node += lazy ; //区間maxとか\n if(lazy.a) {\n node.abc = (node.abc + node.bc * lazy.a) % mod;\n node.ab = (node.ab + node.b * lazy.a) % mod;\n node.ac = (node.ac + node.c * lazy.a) % mod;\n node.a += lazy.a;\n if(node.a >= mod)node.a -= mod;\n }\n if(lazy.b) {\n node.abc = (node.abc + node.ac * lazy.b) % mod;\n node.bc = (node.bc + node.c * lazy.b) % mod;\n node.ab = (node.ab + node.a * lazy.b) % mod;\n node.b += lazy.b;\n if(node.b >= mod)node.b -= mod;\n }\n if(lazy.c) {\n node.abc = (node.abc + node.ab * lazy.c) % mod;\n node.ac = (node.ac + node.a * lazy.c) % mod;\n node.bc = (node.bc + node.b * lazy.c) % mod;\n node.c += lazy.c;\n if(node.c >= mod)node.c -= mod;\n }\n }\n inline T queryf(T& x,T& y){\n //return x + y;\n //return x * y;\n //return max(x, y);\n Node z(0,0,0);\n z.abc = x.abc + y.abc;\n if(z.abc>=mod)z.abc -= mod;\n z.ab = x.ab + y.ab;\n if(z.ab>=mod)z.ab -= mod;\n z.ac = x.ac + y.ac;\n if(z.ac>=mod)z.ac -= mod;\n z.bc = x.bc + y.bc;\n if(z.bc>=mod)z.bc -= mod;\n z.a = x.a + y.a;\n if(z.a>=mod)z.a -= mod;\n z.b = x.b + y.b;\n if(z.b>=mod)z.b -= mod;\n z.c = x.c + y.c;\n if(z.c>=mod)z.c -= mod;\n return z;\n }\npublic:\n LazySegmentTree(int sz,T nodeE,S lazyE ):E0(nodeE), E1(lazyE){\n n=1;\n while(n<sz)n<<=1;\n node.resize(2*n-1,E0);\n lazy.resize(2*n-1,E1);\n }\n\n LazySegmentTree(vector<T>& v,T E0,S E1 ):E0(E0),E1(E1){\n n=1;\n int sz=v.size();\n while(n<sz)n<<=1;\n node.resize(2*n-1,E0);\n lazy.resize(2*n-1,E1);\n rep(i,sz)node[i+n-1] = v[i];\n for(int i=n-2; i>=0; --i){\n node[i] = queryf(node[2*i+1],node[2*i+2]);\n }\n }\n\n void eval(int k,int l,int r){\n if(!lazy[k].a && !lazy[k].b && !lazy[k].c )return ;\n calculatef(node[k], lazy[k], r-l);\n if(r-l>1){\n updatef(lazy[2*k+1], lazy[k]);\n updatef(lazy[2*k+2], lazy[k]);\n }\n lazy[k]=E1;\n }\n\n void update(int a, int b, S x,int k=0,int l=0,int r=-1){\n if(r<0)r=n;\n eval(k,l,r);\n if(r<=a||b<=l)return;\n if(a<=l&&r<=b){\n updatef(lazy[k], x);\n eval(k,l,r);\n }\n else {\n update(a,b,x,2*k+1,l,(l+r)/2);\n update(a,b,x,2*k+2,(l+r)/2,r);\n node[k]=queryf(node[2*k+1], node[2*k+2]);\n }\n }\n\n T query(int a,int b,int k=0,int l=0,int r=-1){\n if(r<0)r=n;\n eval(k,l,r);\n if(r<=a||b<=l)return E0;\n if(a<=l&&r<=b)return node[k];\n T xl=query(a,b,2*k+1,l,(l+r)/2);\n T xr=query(a,b,2*k+2,(l+r)/2,r);\n return queryf(xl, xr);\n }\n};\nLazySegmentTree<Node, Op> sg(1,Node(0,0,0), {0,0,0});\n\nstruct HLDecomposition{\n int n,pos;\n vector<vector<int>> v;\n vector<int> idx,head,sz,hvy,par,depth,inv,type;\n \n HLDecomposition(){};\n HLDecomposition(int s):\n n(s),pos(0),v(n),idx(n,-1),head(n),sz(n,1),\n hvy(n,-1),par(n),depth(n),inv(n),type(n){}\n \n void addedge(int x,int y){\n v[x].push_back(y);\n v[y].push_back(x);\n }\n \n void dfs1(int rt){\n par[rt]=-1;\n depth[rt]=0;\n stack<pint> st;\n st.push({rt,0});\n while(!st.empty()){\n int x=st.top().first;\n int& i=st.top().second;\n if(i<(int)v[x].size()){\n int to=v[x][i++];\n if(to==par[x])continue;\n par[to]=x;\n depth[to]=depth[x]+1;\n st.push({to,0});\n }\n else {\n st.pop();\n int res=0;\n for(int to:v[x]){\n if(to==par[x])continue;\n sz[x]+=sz[to];\n if(sz[to]>res)res=sz[to],hvy[x]=to;\n }\n }\n }\n }\n void dfs2(int r,int c){\n int &k=pos;\n stack<int> st;\n st.push(r);\n while(!st.empty()){\n int h=st.top();st.pop();\n for(int x=h;x!=-1;x=hvy[x]){\n type[x]=c;\n head[x]=h;\n idx[x]=k++;\n inv[idx[x]]=x;\n for(int to:v[x])\n if(to!=par[x]&&to!=hvy[x])st.push(to);\n }\n }\n }\n \n void build(vector<int> rs=vector<int>(1,0)){\n int c=0;\n for(int r:rs){\n dfs1(r);\n dfs2(r,c++);\n }\n }\n void f(int x,int y, ll z){\n //ここに何か書く！！！\n sg.update(x,y+1, {0,z,mod-z});\n }\n \n /*void for_v(int x,int y){\n while(1){\n if(idx[x]>idx[y])swap(x,y);\n f(max(idx[head[y]],idx[x]),idx[y]);\n if(head[x]!=head[y])y=par[head[y]];\n else break;\n }\n }*/\n \n void for_edge(int x,int y, ll z){\n ll ret=0;\n while(1){\n if(idx[x]>idx[y])swap(x,y);\n if(head[x]!=head[y]){\n f(idx[head[y]],idx[y], z);\n y=par[head[y]];\n }\n else{\n if(x!=y)f(idx[x]+1,idx[y], z);\n break;\n }\n }\n }\n int lca(int x,int y){\n while(1){\n if(idx[x]>idx[y])swap(x,y);\n if(head[x]==head[y])return x;\n y=par[head[y]];\n }\n }\n \n int dist(int x,int y){\n return depth[x]+depth[y]-2*depth[lca(x,y)];\n }\n};\n\nvector<vector<pair<int,int>>> v(202020);\nvector<ll> w(202020);\nvoid dfs(int x, int p) {\n for(auto to : v[x]){\n if(to.first == p) continue;\n dfs(to.first, x);\n w[x] += w[to.first];\n if(w[x]>=mod)w[x]-=mod;\n }\n}\nint main(){\n int n;\n cin>>n;\n rep(i,n)cin>>w[i];\n HLDecomposition hl(n);\n vector<int> a(n-1), b(n-1), u(n-1);\n rep(i,n-1){\n int x,y,z;\n cin>>x>>y>>z;\n --x;--y;\n v[x].emplace_back(y,z);\n v[y].emplace_back(x,z);\n hl.addedge(x,y);\n a[i] = x;\n b[i] = y;\n u[i] = z;\n }\n dfs(0, -1);\n hl.build();\n vector<Node> node(n, Node(0,0,0));\n rep(i,n-1){\n if(hl.idx[a[i]]>hl.idx[b[i]])swap(a[i],b[i]);\n int id = hl.idx[b[i]];\n node[id] = Node(u[i],w[b[i]], w[0]-w[b[i]]);\n }\n sg = LazySegmentTree<Node, Op>(node, Node(0,0,0), {0,0,0});\n int size = sg.n;\n cout << sg.query(0, size).abc << endl;\n int q;\n cin >> q;\n while(q--){\n int t, x, z;\n cin >> t >> x >> z;\n --x;\n if(t == 1) {\n sg.update(0,size, {0,0,z});\n hl.for_edge(0, x, z);\n\n } else {\n int id = hl.idx[b[x]];\n sg.update(id, id + 1, {z,0,0});\n }\n cout << sg.query(0,size).abc << endl;\n }\n return 0;\n}","accuracy":0.07692307692307693,"time_ms":750,"memory_kb":88384,"score_of_the_acc":-1.024,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_3179_5786720\",\n \"code_snippet\": \"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3179\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\ntemplate<typename T, T MOD = 1000000007>\\nstruct Mint{\\n inline static constexpr T mod = MOD;\\n T v;\\n Mint():v(0){}\\n Mint(signed v):v(v){}\\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\\n\\n Mint pow(long long k){\\n Mint res(1),tmp(v);\\n while(k){\\n if(k&1) res*=tmp;\\n tmp*=tmp;\\n k>>=1;\\n }\\n return res;\\n }\\n\\n static Mint add_identity(){return Mint(0);}\\n static Mint mul_identity(){return Mint(1);}\\n\\n Mint inv(){return pow(MOD-2);}\\n\\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\\n\\n Mint operator+(Mint a) const{return Mint(v)+=a;}\\n Mint operator-(Mint a) const{return Mint(v)-=a;}\\n Mint operator*(Mint a) const{return Mint(v)*=a;}\\n Mint operator/(Mint a) const{return Mint(v)/=a;}\\n\\n Mint operator+() const{return *this;}\\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\\n\\n bool operator==(const Mint a)const{return v==a.v;}\\n bool operator!=(const Mint a)const{return v!=a.v;}\\n\\n static Mint comb(long long n,int k){\\n Mint num(1),dom(1);\\n for(int i=0;i<k;i++){\\n num*=Mint(n-i);\\n dom*=Mint(i+1);\\n }\\n return num/dom;\\n }\\n};\\ntemplate<typename T, T MOD>\\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\\n\\ntemplate<typename Vertex, typename Cluster, size_t N>\\nstruct TopTree{\\n enum Type { Compress, Rake, Edge };\\n struct Node{\\n Vertex* vs[2];\\n Cluster dat;\\n Node* p;\\n Node* q;\\n Node* ch[2];\\n bool rev,guard;\\n Type type;\\n Node():p(nullptr),q(nullptr),rev(false),guard(false){}\\n };\\n\\n inline static array<Vertex, 2*N> pool_vertex;\\n inline static size_t ptr_vertex = 0;\\n\\n inline static array<Node, 4*N> pool_node;\\n inline static size_t ptr_node = 0;\\n\\n Cluster id;\\n\\n template<typename ...Args>\\n inline Vertex* create(Args ...args){\\n auto t=&pool_vertex[ptr_vertex++];\\n auto dummy=&pool_vertex[ptr_vertex++];\\n *t=Vertex(forward<Args>(args)...);\\n link(t,id,dummy);\\n return t;\\n }\\n\\n Node* recycle=nullptr;\\n inline void dispose_node(Node* t){\\n t->p=recycle;\\n recycle=t;\\n }\\n\\n inline Node* get_new_node(){\\n if(recycle) return new(exchange(recycle,recycle->p)) Node;\\n return &(pool_node[ptr_node++]);\\n }\\n\\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\\n auto t=get_new_node();\\n t->vs[0]=u;t->vs[1]=v;t->dat=w;t->type=Type::Edge;\\n return pushup(t);\\n }\\n\\n inline Node* compress(Node* l,Node* r){\\n auto t=get_new_node();\\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Compress;\\n return pushup(t);\\n }\\n\\n inline Node* rake(Node* l,Node* r){\\n auto t=get_new_node();\\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Rake;\\n return pushup(t);\\n }\\n\\n int parent_dir(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->guard) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n int parent_dir_ignore_guard(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n inline Node* pushup(Node* const t){\\n Node* const l=t->ch[0];\\n Node* const r=t->ch[1];\\n\\n if(t->type==Type::Compress){\\n assert(l->vs[1]==r->vs[0]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=r->vs[1];\\n\\n Cluster lf=l->dat;\\n if(t->q){\\n assert(l->vs[1]==t->q->vs[1]);\\n lf=Cluster::rake(l->dat,t->q->dat);\\n }\\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\\n\\n l->vs[1]->handle=t;\\n }\\n\\n if(t->type==Type::Rake){\\n propagate(t);\\n assert(l->vs[1]==r->vs[1]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=l->vs[1];\\n t->dat=Cluster::rake(l->dat,r->dat);\\n }else{\\n if(!t->p){\\n t->vs[0]->handle=t;\\n t->vs[1]->handle=t;\\n }else if(t->p->type==Type::Compress){\\n if(parent_dir(t)==-1)\\n t->vs[0]->handle=t;\\n }else if(t->p->type==Type::Rake){\\n t->vs[0]->handle=t;\\n }\\n }\\n return t;\\n }\\n\\n inline void toggle(Node* t){\\n if(t->type==Type::Edge){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n }else if(t->type==Type::Compress){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n t->rev^=true;\\n }else if(t->type==Type::Rake){\\n }else abort();\\n }\\n\\n inline void propagate(Node* t){\\n if(t->type==Type::Compress){\\n if(t->rev){\\n assert(t->ch[0] and t->ch[1]);\\n swap(t->ch[0],t->ch[1]);\\n toggle(t->ch[0]);\\n toggle(t->ch[1]);\\n t->rev=false;\\n }\\n }\\n }\\n\\n void set_toggle(Node* v){\\n toggle(v);propagate(v);\\n }\\n\\n void pushdown(Node* t){\\n if(!t) return;\\n pushdown(t->p);\\n propagate(t);\\n }\\n\\n void rotate(Node* t,Node* x,size_t dir){\\n Node* y=x->p;\\n int par=parent_dir_ignore_guard(x);\\n propagate(t->ch[dir]);\\n x->ch[dir^1]=t->ch[dir];\\n t->ch[dir]->p=x;\\n t->ch[dir]=x;\\n x->p=t;\\n t->p=y;\\n if(~par) y->ch[par]=t;\\n else if(y and y->type==Type::Compress) y->q=t;\\n pushup(x);pushup(t);\\n if(y and !y->guard) pushup(y);\\n }\\n\\n void splay(Node* t){\\n assert(t->type!=Type::Edge);\\n propagate(t);\\n\\n while(~parent_dir(t)){\\n Node* q=t->p;\\n if(q->type!=t->type) break;\\n if(~parent_dir(q) and q->p and q->p->type==q->type){\\n Node* r=q->p;\\n if(r->p) propagate(r->p);\\n propagate(r);propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n int rq_dir=parent_dir(q);\\n if(rq_dir==qt_dir){\\n rotate(q,r,rq_dir^1);\\n rotate(t,q,qt_dir^1);\\n }else{\\n rotate(t,q,qt_dir^1);\\n rotate(t,r,rq_dir^1);\\n }\\n }else{\\n if(q->p) propagate(q->p);\\n propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n rotate(t,q,qt_dir^1);\\n }\\n }\\n }\\n\\n Node* expose(Node* t){\\n pushdown(t);\\n while(true){\\n assert(t->type!=Type::Rake);\\n if(t->type==Type::Compress) splay(t);\\n Node* n=nullptr;\\n {\\n Node* p=t->p;\\n if(!p) break;\\n if(p->type==Type::Rake){\\n propagate(p);\\n splay(p);\\n n=p->p;\\n }\\n if(p->type==Type::Compress){\\n propagate(p);\\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\\n n=p;\\n }\\n }\\n splay(n);\\n int dir=parent_dir_ignore_guard(n);\\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\\n\\n Node* const c=n->ch[dir];\\n if(dir==1){\\n set_toggle(c);\\n set_toggle(t);\\n }\\n int n_dir=parent_dir(t);\\n if(~n_dir){\\n Node* const r=t->p;\\n propagate(c);\\n propagate(r);\\n r->ch[n_dir]=c;\\n c->p=r;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(r);pushup(t);pushup(n);\\n splay(r);\\n }else{\\n propagate(c);\\n n->q=c;\\n c->p=n;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(t);pushup(n);\\n }\\n if(t->type==Type::Edge) t=n;\\n }\\n return t;\\n }\\n\\n Node* expose(Vertex* v){\\n return expose((Node*)(v->handle));\\n }\\n\\n void soft_expose(Vertex* u,Vertex* v){\\n pushdown((Node*)u->handle);\\n pushdown((Node*)v->handle);\\n Node* rt=expose(u);\\n\\n if(u->handle==v->handle){\\n if(rt->vs[1]==u or rt->vs[0]==v)\\n set_toggle(rt);\\n return;\\n }\\n\\n rt->guard=true;\\n Node* soft=expose(v);\\n rt->guard=false;\\n\\n pushup(rt);\\n if(parent_dir(soft)==0) set_toggle(rt);\\n }\\n\\n void bring(Node* rt){\\n Node* rk=rt->q;\\n if(!rk){\\n Node* ll=rt->ch[0];\\n dispose_node(ll->p);\\n ll->p=nullptr;\\n pushup(ll);\\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\\n Node* nr=rk;\\n set_toggle(nr);\\n rt->ch[1]=nr;\\n nr->p=rt;\\n rt->q=nullptr;\\n\\n pushup(nr);pushup(rt);\\n }else if(rk->type==Type::Rake){\\n propagate(rk);\\n while(rk->ch[1]->type==Type::Rake){\\n propagate(rk->ch[1]);\\n rk=rk->ch[1];\\n }\\n pushdown(rk);\\n\\n rt->guard=true;\\n splay(rk);\\n rt->guard=false;\\n\\n Node* ll=rk->ch[0];\\n Node* rr=rk->ch[1];\\n propagate(ll);\\n set_toggle(rr);\\n\\n rt->ch[1]=rr;\\n rr->p=rt;\\n\\n rt->q=ll;\\n ll->p=rt;\\n\\n dispose_node(rk);\\n pushup(ll);pushup(rr);pushup(rt);\\n }\\n }\\n\\n Node* link(Vertex* u,Cluster w,Vertex* v){\\n if(!u->handle and !v->handle) return edge(u,w,v);\\n\\n Node* nnu=(Node*)u->handle;\\n Node* nnv=(Node*)v->handle;\\n Node* ee=edge(u,w,v);\\n Node* ll=nullptr;\\n\\n assert(nnv);\\n Node* vv=expose(nnv);\\n propagate(vv);\\n if(vv->vs[1]==v) set_toggle(vv);\\n if(vv->vs[0]==v){\\n Node* nv=compress(ee,vv);\\n ee->p=nv;\\n pushup(ee);\\n vv->p=nv;\\n pushup(vv);pushup(nv);\\n ll=nv;\\n }else{\\n Node* nv=vv;\\n Node* ch=nv->ch[0];\\n propagate(ch);\\n nv->ch[0]=ee;\\n ee->p=nv;\\n pushup(ee);\\n\\n Node* bt=nv->q;\\n Node* rk=nullptr;\\n if(bt){\\n propagate(bt);\\n rk=rake(bt,ch);\\n bt->p=rk;\\n ch->p=rk;\\n pushup(bt);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nv->q=rk;\\n rk->p=nv;\\n pushup(rk);pushup(nv);\\n ll=nv;\\n }\\n\\n assert(nnu);\\n Node* uu=expose(nnu);\\n propagate(uu);\\n if(uu->vs[0]==u) set_toggle(uu);\\n if(uu->vs[1]==u){\\n Node* tp=compress(uu,ll);\\n uu->p=tp;\\n ll->p=tp;\\n pushup(uu);pushup(ll);pushup(tp);\\n }else{\\n Node* nu=uu;\\n Node* ch=nu->ch[1];\\n toggle(ch);\\n propagate(ch);\\n\\n nu->ch[1]=ll;\\n ll->p=nu;\\n pushup(ll);\\n\\n Node* al=nu->q;\\n Node* rk=nullptr;\\n if(al){\\n propagate(al);\\n rk=rake(al,ch);\\n al->p=rk;\\n ch->p=rk;\\n pushup(al);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nu->q=rk;\\n rk->p=nu;\\n pushup(rk);pushup(nu);\\n }\\n return ee;\\n }\\n\\n void cut(Vertex* u,Vertex *v){\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n Node* rr=rt->ch[1];\\n rr->p=nullptr;\\n set_toggle(rr);\\n assert(rr->ch[1]->type==Type::Edge);\\n dispose_node(rr->ch[1]);\\n bring(rr);bring(rt);\\n }\\n\\n Node* path(Vertex* u,Vertex* v){\\n assert(u!=v);\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n propagate(rt->ch[1]);\\n return rt->ch[1]->ch[0];\\n }\\n\\n void set_vertex(Vertex* u,Vertex v){\\n auto t=expose(u);\\n *u=v;\\n pushup(t);\\n }\\n\\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\\n auto t=path(u,v);\\n assert(t->type==Type::Edge);\\n t->dat=w;\\n while(t) pushup(t),t=t->p;\\n }\\n\\n Cluster get_path(Vertex* u,Vertex* v){\\n return path(u,v)->dat;\\n }\\n\\n Cluster get_subtree(Vertex* v){\\n return expose(v)->dat;\\n }\\n\\n // subtree of v when p is root\\n Cluster get_subtree(Vertex* p,Vertex* v){\\n Node* t=path(p,v);\\n Cluster res=t->p->ch[1]->dat;\\n res.toggle();\\n Node* rk=t->p->q;\\n if(t->p->q){\\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\\n res=Cluster::rake(res,rk->dat);\\n }\\n return res;\\n }\\n};\\n\\n#undef call_from_test\\nusing M = Mint<int, 998244353>;\\n\\nstruct Vertex{\\n M v;\\n void* handle;\\n Vertex():v(0),handle(nullptr){}\\n Vertex(M v):v(v),handle(nullptr){}\\n};\\n\\nstruct Cluster{\\n M len;\\n M sum_v;\\n M sum_l,sum_r;\\n M rake_v,rake_d;\\n Cluster(M len=M(0)):len(len),sum_v(0),sum_l(0),sum_r(0),rake_v(0),rake_d(0){}\\n void toggle(){\\n swap(sum_l,sum_r);\\n }\\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\\n Cluster nxt(x.len+y.len);\\n nxt.sum_v=x.sum_v+x.rake_v+(v->v)+y.sum_v;\\n nxt.sum_l=x.sum_l+x.rake_d+y.sum_l+(x.sum_v+(v->v)+x.rake_v)*y.len;\\n nxt.sum_r=x.sum_r+x.rake_d+y.sum_r+(y.sum_v+(v->v)+x.rake_v)*x.len;\\n return nxt;\\n }\\n static Cluster rake(Cluster x,Cluster y){\\n x.rake_v+=y.sum_v+y.rake_v;\\n x.rake_d+=y.sum_l+y.rake_d;\\n return x;\\n }\\n};\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n const char newl ='\\\\n';\\n\\n int n;\\n cin>>n;\\n\\n vector<M> vs(n);\\n for(int i=0;i<n;i++) cin>>vs[i].v;\\n\\n vector<int> as(n),bs(n);\\n vector<M> ws(n);\\n for(int i=1;i<n;i++){\\n cin>>as[i]>>bs[i]>>ws[i].v;\\n as[i]--;bs[i]--;\\n }\\n\\n const size_t N = 2e5;\\n TopTree<Vertex, Cluster, N> G;\\n\\n vector<Vertex*> ptr(n);\\n for(int i=0;i<n;i++) ptr[i]=G.create(vs[i]);\\n\\n for(int i=1;i<n;i++)\\n G.link(ptr[as[i]],Cluster(0),ptr[bs[i]]);\\n\\n M ans{0};\\n for(int i=1;i<n;i++){\\n Cluster x=G.get_subtree(ptr[bs[i]],ptr[as[i]]);\\n Cluster y=G.get_subtree(ptr[as[i]],ptr[bs[i]]);\\n ans+=ws[i]*(x.sum_v+x.rake_v+vs[as[i]])*(y.sum_v+y.rake_v+vs[bs[i]]);\\n G.set_edge(ptr[as[i]],ptr[bs[i]],Cluster(ws[i]));\\n }\\n cout<<ans<<newl;\\n\\n Vertex* rt=G.create(Vertex(0));\\n\\n int q;\\n cin>>q;\\n for(int i=0;i<q;i++){\\n int t;\\n cin>>t;\\n if(t==1){\\n int c,a;\\n cin>>c>>a;\\n c--;\\n G.link(rt,Cluster(0),ptr[c]);\\n Cluster x=G.get_subtree(rt,ptr[c]);\\n G.cut(rt,ptr[c]);\\n ans+=M(a)*(x.sum_l+x.rake_d);\\n vs[c]+=M(a);\\n G.set_vertex(ptr[c],Vertex(vs[c]));\\n }\\n\\n if(t==2){\\n int e,a;\\n cin>>e>>a;\\n\\n Cluster x=G.get_subtree(ptr[bs[e]],ptr[as[e]]);\\n Cluster y=G.get_subtree(ptr[as[e]],ptr[bs[e]]);\\n ans+=M(a)*(x.sum_v+x.rake_v+vs[as[e]])*(y.sum_v+y.rake_v+vs[bs[e]]);\\n\\n ws[e]+=M(a);\\n G.set_edge(ptr[as[e]],ptr[bs[e]],Cluster(ws[e]));\\n }\\n cout<<ans<<newl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1370,\n \"memory_kb\": 79596,\n \"score_of_the_acc\": -1.4468,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3179_5702994\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T> using PQ = priority_queue<T>;\\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \\ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\\\" \\\"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(const T &v,ll n,string sv=\\\" \\\"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop_front();}cout<<endl;}\\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\\\"[\\\"<<z.first<<\\\"]=\\\"<<z.second<<\\\",\\\";cout<<endl;}\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\\n auto tmp = v;\\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\\n}\\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\\n rearrange(ord, head);\\n rearrange(ord, tail...);\\n}\\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\\n return ord;\\n}\\ntemplate<typename T> vector<int> descend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\\n return ord;\\n}\\nll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}\\nll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}\\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\nint popcount(ll x){return __builtin_popcountll(x);};\\nint poplow(ll x){return __builtin_ctzll(x);};\\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\\ntemplate< typename T = int >\\nstruct edge {\\n int to;\\n T cost;\\n int id;\\n edge():id(-1){};\\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\\n operator int() const { return to; }\\n};\\n\\ntemplate<typename T>\\nusing Graph = vector<vector<edge<T>>>;\\ntemplate<typename T>\\nGraph<T>revgraph(const Graph<T> &g){\\n Graph<T>ret(g.size());\\n for(int i=0;i<g.size();i++){\\n for(auto e:g[i]){\\n int to = e.to;\\n e.to = i;\\n ret[to].push_back(e);\\n }\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\\n Graph<T> ret(n);\\n for(int es = 0; es < m; es++){\\n int u,v;\\n T w=1;\\n cin>>u>>v;u-=indexed,v-=indexed;\\n if(weighted)cin>>w;\\n ret[u].emplace_back(v,w,es);\\n if(!directed)ret[v].emplace_back(u,w,es);\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\\n Graph<T>ret(n);\\n for(int i=1;i<n;i++){\\n int p;cin>>p;\\n p-=indexed;\\n ret[p].emplace_back(i);\\n if(!directed)ret[i].emplace_back(p);\\n }\\n return ret;\\n}\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n\\n friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) += rhs;\\n }\\n friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) -= rhs;\\n }\\n friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) *= rhs;\\n }\\n friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) /= rhs;\\n }\\n\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\nusing modint = ModInt< MOD9 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}\\n//using modint=ld;\\ntemplate< typename Monoid, typename OperatorMonoid,typename F, typename G, typename H>\\nstruct LazySegmentTree {\\n ll sz, height, n;\\n vector< Monoid > data;\\n vector< OperatorMonoid > lazy;\\n const F f;\\n const G g;\\n const H h;\\n Monoid M1;\\n OperatorMonoid OM0;\\n LazySegmentTree(ll n, const F &f,const G &g, const H &h, Monoid M1, OperatorMonoid OM0):n(n),f(f),g(g),h(h),M1(M1),OM0(OM0){\\n sz = 1;\\n height = 0;\\n while(sz < n) sz <<= 1, height++;\\n data.assign(2 * sz, M1);\\n lazy.assign(2 * sz, OM0);\\n }\\n\\n void set(ll k, const Monoid &x) {\\n data[k + sz] = x;\\n }\\n\\n void build() {\\n for(ll k = sz - 1; k > 0; k--) {\\n data[k] = f(data[2 * k + 0], data[2 * k + 1]);\\n }\\n }\\n\\n inline void propagate(ll k) {\\n if(lazy[k] != OM0) {\\n lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);\\n lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);\\n data[k] = reflect(k);\\n lazy[k] = OM0;\\n }\\n }\\n\\n inline Monoid reflect(ll k) {\\n return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);\\n }\\n\\n inline void recalc(ll k) {\\n while(k >>= 1) data[k] = f(reflect(2 * k + 0), reflect(2 * k + 1));\\n }\\n\\n inline void thrust(ll k) {\\n for(ll i = height; i > 0; i--) propagate(k >> i);\\n }\\n\\n void update(ll a, ll b, const OperatorMonoid &x) {\\n\\tif(a>=b)return;\\n thrust(a += sz);\\n thrust(b += sz - 1);\\n for(ll l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\\n if(l & 1) lazy[l] = h(lazy[l], x), ++l;\\n if(r & 1) --r, lazy[r] = h(lazy[r], x);\\n }\\n recalc(a);\\n recalc(b);\\n }\\n \\n void update(ll a,const Monoid &x){\\n thrust(a += sz);\\n data[a] = x;\\n lazy[a] = OM0;\\n recalc(a);\\n }\\n\\n Monoid query(ll a, ll b) {\\n\\tif(a>=b)return M1;\\n thrust(a += sz);\\n thrust(b += sz - 1);\\n Monoid L = M1, R = M1;\\n for(ll l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {\\n if(l & 1) L = f(L, reflect(l++));\\n if(r & 1) R = f(reflect(--r), R);\\n }\\n return f(L, R);\\n }\\n\\n Monoid operator[](const ll &k) {\\n return query(k, k + 1);\\n }\\n\\n template< typename C >\\n ll find_subtree(ll a, const C &check, Monoid &M, bool type) {\\n while(a < sz) {\\n propagate(a);\\n Monoid nxt = type ? f(reflect(2 * a + type), M) : f(M, reflect(2 * a + type));\\n if(check(nxt)) a = 2 * a + type;\\n else M = nxt, a = 2 * a + 1 - type;\\n }\\n return a - sz;\\n }\\n\\n template< typename C >\\n ll find_first(ll a, const C &check) {\\n Monoid L = M1;\\n if(a <= 0) {\\n if(check(f(L, reflect(1)))) return find_subtree(1, check, L, false);\\n return -1;\\n }\\n thrust(a + sz);\\n ll b = sz;\\n for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n if(a & 1) {\\n Monoid nxt = f(L, reflect(a));\\n if(check(nxt)) return find_subtree(a, check, L, false);\\n L = nxt;\\n ++a;\\n }\\n }\\n return -1;\\n }\\n\\n\\n template< typename C >\\n ll find_last(ll b, const C &check) {\\n Monoid R = M1;\\n if(b >= sz) {\\n if(check(f(reflect(1), R))) return find_subtree(1, check, R, true);\\n return -1;\\n }\\n thrust(b + sz - 1);\\n ll a = sz;\\n for(b += sz; a < b; a >>= 1, b >>= 1) {\\n if(b & 1) {\\n Monoid nxt = f(reflect(--b), R);\\n if(check(nxt)) return find_subtree(b, check, R, true);\\n R = nxt;\\n }\\n }\\n return -1;\\n }\\n void print(){\\n for(ll i=0;i<n;i++)if((*this)[i]==M1)cout<<\\\"x|\\\";else cout<<(*this)[i]<<\\\"|\\\";\\n cout<<endl;\\n }\\n};\\ntemplate<typename T>\\nstruct HLD{\\n using D=long long;\\n int n;\\n vector<int>sz;//部分木サイズ\\n vector<D>dep;\\n vector<int>par;\\n vector<int>head;\\n Graph<T> &g;//隣接リスト\\n vector<edge<T>>edges;//データ構造に乗せるedge列\\n vector<int>in,out;//[in,out)で部分木、[ina,inb]でa~bのパス(aが上)\\n vector<int>comp;//連結成分の根\\n //inは頂点のindexを表す。また、edge列の下側の頂点である\\n HLD(Graph<T> &g,int r=-1):g(g),n(g.size()){\\n hld_build(r);\\n }\\n void hld_build(int root = -1){\\n in.assign(n,-1);out.assign(n,-1);dep.assign(n,0);\\n par.assign(n,-1);head.assign(n,-1);sz.assign(n,-1);comp.assign(n,-1);\\n edges.assign(n,edge<T>());\\n if(root == -1){//根がどこでも良い場合(森でも可)\\n for(int i=0;i<n;i++){\\n if(sz[i] == -1){\\n head[i] = i;\\n dfs_sz(i, 0, i);\\n dfs_hld(i);\\n }\\n }\\n }\\n else{\\n head[root] = root;\\n dfs_sz(root, 0, root);\\n dfs_hld(root);\\n }\\n }\\n void dfs_sz(int k, D d,int r){\\n sz[k] = 1;\\n comp[k] = r;\\n\\tdep[k] = d;\\n for(auto &e: g[k]){\\n if(e.to == par[k])continue;\\n par[e.to] = k;\\n dfs_sz(e.to, d+e.cost, r);\\n sz[k] += sz[e.to];\\n if(sz[e.to] > sz[g[k][0].to])swap(e, g[k][0]);\\n }\\n }\\n int time = 0;\\n void dfs_hld(int k){\\n in[k] = time++;\\n for(auto e:g[k]){\\n if(e.to == par[k])continue;\\n head[e.to] = (e.to == g[k][0].to ? head[k]: e.to);\\n edges[time] = e;\\n dfs_hld(e.to);\\n }\\n out[k] = time;\\n }\\n int lca(int p,int q){\\n while(1){\\n if(in[p] < in[q])swap(p,q);\\n if(head[p] == head[q])return q;\\n p = par[head[p]];\\n }\\n }\\n vector<pair<int,int>>query_path(int p,int q,bool isEdge){\\n int r=lca(p,q);\\n vector<pair<int,int>>ret;\\n for(int i=0;i<2;i++){\\n if(i == 1)swap(p,q);\\n while(1){\\n if(isEdge&&p==r)break;\\n if(head[p]==head[r]){\\n ret.emplace_back(in[r]+(isEdge?1:i),in[p]+1);\\n break;\\n }\\n ret.emplace_back(in[head[p]],in[p]+1);\\n p = par[head[p]];\\n }\\n }\\n return ret;\\n }\\n vector<vector<pair<int,int>>>query_order_path(int p,int q,bool isEdge){\\n\\t//非可換クエリ用、配列0を順番を反転したデータ構造に、配列1を通常のデータ構造に\\n vector<vector<pair<int,int>>>ret(2);\\n int r=lca(p,q);\\n for(int i=0;i<2;i++){\\n if(i == 1)swap(p,q);\\n while(1){\\n if(isEdge&&p==r)break;\\n if(head[p]==head[r]){\\n if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[r]+(isEdge?1:i)));\\n else ret[i].emplace_back(in[r]+(isEdge?1:i),in[p]+1);\\n break;\\n }\\n if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[head[p]]));\\n else ret[i].emplace_back(in[head[p]],in[p]+1);\\n p = par[head[p]];\\n }\\n }\\n reverse(ret[1].begin(), ret[1].end());\\n return ret;\\n }\\n pair<int,int>query_subtree(int p,bool isEdge){\\n return make_pair(in[p]+isEdge,out[p]);\\n }\\n //uのv方向の子 子孫関係は前もって確認すること(in,outを見る)\\n int child(int u,int v){\\n while(1){\\n if(head[u]==head[v]){\\n v=g[u][0].to;\\n break;\\n }\\n v=head[v];\\n if(par[v]==u)break;\\n v=par[v];\\n }\\n return v;\\n }\\n //uをv方向に一つ進めた頂点\\n int move(int u,int v){\\n assert(u!=v);\\n if(in[u]<in[v]&&in[v]<out[u])return child(u,v);\\n else return par[u];\\n }\\n D dist(int u,int v){\\n return dep[u]+dep[v]-2*dep[lca(u,v)];\\n }\\n vector<int>rev_in;\\n int climb(int u,int k){\\n if(rev_in.empty()){\\n rev_in.resize(n);\\n for(int i=0;i<n;i++)rev_in[in[i]]=i;\\n }\\n int nd=max<int>(dep[u]-k, 0);\\n while(dep[u]>nd){\\n if(dep[head[u]]>nd){\\n u=par[head[u]];\\n }\\n else{\\n u=rev_in[in[head[u]]+nd-dep[head[u]]];\\n }\\n }\\n return u;\\n }\\n template<typename I>\\n Graph<T>lca_tree(vector<I>&v){\\n auto compare=[&](int x,int y){return in[x]<in[y];};\\n sort(v.begin(),v.end(),compare);\\n int sz1=v.size();\\n for(int i=0;i<sz1-1;i++)v.push_back(lca(v[i],v[i+1]));\\n sort(v.begin(),v.end(),compare);\\n v.erase(unique(v.begin(),v.end()),v.end());\\n int sz2=v.size();\\n Graph<T>ret(sz2);\\n stack<int>st;\\n for(int i=0;i<sz2;i++){\\n while(!st.empty()&&out[v[st.top()]]<=in[v[i]])st.pop();\\n if(!st.empty())ret[st.top()].emplace_back(i,dep[v[i]]-dep[v[st.top()]]);\\n st.push(i);\\n }\\n return ret;\\n }\\n};\\nnamespace add_sum{\\n struct M{\\n modint vs,es,sum,sz;\\n };\\n using PM=pair<modint,modint>;\\n auto f=[](M x,M y)->M{\\n return {x.vs+y.vs,x.es+y.es,x.sum+y.sum,x.sz+y.sz};\\n };\\n auto g=[](M x,PM y)->M{\\n return {x.vs+x.sz*y.fi,\\n x.es+x.sz*y.se,\\n x.sum+x.vs*y.se+x.es*y.fi+x.sz*y.fi*y.se,\\n x.sz};\\n };\\n auto h=[](PM x,PM y)->PM{\\n return MP(x.fi+y.fi,x.se+y.se);\\n };\\n LazySegmentTree<M,PM,decltype(f),decltype(g),decltype(h)>make(int n){\\n return {n,f,g,h,{0,0,0,0},MP(0,0)};\\n }\\n}\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n ll n;cin>>n;\\n vector<ll>vw(n);\\n rep(i,0,n)cin>>vw[i];\\n auto g=readGraph<int>(n,n-1,1,false,true);\\n HLD hld(g);\\n auto up=add_sum::make(n);\\n auto down=add_sum::make(n);\\n auto ord=ascend(hld.in);\\n vector<ll>epos(n-1);\\n up.build();\\n down.build();\\n modint ret=0;\\n modint allsz=0;\\n rep(i,0,n)allsz+=vw[i];\\n vector<modint>subsz(n,0);\\n {\\n auto dfs=[&](auto &&f,ll k,ll par)->void{\\n subsz[k]=vw[k];\\n for(auto to:g[k]){\\n if(to==par)continue;\\n f(f,to,k);\\n subsz[k]+=subsz[to];\\n }\\n };\\n dfs(dfs,0,-1);\\n }\\n rep(i,1,n){\\n modint sz=subsz[ord[i]];\\n epos[hld.edges[i].id]=i;\\n up.set(i,{allsz-sz,hld.edges[i].cost,(allsz-sz)*hld.edges[i].cost,1});\\n down.set(i,{sz,hld.edges[i].cost,sz*hld.edges[i].cost,1});\\n ret+=hld.edges[i].cost*sz*(allsz-sz);\\n }\\n up.build();\\n down.build();\\n cout<<ret<<endl;\\n ll q;cin>>q;\\n while(q--){\\n ll t,k,w;cin>>t>>k>>w;k--;\\n if(t==1){\\n modint add=down.query(1,n).sum;\\n auto tmp=hld.query_path(0,k,true);\\n //cout<<q spa add spa k spa tmp.size()<<endl;\\n for(auto z:tmp){\\n add-=down.query(z.fi,z.se).sum;\\n //cout<<q spa add<<endl;\\n add+=up.query(z.fi,z.se).sum;\\n //cout<<q spa add<<endl;\\n }\\n ret+=add*w;\\n up.update(1,n,MP(w,0));\\n for(auto z:tmp){\\n up.update(z.fi,z.se,MP(-w,0));\\n down.update(z.fi,z.se,MP(w,0));\\n }\\n vw[k]+=w;\\n allsz+=w;\\n }\\n if(t==2){\\n modint sz=down[epos[k]].vs;\\n ret+=sz*(allsz-sz)*w;\\n up.update(epos[k],epos[k]+1,MP(0,w));\\n down.update(epos[k],epos[k]+1,MP(0,w));\\n }\\n cout<<ret<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 66772,\n \"score_of_the_acc\": -0.5258,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3179_4875833\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\ntemplate<typename Vertex, typename Cluster, size_t LIM>\\nstruct TopTree{\\n enum Type { Compress, Rake, Edge };\\n struct Node{\\n Vertex* vs[2];\\n Cluster dat;\\n Node* p;\\n Node* q;\\n Node* ch[2];\\n bool rev,guard;\\n Type type;\\n Node():p(nullptr),q(nullptr),rev(false),guard(false){}\\n };\\n\\n static array<Vertex, LIM> pool_v;\\n static array<Node, LIM> pool_c;\\n size_t ptr_v,ptr_c;\\n\\n Cluster id;\\n TopTree():ptr_v(0),ptr_c(0),id(){}\\n\\n inline Vertex* create(Vertex v=Vertex()){\\n auto t=&pool_v[ptr_v++];\\n auto dummy=&pool_v[ptr_v++];\\n *t=v;\\n link(t,id,dummy);\\n return t;\\n }\\n\\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\\n auto t=&(pool_c[ptr_c++]);\\n t->vs[0]=u;t->vs[1]=v;t->dat=w;t->type=Type::Edge;\\n return pushup(t);\\n }\\n\\n inline Node* compress(Node* l,Node* r){\\n auto t=&(pool_c[ptr_c++]);\\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Compress;\\n return pushup(t);\\n }\\n\\n inline Node* rake(Node* l,Node* r){\\n auto t=&(pool_c[ptr_c++]);\\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Rake;\\n return pushup(t);\\n }\\n\\n int parent_dir(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->guard) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n int parent_dir_ignore_guard(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n inline Node* pushup(Node* const t){\\n Node* const l=t->ch[0];\\n Node* const r=t->ch[1];\\n\\n if(t->type==Type::Compress){\\n assert(l->vs[1]==r->vs[0]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=r->vs[1];\\n\\n Cluster lf=l->dat;\\n if(t->q){\\n assert(l->vs[1]==t->q->vs[1]);\\n lf=Cluster::rake(l->dat,t->q->dat);\\n }\\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\\n\\n l->vs[1]->handle=t;\\n }\\n\\n if(t->type==Type::Rake){\\n propagate(t);\\n assert(l->vs[1]==r->vs[1]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=l->vs[1];\\n t->dat=Cluster::rake(l->dat,r->dat);\\n }else{\\n if(!t->p){\\n t->vs[0]->handle=t;\\n t->vs[1]->handle=t;\\n }else if(t->p->type==Type::Compress){\\n if(parent_dir(t)==-1)\\n t->vs[0]->handle=t;\\n }else if(t->p->type==Type::Rake){\\n t->vs[0]->handle=t;\\n }\\n }\\n return t;\\n }\\n\\n inline void toggle(Node* t){\\n if(t->type==Type::Edge){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n }else if(t->type==Type::Compress){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n t->rev^=true;\\n }else if(t->type==Type::Rake){\\n }else abort();\\n }\\n\\n inline void propagate(Node* t){\\n if(t->type==Type::Compress){\\n if(t->rev){\\n assert(t->ch[0] and t->ch[1]);\\n swap(t->ch[0],t->ch[1]);\\n toggle(t->ch[0]);\\n toggle(t->ch[1]);\\n t->rev=false;\\n }\\n }\\n }\\n\\n void set_toggle(Node* v){\\n toggle(v);propagate(v);\\n }\\n\\n void pushdown(Node* t){\\n if(!t) return;\\n pushdown(t->p);\\n propagate(t);\\n }\\n\\n void rotate(Node* t,Node* x,size_t dir){\\n Node* y=x->p;\\n int par=parent_dir_ignore_guard(x);\\n propagate(t->ch[dir]);\\n x->ch[dir^1]=t->ch[dir];\\n t->ch[dir]->p=x;\\n t->ch[dir]=x;\\n x->p=t;\\n t->p=y;\\n if(~par) y->ch[par]=t;\\n else if(y and y->type==Type::Compress) y->q=t;\\n pushup(x);pushup(t);\\n if(y and !y->guard) pushup(y);\\n }\\n\\n void splay(Node* t){\\n assert(t->type!=Type::Edge);\\n propagate(t);\\n\\n while(~parent_dir(t)){\\n Node* q=t->p;\\n if(q->type!=t->type) break;\\n if(~parent_dir(q) and q->p and q->p->type==q->type){\\n Node* r=q->p;\\n if(r->p) propagate(r->p);\\n propagate(r);propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n int rq_dir=parent_dir(q);\\n if(rq_dir==qt_dir){\\n rotate(q,r,rq_dir^1);\\n rotate(t,q,qt_dir^1);\\n }else{\\n rotate(t,q,qt_dir^1);\\n rotate(t,r,rq_dir^1);\\n }\\n }else{\\n if(q->p) propagate(q->p);\\n propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n rotate(t,q,qt_dir^1);\\n }\\n }\\n }\\n\\n Node* expose(Node* t){\\n pushdown(t);\\n while(true){\\n assert(t->type!=Type::Rake);\\n if(t->type==Type::Compress) splay(t);\\n Node* n=nullptr;\\n {\\n Node* p=t->p;\\n if(!p) break;\\n if(p->type==Type::Rake){\\n propagate(p);\\n splay(p);\\n n=p->p;\\n }\\n if(p->type==Type::Compress){\\n propagate(p);\\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\\n n=p;\\n }\\n }\\n splay(n);\\n int dir=parent_dir_ignore_guard(n);\\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\\n\\n Node* const c=n->ch[dir];\\n if(dir==1){\\n set_toggle(c);\\n set_toggle(t);\\n }\\n int n_dir=parent_dir(t);\\n if(~n_dir){\\n Node* const r=t->p;\\n propagate(c);\\n propagate(r);\\n r->ch[n_dir]=c;\\n c->p=r;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(r);pushup(t);pushup(n);\\n splay(r);\\n }else{\\n propagate(c);\\n n->q=c;\\n c->p=n;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(t);pushup(n);\\n }\\n if(t->type==Type::Edge) t=n;\\n }\\n return t;\\n }\\n\\n Node* expose(Vertex* v){\\n return expose((Node*)(v->handle));\\n }\\n\\n void soft_expose(Vertex* u,Vertex* v){\\n pushdown((Node*)u->handle);\\n pushdown((Node*)v->handle);\\n Node* rt=expose(u);\\n\\n if(u->handle==v->handle){\\n if(rt->vs[1]==u or rt->vs[0]==v)\\n set_toggle(rt);\\n return;\\n }\\n\\n rt->guard=true;\\n Node* soft=expose(v);\\n rt->guard=false;\\n\\n pushup(rt);\\n if(parent_dir(soft)==0) set_toggle(rt);\\n }\\n\\n void bring(Node* rt){\\n Node* rk=rt->q;\\n if(!rk){\\n Node* ll=rt->ch[0];\\n ll->p=nullptr;\\n pushup(ll);\\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\\n propagate(rk);\\n\\n Node* nr=rk;\\n set_toggle(nr);\\n rt->ch[1]=nr;\\n nr->p=rt;\\n rt->q=nullptr;\\n\\n pushup(nr);pushup(rt);\\n }else if(rk->type==Type::Rake){\\n propagate(rk);\\n while(rk->ch[1]->type==Type::Rake){\\n propagate(rk->ch[1]);\\n rk=rk->ch[1];\\n }\\n pushdown(rk);\\n\\n rt->guard=true;\\n splay(rk);\\n rt->guard=false;\\n\\n Node* ll=rk->ch[0];\\n Node* rr=rk->ch[1];\\n propagate(ll);\\n set_toggle(rr);\\n\\n rt->ch[1]=rr;\\n rr->p=rt;\\n\\n rt->q=ll;\\n ll->p=rt;\\n\\n pushup(ll);pushup(rr);pushup(rt);\\n }\\n }\\n\\n Node* link(Vertex* u,Cluster w,Vertex* v){\\n if(!u->handle and !v->handle) return edge(u,w,v);\\n\\n Node* nnu=(Node*)u->handle;\\n Node* nnv=(Node*)v->handle;\\n Node* ee=edge(u,w,v);\\n Node* ll=nullptr;\\n\\n if(!nnv) ll=ee;\\n else{\\n Node* vv=expose(nnv);\\n propagate(vv);\\n if(vv->vs[1]==v) set_toggle(vv);\\n if(vv->vs[0]==v){\\n Node* nv=compress(ee,vv);\\n ee->p=nv;\\n pushup(ee);\\n vv->p=nv;\\n pushup(vv);pushup(nv);\\n ll=nv;\\n }else{\\n Node* nv=vv;\\n Node* ch=nv->ch[0];\\n propagate(ch);\\n nv->ch[0]=ee;\\n ee->p=nv;\\n pushup(ee);\\n\\n Node* bt=nv->q;\\n Node* rk=nullptr;\\n if(bt){\\n propagate(bt);\\n rk=rake(bt,ch);\\n bt->p=rk;\\n ch->p=rk;\\n pushup(bt);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nv->q=rk;\\n rk->p=nv;\\n pushup(rk);pushup(nv);\\n ll=nv;\\n }\\n }\\n\\n if(nnu){\\n Node* uu=expose(nnu);\\n propagate(uu);\\n if(uu->vs[0]==u) set_toggle(uu);\\n if(uu->vs[1]==u){\\n Node* tp=compress(uu,ll);\\n uu->p=tp;\\n ll->p=tp;\\n pushup(uu);pushup(ll);pushup(tp);\\n }else{\\n Node* nu=uu;\\n Node* ch=nu->ch[1];\\n toggle(ch);\\n propagate(ch);\\n\\n nu->ch[1]=ll;\\n ll->p=nu;\\n pushup(ll);\\n\\n Node* al=nu->q;\\n Node* rk=nullptr;\\n if(al){\\n propagate(al);\\n rk=rake(al,ch);\\n al->p=rk;\\n ch->p=rk;\\n pushup(al);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nu->q=rk;\\n rk->p=nu;\\n pushup(rk);pushup(nu);\\n }\\n }\\n return ee;\\n }\\n\\n void cut(Vertex* u,Vertex *v){\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n Node* rr=rt->ch[1];\\n rr->p=nullptr;\\n set_toggle(rr);\\n bring(rr);bring(rt);\\n }\\n\\n Node* path(Vertex* u,Vertex* v){\\n assert(u!=v);\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n propagate(rt->ch[1]);\\n return rt->ch[1]->ch[0];\\n }\\n\\n void set_vertex(Vertex* u,Vertex v){\\n auto t=expose(u);\\n *u=v;\\n pushup(t);\\n }\\n\\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\\n auto t=path(u,v);\\n assert(t->type==Type::Edge);\\n t->dat=w;\\n while(t) pushup(t),t=t->p;\\n }\\n\\n Cluster get_path(Vertex* u,Vertex* v){\\n return path(u,v)->dat;\\n }\\n\\n Cluster get_subtree(Vertex* v){\\n return expose(v)->dat;\\n }\\n\\n // subtree of v when p is root\\n Cluster get_subtree(Vertex* p,Vertex* v){\\n Node* t=path(p,v);\\n Cluster res=t->p->ch[1]->dat;\\n res.toggle();\\n Node* rk=t->p->q;\\n if(t->p->q){\\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\\n res=Cluster::rake(res,rk->dat);\\n }\\n return res;\\n }\\n};\\ntemplate<typename Vertex, typename Cluster, size_t LIM>\\narray<Vertex, LIM> TopTree<Vertex, Cluster, LIM>::pool_v;\\ntemplate<typename Vertex, typename Cluster, size_t LIM>\\narray<typename TopTree<Vertex, Cluster, LIM>::Node, LIM>\\nTopTree<Vertex, Cluster, LIM>::pool_c;\\n\\n\\n\\ntemplate<typename T,T MOD = 1000000007>\\nstruct Mint{\\n static constexpr T mod = MOD;\\n T v;\\n Mint():v(0){}\\n Mint(signed v):v(v){}\\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\\n\\n Mint pow(long long k){\\n Mint res(1),tmp(v);\\n while(k){\\n if(k&1) res*=tmp;\\n tmp*=tmp;\\n k>>=1;\\n }\\n return res;\\n }\\n\\n static Mint add_identity(){return Mint(0);}\\n static Mint mul_identity(){return Mint(1);}\\n\\n Mint inv(){return pow(MOD-2);}\\n\\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\\n\\n Mint operator+(Mint a) const{return Mint(v)+=a;}\\n Mint operator-(Mint a) const{return Mint(v)-=a;}\\n Mint operator*(Mint a) const{return Mint(v)*=a;}\\n Mint operator/(Mint a) const{return Mint(v)/=a;}\\n\\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\\n\\n bool operator==(const Mint a)const{return v==a.v;}\\n bool operator!=(const Mint a)const{return v!=a.v;}\\n bool operator <(const Mint a)const{return v <a.v;}\\n\\n static Mint comb(long long n,int k){\\n Mint num(1),dom(1);\\n for(int i=0;i<k;i++){\\n num*=Mint(n-i);\\n dom*=Mint(i+1);\\n }\\n return num/dom;\\n }\\n};\\ntemplate<typename T,T MOD> constexpr T Mint<T, MOD>::mod;\\ntemplate<typename T,T MOD>\\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\\n\\nusing M = Mint<int, 998244353>;\\n\\nstruct Vertex{\\n M v;\\n void* handle;\\n Vertex():v(0),handle(nullptr){}\\n Vertex(M v):v(v),handle(nullptr){}\\n};\\n\\nstruct Cluster{\\n M len;\\n M sum_v;\\n M sum_l,sum_r;\\n M rake_v,rake_d;\\n Cluster(M len=M(0)):len(len),sum_v(0),sum_l(0),sum_r(0),rake_v(0),rake_d(0){}\\n void toggle(){\\n swap(sum_l,sum_r);\\n }\\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\\n Cluster nxt(x.len+y.len);\\n nxt.sum_v=x.sum_v+x.rake_v+(v->v)+y.sum_v;\\n nxt.sum_l=x.sum_l+x.rake_d+y.sum_l+(x.sum_v+(v->v)+x.rake_v)*y.len;\\n nxt.sum_r=x.sum_r+x.rake_d+y.sum_r+(y.sum_v+(v->v)+x.rake_v)*x.len;\\n return nxt;\\n }\\n static Cluster rake(Cluster x,Cluster y){\\n x.rake_v+=y.sum_v+y.rake_v;\\n x.rake_d+=y.sum_l+y.rake_d;\\n return x;\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int n;\\n cin>>n;\\n\\n vector<M> vs(n);\\n for(int i=0;i<n;i++) cin>>vs[i].v;\\n\\n vector<int> as(n),bs(n);\\n vector<M> ws(n);\\n for(int i=1;i<n;i++){\\n cin>>as[i]>>bs[i]>>ws[i].v;\\n as[i]--;bs[i]--;\\n }\\n\\n const size_t LIM = 1e6;\\n TopTree<Vertex, Cluster, LIM> G;\\n\\n vector<Vertex*> ptr(n);\\n for(int i=0;i<n;i++) ptr[i]=G.create(Vertex(vs[i]));\\n\\n for(int i=1;i<n;i++)\\n G.link(ptr[as[i]],Cluster(0),ptr[bs[i]]);\\n\\n M ans{0};\\n for(int i=1;i<n;i++){\\n Cluster x=G.get_subtree(ptr[bs[i]],ptr[as[i]]);\\n Cluster y=G.get_subtree(ptr[as[i]],ptr[bs[i]]);\\n ans+=ws[i]*(x.sum_v+x.rake_v+vs[as[i]])*(y.sum_v+y.rake_v+vs[bs[i]]);\\n G.set_edge(ptr[as[i]],ptr[bs[i]],Cluster(ws[i]));\\n }\\n cout<<ans<<newl;\\n\\n Vertex* rt=G.create(Vertex(0));\\n\\n int q;\\n cin>>q;\\n for(int i=0;i<q;i++){\\n int t;\\n cin>>t;\\n if(t==1){\\n int c,a;\\n cin>>c>>a;\\n c--;\\n G.link(rt,Cluster(0),ptr[c]);\\n Cluster x=G.get_subtree(rt,ptr[c]);\\n G.cut(rt,ptr[c]);\\n // cout<<x.sum_l<<' '<<x.sum_r<<' '<<x.rake_d<<newl;\\n ans+=M(a)*(x.sum_l+x.rake_d);\\n vs[c]+=M(a);\\n G.set_vertex(ptr[c],Vertex(vs[c]));\\n }\\n\\n if(t==2){\\n int e,a;\\n cin>>e>>a;\\n\\n Cluster x=G.get_subtree(ptr[bs[e]],ptr[as[e]]);\\n Cluster y=G.get_subtree(ptr[as[e]],ptr[bs[e]]);\\n ans+=M(a)*(x.sum_v+x.rake_v+vs[as[e]])*(y.sum_v+y.rake_v+vs[bs[e]]);\\n\\n ws[e]+=M(a);\\n G.set_edge(ptr[as[e]],ptr[bs[e]],Cluster(ws[e]));\\n }\\n cout<<ans<<newl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1400,\n \"memory_kb\": 104672,\n \"score_of_the_acc\": -1.7651,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3179_4849270\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <iostream>\\n#include <string>\\n#include <cmath>\\n#include <bitset>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <complex>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <random>\\n#include <cassert>\\n#include <fstream>\\n#include <utility>\\n#include <functional>\\n#include <time.h>\\n#include <stack>\\n#include <array>\\n#include <list>\\n#define popcount __builtin_popcount\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\ntemplate<int MOD>\\nstruct ModInt{\\n\\tint x;\\n\\tModInt(): x(0){}\\n\\tModInt(ll y): x(y>=0 ? y%MOD : (MOD-(-y)%MOD)%MOD){}\\n\\n\\tModInt &operator+=(const ModInt &p){\\n\\t\\tif((x+=p.x)>=MOD) x-=MOD;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator-=(const ModInt &p){\\n\\t\\tif((x+=MOD-p.x)>=MOD) x-=MOD;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator*=(const ModInt &p){\\n\\t\\tx=(int)(1ll*x*p.x%MOD);\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator/=(const ModInt &p){\\n\\t\\t*this*=p.inv();\\n\\t\\treturn *this;\\n\\t}\\n\\n\\tModInt operator-() const{ return ModInt(-x);}\\n\\tModInt operator+(const ModInt &p) const{ return ModInt(*this)+=p;}\\n\\tModInt operator-(const ModInt &p) const{ return ModInt(*this)-=p;}\\n\\tModInt operator*(const ModInt &p) const{ return ModInt(*this)*=p;}\\n\\tModInt operator/(const ModInt &p) const{ return ModInt(*this)/=p;}\\n\\tbool operator==(const ModInt &p) const{ return x==p.x;}\\n\\tbool operator!=(const ModInt &p) const{ return x!=p.x;}\\n\\n\\tModInt pow(ll n) const{\\n\\t\\tModInt ret(1), p(x);\\n\\t\\twhile(n){\\n\\t\\t\\tif(n&1) ret*=p;\\n\\t\\t\\tp*=p;\\n\\t\\t\\tn>>=1;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tModInt inv() const{\\n\\t\\treturn pow(MOD-2);\\n\\t}\\n};\\nconst int MOD=998244353;\\nusing mint=ModInt<MOD>;\\nstruct LinkCutTree{\\n\\tstruct Node{\\n\\t\\tNode *l, *r, *p;\\n\\t\\tbool rev;\\n\\t\\tint idx;\\n\\t\\tmint val, sz, szl;\\n\\t\\tmint cost, sum, suml, costs, sum2;\\n\\t\\tNode(mint val, int idx, mint cost):cost(cost), costs(cost), sum(0), sum2(0), suml(0), idx(idx), val(val), sz(val), szl(0), rev(false), l(nullptr), r(nullptr), p(nullptr){}\\n\\t\\tbool is_root(){\\n\\t\\t\\treturn !p || (p->l!=this && p->r!=this);\\n\\t\\t}\\n\\t};\\n\\tvector<Node*> v;\\n\\tLinkCutTree(int n){\\n\\t\\tv.resize(n);\\n\\t\\tfor(int i=0; i<n; i++) v[i]=new Node(mint(0), i, mint(0));\\n\\t}\\n\\tvoid toggle(Node *t){\\n\\t\\tif(!t) return;\\n\\t\\tswap(t->sum, t->sum2);\\n\\t\\tswap(t->l, t->r);\\n\\t\\tt->rev^=true;\\n\\t}\\n\\tvoid push(Node *t){\\n\\t\\tif(!t) return;\\n\\t\\tif(t->rev){\\n\\t\\t\\ttoggle(t->l);\\n\\t\\t\\ttoggle(t->r);\\n\\t\\t\\tt->rev=false;\\n\\t\\t}\\n\\t}\\n\\tvoid update(Node *t){\\n\\t\\tt->sz=t->val+t->szl, t->costs=t->cost;\\n\\t\\tif(t->l) t->sz+=t->l->sz, t->costs+=t->l->costs;\\n\\t\\tif(t->r) t->sz+=t->r->sz, t->costs+=t->r->costs;\\n\\t\\tt->sum=t->suml+t->cost*t->szl;\\n\\t\\tt->sum2=t->suml+t->cost*t->szl;\\n\\t\\tif(t->l) t->sum+=t->l->sum, t->sum2+=t->l->sum2, t->sum+=t->l->costs*(t->val+t->szl), t->sum2+=t->l->sz*t->cost;\\n\\t\\tif(t->r) t->sum+=t->r->sum, t->sum2+=t->r->sum2, t->sum+=t->r->sz*t->cost, t->sum2+=t->r->costs*(t->val+t->szl);\\n\\t\\tif(t->l && t->r) t->sum+=t->l->costs*t->r->sz, t->sum2+=t->r->costs*t->l->sz;\\n\\t}\\n\\tvoid rotate(Node *t){\\n\\t\\tNode *p=t->p, *pp=p->p, *ch;\\n\\t\\tif(p->l==t) ch=t->r;\\n\\t\\telse ch=t->l;\\n\\t\\tif(pp){\\n\\t\\t\\tif(pp->l==p) pp->l=t;\\n\\t\\t\\telse if(pp->r==p) pp->r=t;\\n\\t\\t}\\n\\t\\tt->p=pp;\\n\\t\\tif(p->l==t) t->r=p;\\n\\t\\telse t->l=p;\\n\\t\\tp->p=t;\\n\\t\\tif(p->l==t) p->l=ch;\\n\\t\\telse p->r=ch;\\n\\t\\tif(ch) ch->p=p;\\n\\t\\tupdate(p);\\n\\t\\tupdate(t);\\n\\t}\\n\\tint state(Node *t){\\n\\t\\tif(t->is_root()) return 0;\\n\\t\\telse if(t->p->l==t) return 1;\\n\\t\\telse return -1;\\n\\t}\\n\\tvoid splay(Node *t){\\n\\t\\tpush(t);\\n\\t\\twhile(state(t)){\\n\\t\\t\\tif(!state(t->p)){\\n\\t\\t\\t\\tpush(t->p); push(t);\\n\\t\\t\\t\\trotate(t);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tpush(t->p->p); push(t->p); push(t);\\n\\t\\t\\t\\tif(state(t->p)==state(t)){\\n\\t\\t\\t\\t\\trotate(t->p);\\n\\t\\t\\t\\t\\trotate(t);\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\trotate(t);\\n\\t\\t\\t\\t\\trotate(t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tNode *expose(Node *t){\\n\\t\\tNode *rp=nullptr;\\n\\t\\tfor(Node *now=t; now; now=now->p){\\n\\t\\t\\tsplay(now);\\n\\t\\t\\tif(rp){\\n\\t\\t\\t\\tnow->szl-=rp->sz;\\n\\t\\t\\t\\tnow->suml-=rp->sum;\\n\\t\\t\\t}\\n\\t\\t\\tif(now->r){\\n\\t\\t\\t\\tnow->szl+=now->r->sz;\\n\\t\\t\\t\\tnow->suml+=now->r->sum;\\n\\t\\t\\t}\\n\\t\\t\\tnow->r=rp;\\n\\t\\t\\tupdate(now);\\n\\t\\t\\trp=now;\\n\\t\\t}\\n\\t\\tsplay(t);\\n\\t\\treturn rp;\\n\\t}\\n\\tvoid link(Node *c, Node *p){\\n\\t\\texpose(c);\\n\\t\\texpose(p);\\n\\t\\tp->r=c;\\n\\t\\tc->p=p;\\n\\t\\tupdate(p);\\n\\t}\\n\\tvoid cut(Node *c){\\n\\t\\texpose(c);\\n\\t\\tc->l->p=nullptr;\\n\\t\\tc->l=nullptr;\\n\\t\\tupdate(c);\\n\\t}\\n\\tvoid evert(Node *t){\\n\\t\\texpose(t);\\n\\t\\ttoggle(t);\\n\\t\\tpush(t);\\n\\t}\\n};\\nint main()\\n{\\n\\tint n; cin>>n;\\n\\tLinkCutTree lct(n);\\n\\tusing node=LinkCutTree::Node;\\n\\tfor(int i=0; i<n; i++){\\n\\t\\tint v; cin>>v;\\n\\t\\tlct.v[i]->val=mint(v);\\n\\t}\\n\\tint a[200020], b[200020];\\n for(int i=0; i<n-1; i++){\\n int w;\\n\\t\\tcin>>a[i]>>b[i]>>w;\\n a[i]--; b[i]--;\\n node *e=new node(mint(0), i+n, mint(w));\\n lct.v.push_back(e);\\n\\t\\tlct.link(e, lct.v[a[i]]);\\n\\t\\tlct.evert(e);\\n\\t\\tlct.link(e, lct.v[b[i]]);\\n }\\n\\tmint sum(0), sv(0);\\n\\tfor(int i=0; i<n; i++){\\n\\t\\tsv+=lct.v[i]->val;\\n\\t\\tlct.evert(lct.v[i]);\\n\\t\\tsum+=lct.v[i]->val*lct.v[i]->sum;\\n\\t}\\n\\tsum/=mint(2);\\n\\tprintf(\\\"%d\\\\n\\\", sum.x);\\n\\tint q; cin>>q;\\n while(q--){\\n int t, c, x; cin>>t>>c>>x;\\n\\t\\tc--;\\n if(t==1){\\n\\t\\t\\tlct.evert(lct.v[c]);\\n\\t\\t\\tsum+=mint(x)*lct.v[c]->sum;\\n\\t\\t\\tlct.v[c]->val+=mint(x);\\n\\t\\t\\tsv+=mint(x);\\n }else{\\n\\t\\t\\tlct.evert(lct.v[a[c]]);\\n\\t\\t\\tlct.cut(lct.v[c+n]);\\n\\t\\t\\tmint sl=lct.v[a[c]]->sz;\\n\\t\\t\\tlct.v[c+n]->cost+=mint(x);\\n\\t\\t\\tlct.link(lct.v[c+n], lct.v[a[c]]);\\n sum+=sl*(sv-sl)*mint(x);\\n }\\n\\t\\tprintf(\\\"%d\\\\n\\\", sum.x);\\n }\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1140,\n \"memory_kb\": 39164,\n \"score_of_the_acc\": -0.7797,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3179_4849134\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using vvec = vec<vec<T>>;\\n\\nconstexpr ll mod = 998244353;\\nstruct mint {\\n ll x;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n \\n friend ostream &operator<<(ostream& os,const mint& a){\\n return os << a.x;\\n }\\n\\n friend istream &operator>>(istream& is,mint& a){\\n ll t;\\n is >> t;\\n a = mint(t);\\n return (is);\\n }\\n\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) {\\n (x *= a.x) %= mod;\\n return *this;\\n }\\n mint operator+(const mint a) const {\\n mint res(*this);\\n return res+=a;\\n }\\n mint operator-(const mint a) const {\\n mint res(*this);\\n return res-=a;\\n }\\n mint operator*(const mint a) const {\\n mint res(*this);\\n return res*=a;\\n }\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n // for prime mod\\n mint inv() const {\\n return pow(mod-2);\\n }\\n mint& operator/=(const mint a) {\\n return (*this) *= a.inv();\\n }\\n mint operator/(const mint a) const {\\n mint res(*this);\\n return res/=a;\\n }\\n bool operator==(const mint& a)const{\\n return x==a.x;\\n }\\n};\\n\\n\\ntemplate<typename Monoid,typename OperatorMonoid,typename F,typename G,typename H>\\nclass LazySegmentTree {\\nprivate:\\n int sz,height;\\n vec<Monoid> data;\\n vec<OperatorMonoid> lazy;\\n const F op;\\n const G homo;\\n const H comp;\\n const Monoid e;\\n const OperatorMonoid Oe;\\npublic:\\n LazySegmentTree(int n,const F op,const G homo,const H comp,\\n const Monoid &e,const OperatorMonoid Oe)\\n : op(op),homo(homo),comp(comp),e(e),Oe(Oe) {\\n sz = 1;\\n height = 0;\\n while(sz<=n) sz <<= 1,height++;\\n data.assign(2*sz,e);\\n lazy.assign(2*sz,Oe);\\n }\\n\\n void set(int k,const Monoid &x) {\\n data[k+sz] = x;\\n }\\n\\n void build() {\\n for(int k=sz-1;k>0;k--) {\\n data[k] = op(data[2*k], data[2*k+1]);\\n }\\n }\\n\\n inline void propagate(int k) {\\n if(lazy[k]!=Oe) {\\n lazy[2*k] = comp(lazy[2*k], lazy[k]);\\n lazy[2*k+1] = comp(lazy[2*k+1], lazy[k]);\\n data[k] = reflect(k);\\n lazy[k] = Oe;\\n }\\n }\\n\\n inline Monoid reflect(int k) {\\n return lazy[k] == Oe? data[k]:homo(data[k],lazy[k]);\\n }\\n\\n inline void recalc(int k) {\\n while(k>>=1) data[k] = op(reflect(2*k), reflect(2*k+1));\\n }\\n\\n inline void thrust(int k) {\\n for(int i=height;i>0;i--) propagate(k>>i);\\n }\\n\\n void update(int a, int b, const OperatorMonoid &x) {\\n thrust(a+=sz);\\n thrust(b+=sz-1);\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) lazy[l] = comp(lazy[l],x),++l;\\n if(r&1) --r, lazy[r] = comp(lazy[r],x);\\n }\\n recalc(a);\\n recalc(b);\\n }\\n\\n Monoid query(int a, int b) {\\n thrust(a+=sz);\\n thrust(b+=sz-1);\\n Monoid L = e, R = e;\\n for(int l=a, r=b+1;l<r;l>>= 1,r>>=1) {\\n if(l&1) L = op(L,reflect(l++));\\n if(r&1) R = op(reflect(--r),R);\\n }\\n return op(L,R);\\n }\\n\\n Monoid operator[](const int &k) {\\n return query(k,k+1);\\n }\\n};\\n\\nstruct edge{\\n int to,id;\\n ll dist;\\n edge(int to,ll dist=1,int id=1):to(to),id(id),dist(dist){};\\n};\\n\\nclass HeavLightDecomposition{\\nprivate:\\n vvec<edge> g;\\n vec<int> sz,in,out,head,par,depth;\\n int pos;\\n\\n void dfs_sz(int cur,int p){\\n sz[cur] = 1;\\n par[cur] = p;\\n for(auto& e:g[cur]) if(e.to!=p){\\n depth[e.to] = depth[cur]+1;\\n dfs_sz(e.to,cur);\\n sz[cur] += sz[e.to];\\n if(sz[e.to]>sz[g[cur][0].to]) swap(e,g[cur][0]);\\n }\\n }\\n\\n void dfs_hld(int cur,int p){\\n in[cur] = pos++;\\n for(auto& e:g[cur]) if(e.to!=p){\\n head[e.to] = (e.to==g[cur][0].to? head[cur]:e.to);\\n dfs_hld(e.to,cur);\\n }\\n out[cur] = pos;\\n }\\npublic:\\n HeavLightDecomposition(){}\\n HeavLightDecomposition(int N,int root,vvec<edge> tree):\\n g(tree),sz(N),in(N),out(N),head(N),par(N),depth(N){\\n pos = 0;\\n depth[root] = 0;\\n dfs_sz(root,-1);\\n dfs_hld(root,-1);\\n }\\n\\n int lca(int u,int v){\\n while(true){\\n if(in[u]>in[v]) swap(u,v);\\n if(head[u]==head[v]) return u;\\n v = par[head[v]];\\n }\\n }\\n\\n template<class T,class G>\\n void update(int u,int v,const T& x,const G& g, bool isedge=false){\\n while(true){\\n if(in[u]>in[v]) swap(u,v);\\n if(head[u]==head[v]) break;\\n g(in[head[v]],in[v]+1,x);\\n v = par[head[v]];\\n }\\n g(in[u]+isedge,in[v]+1,x);\\n }\\n\\n\\n template<class T,class F,class Q>\\n T query(int u,int v,const T &e,const F& f,const Q& q,bool isedge=false){\\n T l = e,r = e;\\n while(true){\\n if(in[u]>in[v]){\\n swap(u,v); swap(l,r);\\n }\\n if(head[u]==head[v]) break;\\n l = f(q(in[head[v]],in[v]+1),l);\\n v = par[head[v]];\\n }\\n //非可換演算のときは左を反転！\\n //f(rev(f(q(a,b),l),r);\\n return f(f(q(in[u]+isedge,in[v]+1),l),r);\\n }\\n\\n int dep(int n){return depth[n];}\\n int get_in(int n){return in[n];}\\n};\\n\\nstruct state{\\n mint e,c,cc,ec,ecc;\\n int len;\\n};\\n\\nauto op = [](state L,state R)->state{\\n mint e = L.e+R.e;\\n mint c = L.c+R.c;\\n mint cc = L.cc+R.cc;\\n mint ec = L.ec+R.ec;\\n mint ecc = L.ecc+R.ecc;\\n int len = L.len+R.len;\\n return {e,c,cc,ec,ecc,len};\\n};\\n\\nauto func = [](state S,pair<mint,mint> p)->state{\\n mint dc = p.first,de = p.second;\\n //update by dc\\n S.cc += dc*dc*S.len+S.c*dc*2;\\n S.c += dc*S.len;\\n S.ecc += S.e*dc*dc+S.ec*dc*2;\\n S.ec += S.e*dc;\\n // update by de;\\n S.e += de*S.len;\\n S.ec += S.c*de;\\n S.ecc += S.cc*de;\\n return S;\\n};\\n\\nauto comp = [](pair<mint,mint> p,pair<mint,mint> q)->pair<mint,mint>{\\n return {p.first+q.first,p.second+q.second};\\n};\\n\\nint main() {\\n int N;\\n cin >> N;\\n mint sum = 0;\\n vec<mint> V(N);\\n for(auto& x:V){\\n cin >> x;\\n sum += x;\\n }\\n vvec<edge> g(N);\\n vec<int> A(N-1),B(N-1);\\n vec<ll> W(N-1);\\n for(int i=0;i<N-1;i++){\\n int a,b;\\n cin >> a >> b >> W[i];\\n a--; b--;\\n g[a].emplace_back(b,W[i],i);\\n g[b].emplace_back(a,W[i],i);\\n A[i] = a,B[i] = b;\\n }\\n LazySegmentTree<state,pair<mint,mint>,decltype(op),decltype(func),decltype(comp)>\\n seg(N,op,func,comp,(state){0,0,0,0,0,0},(pair<mint,mint>){0,0});\\n HeavLightDecomposition HLD(N,0,g);\\n vec<mint> c(N);\\n {\\n auto dfs = [&](auto&& self,int cur,int par)->void{\\n c[cur] = V[cur];\\n for(auto& e:g[cur]) if(e.to!=par){\\n self(self,e.to,cur);\\n c[cur] += c[e.to];\\n }\\n };\\n dfs(dfs,0,-1);\\n }\\n\\n auto make_state = [&](mint E,mint C)->state{\\n mint e = E;\\n mint c = C;\\n mint cc = C*C;\\n mint ec = E*C;\\n mint ecc = E*C*C;\\n int len = 1;\\n return {e,c,cc,ec,ecc,len};\\n };\\n\\n for(int i=0;i<N-1;i++){\\n if(HLD.dep(A[i])>HLD.dep(B[i])) swap(A[i],B[i]);\\n seg.set(HLD.get_in(B[i]),make_state(W[i],c[B[i]]));\\n }\\n seg.build();\\n auto calc = [&]()->mint{\\n state S = seg.query(0,N);\\n return S.ec*sum-S.ecc;\\n };\\n\\n auto update = [&](int l,int r,pair<mint,mint> p){\\n seg.update(l,r,p);\\n };\\n\\n int Q;\\n cin >> Q;\\n cout << calc() << \\\"\\\\n\\\";\\n for(int i=0;i<Q;i++){\\n int t;\\n cin >> t;\\n if(t==1){\\n int v,x;\\n cin >> v >> x;\\n v--;\\n HLD.update(0,v,(pair<mint,mint>){x,0},update,true);\\n sum += x;\\n }else if(t==2){\\n int v,x;\\n cin >> v >> x;\\n v--;\\n HLD.update(B[v],A[v],(pair<mint,mint>){0,x},update,true);\\n }\\n cout << calc() << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 102296,\n \"score_of_the_acc\": -0.9916,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3179_4847412\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 998244353;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m) {\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\n\\nconst int max_n = 1 << 18;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nusing mP = pair<modint, modint>;\\n\\nstruct BIT {\\nprivate:\\n\\tvector<modint> node, node2; int n;\\npublic:\\n\\tBIT(int n_) {\\n\\t\\tn = n_; node.resize(n, 0); node2.resize(n, 0);\\n\\t}\\n\\t//0-indexed\\n\\tvoid add(int a, int b, modint w) {\\n\\t\\tfor (int i = a; i < n; i |= i + 1)node[i] += (modint)-a * w;\\n\\t\\tfor (int i = b; i < n; i |= i + 1)node[i] += (modint)b * w;\\n\\t\\tfor (int i = a; i < n; i |= i + 1)node2[i] += w;\\n\\t\\tfor (int i = b; i < n; i |= i + 1)node2[i] += -w;\\n\\t}\\n\\tmodint sum(int a) {\\n\\t\\tll ret = 0;\\n\\t\\tfor (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i];\\n\\t\\tfor (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += (modint)a * node2[i];\\n\\t\\treturn ret;\\n\\t}\\n\\tmodint sum(int a, int b) {\\n\\t\\treturn sum(b) - sum(a);\\n\\t}\\n};\\n\\n\\nvector<mP> ori;\\nstruct SegT {\\nprivate:\\n\\tint n; vector<mP> node;\\n\\tvector<modint> lazy;\\n\\tconst mP init_c = { 0,0 };\\npublic:\\n\\tSegT(vector<int> v) {\\n\\t\\tint sz = v.size();\\n\\t\\tn = 1;\\n\\t\\twhile (n < sz)n <<= 1;\\n\\t\\tnode.resize(2 * n - 1, init_c);\\n\\t\\tlazy.resize(2 * n - 1, 0);\\n\\t\\trep(i, sz) {\\n\\t\\t\\tmodint e = ori[v[i]].first;\\n\\t\\t\\tmodint c = ori[v[i]].second;\\n\\t\\t\\tnode[i + n - 1] = { e * c,e };\\n\\t\\t}\\n\\t\\tper(i, n - 1) {\\n\\t\\t\\tnode[i] = f(node[2 * i + 1], node[2 * i + 2]);\\n\\t\\t}\\n\\t}\\n\\tmP f(mP a, mP b) {\\n\\t\\treturn { a.first + b.first,a.second + b.second };\\n\\t}\\n\\tvoid eval(int k, int l, int r) {\\n\\t\\tif (lazy[k] == (modint)0)return;\\n\\t\\tnode[k].first += node[k].second * lazy[k];\\n\\t\\tif (r - l > 1) {\\n\\t\\t\\tlazy[2 * k + 1] += lazy[k];\\n\\t\\t\\tlazy[2 * k + 2] += lazy[k];\\n\\t\\t}\\n\\t\\tlazy[k] = 0;\\n\\t}\\n\\tvoid add(modint x, int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = n;\\n\\t\\teval(k, l, r);\\n\\t\\tif (r <= a || b <= l)return;\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\tlazy[k] += x; eval(k, l, r);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tadd(x, a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tadd(x, a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tmP query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = n;\\n\\t\\teval(k, l, r);\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\tif (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tmP vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tmP vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n\\tvoid update(int loc, mP x) {\\n\\t\\tint k = 0, l = 0, r = n;\\n\\t\\tvector<P> st;\\n\\t\\twhile (k < n - 1) {\\n\\t\\t\\teval(k, l, r);\\n\\t\\t\\tst.push_back({ l,r });\\n\\t\\t\\tif (loc < (l + r) / 2) {\\n\\t\\t\\t\\tk = 2 * k + 1;\\n\\t\\t\\t\\tr = (l + r) / 2;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tk = 2 * k + 2;\\n\\t\\t\\t\\tl = (l + r) / 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\teval(k, l, r);\\n\\t\\tst.push_back({ l,r });\\n\\t\\tmodint e = x.first, c = x.second;\\n\\t\\tnode[k] = { e * c,e };\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tst.pop_back();\\n\\t\\t\\tl = st.back().first, r = st.back().second;\\n\\t\\t\\teval(2 * k + 1, l, (l + r) / 2);\\n\\t\\t\\teval(2 * k + 2, (l + r) / 2, r);\\n\\t\\t\\tnode[k] = f(node[2 * k + 1], node[2 * k + 2]);\\n\\t\\t}\\n\\t}\\n};\\n\\n\\nstruct edge {\\n\\tint to;\\n};\\nusing edges = vector<edge>;\\nusing Graph = vector<edges>;\\nstruct HLDecomposition {\\n\\tstruct Chain {\\n\\t\\tint depth;\\n\\t\\tP parent;//chain number,index\\n\\t\\tvector<P> child;//child chain number,parent index\\n\\t\\tvector<int> mapfrom;\\n\\t\\tSegT stree;\\n\\n\\t\\t//Chain() { ; }\\n\\t\\tChain(vector<int> seq) :stree(seq) { ; }\\n\\t};\\n\\tGraph baseG;\\n\\tvector<Chain> chains;\\n\\tvector<P> mapto;//raw index->chain number &index\\n\\tvector<vector<int>> mapfrom;//chain number & index ->raw index\\n\\n\\tHLDecomposition() { ; }\\n\\tHLDecomposition(const Graph& g) {\\n\\t\\tbaseG = g;\\n\\t\\tconst int n = baseG.size();\\n\\t\\tmapto = vector<P>(n, P{ -1,-1 });\\n\\t\\tmapfrom.clear();\\n\\t\\tvector<int> sz(n, 0);\\n\\t\\tint start = 0;\\n\\t\\t//assert(start != -1);\\n\\t\\tsize_check_bfs(start, sz);\\n\\t\\tdecomposition(start, start, 0, 0, 0, sz);\\n\\t}\\n\\tint depth(int t) {\\n\\t\\treturn chains[mapto[t].first].depth;\\n\\t}\\n\\nprivate:\\n\\tvoid size_check_bfs(int start, vector<int>& sz) {\\n\\t\\tconst int n = baseG.size();\\n\\t\\tqueue<P> que;\\n\\t\\tque.push({ start,start });\\n\\t\\tint cnt = 0; vector<int> ord(n, -1);\\n\\t\\twhile (!que.empty()) {\\n\\t\\t\\tint from, parent;\\n\\t\\t\\ttie(from, parent) = que.front(); que.pop();\\n\\t\\t\\tord[cnt++] = from;\\n\\t\\t\\tfor (edge e : baseG[from]) {\\n\\t\\t\\t\\tif (e.to == parent)continue;\\n\\t\\t\\t\\tque.push({ e.to,from });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//assert(cnt == n);\\n\\t\\treverse(all(ord));\\n\\t\\trep(i, n) {\\n\\t\\t\\tint from = ord[i];\\n\\t\\t\\tsz[from] = 1; for (edge e : baseG[from])sz[from] += sz[e.to];\\n\\t\\t}\\n\\t}\\n\\tint decomposition(int from, int parent, int depth, int pnumber, int pindex, const vector<int>& sz) {\\n\\t\\tvector<int> seq;\\n\\t\\tbfs(from, parent, seq, sz);\\n\\t\\tconst int c = chains.size();\\n\\t\\tchains.push_back(Chain(seq));\\n\\t\\t//chains.push_back(Chain());\\n\\t\\tchains[c].depth = depth;\\n\\t\\tchains[c].parent = { pnumber,pindex };\\n\\t\\trep(i, seq.size()) {\\n\\t\\t\\tmapto[seq[i]] = { c,i };\\n\\t\\t\\tchains[c].mapfrom.push_back(seq[i]);\\n\\t\\t}\\n\\t\\tmapfrom.push_back(chains[c].mapfrom);\\n\\t\\trep(i, seq.size()) {\\n\\t\\t\\tfor (edge e : baseG[seq[i]]) {\\n\\t\\t\\t\\tif (mapto[e.to].first != -1)continue;\\n\\t\\t\\t\\tint nc = decomposition(e.to, seq[i], depth + 1, c, i, sz);\\n\\t\\t\\t\\tchains[c].child.push_back({ nc,i });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn c;\\n\\t}\\n\\tvoid bfs(int from, int parent, vector<int>& seq, const vector<int>& sz) {\\n\\t\\tfor (;;) {\\n\\t\\t\\tseq.push_back(from);\\n\\t\\t\\tint best = -1, next = -1;\\n\\t\\t\\tfor (edge e : baseG[from]) {\\n\\t\\t\\t\\tif (e.to == parent)continue;\\n\\t\\t\\t\\tif (best < sz[e.to]) {\\n\\t\\t\\t\\t\\tbest = sz[e.to]; next = e.to;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (next == -1)break;\\n\\t\\t\\tparent = from; from = next;\\n\\t\\t}\\n\\t}\\n\\tvector<pair<int, P>> all_edge(int u, int v) {\\n\\t\\tvector<pair<int, P>> res;\\n\\t\\tif (depth(u) > depth(v))swap(u, v);\\n\\t\\twhile (depth(v) > depth(u)) {\\n\\t\\t\\tres.push_back({ mapto[v].first,{ 0,mapto[v].second + 1 } });\\n\\t\\t\\tP par = chains[mapto[v].first].parent;\\n\\t\\t\\tv = mapfrom[par.first][par.second];\\n\\t\\t}\\n\\t\\twhile (mapto[v].first != mapto[u].first) {\\n\\t\\t\\tres.push_back({ mapto[v].first,{ 0,mapto[v].second + 1 } });\\n\\t\\t\\tP par = chains[mapto[v].first].parent;\\n\\t\\t\\tv = mapfrom[par.first][par.second];\\n\\t\\t\\tres.push_back({ mapto[u].first,{ 0,mapto[u].second + 1 } });\\n\\t\\t\\tpar = chains[mapto[u].first].parent;\\n\\t\\t\\tu = mapfrom[par.first][par.second];\\n\\t\\t}\\n\\t\\tP p = minmax(mapto[v].second, mapto[u].second);\\n\\t\\tres.push_back({ mapto[v].first,{ p.first + 1,p.second + 1 } });\\n\\t\\treturn res;\\n\\t}\\n\\npublic:\\n\\n\\tvoid edge_add(int u, int v, int a) {\\n\\t\\tvector<pair<int, P>> es = all_edge(u, v);\\n\\t\\trep(i, es.size()) {\\n\\t\\t\\tint id = es[i].first;\\n\\t\\t\\tint l = es[i].second.first; int r = es[i].second.second;\\n\\t\\t\\tchains[id].stree.add(a, l, r);\\n\\t\\t}\\n\\t}\\n\\tvoid edge_update(int u, mP a) {\\n\\t\\tchains[mapto[u].first].stree.update(mapto[u].second, a);\\n\\t}\\n\\tmodint edge_sum(int u, int v) {\\n\\t\\tvector<pair<int, P>> es = all_edge(u, v);\\n\\t\\tmodint res = 0;\\n\\t\\trep(i, es.size()) {\\n\\t\\t\\tint id = es[i].first;\\n\\t\\t\\tint l = es[i].second.first; int r = es[i].second.second;\\n\\t\\t\\tres += chains[id].stree.query(l, r).first;\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\n\\n};\\n\\nstruct edge2 {\\n\\tint to; modint cost; int id;\\n};\\nvector<vector<edge2>> G;\\nvoid solve() {\\n\\tint n; cin >> n; G.resize(n); ori.resize(n);\\n\\tvector<ll> v(n);\\n\\trep(i, n)cin >> v[i];\\n\\tvector<modint> costs(n);\\n\\trep(i, n - 1) {\\n\\t\\tint a, b, c; cin >> a >> b >> c; a--; b--;\\n\\t\\tG[a].push_back({ b,c,i });\\n\\t\\tG[b].push_back({ a,c,i });\\n\\t}\\n\\tvector<int> trans(n);\\n\\tvector<int> ri(n);\\n\\n\\tvector<int> edgeloc(n - 1);\\n\\n\\tBIT fromcost(n);\\n\\tBIT vsum(n);\\n\\n\\tGraph g(n);\\n\\n\\tmodint ans = 0;\\n\\tmodint al = 0; rep(i, n)al += v[i];\\n\\tint tmp = 0;\\n\\tfunction<void(int, int)> dfs = [&](int id, int fr) {\\n\\t\\ttrans[id] = tmp; tmp++;\\n\\t\\tfor (edge2 e : G[id])if (e.to != fr) {\\n\\t\\t\\tdfs(e.to, id);\\n\\t\\t\\tedgeloc[e.id] = trans[e.to];\\n\\t\\t\\tcosts[trans[e.to]] = e.cost;\\n\\n\\t\\t\\tfromcost.add(trans[e.to], ri[trans[e.to]], e.cost);\\n\\n\\t\\t\\tg[trans[id]].push_back({ trans[e.to] });\\n\\t\\t\\tg[trans[e.to]].push_back({ trans[id] });\\n\\n\\t\\t\\tmodint tosum = vsum.sum(trans[e.to], ri[trans[e.to]]);\\n\\t\\t\\tori[trans[e.to]] = { e.cost,tosum };\\n\\t\\t\\tans += e.cost * tosum * (al - tosum);\\n\\t\\t}\\n\\t\\tvsum.add(trans[id], trans[id] + 1, v[id]);\\n\\t\\tri[trans[id]] = tmp;\\n\\t};\\n\\tdfs(0, -1);\\n\\n\\tHLDecomposition hld(g);\\n\\n\\tmodint fromsum = 0;\\n\\trep(i, n) {\\n\\t\\tfromsum += fromcost.sum(trans[i], trans[i] + 1) * (modint)v[i];\\n\\t}\\n\\n\\t//infolist\\n\\t//hld.add:v\\n\\t//hld.update:e\\n\\t//fromcost:e\\n\\t//fromsum:e,v\\n\\t//vsum:v\\n\\t//al :v\\n\\t//costs:e\\n\\tcout << ans << \\\"\\\\n\\\";\\n\\tint q; cin >> q;\\n\\trep(i, q) {\\n\\t\\tint t; cin >> t;\\n\\t\\tif (t == 1) {\\n\\t\\t\\tint a; modint x; ll in; cin >> a >> in; a--; x = in;\\n\\t\\t\\ta = trans[a];\\n\\n\\t\\t\\t//update answer\\n\\t\\t\\tmodint d = fromcost.sum(a, a + 1);\\n\\t\\t\\tans += d * x * al;\\n\\t\\t\\tans += x * fromsum;\\n\\t\\t\\tans -= (modint)2 * x * hld.edge_sum(0, a);\\n\\n\\t\\t\\t//update info\\n\\t\\t\\thld.edge_add(0, a, x);\\n\\t\\t\\tfromsum += d * x;\\n\\t\\t\\tvsum.add(a, a + 1, x);\\n\\t\\t\\tal += x;\\n\\t\\t}\\n\\t\\telse if (t == 2) {\\n\\t\\t\\tint a; modint x; ll in; cin >> a >> in; a--; x = in;\\n\\t\\t\\ta = edgeloc[a];\\n\\n\\t\\t\\t//update answer\\n\\t\\t\\tmodint b = vsum.sum(a, ri[a]);\\n\\t\\t\\tans += (al - b) * b * x;\\n\\n\\t\\t\\t//update info\\n\\t\\t\\tcosts[a] += x;\\n\\t\\t\\thld.edge_update(a, { costs[a],b });\\n\\t\\t\\tfromcost.add(a, ri[a], x);\\n\\t\\t\\tfromsum += x * b;\\n\\t\\t}\\n\\t\\tcout << ans << \\\"\\\\n\\\";\\n\\t}\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(15);\\n\\t//init_f();\\n\\t//expr();\\n\\t//int t; cin >> t; rep(i, t)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 124784,\n \"score_of_the_acc\": -1.0847,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3179_4846550\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <stack>\\n#include <numeric>\\n#include <bitset>\\n#include <cmath>\\n\\nstatic const int MOD = 998244353;\\nusing ll = long long;\\nusing u32 = unsigned;\\nusing u64 = unsigned long long;\\nusing namespace std;\\n\\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\\n\\ntemplate <u32 M>\\nstruct modint {\\n u32 val;\\npublic:\\n static modint raw(int v) { modint x; x.val = v; return x; }\\n modint() : val(0) {}\\n template <class T>\\n modint(T v) { ll x = (ll)(v%(ll)(M)); if (x < 0) x += M; val = u32(x); }\\n modint(bool v) { val = ((unsigned int)(v) % M); }\\n modint& operator++() { val++; if (val == M) val = 0; return *this; }\\n modint& operator--() { if (val == 0) val = M; val--; return *this; }\\n modint operator++(int) { modint result = *this; ++*this; return result; }\\n modint operator--(int) { modint result = *this; --*this; return result; }\\n modint& operator+=(const modint& b) { val += b.val; if (val >= M) val -= M; return *this; }\\n modint& operator-=(const modint& b) { val -= b.val; if (val >= M) val += M; return *this; }\\n modint& operator*=(const modint& b) { u64 z = val; z *= b.val; val = (u32)(z % M); return *this; }\\n modint& operator/=(const modint& b) { return *this = *this * b.inv(); }\\n modint operator+() const { return *this; }\\n modint operator-() const { return modint() - *this; }\\n modint pow(long long n) const { modint x = *this, r = 1; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }\\n modint inv() const { return pow(M-2); }\\n friend modint operator+(const modint& a, const modint& b) { return modint(a) += b; }\\n friend modint operator-(const modint& a, const modint& b) { return modint(a) -= b; }\\n friend modint operator*(const modint& a, const modint& b) { return modint(a) *= b; }\\n friend modint operator/(const modint& a, const modint& b) { return modint(a) /= b; }\\n friend bool operator==(const modint& a, const modint& b) { return a.val == b.val; }\\n friend bool operator!=(const modint& a, const modint& b) { return a.val != b.val; }\\n};\\nusing mint = modint<MOD>;\\n\\nclass HeavyLightDecomposition {\\n void dfs_sz(int v){\\n for (auto &&u : G[v]) {\\n if(u == par[v]) continue;\\n par[u] = v; dep[u] = dep[v] + 1;\\n dfs_sz(u);\\n sub_size[v] += sub_size[u];\\n if(sub_size[u] > sub_size[G[v][0]]) swap(u, G[v][0]);\\n }\\n }\\n\\n void dfs_hld(int v, int c, int &pos){\\n id[v] = pos++;\\n id_inv[id[v]]= v;\\n tree_id[v] = c;\\n for (auto &&u : G[v]) {\\n if(u == par[v]) continue;\\n head[u] = (u == G[v][0] ? head[v] : u);\\n dfs_hld(u, c, pos);\\n }\\n }\\n\\npublic:\\n int n;\\n vector<vector<int>> G;\\n vector<int> par, dep, sub_size, id, id_inv, tree_id, head;\\n explicit HeavyLightDecomposition(int n) : n(n), G(n), par(n), dep(n), sub_size(n, 1),\\n id(n), id_inv(n), tree_id(n), head(n){}\\n explicit HeavyLightDecomposition(vector<vector<int>> &G) :\\n G(G), n(G.size()), par(n), dep(n) , sub_size(n, 1), id(n), id_inv(n), tree_id(n), head(n) {}\\n\\n void add_edge(int u, int v){\\n G[u].emplace_back(v);\\n G[v].emplace_back(u);\\n }\\n\\n void build(vector<int> roots = {0}){\\n int c = 0, pos = 0;\\n for (auto &&i : roots) {\\n dfs_sz(i);\\n head[i] = i;\\n dfs_hld(i, c++, pos);\\n }\\n }\\n\\n int lca(int u, int v){\\n while(true){\\n if(id[u] > id[v]) swap(u, v);\\n if(head[u] == head[v]) return u;\\n v = par[head[v]];\\n }\\n }\\n\\n int distance(int u, int v){\\n return dep[u] + dep[v] - 2*dep[lca(u, v)];\\n }\\n\\n\\n template<typename F>\\n void query(int u, int v, const F &f){\\n while(true){\\n if(id[u] > id[v]) swap(u, v);\\n f(max(id[head[v]], id[u]), id[v]+1);\\n if(head[u] == head[v]) break;\\n v = par[head[v]];\\n }\\n }\\n\\n template<typename F>\\n void query_edge(int u, int v, const F &f){\\n while(true){\\n if(id[u] > id[v]) swap(u, v);\\n if(head[u] != head[v]) {\\n f(id[head[v]], id[v]+1);\\n v = par[head[v]];\\n }else {\\n if(u != v) f(id[u]+1, id[v]+1);\\n break;\\n }\\n }\\n }\\n\\n template<typename T, typename Q, typename F>\\n T query(int u, int v, const T &e, const Q &q, const F &f){\\n T l = e, r = e;\\n while(true){\\n if(id[u] > id[v]) swap(u, v), swap(l, r);\\n l = f(l, q(max(id[head[v]], id[u]), id[v]+1));\\n if(head[u] != head[v]) v = par[head[v]];\\n else break;\\n }\\n return f(l, r);\\n }\\n\\n};\\n\\ntemplate <class M>\\nstruct LazySegmentTree{\\n using T = typename M::T;\\n using L = typename M::L;\\n int sz, n, height{};\\n vector<T> seg; vector<L> lazy;\\n explicit LazySegmentTree(int n) : n(n) {\\n sz = 1; while(sz < n) sz <<= 1, height++;\\n seg.assign(2*sz, M::e());\\n lazy.assign(2*sz, M::l());\\n }\\n\\n void set(int k, const T &x){ seg[k + sz] = x; }\\n\\n void build(){\\n for (int i = sz-1; i > 0; --i) seg[i] = M::f(seg[i<<1], seg[(i<<1)|1]);\\n }\\n\\n T reflect(int k){ return lazy[k] == M::l() ? seg[k] : M::g(seg[k], lazy[k]); }\\n\\n void eval(int k){\\n if(lazy[k] == M::l()) return;\\n if(k < sz){\\n lazy[(k<<1)|0] = M::h(lazy[(k<<1)|0], lazy[k]);\\n lazy[(k<<1)|1] = M::h(lazy[(k<<1)|1], lazy[k]);\\n }\\n seg[k] = reflect(k);\\n lazy[k] = M::l();\\n }\\n void thrust(int k){ for (int i = height; i; --i) eval(k>>i); }\\n void recalc(int k) { while(k >>= 1) seg[k] = M::f(reflect((k<<1)|0), reflect((k<<1)|1));}\\n\\n void update(int a, const T &x){\\n thrust(a += sz);\\n seg[a] = x;\\n recalc(a);\\n }\\n\\n void update(int a, int b, const L &x){\\n thrust(a += sz); thrust(b += sz-1);\\n for (int l = a, r = b+1;l < r; l >>=1, r >>= 1) {\\n if(l&1) lazy[l] = M::h(lazy[l], x), l++;\\n if(r&1) --r, lazy[r] = M::h(lazy[r], x);\\n }\\n recalc(a);\\n recalc(b);\\n }\\n\\n T query(int a, int b){ // [l, r)\\n thrust(a += sz);\\n thrust(b += sz-1);\\n T ll = M::e(), rr = M::e();\\n for(int l = a, r = b+1; l < r; l >>=1, r>>=1) {\\n if (l & 1) ll = M::f(ll, reflect(l++));\\n if (r & 1) rr = M::f(reflect(--r), rr);\\n }\\n return M::f(ll, rr);\\n }\\n\\n template<class F>\\n int search_right(int l, F cond){\\n if(l == n) return n;\\n thrust(l += sz);\\n T val = M::e();\\n do {\\n while(!(l&1)) l >>= 1;\\n if(!cond(M::f(val, seg[l]))){\\n while(l < sz) {\\n eval(l); l <<= 1;\\n if (cond(M::f(val, reflect(l)))){\\n val = M::f(val, reflect(l++));\\n }\\n }\\n return l - sz;\\n }\\n val = M::f(val, reflect(l++));\\n } while((l & -l) != l);\\n return n;\\n }\\n\\n template<class F>\\n int search_left(int r, F cond){\\n if(r <= 0) return 0;\\n thrust((r += sz)-1);\\n T val = M::e();\\n do {\\n r--;\\n while(r > 1 && r&1) r >>= 1;\\n if(!cond(M::f(reflect(r), val))){\\n while(r < sz) {\\n eval(r);\\n r = ((r << 1)|1);\\n if (cond(M::f(reflect(r), val))){\\n val = M::f(reflect(r--), val);\\n }\\n }\\n return r + 1 - sz;\\n }\\n val = M::f(reflect(r), val);\\n } while((r & -r) != r);\\n return 0;\\n }\\n};\\n\\nstruct Monoid{\\n\\n using T = array<mint, 6>; // len, x, y, xy, y^2, xy^2\\n using L = array<mint, 2>; // dx, dy;\\n static T f(T a, T b) {\\n T ret{};\\n for (int i = 0; i < 6; ++i) ret[i] = a[i]+b[i];\\n return ret;\\n }\\n static T g(T a, L b) {\\n T ret = {\\n a[0],\\n a[1]+b[0],\\n a[2]+b[1],\\n a[3] + a[1]*b[1] + a[2]*b[0] + b[0]*b[1]*a[0],\\n a[4] + a[2]*b[1]*2 + b[1]*b[1]*a[0],\\n a[5] + b[1]*(b[1]*(a[0]*b[0]+a[1])+(b[0]*a[2]+a[3])*2) + b[0]*a[4]\\n };\\n return ret;\\n }\\n static L h(L a, L b) {\\n return {a[0]+b[0], a[1]+b[1]};\\n }\\n static T e() { return {}; }\\n static L l() { return {}; }\\n};\\n\\nint main() {\\n int n;\\n cin >> n;\\n mint s = 0;\\n vector<int> v(n);\\n for (auto &&i : v) scanf(\\\"%d\\\", &i), s += i;\\n HeavyLightDecomposition hld(n);\\n vector<int> a(n-1), b(n-1), w(n-1);\\n vector<vector<pair<int, int>>> G(n);\\n for (int i = 0; i < n-1; ++i) {\\n cin >> a[i] >> b[i] >> w[i];\\n a[i]--; b[i]--;\\n hld.add_edge(a[i], b[i]);\\n G[a[i]].emplace_back(b[i], i*2);\\n G[b[i]].emplace_back(a[i], i*2+1);\\n }\\n vector<int> to(n-1); // どの頂点に辺を任せるか\\n hld.build();\\n vector<mint> dp(n);\\n for (int i = 0; i < n; ++i) dp[i] = v[i];\\n LazySegmentTree<Monoid> seg(n);\\n auto dfs = [&](int x, int par, auto &&f) -> void {\\n for (auto &&i : G[x]) {\\n if(i.first != par){\\n to[i.second/2] = i.first;\\n f(i.first, x, f);\\n dp[x] += dp[i.first];\\n seg.set(hld.id[i.first], {1, w[i.second/2], dp[i.first], w[i.second/2]*dp[i.first], dp[i.first]*dp[i.first],w[i.second/2]*dp[i.first]*dp[i.first]});\\n }\\n }\\n };\\n dfs(0, -1, dfs);\\n seg.build();\\n int q;\\n cin >> q;\\n auto ans = [&](){\\n auto res = seg.query(0, n);\\n printf(\\\"%d\\\\n\\\", (s*res[3]-res[5]).val);\\n };\\n ans();\\n while(q--){\\n int t, x, y;\\n scanf(\\\"%d %d %d\\\", &t, &x, &y);\\n x--;\\n if(t == 2){\\n seg.update(hld.id[to[x]], hld.id[to[x]]+1, {y, 0});\\n }else {\\n s += y;\\n hld.query_edge(0, x, [&](int l, int r){ seg.update(l, r, {0, y}); });\\n }\\n ans();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 570,\n \"memory_kb\": 59652,\n \"score_of_the_acc\": -0.5359,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3179_4845769\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll=long long;\\n#define int ll\\n\\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\\n#define rep(i,b) rng(i,0,b)\\n#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)\\n#define per(i,b) gnr(i,0,b)\\n#define pb push_back\\n#define eb emplace_back\\n#define a first\\n#define b second\\n#define bg begin()\\n#define ed end()\\n#define all(x) x.bg,x.ed\\n#define si(x) int(x.size())\\n#ifdef LOCAL\\n#define dmp(x) cerr<<__LINE__<<\\\" \\\"<<#x<<\\\" \\\"<<x<<endl\\n#else\\n#define dmp(x) void(0)\\n#endif\\n\\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\\n\\ntemplate<class t> using vc=vector<t>;\\ntemplate<class t> using vvc=vc<vc<t>>;\\n\\nusing pi=pair<int,int>;\\nusing vi=vc<int>;\\n\\ntemplate<class t,class u>\\nostream& operator<<(ostream& os,const pair<t,u>& p){\\n\\treturn os<<\\\"{\\\"<<p.a<<\\\",\\\"<<p.b<<\\\"}\\\";\\n}\\n\\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\\n\\tos<<\\\"{\\\";\\n\\tfor(auto e:v)os<<e<<\\\",\\\";\\n\\treturn os<<\\\"}\\\";\\n}\\n\\n#define mp make_pair\\n#define mt make_tuple\\n#define one(x) memset(x,-1,sizeof(x))\\n#define zero(x) memset(x,0,sizeof(x))\\n#ifdef LOCAL\\nvoid dmpr(ostream&os){os<<endl;}\\ntemplate<class T,class... Args>\\nvoid dmpr(ostream&os,const T&t,const Args&... args){\\n\\tos<<t<<\\\" \\\";\\n\\tdmpr(os,args...);\\n}\\n#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)\\n#else\\n#define dmp2(...) void(0)\\n#endif\\n\\nusing uint=unsigned;\\nusing ull=unsigned long long;\\n\\ntemplate<class t,size_t n>\\nostream& operator<<(ostream&os,const array<t,n>&a){\\n\\treturn os<<vc<t>(all(a));\\n}\\n\\ntemplate<int i,class T>\\nvoid print_tuple(ostream&,const T&){\\n}\\n\\ntemplate<int i,class T,class H,class ...Args>\\nvoid print_tuple(ostream&os,const T&t){\\n\\tif(i)os<<\\\",\\\";\\n\\tos<<get<i>(t);\\n\\tprint_tuple<i+1,T,Args...>(os,t);\\n}\\n\\ntemplate<class ...Args>\\nostream& operator<<(ostream&os,const tuple<Args...>&t){\\n\\tos<<\\\"{\\\";\\n\\tprint_tuple<0,tuple<Args...>,Args...>(os,t);\\n\\treturn os<<\\\"}\\\";\\n}\\n\\ntemplate<class t>\\nvoid print(t x,int suc=1){\\n\\tcout<<x;\\n\\tif(suc==1)\\n\\t\\tcout<<\\\"\\\\n\\\";\\n\\tif(suc==2)\\n\\t\\tcout<<\\\" \\\";\\n}\\n\\nll read(){\\n\\tll i;\\n\\tcin>>i;\\n\\treturn i;\\n}\\n\\nvi readvi(int n,int off=0){\\n\\tvi v(n);\\n\\trep(i,n)v[i]=read()+off;\\n\\treturn v;\\n}\\n\\npi readpi(int off=0){\\n\\tint a,b;cin>>a>>b;\\n\\treturn pi(a+off,b+off);\\n}\\n\\ntemplate<class T>\\nvoid print(const vector<T>&v,int suc=1){\\n\\trep(i,v.size())\\n\\t\\tprint(v[i],i==int(v.size())-1?suc:2);\\n}\\n\\nstring readString(){\\n\\tstring s;\\n\\tcin>>s;\\n\\treturn s;\\n}\\n\\ntemplate<class T>\\nT sq(const T& t){\\n\\treturn t*t;\\n}\\n\\n//#define CAPITAL\\nvoid yes(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"YES\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Yes\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid no(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"NO\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"No\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid possible(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"POSSIBLE\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Possible\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid impossible(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"IMPOSSIBLE\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Impossible\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\n\\nconstexpr ll ten(int n){\\n\\treturn n==0?1:ten(n-1)*10;\\n}\\n\\nconst ll infLL=LLONG_MAX/3;\\n\\n#ifdef int\\nconst int inf=infLL;\\n#else\\nconst int inf=INT_MAX/2-100;\\n#endif\\n\\nint topbit(signed t){\\n\\treturn t==0?-1:31-__builtin_clz(t);\\n}\\nint topbit(ll t){\\n\\treturn t==0?-1:63-__builtin_clzll(t);\\n}\\nint botbit(signed a){\\n\\treturn a==0?32:__builtin_ctz(a);\\n}\\nint botbit(ll a){\\n\\treturn a==0?64:__builtin_ctzll(a);\\n}\\nint popcount(signed t){\\n\\treturn __builtin_popcount(t);\\n}\\nint popcount(ll t){\\n\\treturn __builtin_popcountll(t);\\n}\\nbool ispow2(int i){\\n\\treturn i&&(i&-i)==i;\\n}\\nll mask(int i){\\n\\treturn (ll(1)<<i)-1;\\n}\\n\\nbool inc(int a,int b,int c){\\n\\treturn a<=b&&b<=c;\\n}\\n\\ntemplate<class t> void mkuni(vc<t>&v){\\n\\tsort(all(v));\\n\\tv.erase(unique(all(v)),v.ed);\\n}\\n\\nll rand_int(ll l, ll r) { //[l, r]\\n\\t#ifdef LOCAL\\n\\tstatic mt19937_64 gen;\\n\\t#else\\n\\tstatic mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n\\t#endif\\n\\treturn uniform_int_distribution<ll>(l, r)(gen);\\n}\\n\\ntemplate<class t>\\nvoid myshuffle(vc<t>&a){\\n\\trep(i,si(a))swap(a[i],a[rand_int(0,i)]);\\n}\\n\\ntemplate<class t>\\nint lwb(const vc<t>&v,const t&a){\\n\\treturn lower_bound(all(v),a)-v.bg;\\n}\\n\\nvvc<int> readGraph(int n,int m){\\n\\tvvc<int> g(n);\\n\\trep(i,m){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\t//sc.read(a,b);\\n\\t\\ta--;b--;\\n\\t\\tg[a].pb(b);\\n\\t\\tg[b].pb(a);\\n\\t}\\n\\treturn g;\\n}\\n\\nvvc<int> readTree(int n){\\n\\treturn readGraph(n,n-1);\\n}\\n\\nstruct modinfo{uint mod,root;};\\ntemplate<modinfo const&ref>\\nstruct modular{\\n\\tstatic constexpr uint const &mod=ref.mod;\\n\\tstatic modular root(){return modular(ref.root);}\\n\\tuint v;\\n\\t//modular(initializer_list<uint>ls):v(*ls.bg){}\\n\\tmodular(ll vv=0){s(vv%mod+mod);}\\n\\tmodular& s(uint vv){\\n\\t\\tv=vv<mod?vv:vv-mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tmodular operator-()const{return modular()-*this;}\\n\\tmodular& operator+=(const modular&rhs){return s(v+rhs.v);}\\n\\tmodular&operator-=(const modular&rhs){return s(v+mod-rhs.v);}\\n\\tmodular&operator*=(const modular&rhs){\\n\\t\\tv=ull(v)*rhs.v%mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tmodular&operator/=(const modular&rhs){return *this*=rhs.inv();}\\n\\tmodular operator+(const modular&rhs)const{return modular(*this)+=rhs;}\\n\\tmodular operator-(const modular&rhs)const{return modular(*this)-=rhs;}\\n\\tmodular operator*(const modular&rhs)const{return modular(*this)*=rhs;}\\n\\tmodular operator/(const modular&rhs)const{return modular(*this)/=rhs;}\\n\\tmodular pow(int n)const{\\n\\t\\tmodular res(1),x(*this);\\n\\t\\twhile(n){\\n\\t\\t\\tif(n&1)res*=x;\\n\\t\\t\\tx*=x;\\n\\t\\t\\tn>>=1;\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\tmodular inv()const{return pow(mod-2);}\\n\\t/*modular inv()const{\\n\\t\\tint x,y;\\n\\t\\tint g=extgcd<ll>(v,mod,x,y);\\n\\t\\tassert(g==1);\\n\\t\\tif(x<0)x+=mod;\\n\\t\\treturn modular(x);\\n\\t}*/\\n\\tfriend modular operator+(int x,const modular&y){\\n\\t\\treturn modular(x)+y;\\n\\t}\\n\\tfriend modular operator-(int x,const modular&y){\\n\\t\\treturn modular(x)-y;\\n\\t}\\n\\tfriend modular operator*(int x,const modular&y){\\n\\t\\treturn modular(x)*y;\\n\\t}\\n\\tfriend modular operator/(int x,const modular&y){\\n\\t\\treturn modular(x)/y;\\n\\t}\\n\\tfriend ostream& operator<<(ostream&os,const modular&m){\\n\\t\\treturn os<<m.v;\\n\\t}\\n\\tfriend istream& operator>>(istream&is,modular&m){\\n\\t\\tll x;is>>x;\\n\\t\\tm=modular(x);\\n\\t\\treturn is;\\n\\t}\\n\\tbool operator<(const modular&r)const{return v<r.v;}\\n\\tbool operator==(const modular&r)const{return v==r.v;}\\n\\tbool operator!=(const modular&r)const{return v!=r.v;}\\n\\texplicit operator bool()const{\\n\\t\\treturn v;\\n\\t}\\n};\\n\\nextern constexpr modinfo base{998244353,3};\\n//extern constexpr modinfo base{1000000007,0};\\n//modinfo base{1,0};\\nusing mint=modular<base>;\\n\\n//内部でグラフをいじるから in,out を使うときは注意\\n//VERIFY: yosupo\\n//CF530F\\n//CodeChef Persistent Oak\\n//AOJ GRL5C\\ntemplate<class E>\\nstruct HLD{\\n\\tvvc<E> g;\\n\\tint n,rt,cnt;\\n\\tvi sub,in,out,par,head,dep;\\n\\tvc<E> pare;\\n\\tint dfs1(int v,int p,E pe,int d){\\n\\t\\tpar[v]=p;\\n\\t\\tpare[v]=pe;\\n\\t\\tdep[v]=d;\\n\\t\\tg[v].erase(remove(all(g[v]),p),g[v].ed);\\n\\t\\tfor(auto&e:g[v]){\\n\\t\\t\\tsub[v]+=dfs1(e,v,e,d+1);\\n\\t\\t\\tif(sub[g[v][0]]<sub[e])\\n\\t\\t\\t\\tswap(g[v][0],e);\\n\\t\\t}\\n\\t\\treturn sub[v];\\n\\t}\\n\\tvoid dfs2(int v,int h){\\n\\t\\tin[v]=cnt++;\\n\\t\\thead[v]=h;\\n\\t\\tfor(int to:g[v])\\n\\t\\t\\tdfs2(to,to==g[v][0]?h:to);\\n\\t\\tout[v]=cnt;\\n\\t}\\n\\tHLD(){}\\n\\tHLD(const vvc<E>&gg,int rr):g(gg),n(g.size()),rt(rr),cnt(0),\\n\\t\\tsub(n,1),in(n),out(n),par(n,-1),head(n),dep(n),pare(n){\\n\\t\\tdfs1(rt,-1,E(),0);\\n\\t\\tdfs2(rt,rt);\\n\\t}\\n\\tint lca(int a,int b){\\n\\t\\twhile(head[a]!=head[b]){\\n\\t\\t\\tif(dep[head[a]]>dep[head[b]])\\n\\t\\t\\t\\tswap(a,b);\\n\\t\\t\\tb=par[head[b]];\\n\\t\\t}\\n\\t\\tif(dep[a]>dep[b])\\n\\t\\t\\tswap(a,b);\\n\\t\\treturn a;\\n\\t}\\n\\tint len(int a,int b){\\n\\t\\treturn dep[a]+dep[b]-dep[lca(a,b)]*2;\\n\\t}\\n\\tbool asde(int a,int b){\\n\\t\\treturn in[a]<=in[b]&&out[b]<=out[a];\\n\\t}\\n\\t//XX Opencup GP of Korea\\n\\t//CF625 F\\n\\t//2020 Multi-Uni Contest Day5 G\\n\\t//CF415E\\n\\tvi index;\\n\\t//vs を含む virtual tree を返す\\n\\t//返すのは virtual tree に使われた頂点と，辺の集合\\n\\t//辺の端点は，virtual tree における番号\\n\\t//元の木における番号を virtual tree の頂点番号に写すのが，index という変数\\n\\t//辺は ch->par の順\\n\\t//virtual tree は行き掛け順で番号がついている\\n\\t//特に，頂点 0 が根になるようにできている\\n\\tpair<vi,vc<pi>> tree_compress(vi vs){\\n\\t\\tif(si(index)==0)index.resize(n);\\n\\t\\tassert(index.size());\\n\\t\\tauto comp = [&](int x,int y){\\n\\t\\t\\treturn in[x] < in[y];\\n\\t\\t};\\n\\t\\tsort(all(vs),comp);\\n\\t\\tvs.erase(unique(all(vs)),vs.ed);\\n\\t\\tint k = vs.size();\\n\\t\\trep(i,k-1){\\n\\t\\t\\tvs.pb(lca(vs[i],vs[i+1]));\\n\\t\\t}\\n\\t\\tsort(all(vs),comp);\\n\\t\\tvs.erase(unique(all(vs)),vs.ed);\\n\\t\\tk = vs.size();\\n\\t\\trep(i,k) index[vs[i]] = i;\\n\\t\\tvc<pi> es;\\n\\t\\trng(i,1,k){\\n\\t\\t\\tint p = lca(vs[i-1],vs[i]);\\n\\t\\t\\tes.eb(i,index[p]);\\n\\t\\t}\\n\\t\\treturn mp(vs,es);\\n\\t}\\n};\\n\\n//merge で片方が inactive のときはもう片方をそのまま返す，\\n//といったときに，lazy の情報までコピーして渡さないようにする\\n\\n//get の最後の引数は単位元と口では言いつつ・・・？\\n//たとえば min で最後の引数を 0 にしても 1 とかが返ってくることはある（一敗）\\n\\n//VERIFY: yosupo\\n//KUPC2017I\\n//HDU 5306 Gorgeous Sequence\\n//findmin/max CF458E\\ntemplate<class N>\\nstruct segbeats{\\n\\tvc<N> x;\\n\\tint s;\\n\\tsegbeats(){}\\n\\ttemplate<class T>\\n\\tsegbeats(const vc<T>& a){\\n\\t\\tint n=a.size();\\n\\t\\ts=1;\\n\\t\\twhile(s<n)s*=2;\\n\\t\\tx.resize(s*2);\\n\\t\\trep(i,n)\\n\\t\\t\\tx[s+i]=N(a[i]);\\n\\t\\tgnr(i,1,s)\\n\\t\\t\\tupd(i);\\n\\t}\\n\\tvoid push(int i){\\n\\t\\tx[i].push(x[i*2],x[i*2+1]);\\n\\t}\\n\\tvoid upd(int i){\\n\\t\\tx[i]=N::merge(x[i*2],x[i*2+1]);\\n\\t}\\n\\ttemplate<class F,class... Args>\\n\\tvoid chr(int l,int r,int i,int b,int e,F f,Args&&... args){\\n\\t\\tif(e<=l||r<=b)\\n\\t\\t\\treturn;\\n\\t\\tif(b<=l&&r<=e&&(x[i].*f)(forward<Args>(args)...))\\n\\t\\t\\treturn;\\n\\t\\tpush(i);\\n\\t\\tint m=(l+r)/2;\\n\\t\\tchr(l,m,i*2,b,e,f,forward<Args>(args)...);\\n\\t\\tchr(m,r,i*2+1,b,e,f,forward<Args>(args)...);\\n\\t\\tupd(i);\\n\\t}\\n\\ttemplate<class F,class... Args>\\n\\tvoid ch(int b,int e,F f,Args&&... args){\\n\\t\\tassert(b<=e);\\n\\t\\tchr(0,s,1,b,e,f,forward<Args>(args)...);\\n\\t}\\n\\t//use decltype((declval<N>().*F())()) for old-fashioned judges\\n\\ttemplate<class F,class G,class H>\\n\\tauto getr(int l,int r,int i,int b,int e,F f,G g,H h){\\n\\t\\tif(e<=l||r<=b)\\n\\t\\t\\treturn h;\\n\\t\\tif(b<=l&&r<=e)\\n\\t\\t\\treturn (x[i].*f)();\\n\\t\\tpush(i);\\n\\t\\tint m=(l+r)/2;\\n\\t\\treturn g(getr(l,m,i*2,b,e,f,g,h),getr(m,r,i*2+1,b,e,f,g,h));\\n\\t}\\n\\ttemplate<class F,class G,class H>\\n\\tauto get(int b,int e,F f,G g,H h){\\n\\t\\tassert(b<=e);\\n\\t\\treturn getr(0,s,1,b,e,f,g,h);\\n\\t}\\n\\tauto compositer(int l,int r,int i,int b,int e){\\n\\t\\tif(e<=l||r<=b)assert(0);\\n\\t\\tif(b<=l&&r<=e)\\n\\t\\t\\treturn x[i];\\n\\t\\tpush(i);\\n\\t\\tint m=(l+r)/2;\\n\\t\\tif(e<=m)return compositer(l,m,i*2,b,e);\\n\\t\\tif(m<=b)return compositer(m,r,i*2+1,b,e);\\n\\t\\treturn N::merge(compositer(l,m,i*2,b,e),compositer(m,r,i*2+1,b,e));\\n\\t}\\n\\t//work without identity node\\n\\tauto composite(int b,int e){\\n\\t\\tassert(b<e);\\n\\t\\treturn compositer(0,s,1,b,e);\\n\\t}\\n\\tN getall(){return x[1];}\\n\\t//return minimum index\\n\\ttemplate<class F,class...Args>\\n\\tpair<int,N> findminr(int i,int l,int r,int b,int e,F f,Args&&...args){\\n\\t\\tif(e<=l||r<=b)return {e,N()};\\n\\t\\tif(b<=l&&r<=e){\\n\\t\\t\\tif(!(x[i].*f)(forward<Args>(args)...))return {e,N()};\\n\\t\\t\\tif(r-l==1)return {l,x[i]};\\n\\t\\t}\\n\\t\\tpush(i);\\n\\t\\tint m=(l+r)/2;\\n\\t\\tauto a=findminr(i*2,l,m,b,e,f,forward<Args>(args)...);\\n\\t\\tif(a.a<e)return a;\\n\\t\\treturn findminr(i*2+1,m,r,b,e,f,forward<Args>(args)...);\\n\\t}\\n\\ttemplate<class F,class...Args>\\n\\tpair<int,N> findmin(int b,int e,F f,Args&&...args){\\n\\t\\tassert(b<=e);\\n\\t\\treturn findminr(1,0,s,b,e,f,forward<Args>(args)...);\\n\\t}\\n\\t//return maximum index\\n\\ttemplate<class F,class...Args>\\n\\tpair<int,N> findmaxr(int i,int l,int r,int b,int e,F f,Args&&...args){\\n\\t\\tif(e<=l||r<=b)return {b-1,N()};\\n\\t\\tif(b<=l&&r<=e){\\n\\t\\t\\tif(!(x[i].*f)(forward<Args>(args)...))return {b-1,N()};\\n\\t\\t\\tif(r-l==1)return {l,x[i]};\\n\\t\\t}\\n\\t\\tpush(i);\\n\\t\\tint m=(l+r)/2;\\n\\t\\tauto a=findmaxr(i*2+1,m,r,b,e,f,forward<Args>(args)...);\\n\\t\\tif(a.a>=b)return a;\\n\\t\\treturn findmaxr(i*2,l,m,b,e,f,forward<Args>(args)...);\\n\\t}\\n\\ttemplate<class F,class...Args>\\n\\tpair<int,N> findmax(int b,int e,F f,Args&&...args){\\n\\t\\tassert(b<=e);\\n\\t\\treturn findmaxr(1,0,s,b,e,f,forward<Args>(args)...);\\n\\t}\\n\\tvoid enumerater(int l,int r,int i,int b,int e,vc<N>&dst){\\n\\t\\tif(e<=l||r<=b)\\n\\t\\t\\treturn;\\n\\t\\tif(l+1==r){\\n\\t\\t\\tdst.pb(x[i]);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tpush(i);\\n\\t\\tint m=(l+r)/2;\\n\\t\\tenumerater(l,m,i*2,b,e,dst);\\n\\t\\tenumerater(m,r,i*2+1,b,e,dst);\\n\\t}\\n\\tvoid enumerate(int b,int e,vc<N>&dst){\\n\\t\\tassert(b<=e);\\n\\t\\treturn enumerater(0,s,1,b,e,dst);\\n\\t}\\n\\t\\n\\t//KUPC 2020 G\\n\\ttemplate<class F,class...Args>\\n\\tvoid enumerate_by_findr(int l,int r,int i,int b,int e,vc<pair<int,N>>&dst,F f,Args&&...args){\\n\\t\\tif(e<=l||r<=b||!(x[i].*f)(forward<Args>(args)...))\\n\\t\\t\\treturn;\\n\\t\\tif(l+1==r){\\n\\t\\t\\tdst.eb(l,x[i]);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tpush(i);\\n\\t\\tint m=(l+r)/2;\\n\\t\\tenumerate_by_findr(l,m,i*2,b,e,dst,f,forward<Args>(args)...);\\n\\t\\tenumerate_by_findr(m,r,i*2+1,b,e,dst,f,forward<Args>(args)...);\\n\\t}\\n\\ttemplate<class F,class...Args>\\n\\tvoid enumerate_by_find(int b,int e,vc<pair<int,N>>&dst,F f,Args&&...args){\\n\\t\\tassert(b<=e);\\n\\t\\tenumerate_by_findr(0,s,1,b,e,dst,f,forward<Args>(args)...);\\n\\t}\\n\\tvoid prepare(int i){\\n\\t\\tif(i/=2){\\n\\t\\t\\tprepare(i);\\n\\t\\t\\tpush(i);\\n\\t\\t}\\n\\t}\\n\\t//point_update と lazy を組み合わせたらどうなるかは，わからない・・・\\n\\tvoid point_update(int i,N w){\\n\\t\\ti+=s;\\n\\t\\tprepare(i);\\n\\t\\tx[i]=w;\\n\\t\\twhile(i/=2)\\n\\t\\t\\tupd(i);\\n\\t}\\n};\\n\\n//N::push\\n//pushしたあとはclearする\\n//N::merge\\n\\n//simple range max\\nstruct N{\\n\\tmint w,sum,lz;\\n\\tN(mint v=0):w(v),sum(0),lz(0){}\\n\\tbool addw(mint v){\\n\\t\\tw+=v;\\n\\t\\tsum+=lz*v;\\n\\t\\treturn true;\\n\\t}\\n\\tbool addlz(mint v){\\n\\t\\tsum+=w*v;\\n\\t\\tlz+=v;\\n\\t\\treturn true;\\n\\t}\\n\\tvoid push(N&x,N&y){\\n\\t\\tx.addlz(lz);\\n\\t\\ty.addlz(lz);\\n\\t\\tlz=0;\\n\\t}\\n\\tstatic N merge(N x,N y){\\n\\t\\tN res;\\n\\t\\tres.w=x.w+y.w;\\n\\t\\tres.sum=x.sum+y.sum;\\n\\t\\treturn res;\\n\\t}\\n\\tmint getsum(){\\n\\t\\treturn sum;\\n\\t}\\n};\\n\\ntemplate<class t>\\nstruct BIT{\\n\\tvc<t> buf;\\n\\tint s;\\n\\tBIT(int n=0){init(n);}\\n\\tvoid init(int n){buf.assign(s=n,0);}\\n\\tvoid add(int i,t v){\\n\\t\\tfor(;i<s;i+=(i+1)&(-i-1))\\n\\t\\t\\tbuf[i]+=v;\\n\\t}\\n\\tt get(int i){\\n\\t\\tt res=0;\\n\\t\\tfor(;i>=0;i-=(i+1)&(-i-1))\\n\\t\\t\\tres+=buf[i];\\n\\t\\treturn res;\\n\\t}\\n\\tt sum(int b,int e){\\n\\t\\treturn get(e-1)-get(b-1);\\n\\t}\\n\\tint kth(int k){\\n\\t\\tint res=0;\\n\\t\\tfor(int i=topbit(s);i>=0;i--){\\n\\t\\t\\tint w=res+(1<<i);\\n\\t\\t\\tif(w<=s&&buf[w-1]<=k){\\n\\t\\t\\t\\tk-=buf[w-1];\\n\\t\\t\\t\\tres=w;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\t//yukicoder No.1024\\n\\tint kth_helper(int k,int i){\\n\\t\\treturn kth(k+get(i-1));\\n\\t}\\n};\\n\\nstruct E{\\n\\tint to,idx;\\n\\toperator int()const{return to;}\\n};\\n\\nsigned main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(0);\\n\\tcout<<fixed<<setprecision(20);\\n\\t\\n\\tint n;cin>>n;\\n\\tvc<mint> rwv(n);\\n\\trep(i,n)cin>>rwv[i];\\n\\tvc<mint> rwe(n-1);\\n\\tvvc<E> t(n);\\n\\trep(i,n-1){\\n\\t\\tint a,b;cin>>a>>b;\\n\\t\\ta--;b--;\\n\\t\\tt[a].pb({b,i});\\n\\t\\tt[b].pb({a,i});\\n\\t\\tmint c;cin>>c;\\n\\t\\trwe[i]=c;\\n\\t}\\n\\tBIT<mint> cur(n),dep(n);\\n\\tHLD<E> hld(t,0);\\n\\tsegbeats<N> seg(vc<mint>(n,0));\\n\\tmint ans=0,sum=0,tot=0;\\n\\tauto add_vert=[&](int i,mint w){\\n\\t\\tmint d=dep.get(hld.in[i]);\\n\\t\\tmint g=0;\\n\\t\\t{\\n\\t\\t\\tint x=i;\\n\\t\\t\\twhile(x!=-1){\\n\\t\\t\\t\\tint h=hld.head[x];\\n\\t\\t\\t\\tint p=hld.par[h];\\n\\t\\t\\t\\tint l=hld.in[h]+(p==-1),r=hld.in[x]+1;\\n\\t\\t\\t\\tif(l<r){\\n\\t\\t\\t\\t\\tg+=seg.get(l,r,&N::getsum,\\n\\t\\t\\t\\t\\t[](mint a,mint b){return a+b;},mint(0));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tx=p;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmint a=cur.sum(hld.in[i],hld.in[i]+1);\\n\\t\\tdmp2(d,a,g,sum,tot);\\n\\t\\tans+=(sum+tot*d-g*2)*w;\\n\\t\\tsum+=d*w;\\n\\t\\tcur.add(hld.in[i],w);\\n\\t\\ttot+=w;\\n\\t\\t{\\n\\t\\t\\tint x=i;\\n\\t\\t\\twhile(x!=-1){\\n\\t\\t\\t\\tint h=hld.head[x];\\n\\t\\t\\t\\tint p=hld.par[h];\\n\\t\\t\\t\\tint l=hld.in[h]+(p==-1),r=hld.in[x]+1;\\n\\t\\t\\t\\tif(l<r)seg.ch(l,r,&N::addlz,w);\\n\\t\\t\\t\\tx=p;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t};\\n\\tvi cv(n-1);\\n\\trng(i,1,n)cv[hld.pare[i].idx]=i;\\n\\tauto add_edge=[&](int i,mint w){\\n\\t\\tint v=cv[i],u=hld.par[v];\\n\\t\\tmint sub=cur.sum(hld.in[v],hld.out[v]);\\n\\t\\tdmp2(sub,tot,w);\\n\\t\\tans+=sub*(tot-sub)*w;\\n\\t\\tdep.add(hld.in[v],w);\\n\\t\\tdep.add(hld.out[v],-w);\\n\\t\\tseg.ch(hld.in[v],hld.in[v]+1,&N::addw,w);\\n\\t\\tsum+=w*sub;\\n\\t};\\n\\trep(i,n)add_vert(i,rwv[i]);\\n\\tdmp(ans);\\n\\trep(i,n-1)add_edge(i,rwe[i]);\\n\\tint q;cin>>q;\\n\\tprint(ans);\\n\\trep(_,q){\\n\\t\\tint tp;cin>>tp;\\n\\t\\tint i;cin>>i;i--;\\n\\t\\tmint x;cin>>x;\\n\\t\\tif(tp==1){\\n\\t\\t\\tadd_vert(i,x);\\n\\t\\t}else{\\n\\t\\t\\tadd_edge(i,x);\\n\\t\\t}\\n\\t\\tprint(ans);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 69240,\n \"score_of_the_acc\": -0.8852,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3179_4845651\",\n \"code_snippet\": \"#include <bits/extc++.h>\\n\\nstruct graph {\\n struct edge {\\n int src, dst;\\n int64_t cost;\\n\\n int operator-(int v) const {\\n assert(v == src or v == dst);\\n return src ^ dst ^ v;\\n }\\n };\\n\\n int n, m;\\n std::vector<edge> edges;\\n std::vector<std::vector<std::pair<int, int>>> adj;\\n std::function<bool(int)> ignore;\\n\\n graph(int _n = 0) : n(_n), m(0), adj(n), ignore([](int) { return false; }) {}\\n\\n int add(const edge& e, bool directed) {\\n assert(0 <= e.src), assert(e.src < n);\\n assert(0 <= e.dst), assert(e.dst < n);\\n edges.push_back(e);\\n adj[e.src].emplace_back(m, e.dst);\\n if (not directed) adj[e.dst].emplace_back(m, e.src);\\n return m++;\\n }\\n};\\n\\nstruct dfs_forest : graph {\\n using cost_t = decltype(edge::cost);\\n\\n std::vector<int> root, pv, pe, sz, depth, min_depth, last, order, in, out;\\n std::vector<cost_t> dist;\\n int trials;\\n\\n dfs_forest(int _n = 0) : graph(_n), dist(n), trials(0) {\\n for (auto p : {&root, &pv, &pe, &sz, &depth, &min_depth, &last, &in, &out})\\n p->assign(n, -1);\\n }\\n\\n int add(const edge& e) { return graph::add(e, false); }\\n void build(int r, bool clear_order = true) {\\n assert(0 <= r), assert(r < n);\\n root[r] = r, pv[r] = pe[r] = -1, depth[r] = 0, dist[r] = cost_t{};\\n if (clear_order) order.clear();\\n dfs(r);\\n ++trials;\\n }\\n void build() {\\n fill(begin(root), end(root), -1);\\n for (int v = 0; v < n; ++v)\\n if (root[v] == -1) build(v, v == 0);\\n }\\n int deeper(int id) const {\\n assert(0 <= id), assert(id < m), assert(not ignore(id));\\n int u = edges[id].src, v = edges[id].dst;\\n return depth[u] < depth[v] ? v : u;\\n }\\n bool is_tree_edge(int id) const {\\n assert(0 <= id), assert(id < m), assert(not ignore(id));\\n return id == pe[deeper(id)];\\n }\\n bool is_ancestor(int u, int v) const {\\n assert(0 <= u), assert(u < n);\\n assert(0 <= v), assert(v < n);\\n return in[u] <= in[v] and out[v] <= out[u];\\n }\\n\\n private:\\n void dfs(int v) {\\n sz[v] = 1, min_depth[v] = depth[v], last[v] = trials;\\n in[v] = size(order), order.push_back(v);\\n for (auto [id, u] : adj[v]) {\\n if (ignore(id) or id == pe[v]) continue;\\n if (last[u] == trials) {\\n min_depth[v] = std::min(min_depth[v], depth[u]);\\n continue;\\n }\\n root[u] = root[v], pv[u] = v, pe[u] = id, depth[u] = depth[v] + 1;\\n dist[u] = dist[v] + edges[id].cost;\\n dfs(u);\\n sz[v] += sz[u], min_depth[v] = std::min(min_depth[v], min_depth[u]);\\n }\\n out[v] = size(order);\\n }\\n};\\n\\nstruct hld_forest : dfs_forest {\\n std::vector<int> head;\\n\\n hld_forest(int _n = 0) : dfs_forest(_n), head(n) {}\\n\\n void build_hld(int r, bool clear_order = true) {\\n assert(0 <= r), assert(r < n);\\n build(r, clear_order);\\n order.erase(end(order) - sz[r], end(order));\\n head[r] = r;\\n dfs_hld(r);\\n }\\n void build_hld() {\\n fill(begin(root), end(root), -1);\\n for (int v = 0; v < n; ++v)\\n if (root[v] == -1) build_hld(v, v == 0);\\n }\\n int lca(int u, int v) const {\\n assert(0 <= u), assert(u < n);\\n assert(0 <= v), assert(v < n);\\n assert(root[u] == root[v]);\\n while (true) {\\n if (in[u] > in[v]) std::swap(u, v);\\n if (head[u] == head[v]) return u;\\n v = pv[head[v]];\\n }\\n }\\n int d(int u, int v) const {\\n assert(0 <= u), assert(u < n);\\n assert(0 <= v), assert(v < n);\\n assert(root[u] == root[v]);\\n return depth[u] + depth[v] - 2 * depth[lca(u, v)];\\n }\\n cost_t distance(int u, int v) const {\\n assert(0 <= u), assert(u < n);\\n assert(0 <= v), assert(v < n);\\n assert(root[u] == root[v]);\\n return dist[u] + dist[v] - 2 * dist[lca(u, v)];\\n }\\n int la(int v, int d) const {\\n assert(0 <= v), assert(v < n);\\n assert(0 <= d), assert(d <= depth[v]);\\n while (depth[head[v]] > d) v = pv[head[v]];\\n return order[in[head[v]] + (d - depth[head[v]])];\\n }\\n int next(int src, int dst) const {\\n assert(0 <= src), assert(src < n);\\n assert(0 <= dst), assert(dst < n);\\n assert(root[src] == root[dst]);\\n assert(src != dst);\\n if (not is_ancestor(src, dst)) return pv[src];\\n return la(dst, depth[src] + 1);\\n }\\n int next(int src, int dst, int k) const {\\n assert(0 <= src), assert(src < n);\\n assert(0 <= dst), assert(dst < n);\\n assert(root[src] == root[dst]);\\n assert(k >= 0);\\n int v = lca(src, dst);\\n if (k <= depth[src] - depth[v]) return la(src, depth[src] - k);\\n k -= depth[src] - depth[v];\\n assert(k <= depth[dst] - depth[v]);\\n return la(dst, depth[v] + k);\\n }\\n template <class Function>\\n void apply(int src, int dst, bool vertex, Function func) const {\\n assert(0 <= src), assert(src < n);\\n assert(0 <= dst), assert(dst < n);\\n assert(root[src] == root[dst]);\\n int v = lca(src, dst);\\n for (auto [a, b] : ascend(src, v)) func(a + 1, b);\\n if (vertex) func(in[v], in[v] + 1);\\n for (auto [a, b] : descend(v, dst)) func(a, b + 1);\\n }\\n\\n private:\\n void dfs_hld(int v) {\\n in[v] = size(order), order.push_back(v);\\n sort(begin(adj[v]), end(adj[v]), [&](auto a, auto b) {\\n int au = a.second, bu = b.second;\\n return (a.first == pe[au]) * sz[au] > (b.first == pe[bu]) * sz[bu];\\n });\\n for (auto [id, u] : adj[v]) {\\n if (ignore(id) or id == pe[v] or not is_tree_edge(id)) continue;\\n head[u] = u == adj[v][0].second ? head[v] : u;\\n dfs_hld(u);\\n }\\n out[v] = size(order);\\n }\\n auto ascend(int src, int dst) const {\\n std::vector<std::pair<int, int>> res;\\n while (head[src] != head[dst]) {\\n res.emplace_back(in[src], in[head[src]]);\\n src = pv[head[src]];\\n }\\n if (src != dst) res.emplace_back(in[src], in[dst] + 1);\\n return res;\\n }\\n std::vector<std::pair<int, int>> descend(int src, int dst) const {\\n if (src == dst) return {};\\n if (head[src] == head[dst]) return {{in[src] + 1, in[dst]}};\\n auto res = descend(src, pv[head[dst]]);\\n res.emplace_back(in[head[dst]], in[dst]);\\n return res;\\n }\\n};\\n\\ntemplate <uint32_t Modulus>\\nstruct modular {\\n static_assert(int(Modulus) > 0, \\\"Modulus must be in the range [1, 2^31)\\\");\\n static constexpr int modulus() { return Modulus; }\\n\\n modular() : v(0) {}\\n modular(int64_t x) : v(x % Modulus) {\\n if (int(v) < 0) v += Modulus;\\n }\\n\\n explicit operator int() const { return v; }\\n modular& operator++() { return ++v == Modulus ? v = 0 : 0, *this; }\\n modular& operator--() { return --(v ? v : v = Modulus), *this; }\\n modular operator+() const { return *this; }\\n modular operator-() const {\\n modular res;\\n res.v = v ? Modulus - v : 0;\\n return res;\\n }\\n modular& operator*=(modular b) {\\n v = uint64_t(v) * b.v % Modulus;\\n return *this;\\n }\\n modular& operator/=(modular b) {\\n auto [x, gcd] = extgcd(b.v, Modulus);\\n assert(gcd == 1);\\n return *this *= x;\\n }\\n modular& operator+=(modular b) {\\n v += b.v - Modulus;\\n if (int(v) < 0) v += Modulus;\\n return *this;\\n }\\n modular& operator-=(modular b) {\\n v -= b.v;\\n if (int(v) < 0) v += Modulus;\\n return *this;\\n }\\n\\n friend modular operator++(modular& a, int) {\\n return std::exchange(a, ++modular(a));\\n }\\n friend modular operator--(modular& a, int) {\\n return std::exchange(a, --modular(a));\\n }\\n friend modular operator*(modular a, modular b) { return a *= b; }\\n friend modular operator/(modular a, modular b) { return a /= b; }\\n friend modular operator+(modular a, modular b) { return a += b; }\\n friend modular operator-(modular a, modular b) { return a -= b; }\\n friend std::istream& operator>>(std::istream& is, modular& b) {\\n int64_t x;\\n return is >> x, b = x, is;\\n }\\n friend std::ostream& operator<<(std::ostream& os, modular b) {\\n return os << b.v;\\n }\\n friend bool operator==(modular a, modular b) { return a.v == b.v; }\\n friend bool operator!=(modular a, modular b) { return a.v != b.v; }\\n\\n private:\\n static std::pair<int, int> extgcd(int a, int b) {\\n std::array x{1, 0};\\n while (b) {\\n int q = a / b;\\n std::swap(x[0] -= q * x[1], x[1]);\\n std::swap(a -= q * b, b);\\n }\\n return {x[0], a};\\n }\\n\\n uint32_t v;\\n};\\n\\ntemplate <class T>\\nstruct fenwick {\\n fenwick() {}\\n template <class Generator>\\n fenwick(int n, Generator gen) : tree(n) {\\n for (int i = 0; i < n; ++i) tree[i] = gen(i);\\n for (int i = 0; i < n; ++i)\\n if (int j = i | (i + 1); j < n) tree[j] += tree[i];\\n }\\n\\n int size() const { return std::size(tree); }\\n void add(int i, T a) {\\n assert(0 <= i), assert(i < size());\\n for (; i < size(); i |= i + 1) tree[i] += a;\\n }\\n T sum(int i) const {\\n assert(0 <= i), assert(i <= size());\\n T res{};\\n for (; i; i &= i - 1) res += tree[i - 1];\\n return res;\\n }\\n T sum(int l, int r) const {\\n assert(0 <= l), assert(l <= r), assert(r <= size());\\n return sum(r) - sum(l);\\n }\\n T get(int i) const {\\n assert(0 <= i), assert(i < size());\\n return sum(i, i + 1);\\n }\\n\\n private:\\n std::vector<T> tree;\\n};\\n\\nstruct segment_tree_base {\\n virtual int size() const = 0;\\n\\n protected:\\n template <class F>\\n void forward(int l, int r, F f) const {\\n int h = h1(l += size() - 1, r += size());\\n for (int s = 0; s < h; ++s)\\n if (int i = l >> s; ~i & 1) f(i + 1);\\n for (int s = h; s--;)\\n if (int i = r >> s; i & 1) f(i - 1);\\n }\\n template <class F>\\n void forward(int l, int r, F f) {\\n const_cast<const segment_tree_base*>(this)->forward(l, r, f);\\n }\\n template <class F>\\n void backward(int l, int r, F f) const {\\n int h = h1(l += size() - 1, r += size());\\n for (int s = 0; s < h; ++s)\\n if (int i = r >> s; i & 1) f(i - 1);\\n for (int s = h; s--;)\\n if (int i = l >> s; ~i & 1) f(i + 1);\\n }\\n template <class F>\\n void backward(int l, int r, F f) {\\n const_cast<const segment_tree_base*>(this)->backward(l, r, f);\\n }\\n template <class F>\\n void downward(int l, int r, F f) const {\\n if (l == r or (l == 0 and r == size())) return;\\n int h = h2(l += size(), r += size());\\n for (int s = std::__lg(l); s > h; --s) f(l >> s);\\n for (int s = h; s > __builtin_ctz(l); --s) f(l >> s);\\n for (int s = h; s > __builtin_ctz(r); --s) f(r >> s);\\n }\\n template <class F>\\n void downward(int l, int r, F f) {\\n const_cast<const segment_tree_base*>(this)->downward(l, r, f);\\n }\\n template <class F>\\n void upward(int l, int r, F f) const {\\n if (l == r or (l == 0 and r == size())) return;\\n int h = h2(l += size(), r += size());\\n for (int s = __builtin_ctz(r); s++ < h;) f(r >> s);\\n for (int s = __builtin_ctz(l); s++ < h;) f(l >> s);\\n for (int s = h; s++ < std::__lg(l);) f(l >> s);\\n }\\n template <class F>\\n void upward(int l, int r, F f) {\\n const_cast<const segment_tree_base*>(this)->upward(l, r, f);\\n }\\n\\n private:\\n static int h1(int l, int r) {\\n for (int h = 0;; ++h)\\n if ((r >> h) - (l >> h) == 1) return h;\\n }\\n static int h2(int l, int r) {\\n l <<= std::__lg(l) < std::__lg(r);\\n return std::__lg(l ^ r);\\n }\\n};\\n\\ntemplate <class T, class Action>\\nstruct lazy_segment_tree : segment_tree_base {\\n lazy_segment_tree() {}\\n template <class Generator>\\n lazy_segment_tree(int n, Generator gen) : tree(2 * n), lazy(n) {\\n for (int i = 0; i < n; ++i) tree[n + i] = gen(i);\\n for (int i = n; i-- > 1;) pull(i);\\n }\\n\\n int size() const override { return std::size(lazy); }\\n T fold(int l, int r) {\\n assert(0 <= l), assert(l <= r), assert(r <= size());\\n downward(l, r, [&](int i) { push(i); });\\n T res{};\\n forward(l, r, [&](int i) { res = res * tree[i]; });\\n return res;\\n }\\n T get(int i) {\\n assert(0 <= i), assert(i < size());\\n return fold(i, i + 1);\\n }\\n T fold_all_rotated() const { return size() ? tree[1] : T{}; }\\n template <class Function>\\n void update(int i, Function func) {\\n assert(0 <= i), assert(i < size());\\n downward(i, i + 1, [&](int j) { push(j); });\\n tree[size() + i] = func(tree[size() + i]);\\n upward(i, i + 1, [&](int j) { pull(j); });\\n }\\n void act(int l, int r, const Action& f) {\\n assert(0 <= l), assert(l <= r), assert(r <= size());\\n downward(l, r, [&](int i) { push(i); });\\n forward(l, r, [&](int i) { apply(i, f); });\\n upward(l, r, [&](int i) { pull(i); });\\n }\\n template <class Predicate>\\n int forward_search(int l, int r, Predicate pred) {\\n assert(0 <= l), assert(l <= r), assert(r <= size());\\n downward(l, r, [&](int i) { push(i); });\\n T a{};\\n assert(pred(a));\\n int res = r;\\n forward(l, r, [&](int i) {\\n if (res < r) return;\\n if (T na = a * tree[i]; pred(na)) {\\n a = na;\\n return;\\n }\\n while (i < size()) {\\n push(i);\\n if (T na = a * tree[i *= 2]; pred(na)) a = na, ++i;\\n }\\n res = i - size();\\n });\\n return res;\\n }\\n template <class Predicate>\\n int backward_search(int l, int r, Predicate pred) {\\n assert(0 <= l), assert(l <= r), assert(r <= size());\\n downward(l, r, [&](int i) { push(i); });\\n T a{};\\n assert(pred(a));\\n int res = l - 1;\\n backward(l, r, [&](int i) {\\n if (res >= l) return;\\n if (T na = a * tree[i]; pred(na)) {\\n a = na;\\n return;\\n }\\n while (i < size()) {\\n push(i);\\n if (T na = a * tree[i = 2 * i + 1]; pred(na)) a = na, --i;\\n }\\n res = i - size();\\n });\\n return res;\\n }\\n\\n private:\\n std::vector<T> tree;\\n std::vector<Action> lazy;\\n\\n void apply(int i, const Action& f) {\\n tree[i] = f(tree[i]);\\n if (i < size()) lazy[i] = lazy[i] * f;\\n }\\n void push(int i) {\\n apply(2 * i, lazy[i]), apply(2 * i + 1, lazy[i]);\\n lazy[i] = Action{};\\n }\\n void pull(int i) { tree[i] = tree[2 * i] * tree[2 * i + 1]; }\\n};\\n\\nusing mint = modular<998244353>;\\n\\nstruct node {\\n mint sum, coeff;\\n friend node operator*(const node& a, const node& b) {\\n return {a.sum + b.sum, a.coeff + b.coeff};\\n }\\n};\\nstruct action {\\n mint v;\\n node operator()(node x) const {\\n x.sum += x.coeff * v;\\n return x;\\n }\\n friend action operator*(const action& f, const action& g) {\\n return {f.v + g.v};\\n }\\n};\\n\\nint main() {\\n using namespace std;\\n cin.tie(nullptr)->sync_with_stdio(false);\\n int n;\\n cin >> n;\\n vector<int> initial_v(n);\\n for (auto&& e : initial_v) cin >> e;\\n hld_forest g(n);\\n for (int _ = n - 1; _--;) {\\n int u, v, w;\\n cin >> u >> v >> w;\\n --u, --v;\\n g.add({u, v, w});\\n }\\n g.build_hld();\\n\\n fenwick<mint> fv(n, [&](int i) -> mint { return initial_v[g.order[i]]; });\\n fenwick<mint> fe(\\n n, [&](int i) -> mint { return i ? g.edges[g.pe[g.order[i]]].cost : 0; });\\n lazy_segment_tree<node, action> seg(n, [&](int i) -> node {\\n if (i == 0) return {};\\n int v = g.order[i];\\n int temp = g.edges[g.pe[v]].cost;\\n return {fv.sum(g.in[v], g.out[v]) * temp, temp};\\n });\\n\\n mint ans;\\n for (int id = 0; id < n - 1; ++id) {\\n int v = g.deeper(id);\\n auto temp = fv.sum(g.in[v], g.out[v]);\\n ans += g.edges[id].cost * temp * (fv.sum(n) - temp);\\n }\\n cout << ans << '\\\\n';\\n\\n int q;\\n cin >> q;\\n while (q--) {\\n int type;\\n cin >> type;\\n if (type == 1) {\\n int v, x;\\n cin >> v >> x;\\n --v;\\n ans += seg.fold_all_rotated().sum * x;\\n mint path;\\n g.apply(0, v, false, [&](int l, int r) {\\n if (l > r) swap(l, r);\\n ans -= seg.fold(l, r).sum * x * 2;\\n path += fe.sum(l, r);\\n });\\n ans += fv.sum(n) * path * x;\\n fv.add(g.in[v], x);\\n g.apply(0, v, false, [&](int l, int r) {\\n if (l > r) swap(l, r);\\n seg.act(l, r, {x});\\n });\\n } else if (type == 2) {\\n int id, x;\\n cin >> id >> x;\\n --id;\\n int v = g.deeper(id);\\n auto temp = fv.sum(g.in[v], g.out[v]);\\n ans += x * temp * (fv.sum(n) - temp);\\n fe.add(g.in[v], x);\\n seg.update(g.in[v], [&](node e) -> node {\\n e.sum += temp * x;\\n e.coeff += x;\\n return e;\\n });\\n } else\\n assert(false);\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 52340,\n \"score_of_the_acc\": -0.1539,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3179_4845289\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\n// const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nconst int64 infll = (1LL << 62) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\ntemplate< typename SUM, typename KEY >\\nstruct LinkCutTreeSubtree {\\n\\n struct Node {\\n Node *l, *r, *p;\\n\\n KEY key;\\n SUM sum;\\n\\n bool rev;\\n int sz;\\n\\n bool is_root() const {\\n return !p || (p->l != this && p->r != this);\\n }\\n\\n Node(const KEY &key, const SUM &sum) :\\n key(key), sum(sum), rev(false), sz(1),\\n l(nullptr), r(nullptr), p(nullptr) {}\\n };\\n\\n const SUM ident;\\n\\n LinkCutTreeSubtree(const SUM &ident) : ident(ident) {}\\n\\n Node *make_node(const KEY &key) {\\n auto ret = new Node(key, ident);\\n update(ret);\\n return ret;\\n }\\n\\n Node *set_key(Node *t, const KEY &key) {\\n expose(t);\\n t->key = key;\\n update(t);\\n return t;\\n }\\n\\n void toggle(Node *t) {\\n swap(t->l, t->r);\\n t->sum.toggle();\\n t->rev ^= true;\\n }\\n\\n void push(Node *t) {\\n if(t->rev) {\\n if(t->l) toggle(t->l);\\n if(t->r) toggle(t->r);\\n t->rev = false;\\n }\\n }\\n\\n\\n void update(Node *t) {\\n t->sz = 1;\\n if(t->l) t->sz += t->l->sz;\\n if(t->r) t->sz += t->r->sz;\\n t->sum.merge(t->key, t->l ? t->l->sum : ident, t->r ? t->r->sum : ident);\\n }\\n\\n void rotr(Node *t) {\\n auto *x = t->p, *y = x->p;\\n if((x->l = t->r)) t->r->p = x;\\n t->r = x, x->p = t;\\n update(x), update(t);\\n if((t->p = y)) {\\n if(y->l == x) y->l = t;\\n if(y->r == x) y->r = t;\\n update(y);\\n }\\n }\\n\\n void rotl(Node *t) {\\n auto *x = t->p, *y = x->p;\\n if((x->r = t->l)) t->l->p = x;\\n t->l = x, x->p = t;\\n update(x), update(t);\\n if((t->p = y)) {\\n if(y->l == x) y->l = t;\\n if(y->r == x) y->r = t;\\n update(y);\\n }\\n }\\n\\n\\n void splay(Node *t) {\\n push(t);\\n while(!t->is_root()) {\\n auto *q = t->p;\\n if(q->is_root()) {\\n push(q), push(t);\\n if(q->l == t) rotr(t);\\n else rotl(t);\\n } else {\\n auto *r = q->p;\\n push(r), push(q), push(t);\\n if(r->l == q) {\\n if(q->l == t) rotr(q), rotr(t);\\n else rotl(t), rotr(t);\\n } else {\\n if(q->r == t) rotl(q), rotl(t);\\n else rotr(t), rotl(t);\\n }\\n }\\n }\\n }\\n\\n\\n Node *expose(Node *t) {\\n Node *rp = nullptr;\\n for(auto *cur = t; cur; cur = cur->p) {\\n splay(cur);\\n if(cur->r) cur->sum.add(cur->r->sum);\\n cur->r = rp;\\n if(cur->r) cur->sum.erase(cur->r->sum);\\n update(cur);\\n rp = cur;\\n }\\n splay(t);\\n return rp;\\n }\\n\\n void link(Node *child, Node *parent) {\\n expose(child);\\n expose(parent);\\n child->p = parent;\\n parent->r = child;\\n }\\n\\n void cut(Node *child) {\\n expose(child);\\n auto *parent = child->l;\\n child->l = nullptr;\\n parent->p = nullptr;\\n update(child);\\n }\\n\\n void evert(Node *t) {\\n expose(t);\\n toggle(t);\\n push(t);\\n }\\n\\n Node *lca(Node *u, Node *v) {\\n if(get_root(u) != get_root(v)) return nullptr;\\n expose(u);\\n return expose(v);\\n }\\n\\n\\n Node *get_kth(Node *x, int k) {\\n expose(x);\\n while(x) {\\n push(x);\\n if(x->r && x->r->sz > k) {\\n x = x->r;\\n } else {\\n if(x->r) k -= x->r->sz;\\n if(k == 0) return x;\\n k -= 1;\\n x = x->l;\\n }\\n }\\n return nullptr;\\n }\\n\\n Node *get_root(Node *x) {\\n expose(x);\\n while(x->l) {\\n push(x);\\n x = x->l;\\n }\\n return x;\\n }\\n};\\n\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\n\\nusing modint = ModInt< mod >;\\n\\n\\nint main() {\\n\\n\\n struct Sum {\\n modint all, pdist, cdist, sz, mdist, msz;\\n modint v_sum, m_sum;\\n\\n Sum() : all(0), pdist(0), cdist(0), sz(0), mdist(0), msz(0), v_sum(0), m_sum(0) {}\\n\\n void toggle() {\\n swap(pdist, cdist);\\n }\\n\\n void merge(int64 key, const Sum &parent, const Sum &child) {\\n int64 sw = 0;\\n v_sum = parent.v_sum + child.v_sum + m_sum;\\n if(key < 0) {\\n sw = -key;\\n v_sum += sw;\\n key = 0;\\n }\\n all = parent.all + key + child.all;\\n pdist = parent.pdist + (child.all + key) * (parent.sz + sw + msz) + child.pdist + mdist;\\n cdist = child.cdist + (parent.all + key) * (child.sz + sw + msz) + parent.cdist + mdist;\\n sz = parent.sz + child.sz + msz + sw;\\n }\\n\\n void add(const Sum &chsum) {\\n mdist += chsum.cdist;\\n msz += chsum.sz;\\n m_sum += chsum.v_sum;\\n }\\n\\n void erase(const Sum &chsum) {\\n mdist -= chsum.cdist;\\n msz -= chsum.sz;\\n m_sum -= chsum.v_sum;\\n }\\n } e;\\n int N;\\n cin >> N;\\n vector< int64 > V(N);\\n cin >> V;\\n using LCT = LinkCutTreeSubtree< Sum, int64 >;\\n LCT lct(e);\\n vector< LCT::Node * > vs(N), es(N);\\n for(int i = 0; i < N; i++) {\\n vs[i] = lct.make_node(-V[i]);\\n }\\n vector< int > S(N), T(N);\\n for(int i = 0; i + 1 < N; i++) {\\n int a, b, w;\\n cin >> a >> b >> w;\\n --a, --b;\\n lct.evert(vs[a]);\\n lct.evert(vs[b]);\\n es[i] = lct.make_node(w);\\n lct.link(vs[a], es[i]);\\n lct.link(vs[b], es[i]);\\n S[i] = a;\\n T[i] = b;\\n }\\n modint all = 0;\\n // v[i]を増やすとv[i]からの全点間なんとかを求めれば良い\\n for(int i = 0; i < N; i++) {\\n lct.evert(vs[i]);\\n all += vs[i]->sum.cdist * V[i];\\n }\\n all /= 2;\\n cout << all << \\\"\\\\n\\\";\\n int Q;\\n cin >> Q;\\n while(Q--) {\\n int t, a, b;\\n cin >> t >> a >> b;\\n --a;\\n if(t == 1) {\\n lct.evert(vs[a]);\\n all -= vs[a]->sum.cdist * -vs[a]->key;\\n vs[a]->key -= b;\\n lct.update(vs[a]);\\n all += vs[a]->sum.cdist * -vs[a]->key;\\n } else {\\n lct.evert(es[a]);\\n lct.cut(vs[S[a]]);\\n lct.cut(vs[T[a]]);\\n modint latte = vs[S[a]]->sum.v_sum;\\n modint malta = vs[T[a]]->sum.v_sum;\\n all += latte * malta * b;\\n es[a]->key += b;\\n lct.link(vs[S[a]], es[a]);\\n lct.link(vs[T[a]], es[a]);\\n }\\n cout << all << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 840,\n \"memory_kb\": 40580,\n \"score_of_the_acc\": -0.542,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3179_4840436\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )\\n#define rep(i,n) REP(i,0,n)\\ntypedef long long ll;\\ntypedef pair<int,int> pint;\\ntypedef pair<ll,int> pli;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=998244353 ;\\nint dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;\\n\\nstruct Node {\\n ll abc,ab,ac,bc,a,b,c;\\n Node(ll a,ll b, ll c):a(a),b(b),c(c) {\\n ab = a * b % mod;\\n ac = a * c % mod;\\n bc = b * c % mod;\\n abc = ab * c % mod;\\n }\\n};\\n\\nstruct Op {\\n ll a, b, c;\\n};\\n\\ntemplate<typename T, typename S>\\nstruct LazySegmentTree{\\n int n;\\n vector<T> node;\\n vector<S> lazy;\\n T E0;\\n S E1;\\n\\n inline void updatef(S& lazy,S& value){\\n //lazy += value;\\n lazy.a += value.a;\\n if(lazy.a >= mod) lazy.a -= mod;\\n lazy.b += value.b;\\n if(lazy.b >= mod) lazy.b -= mod;\\n lazy.c += value.c;\\n if(lazy.c >= mod) lazy.c -= mod;\\n //lazy = max(lazy, value);\\n //lazy = min(lazy, value);\\n }\\n inline void calculatef(T& node,S& lazy,int len){\\n //node += lazy * len; //区間sumはこっち\\n // node += lazy ; //区間maxとか\\n if(lazy.a) {\\n node.abc = (node.abc + node.bc * lazy.a) % mod;\\n node.ab = (node.ab + node.b * lazy.a) % mod;\\n node.ac = (node.ac + node.c * lazy.a) % mod;\\n node.a += lazy.a;\\n if(node.a >= mod)node.a -= mod;\\n }\\n if(lazy.b) {\\n node.abc = (node.abc + node.ac * lazy.b) % mod;\\n node.bc = (node.bc + node.c * lazy.b) % mod;\\n node.ab = (node.ab + node.a * lazy.b) % mod;\\n node.b += lazy.b;\\n if(node.b >= mod)node.b -= mod;\\n }\\n if(lazy.c) {\\n node.abc = (node.abc + node.ab * lazy.c) % mod;\\n node.ac = (node.ac + node.a * lazy.c) % mod;\\n node.bc = (node.bc + node.b * lazy.c) % mod;\\n node.c += lazy.c;\\n if(node.c >= mod)node.c -= mod;\\n }\\n }\\n inline T queryf(T& x,T& y){\\n //return x + y;\\n //return x * y;\\n //return max(x, y);\\n Node z(0,0,0);\\n z.abc = x.abc + y.abc;\\n if(z.abc>=mod)z.abc -= mod;\\n z.ab = x.ab + y.ab;\\n if(z.ab>=mod)z.ab -= mod;\\n z.ac = x.ac + y.ac;\\n if(z.ac>=mod)z.ac -= mod;\\n z.bc = x.bc + y.bc;\\n if(z.bc>=mod)z.bc -= mod;\\n z.a = x.a + y.a;\\n if(z.a>=mod)z.a -= mod;\\n z.b = x.b + y.b;\\n if(z.b>=mod)z.b -= mod;\\n z.c = x.c + y.c;\\n if(z.c>=mod)z.c -= mod;\\n return z;\\n }\\npublic:\\n LazySegmentTree(int sz,T nodeE,S lazyE ):E0(nodeE), E1(lazyE){\\n n=1;\\n while(n<sz)n<<=1;\\n node.resize(2*n-1,E0);\\n lazy.resize(2*n-1,E1);\\n }\\n\\n LazySegmentTree(vector<T>& v,T E0,S E1 ):E0(E0),E1(E1){\\n n=1;\\n int sz=v.size();\\n while(n<sz)n<<=1;\\n node.resize(2*n-1,E0);\\n lazy.resize(2*n-1,E1);\\n rep(i,sz)node[i+n-1] = v[i];\\n for(int i=n-2; i>=0; --i){\\n node[i] = queryf(node[2*i+1],node[2*i+2]);\\n }\\n }\\n\\n void eval(int k,int l,int r){\\n if(!lazy[k].a && !lazy[k].b && !lazy[k].c )return ;\\n calculatef(node[k], lazy[k], r-l);\\n if(r-l>1){\\n updatef(lazy[2*k+1], lazy[k]);\\n updatef(lazy[2*k+2], lazy[k]);\\n }\\n lazy[k]=E1;\\n }\\n\\n void update(int a, int b, S x,int k=0,int l=0,int r=-1){\\n if(r<0)r=n;\\n eval(k,l,r);\\n if(r<=a||b<=l)return;\\n if(a<=l&&r<=b){\\n updatef(lazy[k], x);\\n eval(k,l,r);\\n }\\n else {\\n update(a,b,x,2*k+1,l,(l+r)/2);\\n update(a,b,x,2*k+2,(l+r)/2,r);\\n node[k]=queryf(node[2*k+1], node[2*k+2]);\\n }\\n }\\n\\n T query(int a,int b,int k=0,int l=0,int r=-1){\\n if(r<0)r=n;\\n eval(k,l,r);\\n if(r<=a||b<=l)return E0;\\n if(a<=l&&r<=b)return node[k];\\n T xl=query(a,b,2*k+1,l,(l+r)/2);\\n T xr=query(a,b,2*k+2,(l+r)/2,r);\\n return queryf(xl, xr);\\n }\\n};\\nLazySegmentTree<Node, Op> sg(1,Node(0,0,0), {0,0,0});\\n\\nstruct HLDecomposition{\\n int n,pos;\\n vector<vector<int>> v;\\n vector<int> idx,head,sz,hvy,par,depth,inv,type;\\n \\n HLDecomposition(){};\\n HLDecomposition(int s):\\n n(s),pos(0),v(n),idx(n,-1),head(n),sz(n,1),\\n hvy(n,-1),par(n),depth(n),inv(n),type(n){}\\n \\n void addedge(int x,int y){\\n v[x].push_back(y);\\n v[y].push_back(x);\\n }\\n \\n void dfs1(int rt){\\n par[rt]=-1;\\n depth[rt]=0;\\n stack<pint> st;\\n st.push({rt,0});\\n while(!st.empty()){\\n int x=st.top().first;\\n int& i=st.top().second;\\n if(i<(int)v[x].size()){\\n int to=v[x][i++];\\n if(to==par[x])continue;\\n par[to]=x;\\n depth[to]=depth[x]+1;\\n st.push({to,0});\\n }\\n else {\\n st.pop();\\n int res=0;\\n for(int to:v[x]){\\n if(to==par[x])continue;\\n sz[x]+=sz[to];\\n if(sz[to]>res)res=sz[to],hvy[x]=to;\\n }\\n }\\n }\\n }\\n void dfs2(int r,int c){\\n int &k=pos;\\n stack<int> st;\\n st.push(r);\\n while(!st.empty()){\\n int h=st.top();st.pop();\\n for(int x=h;x!=-1;x=hvy[x]){\\n type[x]=c;\\n head[x]=h;\\n idx[x]=k++;\\n inv[idx[x]]=x;\\n for(int to:v[x])\\n if(to!=par[x]&&to!=hvy[x])st.push(to);\\n }\\n }\\n }\\n \\n void build(vector<int> rs=vector<int>(1,0)){\\n int c=0;\\n for(int r:rs){\\n dfs1(r);\\n dfs2(r,c++);\\n }\\n }\\n void f(int x,int y, ll z){\\n //ここに何か書く！！！\\n sg.update(x,y+1, {0,z,mod-z});\\n }\\n \\n /*void for_v(int x,int y){\\n while(1){\\n if(idx[x]>idx[y])swap(x,y);\\n f(max(idx[head[y]],idx[x]),idx[y]);\\n if(head[x]!=head[y])y=par[head[y]];\\n else break;\\n }\\n }*/\\n \\n void for_edge(int x,int y, ll z){\\n ll ret=0;\\n while(1){\\n if(idx[x]>idx[y])swap(x,y);\\n if(head[x]!=head[y]){\\n f(idx[head[y]],idx[y], z);\\n y=par[head[y]];\\n }\\n else{\\n if(x!=y)f(idx[x]+1,idx[y], z);\\n break;\\n }\\n }\\n }\\n int lca(int x,int y){\\n while(1){\\n if(idx[x]>idx[y])swap(x,y);\\n if(head[x]==head[y])return x;\\n y=par[head[y]];\\n }\\n }\\n \\n int dist(int x,int y){\\n return depth[x]+depth[y]-2*depth[lca(x,y)];\\n }\\n};\\n\\nvector<vector<pair<int,int>>> v(202020);\\nvector<ll> w(202020);\\nvoid dfs(int x, int p) {\\n for(auto to : v[x]){\\n if(to.first == p) continue;\\n dfs(to.first, x);\\n w[x] += w[to.first];\\n if(w[x]>=mod)w[x]-=mod;\\n }\\n}\\nint main(){\\n int n;\\n cin>>n;\\n rep(i,n)cin>>w[i];\\n HLDecomposition hl(n);\\n vector<int> a(n-1), b(n-1), u(n-1);\\n rep(i,n-1){\\n int x,y,z;\\n cin>>x>>y>>z;\\n --x;--y;\\n v[x].emplace_back(y,z);\\n v[y].emplace_back(x,z);\\n hl.addedge(x,y);\\n a[i] = x;\\n b[i] = y;\\n u[i] = z;\\n }\\n dfs(0, -1);\\n hl.build();\\n vector<Node> node(n, Node(0,0,0));\\n rep(i,n-1){\\n if(hl.idx[a[i]]>hl.idx[b[i]])swap(a[i],b[i]);\\n int id = hl.idx[b[i]];\\n node[id] = Node(u[i],w[b[i]], (w[0]+mod-w[b[i]])%mod);\\n }\\n sg = LazySegmentTree<Node, Op>(node, Node(0,0,0), {0,0,0});\\n int size = sg.n;\\n cout << sg.query(0, size).abc << endl;\\n int q;\\n cin >> q;\\n while(q--){\\n int t, x, z;\\n cin >> t >> x >> z;\\n --x;\\n if(t == 1) {\\n sg.update(0,size, {0,0,z});\\n hl.for_edge(0, x, z);\\n\\n } else {\\n int id = hl.idx[b[x]];\\n sg.update(id, id + 1, {z,0,0});\\n }\\n cout << sg.query(0,size).abc << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 98820,\n \"score_of_the_acc\": -1.0951,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3179_4840423\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )\\n#define rep(i,n) REP(i,0,n)\\ntypedef long long ll;\\ntypedef pair<int,int> pint;\\ntypedef pair<ll,int> pli;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=998244353 ;\\nint dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;\\n\\nstruct Node {\\n ll abc,ab,ac,bc,a,b,c;\\n Node(ll a,ll b, ll c):a(a),b(b),c(c) {\\n ab = a * b % mod;\\n ac = a * c % mod;\\n bc = b * c % mod;\\n abc = ab * c % mod;\\n }\\n};\\n\\nstruct Op {\\n ll a, b, c;\\n};\\n\\ntemplate<typename T, typename S>\\nstruct LazySegmentTree{\\n int n;\\n vector<T> node;\\n vector<S> lazy;\\n T E0;\\n S E1;\\n\\n inline void updatef(S& lazy,S& value){\\n //lazy += value;\\n lazy.a += value.a;\\n if(lazy.a >= mod) lazy.a -= mod;\\n lazy.b += value.b;\\n if(lazy.b >= mod) lazy.b -= mod;\\n lazy.c += value.c;\\n if(lazy.c >= mod) lazy.c -= mod;\\n //lazy = max(lazy, value);\\n //lazy = min(lazy, value);\\n }\\n inline void calculatef(T& node,S& lazy,int len){\\n //node += lazy * len; //区間sumはこっち\\n // node += lazy ; //区間maxとか\\n if(lazy.a) {\\n node.abc = (node.abc + node.bc * lazy.a) % mod;\\n node.ab = (node.ab + node.b * lazy.a) % mod;\\n node.ac = (node.ac + node.c * lazy.a) % mod;\\n node.a += lazy.a;\\n if(node.a >= mod)node.a -= mod;\\n }\\n if(lazy.b) {\\n node.abc = (node.abc + node.ac * lazy.b) % mod;\\n node.bc = (node.bc + node.c * lazy.b) % mod;\\n node.ab = (node.ab + node.a * lazy.b) % mod;\\n node.b += lazy.b;\\n if(node.b >= mod)node.b -= mod;\\n }\\n if(lazy.c) {\\n node.abc = (node.abc + node.ab * lazy.c) % mod;\\n node.ac = (node.ac + node.a * lazy.c) % mod;\\n node.bc = (node.bc + node.b * lazy.c) % mod;\\n node.c += lazy.c;\\n if(node.c >= mod)node.c -= mod;\\n }\\n }\\n inline T queryf(T& x,T& y){\\n //return x + y;\\n //return x * y;\\n //return max(x, y);\\n Node z(0,0,0);\\n z.abc = x.abc + y.abc;\\n if(z.abc>=mod)z.abc -= mod;\\n z.ab = x.ab + y.ab;\\n if(z.ab>=mod)z.ab -= mod;\\n z.ac = x.ac + y.ac;\\n if(z.ac>=mod)z.ac -= mod;\\n z.bc = x.bc + y.bc;\\n if(z.bc>=mod)z.bc -= mod;\\n z.a = x.a + y.a;\\n if(z.a>=mod)z.a -= mod;\\n z.b = x.b + y.b;\\n if(z.b>=mod)z.b -= mod;\\n z.c = x.c + y.c;\\n if(z.c>=mod)z.c -= mod;\\n return z;\\n }\\npublic:\\n LazySegmentTree(int sz,T nodeE,S lazyE ):E0(nodeE), E1(lazyE){\\n n=1;\\n while(n<sz)n<<=1;\\n node.resize(2*n-1,E0);\\n lazy.resize(2*n-1,E1);\\n }\\n\\n LazySegmentTree(vector<T>& v,T E0,S E1 ):E0(E0),E1(E1){\\n n=1;\\n int sz=v.size();\\n while(n<sz)n<<=1;\\n node.resize(2*n-1,E0);\\n lazy.resize(2*n-1,E1);\\n rep(i,sz)node[i+n-1] = v[i];\\n for(int i=n-2; i>=0; --i){\\n node[i] = queryf(node[2*i+1],node[2*i+2]);\\n }\\n }\\n\\n void eval(int k,int l,int r){\\n if(!lazy[k].a && !lazy[k].b && !lazy[k].c )return ;\\n calculatef(node[k], lazy[k], r-l);\\n if(r-l>1){\\n updatef(lazy[2*k+1], lazy[k]);\\n updatef(lazy[2*k+2], lazy[k]);\\n }\\n lazy[k]=E1;\\n }\\n\\n void update(int a, int b, S x,int k=0,int l=0,int r=-1){\\n if(r<0)r=n;\\n eval(k,l,r);\\n if(r<=a||b<=l)return;\\n if(a<=l&&r<=b){\\n updatef(lazy[k], x);\\n eval(k,l,r);\\n }\\n else {\\n update(a,b,x,2*k+1,l,(l+r)/2);\\n update(a,b,x,2*k+2,(l+r)/2,r);\\n node[k]=queryf(node[2*k+1], node[2*k+2]);\\n }\\n }\\n\\n T query(int a,int b,int k=0,int l=0,int r=-1){\\n if(r<0)r=n;\\n eval(k,l,r);\\n if(r<=a||b<=l)return E0;\\n if(a<=l&&r<=b)return node[k];\\n T xl=query(a,b,2*k+1,l,(l+r)/2);\\n T xr=query(a,b,2*k+2,(l+r)/2,r);\\n return queryf(xl, xr);\\n }\\n};\\nLazySegmentTree<Node, Op> sg(1,Node(0,0,0), {0,0,0});\\n\\nstruct HLDecomposition{\\n int n,pos;\\n vector<vector<int>> v;\\n vector<int> idx,head,sz,hvy,par,depth,inv,type;\\n \\n HLDecomposition(){};\\n HLDecomposition(int s):\\n n(s),pos(0),v(n),idx(n,-1),head(n),sz(n,1),\\n hvy(n,-1),par(n),depth(n),inv(n),type(n){}\\n \\n void addedge(int x,int y){\\n v[x].push_back(y);\\n v[y].push_back(x);\\n }\\n \\n void dfs1(int rt){\\n par[rt]=-1;\\n depth[rt]=0;\\n stack<pint> st;\\n st.push({rt,0});\\n while(!st.empty()){\\n int x=st.top().first;\\n int& i=st.top().second;\\n if(i<(int)v[x].size()){\\n int to=v[x][i++];\\n if(to==par[x])continue;\\n par[to]=x;\\n depth[to]=depth[x]+1;\\n st.push({to,0});\\n }\\n else {\\n st.pop();\\n int res=0;\\n for(int to:v[x]){\\n if(to==par[x])continue;\\n sz[x]+=sz[to];\\n if(sz[to]>res)res=sz[to],hvy[x]=to;\\n }\\n }\\n }\\n }\\n void dfs2(int r,int c){\\n int &k=pos;\\n stack<int> st;\\n st.push(r);\\n while(!st.empty()){\\n int h=st.top();st.pop();\\n for(int x=h;x!=-1;x=hvy[x]){\\n type[x]=c;\\n head[x]=h;\\n idx[x]=k++;\\n inv[idx[x]]=x;\\n for(int to:v[x])\\n if(to!=par[x]&&to!=hvy[x])st.push(to);\\n }\\n }\\n }\\n \\n void build(vector<int> rs=vector<int>(1,0)){\\n int c=0;\\n for(int r:rs){\\n dfs1(r);\\n dfs2(r,c++);\\n }\\n }\\n void f(int x,int y, ll z){\\n //ここに何か書く！！！\\n sg.update(x,y+1, {0,z,mod-z});\\n }\\n \\n /*void for_v(int x,int y){\\n while(1){\\n if(idx[x]>idx[y])swap(x,y);\\n f(max(idx[head[y]],idx[x]),idx[y]);\\n if(head[x]!=head[y])y=par[head[y]];\\n else break;\\n }\\n }*/\\n \\n void for_edge(int x,int y, ll z){\\n ll ret=0;\\n while(1){\\n if(idx[x]>idx[y])swap(x,y);\\n if(head[x]!=head[y]){\\n f(idx[head[y]],idx[y], z);\\n y=par[head[y]];\\n }\\n else{\\n if(x!=y)f(idx[x]+1,idx[y], z);\\n break;\\n }\\n }\\n }\\n int lca(int x,int y){\\n while(1){\\n if(idx[x]>idx[y])swap(x,y);\\n if(head[x]==head[y])return x;\\n y=par[head[y]];\\n }\\n }\\n \\n int dist(int x,int y){\\n return depth[x]+depth[y]-2*depth[lca(x,y)];\\n }\\n};\\n\\nvector<vector<pair<int,int>>> v(202020);\\nvector<ll> w(202020);\\nvoid dfs(int x, int p) {\\n for(auto to : v[x]){\\n if(to.first == p) continue;\\n dfs(to.first, x);\\n w[x] += w[to.first];\\n if(w[x]>=mod)w[x]-=mod;\\n }\\n}\\nint main(){\\n int n;\\n cin>>n;\\n rep(i,n)cin>>w[i];\\n HLDecomposition hl(n);\\n vector<int> a(n-1), b(n-1), u(n-1);\\n rep(i,n-1){\\n int x,y,z;\\n cin>>x>>y>>z;\\n --x;--y;\\n v[x].emplace_back(y,z);\\n v[y].emplace_back(x,z);\\n hl.addedge(x,y);\\n a[i] = x;\\n b[i] = y;\\n u[i] = z;\\n }\\n dfs(0, -1);\\n hl.build();\\n vector<Node> node(n, Node(0,0,0));\\n rep(i,n-1){\\n if(hl.idx[a[i]]>hl.idx[b[i]])swap(a[i],b[i]);\\n int id = hl.idx[b[i]];\\n node[id] = Node(u[i],w[b[i]]%mod, (w[0]-w[b[i]])%mod);\\n }\\n sg = LazySegmentTree<Node, Op>(node, Node(0,0,0), {0,0,0});\\n int size = sg.n;\\n cout << sg.query(0, size).abc << endl;\\n int q;\\n cin >> q;\\n while(q--){\\n int t, x, z;\\n cin >> t >> x >> z;\\n --x;\\n if(t == 1) {\\n sg.update(0,size, {0,0,z});\\n hl.for_edge(0, x, z);\\n\\n } else {\\n int id = hl.idx[b[x]];\\n sg.update(id, id + 1, {z,0,0});\\n }\\n cout << sg.query(0,size).abc << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.07692307692307693,\n \"time_ms\": 670,\n \"memory_kb\": 88424,\n \"score_of_the_acc\": -0.9567,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3179_4840406\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )\\n#define rep(i,n) REP(i,0,n)\\ntypedef long long ll;\\ntypedef pair<int,int> pint;\\ntypedef pair<ll,int> pli;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=998244353 ;\\nint dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;\\n\\nstruct Node {\\n ll abc,ab,ac,bc,a,b,c;\\n Node(ll a,ll b, ll c):a(a),b(b),c(c) {\\n ab = a * b % mod;\\n ac = a * c % mod;\\n bc = b * c % mod;\\n abc = ab * c % mod;\\n }\\n};\\n\\nstruct Op {\\n ll a, b, c;\\n};\\n\\ntemplate<typename T, typename S>\\nstruct LazySegmentTree{\\n int n;\\n vector<T> node;\\n vector<S> lazy;\\n T E0;\\n S E1;\\n\\n inline void updatef(S& lazy,S& value){\\n //lazy += value;\\n lazy.a += value.a;\\n if(lazy.a >= mod) lazy.a -= mod;\\n lazy.b += value.b;\\n if(lazy.b >= mod) lazy.b -= mod;\\n lazy.c += value.c;\\n if(lazy.c >= mod) lazy.c -= mod;\\n //lazy = max(lazy, value);\\n //lazy = min(lazy, value);\\n }\\n inline void calculatef(T& node,S& lazy,int len){\\n //node += lazy * len; //区間sumはこっち\\n // node += lazy ; //区間maxとか\\n if(lazy.a) {\\n node.abc = (node.abc + node.bc * lazy.a) % mod;\\n node.ab = (node.ab + node.b * lazy.a) % mod;\\n node.ac = (node.ac + node.c * lazy.a) % mod;\\n node.a += lazy.a;\\n if(node.a >= mod)node.a -= mod;\\n }\\n if(lazy.b) {\\n node.abc = (node.abc + node.ac * lazy.b) % mod;\\n node.bc = (node.bc + node.c * lazy.b) % mod;\\n node.ab = (node.ab + node.a * lazy.b) % mod;\\n node.b += lazy.b;\\n if(node.b >= mod)node.b -= mod;\\n }\\n if(lazy.c) {\\n node.abc = (node.abc + node.ab * lazy.c) % mod;\\n node.ac = (node.ac + node.a * lazy.c) % mod;\\n node.bc = (node.bc + node.b * lazy.c) % mod;\\n node.c += lazy.c;\\n if(node.c >= mod)node.c -= mod;\\n }\\n }\\n inline T queryf(T& x,T& y){\\n //return x + y;\\n //return x * y;\\n //return max(x, y);\\n Node z(0,0,0);\\n z.abc = x.abc + y.abc;\\n if(z.abc>=mod)z.abc -= mod;\\n z.ab = x.ab + y.ab;\\n if(z.ab>=mod)z.ab -= mod;\\n z.ac = x.ac + y.ac;\\n if(z.ac>=mod)z.ac -= mod;\\n z.bc = x.bc + y.bc;\\n if(z.bc>=mod)z.bc -= mod;\\n z.a = x.a + y.a;\\n if(z.a>=mod)z.a -= mod;\\n z.b = x.b + y.b;\\n if(z.b>=mod)z.b -= mod;\\n z.c = x.c + y.c;\\n if(z.c>=mod)z.c -= mod;\\n return z;\\n }\\npublic:\\n LazySegmentTree(int sz,T nodeE,S lazyE ):E0(nodeE), E1(lazyE){\\n n=1;\\n while(n<sz)n<<=1;\\n node.resize(2*n-1,E0);\\n lazy.resize(2*n-1,E1);\\n }\\n\\n LazySegmentTree(vector<T>& v,T E0,S E1 ):E0(E0),E1(E1){\\n n=1;\\n int sz=v.size();\\n while(n<sz)n<<=1;\\n node.resize(2*n-1,E0);\\n lazy.resize(2*n-1,E1);\\n rep(i,sz)node[i+n-1] = v[i];\\n for(int i=n-2; i>=0; --i){\\n node[i] = queryf(node[2*i+1],node[2*i+2]);\\n }\\n }\\n\\n void eval(int k,int l,int r){\\n if(!lazy[k].a && !lazy[k].b && !lazy[k].c )return ;\\n calculatef(node[k], lazy[k], r-l);\\n if(r-l>1){\\n updatef(lazy[2*k+1], lazy[k]);\\n updatef(lazy[2*k+2], lazy[k]);\\n }\\n lazy[k]=E1;\\n }\\n\\n void update(int a, int b, S x,int k=0,int l=0,int r=-1){\\n if(r<0)r=n;\\n eval(k,l,r);\\n if(r<=a||b<=l)return;\\n if(a<=l&&r<=b){\\n updatef(lazy[k], x);\\n eval(k,l,r);\\n }\\n else {\\n update(a,b,x,2*k+1,l,(l+r)/2);\\n update(a,b,x,2*k+2,(l+r)/2,r);\\n node[k]=queryf(node[2*k+1], node[2*k+2]);\\n }\\n }\\n\\n T query(int a,int b,int k=0,int l=0,int r=-1){\\n if(r<0)r=n;\\n eval(k,l,r);\\n if(r<=a||b<=l)return E0;\\n if(a<=l&&r<=b)return node[k];\\n T xl=query(a,b,2*k+1,l,(l+r)/2);\\n T xr=query(a,b,2*k+2,(l+r)/2,r);\\n return queryf(xl, xr);\\n }\\n};\\nLazySegmentTree<Node, Op> sg(1,Node(0,0,0), {0,0,0});\\n\\nstruct HLDecomposition{\\n int n,pos;\\n vector<vector<int>> v;\\n vector<int> idx,head,sz,hvy,par,depth,inv,type;\\n \\n HLDecomposition(){};\\n HLDecomposition(int s):\\n n(s),pos(0),v(n),idx(n,-1),head(n),sz(n,1),\\n hvy(n,-1),par(n),depth(n),inv(n),type(n){}\\n \\n void addedge(int x,int y){\\n v[x].push_back(y);\\n v[y].push_back(x);\\n }\\n \\n void dfs1(int rt){\\n par[rt]=-1;\\n depth[rt]=0;\\n stack<pint> st;\\n st.push({rt,0});\\n while(!st.empty()){\\n int x=st.top().first;\\n int& i=st.top().second;\\n if(i<(int)v[x].size()){\\n int to=v[x][i++];\\n if(to==par[x])continue;\\n par[to]=x;\\n depth[to]=depth[x]+1;\\n st.push({to,0});\\n }\\n else {\\n st.pop();\\n int res=0;\\n for(int to:v[x]){\\n if(to==par[x])continue;\\n sz[x]+=sz[to];\\n if(sz[to]>res)res=sz[to],hvy[x]=to;\\n }\\n }\\n }\\n }\\n void dfs2(int r,int c){\\n int &k=pos;\\n stack<int> st;\\n st.push(r);\\n while(!st.empty()){\\n int h=st.top();st.pop();\\n for(int x=h;x!=-1;x=hvy[x]){\\n type[x]=c;\\n head[x]=h;\\n idx[x]=k++;\\n inv[idx[x]]=x;\\n for(int to:v[x])\\n if(to!=par[x]&&to!=hvy[x])st.push(to);\\n }\\n }\\n }\\n \\n void build(vector<int> rs=vector<int>(1,0)){\\n int c=0;\\n for(int r:rs){\\n dfs1(r);\\n dfs2(r,c++);\\n }\\n }\\n void f(int x,int y, ll z){\\n //ここに何か書く！！！\\n sg.update(x,y+1, {0,z,mod-z});\\n }\\n \\n /*void for_v(int x,int y){\\n while(1){\\n if(idx[x]>idx[y])swap(x,y);\\n f(max(idx[head[y]],idx[x]),idx[y]);\\n if(head[x]!=head[y])y=par[head[y]];\\n else break;\\n }\\n }*/\\n \\n void for_edge(int x,int y, ll z){\\n ll ret=0;\\n while(1){\\n if(idx[x]>idx[y])swap(x,y);\\n if(head[x]!=head[y]){\\n f(idx[head[y]],idx[y], z);\\n y=par[head[y]];\\n }\\n else{\\n if(x!=y)f(idx[x]+1,idx[y], z);\\n break;\\n }\\n }\\n }\\n int lca(int x,int y){\\n while(1){\\n if(idx[x]>idx[y])swap(x,y);\\n if(head[x]==head[y])return x;\\n y=par[head[y]];\\n }\\n }\\n \\n int dist(int x,int y){\\n return depth[x]+depth[y]-2*depth[lca(x,y)];\\n }\\n};\\n\\nvector<vector<pair<int,int>>> v(202020);\\nvector<ll> w(202020);\\nvoid dfs(int x, int p) {\\n for(auto to : v[x]){\\n if(to.first == p) continue;\\n dfs(to.first, x);\\n w[x] += w[to.first];\\n if(w[x]>=mod)w[x]-=mod;\\n }\\n}\\nint main(){\\n int n;\\n cin>>n;\\n rep(i,n)cin>>w[i];\\n HLDecomposition hl(n);\\n vector<int> a(n-1), b(n-1), u(n-1);\\n rep(i,n-1){\\n int x,y,z;\\n cin>>x>>y>>z;\\n --x;--y;\\n v[x].emplace_back(y,z);\\n v[y].emplace_back(x,z);\\n hl.addedge(x,y);\\n a[i] = x;\\n b[i] = y;\\n u[i] = z;\\n }\\n dfs(0, -1);\\n hl.build();\\n vector<Node> node(n, Node(0,0,0));\\n rep(i,n-1){\\n if(hl.idx[a[i]]>hl.idx[b[i]])swap(a[i],b[i]);\\n int id = hl.idx[b[i]];\\n node[id] = Node(u[i],w[b[i]], w[0]-w[b[i]]);\\n }\\n sg = LazySegmentTree<Node, Op>(node, Node(0,0,0), {0,0,0});\\n int size = sg.n;\\n cout << sg.query(0, size).abc << endl;\\n int q;\\n cin >> q;\\n while(q--){\\n int t, x, z;\\n cin >> t >> x >> z;\\n --x;\\n if(t == 1) {\\n sg.update(0,size, {0,0,z});\\n hl.for_edge(0, x, z);\\n\\n } else {\\n int id = hl.idx[b[x]];\\n sg.update(id, id + 1, {z,0,0});\\n }\\n cout << sg.query(0,size).abc << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.07692307692307693,\n \"time_ms\": 750,\n \"memory_kb\": 88384,\n \"score_of_the_acc\": -1.024,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1992,"cells":{"group_id":{"kind":"string","value":"aoj_3181_cpp"},"problem_description":{"kind":"string","value":"J Proper Instructions\n問題文\numgくんは $1$ 次元上の座標 $0$ にいます。今は時刻 $0$ です。時刻が $1$ 進むごとに、今いる座標より $1$ 大きい座標に移動するか、 $1$ 小さい座標に移動するか、その座標にとどまるかという行動ができます。\n$N$ 個の指示が与えられます。 $i$ 個目の指示は、「時刻 $T_i$ には $L_i\\leq x \\leq R_i$ を満たす座標 $x$ にいなければならない」という指示です。\n$N$個の指示の空でない部分集合 $S$ が「適切」であるとは、umgくんが上手く動くことで、 $S$ に含まれるすべての指示に従うことができることをいいます。\n適切である指示の集合としてあり得るものの個数を求めてください。ただし、 $2$ つの指示の集合が異なるとは、一方には含まれるが他方には含まれない指示が存在することをいいます。答えは非常に大きくなることがあるので、 $998244353$ で割った余りを求めてください。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$\n$T_1$ $L_1$ $R_1$\n$T_2$ $L_2$ $R_2$\n$\\vdots$\n$T_N$ $L_N$ $R_N$\n制約\n入力はすべて整数である。\n$1 \\leq N \\leq 300$\n$1 \\leq T_1 \\lt T_2 \\lt \\cdots \\lt T_N \\leq 10^9$\n$-10^9 \\leq L_i \\leq R_i \\leq 10^9$\n出力\n答えを 1 行に出力せよ。\n入力例1\n3\n1 0 2\n2 -4 -2\n4 2 10\n出力例1\n4\n適切な指示の集合は $\\{1\\},\\{2\\},\\{3\\},\\{1,3\\}$ の4つです。\n入力例2\n3\n1 100 200\n40 100 200\n60 100 200\n出力例2\n0\numgくんはどう頑張ってもいずれの指示も達成することができません。\n入力例3\n9\n6 -64 84\n7 39 99\n37 -53 64\n42 19 32\n46 -86 -37\n79 57 64\n85 -96 -31\n87 -10 79\n91 -80 86\n出力例3\n95"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3181_10355871","code_snippet":"// AOJ #3181 Proper Instructions\n// 2025.4.7\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll MOD = 998244353;\n\nstruct Instr { ll t, L, R; };\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int n;\n cin >> n;\n vector<Instr> a(n);\n for(int i=0; i<n; i++) cin >> a[i].t >> a[i].L >> a[i].R;\n\n vector<map<pair<ll,ll>, ll>> dp(n);\n ll ans = 0;\n for (int i = 0; i < n; i++){\n ll lo = max(a[i].L, -a[i].t);\n ll hi = min(a[i].R, a[i].t);\n if(lo <= hi) dp[i][{lo, hi}] = (dp[i][{lo, hi}] + 1) % MOD;\n for (int j = 0; j < i; j++){\n ll d = a[i].t - a[j].t;\n for(auto &st : dp[j]){\n ll l = st.first.first, r = st.first.second;\n ll cnt = st.second;\n ll nl = max(a[i].L, l - d);\n ll nh = min(a[i].R, r + d);\n if(nl <= nh) dp[i][{nl, nh}] = (dp[i][{nl, nh}] + cnt) % MOD;\n }\n }\n for(auto &st: dp[i]) ans = (ans + st.second) % MOD;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":310,"memory_kb":11680,"score_of_the_acc":-0.3703,"final_rank":7},{"submission_id":"aoj_3181_4906170","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\ntemplate< int mod >\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n\n friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) += rhs;\n }\n friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) -= rhs;\n }\n friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) *= rhs;\n }\n friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) /= rhs;\n }\n\n bool operator==(const ModInt &p) const { return x == p.x; }\n\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\nusing modint = ModInt< MOD9 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}\n//using modint=ld;\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n ll n;cin>>n;\n vector<ll>t(n+1),l(n+1),r(n+1);\n rep(i,1,n+1)cin>>t[i]>>l[i]>>r[i];\n auto dp=vec(n+1,n+1,modint(0));\n dp[0][0]=1;\n rep(i,1,n+1){\n auto ndp=vec(n+1,n+1,modint(0));\n rep(j,0,i)rep(o,0,i){\n ndp[j][o]+=dp[j][o];\n ll nl=l[j]-(t[i]-t[j]);\n ll nr=r[o]+(t[i]-t[o]);\n if(nr<l[i]||r[i]<nl)continue;\n ll tx=j,ty=o;\n if(nl<l[i])tx=i;\n if(nr>r[i])ty=i;\n ndp[tx][ty]+=dp[j][o];\n }\n dp.swap(ndp);\n //debug(dp,n+1,n+1);cout<<endl;\n }\n modint ret=0;\n rep(i,0,n+1)rep(j,0,n+1)ret+=dp[i][j];\n cout<<ret-1<<endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3700,"score_of_the_acc":-0.0333,"final_rank":2},{"submission_id":"aoj_3181_4879596","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)\n#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)\n#define REP(i, n) rep(i, 0, n)\n#define REP2(i, n) rep2(i, 0, n)\n#define all(hoge) (hoge).begin(), (hoge).end()\n#define en '\\n'\nusing ll = long long;\nusing ull = unsigned long long;\ntemplate <class T>\nusing vec = vector<T>;\ntemplate <class T>\nusing vvec = vector<vec<T>>;\ntypedef pair<ll, ll> P;\nusing tp = tuple<ll, ll, ll>;\nconstexpr long long INF = 1LL << 60;\nconstexpr int INF_INT = 1 << 25;\n//constexpr long long MOD = (ll)1e9 + 7;\nconstexpr long long MOD = 998244353LL;\nusing ld = long double;\nstatic const ld pi = 3.141592653589793L;\ntypedef vector<ll> Array;\ntypedef vector<Array> Matrix;\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//グラフ関連\nstruct Edge {\n ll to, cap, rev;\n Edge(ll _to, ll _cap, ll _rev) {\n to = _to;\n cap = _cap;\n rev = _rev;\n }\n};\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {\n G[from].push_back(Edge(to, cap, (ll)G[to].size()));\n if(revFlag)\n G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\n}\nvoid solve() {\n ll n;\n cin >> n;\n vec<ll> t(n + 1, 0), l(n + 1, 0), r(n + 1, 0);\n rep(i, 1, n + 1) {\n cin >> t[i] >> l[i] >> r[i];\n }\n\n priority_queue<tp, vec<tp>, greater<tp>> que;\n que.push({0, 0, 0});\n map<tp, ll> mp;\n mp[{0, 0, 0}] = 1;\n ll ans = 0;\n while(que.size()) {\n auto [i, pl, pr] = que.top();\n que.pop();\n //cout << i << \" \" << pl << \" \" << pr << en;\n ll tmp = mp[{i, pl, pr}];\n (ans += tmp) %= MOD;\n rep(j, i + 1, n + 1) {\n ll d = t[j] - t[i];\n ll nl = max(pl - d, l[j]);\n ll nr = min(pr + d, r[j]);\n //cout << i << \" \" << j << \" \" << nl << \" \" << nr << en;\n if(nl > nr)\n continue;\n if(!mp.count({j, nl, nr}))\n que.push({j, nl, nr});\n (mp[{j, nl, nr}] += tmp) %= MOD;\n }\n }\n ans += MOD - 1;\n ans %= MOD;\n cout << ans << en;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n /*\n ll t;\n cin >> t;\n while(t--)*/\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":910,"memory_kb":14440,"score_of_the_acc":-1.0498,"final_rank":10},{"submission_id":"aoj_3181_4867757","code_snippet":"#include <bits/stdc++.h>\n//#include <chrono>\n//#pragma GCC optimize(\"Ofast\")\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\n#define Rrep(i,n) Rreps(i,n,0)\n#define ALL(a) a.begin(), a.end()\n#define fi first\n#define se second\n\nusing ll = long long;\nusing vec = vector<ll>;\nusing mat = vector<vec>;\n\nll N,M,H,W,Q,K,A,B;\nstring S;\ntypedef pair<ll, ll> P;\nconst ll INF = (1LL<<58);\n\ntemplate <unsigned long long mod > class modint{\npublic:\n ll x;\n constexpr modint(){x = 0;}\n constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}\n constexpr void set_raw(ll _x){\n //_x in [0, mod)\n x = _x;\n }\n constexpr modint operator-(){\n return x == 0 ? 0 : mod - x;\n }\n constexpr modint& operator+=(const modint& a){\n if((x += a.x) >= mod) x -= mod;\n return *this;\n }\n constexpr modint operator+(const modint& a) const{\n return modint(*this) += a;\n }\n constexpr modint& operator-=(const modint& a){\n if((x -= a.x) < 0) x += mod;\n return *this;\n }\n constexpr modint operator-(const modint& a) const{\n return modint(*this) -= a;\n }\n constexpr modint& operator*=(const modint& a){\n (x *= a.x)%=mod;\n return *this;\n }\n constexpr modint operator*(const modint& a) const{\n return modint(*this) *= a;\n }\n constexpr modint pow(unsigned long long pw) const{\n modint res(1), comp(*this);\n while(pw){\n if(pw&1) res *= comp;\n comp *= comp;\n pw >>= 1;\n }\n return res;\n }\n //以下、modが素数のときのみ\n constexpr modint inv() const{\n return modint(*this).pow(mod - 2);\n }\n constexpr modint& operator/=(const modint &a){\n (x *= a.inv().x)%=mod;\n return *this;\n }\n constexpr modint operator/(const modint &a) const{\n return modint(*this) /= a;\n }\n};\n#define mod1 998244353\nusing mint = modint<mod1>;\n\nostream& operator<<(ostream& os, const mint& a){\n os << a.x;\n return os;\n}\nusing vm = vector<mint>;\n\nint main() {\n cin>>N;\n vec t(N + 1), l(N + 1), r(N + 1);\n t[0] = l[0] = r[0] = 0;\n reps(i, 1, N + 1) cin>>t[i]>>l[i]>>r[i];\n vector<vm> dp(N + 1, vm(N + 1, 0));\n dp[0][0] = 1;\n struct query{ int j, k; mint a; query(int _j, int _k, mint _a) : j(_j), k(_k), a(_a) {}};\n reps(i, 1, N + 1){\n queue<query> que;\n rep(j, i){\n rep(k, i){\n if(dp[j][k].x != 0 && r[i] >= l[j] - (t[i] - t[j]) && l[i] <= r[k] + (t[i] - t[k])){\n que.emplace(l[i] <= l[j] - (t[i] - t[j]) ? j : i, r[k] + (t[i] - t[k]) <= r[i] ? k : i, dp[j][k]);\n }\n }\n }\n while(!que.empty()){\n query q = que.front(); que.pop();\n dp[q.j][q.k] += q.a;\n }\n }\n mint res(0);\n rep(i, N + 1) res += accumulate(ALL(dp[i]), mint(0));\n cout<<res - 1<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3856,"score_of_the_acc":-0.0007,"final_rank":1},{"submission_id":"aoj_3181_4849774","code_snippet":"// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region aliases\n\n#define rep(i, n) for(long long i = 0; i < (n); i++)\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bcnt(n) __builtin_popcountll(n)\n#define endk endl\n#define ednl endl\n#define enld endl\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vb = vector<bool>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing mll = map<long long, long long>;\nusing pll = pair<long long, long long>;\nusing qll = queue<long long>;\nusing sll = set<long long>;\nusing vpll = vector<pair<long long, long long>>;\ntemplate <class T = ll>\nusing V = vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\n//昇順pq(小さい方から取り出す)\ntemplate <class T = ll>\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\n//降順pq(大きい方から取り出す)\ntemplate <class T = ll>\nusing pqdn = priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\nlong long const dekai = 3e16;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\n\n// const int mod = 1000000007;\nconst int mod = 998244353;\n\n#pragma endregion\n\n#pragma region basic_procedure\n\ntemplate <class T>\ninline bool isin(T x, T lef, T rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { cout << (f ? \"Yes\" : \"No\") << \"\\n\"; }\nvoid No() { cout << \"No\\n\"; }\nvoid YES(bool f = 1) { cout << (f ? \"YES\" : \"NO\") << \"\\n\"; }\nvoid NO() { cout << \"NO\\n\"; }\ntemplate <class T>\nvoid drop(T answer) {\n\tcout << answer << \"\\n\";\n\texit(0);\n}\nvoid err() {\n\tcout << -1 << \"\\n\";\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(vector<T> &v, bool tate = 0) {\n\tif(v.size() > 0) {\n\t\tfor(auto it = v.begin(); it < v.end(); it++) {\n\t\t\tcout << *it;\n\t\t\tif(it != v.end() - 1) {\n\t\t\t\tif(tate)\n\t\t\t\t\tcout << endl;\n\t\t\t\telse\n\t\t\t\t\tcout << \" \";\n\t\t\t}\n\t\t}\n\t}\n\tcout << endl;\n}\n\ntemplate <class T>\nvoid add(vector<T> &v, T val) {\t //ベクトルの各要素に加算\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\n// vectorの中身を数える map<要素,個数>を返す\ntemplate <class T>\nmap<T, long long> cntv(vector<T> v) {\n\tmap<T, long long> m;\n\tfor(auto &g : v) {\n\t\tif(m.count(g))\n\t\t\tm[g]++;\n\t\telse\n\t\t\tm[g] = 1;\n\t}\n\treturn m;\n}\n\n//配列圧縮\n//{1,36,1,3,8,-2,-92}を\n//{2, 5,2,3,4, 1, 0}にする\ntemplate <class T>\nvector<long long> press(vector<T> &v) {\n\tlong long n = v.size();\n\tvector<long long> w(n);\n\tmap<T, long long> m;\n\tfor(T &p : v) m[p] = 0;\n\tlong long i = 0;\n\tfor(auto &p : m) {\n\t\tp.second = i;\n\t\ti++;\n\t}\n\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\n\treturn w;\n}\n\n// 切り上げ除算\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\tT x = abs(a);\n\tT y = abs(b);\n\tT z = (x + y - 1) / y;\n\tif((a < 0 && b > 0) || (a > 0 && b < 0))\n\t\treturn -z;\n\telse if(a == 0)\n\t\treturn 0;\n\telse\n\t\treturn z;\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\n// a * x % mod == __gcd(a,mod)なるxを返す\n// a が modの倍数でないことが条件\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tswap(a, b);\n\t\tu -= t * v;\n\t\tswap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\nvvll comb(100, vll(100, -1));\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\n\tassert(n < 100 && k < 100);\n\tif(n < k || k < 0 || n < 0) return 0;\n\tif(comb[n][k] != -1) return comb[n][k];\n\tll res;\n\tif(n - k < k)\n\t\tres = com(n, n - k);\n\telse if(k == 0)\n\t\tres = 1;\n\telse\n\t\tres = com(n - 1, k - 1) + com(n - 1, k);\n\tcomb[n][k] = res;\n\treturn res;\n}\n\n// nCk modを求める\nconst int MAX = 5100000;\n// この値は求める二項計数の値に応じて変える\n// MAX=3*10^7のとき1900msほど、ほぼ比例\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid cominit() {\n\t// テーブルを作る前処理\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor(int i = 2; i < MAX; i++) {\n\t\tfac[i] = fac[i - 1] * i % mod;\n\t\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\n\t\tfinv[i] = finv[i - 1] * inv[i] % mod;\n\t}\n}\nlong long commod(long long n, long long k) { // 二項係数\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\nlong long pmod(long long n, long long k) {\t// 順列\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * finv[n - k] % mod;\n}\n// n個の区別しないボールを区別するk個の箱に入れる方法の総数\nlong long hmod(long long n, long long k) {\t// 重複組み合わせ\n\treturn commod(n + k - 1, n);\n}\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tINPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tINPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n\ntemplate <class T>\nvoid scan(T &a) {\n\tcin >> a;\n}\ntemplate <class T>\nvoid scan(vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\ntemplate <class T, class L>\nvoid scan(pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\ntemplate <class T>\ninline void print(T x) {\n\tcout << x << '\\n';\n}\n\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tcerr << \", \";\n\tview(p.second);\n\tcerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(std::set<T> &s) {\n\tif(s.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tcerr << \", \";\n\t\tview(c.second);\n\t\tcerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tcerr << \"] : \";\n\t\tview(t.second);\n\t\tcerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tview(H);\n\tcerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tcerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tview(x); \\\n\t\tcerr << \"\\n\"; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\n#pragma region modint\n\ntemplate <int mod>\nstruct ModInt {\n\tint x;\n\tModInt() : x(0) {}\n\tModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\tModInt &operator+=(const ModInt &p) {\n\t\tif((x += p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tModInt &operator-=(const ModInt &p) {\n\t\tif((x += mod - p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tModInt &operator*=(const ModInt &p) {\n\t\tx = (int)(1LL * x * p.x % mod);\n\t\treturn *this;\n\t}\n\tModInt &operator/=(const ModInt &p) {\n\t\t*this *= p.inverse();\n\t\treturn *this;\n\t}\n\tModInt operator-() const { return ModInt(-x); }\n\tModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\tModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\tModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\tModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\tbool operator==(const ModInt &p) const { return x == p.x; }\n\tbool operator!=(const ModInt &p) const { return x != p.x; }\n\tModInt inverse() const {\n\t\tint a = x, b = mod, u = 1, v = 0, t;\n\t\twhile(b > 0) {\n\t\t\tt = a / b;\n\t\t\tswap(a -= t * b, b);\n\t\t\tswap(u -= t * v, v);\n\t\t}\n\t\treturn ModInt(u);\n\t}\n\tModInt pow(long long n) const {\n\t\tModInt ret(1), mul(x);\n\t\twhile(n > 0) {\n\t\t\tif(n & 1) ret *= mul;\n\t\t\tmul *= mul;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\tfriend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\n\tfriend istream &operator>>(istream &is, ModInt &a) {\n\t\tlong long t;\n\t\tis >> t;\n\t\ta = ModInt<mod>(t);\n\t\treturn (is);\n\t}\n\tstatic int get_mod() { return mod; }\n};\nusing mint = ModInt<mod>;\n\n#pragma endregion\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tINT(n);\n\tvector<int> t(n + 1), l(n + 1), r(n + 1);\n\trep(i, n) { cin >> t[i + 1] >> l[i + 1] >> r[i + 1]; }\n\n\tvector<vector<mint>> dp(n + 1, vector<mint>(n + 1, 0));\n\tdp[0][0] = 1;\n\n\tusing tup = tuple<int, int, mint>;\n\tqueue<tup> q;\n\n\trep(i, n) {\n\t\tint now = i + 1;\n\t\trep(j, now) {\n\t\t\trep(k, now) {\n\t\t\t\tif(r[k] + (t[now] - t[k]) < l[now]) continue;\n\t\t\t\tif(r[now] < l[j] - (t[now] - t[j])) continue;\n\t\t\t\tint a, b;\n\t\t\t\ta = j, b = k;\n\t\t\t\tif(l[j] - (t[now] - t[j]) < l[now]) {\n\t\t\t\t\ta = now;\n\t\t\t\t}\n\t\t\t\tif(r[k] + (t[now] - t[k]) > r[now]) {\n\t\t\t\t\tb = now;\n\t\t\t\t}\n\t\t\t\t// debug(a, b, dp[j][k]);\n\t\t\t\t//if(l[a] > r[b]) continue;\n\t\t\t\tq.push((tup){a, b, dp[j][k]});\n\t\t\t}\n\t\t}\n\t\twhile(!q.empty()) {\n\t\t\tint a, b;\n\t\t\tmint r;\n\t\t\ttie(a, b, r) = q.front();\n\t\t\tq.pop();\n\t\t\tdp[a][b] += r;\n\t\t}\n\t}\n\n\tmint ans = -1;\n\trep(i, n + 1) rep(j, n + 1) { ans += dp[i][j]; }\n\n\tdrop(ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":5020,"score_of_the_acc":-0.0394,"final_rank":4},{"submission_id":"aoj_3181_4849743","code_snippet":"// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region aliases\n\n#define rep(i, n) for(long long i = 0; i < (n); i++)\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bcnt(n) __builtin_popcountll(n)\n#define endk endl\n#define ednl endl\n#define enld endl\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vb = vector<bool>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing mll = map<long long, long long>;\nusing pll = pair<long long, long long>;\nusing qll = queue<long long>;\nusing sll = set<long long>;\nusing vpll = vector<pair<long long, long long>>;\ntemplate <class T = ll>\nusing V = vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\n//昇順pq(小さい方から取り出す)\ntemplate <class T = ll>\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\n//降順pq(大きい方から取り出す)\ntemplate <class T = ll>\nusing pqdn = priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\nlong long const dekai = 3e16;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\n\n// const int mod = 1000000007;\nconst int mod = 998244353;\n\n#pragma endregion\n\n#pragma region basic_procedure\n\ntemplate <class T>\ninline bool isin(T x, T lef, T rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { cout << (f ? \"Yes\" : \"No\") << \"\\n\"; }\nvoid No() { cout << \"No\\n\"; }\nvoid YES(bool f = 1) { cout << (f ? \"YES\" : \"NO\") << \"\\n\"; }\nvoid NO() { cout << \"NO\\n\"; }\ntemplate <class T>\nvoid drop(T answer) {\n\tcout << answer << \"\\n\";\n\texit(0);\n}\nvoid err() {\n\tcout << -1 << \"\\n\";\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(vector<T> &v, bool tate = 0) {\n\tif(v.size() > 0) {\n\t\tfor(auto it = v.begin(); it < v.end(); it++) {\n\t\t\tcout << *it;\n\t\t\tif(it != v.end() - 1) {\n\t\t\t\tif(tate)\n\t\t\t\t\tcout << endl;\n\t\t\t\telse\n\t\t\t\t\tcout << \" \";\n\t\t\t}\n\t\t}\n\t}\n\tcout << endl;\n}\n\ntemplate <class T>\nvoid add(vector<T> &v, T val) {\t //ベクトルの各要素に加算\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\n// vectorの中身を数える map<要素,個数>を返す\ntemplate <class T>\nmap<T, long long> cntv(vector<T> v) {\n\tmap<T, long long> m;\n\tfor(auto &g : v) {\n\t\tif(m.count(g))\n\t\t\tm[g]++;\n\t\telse\n\t\t\tm[g] = 1;\n\t}\n\treturn m;\n}\n\n//配列圧縮\n//{1,36,1,3,8,-2,-92}を\n//{2, 5,2,3,4, 1, 0}にする\ntemplate <class T>\nvector<long long> press(vector<T> &v) {\n\tlong long n = v.size();\n\tvector<long long> w(n);\n\tmap<T, long long> m;\n\tfor(T &p : v) m[p] = 0;\n\tlong long i = 0;\n\tfor(auto &p : m) {\n\t\tp.second = i;\n\t\ti++;\n\t}\n\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\n\treturn w;\n}\n\n// 切り上げ除算\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\tT x = abs(a);\n\tT y = abs(b);\n\tT z = (x + y - 1) / y;\n\tif((a < 0 && b > 0) || (a > 0 && b < 0))\n\t\treturn -z;\n\telse if(a == 0)\n\t\treturn 0;\n\telse\n\t\treturn z;\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\n// a * x % mod == __gcd(a,mod)なるxを返す\n// a が modの倍数でないことが条件\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tswap(a, b);\n\t\tu -= t * v;\n\t\tswap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\nvvll comb(100, vll(100, -1));\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\n\tassert(n < 100 && k < 100);\n\tif(n < k || k < 0 || n < 0) return 0;\n\tif(comb[n][k] != -1) return comb[n][k];\n\tll res;\n\tif(n - k < k)\n\t\tres = com(n, n - k);\n\telse if(k == 0)\n\t\tres = 1;\n\telse\n\t\tres = com(n - 1, k - 1) + com(n - 1, k);\n\tcomb[n][k] = res;\n\treturn res;\n}\n\n// nCk modを求める\nconst int MAX = 5100000;\n// この値は求める二項計数の値に応じて変える\n// MAX=3*10^7のとき1900msほど、ほぼ比例\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid cominit() {\n\t// テーブルを作る前処理\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor(int i = 2; i < MAX; i++) {\n\t\tfac[i] = fac[i - 1] * i % mod;\n\t\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\n\t\tfinv[i] = finv[i - 1] * inv[i] % mod;\n\t}\n}\nlong long commod(long long n, long long k) { // 二項係数\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\nlong long pmod(long long n, long long k) {\t// 順列\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * finv[n - k] % mod;\n}\n// n個の区別しないボールを区別するk個の箱に入れる方法の総数\nlong long hmod(long long n, long long k) {\t// 重複組み合わせ\n\treturn commod(n + k - 1, n);\n}\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tINPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tINPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n\ntemplate <class T>\nvoid scan(T &a) {\n\tcin >> a;\n}\ntemplate <class T>\nvoid scan(vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\ntemplate <class T, class L>\nvoid scan(pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\ntemplate <class T>\ninline void print(T x) {\n\tcout << x << '\\n';\n}\n\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tcerr << \", \";\n\tview(p.second);\n\tcerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(std::set<T> &s) {\n\tif(s.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tcerr << \", \";\n\t\tview(c.second);\n\t\tcerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tcerr << \"] : \";\n\t\tview(t.second);\n\t\tcerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tview(H);\n\tcerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tcerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tview(x); \\\n\t\tcerr << \"\\n\"; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\n#pragma region modint\n\ntemplate <int mod>\nstruct ModInt {\n\tint x;\n\tModInt() : x(0) {}\n\tModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\tModInt &operator+=(const ModInt &p) {\n\t\tif((x += p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tModInt &operator-=(const ModInt &p) {\n\t\tif((x += mod - p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tModInt &operator*=(const ModInt &p) {\n\t\tx = (int)(1LL * x * p.x % mod);\n\t\treturn *this;\n\t}\n\tModInt &operator/=(const ModInt &p) {\n\t\t*this *= p.inverse();\n\t\treturn *this;\n\t}\n\tModInt operator-() const { return ModInt(-x); }\n\tModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\tModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\tModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\tModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\tbool operator==(const ModInt &p) const { return x == p.x; }\n\tbool operator!=(const ModInt &p) const { return x != p.x; }\n\tModInt inverse() const {\n\t\tint a = x, b = mod, u = 1, v = 0, t;\n\t\twhile(b > 0) {\n\t\t\tt = a / b;\n\t\t\tswap(a -= t * b, b);\n\t\t\tswap(u -= t * v, v);\n\t\t}\n\t\treturn ModInt(u);\n\t}\n\tModInt pow(long long n) const {\n\t\tModInt ret(1), mul(x);\n\t\twhile(n > 0) {\n\t\t\tif(n & 1) ret *= mul;\n\t\t\tmul *= mul;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\tfriend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\n\tfriend istream &operator>>(istream &is, ModInt &a) {\n\t\tlong long t;\n\t\tis >> t;\n\t\ta = ModInt<mod>(t);\n\t\treturn (is);\n\t}\n\tstatic int get_mod() { return mod; }\n};\nusing mint = ModInt<mod>;\n\n#pragma endregion\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tINT(n);\n\tvector<int> t(n + 1), l(n + 1), r(n + 1);\n\trep(i, n) { cin >> t[i + 1] >> l[i + 1] >> r[i + 1]; }\n\n\tvector<vector<mint>> dp(n + 1, vector<mint>(n + 1, 0));\n\tdp[0][0] = 1;\n\n\tusing tup = tuple<int, int, mint>;\n\tqueue<tup> q;\n\n\trep(i, n) {\n\t\tint now = i + 1;\n\t\trep(j, now) {\n\t\t\trep(k, now) {\n\t\t\t\tif(r[k] + (t[now] - t[k]) < l[now]) continue;\n\t\t\t\tif(r[now] < l[j] - (t[now] - t[j])) continue;\n\t\t\t\tint a, b;\n\t\t\t\ta = j, b = k;\n\t\t\t\tif(l[j] - (t[now] - t[j]) < l[now]) {\n\t\t\t\t\ta = now;\n\t\t\t\t}\n\t\t\t\tif(r[k] + (t[now] - t[k]) > r[now]) {\n\t\t\t\t\tb = now;\n\t\t\t\t}\n\t\t\t\t// debug(a, b, dp[j][k]);\n\t\t\t\t// if(l[a] > r[b]) continue;\n\t\t\t\tq.push((tup){a, b, dp[j][k]});\n\t\t\t}\n\t\t}\n\t\twhile(!q.empty()) {\n\t\t\tint a, b;\n\t\t\tmint r;\n\t\t\ttie(a, b, r) = q.front();\n\t\t\tq.pop();\n\t\t\tdp[a][b] += r;\n\t\t}\n\t\t// dump(dp);\n\t}\n\n\tmint ans = -1;\n\trep(i, n + 1) rep(j, n + 1) { ans += dp[i][j]; }\n\n\tdrop(ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":5016,"score_of_the_acc":-0.0394,"final_rank":3},{"submission_id":"aoj_3181_4849732","code_snippet":"// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region aliases\n\n#define rep(i, n) for(long long i = 0; i < (n); i++)\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bcnt(n) __builtin_popcountll(n)\n#define endk endl\n#define ednl endl\n#define enld endl\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vb = vector<bool>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing mll = map<long long, long long>;\nusing pll = pair<long long, long long>;\nusing qll = queue<long long>;\nusing sll = set<long long>;\nusing vpll = vector<pair<long long, long long>>;\ntemplate <class T = ll>\nusing V = vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\n//昇順pq(小さい方から取り出す)\ntemplate <class T = ll>\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\n//降順pq(大きい方から取り出す)\ntemplate <class T = ll>\nusing pqdn = priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\nlong long const dekai = 3e16;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\n\n// const int mod = 1000000007;\nconst int mod = 998244353;\n\n#pragma endregion\n\n#pragma region basic_procedure\n\ntemplate <class T>\ninline bool isin(T x, T lef, T rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { cout << (f ? \"Yes\" : \"No\") << \"\\n\"; }\nvoid No() { cout << \"No\\n\"; }\nvoid YES(bool f = 1) { cout << (f ? \"YES\" : \"NO\") << \"\\n\"; }\nvoid NO() { cout << \"NO\\n\"; }\ntemplate <class T>\nvoid drop(T answer) {\n\tcout << answer << \"\\n\";\n\texit(0);\n}\nvoid err() {\n\tcout << -1 << \"\\n\";\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(vector<T> &v, bool tate = 0) {\n\tif(v.size() > 0) {\n\t\tfor(auto it = v.begin(); it < v.end(); it++) {\n\t\t\tcout << *it;\n\t\t\tif(it != v.end() - 1) {\n\t\t\t\tif(tate)\n\t\t\t\t\tcout << endl;\n\t\t\t\telse\n\t\t\t\t\tcout << \" \";\n\t\t\t}\n\t\t}\n\t}\n\tcout << endl;\n}\n\ntemplate <class T>\nvoid add(vector<T> &v, T val) {\t //ベクトルの各要素に加算\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\n// vectorの中身を数える map<要素,個数>を返す\ntemplate <class T>\nmap<T, long long> cntv(vector<T> v) {\n\tmap<T, long long> m;\n\tfor(auto &g : v) {\n\t\tif(m.count(g))\n\t\t\tm[g]++;\n\t\telse\n\t\t\tm[g] = 1;\n\t}\n\treturn m;\n}\n\n//配列圧縮\n//{1,36,1,3,8,-2,-92}を\n//{2, 5,2,3,4, 1, 0}にする\ntemplate <class T>\nvector<long long> press(vector<T> &v) {\n\tlong long n = v.size();\n\tvector<long long> w(n);\n\tmap<T, long long> m;\n\tfor(T &p : v) m[p] = 0;\n\tlong long i = 0;\n\tfor(auto &p : m) {\n\t\tp.second = i;\n\t\ti++;\n\t}\n\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\n\treturn w;\n}\n\n// 切り上げ除算\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\tT x = abs(a);\n\tT y = abs(b);\n\tT z = (x + y - 1) / y;\n\tif((a < 0 && b > 0) || (a > 0 && b < 0))\n\t\treturn -z;\n\telse if(a == 0)\n\t\treturn 0;\n\telse\n\t\treturn z;\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\n// a * x % mod == __gcd(a,mod)なるxを返す\n// a が modの倍数でないことが条件\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tswap(a, b);\n\t\tu -= t * v;\n\t\tswap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\nvvll comb(100, vll(100, -1));\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\n\tassert(n < 100 && k < 100);\n\tif(n < k || k < 0 || n < 0) return 0;\n\tif(comb[n][k] != -1) return comb[n][k];\n\tll res;\n\tif(n - k < k)\n\t\tres = com(n, n - k);\n\telse if(k == 0)\n\t\tres = 1;\n\telse\n\t\tres = com(n - 1, k - 1) + com(n - 1, k);\n\tcomb[n][k] = res;\n\treturn res;\n}\n\n// nCk modを求める\nconst int MAX = 5100000;\n// この値は求める二項計数の値に応じて変える\n// MAX=3*10^7のとき1900msほど、ほぼ比例\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid cominit() {\n\t// テーブルを作る前処理\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor(int i = 2; i < MAX; i++) {\n\t\tfac[i] = fac[i - 1] * i % mod;\n\t\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\n\t\tfinv[i] = finv[i - 1] * inv[i] % mod;\n\t}\n}\nlong long commod(long long n, long long k) { // 二項係数\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\nlong long pmod(long long n, long long k) {\t// 順列\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * finv[n - k] % mod;\n}\n// n個の区別しないボールを区別するk個の箱に入れる方法の総数\nlong long hmod(long long n, long long k) {\t// 重複組み合わせ\n\treturn commod(n + k - 1, n);\n}\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tINPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tINPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n\ntemplate <class T>\nvoid scan(T &a) {\n\tcin >> a;\n}\ntemplate <class T>\nvoid scan(vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\ntemplate <class T, class L>\nvoid scan(pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\ntemplate <class T>\ninline void print(T x) {\n\tcout << x << '\\n';\n}\n\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tcerr << \", \";\n\tview(p.second);\n\tcerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(std::set<T> &s) {\n\tif(s.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tcerr << \", \";\n\t\tview(c.second);\n\t\tcerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tcerr << \"] : \";\n\t\tview(t.second);\n\t\tcerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tview(H);\n\tcerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tcerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tview(x); \\\n\t\tcerr << \"\\n\"; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\n#pragma region modint\n\ntemplate <int mod>\nstruct ModInt {\n\tint x;\n\tModInt() : x(0) {}\n\tModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\tModInt &operator+=(const ModInt &p) {\n\t\tif((x += p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tModInt &operator-=(const ModInt &p) {\n\t\tif((x += mod - p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tModInt &operator*=(const ModInt &p) {\n\t\tx = (int)(1LL * x * p.x % mod);\n\t\treturn *this;\n\t}\n\tModInt &operator/=(const ModInt &p) {\n\t\t*this *= p.inverse();\n\t\treturn *this;\n\t}\n\tModInt operator-() const { return ModInt(-x); }\n\tModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\tModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\tModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\tModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\tbool operator==(const ModInt &p) const { return x == p.x; }\n\tbool operator!=(const ModInt &p) const { return x != p.x; }\n\tModInt inverse() const {\n\t\tint a = x, b = mod, u = 1, v = 0, t;\n\t\twhile(b > 0) {\n\t\t\tt = a / b;\n\t\t\tswap(a -= t * b, b);\n\t\t\tswap(u -= t * v, v);\n\t\t}\n\t\treturn ModInt(u);\n\t}\n\tModInt pow(long long n) const {\n\t\tModInt ret(1), mul(x);\n\t\twhile(n > 0) {\n\t\t\tif(n & 1) ret *= mul;\n\t\t\tmul *= mul;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\tfriend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\n\tfriend istream &operator>>(istream &is, ModInt &a) {\n\t\tlong long t;\n\t\tis >> t;\n\t\ta = ModInt<mod>(t);\n\t\treturn (is);\n\t}\n\tstatic int get_mod() { return mod; }\n};\nusing mint = ModInt<mod>;\n\n#pragma endregion\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tINT(n);\n\tvector<int> t(n + 1), l(n + 1), r(n + 1);\n\trep(i, n) { cin >> t[i + 1] >> l[i + 1] >> r[i + 1]; }\n\n\tvector<vector<mint>> dp(n + 1, vector<mint>(n + 1, 0));\n\tdp[0][0] = 1;\n\n\tusing tup = tuple<int, int, mint>;\n\tqueue<tup> q;\n\n\trep(i, n) {\n\t\tint now = i + 1;\n\t\trep(j, n + 1) {\n\t\t\tif(j >= now) break;\n\t\t\trep(k, n + 1) {\n\t\t\t\tif(k >= now) break;\n\t\t\t\tif(r[k] + (t[now] - t[k]) < l[now]) continue;\n\t\t\t\tif(r[now] < l[j] - (t[now] - t[j])) continue;\n\t\t\t\tint a, b;\n\t\t\t\ta = j, b = k;\n\t\t\t\tif(l[j] - (t[now] - t[j]) < l[now]) {\n\t\t\t\t\ta = now;\n\t\t\t\t}\n\t\t\t\tif(r[j] + (t[now] - t[j]) > r[now]) {\n\t\t\t\t\tb = now;\n\t\t\t\t}\n\t\t\t\tdebug(a, b, dp[j][k]);\n\t\t\t\t// if(l[a] > r[b]) continue;\n\t\t\t\tq.push((tup){a, b, dp[j][k]});\n\t\t\t}\n\t\t}\n\t\twhile(!q.empty()) {\n\t\t\tint a, b;\n\t\t\tmint r;\n\t\t\ttie(a, b, r) = q.front();\n\t\t\tq.pop();\n\t\t\tdp[a][b] += r;\n\t\t}\n\t\tdump(dp);\n\t}\n\n\tmint ans = -1;\n\trep(i, n + 1) rep(j, n + 1) { ans += dp[i][j]; }\n\n\tdrop(ans);\n\n\treturn 0;\n}","accuracy":0.02564102564102564,"time_ms":40,"memory_kb":4940,"score_of_the_acc":-0.0391,"final_rank":19},{"submission_id":"aoj_3181_4849563","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nstruct dat {\n long long t, l, r;\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\n bool operator==(const dat &d) const {\n return t == d.t && l == d.l && r == d.r;\n }\n bool operator<(const dat &d) const {\n if (t != d.t) return t < d.t;\n if (l != d.l) return l < d.l;\n return r < d.r;\n }\n dat operator*(const dat &d) const {\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\n if (res.l > res.r) res = dat(-1, 0, 0);\n return res;\n }\n};\n\nint n;\nvector<dat> v;\nmap<dat, ModInt<>> dp;\n\nModInt<> solve();\n\nint main() {\n cin >> n;\n v.resize(n);\n for (auto &p : v) cin >> p.t >> p.l >> p.r;\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n dp[dat()] = 1;\n for (int i = 0; i < n; ++i) {\n vector<dat> memod;\n vector<ModInt<>> memoc;\n for (auto [d, c] : dp) {\n dat now = d * v[i];\n if (now.t >= 0) {\n memod.push_back(now);\n memoc.push_back(c);\n }\n }\n int len = memod.size();\n for (int j = 0; j < len; ++j) dp[memod[j]] += memoc[j];\n }\n ModInt<> res = -1;\n for (auto [d, c] : dp) res += c;\n\n return res;\n}","accuracy":1,"time_ms":370,"memory_kb":19508,"score_of_the_acc":-0.4732,"final_rank":8},{"submission_id":"aoj_3181_4849561","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nstruct dat {\n long long t, l, r;\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\n bool operator==(const dat &d) const {\n return t == d.t && l == d.l && r == d.r;\n }\n bool operator<(const dat &d) const {\n if (t != d.t) return t < d.t;\n if (l != d.l) return l < d.l;\n return r < d.r;\n }\n dat operator*(const dat &d) const {\n assert(0 <= t && t < d.t && l <= r && d.l <= d.r);\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\n if (res.l > res.r) res = dat(-1, 0, 0);\n return res;\n }\n};\n\nint n;\nvector<dat> v;\nmap<dat, ModInt<>> dp;\n\nModInt<> solve();\n\nint main() {\n cin >> n;\n v.resize(n);\n for (auto &p : v) cin >> p.t >> p.l >> p.r;\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n dp[dat()] = 1;\n for (int i = 0; i < n; ++i) {\n vector<dat> memod;\n vector<ModInt<>> memoc;\n for (auto [d, c] : dp) {\n dat now = d * v[i];\n if (now.t >= 0) {\n memod.push_back(now);\n memoc.push_back(c);\n }\n }\n int len = memod.size();\n for (int j = 0; j < len; ++j) {\n if (!dp.count(memod[j]))\n dp[memod[j]] = memoc[j];\n else\n dp[memod[j]] += memoc[j];\n }\n }\n ModInt<> res = -1;\n for (auto [d, c] : dp) {\n assert(d.t >= 0);\n res += c;\n }\n return res;\n}","accuracy":1,"time_ms":610,"memory_kb":19508,"score_of_the_acc":-0.7399,"final_rank":9},{"submission_id":"aoj_3181_4849554","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nstruct dat {\n long long t, l, r;\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\n bool operator==(const dat &d) const {\n return t == d.t && l == d.l && r == d.r;\n }\n bool operator<(const dat &d) const {\n if (t != d.t) return t < d.t;\n if (l != d.r) return l < d.l;\n return r < d.r;\n }\n dat operator*(const dat &d) const {\n assert(0 <= t && t < d.t && l <= r && d.l <= d.r);\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\n if (res.l > res.r) res = dat(-1, 0, 0);\n return res;\n }\n};\n\nint n;\nvector<dat> v;\nmap<dat, ModInt<>> dp;\n\nModInt<> solve();\n\nint main() {\n cin >> n;\n v.resize(n);\n for (auto &p : v) cin >> p.t >> p.l >> p.r;\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n dp[dat()] = 1;\n for (int i = 0; i < n; ++i) {\n vector<dat> memod;\n vector<ModInt<>> memoc;\n for (auto [d, c] : dp) {\n dat now = d * v[i];\n if (now.t >= 0) {\n memod.push_back(now);\n memoc.push_back(c);\n }\n }\n int len = memod.size();\n for (int j = 0; j < len; ++j) {\n if (!dp.count(memod[j]))\n dp[memod[j]] = memoc[j];\n else\n dp[memod[j]] += memoc[j];\n }\n }\n ModInt<> res = -1;\n for (auto [d, c] : dp) {\n assert(d.t >= 0);\n res += c;\n }\n return res;\n}","accuracy":0.02564102564102564,"time_ms":20,"memory_kb":3880,"score_of_the_acc":-0.0119,"final_rank":17},{"submission_id":"aoj_3181_4849549","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nstruct dat {\n long long t, l, r;\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\n bool operator==(const dat &d) const {\n return t == d.t && l == d.l && r == d.r;\n }\n bool operator<(const dat &d) const {\n if (t != d.t) return t < d.t;\n if (l != d.r) return l < d.l;\n return r < d.r;\n }\n dat operator*(const dat &d) const {\n assert(0 <= t && t < d.t && l <= r && d.l <= d.r);\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\n if (res.l > res.r) res = dat(-1, 0, 0);\n return res;\n }\n};\n\nint n;\nvector<dat> v;\nmap<dat, ModInt<>> dp;\n\nModInt<> solve();\n\nint main() {\n cin >> n;\n v.resize(n);\n for (int i = 0; i < n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n dp[dat()] = 1;\n for (int i = 0; i < n; ++i) {\n vector<dat> memod;\n vector<ModInt<>> memoc;\n for (auto [d, c] : dp) {\n dat now = d * v[i];\n if (now.t >= 0) {\n memod.push_back(now);\n memoc.push_back(c);\n }\n }\n int len = memod.size();\n for (int j = 0; j < len; ++j) dp[memod[j]] += memoc[j];\n }\n ModInt<> res = -1;\n for (auto [d, c] : dp) {\n assert(d.t >= 0);\n res += c;\n }\n return res;\n}","accuracy":0.02564102564102564,"time_ms":10,"memory_kb":3960,"score_of_the_acc":-0.0012,"final_rank":13},{"submission_id":"aoj_3181_4849540","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nstruct dat {\n long long t, l, r;\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\n bool operator==(const dat &d) const {\n return t == d.t && l == d.l && r == d.r;\n }\n bool operator<(const dat &d) const {\n if (t != d.t) return t < d.t;\n if (l != d.r) return l < d.l;\n return r < d.r;\n }\n dat operator*(const dat &d) const {\n if (t < 0) return dat(-1, 0, 0);\n assert(t < d.t && l <= r && d.l <= d.r);\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\n if (res.l > res.r) res = dat(-1, 0, 0);\n return res;\n }\n};\n\nint n;\nvector<dat> v;\nmap<dat, ModInt<>> dp;\n\nModInt<> solve();\n\nint main() {\n cin >> n;\n v.resize(n);\n for (int i = 0; i < n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n dp[dat()] = 1;\n for (int i = 0; i < n; ++i) {\n vector<dat> memod;\n vector<ModInt<>> memoc;\n for (auto [d, c] : dp) {\n dat now = d * v[i];\n if (now.t >= 0) {\n memod.push_back(now);\n memoc.push_back(c);\n }\n }\n int len = memod.size();\n for (int j = 0; j < len; ++j) dp[memod[j]] += memoc[j];\n }\n ModInt<> res = -1;\n for (auto [d, c] : dp) {\n assert(d.t >= 0);\n res += c;\n }\n return res;\n}","accuracy":0.02564102564102564,"time_ms":10,"memory_kb":4004,"score_of_the_acc":-0.0014,"final_rank":15},{"submission_id":"aoj_3181_4849519","code_snippet":"#include <iostream>\n#include <map>\n\ntemplate <int MOD>\nstruct ModInt {\n using lint = long long;\n int val;\n\n // constructor\n ModInt(lint v = 0) : val(v % MOD) {\n if (val < 0) val += MOD;\n };\n\n // unary operator\n ModInt operator+() const { return ModInt(val); }\n ModInt operator-() const { return ModInt(MOD - val); }\n ModInt inv() const { return this->pow(MOD - 2); }\n\n // arithmetic\n ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }\n ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }\n ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }\n ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }\n ModInt pow(lint n) const {\n auto x = ModInt(1);\n auto b = *this;\n while (n > 0) {\n if (n & 1) x *= b;\n n >>= 1;\n b *= b;\n }\n return x;\n }\n\n // compound assignment\n ModInt& operator+=(const ModInt& x) {\n if ((val += x.val) >= MOD) val -= MOD;\n return *this;\n }\n ModInt& operator-=(const ModInt& x) {\n if ((val -= x.val) < 0) val += MOD;\n return *this;\n }\n ModInt& operator*=(const ModInt& x) {\n val = lint(val) * x.val % MOD;\n return *this;\n }\n ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }\n\n // compare\n bool operator==(const ModInt& b) const { return val == b.val; }\n bool operator!=(const ModInt& b) const { return val != b.val; }\n bool operator<(const ModInt& b) const { return val < b.val; }\n bool operator<=(const ModInt& b) const { return val <= b.val; }\n bool operator>(const ModInt& b) const { return val > b.val; }\n bool operator>=(const ModInt& b) const { return val >= b.val; }\n\n // I/O\n friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept {\n lint v;\n is >> v;\n x = v;\n return is;\n }\n friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }\n};\n\nconstexpr int MOD = 998244353;\nusing mint = ModInt<MOD>;\n\nvoid solve() {\n int n;\n std::cin >> n;\n\n // [L, R]に自由に移動できるときの通り数\n std::map<std::pair<int, int>, mint> dp;\n dp[std::make_pair(0, 0)] = 1;\n\n int pt = 0; // 前の命令の時刻\n while (n--) {\n int t, l, r;\n std::cin >> t >> l >> r;\n\n std::map<std::pair<int, int>, mint> ndp;\n for (auto [p, v] : dp) {\n auto [pl, pr] = p;\n\n // 左右に引き伸ばす\n pl -= t - pt;\n pr += t - pt;\n\n {\n // 守らない場合\n auto q = std::make_pair(pl, pr);\n if (!ndp.count(q)) ndp[q] = 0;\n ndp[q] += v;\n }\n\n // 守る場合\n pl = std::max(pl, l);\n pr = std::min(pr, r);\n if (pr < pl) continue;\n\n {\n auto q = std::make_pair(pl, pr);\n if (!ndp.count(q)) ndp[q] = 0;\n ndp[q] += v;\n }\n }\n\n std::swap(dp, ndp);\n pt = t;\n }\n\n mint ans = 0;\n for (auto [p, v] : dp) ans += v;\n std::cout << ans - 1 << \"\\n\";\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":4416,"score_of_the_acc":-0.1255,"final_rank":5},{"submission_id":"aoj_3181_4849514","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nstruct dat {\n long long t, l, r;\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\n bool operator==(const dat &d) const {\n return t == d.t && l == d.l && r == d.r;\n }\n bool operator<(const dat &d) const {\n if (t != d.t) return t < d.t;\n if (l != d.r) return l < d.l;\n return r < d.r;\n }\n dat operator*(const dat &d) const {\n if (t < 0) return dat(-1, 0, 0);\n assert(t < d.t);\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\n if (res.l > res.r) res = dat(-1, 0, 0);\n return res;\n }\n};\n\nint n;\nvector<dat> v;\nmap<dat, ModInt<>> dp;\n\nModInt<> solve();\n\nint main() {\n cin >> n;\n v.resize(n);\n for (int i = 0; i < n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n dp[dat()] = 1;\n for (int i = 0; i < n; ++i) {\n vector<dat> memod;\n vector<ModInt<>> memoc;\n for (auto [d, c] : dp) {\n dat now = d * v[i];\n if (now.t >= 0) {\n memod.push_back(now);\n memoc.push_back(c);\n }\n }\n int len = memod.size();\n for (int j = 0; j < len; ++j) dp[memod[j]] += memoc[j];\n }\n ModInt<> res = -1;\n for (auto [d, c] : dp) res += c;\n return res;\n}","accuracy":0.02564102564102564,"time_ms":10,"memory_kb":3880,"score_of_the_acc":-0.0008,"final_rank":12},{"submission_id":"aoj_3181_4849500","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nstruct dat {\n int t, l, r;\n dat(int x = 0, int y = 0, int z = 0) : t(x), l(y), r(z) {}\n bool operator==(const dat &d) const {\n return t == d.t && l == d.l && r == d.r;\n }\n bool operator<(const dat &d) const {\n if (t != d.t) return t < d.t;\n if (l != d.r) return l < d.l;\n return r < d.r;\n }\n dat operator*(const dat &d) const {\n if (t < 0) return dat(-1, 0, 0);\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\n if (res.l > res.r || res.r < d.l || d.r < res.l) res = dat(-1, 0, 0);\n return res;\n }\n};\n\nint n;\nvector<dat> v;\nmap<dat, ModInt<>> dp;\n\nModInt<> solve();\n\nint main() {\n cin >> n;\n v.resize(n);\n for (int i = 0; i < n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n dp[dat()] = 1;\n for (int i = 0; i < n; ++i) {\n vector<dat> memod;\n vector<ModInt<>> memoc;\n for (auto [d, c] : dp) {\n dat now = d * v[i];\n if (now.t >= 0) {\n memod.push_back(now);\n memoc.push_back(c);\n }\n }\n int len = memod.size();\n for (int j = 0; j < len; ++j) dp[memod[j]] += memoc[j];\n }\n ModInt<> res = -1;\n for (auto [d, c] : dp) res += c;\n return res;\n}","accuracy":0.02564102564102564,"time_ms":10,"memory_kb":3964,"score_of_the_acc":-0.0012,"final_rank":14},{"submission_id":"aoj_3181_4849414","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nstruct dat {\n int t, l, r;\n dat(int x = 0, int y = 0, int z = 0) : t(x), l(y), r(z) {}\n bool operator==(const dat &d) const {\n return t == d.t && l == d.l && r == d.r;\n }\n dat operator*(const dat &d) const {\n if (t < 0) return dat(-1, 0, 0);\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\n if (res.l > res.r || res.r < d.l || d.r < res.l) res = dat(-1, 0, 0);\n return res;\n }\n};\n\nint n;\nvector<dat> v;\nvector<vector<dat>> memo;\nvector<vector<ModInt<>>> dp;\n\nModInt<> solve();\n\nint main() {\n cin >> n;\n v.resize(n + 1);\n for (int i = 1; i <= n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n { // pre calc\n memo.resize(n + 1, vector<dat>(n + 1));\n for (int i = 0; i <= n; ++i)\n for (int j = i; j <= n; ++j) memo[i][j] = v[i] * v[j];\n }\n dp.assign(n + 1, vector<ModInt<>>(n + 1, 0));\n dp[0][0] = 1;\n for (int i = 1; i <= n; ++i) {\n for (int j = 0; j < i; ++j)\n for (int k = j; k < i; ++k)\n if (memo[j][k].t >= 0) {\n dat now = memo[j][k] * v[i];\n if (now.t < 0) continue;\n if (now == v[i])\n dp[i][i] += dp[j][k];\n else if (now == memo[j][i])\n dp[j][i] += dp[j][k];\n else if (now == memo[k][i])\n dp[k][i] += dp[j][k];\n else\n assert(0);\n }\n }\n ModInt<> res = -1;\n for (int i = 0; i <= n; ++i)\n for (int j = i; j <= n; ++j) res += dp[i][j];\n return res;\n}","accuracy":0.02564102564102564,"time_ms":10,"memory_kb":4768,"score_of_the_acc":-0.0049,"final_rank":16},{"submission_id":"aoj_3181_4849410","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nstruct dat {\n int t, l, r;\n dat(int x = 0, int y = 0, int z = 0) : t(x), l(y), r(z) {}\n bool operator==(const dat &d) const {\n return t == d.t && l == d.l && r == d.r;\n }\n dat operator*(const dat &d) const {\n if (t < 0) return dat(-1, 0, 0);\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\n if (res.l > res.r || res.r < d.l || d.r < res.l) res = dat(-1, 0, 0);\n return res;\n }\n};\n\nint n;\nvector<dat> v;\nvector<vector<dat>> memo;\nvector<vector<ModInt<>>> dp;\n\nModInt<> solve();\n\nint main() {\n cin >> n;\n v.resize(n + 1);\n for (int i = 1; i <= n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n { // pre calc\n memo.resize(n + 1, vector<dat>(n + 1));\n for (int i = 0; i <= n; ++i)\n for (int j = i; j <= n; ++j) memo[i][j] = v[i] * v[j];\n }\n dp.assign(n + 1, vector<ModInt<>>(n + 1, 0));\n dp[0][0] = 1;\n for (int i = 1; i <= n; ++i) {\n for (int j = 0; j < i; ++j)\n for (int k = j; k < i; ++k)\n if (memo[j][k].t >= 0) {\n dat now = memo[j][k] * v[i];\n if (now.t < 0) continue;\n if (now == v[i])\n dp[i][i] += dp[j][k];\n else if (now == memo[j][i])\n dp[j][i] += dp[j][k];\n else\n dp[k][i] += dp[j][k];\n }\n }\n ModInt<> res = -1;\n for (int i = 0; i <= n; ++i)\n for (int j = i; j <= n; ++j) res += dp[i][j];\n return res;\n}","accuracy":0.02564102564102564,"time_ms":20,"memory_kb":4884,"score_of_the_acc":-0.0166,"final_rank":18},{"submission_id":"aoj_3181_4849384","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\n\nstruct dat {\n int t, l, r;\n dat(int x = 0, int y = 0, int z = 0) : t(x), l(y), r(z) {}\n bool operator==(const dat &d) const {\n return t == d.t && l == d.l && r == d.r;\n }\n dat operator*(const dat &d) const {\n if (t < 0) return dat(-1, 0, 0);\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\n if (res.l > res.r || res.r < d.l || d.r < res.l) res = dat(-1, 0, 0);\n return res;\n }\n};\n\nint n;\nvector<dat> v;\nvector<vector<dat>> memo;\nvector<vector<vector<ModInt<>>>> dp;\n\nModInt<> solve();\n\nint main() {\n cin >> n;\n v.resize(n + 1);\n for (int i = 1; i <= n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\n cout << solve() << endl;\n return 0;\n}\n\nModInt<> solve() {\n { // pre calc\n memo.resize(n + 1, vector<dat>(n + 1));\n for (int i = 0; i <= n; ++i)\n for (int j = i; j <= n; ++j) memo[i][j] = v[i] * v[j];\n }\n dp.assign(n + 1, vector(n + 1, vector<ModInt<>>(n + 1, 0)));\n dp[0][0][0] = 1;\n for (int i = 1; i <= n; ++i) {\n dp[i] = dp[i - 1];\n for (int j = 0; j < i; ++j)\n for (int k = j; k < i; ++k) {\n dat now = memo[j][k] * v[i];\n if (now.t < 0) continue;\n if (now == v[i])\n dp[i][i][i] += dp[i - 1][j][k];\n else\n dp[i][j][i] += dp[i - 1][j][k];\n }\n }\n ModInt<> res = -1;\n for (int i = 0; i <= n; ++i)\n for (int j = i; j <= n; ++j) res += dp[n][i][j];\n return res;\n}","accuracy":0.02564102564102564,"time_ms":60,"memory_kb":114152,"score_of_the_acc":-0.5672,"final_rank":20},{"submission_id":"aoj_3181_4849342","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <cassert>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <string>\n#include <algorithm>\n#include <utility>\n#define llint long long\n#define inf 1e18\n#define PI 3.14159265358979323846264338327950\n#define eps 1e-8\n#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)\n#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\n#define chmin(x, y) (x) = min((x), (y))\n#define chmax(x, y) (x) = max((x), (y))\n#define mod 998244353\n\nusing namespace std;\ntypedef pair<llint, llint> P;\n\nllint n;\nllint t[305], l[305], r[305];\nllint dp[305][305][305];\n\nint main(void)\n{\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\t\n\tcin >> n;\n\tfor(int i = 1; i <= n; i++) cin >> t[i] >> l[i] >> r[i];\n\t\n\tdp[0][0][0] = 1;\n\tfor(int i = 0; i < n; i++){\n\t\tfor(int j = 0; j <= n; j++){\n\t\t\tfor(int k = 0; k <= n; k++){\n\t\t\t\t(dp[i+1][j][k] += dp[i][j][k]) %= mod;\n\t\t\t\tllint nj = j, nk = k;\n\t\t\t\tllint L = l[j] - (t[i+1] - t[j]), R = r[k] + (t[i+1] - t[k]);\n\t\t\t\tif(R < l[i+1] || L > r[i+1]) continue;\n\t\t\t\tif(L <= l[i+1]) nj = i+1;\n\t\t\t\tif(R >= r[i+1]) nk = i+1;\n\t\t\t\t(dp[i+1][nj][nk] += dp[i][j][k]) %= mod;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tllint ans = 0;\n\tfor(int j = 0; j <= n; j++){\n\t\tfor(int k = 0; k <= n; k++){\n\t\t\tans += dp[n][j][k], ans %= mod;\n\t\t}\n\t}\n\tans += mod - 1, ans %= mod;\n\tcout << ans << endl;\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":219556,"score_of_the_acc":-1.1556,"final_rank":11},{"submission_id":"aoj_3181_4849247","code_snippet":"#include <iostream>\n#include <map>\n#include <vector>\n\ntemplate <int MOD>\nstruct ModInt {\n using lint = long long;\n int val;\n\n // constructor\n ModInt(lint v = 0) : val(v % MOD) {\n if (val < 0) val += MOD;\n };\n\n // unary operator\n ModInt operator+() const { return ModInt(val); }\n ModInt operator-() const { return ModInt(MOD - val); }\n ModInt inv() const { return this->pow(MOD - 2); }\n\n // arithmetic\n ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }\n ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }\n ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }\n ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }\n ModInt pow(lint n) const {\n auto x = ModInt(1);\n auto b = *this;\n while (n > 0) {\n if (n & 1) x *= b;\n n >>= 1;\n b *= b;\n }\n return x;\n }\n\n // compound assignment\n ModInt& operator+=(const ModInt& x) {\n if ((val += x.val) >= MOD) val -= MOD;\n return *this;\n }\n ModInt& operator-=(const ModInt& x) {\n if ((val -= x.val) < 0) val += MOD;\n return *this;\n }\n ModInt& operator*=(const ModInt& x) {\n val = lint(val) * x.val % MOD;\n return *this;\n }\n ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }\n\n // compare\n bool operator==(const ModInt& b) const { return val == b.val; }\n bool operator!=(const ModInt& b) const { return val != b.val; }\n bool operator<(const ModInt& b) const { return val < b.val; }\n bool operator<=(const ModInt& b) const { return val <= b.val; }\n bool operator>(const ModInt& b) const { return val > b.val; }\n bool operator>=(const ModInt& b) const { return val >= b.val; }\n\n // I/O\n friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept {\n lint v;\n is >> v;\n x = v;\n return is;\n }\n friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }\n};\n\nconstexpr int MOD = 998244353;\nusing mint = ModInt<MOD>;\n\nvoid solve() {\n int n;\n std::cin >> n;\n\n std::map<std::pair<int, int>, mint> dp;\n dp[std::make_pair(0, 0)] = 1;\n\n int pt = 0;\n while (n--) {\n int t, l, r;\n std::cin >> t >> l >> r;\n\n std::map<std::pair<int, int>, mint> ndp;\n for (auto [p, v] : dp) {\n auto [pl, pr] = p;\n\n pl -= t - pt;\n pr += t - pt;\n\n {\n auto q = std::make_pair(pl, pr);\n if (!ndp.count(q)) ndp[q] = 0;\n ndp[q] += v;\n }\n\n pl = std::max(pl, l);\n pr = std::min(pr, r);\n if (pr < pl) continue;\n\n {\n auto q = std::make_pair(pl, pr);\n if (!ndp.count(q)) ndp[q] = 0;\n ndp[q] += v;\n }\n }\n\n std::swap(dp, ndp);\n pt = t;\n }\n\n mint ans = 0;\n for (auto [p, v] : dp) ans += v;\n std::cout << ans - 1 << \"\\n\";\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":4472,"score_of_the_acc":-0.1258,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_3181_10355871\",\n \"code_snippet\": \"// AOJ #3181 Proper Instructions\\n// 2025.4.7\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst ll MOD = 998244353;\\n\\nstruct Instr { ll t, L, R; };\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n int n;\\n cin >> n;\\n vector<Instr> a(n);\\n for(int i=0; i<n; i++) cin >> a[i].t >> a[i].L >> a[i].R;\\n\\n vector<map<pair<ll,ll>, ll>> dp(n);\\n ll ans = 0;\\n for (int i = 0; i < n; i++){\\n ll lo = max(a[i].L, -a[i].t);\\n ll hi = min(a[i].R, a[i].t);\\n if(lo <= hi) dp[i][{lo, hi}] = (dp[i][{lo, hi}] + 1) % MOD;\\n for (int j = 0; j < i; j++){\\n ll d = a[i].t - a[j].t;\\n for(auto &st : dp[j]){\\n ll l = st.first.first, r = st.first.second;\\n ll cnt = st.second;\\n ll nl = max(a[i].L, l - d);\\n ll nh = min(a[i].R, r + d);\\n if(nl <= nh) dp[i][{nl, nh}] = (dp[i][{nl, nh}] + cnt) % MOD;\\n }\\n }\\n for(auto &st: dp[i]) ans = (ans + st.second) % MOD;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 11680,\n \"score_of_the_acc\": -0.3703,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3181_4906170\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n\\n friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) += rhs;\\n }\\n friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) -= rhs;\\n }\\n friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) *= rhs;\\n }\\n friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) /= rhs;\\n }\\n\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\nusing modint = ModInt< MOD9 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}\\n//using modint=ld;\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n ll n;cin>>n;\\n vector<ll>t(n+1),l(n+1),r(n+1);\\n rep(i,1,n+1)cin>>t[i]>>l[i]>>r[i];\\n auto dp=vec(n+1,n+1,modint(0));\\n dp[0][0]=1;\\n rep(i,1,n+1){\\n auto ndp=vec(n+1,n+1,modint(0));\\n rep(j,0,i)rep(o,0,i){\\n ndp[j][o]+=dp[j][o];\\n ll nl=l[j]-(t[i]-t[j]);\\n ll nr=r[o]+(t[i]-t[o]);\\n if(nr<l[i]||r[i]<nl)continue;\\n ll tx=j,ty=o;\\n if(nl<l[i])tx=i;\\n if(nr>r[i])ty=i;\\n ndp[tx][ty]+=dp[j][o];\\n }\\n dp.swap(ndp);\\n //debug(dp,n+1,n+1);cout<<endl;\\n }\\n modint ret=0;\\n rep(i,0,n+1)rep(j,0,n+1)ret+=dp[i][j];\\n cout<<ret-1<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3700,\n \"score_of_the_acc\": -0.0333,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3181_4879596\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)\\n#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)\\n#define REP(i, n) rep(i, 0, n)\\n#define REP2(i, n) rep2(i, 0, n)\\n#define all(hoge) (hoge).begin(), (hoge).end()\\n#define en '\\\\n'\\nusing ll = long long;\\nusing ull = unsigned long long;\\ntemplate <class T>\\nusing vec = vector<T>;\\ntemplate <class T>\\nusing vvec = vector<vec<T>>;\\ntypedef pair<ll, ll> P;\\nusing tp = tuple<ll, ll, ll>;\\nconstexpr long long INF = 1LL << 60;\\nconstexpr int INF_INT = 1 << 25;\\n//constexpr long long MOD = (ll)1e9 + 7;\\nconstexpr long long MOD = 998244353LL;\\nusing ld = long double;\\nstatic const ld pi = 3.141592653589793L;\\ntypedef vector<ll> Array;\\ntypedef vector<Array> Matrix;\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n//グラフ関連\\nstruct Edge {\\n ll to, cap, rev;\\n Edge(ll _to, ll _cap, ll _rev) {\\n to = _to;\\n cap = _cap;\\n rev = _rev;\\n }\\n};\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {\\n G[from].push_back(Edge(to, cap, (ll)G[to].size()));\\n if(revFlag)\\n G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\\n}\\nvoid solve() {\\n ll n;\\n cin >> n;\\n vec<ll> t(n + 1, 0), l(n + 1, 0), r(n + 1, 0);\\n rep(i, 1, n + 1) {\\n cin >> t[i] >> l[i] >> r[i];\\n }\\n\\n priority_queue<tp, vec<tp>, greater<tp>> que;\\n que.push({0, 0, 0});\\n map<tp, ll> mp;\\n mp[{0, 0, 0}] = 1;\\n ll ans = 0;\\n while(que.size()) {\\n auto [i, pl, pr] = que.top();\\n que.pop();\\n //cout << i << \\\" \\\" << pl << \\\" \\\" << pr << en;\\n ll tmp = mp[{i, pl, pr}];\\n (ans += tmp) %= MOD;\\n rep(j, i + 1, n + 1) {\\n ll d = t[j] - t[i];\\n ll nl = max(pl - d, l[j]);\\n ll nr = min(pr + d, r[j]);\\n //cout << i << \\\" \\\" << j << \\\" \\\" << nl << \\\" \\\" << nr << en;\\n if(nl > nr)\\n continue;\\n if(!mp.count({j, nl, nr}))\\n que.push({j, nl, nr});\\n (mp[{j, nl, nr}] += tmp) %= MOD;\\n }\\n }\\n ans += MOD - 1;\\n ans %= MOD;\\n cout << ans << en;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout.tie(0);\\n /*\\n ll t;\\n cin >> t;\\n while(t--)*/\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 910,\n \"memory_kb\": 14440,\n \"score_of_the_acc\": -1.0498,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3181_4867757\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <chrono>\\n//#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\\n#define Rrep(i,n) Rreps(i,n,0)\\n#define ALL(a) a.begin(), a.end()\\n#define fi first\\n#define se second\\n\\nusing ll = long long;\\nusing vec = vector<ll>;\\nusing mat = vector<vec>;\\n\\nll N,M,H,W,Q,K,A,B;\\nstring S;\\ntypedef pair<ll, ll> P;\\nconst ll INF = (1LL<<58);\\n\\ntemplate <unsigned long long mod > class modint{\\npublic:\\n ll x;\\n constexpr modint(){x = 0;}\\n constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}\\n constexpr void set_raw(ll _x){\\n //_x in [0, mod)\\n x = _x;\\n }\\n constexpr modint operator-(){\\n return x == 0 ? 0 : mod - x;\\n }\\n constexpr modint& operator+=(const modint& a){\\n if((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr modint operator+(const modint& a) const{\\n return modint(*this) += a;\\n }\\n constexpr modint& operator-=(const modint& a){\\n if((x -= a.x) < 0) x += mod;\\n return *this;\\n }\\n constexpr modint operator-(const modint& a) const{\\n return modint(*this) -= a;\\n }\\n constexpr modint& operator*=(const modint& a){\\n (x *= a.x)%=mod;\\n return *this;\\n }\\n constexpr modint operator*(const modint& a) const{\\n return modint(*this) *= a;\\n }\\n constexpr modint pow(unsigned long long pw) const{\\n modint res(1), comp(*this);\\n while(pw){\\n if(pw&1) res *= comp;\\n comp *= comp;\\n pw >>= 1;\\n }\\n return res;\\n }\\n //以下、modが素数のときのみ\\n constexpr modint inv() const{\\n return modint(*this).pow(mod - 2);\\n }\\n constexpr modint& operator/=(const modint &a){\\n (x *= a.inv().x)%=mod;\\n return *this;\\n }\\n constexpr modint operator/(const modint &a) const{\\n return modint(*this) /= a;\\n }\\n};\\n#define mod1 998244353\\nusing mint = modint<mod1>;\\n\\nostream& operator<<(ostream& os, const mint& a){\\n os << a.x;\\n return os;\\n}\\nusing vm = vector<mint>;\\n\\nint main() {\\n cin>>N;\\n vec t(N + 1), l(N + 1), r(N + 1);\\n t[0] = l[0] = r[0] = 0;\\n reps(i, 1, N + 1) cin>>t[i]>>l[i]>>r[i];\\n vector<vm> dp(N + 1, vm(N + 1, 0));\\n dp[0][0] = 1;\\n struct query{ int j, k; mint a; query(int _j, int _k, mint _a) : j(_j), k(_k), a(_a) {}};\\n reps(i, 1, N + 1){\\n queue<query> que;\\n rep(j, i){\\n rep(k, i){\\n if(dp[j][k].x != 0 && r[i] >= l[j] - (t[i] - t[j]) && l[i] <= r[k] + (t[i] - t[k])){\\n que.emplace(l[i] <= l[j] - (t[i] - t[j]) ? j : i, r[k] + (t[i] - t[k]) <= r[i] ? k : i, dp[j][k]);\\n }\\n }\\n }\\n while(!que.empty()){\\n query q = que.front(); que.pop();\\n dp[q.j][q.k] += q.a;\\n }\\n }\\n mint res(0);\\n rep(i, N + 1) res += accumulate(ALL(dp[i]), mint(0));\\n cout<<res - 1<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3856,\n \"score_of_the_acc\": -0.0007,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3181_4849774\",\n \"code_snippet\": \"// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region aliases\\n\\n#define rep(i, n) for(long long i = 0; i < (n); i++)\\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bcnt(n) __builtin_popcountll(n)\\n#define endk endl\\n#define ednl endl\\n#define enld endl\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vb = vector<bool>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing mll = map<long long, long long>;\\nusing pll = pair<long long, long long>;\\nusing qll = queue<long long>;\\nusing sll = set<long long>;\\nusing vpll = vector<pair<long long, long long>>;\\ntemplate <class T = ll>\\nusing V = vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\n//昇順pq(小さい方から取り出す)\\ntemplate <class T = ll>\\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\\n//降順pq(大きい方から取り出す)\\ntemplate <class T = ll>\\nusing pqdn = priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\\nlong long const dekai = 3e16;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\\n\\n// const int mod = 1000000007;\\nconst int mod = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_procedure\\n\\ntemplate <class T>\\ninline bool isin(T x, T lef, T rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { cout << (f ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"; }\\nvoid No() { cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { cout << (f ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"; }\\nvoid NO() { cout << \\\"NO\\\\n\\\"; }\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tcout << answer << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\nvoid err() {\\n\\tcout << -1 << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(vector<T> &v, bool tate = 0) {\\n\\tif(v.size() > 0) {\\n\\t\\tfor(auto it = v.begin(); it < v.end(); it++) {\\n\\t\\t\\tcout << *it;\\n\\t\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\t\\tif(tate)\\n\\t\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tcout << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << endl;\\n}\\n\\ntemplate <class T>\\nvoid add(vector<T> &v, T val) {\\t //ベクトルの各要素に加算\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\n// vectorの中身を数える map<要素,個数>を返す\\ntemplate <class T>\\nmap<T, long long> cntv(vector<T> v) {\\n\\tmap<T, long long> m;\\n\\tfor(auto &g : v) {\\n\\t\\tif(m.count(g))\\n\\t\\t\\tm[g]++;\\n\\t\\telse\\n\\t\\t\\tm[g] = 1;\\n\\t}\\n\\treturn m;\\n}\\n\\n//配列圧縮\\n//{1,36,1,3,8,-2,-92}を\\n//{2, 5,2,3,4, 1, 0}にする\\ntemplate <class T>\\nvector<long long> press(vector<T> &v) {\\n\\tlong long n = v.size();\\n\\tvector<long long> w(n);\\n\\tmap<T, long long> m;\\n\\tfor(T &p : v) m[p] = 0;\\n\\tlong long i = 0;\\n\\tfor(auto &p : m) {\\n\\t\\tp.second = i;\\n\\t\\ti++;\\n\\t}\\n\\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\\n\\treturn w;\\n}\\n\\n// 切り上げ除算\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\tT x = abs(a);\\n\\tT y = abs(b);\\n\\tT z = (x + y - 1) / y;\\n\\tif((a < 0 && b > 0) || (a > 0 && b < 0))\\n\\t\\treturn -z;\\n\\telse if(a == 0)\\n\\t\\treturn 0;\\n\\telse\\n\\t\\treturn z;\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\n// a * x % mod == __gcd(a,mod)なるxを返す\\n// a が modの倍数でないことが条件\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tswap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tswap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\nvvll comb(100, vll(100, -1));\\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\\n\\tassert(n < 100 && k < 100);\\n\\tif(n < k || k < 0 || n < 0) return 0;\\n\\tif(comb[n][k] != -1) return comb[n][k];\\n\\tll res;\\n\\tif(n - k < k)\\n\\t\\tres = com(n, n - k);\\n\\telse if(k == 0)\\n\\t\\tres = 1;\\n\\telse\\n\\t\\tres = com(n - 1, k - 1) + com(n - 1, k);\\n\\tcomb[n][k] = res;\\n\\treturn res;\\n}\\n\\n// nCk modを求める\\nconst int MAX = 5100000;\\n// この値は求める二項計数の値に応じて変える\\n// MAX=3*10^7のとき1900msほど、ほぼ比例\\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\nvoid cominit() {\\n\\t// テーブルを作る前処理\\n\\tfac[0] = fac[1] = 1;\\n\\tfinv[0] = finv[1] = 1;\\n\\tinv[1] = 1;\\n\\tfor(int i = 2; i < MAX; i++) {\\n\\t\\tfac[i] = fac[i - 1] * i % mod;\\n\\t\\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\\n\\t\\tfinv[i] = finv[i - 1] * inv[i] % mod;\\n\\t}\\n}\\nlong long commod(long long n, long long k) { // 二項係数\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\nlong long pmod(long long n, long long k) {\\t// 順列\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * finv[n - k] % mod;\\n}\\n// n個の区別しないボールを区別するk個の箱に入れる方法の総数\\nlong long hmod(long long n, long long k) {\\t// 重複組み合わせ\\n\\treturn commod(n + k - 1, n);\\n}\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tINPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tINPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tcin >> a;\\n}\\ntemplate <class T>\\nvoid scan(vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\ntemplate <class T, class L>\\nvoid scan(pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\ntemplate <class T>\\ninline void print(T x) {\\n\\tcout << x << '\\\\n';\\n}\\n\\ntemplate <typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tcerr << \\\", \\\";\\n\\tview(p.second);\\n\\tcerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tcerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tcerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tcerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tcerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tview(H);\\n\\tcerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tcerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tview(x); \\\\\\n\\t\\tcerr << \\\"\\\\n\\\"; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\n#pragma region modint\\n\\ntemplate <int mod>\\nstruct ModInt {\\n\\tint x;\\n\\tModInt() : x(0) {}\\n\\tModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\tModInt &operator+=(const ModInt &p) {\\n\\t\\tif((x += p.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator-=(const ModInt &p) {\\n\\t\\tif((x += mod - p.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator*=(const ModInt &p) {\\n\\t\\tx = (int)(1LL * x * p.x % mod);\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator/=(const ModInt &p) {\\n\\t\\t*this *= p.inverse();\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt operator-() const { return ModInt(-x); }\\n\\tModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n\\tModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n\\tModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n\\tModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n\\tbool operator==(const ModInt &p) const { return x == p.x; }\\n\\tbool operator!=(const ModInt &p) const { return x != p.x; }\\n\\tModInt inverse() const {\\n\\t\\tint a = x, b = mod, u = 1, v = 0, t;\\n\\t\\twhile(b > 0) {\\n\\t\\t\\tt = a / b;\\n\\t\\t\\tswap(a -= t * b, b);\\n\\t\\t\\tswap(u -= t * v, v);\\n\\t\\t}\\n\\t\\treturn ModInt(u);\\n\\t}\\n\\tModInt pow(long long n) const {\\n\\t\\tModInt ret(1), mul(x);\\n\\t\\twhile(n > 0) {\\n\\t\\t\\tif(n & 1) ret *= mul;\\n\\t\\t\\tmul *= mul;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tfriend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\\n\\tfriend istream &operator>>(istream &is, ModInt &a) {\\n\\t\\tlong long t;\\n\\t\\tis >> t;\\n\\t\\ta = ModInt<mod>(t);\\n\\t\\treturn (is);\\n\\t}\\n\\tstatic int get_mod() { return mod; }\\n};\\nusing mint = ModInt<mod>;\\n\\n#pragma endregion\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\tcout << fixed << setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tINT(n);\\n\\tvector<int> t(n + 1), l(n + 1), r(n + 1);\\n\\trep(i, n) { cin >> t[i + 1] >> l[i + 1] >> r[i + 1]; }\\n\\n\\tvector<vector<mint>> dp(n + 1, vector<mint>(n + 1, 0));\\n\\tdp[0][0] = 1;\\n\\n\\tusing tup = tuple<int, int, mint>;\\n\\tqueue<tup> q;\\n\\n\\trep(i, n) {\\n\\t\\tint now = i + 1;\\n\\t\\trep(j, now) {\\n\\t\\t\\trep(k, now) {\\n\\t\\t\\t\\tif(r[k] + (t[now] - t[k]) < l[now]) continue;\\n\\t\\t\\t\\tif(r[now] < l[j] - (t[now] - t[j])) continue;\\n\\t\\t\\t\\tint a, b;\\n\\t\\t\\t\\ta = j, b = k;\\n\\t\\t\\t\\tif(l[j] - (t[now] - t[j]) < l[now]) {\\n\\t\\t\\t\\t\\ta = now;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(r[k] + (t[now] - t[k]) > r[now]) {\\n\\t\\t\\t\\t\\tb = now;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// debug(a, b, dp[j][k]);\\n\\t\\t\\t\\t//if(l[a] > r[b]) continue;\\n\\t\\t\\t\\tq.push((tup){a, b, dp[j][k]});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile(!q.empty()) {\\n\\t\\t\\tint a, b;\\n\\t\\t\\tmint r;\\n\\t\\t\\ttie(a, b, r) = q.front();\\n\\t\\t\\tq.pop();\\n\\t\\t\\tdp[a][b] += r;\\n\\t\\t}\\n\\t}\\n\\n\\tmint ans = -1;\\n\\trep(i, n + 1) rep(j, n + 1) { ans += dp[i][j]; }\\n\\n\\tdrop(ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5020,\n \"score_of_the_acc\": -0.0394,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3181_4849743\",\n \"code_snippet\": \"// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region aliases\\n\\n#define rep(i, n) for(long long i = 0; i < (n); i++)\\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bcnt(n) __builtin_popcountll(n)\\n#define endk endl\\n#define ednl endl\\n#define enld endl\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vb = vector<bool>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing mll = map<long long, long long>;\\nusing pll = pair<long long, long long>;\\nusing qll = queue<long long>;\\nusing sll = set<long long>;\\nusing vpll = vector<pair<long long, long long>>;\\ntemplate <class T = ll>\\nusing V = vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\n//昇順pq(小さい方から取り出す)\\ntemplate <class T = ll>\\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\\n//降順pq(大きい方から取り出す)\\ntemplate <class T = ll>\\nusing pqdn = priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\\nlong long const dekai = 3e16;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\\n\\n// const int mod = 1000000007;\\nconst int mod = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_procedure\\n\\ntemplate <class T>\\ninline bool isin(T x, T lef, T rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { cout << (f ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"; }\\nvoid No() { cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { cout << (f ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"; }\\nvoid NO() { cout << \\\"NO\\\\n\\\"; }\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tcout << answer << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\nvoid err() {\\n\\tcout << -1 << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(vector<T> &v, bool tate = 0) {\\n\\tif(v.size() > 0) {\\n\\t\\tfor(auto it = v.begin(); it < v.end(); it++) {\\n\\t\\t\\tcout << *it;\\n\\t\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\t\\tif(tate)\\n\\t\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tcout << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << endl;\\n}\\n\\ntemplate <class T>\\nvoid add(vector<T> &v, T val) {\\t //ベクトルの各要素に加算\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\n// vectorの中身を数える map<要素,個数>を返す\\ntemplate <class T>\\nmap<T, long long> cntv(vector<T> v) {\\n\\tmap<T, long long> m;\\n\\tfor(auto &g : v) {\\n\\t\\tif(m.count(g))\\n\\t\\t\\tm[g]++;\\n\\t\\telse\\n\\t\\t\\tm[g] = 1;\\n\\t}\\n\\treturn m;\\n}\\n\\n//配列圧縮\\n//{1,36,1,3,8,-2,-92}を\\n//{2, 5,2,3,4, 1, 0}にする\\ntemplate <class T>\\nvector<long long> press(vector<T> &v) {\\n\\tlong long n = v.size();\\n\\tvector<long long> w(n);\\n\\tmap<T, long long> m;\\n\\tfor(T &p : v) m[p] = 0;\\n\\tlong long i = 0;\\n\\tfor(auto &p : m) {\\n\\t\\tp.second = i;\\n\\t\\ti++;\\n\\t}\\n\\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\\n\\treturn w;\\n}\\n\\n// 切り上げ除算\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\tT x = abs(a);\\n\\tT y = abs(b);\\n\\tT z = (x + y - 1) / y;\\n\\tif((a < 0 && b > 0) || (a > 0 && b < 0))\\n\\t\\treturn -z;\\n\\telse if(a == 0)\\n\\t\\treturn 0;\\n\\telse\\n\\t\\treturn z;\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\n// a * x % mod == __gcd(a,mod)なるxを返す\\n// a が modの倍数でないことが条件\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tswap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tswap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\nvvll comb(100, vll(100, -1));\\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\\n\\tassert(n < 100 && k < 100);\\n\\tif(n < k || k < 0 || n < 0) return 0;\\n\\tif(comb[n][k] != -1) return comb[n][k];\\n\\tll res;\\n\\tif(n - k < k)\\n\\t\\tres = com(n, n - k);\\n\\telse if(k == 0)\\n\\t\\tres = 1;\\n\\telse\\n\\t\\tres = com(n - 1, k - 1) + com(n - 1, k);\\n\\tcomb[n][k] = res;\\n\\treturn res;\\n}\\n\\n// nCk modを求める\\nconst int MAX = 5100000;\\n// この値は求める二項計数の値に応じて変える\\n// MAX=3*10^7のとき1900msほど、ほぼ比例\\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\nvoid cominit() {\\n\\t// テーブルを作る前処理\\n\\tfac[0] = fac[1] = 1;\\n\\tfinv[0] = finv[1] = 1;\\n\\tinv[1] = 1;\\n\\tfor(int i = 2; i < MAX; i++) {\\n\\t\\tfac[i] = fac[i - 1] * i % mod;\\n\\t\\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\\n\\t\\tfinv[i] = finv[i - 1] * inv[i] % mod;\\n\\t}\\n}\\nlong long commod(long long n, long long k) { // 二項係数\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\nlong long pmod(long long n, long long k) {\\t// 順列\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * finv[n - k] % mod;\\n}\\n// n個の区別しないボールを区別するk個の箱に入れる方法の総数\\nlong long hmod(long long n, long long k) {\\t// 重複組み合わせ\\n\\treturn commod(n + k - 1, n);\\n}\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tINPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tINPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tcin >> a;\\n}\\ntemplate <class T>\\nvoid scan(vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\ntemplate <class T, class L>\\nvoid scan(pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\ntemplate <class T>\\ninline void print(T x) {\\n\\tcout << x << '\\\\n';\\n}\\n\\ntemplate <typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tcerr << \\\", \\\";\\n\\tview(p.second);\\n\\tcerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tcerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tcerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tcerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tcerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tview(H);\\n\\tcerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tcerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tview(x); \\\\\\n\\t\\tcerr << \\\"\\\\n\\\"; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\n#pragma region modint\\n\\ntemplate <int mod>\\nstruct ModInt {\\n\\tint x;\\n\\tModInt() : x(0) {}\\n\\tModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\tModInt &operator+=(const ModInt &p) {\\n\\t\\tif((x += p.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator-=(const ModInt &p) {\\n\\t\\tif((x += mod - p.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator*=(const ModInt &p) {\\n\\t\\tx = (int)(1LL * x * p.x % mod);\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator/=(const ModInt &p) {\\n\\t\\t*this *= p.inverse();\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt operator-() const { return ModInt(-x); }\\n\\tModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n\\tModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n\\tModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n\\tModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n\\tbool operator==(const ModInt &p) const { return x == p.x; }\\n\\tbool operator!=(const ModInt &p) const { return x != p.x; }\\n\\tModInt inverse() const {\\n\\t\\tint a = x, b = mod, u = 1, v = 0, t;\\n\\t\\twhile(b > 0) {\\n\\t\\t\\tt = a / b;\\n\\t\\t\\tswap(a -= t * b, b);\\n\\t\\t\\tswap(u -= t * v, v);\\n\\t\\t}\\n\\t\\treturn ModInt(u);\\n\\t}\\n\\tModInt pow(long long n) const {\\n\\t\\tModInt ret(1), mul(x);\\n\\t\\twhile(n > 0) {\\n\\t\\t\\tif(n & 1) ret *= mul;\\n\\t\\t\\tmul *= mul;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tfriend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\\n\\tfriend istream &operator>>(istream &is, ModInt &a) {\\n\\t\\tlong long t;\\n\\t\\tis >> t;\\n\\t\\ta = ModInt<mod>(t);\\n\\t\\treturn (is);\\n\\t}\\n\\tstatic int get_mod() { return mod; }\\n};\\nusing mint = ModInt<mod>;\\n\\n#pragma endregion\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\tcout << fixed << setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tINT(n);\\n\\tvector<int> t(n + 1), l(n + 1), r(n + 1);\\n\\trep(i, n) { cin >> t[i + 1] >> l[i + 1] >> r[i + 1]; }\\n\\n\\tvector<vector<mint>> dp(n + 1, vector<mint>(n + 1, 0));\\n\\tdp[0][0] = 1;\\n\\n\\tusing tup = tuple<int, int, mint>;\\n\\tqueue<tup> q;\\n\\n\\trep(i, n) {\\n\\t\\tint now = i + 1;\\n\\t\\trep(j, now) {\\n\\t\\t\\trep(k, now) {\\n\\t\\t\\t\\tif(r[k] + (t[now] - t[k]) < l[now]) continue;\\n\\t\\t\\t\\tif(r[now] < l[j] - (t[now] - t[j])) continue;\\n\\t\\t\\t\\tint a, b;\\n\\t\\t\\t\\ta = j, b = k;\\n\\t\\t\\t\\tif(l[j] - (t[now] - t[j]) < l[now]) {\\n\\t\\t\\t\\t\\ta = now;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(r[k] + (t[now] - t[k]) > r[now]) {\\n\\t\\t\\t\\t\\tb = now;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// debug(a, b, dp[j][k]);\\n\\t\\t\\t\\t// if(l[a] > r[b]) continue;\\n\\t\\t\\t\\tq.push((tup){a, b, dp[j][k]});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile(!q.empty()) {\\n\\t\\t\\tint a, b;\\n\\t\\t\\tmint r;\\n\\t\\t\\ttie(a, b, r) = q.front();\\n\\t\\t\\tq.pop();\\n\\t\\t\\tdp[a][b] += r;\\n\\t\\t}\\n\\t\\t// dump(dp);\\n\\t}\\n\\n\\tmint ans = -1;\\n\\trep(i, n + 1) rep(j, n + 1) { ans += dp[i][j]; }\\n\\n\\tdrop(ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5016,\n \"score_of_the_acc\": -0.0394,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3181_4849732\",\n \"code_snippet\": \"// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region aliases\\n\\n#define rep(i, n) for(long long i = 0; i < (n); i++)\\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bcnt(n) __builtin_popcountll(n)\\n#define endk endl\\n#define ednl endl\\n#define enld endl\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vb = vector<bool>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing mll = map<long long, long long>;\\nusing pll = pair<long long, long long>;\\nusing qll = queue<long long>;\\nusing sll = set<long long>;\\nusing vpll = vector<pair<long long, long long>>;\\ntemplate <class T = ll>\\nusing V = vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\n//昇順pq(小さい方から取り出す)\\ntemplate <class T = ll>\\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\\n//降順pq(大きい方から取り出す)\\ntemplate <class T = ll>\\nusing pqdn = priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\\nlong long const dekai = 3e16;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\\n\\n// const int mod = 1000000007;\\nconst int mod = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_procedure\\n\\ntemplate <class T>\\ninline bool isin(T x, T lef, T rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { cout << (f ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"; }\\nvoid No() { cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { cout << (f ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"; }\\nvoid NO() { cout << \\\"NO\\\\n\\\"; }\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tcout << answer << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\nvoid err() {\\n\\tcout << -1 << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(vector<T> &v, bool tate = 0) {\\n\\tif(v.size() > 0) {\\n\\t\\tfor(auto it = v.begin(); it < v.end(); it++) {\\n\\t\\t\\tcout << *it;\\n\\t\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\t\\tif(tate)\\n\\t\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tcout << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << endl;\\n}\\n\\ntemplate <class T>\\nvoid add(vector<T> &v, T val) {\\t //ベクトルの各要素に加算\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\n// vectorの中身を数える map<要素,個数>を返す\\ntemplate <class T>\\nmap<T, long long> cntv(vector<T> v) {\\n\\tmap<T, long long> m;\\n\\tfor(auto &g : v) {\\n\\t\\tif(m.count(g))\\n\\t\\t\\tm[g]++;\\n\\t\\telse\\n\\t\\t\\tm[g] = 1;\\n\\t}\\n\\treturn m;\\n}\\n\\n//配列圧縮\\n//{1,36,1,3,8,-2,-92}を\\n//{2, 5,2,3,4, 1, 0}にする\\ntemplate <class T>\\nvector<long long> press(vector<T> &v) {\\n\\tlong long n = v.size();\\n\\tvector<long long> w(n);\\n\\tmap<T, long long> m;\\n\\tfor(T &p : v) m[p] = 0;\\n\\tlong long i = 0;\\n\\tfor(auto &p : m) {\\n\\t\\tp.second = i;\\n\\t\\ti++;\\n\\t}\\n\\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\\n\\treturn w;\\n}\\n\\n// 切り上げ除算\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\tT x = abs(a);\\n\\tT y = abs(b);\\n\\tT z = (x + y - 1) / y;\\n\\tif((a < 0 && b > 0) || (a > 0 && b < 0))\\n\\t\\treturn -z;\\n\\telse if(a == 0)\\n\\t\\treturn 0;\\n\\telse\\n\\t\\treturn z;\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\n// a * x % mod == __gcd(a,mod)なるxを返す\\n// a が modの倍数でないことが条件\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tswap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tswap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\nvvll comb(100, vll(100, -1));\\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\\n\\tassert(n < 100 && k < 100);\\n\\tif(n < k || k < 0 || n < 0) return 0;\\n\\tif(comb[n][k] != -1) return comb[n][k];\\n\\tll res;\\n\\tif(n - k < k)\\n\\t\\tres = com(n, n - k);\\n\\telse if(k == 0)\\n\\t\\tres = 1;\\n\\telse\\n\\t\\tres = com(n - 1, k - 1) + com(n - 1, k);\\n\\tcomb[n][k] = res;\\n\\treturn res;\\n}\\n\\n// nCk modを求める\\nconst int MAX = 5100000;\\n// この値は求める二項計数の値に応じて変える\\n// MAX=3*10^7のとき1900msほど、ほぼ比例\\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\nvoid cominit() {\\n\\t// テーブルを作る前処理\\n\\tfac[0] = fac[1] = 1;\\n\\tfinv[0] = finv[1] = 1;\\n\\tinv[1] = 1;\\n\\tfor(int i = 2; i < MAX; i++) {\\n\\t\\tfac[i] = fac[i - 1] * i % mod;\\n\\t\\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\\n\\t\\tfinv[i] = finv[i - 1] * inv[i] % mod;\\n\\t}\\n}\\nlong long commod(long long n, long long k) { // 二項係数\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\nlong long pmod(long long n, long long k) {\\t// 順列\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * finv[n - k] % mod;\\n}\\n// n個の区別しないボールを区別するk個の箱に入れる方法の総数\\nlong long hmod(long long n, long long k) {\\t// 重複組み合わせ\\n\\treturn commod(n + k - 1, n);\\n}\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tINPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tINPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tcin >> a;\\n}\\ntemplate <class T>\\nvoid scan(vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\ntemplate <class T, class L>\\nvoid scan(pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\ntemplate <class T>\\ninline void print(T x) {\\n\\tcout << x << '\\\\n';\\n}\\n\\ntemplate <typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tcerr << \\\", \\\";\\n\\tview(p.second);\\n\\tcerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tcerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tcerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tcerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tcerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tview(H);\\n\\tcerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tcerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tview(x); \\\\\\n\\t\\tcerr << \\\"\\\\n\\\"; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\n#pragma region modint\\n\\ntemplate <int mod>\\nstruct ModInt {\\n\\tint x;\\n\\tModInt() : x(0) {}\\n\\tModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\tModInt &operator+=(const ModInt &p) {\\n\\t\\tif((x += p.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator-=(const ModInt &p) {\\n\\t\\tif((x += mod - p.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator*=(const ModInt &p) {\\n\\t\\tx = (int)(1LL * x * p.x % mod);\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator/=(const ModInt &p) {\\n\\t\\t*this *= p.inverse();\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt operator-() const { return ModInt(-x); }\\n\\tModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n\\tModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n\\tModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n\\tModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n\\tbool operator==(const ModInt &p) const { return x == p.x; }\\n\\tbool operator!=(const ModInt &p) const { return x != p.x; }\\n\\tModInt inverse() const {\\n\\t\\tint a = x, b = mod, u = 1, v = 0, t;\\n\\t\\twhile(b > 0) {\\n\\t\\t\\tt = a / b;\\n\\t\\t\\tswap(a -= t * b, b);\\n\\t\\t\\tswap(u -= t * v, v);\\n\\t\\t}\\n\\t\\treturn ModInt(u);\\n\\t}\\n\\tModInt pow(long long n) const {\\n\\t\\tModInt ret(1), mul(x);\\n\\t\\twhile(n > 0) {\\n\\t\\t\\tif(n & 1) ret *= mul;\\n\\t\\t\\tmul *= mul;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tfriend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\\n\\tfriend istream &operator>>(istream &is, ModInt &a) {\\n\\t\\tlong long t;\\n\\t\\tis >> t;\\n\\t\\ta = ModInt<mod>(t);\\n\\t\\treturn (is);\\n\\t}\\n\\tstatic int get_mod() { return mod; }\\n};\\nusing mint = ModInt<mod>;\\n\\n#pragma endregion\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\tcout << fixed << setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tINT(n);\\n\\tvector<int> t(n + 1), l(n + 1), r(n + 1);\\n\\trep(i, n) { cin >> t[i + 1] >> l[i + 1] >> r[i + 1]; }\\n\\n\\tvector<vector<mint>> dp(n + 1, vector<mint>(n + 1, 0));\\n\\tdp[0][0] = 1;\\n\\n\\tusing tup = tuple<int, int, mint>;\\n\\tqueue<tup> q;\\n\\n\\trep(i, n) {\\n\\t\\tint now = i + 1;\\n\\t\\trep(j, n + 1) {\\n\\t\\t\\tif(j >= now) break;\\n\\t\\t\\trep(k, n + 1) {\\n\\t\\t\\t\\tif(k >= now) break;\\n\\t\\t\\t\\tif(r[k] + (t[now] - t[k]) < l[now]) continue;\\n\\t\\t\\t\\tif(r[now] < l[j] - (t[now] - t[j])) continue;\\n\\t\\t\\t\\tint a, b;\\n\\t\\t\\t\\ta = j, b = k;\\n\\t\\t\\t\\tif(l[j] - (t[now] - t[j]) < l[now]) {\\n\\t\\t\\t\\t\\ta = now;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(r[j] + (t[now] - t[j]) > r[now]) {\\n\\t\\t\\t\\t\\tb = now;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tdebug(a, b, dp[j][k]);\\n\\t\\t\\t\\t// if(l[a] > r[b]) continue;\\n\\t\\t\\t\\tq.push((tup){a, b, dp[j][k]});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile(!q.empty()) {\\n\\t\\t\\tint a, b;\\n\\t\\t\\tmint r;\\n\\t\\t\\ttie(a, b, r) = q.front();\\n\\t\\t\\tq.pop();\\n\\t\\t\\tdp[a][b] += r;\\n\\t\\t}\\n\\t\\tdump(dp);\\n\\t}\\n\\n\\tmint ans = -1;\\n\\trep(i, n + 1) rep(j, n + 1) { ans += dp[i][j]; }\\n\\n\\tdrop(ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.02564102564102564,\n \"time_ms\": 40,\n \"memory_kb\": 4940,\n \"score_of_the_acc\": -0.0391,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3181_4849563\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nstruct dat {\\n long long t, l, r;\\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\\n bool operator==(const dat &d) const {\\n return t == d.t && l == d.l && r == d.r;\\n }\\n bool operator<(const dat &d) const {\\n if (t != d.t) return t < d.t;\\n if (l != d.l) return l < d.l;\\n return r < d.r;\\n }\\n dat operator*(const dat &d) const {\\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\\n if (res.l > res.r) res = dat(-1, 0, 0);\\n return res;\\n }\\n};\\n\\nint n;\\nvector<dat> v;\\nmap<dat, ModInt<>> dp;\\n\\nModInt<> solve();\\n\\nint main() {\\n cin >> n;\\n v.resize(n);\\n for (auto &p : v) cin >> p.t >> p.l >> p.r;\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n dp[dat()] = 1;\\n for (int i = 0; i < n; ++i) {\\n vector<dat> memod;\\n vector<ModInt<>> memoc;\\n for (auto [d, c] : dp) {\\n dat now = d * v[i];\\n if (now.t >= 0) {\\n memod.push_back(now);\\n memoc.push_back(c);\\n }\\n }\\n int len = memod.size();\\n for (int j = 0; j < len; ++j) dp[memod[j]] += memoc[j];\\n }\\n ModInt<> res = -1;\\n for (auto [d, c] : dp) res += c;\\n\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 19508,\n \"score_of_the_acc\": -0.4732,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3181_4849561\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nstruct dat {\\n long long t, l, r;\\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\\n bool operator==(const dat &d) const {\\n return t == d.t && l == d.l && r == d.r;\\n }\\n bool operator<(const dat &d) const {\\n if (t != d.t) return t < d.t;\\n if (l != d.l) return l < d.l;\\n return r < d.r;\\n }\\n dat operator*(const dat &d) const {\\n assert(0 <= t && t < d.t && l <= r && d.l <= d.r);\\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\\n if (res.l > res.r) res = dat(-1, 0, 0);\\n return res;\\n }\\n};\\n\\nint n;\\nvector<dat> v;\\nmap<dat, ModInt<>> dp;\\n\\nModInt<> solve();\\n\\nint main() {\\n cin >> n;\\n v.resize(n);\\n for (auto &p : v) cin >> p.t >> p.l >> p.r;\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n dp[dat()] = 1;\\n for (int i = 0; i < n; ++i) {\\n vector<dat> memod;\\n vector<ModInt<>> memoc;\\n for (auto [d, c] : dp) {\\n dat now = d * v[i];\\n if (now.t >= 0) {\\n memod.push_back(now);\\n memoc.push_back(c);\\n }\\n }\\n int len = memod.size();\\n for (int j = 0; j < len; ++j) {\\n if (!dp.count(memod[j]))\\n dp[memod[j]] = memoc[j];\\n else\\n dp[memod[j]] += memoc[j];\\n }\\n }\\n ModInt<> res = -1;\\n for (auto [d, c] : dp) {\\n assert(d.t >= 0);\\n res += c;\\n }\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 19508,\n \"score_of_the_acc\": -0.7399,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3181_4849554\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nstruct dat {\\n long long t, l, r;\\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\\n bool operator==(const dat &d) const {\\n return t == d.t && l == d.l && r == d.r;\\n }\\n bool operator<(const dat &d) const {\\n if (t != d.t) return t < d.t;\\n if (l != d.r) return l < d.l;\\n return r < d.r;\\n }\\n dat operator*(const dat &d) const {\\n assert(0 <= t && t < d.t && l <= r && d.l <= d.r);\\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\\n if (res.l > res.r) res = dat(-1, 0, 0);\\n return res;\\n }\\n};\\n\\nint n;\\nvector<dat> v;\\nmap<dat, ModInt<>> dp;\\n\\nModInt<> solve();\\n\\nint main() {\\n cin >> n;\\n v.resize(n);\\n for (auto &p : v) cin >> p.t >> p.l >> p.r;\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n dp[dat()] = 1;\\n for (int i = 0; i < n; ++i) {\\n vector<dat> memod;\\n vector<ModInt<>> memoc;\\n for (auto [d, c] : dp) {\\n dat now = d * v[i];\\n if (now.t >= 0) {\\n memod.push_back(now);\\n memoc.push_back(c);\\n }\\n }\\n int len = memod.size();\\n for (int j = 0; j < len; ++j) {\\n if (!dp.count(memod[j]))\\n dp[memod[j]] = memoc[j];\\n else\\n dp[memod[j]] += memoc[j];\\n }\\n }\\n ModInt<> res = -1;\\n for (auto [d, c] : dp) {\\n assert(d.t >= 0);\\n res += c;\\n }\\n return res;\\n}\",\n \"accuracy\": 0.02564102564102564,\n \"time_ms\": 20,\n \"memory_kb\": 3880,\n \"score_of_the_acc\": -0.0119,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3181_4849549\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nstruct dat {\\n long long t, l, r;\\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\\n bool operator==(const dat &d) const {\\n return t == d.t && l == d.l && r == d.r;\\n }\\n bool operator<(const dat &d) const {\\n if (t != d.t) return t < d.t;\\n if (l != d.r) return l < d.l;\\n return r < d.r;\\n }\\n dat operator*(const dat &d) const {\\n assert(0 <= t && t < d.t && l <= r && d.l <= d.r);\\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\\n if (res.l > res.r) res = dat(-1, 0, 0);\\n return res;\\n }\\n};\\n\\nint n;\\nvector<dat> v;\\nmap<dat, ModInt<>> dp;\\n\\nModInt<> solve();\\n\\nint main() {\\n cin >> n;\\n v.resize(n);\\n for (int i = 0; i < n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n dp[dat()] = 1;\\n for (int i = 0; i < n; ++i) {\\n vector<dat> memod;\\n vector<ModInt<>> memoc;\\n for (auto [d, c] : dp) {\\n dat now = d * v[i];\\n if (now.t >= 0) {\\n memod.push_back(now);\\n memoc.push_back(c);\\n }\\n }\\n int len = memod.size();\\n for (int j = 0; j < len; ++j) dp[memod[j]] += memoc[j];\\n }\\n ModInt<> res = -1;\\n for (auto [d, c] : dp) {\\n assert(d.t >= 0);\\n res += c;\\n }\\n return res;\\n}\",\n \"accuracy\": 0.02564102564102564,\n \"time_ms\": 10,\n \"memory_kb\": 3960,\n \"score_of_the_acc\": -0.0012,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3181_4849540\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nstruct dat {\\n long long t, l, r;\\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\\n bool operator==(const dat &d) const {\\n return t == d.t && l == d.l && r == d.r;\\n }\\n bool operator<(const dat &d) const {\\n if (t != d.t) return t < d.t;\\n if (l != d.r) return l < d.l;\\n return r < d.r;\\n }\\n dat operator*(const dat &d) const {\\n if (t < 0) return dat(-1, 0, 0);\\n assert(t < d.t && l <= r && d.l <= d.r);\\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\\n if (res.l > res.r) res = dat(-1, 0, 0);\\n return res;\\n }\\n};\\n\\nint n;\\nvector<dat> v;\\nmap<dat, ModInt<>> dp;\\n\\nModInt<> solve();\\n\\nint main() {\\n cin >> n;\\n v.resize(n);\\n for (int i = 0; i < n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n dp[dat()] = 1;\\n for (int i = 0; i < n; ++i) {\\n vector<dat> memod;\\n vector<ModInt<>> memoc;\\n for (auto [d, c] : dp) {\\n dat now = d * v[i];\\n if (now.t >= 0) {\\n memod.push_back(now);\\n memoc.push_back(c);\\n }\\n }\\n int len = memod.size();\\n for (int j = 0; j < len; ++j) dp[memod[j]] += memoc[j];\\n }\\n ModInt<> res = -1;\\n for (auto [d, c] : dp) {\\n assert(d.t >= 0);\\n res += c;\\n }\\n return res;\\n}\",\n \"accuracy\": 0.02564102564102564,\n \"time_ms\": 10,\n \"memory_kb\": 4004,\n \"score_of_the_acc\": -0.0014,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3181_4849519\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n\\ntemplate <int MOD>\\nstruct ModInt {\\n using lint = long long;\\n int val;\\n\\n // constructor\\n ModInt(lint v = 0) : val(v % MOD) {\\n if (val < 0) val += MOD;\\n };\\n\\n // unary operator\\n ModInt operator+() const { return ModInt(val); }\\n ModInt operator-() const { return ModInt(MOD - val); }\\n ModInt inv() const { return this->pow(MOD - 2); }\\n\\n // arithmetic\\n ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }\\n ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }\\n ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }\\n ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }\\n ModInt pow(lint n) const {\\n auto x = ModInt(1);\\n auto b = *this;\\n while (n > 0) {\\n if (n & 1) x *= b;\\n n >>= 1;\\n b *= b;\\n }\\n return x;\\n }\\n\\n // compound assignment\\n ModInt& operator+=(const ModInt& x) {\\n if ((val += x.val) >= MOD) val -= MOD;\\n return *this;\\n }\\n ModInt& operator-=(const ModInt& x) {\\n if ((val -= x.val) < 0) val += MOD;\\n return *this;\\n }\\n ModInt& operator*=(const ModInt& x) {\\n val = lint(val) * x.val % MOD;\\n return *this;\\n }\\n ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }\\n\\n // compare\\n bool operator==(const ModInt& b) const { return val == b.val; }\\n bool operator!=(const ModInt& b) const { return val != b.val; }\\n bool operator<(const ModInt& b) const { return val < b.val; }\\n bool operator<=(const ModInt& b) const { return val <= b.val; }\\n bool operator>(const ModInt& b) const { return val > b.val; }\\n bool operator>=(const ModInt& b) const { return val >= b.val; }\\n\\n // I/O\\n friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept {\\n lint v;\\n is >> v;\\n x = v;\\n return is;\\n }\\n friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }\\n};\\n\\nconstexpr int MOD = 998244353;\\nusing mint = ModInt<MOD>;\\n\\nvoid solve() {\\n int n;\\n std::cin >> n;\\n\\n // [L, R]に自由に移動できるときの通り数\\n std::map<std::pair<int, int>, mint> dp;\\n dp[std::make_pair(0, 0)] = 1;\\n\\n int pt = 0; // 前の命令の時刻\\n while (n--) {\\n int t, l, r;\\n std::cin >> t >> l >> r;\\n\\n std::map<std::pair<int, int>, mint> ndp;\\n for (auto [p, v] : dp) {\\n auto [pl, pr] = p;\\n\\n // 左右に引き伸ばす\\n pl -= t - pt;\\n pr += t - pt;\\n\\n {\\n // 守らない場合\\n auto q = std::make_pair(pl, pr);\\n if (!ndp.count(q)) ndp[q] = 0;\\n ndp[q] += v;\\n }\\n\\n // 守る場合\\n pl = std::max(pl, l);\\n pr = std::min(pr, r);\\n if (pr < pl) continue;\\n\\n {\\n auto q = std::make_pair(pl, pr);\\n if (!ndp.count(q)) ndp[q] = 0;\\n ndp[q] += v;\\n }\\n }\\n\\n std::swap(dp, ndp);\\n pt = t;\\n }\\n\\n mint ans = 0;\\n for (auto [p, v] : dp) ans += v;\\n std::cout << ans - 1 << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 4416,\n \"score_of_the_acc\": -0.1255,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3181_4849514\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nstruct dat {\\n long long t, l, r;\\n dat(long long x = 0, long long y = 0, long long z = 0) : t(x), l(y), r(z) {}\\n bool operator==(const dat &d) const {\\n return t == d.t && l == d.l && r == d.r;\\n }\\n bool operator<(const dat &d) const {\\n if (t != d.t) return t < d.t;\\n if (l != d.r) return l < d.l;\\n return r < d.r;\\n }\\n dat operator*(const dat &d) const {\\n if (t < 0) return dat(-1, 0, 0);\\n assert(t < d.t);\\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\\n if (res.l > res.r) res = dat(-1, 0, 0);\\n return res;\\n }\\n};\\n\\nint n;\\nvector<dat> v;\\nmap<dat, ModInt<>> dp;\\n\\nModInt<> solve();\\n\\nint main() {\\n cin >> n;\\n v.resize(n);\\n for (int i = 0; i < n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n dp[dat()] = 1;\\n for (int i = 0; i < n; ++i) {\\n vector<dat> memod;\\n vector<ModInt<>> memoc;\\n for (auto [d, c] : dp) {\\n dat now = d * v[i];\\n if (now.t >= 0) {\\n memod.push_back(now);\\n memoc.push_back(c);\\n }\\n }\\n int len = memod.size();\\n for (int j = 0; j < len; ++j) dp[memod[j]] += memoc[j];\\n }\\n ModInt<> res = -1;\\n for (auto [d, c] : dp) res += c;\\n return res;\\n}\",\n \"accuracy\": 0.02564102564102564,\n \"time_ms\": 10,\n \"memory_kb\": 3880,\n \"score_of_the_acc\": -0.0008,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3181_4849500\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nstruct dat {\\n int t, l, r;\\n dat(int x = 0, int y = 0, int z = 0) : t(x), l(y), r(z) {}\\n bool operator==(const dat &d) const {\\n return t == d.t && l == d.l && r == d.r;\\n }\\n bool operator<(const dat &d) const {\\n if (t != d.t) return t < d.t;\\n if (l != d.r) return l < d.l;\\n return r < d.r;\\n }\\n dat operator*(const dat &d) const {\\n if (t < 0) return dat(-1, 0, 0);\\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\\n if (res.l > res.r || res.r < d.l || d.r < res.l) res = dat(-1, 0, 0);\\n return res;\\n }\\n};\\n\\nint n;\\nvector<dat> v;\\nmap<dat, ModInt<>> dp;\\n\\nModInt<> solve();\\n\\nint main() {\\n cin >> n;\\n v.resize(n);\\n for (int i = 0; i < n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n dp[dat()] = 1;\\n for (int i = 0; i < n; ++i) {\\n vector<dat> memod;\\n vector<ModInt<>> memoc;\\n for (auto [d, c] : dp) {\\n dat now = d * v[i];\\n if (now.t >= 0) {\\n memod.push_back(now);\\n memoc.push_back(c);\\n }\\n }\\n int len = memod.size();\\n for (int j = 0; j < len; ++j) dp[memod[j]] += memoc[j];\\n }\\n ModInt<> res = -1;\\n for (auto [d, c] : dp) res += c;\\n return res;\\n}\",\n \"accuracy\": 0.02564102564102564,\n \"time_ms\": 10,\n \"memory_kb\": 3964,\n \"score_of_the_acc\": -0.0012,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3181_4849414\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nstruct dat {\\n int t, l, r;\\n dat(int x = 0, int y = 0, int z = 0) : t(x), l(y), r(z) {}\\n bool operator==(const dat &d) const {\\n return t == d.t && l == d.l && r == d.r;\\n }\\n dat operator*(const dat &d) const {\\n if (t < 0) return dat(-1, 0, 0);\\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\\n if (res.l > res.r || res.r < d.l || d.r < res.l) res = dat(-1, 0, 0);\\n return res;\\n }\\n};\\n\\nint n;\\nvector<dat> v;\\nvector<vector<dat>> memo;\\nvector<vector<ModInt<>>> dp;\\n\\nModInt<> solve();\\n\\nint main() {\\n cin >> n;\\n v.resize(n + 1);\\n for (int i = 1; i <= n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n { // pre calc\\n memo.resize(n + 1, vector<dat>(n + 1));\\n for (int i = 0; i <= n; ++i)\\n for (int j = i; j <= n; ++j) memo[i][j] = v[i] * v[j];\\n }\\n dp.assign(n + 1, vector<ModInt<>>(n + 1, 0));\\n dp[0][0] = 1;\\n for (int i = 1; i <= n; ++i) {\\n for (int j = 0; j < i; ++j)\\n for (int k = j; k < i; ++k)\\n if (memo[j][k].t >= 0) {\\n dat now = memo[j][k] * v[i];\\n if (now.t < 0) continue;\\n if (now == v[i])\\n dp[i][i] += dp[j][k];\\n else if (now == memo[j][i])\\n dp[j][i] += dp[j][k];\\n else if (now == memo[k][i])\\n dp[k][i] += dp[j][k];\\n else\\n assert(0);\\n }\\n }\\n ModInt<> res = -1;\\n for (int i = 0; i <= n; ++i)\\n for (int j = i; j <= n; ++j) res += dp[i][j];\\n return res;\\n}\",\n \"accuracy\": 0.02564102564102564,\n \"time_ms\": 10,\n \"memory_kb\": 4768,\n \"score_of_the_acc\": -0.0049,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3181_4849410\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nstruct dat {\\n int t, l, r;\\n dat(int x = 0, int y = 0, int z = 0) : t(x), l(y), r(z) {}\\n bool operator==(const dat &d) const {\\n return t == d.t && l == d.l && r == d.r;\\n }\\n dat operator*(const dat &d) const {\\n if (t < 0) return dat(-1, 0, 0);\\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\\n if (res.l > res.r || res.r < d.l || d.r < res.l) res = dat(-1, 0, 0);\\n return res;\\n }\\n};\\n\\nint n;\\nvector<dat> v;\\nvector<vector<dat>> memo;\\nvector<vector<ModInt<>>> dp;\\n\\nModInt<> solve();\\n\\nint main() {\\n cin >> n;\\n v.resize(n + 1);\\n for (int i = 1; i <= n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n { // pre calc\\n memo.resize(n + 1, vector<dat>(n + 1));\\n for (int i = 0; i <= n; ++i)\\n for (int j = i; j <= n; ++j) memo[i][j] = v[i] * v[j];\\n }\\n dp.assign(n + 1, vector<ModInt<>>(n + 1, 0));\\n dp[0][0] = 1;\\n for (int i = 1; i <= n; ++i) {\\n for (int j = 0; j < i; ++j)\\n for (int k = j; k < i; ++k)\\n if (memo[j][k].t >= 0) {\\n dat now = memo[j][k] * v[i];\\n if (now.t < 0) continue;\\n if (now == v[i])\\n dp[i][i] += dp[j][k];\\n else if (now == memo[j][i])\\n dp[j][i] += dp[j][k];\\n else\\n dp[k][i] += dp[j][k];\\n }\\n }\\n ModInt<> res = -1;\\n for (int i = 0; i <= n; ++i)\\n for (int j = i; j <= n; ++j) res += dp[i][j];\\n return res;\\n}\",\n \"accuracy\": 0.02564102564102564,\n \"time_ms\": 20,\n \"memory_kb\": 4884,\n \"score_of_the_acc\": -0.0166,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3181_4849384\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\n\\nstruct dat {\\n int t, l, r;\\n dat(int x = 0, int y = 0, int z = 0) : t(x), l(y), r(z) {}\\n bool operator==(const dat &d) const {\\n return t == d.t && l == d.l && r == d.r;\\n }\\n dat operator*(const dat &d) const {\\n if (t < 0) return dat(-1, 0, 0);\\n dat res(d.t, max(d.l, l - (d.t - t)), min(d.r, r + (d.t - t)));\\n if (res.l > res.r || res.r < d.l || d.r < res.l) res = dat(-1, 0, 0);\\n return res;\\n }\\n};\\n\\nint n;\\nvector<dat> v;\\nvector<vector<dat>> memo;\\nvector<vector<vector<ModInt<>>>> dp;\\n\\nModInt<> solve();\\n\\nint main() {\\n cin >> n;\\n v.resize(n + 1);\\n for (int i = 1; i <= n; ++i) cin >> v[i].t >> v[i].l >> v[i].r;\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nModInt<> solve() {\\n { // pre calc\\n memo.resize(n + 1, vector<dat>(n + 1));\\n for (int i = 0; i <= n; ++i)\\n for (int j = i; j <= n; ++j) memo[i][j] = v[i] * v[j];\\n }\\n dp.assign(n + 1, vector(n + 1, vector<ModInt<>>(n + 1, 0)));\\n dp[0][0][0] = 1;\\n for (int i = 1; i <= n; ++i) {\\n dp[i] = dp[i - 1];\\n for (int j = 0; j < i; ++j)\\n for (int k = j; k < i; ++k) {\\n dat now = memo[j][k] * v[i];\\n if (now.t < 0) continue;\\n if (now == v[i])\\n dp[i][i][i] += dp[i - 1][j][k];\\n else\\n dp[i][j][i] += dp[i - 1][j][k];\\n }\\n }\\n ModInt<> res = -1;\\n for (int i = 0; i <= n; ++i)\\n for (int j = i; j <= n; ++j) res += dp[n][i][j];\\n return res;\\n}\",\n \"accuracy\": 0.02564102564102564,\n \"time_ms\": 60,\n \"memory_kb\": 114152,\n \"score_of_the_acc\": -0.5672,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3181_4849342\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <ctime>\\n#include <cstdlib>\\n#include <cassert>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <string>\\n#include <algorithm>\\n#include <utility>\\n#define llint long long\\n#define inf 1e18\\n#define PI 3.14159265358979323846264338327950\\n#define eps 1e-8\\n#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)\\n#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\\n#define chmin(x, y) (x) = min((x), (y))\\n#define chmax(x, y) (x) = max((x), (y))\\n#define mod 998244353\\n\\nusing namespace std;\\ntypedef pair<llint, llint> P;\\n\\nllint n;\\nllint t[305], l[305], r[305];\\nllint dp[305][305][305];\\n\\nint main(void)\\n{\\n\\tios::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\t\\n\\tcin >> n;\\n\\tfor(int i = 1; i <= n; i++) cin >> t[i] >> l[i] >> r[i];\\n\\t\\n\\tdp[0][0][0] = 1;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tfor(int j = 0; j <= n; j++){\\n\\t\\t\\tfor(int k = 0; k <= n; k++){\\n\\t\\t\\t\\t(dp[i+1][j][k] += dp[i][j][k]) %= mod;\\n\\t\\t\\t\\tllint nj = j, nk = k;\\n\\t\\t\\t\\tllint L = l[j] - (t[i+1] - t[j]), R = r[k] + (t[i+1] - t[k]);\\n\\t\\t\\t\\tif(R < l[i+1] || L > r[i+1]) continue;\\n\\t\\t\\t\\tif(L <= l[i+1]) nj = i+1;\\n\\t\\t\\t\\tif(R >= r[i+1]) nk = i+1;\\n\\t\\t\\t\\t(dp[i+1][nj][nk] += dp[i][j][k]) %= mod;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tllint ans = 0;\\n\\tfor(int j = 0; j <= n; j++){\\n\\t\\tfor(int k = 0; k <= n; k++){\\n\\t\\t\\tans += dp[n][j][k], ans %= mod;\\n\\t\\t}\\n\\t}\\n\\tans += mod - 1, ans %= mod;\\n\\tcout << ans << endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 219556,\n \"score_of_the_acc\": -1.1556,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3181_4849247\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <vector>\\n\\ntemplate <int MOD>\\nstruct ModInt {\\n using lint = long long;\\n int val;\\n\\n // constructor\\n ModInt(lint v = 0) : val(v % MOD) {\\n if (val < 0) val += MOD;\\n };\\n\\n // unary operator\\n ModInt operator+() const { return ModInt(val); }\\n ModInt operator-() const { return ModInt(MOD - val); }\\n ModInt inv() const { return this->pow(MOD - 2); }\\n\\n // arithmetic\\n ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }\\n ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }\\n ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }\\n ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }\\n ModInt pow(lint n) const {\\n auto x = ModInt(1);\\n auto b = *this;\\n while (n > 0) {\\n if (n & 1) x *= b;\\n n >>= 1;\\n b *= b;\\n }\\n return x;\\n }\\n\\n // compound assignment\\n ModInt& operator+=(const ModInt& x) {\\n if ((val += x.val) >= MOD) val -= MOD;\\n return *this;\\n }\\n ModInt& operator-=(const ModInt& x) {\\n if ((val -= x.val) < 0) val += MOD;\\n return *this;\\n }\\n ModInt& operator*=(const ModInt& x) {\\n val = lint(val) * x.val % MOD;\\n return *this;\\n }\\n ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }\\n\\n // compare\\n bool operator==(const ModInt& b) const { return val == b.val; }\\n bool operator!=(const ModInt& b) const { return val != b.val; }\\n bool operator<(const ModInt& b) const { return val < b.val; }\\n bool operator<=(const ModInt& b) const { return val <= b.val; }\\n bool operator>(const ModInt& b) const { return val > b.val; }\\n bool operator>=(const ModInt& b) const { return val >= b.val; }\\n\\n // I/O\\n friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept {\\n lint v;\\n is >> v;\\n x = v;\\n return is;\\n }\\n friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }\\n};\\n\\nconstexpr int MOD = 998244353;\\nusing mint = ModInt<MOD>;\\n\\nvoid solve() {\\n int n;\\n std::cin >> n;\\n\\n std::map<std::pair<int, int>, mint> dp;\\n dp[std::make_pair(0, 0)] = 1;\\n\\n int pt = 0;\\n while (n--) {\\n int t, l, r;\\n std::cin >> t >> l >> r;\\n\\n std::map<std::pair<int, int>, mint> ndp;\\n for (auto [p, v] : dp) {\\n auto [pl, pr] = p;\\n\\n pl -= t - pt;\\n pr += t - pt;\\n\\n {\\n auto q = std::make_pair(pl, pr);\\n if (!ndp.count(q)) ndp[q] = 0;\\n ndp[q] += v;\\n }\\n\\n pl = std::max(pl, l);\\n pr = std::min(pr, r);\\n if (pr < pl) continue;\\n\\n {\\n auto q = std::make_pair(pl, pr);\\n if (!ndp.count(q)) ndp[q] = 0;\\n ndp[q] += v;\\n }\\n }\\n\\n std::swap(dp, ndp);\\n pt = t;\\n }\\n\\n mint ans = 0;\\n for (auto [p, v] : dp) ans += v;\\n std::cout << ans - 1 << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 4472,\n \"score_of_the_acc\": -0.1258,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":1993,"cells":{"group_id":{"kind":"string","value":"aoj_3182_cpp"},"problem_description":{"kind":"string","value":"K Umg Kart\n問題文\numgくんは車のレース大会を主催することにしました。このレースでは、距離が $L$ のコース上を走って競います。スタート位置を位置 $0$ とし、スタート位置からゴールに向かって $x$ だけ離れた位置を位置 $x$ と呼ぶことにします。\nてんぷらくんはこのレース大会に参加することにしました。今回のレースではてんぷらくんを含め $N$ 人の選手が参加することになっており、 $N$ 人の選手には$1$から$N$までの番号がついています。てんぷらくんは選手$1$です。\nさて、レースが始まると、各選手はスタート位置から一斉に走り出します。選手 $i$ の車は距離 $1$ 進むのに $t_i$ 秒かかります。umgくんはこのままではレースが面白くないと思い、 $M$ 個のアイテムボックスをコース上に配置することにしました。アイテムボックス $j$ の概要は次の通りです。\n位置 $x_j$ (整数)にある。\n各選手は、位置 $x_j$ に来たら、必ずアイテムボックス $j$ を取得する。アイテムボックス $j$ は各選手について $1$ つずつ用意されている。\nアイテムボックス $j$ には確率 $\\frac{p_j}{100}$ が定められている。選手 $i$ がアイテムボックス $j$ をとると、次のアイテムボックスを取るまで(またはゴール位置まで)、 $\\frac{p_j}{100}$ の確率で距離 $1$ 進むのにかかる時間が $t_i+D$ 秒になり(減速する)、 $1-\\frac{p_j}{100}$ の確率で距離 $1$ 進むのにかかる時間が $t_i-D$ 秒になる(加速する)。\nただし、 $D$ は $ D \\lt \\min _ i (t_i)$ を満たす。\nレースの順位は、ゴールである位置 $L$ にたどり着いた順番で決まります。最初にゴールについた選手が $1$ 位で、最後にゴールについた選手が $N$ 位です。同着の場合は番号の小さい選手から順に先に到着したとみなします。\nてんぷらくん(選手 $1$ )の順位の期待値を求めてください。答えが有理数になることが問題の制約から証明できるので、答えは${\\rm modulo} \\ 998244353$ で出力してください。正確には、期待値が既約分数 $\\frac{P}{Q}$ で表されるとき、 $R \\times Q = P, 0\\leq R \\lt 998244353$ を満たす $R$ が一意に定まるので、その $R$ を出力してください。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$ $L$\n$t_1$ $t_2$ $\\cdots$ $t_N$\n$M$ $D$\n$x_1$ $p_1$\n$x_2$ $p_2$\n$\\vdots$\n$x_M$ $p_M$\n制約\n入力はすべて整数である。\n$2 \\leq N \\leq 10^5$\n$2 \\leq L \\leq 10^5$\n$2 \\leq t_i \\leq 10^5$\n$1 \\leq M \\leq L-1$\n$1 \\leq D \\lt \\min _ i (t_i)$\n$0 \\leq X_1 \\lt X_2 \\lt \\cdots \\lt X_M \\leq L-1$\n$0 \\leq p_j \\leq 100$\n入力はすべて整数である。\n出力\n答えを 1 行に出力せよ。\n入力例1\n2 2\n5 4\n1 2\n1 50\n出力例1\n249561090\nてんぷらくん(選手 $1$ )の順位は、てんぷらくんがアイテムボックス $1$ で加速し、選手 $2$ がアイテムボックス $1$ で減速したときのみ $1$ 、それ以外のときは $2$ です。\nよって、順位の期待値は $1 \\times \\frac{1}{4} + 2 \\times \\frac{3}{4} = \\frac{7}{4}$ です。 $249561090 \\times 4 = 7 \\ (\\mathrm{mod}\\ 998244353)$ なので、 $249561090$ を出力します。\n入力例2\n5 20\n224 2 3 4 5\n3 1\n3 50\n11 25\n17 75\n出力例2\n5\nレースにおいては適切なマシンを選ぶことも大切です。\n入力例3\n2 2\n10 10\n1 1\n0 0\n出力例3\n1\n同時刻にゴールした場合は、番号の小さい選手が順位が上になることに注意してください。\n入力例4\n8 22\n19 18 13 10 12 10 20 17\n10 3\n1 50\n2 19\n3 17\n4 79\n5 54\n6 76\n7 64\n8 69\n9 98\n10 9\n出力例4\n410169619"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3182_5823737","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <cassert>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <string>\n#include <algorithm>\n#include <utility>\n#include <complex>\n#include <unordered_set>\n#include <unordered_map>\n#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)\n#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)\n#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)\n#define chmin(x, y) (x) = min((x), (y))\n#define chmax(x, y) (x) = max((x), (y))\n#define sz(x) ((ll)(x).size())\n#define ceil(x, y) (((x)+(y)-1) / (y))\n#define all(x) (x).begin(),(x).end()\n#define outl(...) dump_func(__VA_ARGS__)\n#define outf(x) cout << fixed << setprecision(16) << (x) << endl\n#define inf 1e18\nconst double PI = 3.1415926535897932384626433;\n\nusing namespace std;\n\ntypedef long long llint;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\nstruct edge{\n\tll to, cost;\n\tedge(){}\n\tedge(ll a, ll b){ to = a, cost = b;}\n};\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};\n\n//const int mod = 1000000007;\nconst int mod = 998244353;\n\nstruct mint{\n\tint x;\n\tmint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}\n\tmint(const mint &ope) {x = ope.x;}\n\t\n\tmint operator-(){return mint(-x);}\n\tmint operator+(const mint &ope){return mint(x) += ope;}\n\tmint operator-(const mint &ope){return mint(x) -= ope;}\n\tmint operator*(const mint &ope){return mint(x) *= ope;}\n\tmint operator/(const mint &ope){return mint(x) /= ope;}\n\tmint& operator+=(const mint &ope){\n\t\tx += ope.x;\n\t\tif(x >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tmint& operator-=(const mint &ope){\n\t\tx += mod - ope.x;\n\t\tif(x >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tmint& operator*=(const mint &ope){\n\t\tll tmp = x;\n\t\ttmp *= ope.x, tmp %= mod;\n\t\tx = tmp;\n\t\treturn *this;\n\t}\n\tmint& operator/=(const mint &ope){\n\t\tll n = mod-2; mint mul = ope;\n\t\twhile(n){\n\t\t\tif(n & 1) *this *= mul;\n\t\t\tmul *= mul;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn *this;\n\t}\n\tmint inverse(){return mint(1) / *this;}\n\tbool operator ==(const mint &ope){return x == ope.x;}\n\tbool operator !=(const mint &ope){return x != ope.x;}\n\tbool operator <(const mint &ope){return x < ope.x;}\n};\nmint modpow(mint a, ll n){\n\tif(n == 0) return mint(1);\n\tif(n % 2) return a * modpow(a, n-1);\n\telse return modpow(a*a, n/2);\n}\nistream& operator >>(istream &is, mint &ope){\n\tll t; is >> t, ope.x = t;\n\treturn is;\n}\nostream& operator <<(ostream &os, mint &ope){return os << ope.x;}\nostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}\n\nvector<mint> fact, fact_inv;\nvoid make_fact(int n){\n\tfact.resize(n+1), fact_inv.resize(n+1);\n\tfact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);\n\tfact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);\n}\nmint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}\nmint perm(int n, int k){ return comb(n, k) * fact[k]; }\n\nvector<int> prime, pvec;\nvoid make_prime(int n){\n\tprime.resize(n+1);\n\trep(i, 2, n){\n\t\tif(prime[i]) continue;\n\t\tfor(int j = i; j <= n; j+=i) prime[j] = i;\n\t}\n\trep(i, 2, n) if(prime[i] == i) pvec.push_back(i);\n}\n\nbool exceed(ll x, ll y, ll m){return x >= m / y + 1;}\nvoid mark(){ cout << \"*\" << endl; }\nvoid yes(){ cout << \"YES\" << endl; }\nvoid no(){ cout << \"NO\" << endl; }\nll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}\nll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}\nll lcm(ll a, ll b){return a/gcd(a, b)*b;}\nll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}\nll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}\nstring lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}\nll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}\ntemplate<typename T>\nvoid uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}\n\ntemplate<class S, class T> pair<S, T>& operator+=(pair<S,T> &s, const pair<S,T> &t){\n\ts.first += t.first, s.second += t.second;\n\treturn s;\n}\ntemplate<class S, class T> pair<S, T>& operator-=(pair<S,T> &s, const pair<S,T> &t){\n\ts.first -= t.first, s.second -= t.second;\n\treturn s;\n}\ntemplate<class S, class T> pair<S, T> operator+(const pair<S,T> &s, const pair<S,T> &t){\n\treturn pair<S,T>(s.first+t.first, s.second+t.second);\n}\ntemplate<class S, class T> pair<S, T> operator-(const pair<S,T> &s, const pair<S,T> &t){\n\treturn pair<S,T>(s.first-t.first, s.second-t.second);\n}\ntemplate<typename T>\nostream& operator << (ostream& os, vector<T>& vec) {\n\tfor(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n\treturn os;\n}\ntemplate<typename T>\nostream& operator << (ostream& os, deque<T>& deq) {\n\tfor(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? \"\" : \" \");\n\treturn os;\n}\ntemplate<typename T, typename U>\nostream& operator << (ostream& os, pair<T, U>& pair_var) {\n\tos << \"(\" << pair_var.first << \", \" << pair_var.second << \")\";\n\treturn os;\n}\ntemplate<typename T, typename U>\nostream& operator << (ostream& os, const pair<T, U>& pair_var) {\n\tos << \"(\" << pair_var.first << \", \" << pair_var.second << \")\";\n\treturn os;\n}\ntemplate<typename T, typename U>\nostream& operator << (ostream& os, map<T, U>& map_var) {\n\tfor(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {\n\t\tos << \"(\" << itr->first << \", \" << itr->second << \")\";\n\t\titr++; if(itr != map_var.end()) os << \",\"; itr--;\n\t}\n\treturn os;\n}\ntemplate<typename T>\nostream& operator << (ostream& os, set<T>& set_var) {\n\tfor(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {\n\t\tos << *itr; ++itr; if(itr != set_var.end()) os << \" \"; itr--;\n\t}\n\treturn os;\n}\ntemplate<typename T>\nostream& operator << (ostream& os, multiset<T>& set_var) {\n\tfor(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {\n\t\tos << *itr; ++itr; if(itr != set_var.end()) os << \" \"; itr--;\n\t}\n\treturn os;\n}\ntemplate<typename T>\nvoid outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << \" \";}cout << endl;}\nvoid dump_func(){cout << endl;}\ntemplate <class Head, class... Tail>\nvoid dump_func(Head &&head, Tail &&... tail) {\n\tcout << head;\n\tif(sizeof...(Tail) > 0) cout << \" \";\n\tdump_func(std::move(tail)...);\n}\n\n/*\n{1224736769, 3}, // 2^24 * 73 + 1,\n{1053818881, 7}, // 2^20 * 3 * 5 * 67 + 1\n{1051721729, 6}, // 2^20 * 17 * 59 + 1\n{1045430273, 3}, // 2^20 * 997 + 1\n{1012924417, 5}, // 2^21 * 3 * 7 * 23 + 1\n{1007681537, 3}, // 2^20 * 31^2 + 1\n{1004535809, 3}, // 2^21 * 479 + 1\n{998244353, 3}, // 2^23 * 7 * 17 + 1\n{985661441, 3}, // 2^22 * 5 * 47 + 1\n{976224257, 3}, // 2^20 * 7^2 * 19 + 1\n{975175681, 17}, // 2^21 * 3 * 5 * 31 + 1\n{962592769, 7}, // 2^21 * 3^3 * 17 + 1\n{950009857, 7}, // 2^21 * 4 * 151 + 1\n{943718401, 7}, // 2^22 * 3^2 * 5^2 + 1\n{935329793, 3}, // 2^22 * 223 + 1\n{924844033, 5}, // 2^21 * 3^2 * 7^2 + 1\n{469762049, 3}, // 2^26 * 7 + 1\n{167772161, 3}, // 2^25 * 5 + 1\n*/\n\nstruct FFT_Convolution{\n\ttypedef complex<double> C;\n\t\n\tFFT_Convolution(){};\n\tstatic int rev(int x, int n){\n\t\tint ret = 0;\n\t\tfor(int i = 0; i < n; i++) ret <<= 1, ret |= (x>>i) & 1;\n\t\treturn ret;\n\t}\n\t\n\tstatic void DFT(vector<C> &f, vector<C> &F, int n)\n\t{\n\t\tint N = 1<<n;\n\t\tF.resize(N);\n\t\tfor(int i = 0; i < N; i++) F[rev(i, n)] = f[i];\n\t\t\n\t\tC a, b, x, z;\n\t\tfor(int i = 1; i <= n; i++){\n\t\t\tint l = 1<<i;\n\t\t\tz = C(cos(2*PI/l), sin(2*PI/l));\n\t\t\tfor(int j = 0; j < N/l; j++){\n\t\t\t\tx = C(1, 0);\n\t\t\t\tfor(int k = 0; k < l/2; k++){\n\t\t\t\t\ta = F[j*l+k], b = F[j*l+k+l/2];\n\t\t\t\t\tF[j*l+k] = a + x * b;\n\t\t\t\t\tF[j*l+k+l/2] = a - x * b;\n\t\t\t\t\tx *= z;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tstatic void IDFT(vector<C> &F, vector<C> &f, int n)\n\t{\n\t\tint N = 1<<n;\n\t\tfor(int i = 0; i < N; i++) f[rev(i, n)] = F[i];\n\t\t\n\t\tC a, b, x, z;\n\t\tfor(int i = 1; i <= n; i++){\n\t\t\tint l = 1<<i;\n\t\t\tz = C(cos(2*PI/l), -sin(2*PI/l));\n\t\t\tfor(int j = 0; j < N/l; j++){\n\t\t\t\tx = C(1, 0);\n\t\t\t\tfor(int k = 0; k < l/2; k++){\n\t\t\t\t\ta = f[j*l+k], b = f[j*l+k+l/2];\n\t\t\t\t\tf[j*l+k] = a + x * b;\n\t\t\t\t\tf[j*l+k+l/2] = a - x * b;\n\t\t\t\t\tx *= z;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < N; i++) f[i] /= N;\n\t}\n\tstatic ll round(C c){return (ll)(c.real()+0.5);}\n\t\n\tstatic void conv(vector<ll> f, vector<ll> g, vector<ll> &dest)\n\t{\n\t\tll logf = 0, logg = 0, len = f.size() + g.size();\n\t\tfor(int i = f.size(); i; i /= 2) logf++;\n\t\tfor(int i = g.size(); i; i /= 2) logg++;\n\t\t\n\t\tll n = max(logf, logg)+1, N = 1<<n;\n\t\tvector<C> f2(N), g2(N);\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(i < f.size()) f2[i] = C(f[i], 0);\n\t\t\telse f2[i] = C(0, 0);\n\t\t}\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(i < g.size()) g2[i] = C(g[i], 0);\n\t\t\telse g2[i] = C(0, 0);\n\t\t}\n\t\t\n\t\tvector<C> F, G;\n\t\tDFT(f2, F, n), DFT(g2, G, n);\n\t\tfor(int i = 0; i < N; i++) F[i] *= G[i];\n\t\tIDFT(F, f2, n);\n\t\t\n\t\tdest.resize(len-1);\n\t\tfor(int i = 0; i < dest.size(); i++) dest[i] = round(f2[i]);\n\t}\n};\n\nstruct NTT_Convolution{\n\tNTT_Convolution(){};\n\tstatic int rev(int x, int n){\n\t\tint ret = 0;\n\t\tfor(int i = 0; i < n; i++) ret <<= 1, ret |= (x>>i) & 1;\n\t\treturn ret;\n\t}\n\tstatic void DFT(vector<mint> &f, vector<mint> &F, int n, mint root, bool inv = false)\n\t{\n\t\tint N = 1<<n;\n\t\tF.resize(N);\n\t\tfor(int i = 0; i < N; i++) F[rev(i, n)] = f[i];\n\t\tif(inv) root = root.inverse();\n\t\t\n\t\tmint a, b, x, z;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tint l = 1<<i;\n\t\t\tz = modpow(root, 1<<(n-(i+1)));\n\t\t\tfor(int j = 0; j < N; j+=l*2){\n\t\t\t\tx = 1;\n\t\t\t\tfor(int k = j; k < j+l; k++){\n\t\t\t\t\ta = F[k], b = F[k+l] * x;\n\t\t\t\t\tF[k] = a + b, F[k+l] = a - b, x *= z;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(inv){\n\t\t\tmint Ninv = mint(N).inverse();\n\t\t\tfor(int i = 0; i < N; i++) F[i] *= Ninv;\n\t\t}\n\t}\n\tstatic void conv(vector<mint> f, vector<mint> g, vector<mint> &dest)\n\t{\n\t\tll logf = 0, logg = 0, len = f.size() + g.size();\n\t\tfor(int i = f.size(); i; i /= 2) logf++;\n\t\tfor(int i = g.size(); i; i /= 2) logg++;\n\t\t\n\t\tll n = max(logf, logg)+1, N = 1<<n;\n\t\tf.resize(N), g.resize(N);\n\t\tmint root = modpow(mint(3), 119 * (1<<23-n));\n\t\t\n\t\tvector<mint> F, G;\n\t\tDFT(f, F, n, root), DFT(g, G, n, root);\n\t\tfor(int i = 0; i < N; i++) F[i] *= G[i];\n\t\tDFT(F, f, n, root, true);\n\t\t\n\t\tf.resize(len-1);\n\t\tdest = f;\n\t}\n};\n\nstruct ConvolutionMerge{\n\tint id;\n\tvector<vector<mint> > vec;\n\tpriority_queue<P, vector<P>, greater<P> >Q;\n\t\n\tConvolutionMerge(){init();}\n\tvoid init(){\n\t\tid = 0;\n\t\tvec.clear();\n\t\twhile(Q.size()) Q.pop();\n\t\tvector<mint> f;\n\t\tf.push_back(mint(1));\n\t\tadd(f);\n\t}\n\tvoid add(vector<mint> &f){\n\t\tQ.push(P(f.size(), id++));\n\t\tvec.push_back(f);\n\t}\n\tvoid calc(vector<mint> &dest){\n\t\twhile(Q.size() >= 2){\n\t\t\tll u = Q.top().second; Q.pop();\n\t\t\tll v = Q.top().second; Q.pop();\n\t\t\tNTT_Convolution::conv(vec[u], vec[v], vec[u]);\n\t\t\tQ.push(P(vec[u].size(), u));\n\t\t}\n\t\tdest = vec[Q.top().second];\n\t}\n};\n\nllint n, L;\nllint t[100005];\nllint m, d;\nllint x[100005], w[100005];\nmint p[100005], sum[200005];\nConvolutionMerge cm;\n\nint main(void)\n{\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\t\n\tcin >> n >> L;\n\tfor(int i = 1; i <= n; i++) cin >> t[i];\n\tcin >> m >> d;\n\tfor(int i = 1; i <= m; i++) cin >> x[i] >> p[i];\n\t\n\tmint inv100 = mint(100).inverse();\n\t\n\tx[m+1] = L;\n\tfor(int i = 1; i <= m; i++){\n\t\tw[i] = x[i+1] - x[i];\n\t\tp[i] *= inv100;\n\t}\n\t\n\tvector<mint> vec;\n\tfor(int i = 1; i <= m; i++){\n\t\tvec.clear(), vec.resize(w[i]+1);\n\t\tvec[0] = mint(1) - p[i];\n\t\tvec[w[i]] = p[i];\n\t\tcm.add(vec);\n\t}\n\tcm.calc(vec);\n\t\n\tvector<mint> f(L+1), g(L+1);\n\treps(i, vec) f[i] = vec[i], g[L-i] = vec[i];\n\tNTT_Convolution::conv(f, g, f);\n\tfor(int i = 2*L; i >= 0; i--) sum[i] = sum[i+1] + f[i];\n\t\n\tmint ans = 1;\n\tfor(int i = 2; i <= n; i++){\n\t\tllint b = (L*(t[1]-t[i])+2*d-1)/(2*d);\n\t\tif(L*(t[1]-t[i]) < 0) b = L*(t[1]-t[i])/(2*d);\n\t\t\n\t\tmint p = 0;\n\t\tif(b <= -L) p = 1;\n\t\telse if(b <= L) p = sum[b+L];\n\t\tans += mint(1) - p;\n\t}\n\toutl(ans);\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":380,"memory_kb":26196,"score_of_the_acc":-0.4237,"final_rank":8},{"submission_id":"aoj_3182_5304761","code_snippet":"#include <bits/stdc++.h>\n\n\n#include <algorithm>\n#include <array>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast moduler by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m`\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n for (long long a : {2, 7, 61}) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <type_traits>\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\nvoid butterfly(std::vector<mint>& a) {\n static constexpr int g = internal::primitive_root<mint::mod()>;\n int n = int(a.size());\n int h = internal::ceil_pow2(n);\n\n static bool first = true;\n static mint sum_e[30]; // sum_e[i] = ies[0] * ... * ies[i - 1] * es[i]\n if (first) {\n first = false;\n mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1\n int cnt2 = bsf(mint::mod() - 1);\n mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();\n for (int i = cnt2; i >= 2; i--) {\n // e^(2^i) == 1\n es[i - 2] = e;\n ies[i - 2] = ie;\n e *= e;\n ie *= ie;\n }\n mint now = 1;\n for (int i = 0; i < cnt2 - 2; i++) {\n sum_e[i] = es[i] * now;\n now *= ies[i];\n }\n }\n for (int ph = 1; ph <= h; ph++) {\n int w = 1 << (ph - 1), p = 1 << (h - ph);\n mint now = 1;\n for (int s = 0; s < w; s++) {\n int offset = s << (h - ph + 1);\n for (int i = 0; i < p; i++) {\n auto l = a[i + offset];\n auto r = a[i + offset + p] * now;\n a[i + offset] = l + r;\n a[i + offset + p] = l - r;\n }\n now *= sum_e[bsf(~(unsigned int)(s))];\n }\n }\n}\n\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\nvoid butterfly_inv(std::vector<mint>& a) {\n static constexpr int g = internal::primitive_root<mint::mod()>;\n int n = int(a.size());\n int h = internal::ceil_pow2(n);\n\n static bool first = true;\n static mint sum_ie[30]; // sum_ie[i] = es[0] * ... * es[i - 1] * ies[i]\n if (first) {\n first = false;\n mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1\n int cnt2 = bsf(mint::mod() - 1);\n mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();\n for (int i = cnt2; i >= 2; i--) {\n // e^(2^i) == 1\n es[i - 2] = e;\n ies[i - 2] = ie;\n e *= e;\n ie *= ie;\n }\n mint now = 1;\n for (int i = 0; i < cnt2 - 2; i++) {\n sum_ie[i] = ies[i] * now;\n now *= es[i];\n }\n }\n\n for (int ph = h; ph >= 1; ph--) {\n int w = 1 << (ph - 1), p = 1 << (h - ph);\n mint inow = 1;\n for (int s = 0; s < w; s++) {\n int offset = s << (h - ph + 1);\n for (int i = 0; i < p; i++) {\n auto l = a[i + offset];\n auto r = a[i + offset + p];\n a[i + offset] = l + r;\n a[i + offset + p] =\n (unsigned long long)(mint::mod() + l.val() - r.val()) *\n inow.val();\n }\n inow *= sum_ie[bsf(~(unsigned int)(s))];\n }\n }\n}\n\n} // namespace internal\n\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\nstd::vector<mint> convolution(std::vector<mint> a, std::vector<mint> b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n if (std::min(n, m) <= 60) {\n if (n < m) {\n std::swap(n, m);\n std::swap(a, b);\n }\n std::vector<mint> ans(n + m - 1);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n ans[i + j] += a[i] * b[j];\n }\n }\n return ans;\n }\n int z = 1 << internal::ceil_pow2(n + m - 1);\n a.resize(z);\n internal::butterfly(a);\n b.resize(z);\n internal::butterfly(b);\n for (int i = 0; i < z; i++) {\n a[i] *= b[i];\n }\n internal::butterfly_inv(a);\n a.resize(n + m - 1);\n mint iz = mint(z).inv();\n for (int i = 0; i < n + m - 1; i++) a[i] *= iz;\n return a;\n}\n\ntemplate <unsigned int mod = 998244353,\n class T,\n std::enable_if_t<internal::is_integral<T>::value>* = nullptr>\nstd::vector<T> convolution(const std::vector<T>& a, const std::vector<T>& b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n\n using mint = static_modint<mod>;\n std::vector<mint> a2(n), b2(m);\n for (int i = 0; i < n; i++) {\n a2[i] = mint(a[i]);\n }\n for (int i = 0; i < m; i++) {\n b2[i] = mint(b[i]);\n }\n auto c2 = convolution(move(a2), move(b2));\n std::vector<T> c(n + m - 1);\n for (int i = 0; i < n + m - 1; i++) {\n c[i] = c2[i].val();\n }\n return c;\n}\n\nstd::vector<long long> convolution_ll(const std::vector<long long>& a,\n const std::vector<long long>& b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n\n static constexpr unsigned long long MOD1 = 754974721; // 2^24\n static constexpr unsigned long long MOD2 = 167772161; // 2^25\n static constexpr unsigned long long MOD3 = 469762049; // 2^26\n static constexpr unsigned long long M2M3 = MOD2 * MOD3;\n static constexpr unsigned long long M1M3 = MOD1 * MOD3;\n static constexpr unsigned long long M1M2 = MOD1 * MOD2;\n static constexpr unsigned long long M1M2M3 = MOD1 * MOD2 * MOD3;\n\n static constexpr unsigned long long i1 =\n internal::inv_gcd(MOD2 * MOD3, MOD1).second;\n static constexpr unsigned long long i2 =\n internal::inv_gcd(MOD1 * MOD3, MOD2).second;\n static constexpr unsigned long long i3 =\n internal::inv_gcd(MOD1 * MOD2, MOD3).second;\n\n auto c1 = convolution<MOD1>(a, b);\n auto c2 = convolution<MOD2>(a, b);\n auto c3 = convolution<MOD3>(a, b);\n\n std::vector<long long> c(n + m - 1);\n for (int i = 0; i < n + m - 1; i++) {\n unsigned long long x = 0;\n x += (c1[i] * i1) % MOD1 * M2M3;\n x += (c2[i] * i2) % MOD2 * M1M3;\n x += (c3[i] * i3) % MOD3 * M1M2;\n // B = 2^63, -B <= x, r(real value) < B\n // (x, x - M, x - 2M, or x - 3M) = r (mod 2B)\n // r = c1[i] (mod MOD1)\n // focus on MOD1\n // r = x, x - M', x - 2M', x - 3M' (M' = M % 2^64) (mod 2B)\n // r = x,\n // x - M' + (0 or 2B),\n // x - 2M' + (0, 2B or 4B),\n // x - 3M' + (0, 2B, 4B or 6B) (without mod!)\n // (r - x) = 0, (0)\n // - M' + (0 or 2B), (1)\n // -2M' + (0 or 2B or 4B), (2)\n // -3M' + (0 or 2B or 4B or 6B) (3) (mod MOD1)\n // we checked that\n // ((1) mod MOD1) mod 5 = 2\n // ((2) mod MOD1) mod 5 = 3\n // ((3) mod MOD1) mod 5 = 4\n long long diff =\n c1[i] - internal::safe_mod((long long)(x), (long long)(MOD1));\n if (diff < 0) diff += MOD1;\n static constexpr unsigned long long offset[5] = {\n 0, 0, M1M2M3, 2 * M1M2M3, 3 * M1M2M3};\n x -= offset[diff % 5];\n c[i] = x;\n }\n\n return c;\n}\n\n} // namespace atcoder\n\n\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\n#define rep(i, n) For((i), 0, (n))\n#define rrep(i, n) rFor((i), (n), 0)\n#define fi first\n#define se second\n\nusing namespace std;\n\ntypedef long long lint;\ntypedef unsigned long long ulint;\ntypedef pair<int, int> pii;\ntypedef pair<lint, lint> pll;\n\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\nT div_floor(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a >= 0 ? a / b : (a + 1) / b - 1;\n}\ntemplate <class T>\nT div_ceil(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a > 0 ? (a - 1) / b + 1 : a / b;\n}\n\ntemplate <typename T>\nstruct coord_comp {\n vector<T> v;\n bool sorted = false;\n\n coord_comp() {}\n\n int size() { return v.size(); }\n\n void add(T x) { v.push_back(x); }\n\n void build() {\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n sorted = true;\n }\n\n int get_idx(T x) {\n assert(sorted);\n return lower_bound(v.begin(), v.end(), x) - v.begin();\n }\n};\n\nconstexpr lint mod = 1000000007;\nconstexpr lint INF = mod * mod;\nconstexpr int MAX = 200010;\n\nusing namespace atcoder;\nusing mint = modint998244353;\nusing poly = vector<mint>;\n\nint main() {\n int n;\n lint L;\n scanf(\"%d%lld\", &n, &L);\n lint t[n];\n rep(i, n) scanf(\"%lld\", &t[i]);\n int m;\n lint D;\n scanf(\"%d%lld\", &m, &D);\n int x[m + 1];\n mint p[m];\n mint inv100 = mint(100).inv();\n rep(i, m) {\n int tmp;\n scanf(\"%d%d\", &x[i], &tmp);\n p[i] = mint(tmp) * inv100;\n }\n x[m] = L;\n\n auto cmp = [&](const poly &a, const poly &b) {\n return a.size() > b.size();\n };\n priority_queue<poly, vector<poly>, decltype(cmp)> que(cmp);\n rep(i, m) {\n mint a = p[i] * (mint(1) - p[i]);\n mint b = p[i].pow(2) + (mint(1) - p[i]).pow(2);\n poly v(2 * (x[i + 1] - x[i]) + 1);\n v[0] = v[2 * (x[i + 1] - x[i])] = a;\n v[x[i + 1] - x[i]] = b;\n que.push(v);\n }\n while (que.size() >= 2) {\n auto a = que.top();\n que.pop();\n auto b = que.top();\n que.pop();\n que.push(convolution(a, b));\n }\n auto a = que.top();\n rrep(i, a.size() - 1) a[i] += a[i + 1];\n\n mint ans = 1;\n For(i, 1, n) {\n lint k = div_floor(L * (t[i] - t[0]), 2 * D) + 1 + L - x[0];\n if (k < (int)a.size()) ans += a[max(0LL, k)];\n }\n printf(\"%u\\n\", ans.val());\n}","accuracy":1,"time_ms":220,"memory_kb":14212,"score_of_the_acc":-0.0126,"final_rank":1},{"submission_id":"aoj_3182_4951247","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\nusing mint = ModInt<>;\n\ntemplate <int mod = 998244353>\nstruct NTT {\n int base, maxb, root;\n vector<int> rv, roots, invr;\n NTT() : base(1), rv({0, 1}), roots({0, 1}), invr({0, 1}) {\n assert(mod >= 3 && mod & 1);\n int tmp = mod - 1;\n maxb = 0;\n while (!(tmp & 1)) tmp >>= 1, ++maxb;\n root = 2;\n while (mpow(root, (mod - 1) >> 1) == 1) ++root;\n assert(mpow(root, mod - 1) == 1);\n root = mpow(root, (mod - 1) >> maxb);\n }\n\n inline int mpow(int x, int n) {\n int res = 1;\n while (n) {\n if (n & 1) res = mul(res, x);\n x = mul(x, x);\n n >>= 1;\n }\n return res;\n }\n\n inline int inv(int x) {\n assert(x != 0);\n return mpow(x, mod - 2);\n }\n\n inline int add(int x, int y) {\n if ((x += y) >= mod) x -= mod;\n return x;\n }\n\n inline int mul(int x, int y) { return (int)(1LL * x * y % mod); }\n\n void ensure_base(int nb) {\n if (nb <= base) return;\n rv.resize(1 << nb);\n roots.resize(1 << nb);\n invr.resize(1 << nb);\n for (int i = 0; i < (1 << nb); ++i)\n rv[i] = (rv[i >> 1] >> 1) + ((i & 1) << (nb - 1));\n assert(nb <= maxb);\n while (base < nb) {\n int z = mpow(root, 1 << (maxb - 1 - base)), invz = inv(z);\n for (int i = 1 << (base - 1); i < (1 << base); ++i) {\n roots[i << 1] = roots[i];\n roots[(i << 1) + 1] = mul(roots[i], z);\n invr[i << 1] = invr[i];\n invr[(i << 1) + 1] = mul(invr[i], invz);\n }\n ++base;\n }\n }\n void ntt(vector<int> &a, int n, bool sg = 0) {\n assert((n & (n - 1)) == 0);\n int dif = base - __builtin_ctz(n);\n for (int i = 0; i < n; ++i)\n if (i < (rv[i] >> dif)) swap(a[i], a[rv[i] >> dif]);\n for (int k = 1; k < n; k <<= 1)\n for (int i = 0; i < n; i += 2 * k)\n for (int j = 0; j < k; ++j) {\n int z = mul(a[i + j + k], (sg ? roots[j + k] : invr[j + k]));\n a[i + j + k] = add(a[i + j], mod - z);\n a[i + j] = add(a[i + j], z);\n }\n int invn = inv(n);\n if (sg)\n for (int i = 0; i < n; ++i) a[i] = mul(a[i], invn);\n }\n template <class T>\n vector<T> multiply(const vector<T> &a, const vector<T> &b) {\n int need = a.size() + b.size() - 1;\n int nb = 1;\n while ((1 << nb) < need) ++nb;\n ensure_base(nb);\n int sz = 1 << nb;\n vector<int> fa(sz, 0), fb(sz, 0);\n for (int i = 0; i < sz; ++i) {\n if (i < a.size()) fa[i] = a[i];\n if (i < b.size()) fb[i] = b[i];\n }\n ntt(fa, sz);\n ntt(fb, sz);\n for (int i = 0; i < sz; ++i) fa[i] = mul(fa[i], fb[i]);\n ntt(fa, sz, 1);\n vector<T> res(need);\n for (int i = 0; i < need; ++i) res[i] = fa[i];\n return res;\n }\n};\n\nint n, l, m, d;\nvector<int> t, x, p;\nvector<mint> sum;\nNTT ntt;\n\nmint solve();\n\nint main() {\n cin >> n >> l;\n t.resize(n);\n for (auto &i : t) cin >> i;\n cin >> m >> d;\n x.resize(m);\n p.resize(m);\n for (int i = 0; i < m; ++i) cin >> x[i] >> p[i];\n x.push_back(l);\n cout << solve() << endl;\n return 0;\n}\n\nmint solve() {\n { // pre\n queue<vector<int>> qu;\n for (int i = 0; i < m; ++i) {\n int len = x[i + 1] - x[i];\n vector<int> v(2 * len + 1, 0);\n mint np = mint(p[i]) / 100, revp = -np + 1;\n v[0] = v[2 * len] = (np * revp).x;\n v[len] = mint(1 - 2 * v[0]).x;\n qu.push(v);\n }\n while (qu.size() > 1) {\n auto lv = qu.front();\n qu.pop();\n qu.push(ntt.multiply(lv, qu.front()));\n qu.pop();\n }\n auto v = qu.front();\n int len = v.size();\n sum.resize(len);\n for (int i = 0; i < len; ++i) {\n sum[i] = v[i];\n if (i) sum[i] += sum[i - 1];\n }\n }\n mint res = n;\n int len = sum.size();\n for (int i = 1; i < n; ++i) {\n long long time = 1LL * (t[i] - t[0]) * l + 2LL * d * (l - x[0]);\n if (time >= 0) res -= sum[min(time / (2 * d), len - 1LL)];\n }\n return res;\n}","accuracy":1,"time_ms":310,"memory_kb":15812,"score_of_the_acc":-0.1446,"final_rank":3},{"submission_id":"aoj_3182_4950800","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\nusing mint = ModInt<>;\n\ntemplate <int mod = 998244353>\nstruct NTT {\n int base, maxb, root;\n vector<int> rv, roots, invr;\n NTT() : base(1), rv({0, 1}), roots({0, 1}), invr({0, 1}) {\n assert(mod >= 3 && mod & 1);\n int tmp = mod - 1;\n maxb = 0;\n while (!(tmp & 1)) tmp >>= 1, ++maxb;\n root = 2;\n while (mpow(root, (mod - 1) >> 1) == 1) ++root;\n assert(mpow(root, mod - 1) == 1);\n root = mpow(root, (mod - 1) >> maxb);\n }\n\n inline int mpow(int x, int n) {\n int res = 1;\n while (n) {\n if (n & 1) res = mul(res, x);\n x = mul(x, x);\n n >>= 1;\n }\n return res;\n }\n\n inline int inv(int x) { return mpow(x, mod - 2); }\n\n inline int add(int x, int y) {\n if ((x += y) >= mod) x -= mod;\n return x;\n }\n\n inline int mul(int x, int y) { return (int)(1LL * x * y % mod); }\n\n void ensure_base(int nb) {\n if (nb <= base) return;\n rv.resize(1 << nb);\n roots.resize(1 << nb);\n invr.resize(1 << nb);\n for (int i = 0; i < (1 << nb); ++i)\n rv[i] = (rv[i >> 1] >> 1) + ((i & 1) << (nb - 1));\n assert(nb <= maxb);\n while (base < nb) {\n int z = mpow(root, 1 << (maxb - 1 - base)), invz = inv(z);\n for (int i = 1 << (base - 1); i < (1 << base); ++i) {\n roots[i << 1] = roots[i];\n roots[(i << 1) + 1] = mul(roots[i], z);\n invr[i << 1] = invr[i];\n invr[(i << 1) + 1] = mul(invr[i], invz);\n }\n ++base;\n }\n }\n void ntt(vector<int> &a, int n, bool sg = 0) {\n assert((n & (n - 1)) == 0);\n for (int i = 0; i < n; ++i)\n if (i < rv[i]) swap(a[i], a[rv[i]]);\n for (int k = 1; k < n; k <<= 1)\n for (int i = 0; i < n; i += 2 * k)\n for (int j = 0; j < k; ++j) {\n int z = mul(a[i + j + k], (sg ? roots[j + k] : invr[j + k]));\n a[i + j + k] = add(a[i + j], mod - z);\n a[i + j] = add(a[i + j], z);\n }\n int invn = inv(n);\n if (sg)\n for (int i = 0; i < n; ++i) a[i] = mul(a[i], invn);\n }\n template <class T>\n vector<T> multiply(const vector<T> &a, const vector<T> &b) {\n int need = a.size() + b.size() - 1;\n int nb = 1;\n while ((1 << nb) < need) ++nb;\n ensure_base(nb);\n int sz = 1 << nb;\n vector<int> fa(sz, 0), fb(sz, 0);\n for (int i = 0; i < sz; ++i) {\n if (i < a.size()) fa[i] = a[i];\n if (i < b.size()) fb[i] = b[i];\n }\n ntt(fa, sz);\n ntt(fb, sz);\n for (int i = 0; i < sz; ++i) fa[i] = mul(fa[i], fb[i]);\n ntt(fa, sz, 1);\n vector<T> res(need);\n for (int i = 0; i < need; ++i) res[i] = fa[i];\n mint x = 0;\n for (auto p : res) x += p;\n cout << x << endl;\n x = 0;\n for (auto p : a) x += p;\n cout << x << endl;\n x = 0;\n for (auto p : b) x += p;\n cout << x << endl;\n return res;\n }\n};\n\ntemplate <int mod>\nstruct NumberTheoreticTransform {\n vector<int> rev, rts;\n int base, max_base, root;\n\n NumberTheoreticTransform() : base(1), rev{0, 1}, rts{0, 1} {\n assert(mod >= 3 && mod % 2 == 1);\n auto tmp = mod - 1;\n max_base = 0;\n while (tmp % 2 == 0) tmp >>= 1, max_base++;\n root = 2;\n while (mod_pow(root, (mod - 1) >> 1) == 1) ++root;\n assert(mod_pow(root, mod - 1) == 1);\n root = mod_pow(root, (mod - 1) >> max_base);\n }\n\n inline int mod_pow(int x, int n) {\n int ret = 1;\n while (n > 0) {\n if (n & 1) ret = mul(ret, x);\n x = mul(x, x);\n n >>= 1;\n }\n return ret;\n }\n\n inline int inverse(int x) { return mod_pow(x, mod - 2); }\n\n inline unsigned add(unsigned x, unsigned y) {\n x += y;\n if (x >= mod) x -= mod;\n return x;\n }\n\n inline unsigned mul(unsigned a, unsigned b) {\n return 1ull * a * b % (unsigned long long)mod;\n }\n\n void ensure_base(int nbase) {\n if (nbase <= base) return;\n rev.resize(1 << nbase);\n rts.resize(1 << nbase);\n for (int i = 0; i < (1 << nbase); i++) {\n rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));\n }\n assert(nbase <= max_base);\n while (base < nbase) {\n int z = mod_pow(root, 1 << (max_base - 1 - base));\n for (int i = 1 << (base - 1); i < (1 << base); i++) {\n rts[i << 1] = rts[i];\n rts[(i << 1) + 1] = mul(rts[i], z);\n }\n ++base;\n }\n }\n\n void ntt(vector<int> &a) {\n const int n = (int)a.size();\n assert((n & (n - 1)) == 0);\n int zeros = __builtin_ctz(n);\n ensure_base(zeros);\n int shift = base - zeros;\n for (int i = 0; i < n; i++) {\n if (i < (rev[i] >> shift)) {\n swap(a[i], a[rev[i] >> shift]);\n }\n }\n for (int k = 1; k < n; k <<= 1) {\n for (int i = 0; i < n; i += 2 * k) {\n for (int j = 0; j < k; j++) {\n int z = mul(a[i + j + k], rts[j + k]);\n a[i + j + k] = add(a[i + j], mod - z);\n a[i + j] = add(a[i + j], z);\n }\n }\n }\n }\n\n vector<int> multiply(vector<int> a, vector<int> b) {\n int need = a.size() + b.size() - 1;\n int nbase = 1;\n while ((1 << nbase) < need) nbase++;\n ensure_base(nbase);\n int sz = 1 << nbase;\n a.resize(sz, 0);\n b.resize(sz, 0);\n ntt(a);\n ntt(b);\n int inv_sz = inverse(sz);\n for (int i = 0; i < sz; i++) {\n a[i] = mul(a[i], mul(b[i], inv_sz));\n }\n reverse(a.begin() + 1, a.end());\n ntt(a);\n a.resize(need);\n return a;\n }\n};\n\nint n, l, m, d;\nvector<int> t, x, p;\nvector<mint> sum;\nNTT ntt;\n\nmint solve();\n\nint main() {\n cin >> n >> l;\n t.resize(n);\n for (auto &i : t) cin >> i;\n cin >> m >> d;\n x.resize(m);\n p.resize(m);\n for (int i = 0; i < m; ++i) cin >> x[i] >> p[i];\n x.push_back(l);\n cout << solve() << endl;\n return 0;\n}\n\nmint solve() {\n { // pre\n queue<vector<int>> qu;\n for (int i = 0; i < m; ++i) {\n int len = x[i + 1] - x[i];\n vector<int> v(2 * len + 1, 0);\n mint np = mint(p[i]) / 100, revp = -np + 1;\n v[0] = v[2 * len] = (np * revp).x;\n v[len] = mint(1 - 2 * v[0]).x;\n qu.push(v);\n }\n NumberTheoreticTransform<998244353> ntt2;\n while (qu.size() > 1) {\n auto lv = qu.front();\n qu.pop();\n auto rv = qu.front();\n qu.pop();\n auto v = ntt2.multiply(lv, rv);\n qu.push(v);\n }\n auto v = qu.front();\n int len = v.size();\n sum.resize(len);\n for (int i = 0; i < len; ++i) {\n sum[i] = v[i];\n if (i) sum[i] += sum[i - 1];\n }\n }\n mint res = n;\n int len = sum.size();\n for (int i = 1; i < n; ++i) {\n long long time = 1LL * (t[i] - t[0]) * l + 2LL * d * (l - x[0]);\n if (time >= 0) res -= sum[min(time / (2 * d), len - 1LL)];\n }\n return res;\n}","accuracy":1,"time_ms":320,"memory_kb":14480,"score_of_the_acc":-0.1301,"final_rank":2},{"submission_id":"aoj_3182_4950763","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(998244353)>\nstruct ModInt {\n int x;\n constexpr ModInt() : x(0) {}\n constexpr ModInt(int64_t y)\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\n *this *= p.inverse();\n return *this;\n }\n constexpr ModInt operator-() const { return ModInt(-x); }\n constexpr ModInt operator+(const ModInt &p) const noexcept {\n return ModInt(*this) += p;\n }\n constexpr ModInt operator-(const ModInt &p) const noexcept {\n return ModInt(*this) -= p;\n }\n constexpr ModInt operator*(const ModInt &p) const noexcept {\n return ModInt(*this) *= p;\n }\n constexpr ModInt operator/(const ModInt &p) const noexcept {\n return ModInt(*this) /= p;\n }\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\n constexpr ModInt inverse() const noexcept {\n int a = x, b = mod, u = 1, v = 0, t = 0;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n constexpr ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\n return os << p.x;\n }\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\n int64_t t = 0;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n constexpr int get_mod() { return mod; }\n};\nusing mint = ModInt<>;\n\ntemplate <int mod = 998244353>\nstruct NTT {\n int base, maxb, root;\n vector<int> rv, roots, invr;\n NTT() : base(1), rv({0, 1}), roots({0, 1}), invr({0, 1}) {\n assert(mod >= 3 && mod & 1);\n int tmp = mod - 1;\n maxb = 0;\n while (!(tmp & 1)) tmp >>= 1, ++maxb;\n root = 2;\n while (mpow(root, (mod - 1) >> 1) == 1) ++root;\n assert(mpow(root, mod - 1) == 1);\n root = mpow(root, (mod - 1) >> maxb);\n }\n\n inline int mpow(int x, int n) {\n int res = 1;\n while (n) {\n if (n & 1) res = mul(res, x);\n x = mul(x, x);\n n >>= 1;\n }\n return res;\n }\n\n inline int inv(int x) { return mpow(x, mod - 2); }\n\n inline int add(int x, int y) {\n if ((x += y) >= mod) x -= mod;\n return x;\n }\n\n inline int mul(int x, int y) { return (int)(1LL * x * y % mod); }\n\n void ensure_base(int nb) {\n if (nb <= base) return;\n rv.resize(1 << nb);\n roots.resize(1 << nb);\n invr.resize(1 << nb);\n for (int i = 0; i < (1 << nb); ++i)\n rv[i] = (rv[i >> 1] >> 1) + ((i & 1) << (nb - 1));\n assert(nb <= maxb);\n while (base < nb) {\n int z = mpow(root, 1 << (maxb - 1 - base)), invz = inv(z);\n for (int i = 1 << (base - 1); i < (1 << base); ++i) {\n roots[i << 1] = roots[i];\n roots[(i << 1) + 1] = mul(roots[i], z);\n invr[i << 1] = invr[i];\n invr[(i << 1) + 1] = mul(invr[i], invz);\n }\n ++base;\n }\n }\n void ntt(vector<int> &a, int n, bool sg = 0) {\n assert((n & (n - 1)) == 0);\n for (int i = 0; i < n; ++i)\n if (i < rv[i]) swap(a[i], a[rv[i]]);\n for (int k = 1; k < n; k <<= 1)\n for (int i = 0; i < n; i += 2 * k)\n for (int j = 0; j < k; ++j) {\n int z = mul(a[i + j + k], (sg ? roots[j + k] : invr[j + k]));\n a[i + j + k] = add(a[i + j], mod - z);\n a[i + j] = add(a[i + j], z);\n }\n int invn = inv(n);\n if (sg)\n for (int i = 0; i < n; ++i) a[i] = mul(a[i], invn);\n }\n template <class T>\n vector<T> multiply(const vector<T> &a, const vector<T> &b) {\n int need = a.size() + b.size() - 1;\n int nb = 1;\n while ((1 << nb) < need) ++nb;\n ensure_base(nb);\n int sz = 1 << nb;\n vector<int> fa(sz, 0), fb(sz, 0);\n for (int i = 0; i < sz; ++i) {\n if (i < a.size()) fa[i] = a[i];\n if (i < b.size()) fb[i] = b[i];\n }\n ntt(fa, sz);\n ntt(fb, sz);\n for (int i = 0; i < sz; ++i) fa[i] = mul(fa[i], fb[i]);\n ntt(fa, sz, 1);\n vector<T> res(need);\n for (int i = 0; i < need; ++i) res[i] = fa[i];\n mint x = 0;\n for (auto p : res) x += p;\n cout << x << endl;\n x = 0;\n for (auto p : a) x += p;\n cout << x << endl;\n x = 0;\n for (auto p : b) x += p;\n cout << x << endl;\n return res;\n }\n};\n\ntemplate <int mod>\nstruct NumberTheoreticTransform {\n vector<int> rev, rts;\n int base, max_base, root;\n\n NumberTheoreticTransform() : base(1), rev{0, 1}, rts{0, 1} {\n assert(mod >= 3 && mod % 2 == 1);\n auto tmp = mod - 1;\n max_base = 0;\n while (tmp % 2 == 0) tmp >>= 1, max_base++;\n root = 2;\n while (mod_pow(root, (mod - 1) >> 1) == 1) ++root;\n assert(mod_pow(root, mod - 1) == 1);\n root = mod_pow(root, (mod - 1) >> max_base);\n }\n\n inline int mod_pow(int x, int n) {\n int ret = 1;\n while (n > 0) {\n if (n & 1) ret = mul(ret, x);\n x = mul(x, x);\n n >>= 1;\n }\n return ret;\n }\n\n inline int inverse(int x) { return mod_pow(x, mod - 2); }\n\n inline unsigned add(unsigned x, unsigned y) {\n x += y;\n if (x >= mod) x -= mod;\n return x;\n }\n\n inline unsigned mul(unsigned a, unsigned b) {\n return 1ull * a * b % (unsigned long long)mod;\n }\n\n void ensure_base(int nbase) {\n if (nbase <= base) return;\n rev.resize(1 << nbase);\n rts.resize(1 << nbase);\n for (int i = 0; i < (1 << nbase); i++) {\n rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));\n }\n assert(nbase <= max_base);\n while (base < nbase) {\n int z = mod_pow(root, 1 << (max_base - 1 - base));\n for (int i = 1 << (base - 1); i < (1 << base); i++) {\n rts[i << 1] = rts[i];\n rts[(i << 1) + 1] = mul(rts[i], z);\n }\n ++base;\n }\n }\n\n void ntt(vector<int> &a) {\n const int n = (int)a.size();\n assert((n & (n - 1)) == 0);\n int zeros = __builtin_ctz(n);\n ensure_base(zeros);\n int shift = base - zeros;\n for (int i = 0; i < n; i++) {\n if (i < (rev[i] >> shift)) {\n swap(a[i], a[rev[i] >> shift]);\n }\n }\n for (int k = 1; k < n; k <<= 1) {\n for (int i = 0; i < n; i += 2 * k) {\n for (int j = 0; j < k; j++) {\n int z = mul(a[i + j + k], rts[j + k]);\n a[i + j + k] = add(a[i + j], mod - z);\n a[i + j] = add(a[i + j], z);\n }\n }\n }\n }\n\n vector<int> multiply(vector<int> a, vector<int> b) {\n int need = a.size() + b.size() - 1;\n int nbase = 1;\n while ((1 << nbase) < need) nbase++;\n ensure_base(nbase);\n int sz = 1 << nbase;\n a.resize(sz, 0);\n b.resize(sz, 0);\n ntt(a);\n ntt(b);\n int inv_sz = inverse(sz);\n for (int i = 0; i < sz; i++) {\n a[i] = mul(a[i], mul(b[i], inv_sz));\n }\n reverse(a.begin() + 1, a.end());\n ntt(a);\n a.resize(need);\n return a;\n }\n};\n\nint n, l, m, d;\nvector<int> t, x, p;\nvector<mint> sum;\nNTT ntt;\n\nmint solve();\n\nint main() {\n cin >> n >> l;\n t.resize(n);\n for (auto &i : t) cin >> i;\n cin >> m >> d;\n x.resize(m);\n p.resize(m);\n for (int i = 0; i < m; ++i) cin >> x[i] >> p[i];\n x.push_back(l);\n cout << solve() << endl;\n return 0;\n}\n\nmint solve() {\n { // pre\n queue<vector<int>> qu;\n for (int i = 0; i < m; ++i) {\n int len = x[i + 1] - x[i];\n vector<int> v(2 * len + 1, 0);\n mint np = mint(p[i]) / 100, revp = -np + 1;\n v[0] = v[2 * len] = (np * revp).x;\n v[len] = mint(1 - 2 * v[0]).x;\n qu.push(v);\n }\n NumberTheoreticTransform<998244353> ntt2;\n while (qu.size() > 1) {\n auto lv = qu.front();\n qu.pop();\n auto rv = qu.front();\n qu.pop();\n auto v = ntt2.multiply(lv, rv);\n qu.push(v);\n }\n auto v = qu.front();\n int len = v.size();\n sum.resize(len);\n for (int i = 0; i < len; ++i) {\n sum[i] = v[i];\n if (i) sum[i] += sum[i - 1];\n }\n }\n mint res = n;\n for (int i = 1; i < n; ++i) {\n long long time = 1LL * (t[i] - t[0]) * l + 2LL * d * (l - x[0]);\n if (time >= 0) res -= sum[time / (2 * d)];\n }\n return res;\n}","accuracy":0.075,"time_ms":320,"memory_kb":13560,"score_of_the_acc":-0.1124,"final_rank":16},{"submission_id":"aoj_3182_4906211","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\ntemplate< int mod >\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n\n friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) += rhs;\n }\n friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) -= rhs;\n }\n friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) *= rhs;\n }\n friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) {\n return ModInt(lhs) /= rhs;\n }\n\n bool operator==(const ModInt &p) const { return x == p.x; }\n\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\nusing modint = ModInt< MOD9 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}\n//using modint=ld;\ntemplate< typename Mint >\nstruct NumberTheoreticTransformFriendlyModInt {\n\n vector< Mint > dw, idw;\n int max_base;\n Mint root;\n\n NumberTheoreticTransformFriendlyModInt() {\n const unsigned mod = Mint::get_mod();\n assert(mod >= 3 && mod % 2 == 1);\n auto tmp = mod - 1;\n max_base = 0;\n while(tmp % 2 == 0) tmp >>= 1, max_base++;\n root = 2;\n while(root.pow((mod - 1) >> 1) == 1) root += 1;\n assert(root.pow(mod - 1) == 1);\n dw.resize(max_base);\n idw.resize(max_base);\n for(int i = 0; i < max_base; i++) {\n dw[i] = -root.pow((mod - 1) >> (i + 2));\n idw[i] = Mint(1) / dw[i];\n }\n }\n\n void ntt(vector< Mint > &a) {\n const int n = (int) a.size();\n assert((n & (n - 1)) == 0);\n assert(__builtin_ctz(n) <= max_base);\n for(int m = n; m >>= 1;) {\n Mint w = 1;\n for(int s = 0, k = 0; s < n; s += 2 * m) {\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\n auto x = a[i], y = a[j] * w;\n a[i] = x + y, a[j] = x - y;\n }\n w *= dw[__builtin_ctz(++k)];\n }\n }\n }\n\n void intt(vector< Mint > &a, bool f = true) {\n const int n = (int) a.size();\n assert((n & (n - 1)) == 0);\n assert(__builtin_ctz(n) <= max_base);\n for(int m = 1; m < n; m *= 2) {\n Mint w = 1;\n for(int s = 0, k = 0; s < n; s += 2 * m) {\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\n auto x = a[i], y = a[j];\n a[i] = x + y, a[j] = (x - y) * w;\n }\n w *= idw[__builtin_ctz(++k)];\n }\n }\n if(f) {\n Mint inv_sz = Mint(1) / n;\n for(int i = 0; i < n; i++) a[i] *= inv_sz;\n }\n }\n\n vector< Mint > multiply(vector< Mint > a, vector< Mint > b) {\n int need = a.size() + b.size() - 1;\n int nbase = 1;\n while((1 << nbase) < need) nbase++;\n int sz = 1 << nbase;\n a.resize(sz, 0);\n b.resize(sz, 0);\n ntt(a);\n ntt(b);\n Mint inv_sz = Mint(1) / sz;\n for(int i = 0; i < sz; i++) a[i] *= b[i] * inv_sz;\n intt(a, false);\n a.resize(need);\n return a;\n }\n};\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n ll n,l;cin>>n>>l;\n vector<ll>t(n);\n rep(i,0,n)cin>>t[i];\n ll m,d;cin>>m>>d;\n vector<ll>x(m),p(m);\n rep(i,0,m)cin>>x[i]>>p[i];\n x.PB(l);\n vector<vector<modint>>f(m);\n ll geta=0;\n queue<ll>que;\n rep(i,0,m){\n modint prob=(modint)p[i]/100;\n ll sz=x[i+1]-x[i];\n f[i].assign(4*sz+1,0);\n geta+=2*sz;\n f[i][0]=(1-prob)*prob;\n f[i][2*sz]=prob*prob+(1-prob)*(1-prob);\n f[i][4*sz]=(1-prob)*prob;\n que.push(i);\n }\n NumberTheoreticTransformFriendlyModInt<modint>ntt;\n while(que.size()>=2){\n auto l=que.front();que.pop();\n auto r=que.front();que.pop();\n f[l]=ntt.multiply(f[l],f[r]);\n //debug(f[l],f[l].size());\n que.push(l);\n }\n ll r=que.front();\n vector<modint>fb(f[r].size()+1);\n rep(i,0,f[r].size())fb[i+1]=fb[i]+f[r][i];\n ll sz=f[r].size();\n //cout<<f[r][0]*4<<endl;\n //cout<<f<<endl;\n //debug(fb,sz+1);\n //debug(f[r],sz);\n modint ret=1;\n rep(i,1,n){\n ll dif=(t[0]-t[i])*l;\n if(dif>0)dif=(dif+d-1)/d;\n else dif/=d;\n //cout<<dif spa geta spa clamp(dif+geta,0LL,sz)<<endl;\n ret+=fb[clamp(dif+geta,0LL,sz)];\n }\n cout<<ret<<endl;\n return 0;\n}","accuracy":1,"time_ms":550,"memory_kb":65356,"score_of_the_acc":-1.3708,"final_rank":11},{"submission_id":"aoj_3182_4877008","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 2020000;\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\nconst double pi = acos(-1);\nconst double eps = 1e-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << \"debug: \" << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << \"debug: \" << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\n#define MOD 998244353\n#define root 3\n \nunsigned int add(const unsigned int x, const unsigned int y)\n{\n return (x + y < MOD) ? x + y : x + y - MOD;\n}\n \nunsigned int sub(const unsigned int x, const unsigned int y)\n{\n return (x >= y) ? (x - y) : (MOD - y + x);\n}\n \nunsigned int mul(const unsigned int x, const unsigned int y)\n{\n return (unsigned long long)x * y % MOD;\n}\n \nunsigned int mod_pow(unsigned int x, unsigned int n)\n{\n unsigned int res = 1;\n while(n > 0){\n if(n & 1){ res = mul(res, x); }\n x = mul(x, x);\n n >>= 1;\n }\n return res;\n}\n \nunsigned int inverse(const unsigned int x)\n{\n return mod_pow(x, MOD - 2);\n}\n \nvoid ntt(vector<int>& a, const bool rev = false)\n{\n unsigned int i, j, k, l, p, q, r, s;\n const unsigned int size = a.size();\n if(size == 1) return;\n vector<int> b(size);\n r = rev ? (MOD - 1 - (MOD - 1) / size) : (MOD - 1) / size;\n s = mod_pow(root, r);\n vector<unsigned int> kp(size / 2 + 1, 1);\n for(i = 0; i < size / 2; ++i) kp[i + 1] = mul(kp[i], s);\n for(i = 1, l = size / 2; i < size; i <<= 1, l >>= 1){\n for(j = 0, r = 0; j < l; ++j, r += i){\n for(k = 0, s = kp[i * j]; k < i; ++k){\n p = a[k + r], q = a[k + r + size / 2];\n b[k + 2 * r] = add(p, q);\n b[k + 2 * r + i] = mul(sub(p, q), s);\n }\n }\n swap(a, b);\n }\n if(rev){\n s = inverse(size);\n for(i = 0; i < size; i++){ a[i] = mul(a[i], s); }\n }\n}\n \nvector<int> convolute(const vector<int>& a, const vector<int>& b)\n{\n const int size = (int)a.size() + (int)b.size() - 1;\n int t = 1;\n while(t < size){ t <<= 1; }\n vector<int> A(t, 0), B(t, 0);\n for(int i = 0; i < (int)a.size(); i++){ A[i] = a[i]; }\n for(int i = 0; i < (int)b.size(); i++){ B[i] = b[i]; }\n ntt(A), ntt(B);\n for (int i = 0; i < t; i++){ A[i] = mul(A[i], B[i]); }\n ntt(A, true);\n A.resize(size);\n return A;\n}\n\nll modpow(ll x, ll n, ll mod){\n\tll res = 1;\n\twhile(n > 0){\n\t\tif(n & 1) res = res * x % mod;\n\t\tx = x * x % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nint main(){\n\tll n,L; cin >> n >> L;\n\tvector<int> t(n); rep(i,n) cin >> t[i];\n\tint m,d; cin >> m >> d;\n\tvector<int> x(m+1),p(m);\n\trep(i,m) cin >> x[i] >> p[i];\n\tx[m] = L;\n\tvector<vector<int>> v;\n\tint id = 0;\n\tpriority_queue<P,vector<P>,greater<P>> pq;\n\tint inv = modpow(100,mod-2,mod);\n\trep(i,m){\n\t\tll dist = x[i+1] - x[i];\n\t\tvector<int> vec(dist+1,0);\n\t\tpq.emplace(dist+1,id);\n\t\tvec[0] = (ll)p[i] * inv % mod;\n\t\tvec[dist] = (1 - (ll)p[i] * inv % mod + mod) % mod;\n\t\tv.push_back(vec);\n\t\tid++;\n\t}\n\twhile(pq.size() > 1){\n\t\tint w = pq.top().second; pq.pop();\n\t\tint y = pq.top().second; pq.pop();\n\t\tv[y] = convolute(v[w], v[y]);\n\t\tpq.emplace(v[y].size(), y);\n\t}\n\tint z = pq.top().second;\n\tauto b = v[z];\n\treverse(all(b));\n\tauto c = convolute(v[z], b);\n\tvector<int> acc(2*L+1, 0);\n\trep(i,c.size()) acc[i+1] = (acc[i] + c[i]) % mod;\n\tfor(int i=c.size(); i<2*L; i++) acc[i+1] = acc[i];\n\tll ans = 1;\n\tREP(i,1,n){\n\t\tll lim;\n\t\tif(t[0] > t[i]){\n\t\t\tlim = (L * (t[0] - t[i]) + 2*d - 1) / (2*d);\n\t\t}else{\n\t\t\tlim = (L * (t[0] - t[i])) / (2*d);\n\t\t}\n\t\tans += acc[min(2*L,max(0LL,lim+L-x[0]))];\n\t}\n\tans %= mod;\n\tcout << ans << \"\\n\";\n}","accuracy":1,"time_ms":440,"memory_kb":27452,"score_of_the_acc":-0.5154,"final_rank":9},{"submission_id":"aoj_3182_4877007","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 2020000;\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\nconst double pi = acos(-1);\nconst double eps = 1e-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << \"debug: \" << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << \"debug: \" << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\n#define MOD 998244353\n#define root 3\n \nunsigned int add(const unsigned int x, const unsigned int y)\n{\n return (x + y < MOD) ? x + y : x + y - MOD;\n}\n \nunsigned int sub(const unsigned int x, const unsigned int y)\n{\n return (x >= y) ? (x - y) : (MOD - y + x);\n}\n \nunsigned int mul(const unsigned int x, const unsigned int y)\n{\n return (unsigned long long)x * y % MOD;\n}\n \nunsigned int mod_pow(unsigned int x, unsigned int n)\n{\n unsigned int res = 1;\n while(n > 0){\n if(n & 1){ res = mul(res, x); }\n x = mul(x, x);\n n >>= 1;\n }\n return res;\n}\n \nunsigned int inverse(const unsigned int x)\n{\n return mod_pow(x, MOD - 2);\n}\n \nvoid ntt(vector<int>& a, const bool rev = false)\n{\n unsigned int i, j, k, l, p, q, r, s;\n const unsigned int size = a.size();\n if(size == 1) return;\n vector<int> b(size);\n r = rev ? (MOD - 1 - (MOD - 1) / size) : (MOD - 1) / size;\n s = mod_pow(root, r);\n vector<unsigned int> kp(size / 2 + 1, 1);\n for(i = 0; i < size / 2; ++i) kp[i + 1] = mul(kp[i], s);\n for(i = 1, l = size / 2; i < size; i <<= 1, l >>= 1){\n for(j = 0, r = 0; j < l; ++j, r += i){\n for(k = 0, s = kp[i * j]; k < i; ++k){\n p = a[k + r], q = a[k + r + size / 2];\n b[k + 2 * r] = add(p, q);\n b[k + 2 * r + i] = mul(sub(p, q), s);\n }\n }\n swap(a, b);\n }\n if(rev){\n s = inverse(size);\n for(i = 0; i < size; i++){ a[i] = mul(a[i], s); }\n }\n}\n \nvector<int> convolute(const vector<int>& a, const vector<int>& b)\n{\n const int size = (int)a.size() + (int)b.size() - 1;\n int t = 1;\n while(t < size){ t <<= 1; }\n vector<int> A(t, 0), B(t, 0);\n for(int i = 0; i < (int)a.size(); i++){ A[i] = a[i]; }\n for(int i = 0; i < (int)b.size(); i++){ B[i] = b[i]; }\n ntt(A), ntt(B);\n for (int i = 0; i < t; i++){ A[i] = mul(A[i], B[i]); }\n ntt(A, true);\n A.resize(size);\n return A;\n}\n\nll modpow(ll x, ll n, ll mod){\n\tll res = 1;\n\twhile(n > 0){\n\t\tif(n & 1) res = res * x % mod;\n\t\tx = x * x % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nint main(){\n\tint n,L; cin >> n >> L;\n\tvector<int> t(n); rep(i,n) cin >> t[i];\n\tint m,d; cin >> m >> d;\n\tvector<int> x(m+1),p(m);\n\trep(i,m) cin >> x[i] >> p[i];\n\tx[m] = L;\n\tvector<vector<int>> v;\n\tint id = 0;\n\tpriority_queue<P,vector<P>,greater<P>> pq;\n\tint inv = modpow(100,mod-2,mod);\n\trep(i,m){\n\t\tll dist = x[i+1] - x[i];\n\t\tvector<int> vec(dist+1,0);\n\t\tpq.emplace(dist+1,id);\n\t\tvec[0] = (ll)p[i] * inv % mod;\n\t\tvec[dist] = (1 - (ll)p[i] * inv % mod + mod) % mod;\n\t\tv.push_back(vec);\n\t\tid++;\n\t}\n\twhile(pq.size() > 1){\n\t\tint w = pq.top().second; pq.pop();\n\t\tint y = pq.top().second; pq.pop();\n\t\tv[y] = convolute(v[w], v[y]);\n\t\tpq.emplace(v[y].size(), y);\n\t}\n\tint z = pq.top().second;\n\tauto b = v[z];\n\treverse(all(b));\n\tauto c = convolute(v[z], b);\n\tvector<int> acc(2*L+1, 0);\n\trep(i,c.size()) acc[i+1] = (acc[i] + c[i]) % mod;\n\tfor(int i=c.size(); i<2*L; i++) acc[i+1] = acc[i];\n\tll ans = 1;\n\tREP(i,1,n){\n\t\tint lim;\n\t\tif(t[0] > t[i]){\n\t\t\tlim = ((ll)L * (t[0] - t[i]) + 2*d - 1) / (2*d);\n\t\t}else{\n\t\t\tlim = ((ll)L * (t[0] - t[i])) / (2*d);\n\t\t}\n\t\tans += (mod + acc[min(2*L,max(0,lim+L-x[0]))]) % mod;\n\t\tans %= mod;\n\t}\n\tcout << ans << \"\\n\";\n}","accuracy":0.6,"time_ms":400,"memory_kb":27444,"score_of_the_acc":-0.4703,"final_rank":14},{"submission_id":"aoj_3182_4877002","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 2020000;\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\nconst double pi = acos(-1);\nconst double eps = 1e-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << \"debug: \" << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << \"debug: \" << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\n#define MOD 998244353\n#define root 3\n \nunsigned int add(const unsigned int x, const unsigned int y)\n{\n return (x + y < MOD) ? x + y : x + y - MOD;\n}\n \nunsigned int sub(const unsigned int x, const unsigned int y)\n{\n return (x >= y) ? (x - y) : (MOD - y + x);\n}\n \nunsigned int mul(const unsigned int x, const unsigned int y)\n{\n return (unsigned long long)x * y % MOD;\n}\n \nunsigned int mod_pow(unsigned int x, unsigned int n)\n{\n unsigned int res = 1;\n while(n > 0){\n if(n & 1){ res = mul(res, x); }\n x = mul(x, x);\n n >>= 1;\n }\n return res;\n}\n \nunsigned int inverse(const unsigned int x)\n{\n return mod_pow(x, MOD - 2);\n}\n \nvoid ntt(vector<int>& a, const bool rev = false)\n{\n unsigned int i, j, k, l, p, q, r, s;\n const unsigned int size = a.size();\n if(size == 1) return;\n vector<int> b(size);\n r = rev ? (MOD - 1 - (MOD - 1) / size) : (MOD - 1) / size;\n s = mod_pow(root, r);\n vector<unsigned int> kp(size / 2 + 1, 1);\n for(i = 0; i < size / 2; ++i) kp[i + 1] = mul(kp[i], s);\n for(i = 1, l = size / 2; i < size; i <<= 1, l >>= 1){\n for(j = 0, r = 0; j < l; ++j, r += i){\n for(k = 0, s = kp[i * j]; k < i; ++k){\n p = a[k + r], q = a[k + r + size / 2];\n b[k + 2 * r] = add(p, q);\n b[k + 2 * r + i] = mul(sub(p, q), s);\n }\n }\n swap(a, b);\n }\n if(rev){\n s = inverse(size);\n for(i = 0; i < size; i++){ a[i] = mul(a[i], s); }\n }\n}\n \nvector<int> convolute(const vector<int>& a, const vector<int>& b)\n{\n const int size = (int)a.size() + (int)b.size() - 1;\n int t = 1;\n while(t < size){ t <<= 1; }\n vector<int> A(t, 0), B(t, 0);\n for(int i = 0; i < (int)a.size(); i++){ A[i] = a[i]; }\n for(int i = 0; i < (int)b.size(); i++){ B[i] = b[i]; }\n ntt(A), ntt(B);\n for (int i = 0; i < t; i++){ A[i] = mul(A[i], B[i]); }\n ntt(A, true);\n A.resize(size);\n return A;\n}\n\nll modpow(ll x, ll n, ll mod){\n\tll res = 1;\n\twhile(n > 0){\n\t\tif(n & 1) res = res * x % mod;\n\t\tx = x * x % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nint main(){\n\tint n,L; cin >> n >> L;\n\tvector<int> t(n); rep(i,n) cin >> t[i];\n\tint m,d; cin >> m >> d;\n\tvector<int> x(m+1),p(m);\n\trep(i,m) cin >> x[i] >> p[i];\n\tx[m] = L;\n\tvector<vector<int>> v;\n\tint id = 0;\n\tpriority_queue<P,vector<P>,greater<P>> pq;\n\tint inv = modpow(100,mod-2,mod);\n\trep(i,m){\n\t\tll dist = x[i+1] - x[i];\n\t\tvector<int> vec(dist+1,0);\n\t\tpq.emplace(dist+1,id);\n\t\tvec[0] = (ll)p[i] * inv % mod;\n\t\tvec[dist] = (1 - (ll)p[i] * inv % mod + mod) % mod;\n\t\tv.push_back(vec);\n\t\tid++;\n\t}\n\twhile(pq.size() > 1){\n\t\tint w = pq.top().second; pq.pop();\n\t\tint y = pq.top().second; pq.pop();\n\t\tv[y] = convolute(v[w], v[y]);\n\t\tpq.emplace(v[y].size(), y);\n\t}\n\tint z = pq.top().second;\n\tauto b = v[z];\n\treverse(all(b));\n\tauto c = convolute(v[z], b);\n\tvector<int> acc(2*L+1, 0);\n\trep(i,c.size()) acc[i+1] = (acc[i] + c[i]) % mod;\n\tfor(int i=c.size(); i<2*L; i++) acc[i+1] = acc[i];\n\tll ans = 1;\n\tREP(i,1,n){\n\t\tint lim;\n\t\tif(t[0] > t[i]){\n\t\t\tlim = (L * (t[0] - t[i]) + 2*d - 1) / (2*d);\n\t\t}else{\n\t\t\tlim = (L * (t[0] - t[i])) / (2*d);\n\t\t}\n\t\tans += (mod + acc[min(2*L,max(0,lim+L-x[0]))]) % mod;\n\t\tans %= mod;\n\t}\n\tcout << ans << \"\\n\";\n}","accuracy":0.125,"time_ms":400,"memory_kb":27360,"score_of_the_acc":-0.4687,"final_rank":15},{"submission_id":"aoj_3182_4868134","code_snippet":"#include <bits/stdc++.h>\n//#include <chrono>\n//#pragma GCC optimize(\"Ofast\")\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\n#define Rrep(i,n) Rreps(i,n,0)\n#define ALL(a) a.begin(), a.end()\n#define fi first\n#define se second\n\nusing ll = long long;\nusing vec = vector<ll>;\nusing mat = vector<vec>;\n\nll N,M,H,W,Q,K,A,B;\nstring S;\ntypedef pair<ll, ll> P;\nconst ll INF = (1LL<<58);\n\ntemplate<class T> bool chmin(T &a, const T &b){\n if(a > b) {a = b; return true;}\n else return false;\n}\ntemplate<class T> bool chmax(T &a, const T &b){\n if(a < b) {a = b; return true;}\n else return false;\n}\n\ntemplate <unsigned long long mod > class modint{\npublic:\n ll x;\n constexpr modint(){x = 0;}\n constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}\n constexpr void set_raw(ll _x){\n //_x in [0, mod)\n x = _x;\n }\n constexpr modint operator-(){\n return x == 0 ? 0 : mod - x;\n }\n constexpr modint& operator+=(const modint& a){\n if((x += a.x) >= mod) x -= mod;\n return *this;\n }\n constexpr modint operator+(const modint& a) const{\n return modint(*this) += a;\n }\n constexpr modint& operator-=(const modint& a){\n if((x -= a.x) < 0) x += mod;\n return *this;\n }\n constexpr modint operator-(const modint& a) const{\n return modint(*this) -= a;\n }\n constexpr modint& operator*=(const modint& a){\n (x *= a.x)%=mod;\n return *this;\n }\n constexpr modint operator*(const modint& a) const{\n return modint(*this) *= a;\n }\n constexpr modint pow(unsigned long long pw) const{\n modint res(1), comp(*this);\n while(pw){\n if(pw&1) res *= comp;\n comp *= comp;\n pw >>= 1;\n }\n return res;\n }\n //以下、modが素数のときのみ\n constexpr modint inv() const{\n return modint(*this).pow(mod - 2);\n }\n constexpr modint& operator/=(const modint &a){\n (x *= a.inv().x)%=mod;\n return *this;\n }\n constexpr modint operator/(const modint &a) const{\n return modint(*this) /= a;\n }\n};\n#define mod1 998244353\nusing mint = modint<mod1>;\n\nostream& operator<<(ostream& os, const mint& a){\n os << a.x;\n return os;\n}\nusing vm = vector<mint>;\nclass NTT{\n const int root;\n\n void make_root_pow(int n, vm &root_pow){\n root_pow.resize(n + 1);\n mint new_root = mint(root).pow((mod1 - 1) / n);\n root_pow[0].x = 1;\n rep(i,n){\n root_pow[i + 1] = root_pow[i] * new_root;\n }\n }\n static void make_bit_reverse(int n, vector<int> &v){\n v.resize(n);\n iota(ALL(v), 0);\n for(int i = 1; (1<<i) <= n; ++i){\n int l = 1<<(i - 1), r = 1<<i;\n int plus = n >> i;\n for(int j = l; j < r; ++j){\n int temp = v[j - l] + plus;\n if(j < temp) swap(v[j], v[temp]);\n }\n }\n }\n static void dft(int n, vm &f, bool inv, vm &root_pow, vector<int> &id){\n vm g(n);\n rep(i,n) g[i] = f[id[i]];\n swap(f, g);\n for(int l = n / 2, len = 1; l >= 1; l /= 2, len *= 2){\n for(int i = 0; i < n; i += len * 2){\n rep(j, len){\n mint z_f = (inv ? root_pow[n - l * j] : root_pow[l * j]) * f[i + len + j];\n g[i + j] = f[i + j] + z_f;\n g[i + len + j] = f[i + j] - z_f;\n }\n }\n swap(f, g);\n }\n if(inv) {\n mint n_inv = mint(n).inv();\n rep(i, n) f[i] *= n_inv;\n }\n }\npublic:\n NTT(int _x = 3) : root(_x){}\n vm convolution(vm &a, vm &b, int size_a = INT_MAX, int size_b = INT_MAX){\n chmin(size_a, (int)a.size());\n chmin(size_b, (int)b.size());\n int sz = size_a + size_b - 1, n = 1;\n while(sz > n) n *= 2;\n vm g(n), h(n), root_pow, gh(n);\n vector<int> id;\n copy(a.begin(), a.begin() + size_a, g.begin());\n copy(b.begin(), b.begin() + size_b, h.begin());\n make_root_pow(n, root_pow);\n make_bit_reverse(n, id);\n dft(n, g, false, root_pow, id);\n dft(n, h, false, root_pow, id);\n rep(i, n) gh[i] = g[i] * h[i];\n dft(n, gh, true, root_pow, id);\n gh.resize(sz);\n return gh;\n }\n};\n\nvm polynomial_product(vector<vm> &polys){\n //time complexity : O(N log^2 N) (N : sum of polys[i].size())\n struct _cmp{\n int sz;\n vm a;\n _cmp(int _sz, vm _a) : sz(_sz), a(_a){}\n bool operator > (const _cmp &b){ return sz > b.sz;}\n };\n priority_queue<_cmp, vector<_cmp>, greater<> > pque;\n for(vm &a : polys) pque.emplace((int)a.size(), a);\n NTT ntt;\n while(pque.size() > 1){\n _cmp c = pque.top(); pque.pop();\n _cmp d = pque.top(); pque.pop();\n vm res = ntt.convolution(c.a, d.a);\n pque.emplace(res.size(), res);\n }\n return pque.top().a;\n}\n\nint main() {\n ll L, D;\n cin>>N>>L;\n vec t(N);\n rep(i, N) cin>>t[i];\n cin>>M>>D;\n vec x(M), p(M);\n rep(i, M) cin>>x[i]>>p[i];\n x.push_back(L);\n vector<vm> polys(0);\n rep(i, M){\n int d = x[i+1] - x[i];\n vm temp(d + 1);\n temp[d] = mint(p[i]) / 100;\n temp[0] = mint(1) - temp[d];\n polys.push_back(temp);\n }\n vm plus = polynomial_product(polys), plus_rev(plus);\n reverse(ALL(plus_rev));\n NTT ntt;\n vm diff = ntt.convolution(plus, plus_rev);\n ll n = (L - x[0]) * 2;\n rep(i, n) diff[i + 1] += diff[i];\n if(diff[n].x != 1) cout<<diff[n]<<endl;\n mint res(N);\n reps(i, 1, N){\n ll base_adv = L * (t[i] - t[0]);\n if(n * D <= base_adv) res -= 1;\n else if(base_adv >= - n * D) res -= diff[(base_adv + n * D) / (D * 2)];\n }\n cout<<res<<endl;\n}","accuracy":1,"time_ms":350,"memory_kb":23548,"score_of_the_acc":-0.3389,"final_rank":6},{"submission_id":"aoj_3182_4868117","code_snippet":"#include <bits/stdc++.h>\n//#include <chrono>\n//#pragma GCC optimize(\"Ofast\")\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\n#define Rrep(i,n) Rreps(i,n,0)\n#define ALL(a) a.begin(), a.end()\n#define fi first\n#define se second\n\nusing ll = long long;\nusing vec = vector<ll>;\nusing mat = vector<vec>;\n\nll N,M,H,W,Q,K,A,B;\nstring S;\ntypedef pair<ll, ll> P;\nconst ll INF = (1LL<<58);\n\ntemplate<class T> bool chmin(T &a, const T &b){\n if(a > b) {a = b; return true;}\n else return false;\n}\ntemplate<class T> bool chmax(T &a, const T &b){\n if(a < b) {a = b; return true;}\n else return false;\n}\n\ntemplate <unsigned long long mod > class modint{\npublic:\n ll x;\n constexpr modint(){x = 0;}\n constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}\n constexpr void set_raw(ll _x){\n //_x in [0, mod)\n x = _x;\n }\n constexpr modint operator-(){\n return x == 0 ? 0 : mod - x;\n }\n constexpr modint& operator+=(const modint& a){\n if((x += a.x) >= mod) x -= mod;\n return *this;\n }\n constexpr modint operator+(const modint& a) const{\n return modint(*this) += a;\n }\n constexpr modint& operator-=(const modint& a){\n if((x -= a.x) < 0) x += mod;\n return *this;\n }\n constexpr modint operator-(const modint& a) const{\n return modint(*this) -= a;\n }\n constexpr modint& operator*=(const modint& a){\n (x *= a.x)%=mod;\n return *this;\n }\n constexpr modint operator*(const modint& a) const{\n return modint(*this) *= a;\n }\n constexpr modint pow(unsigned long long pw) const{\n modint res(1), comp(*this);\n while(pw){\n if(pw&1) res *= comp;\n comp *= comp;\n pw >>= 1;\n }\n return res;\n }\n //以下、modが素数のときのみ\n constexpr modint inv() const{\n return modint(*this).pow(mod - 2);\n }\n constexpr modint& operator/=(const modint &a){\n (x *= a.inv().x)%=mod;\n return *this;\n }\n constexpr modint operator/(const modint &a) const{\n return modint(*this) /= a;\n }\n};\n#define mod1 998244353\nusing mint = modint<mod1>;\n\nostream& operator<<(ostream& os, const mint& a){\n os << a.x;\n return os;\n}\nusing vm = vector<mint>;\nclass NTT{\n const int root;\n\n void make_root_pow(int n, vm &root_pow){\n root_pow.resize(n + 1);\n mint new_root = mint(root).pow((mod1 - 1) / n);\n root_pow[0].x = 1;\n rep(i,n){\n root_pow[i + 1] = root_pow[i] * new_root;\n }\n }\n static void make_bit_reverse(int n, vector<int> &v){\n v.resize(n);\n iota(ALL(v), 0);\n for(int i = 1; (1<<i) <= n; ++i){\n int l = 1<<(i - 1), r = 1<<i;\n int plus = n >> i;\n for(int j = l; j < r; ++j){\n int temp = v[j - l] + plus;\n if(j < temp) swap(v[j], v[temp]);\n }\n }\n }\n static void dft(int n, vm &f, bool inv, vm &root_pow, vector<int> &id){\n vm g(n);\n rep(i,n) g[i] = f[id[i]];\n swap(f, g);\n for(int l = n / 2, len = 1; l >= 1; l /= 2, len *= 2){\n for(int i = 0; i < n; i += len * 2){\n rep(j, len){\n mint z_f = (inv ? root_pow[n - l * j] : root_pow[l * j]) * f[i + len + j];\n g[i + j] = f[i + j] + z_f;\n g[i + len + j] = f[i + j] - z_f;\n }\n }\n swap(f, g);\n }\n if(inv) {\n mint n_inv = mint(n).inv();\n rep(i, n) f[i] *= n_inv;\n }\n }\npublic:\n NTT(int _x = 3) : root(_x){}\n vm convolution(vm &a, vm &b, int size_a = INT_MAX, int size_b = INT_MAX){\n chmin(size_a, (int)a.size());\n chmin(size_b, (int)b.size());\n int sz = size_a + size_b - 1, n = 1;\n while(sz > n) n *= 2;\n vm g(n), h(n), root_pow, gh(n);\n vector<int> id;\n copy(a.begin(), a.begin() + size_a, g.begin());\n copy(b.begin(), b.begin() + size_b, h.begin());\n make_root_pow(n, root_pow);\n make_bit_reverse(n, id);\n dft(n, g, false, root_pow, id);\n dft(n, h, false, root_pow, id);\n rep(i, n) gh[i] = g[i] * h[i];\n dft(n, gh, true, root_pow, id);\n gh.resize(sz);\n return gh;\n }\n};\n\nvm polynomial_product(vector<vm> polys){\n //time complexity : O(N log^2 N) (N : sum of polys[i].size())\n struct _cmp{\n int sz;\n vm a;\n _cmp(int _sz, vm _a) : sz(_sz), a(_a){}\n bool operator > (const _cmp &b){ return sz > b.sz;}\n };\n priority_queue<_cmp, vector<_cmp>, greater<> > pque;\n for(vm a : polys) pque.emplace((int)a.size(), a);\n NTT ntt;\n while(pque.size() > 1){\n _cmp c = pque.top(); pque.pop();\n _cmp d = pque.top(); pque.pop();\n vm res = ntt.convolution(c.a, d.a);\n pque.emplace(res.size(), res);\n }\n return pque.top().a;\n}\n\nint main() {\n ll L, D;\n cin>>N>>L;\n vec t(N);\n rep(i, N) cin>>t[i];\n cin>>M>>D;\n vec x(M), p(M);\n rep(i, M) cin>>x[i]>>p[i];\n x.push_back(L);\n vector<vm> polys(0);\n rep(i, M){\n int d = x[i+1] - x[i];\n vm temp(d + 1);\n temp[d] = mint(p[i]) / 100;\n temp[0] = mint(1) - temp[d];\n polys.push_back(temp);\n }\n vm plus = polynomial_product(polys), plus_rev(plus);\n reverse(ALL(plus_rev));\n NTT ntt;\n vm diff = ntt.convolution(plus, plus_rev);\n ll n = (L - x[0]) * 2;\n rep(i, n) diff[i + 1] += diff[i];\n if(diff[n].x != 1) cout<<diff[n]<<endl;\n mint res(N);\n reps(i, 1, N){\n ll base_adv = L * (t[i] - t[0]);\n if(n * D <= base_adv) res -= 1;\n else if(base_adv >= - n * D) res -= diff[(base_adv + n * D) / (D * 2)];\n }\n cout<<res<<endl;\n}","accuracy":1,"time_ms":350,"memory_kb":26124,"score_of_the_acc":-0.3886,"final_rank":7},{"submission_id":"aoj_3182_4858043","code_snippet":"#include<iostream>\n#include<vector>\n#include<set>\n#include<queue>\n#include<map>\n#include<algorithm>\n#include<cstring>\n#include<string>\n#include<cassert>\n#include<cmath>\n#include<climits>\n#include<iomanip>\n#include<stack>\n#include<unordered_map>\n#include<bitset>\n#include<limits>\n#include<complex>\n#include<array>\n#include<numeric>\n#include<functional>\n#include<random>\n\n\nusing namespace std;\n#define ll long long\n#define ull unsigned long long\n#define rep(i,m,n) for(ll (i)=(ll)(m);i<(ll)(n);i++)\n#define REP(i,n) rep(i,0,n)\n#define all(hoge) (hoge).begin(),(hoge).end()\ntypedef pair<ll, ll> P;\nconstexpr long double m_pi = 3.1415926535897932L;\nconstexpr ll MOD = 1000000007;\nconstexpr ll INF = 1LL << 61;\nconstexpr long double EPS = 1e-10;\ntemplate<typename T> using vector2 = vector<vector<T>>;\ntemplate<typename T> using vector3 = vector<vector2<T>>;\ntypedef vector<ll> Array;\ntypedef vector<Array> Matrix;\nstring operator*(const string& s, int k) {\n\tif (k == 0) return \"\";\n\tstring p = (s + s) * (k / 2);\n\tif (k % 2 == 1) p += s;\n\treturn p;\n}\n\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }\n\nstruct Edge {//グラフ\n\tint to, rev; ll cap;\n\tEdge(int _to, ll _cap, int _rev) {\n\t\tto = _to; cap = _cap; rev = _rev;\n\t}\n};\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\nvoid add_edge(Graph& G, int from, int to, ll cap, bool revFlag, ll revCap) {//最大フロー求める Ford-fulkerson\n\tG[from].push_back(Edge(to, cap, (ll)G[to].size() + (from == to)));\n\tif (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));//最小カットの場合逆辺は0にする\n}\n\nll max_flow_dfs(Graph& G, ll v, ll t, ll f, vector<bool>& used)\n{\n\tif (v == t)\n\t\treturn f;\n\tused[v] = true;\n\tfor (int i = 0; i < G[v].size(); ++i) {\n\t\tEdge& e = G[v][i];\n\t\tif (!used[e.to] && e.cap > 0) {\n\t\t\tll d = max_flow_dfs(G, e.to, t, min(f, e.cap), used);\n\t\t\tif (d > 0) {\n\t\t\t\te.cap -= d;\n\t\t\t\tG[e.to][e.rev].cap += d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n//二分グラフの最大マッチングを求めたりも出来る また二部グラフの最大独立集合は頂点数-最大マッチングのサイズ\nll max_flow(Graph& G, ll s, ll t)//O(V(V+E))\n{\n\tll flow = 0;\n\tfor (;;) {\n\t\tvector<bool> used(G.size());\n\t\tREP(i, used.size())used[i] = false;\n\t\tll f = max_flow_dfs(G, s, t, INF, used);\n\t\tif (f == 0) {\n\t\t\treturn flow;\n\t\t}\n\t\tflow += f;\n\t}\n}\n\nvoid BellmanFord(Graph& G, ll s, Array& d, Array& negative) {//O(|E||V|)\n\td.resize(G.size());\n\tnegative.resize(G.size());\n\tREP(i, d.size())d[i] = INF;\n\tREP(i, d.size())negative[i] = false;\n\td[s] = 0;\n\tREP(k, G.size() - 1) {\n\t\tREP(i, G.size()) {\n\t\t\tREP(j, G[i].size()) {\n\t\t\t\tif (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {\n\t\t\t\t\td[G[i][j].to] = d[i] + G[i][j].cap;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tREP(k, G.size() - 1) {\n\t\tREP(i, G.size()) {\n\t\t\tREP(j, G[i].size()) {\n\t\t\t\tif (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {\n\t\t\t\t\td[G[i][j].to] = d[i] + G[i][j].cap;\n\t\t\t\t\tnegative[G[i][j].to] = true;\n\t\t\t\t}\n\t\t\t\tif (negative[i] == true)negative[G[i][j].to] = true;\n\t\t\t}\n\t\t}\n\t}\n}\nvoid Dijkstra(Graph& G, ll s, Array& d) {//O(|E|log|V|)\n\td.resize(G.size());\n\tREP(i, d.size())d[i] = INF;\n\td[s] = 0;\n\tpriority_queue<P, vector<P>, greater<P>> q;\n\tq.push(make_pair(0, s));\n\twhile (!q.empty()) {\n\t\tP a = q.top();\n\t\tq.pop();\n\t\tif (d[a.second] < a.first)continue;\n\t\tREP(i, G[a.second].size()) {\n\t\t\tEdge e = G[a.second][i];\n\t\t\tif (d[e.to] > d[a.second] + e.cap) {\n\t\t\t\td[e.to] = d[a.second] + e.cap;\n\t\t\t\tq.push(make_pair(d[e.to], e.to));\n\t\t\t}\n\t\t}\n\t}\n}\nvoid WarshallFloyd(Graph& G, Matrix& d) {//O(V^3)\n\td.resize(G.size());\n\tREP(i, d.size())d[i].resize(G.size());\n\tREP(i, d.size()) {\n\t\tREP(j, d[i].size()) {\n\t\t\td[i][j] = ((i != j) ? INF : 0);\n\t\t}\n\t}\n\tREP(i, G.size()) {\n\t\tREP(j, G[i].size()) {\n\t\t\tchmin(d[i][G[i][j].to], G[i][j].cap);\n\t\t}\n\t}\n\tREP(i, G.size()) {\n\t\tREP(j, G.size()) {\n\t\t\tREP(k, G.size()) {\n\t\t\t\tif (d[j][i] != INF && d[i][k] != INF)chmin(d[j][k], d[j][i] + d[i][k]);\n\t\t\t}\n\t\t}\n\t}\n}\nbool tsort(Graph& graph, vector<int>& order) {//トポロジカルソートO(E+V)\n\tint n = graph.size(), k = 0;\n\tvector<int> in(n);\n\tfor (auto& es : graph)\n\t\tfor (auto& e : es)in[e.to]++;\n\tpriority_queue<int, vector<int>, greater<int>> que;\n\tREP(i, n)\n\t\tif (in[i] == 0)que.push(i);\n\twhile (que.size()) {\n\t\tint v = que.top();\n\t\tque.pop();\n\t\torder.push_back(v);\n\t\tfor (auto& e : graph[v])\n\t\t\tif (--in[e.to] == 0)que.push(e.to);\n\t}\n\tif (order.size() != n)return false;\n\telse return true;\n}\nclass Lca {\npublic:\n\tconst int n = 0;\n\tconst int log2_n = 0;\n\tstd::vector<std::vector<int>> parent;\n\tstd::vector<int> depth;\n\n\tLca() {}\n\n\tLca(const Graph& g, int root)\n\t\t: n(g.size()), log2_n(log2(n) + 1), parent(log2_n, std::vector<int>(n)), depth(n) {\n\t\tdfs(g, root, -1, 0);\n\t\tfor (int k = 0; k + 1 < log2_n; k++) {\n\t\t\tfor (int v = 0; v < (int)g.size(); v++) {\n\t\t\t\tif (parent[k][v] < 0)\n\t\t\t\t\tparent[k + 1][v] = -1;\n\t\t\t\telse\n\t\t\t\t\tparent[k + 1][v] = parent[k][parent[k][v]];\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid dfs(const Graph& g, int v, int p, int d) {\n\t\tparent[0][v] = p;\n\t\tdepth[v] = d;\n\t\tfor (auto& e : g[v]) {\n\t\t\tif (e.to != p) dfs(g, e.to, v, d + 1);\n\t\t}\n\t}\n\n\tint get(int u, int v) {\n\t\tif (depth[u] > depth[v]) std::swap(u, v);\n\t\tfor (int k = 0; k < log2_n; k++) {\n\t\t\tif ((depth[v] - depth[u]) >> k & 1) {\n\t\t\t\tv = parent[k][v];\n\t\t\t}\n\t\t}\n\t\tif (u == v) return u;\n\t\tfor (int k = log2_n - 1; k >= 0; k--) {\n\t\t\tif (parent[k][u] != parent[k][v]) {\n\t\t\t\tu = parent[k][u];\n\t\t\t\tv = parent[k][v];\n\t\t\t}\n\t\t}\n\t\treturn parent[0][u];\n\t}\n};\n\nclass UnionFind {\n\tvector<int> data;\n\tint n;\npublic:\n\tUnionFind(int size) : data(size, -1), n(size) { }\n\tbool merge(int x, int y) {//xとyの集合を統合する\n\t\tx = root(x); y = root(y);\n\t\tif (x != y) {\n\t\t\tif (data[y] < data[x]) swap(x, y);\n\t\t\tdata[x] += data[y]; data[y] = x;\n\t\t}\n\t\tn -= (x != y);\n\t\treturn x != y;\n\t}\n\tbool same(int x, int y) {//xとyが同じ集合か返す\n\t\treturn root(x) == root(y);\n\t}\n\tint root(int x) {//xのルートを返す\n\t\treturn data[x] < 0 ? x : data[x] = root(data[x]);\n\t}\n\tint size(int x) {//xの集合のサイズを返す\n\t\treturn -data[root(x)];\n\t}\n\tint num() {//集合の数を返す\n\t\treturn n;\n\t}\n};\n\ntemplate<typename T, typename F>\nclass SegmentTree {\nprivate:\n\tT identity;\n\tF merge;\n\tll n;\n\tvector<T> dat;\npublic:\n\tSegmentTree(F f, T id, vector<T> v) :merge(f), identity(id) {\n\t\tint _n = v.size();\n\t\tn = 1;\n\t\twhile (n < _n)n *= 2;\n\t\tdat.resize(2 * n - 1, identity);\n\t\tREP(i, _n)dat[n + i - 1] = v[i];\n\t\tfor (int i = n - 2; i >= 0; i--)dat[i] = merge(dat[i * 2 + 1], dat[i * 2 + 2]);\n\t}\n\tSegmentTree(F f, T id, int _n) :merge(f), identity(id) {\n\t\tn = 1;\n\t\twhile (n < _n)n *= 2;\n\t\tdat.resize(2 * n - 1, identity);\n\t}\n\tvoid set_val(int i, T x) {\n\t\ti += n - 1;\n\t\tdat[i] = x;\n\t\twhile (i > 0) {\n\t\t\ti = (i - 1) / 2;\n\t\t\tdat[i] = merge(dat[i * 2 + 1], dat[i * 2 + 2]);\n\t\t}\n\t}\n\tT query(int l, int r) {\n\t\tT left = identity, right = identity;\n\t\tl += n - 1; r += n - 1;\n\t\twhile (l < r) {\n\t\t\tif ((l & 1) == 0)left = merge(left, dat[l]);\n\t\t\tif ((r & 1) == 0)right = merge(dat[r - 1], right);\n\t\t\tl = l / 2;\n\t\t\tr = (r - 1) / 2;\n\t\t}\n\t\treturn merge(left, right);\n\t}\n};\n\ntemplate< typename T >\nclass FenwickTree {\n\tvector< T > data;\n\tint n;\n\tint p;\npublic:\n\tFenwickTree(int n) :n(n) {\n\t\tdata.resize(n + 1LL, 0);\n\t\tp = 1;\n\t\twhile (p < data.size())p *= 2;\n\t}\n\tT sum(int k) {\n\t\tT ret = 0;\n\t\tfor (; k > 0; k -= k & -k) ret += data[k];\n\t\treturn (ret);\n\t}\n\n\tT sum(int a, int b) { return sum(b) - sum(a); }//[a,b)\n\n\tvoid add(int k, T x) {\n\t\tfor (++k; k <= n; k += k & -k) data[k] += x;\n\t}\n\n\tint lower_bound(ll w) {\n\t\tif (w <= 0)return -1;\n\t\tint x = 0;\n\t\tfor (int k = p / 2; k > 0; k /= 2) {\n\t\t\tif (x + k <= n && data[x + k] < w)w -= data[x + k], x += k;\n\t\t}\n\t\treturn x;\n\t}\n};\n\n\n\n//約数求める //約数\nvoid divisor(ll n, vector<ll>& ret) {\n\tfor (ll i = 1; i * i <= n; i++) {\n\t\tif (n % i == 0) {\n\t\t\tret.push_back(i);\n\t\t\tif (i * i != n) ret.push_back(n / i);\n\t\t}\n\t}\n\tsort(ret.begin(), ret.end());\n}\n\nvoid prime_factorization(ll n, vector<P>& ret) {\n\tfor (ll i = 2; i * i <= n; i++) {\n\t\tif (n % i == 0) {\n\t\t\tret.push_back({ i,0 });\n\t\t\twhile (n % i == 0) {\n\t\t\t\tn /= i;\n\t\t\t\tret[ret.size() - 1].second++;\n\t\t\t}\n\t\t}\n\t}\n\tif (n != 1)ret.push_back({ n,1 });\n}\n\n\ninline ll mod_pow(ll x, ll n, ll mod) {\n\tll res = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) res = res * x % mod;\n\t\tx = x * x % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\ninline ll mod_inv(ll x, ll mod) {\n\treturn mod_pow(x, mod - 2, mod);\n}\n\nclass Combination {\npublic:\n\tArray fact;\n\tArray fact_inv;\n\tll mod;\n\t//if n >= mod use lucas \n\tll nCr(ll n, ll r) {\n\t\tif (n < r)return 0;\n\t\tif (n < mod)return ((fact[n] * fact_inv[r] % mod) * fact_inv[n - r]) % mod;\n\n\t\tll ret = 1;\n\t\twhile (n || r) {\n\t\t\tll _n = n % mod, _r = r % mod;\n\t\t\tn /= mod; r /= mod;\n\t\t\t(ret *= nCr(_n, _r)) %= mod;\n\t\t}\n\t\treturn ret;\n\t}\n\tll nPr(ll n, ll r) {\n\t\treturn (fact[n] * fact_inv[n - r]) % mod;\n\t}\n\tll nHr(ll n, ll r) {\n\t\treturn nCr(r + n - 1, r);\n\t}\n\tCombination(ll _n, ll _mod) {\n\t\tmod = _mod;\n\t\tll n = min(_n + 1, mod);\n\t\tfact.resize(n);\n\t\tfact[0] = 1;\n\t\tREP(i, n - 1) {\n\t\t\tfact[i + 1] = (fact[i] * (i + 1LL)) % mod;\n\t\t}\n\t\tfact_inv.resize(n);\n\t\tfact_inv[n - 1] = mod_inv(fact[n - 1], mod);\n\t\tfor (int i = n - 1; i > 0; i--) {\n\t\t\tfact_inv[i - 1] = fact_inv[i] * i % mod;\n\t\t}\n\t}\n};\n\nll popcount(ll x) {\n\tx = (x & 0x5555555555555555) + (x >> 1 & 0x5555555555555555);\n\tx = (x & 0x3333333333333333) + (x >> 2 & 0x3333333333333333);\n\tx = (x & 0x0F0F0F0F0F0F0F0F) + (x >> 4 & 0x0F0F0F0F0F0F0F0F);\n\tx = (x & 0x00FF00FF00FF00FF) + (x >> 8 & 0x00FF00FF00FF00FF);\n\tx = (x & 0x0000FFFF0000FFFF) + (x >> 16 & 0x0000FFFF0000FFFF);\n\tx = (x & 0x00000000FFFFFFFF) + (x >> 32 & 0x00000000FFFFFFFF);\n\n\treturn x;\n}\n\n\n\ntemplate<ll mod, ll root>//特殊な素数と原始根 998244353のとき3\nclass NTT {\nprivate:\n\ttemplate<typename T>\n\tinline void bit_reverse(vector<T>& a) {\n\t\tint n = a.size();\n\t\tint i = 0;\n\t\tfor (int j = 1; j < n - 1; ++j) {\n\t\t\tfor (int k = n >> 1; k > (i ^= k); k >>= 1);\n\t\t\tif (j < i) swap(a[i], a[j]);\n\t\t}\n\t}\n\tvoid _ntt(vector<long long>& a, int sign) {\n\t\tconst int n = a.size();\n\t\tassert((n ^ (n & -n)) == 0); //n = 2^k\n\n\t\tlong long tmp = (mod - 1) * mod_pow((ll)n, mod - 2, mod) % mod; // -1/n\n\t\tlong long h = mod_pow(root, tmp, mod); // ^n√g\n\t\tif (sign == -1) h = mod_pow(h, mod - 2, mod);\n\n\t\tbit_reverse(a);\n\n\t\tfor (ll m = 1; m < n; m <<= 1) {\n\t\t\tconst ll m2 = 2 * m;\n\t\t\tlong long _base = mod_pow((ll)h, (ll)(n / m2), mod);\n\t\t\tlong long _w = 1;\n\t\t\tfor (int x = 0; x < m; ++x) {//計算量わからない\n\t\t\t\tfor (ll s = x; s < n; s += m2) {\n\t\t\t\t\tlong long u = a[s];\n\t\t\t\t\tlong long d = (a[s + m] * _w) % mod;\n\t\t\t\t\ta[s] = (u + d) % mod;\n\t\t\t\t\ta[s + m] = (u - d + mod) % mod;\n\t\t\t\t}\n\t\t\t\t_w = (_w * _base) % mod;\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid ntt(vector<long long>& input) { _ntt(input, 1); }//フーリエ変換\n\n\tvoid intt(vector<long long>& input) {//フーリエ逆変換\n\t\t_ntt(input, -1);\n\t\tconst long long n_inv = mod_pow((ll)input.size(), mod - 2, mod);\n\t\tfor (auto& x : input) x = (x * n_inv) % mod;\n\t}\npublic:\n\t// 畳み込み演算を行う\n\tvector<long long> convolution(const vector<long long>& a, const vector<long long>& b) {\n\t\tint result_size = a.size() + b.size() - 1;\n\t\tint n = 1; while (n < result_size) n <<= 1;\n\n\t\tvector<long long> _a = a, _b = b;\n\t\t_a.resize(n, 0);\n\t\t_b.resize(n, 0);\n\n\t\tntt(_a);\n\t\tntt(_b);\n\t\tfor (int i = 0; i < n; ++i) _a[i] = (_a[i] * _b[i]) % mod;\n\t\tintt(_a);\n\n\t\t_a.resize(result_size);\n\t\treturn _a;\n\t}\n\tvector<long long> convolution(const vector<long long>& a, ll m, ll mx_sz) {//多項式に落とし込めるdpが解ける\n\t\tint result_size = mx_sz;\n\t\tint n = 1; while (n < result_size) n <<= 1;\n\n\t\tvector<long long> _a = a;\n\t\t_a.resize(n, 0);\n\n\t\tntt(_a);\n\t\tfor (int i = 0; i < n; ++i) _a[i] = mod_pow(_a[i], m, mod);\n\t\tintt(_a);\n\n\t\t_a.resize(result_size);\n\t\treturn _a;\n\t}\n};\n\nint main() {\n\tios::sync_with_stdio(false);\n\tstd::cin.tie(0);\n\tstd::cout.tie(0);\n\n\tconstexpr ll mod = 998244353;\n\tll n, l;\n\tcin >> n >> l;\n\tArray t(n);\n\tfor (auto& e : t)cin >> e;\n\tll m, d;\n\tcin >> m >> d;\n\tArray x(m), p(m);\n\tx.push_back(l);\n\tREP(i, m)cin >> x[i] >> p[i];\n\tdeque<Array> c;\n\tREP(i, m) {\n\t\tArray tmp(2 * (x[i + 1] - x[i]) + 1, 0);\n\t\ttmp[0] = p[i];\n\t\ttmp.back() = 100 - p[i];\n\t\tc.emplace_back(tmp);\n\t}\n\tNTT<998244353, 3> ntt;\n\twhile (c.size() > 1) {\n\t\tauto a = c.front();\n\t\tc.pop_front();\n\t\tauto b = c.front();\n\t\tc.pop_front();\n\t\tc.emplace_back(ntt.convolution(a, b));\n\t}\n\tArray u(4 * l + 4, 0), v(4 * l + 4, 0);\n\tu[2 * l + 1] = 1;\n\trep(i, 1, n) {\n\t\tll dif = (t[0] - t[i]) * l;\n\t\tif (dif >= 0) {\n\t\t\tdif = min((dif + d - 1) / d, 2 * l + 1);\n\t\t\tv[2 * l + 1 - dif]++;\n\t\t}\n\t\telse {\n\t\t\tdif *= -1;\n\t\t\tdif = min(dif / d + (dif%(2*d)==0?1:0), 2 * l + 1);\n\t\t\tv[2 * l + 1 + dif]++;\n\t\t}\n\t}\n\t//for (auto e : u)cout << e << \" \";\n\t//cout << endl;\n\t//for (auto e : v)cout << e << \" \";\n\t//cout << endl;\n\tu = ntt.convolution(u, c.front());\n\tv = ntt.convolution(v, c.front());\n\t//for (auto e : u)cout << e << \" \";\n\t//cout << endl;\n\t//for (auto e : v)cout << e << \" \";\n\t//cout << endl;\n\n\tll ans = 0;\n\tll total = accumulate(all(u), 0LL, [&](ll a, ll b) {return (a + b) % mod; });\n\tll now = 0;\n\tREP(i, u.size()) {\n\t\tif (u[i] != 0) (ans += (now * mod_inv(total, mod) % mod) % mod * u[i] % mod) %= mod;\n\t\t(now += v[i]) %= mod;\n\t}\n//\tcout << ans << \"\\n\";\n\tcout << (1 + ans * mod_inv(total, mod) % mod) % mod << \"\\n\";\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":1110,"memory_kb":46324,"score_of_the_acc":-1.6326,"final_rank":12},{"submission_id":"aoj_3182_4855205","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n// modint\ntemplate<int MOD> struct Fp {\n long long val;\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\n if (val < 0) val += MOD;\n }\n constexpr int getmod() const { return MOD; }\n constexpr Fp operator - () const noexcept {\n return val ? MOD - val : 0;\n }\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\n constexpr Fp& operator += (const Fp& r) noexcept {\n val += r.val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -= (const Fp& r) noexcept {\n val -= r.val;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp& operator *= (const Fp& r) noexcept {\n val = val * r.val % MOD;\n return *this;\n }\n constexpr Fp& operator /= (const Fp& r) noexcept {\n long long a = r.val, b = MOD, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b, swap(a, b);\n u -= t * v, swap(u, v);\n }\n val = val * u % MOD;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr bool operator == (const Fp& r) const noexcept {\n return this->val == r.val;\n }\n constexpr bool operator != (const Fp& r) const noexcept {\n return this->val != r.val;\n }\n constexpr bool operator < (const Fp& r) const noexcept {\n return this->val < r.val;\n }\n friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {\n is >> x.val;\n x.val %= MOD;\n if (x.val < 0) x.val += MOD;\n return is;\n }\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\n return os << x.val;\n }\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\n if (n == 0) return 1;\n auto t = modpow(a, n / 2);\n t = t * t;\n if (n & 1) t = t * a;\n return t;\n }\n};\n\nnamespace NTT {\n long long modpow(long long a, long long n, int mod) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n }\n\n long long modinv(long long a, int mod) {\n long long b = mod, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b, swap(a, b);\n u -= t * v, swap(u, v);\n }\n u %= mod;\n if (u < 0) u += mod;\n return u;\n }\n\n int calc_primitive_root(int mod) {\n if (mod == 2) return 1;\n if (mod == 167772161) return 3;\n if (mod == 469762049) return 3;\n if (mod == 754974721) return 11;\n if (mod == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n long long x = (mod - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (long long i = 3; i * i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) x /= i;\n }\n }\n if (x > 1) divs[cnt++] = x;\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (modpow(g, (mod - 1) / divs[i], mod) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n }\n\n int get_fft_size(int N, int M) {\n int size_a = 1, size_b = 1;\n while (size_a < N) size_a <<= 1;\n while (size_b < M) size_b <<= 1;\n return max(size_a, size_b) << 1;\n }\n\n // number-theoretic transform\n template<class mint> void trans(vector<mint> &v, bool inv = false) {\n if (v.empty()) return;\n int N = (int)v.size();\n int MOD = v[0].getmod();\n int PR = calc_primitive_root(MOD);\n static bool first = true;\n static vector<long long> vbw(30), vibw(30);\n if (first) {\n first = false;\n for (int k = 0; k < 30; ++k) {\n vbw[k] = modpow(PR, (MOD - 1) >> (k + 1), MOD);\n vibw[k] = modinv(vbw[k], MOD);\n }\n }\n for (int i = 0, j = 1; j < N - 1; j++) {\n for (int k = N >> 1; k > (i ^= k); k >>= 1);\n if (i > j) swap(v[i], v[j]);\n }\n for (int k = 0, t = 2; t <= N; ++k, t <<= 1) {\n long long bw = vbw[k];\n if (inv) bw = vibw[k];\n for (int i = 0; i < N; i += t) {\n mint w = 1;\n for (int j = 0; j < t/2; ++j) {\n int j1 = i + j, j2 = i + j + t/2;\n mint c1 = v[j1], c2 = v[j2] * w;\n v[j1] = c1 + c2;\n v[j2] = c1 - c2;\n w *= bw;\n }\n }\n }\n if (inv) {\n long long invN = modinv(N, MOD);\n for (int i = 0; i < N; ++i) v[i] = v[i] * invN;\n }\n }\n\n // small case (T = mint, long long)\n template<class T> vector<T> naive_mul \n (const vector<T> &A, const vector<T> &B) {\n if (A.empty() || B.empty()) return {};\n int N = (int)A.size(), M = (int)B.size();\n vector<T> res(N + M - 1);\n for (int i = 0; i < N; ++i)\n for (int j = 0; j < M; ++j)\n res[i + j] += A[i] * B[j];\n return res;\n }\n\n // mint\n template<class mint> vector<mint> operator * \n (const vector<mint> &A, const vector<mint> &B) {\n if (A.empty() || B.empty()) return {};\n int N = (int)A.size(), M = (int)B.size();\n if (min(N, M) < 30) return naive_mul(A, B);\n int MOD = A[0].getmod();\n int size_fft = get_fft_size(N, M);\n vector<mint> a(size_fft), b(size_fft), c(size_fft);\n for (int i = 0; i < N; ++i) a[i] = A[i];\n for (int i = 0; i < M; ++i) b[i] = B[i];\n trans(a), trans(b);\n vector<mint> res(size_fft);\n for (int i = 0; i < size_fft; ++i) res[i] = a[i] * b[i];\n trans(res, true);\n res.resize(N + M - 1);\n return res;\n }\n};\n\nconst int MOD = 998244353;\nusing mint = Fp<MOD>;\nusing namespace NTT;\n\n\nint main() {\n long long N, L, M, D;\n cin >> N >> L;\n vector<long long> t(N);\n for (int i = 0; i < N; ++i) cin >> t[i];\n cin >> M >> D;\n vector<long long> x(M + 1, L);\n vector<mint> p(M);\n for (int i = 0; i < M; ++i) cin >> x[i] >> p[i], p[i] /= 100;\n\n priority_queue<pair<int,vector<mint>>, vector<pair<int,vector<mint>>>, greater<pair<int,vector<mint>>>> que;\n for (int i = 0; i < M; ++i) {\n long long l = x[i+1] - x[i];\n vector<mint> v(l+1, 0);\n v[0] = mint(1) - p[i];\n v[l] = p[i];\n que.push({l+1, v});\n }\n while (que.size() >= 2) {\n auto left = que.top(); que.pop();\n auto right = que.top(); que.pop();\n auto mul = left.second * right.second;\n que.push({mul.size(), mul});\n }\n auto f = que.top().second;\n long long deg = f.size() - 1;\n auto g = f;\n reverse(g.begin(), g.end());\n auto fg = f * g;\n vector<mint> sum(fg.size()+1, 0);\n for (int i = 0; i < fg.size(); ++i) sum[i+1] = sum[i] + fg[i];\n\n mint res = 1;\n for (int i = 1; i < N; ++i) {\n long long lim = deg + (L * (t[0] - t[i]) + D * 20000000 + D * 2 - 1) / (D * 2) - 10000000;\n chmax(lim, 0LL);\n chmin(lim, (long long)sum.size() - 1);\n res += sum[lim];\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":360,"memory_kb":20028,"score_of_the_acc":-0.2822,"final_rank":4},{"submission_id":"aoj_3182_4855175","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\n{ for(auto it : P) { s << \"<\" << it << \"> \"; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for(auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s << endl; }\n\n\n// modint\ntemplate<int MOD> struct Fp {\n long long val;\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\n if (val < 0) val += MOD;\n }\n constexpr int getmod() const { return MOD; }\n constexpr Fp operator - () const noexcept {\n return val ? MOD - val : 0;\n }\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\n constexpr Fp& operator += (const Fp& r) noexcept {\n val += r.val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -= (const Fp& r) noexcept {\n val -= r.val;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp& operator *= (const Fp& r) noexcept {\n val = val * r.val % MOD;\n return *this;\n }\n constexpr Fp& operator /= (const Fp& r) noexcept {\n long long a = r.val, b = MOD, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b, swap(a, b);\n u -= t * v, swap(u, v);\n }\n val = val * u % MOD;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr bool operator == (const Fp& r) const noexcept {\n return this->val == r.val;\n }\n constexpr bool operator != (const Fp& r) const noexcept {\n return this->val != r.val;\n }\n constexpr bool operator < (const Fp& r) const noexcept {\n return this->val < r.val;\n }\n friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {\n is >> x.val;\n x.val %= MOD;\n if (x.val < 0) x.val += MOD;\n return is;\n }\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\n return os << x.val;\n }\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\n if (n == 0) return 1;\n auto t = modpow(a, n / 2);\n t = t * t;\n if (n & 1) t = t * a;\n return t;\n }\n};\n\nnamespace NTT {\n long long modpow(long long a, long long n, int mod) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n }\n\n long long modinv(long long a, int mod) {\n long long b = mod, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b, swap(a, b);\n u -= t * v, swap(u, v);\n }\n u %= mod;\n if (u < 0) u += mod;\n return u;\n }\n\n int calc_primitive_root(int mod) {\n if (mod == 2) return 1;\n if (mod == 167772161) return 3;\n if (mod == 469762049) return 3;\n if (mod == 754974721) return 11;\n if (mod == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n long long x = (mod - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (long long i = 3; i * i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) x /= i;\n }\n }\n if (x > 1) divs[cnt++] = x;\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (modpow(g, (mod - 1) / divs[i], mod) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n }\n\n int get_fft_size(int N, int M) {\n int size_a = 1, size_b = 1;\n while (size_a < N) size_a <<= 1;\n while (size_b < M) size_b <<= 1;\n return max(size_a, size_b) << 1;\n }\n\n // number-theoretic transform\n template<class mint> void trans(vector<mint> &v, bool inv = false) {\n if (v.empty()) return;\n int N = (int)v.size();\n int MOD = v[0].getmod();\n int PR = calc_primitive_root(MOD);\n static bool first = true;\n static vector<long long> vbw(30), vibw(30);\n if (first) {\n first = false;\n for (int k = 0; k < 30; ++k) {\n vbw[k] = modpow(PR, (MOD - 1) >> (k + 1), MOD);\n vibw[k] = modinv(vbw[k], MOD);\n }\n }\n for (int i = 0, j = 1; j < N - 1; j++) {\n for (int k = N >> 1; k > (i ^= k); k >>= 1);\n if (i > j) swap(v[i], v[j]);\n }\n for (int k = 0, t = 2; t <= N; ++k, t <<= 1) {\n long long bw = vbw[k];\n if (inv) bw = vibw[k];\n for (int i = 0; i < N; i += t) {\n mint w = 1;\n for (int j = 0; j < t/2; ++j) {\n int j1 = i + j, j2 = i + j + t/2;\n mint c1 = v[j1], c2 = v[j2] * w;\n v[j1] = c1 + c2;\n v[j2] = c1 - c2;\n w *= bw;\n }\n }\n }\n if (inv) {\n long long invN = modinv(N, MOD);\n for (int i = 0; i < N; ++i) v[i] = v[i] * invN;\n }\n }\n\n // for garner\n static constexpr int MOD0 = 754974721;\n static constexpr int MOD1 = 167772161;\n static constexpr int MOD2 = 469762049;\n using mint0 = Fp<MOD0>;\n using mint1 = Fp<MOD1>;\n using mint2 = Fp<MOD2>;\n static const mint1 imod0 = 95869806; // modinv(MOD0, MOD1);\n static const mint2 imod1 = 104391568; // modinv(MOD1, MOD2);\n static const mint2 imod01 = 187290749; // imod1 / MOD0;\n\n // small case (T = mint, long long)\n template<class T> vector<T> naive_mul \n (const vector<T> &A, const vector<T> &B) {\n if (A.empty() || B.empty()) return {};\n int N = (int)A.size(), M = (int)B.size();\n vector<T> res(N + M - 1);\n for (int i = 0; i < N; ++i)\n for (int j = 0; j < M; ++j)\n res[i + j] += A[i] * B[j];\n return res;\n }\n\n // mint\n template<class mint> vector<mint> operator * \n (const vector<mint> &A, const vector<mint> &B) {\n if (A.empty() || B.empty()) return {};\n int N = (int)A.size(), M = (int)B.size();\n if (min(N, M) < 30) return naive_mul(A, B);\n int MOD = A[0].getmod();\n int size_fft = get_fft_size(N, M);\n if (MOD == 998244353) {\n vector<mint> a(size_fft), b(size_fft), c(size_fft);\n for (int i = 0; i < N; ++i) a[i] = A[i];\n for (int i = 0; i < M; ++i) b[i] = B[i];\n trans(a), trans(b);\n vector<mint> res(size_fft);\n for (int i = 0; i < size_fft; ++i) res[i] = a[i] * b[i];\n trans(res, true);\n res.resize(N + M - 1);\n return res;\n }\n vector<mint0> a0(size_fft, 0), b0(size_fft, 0), c0(size_fft, 0);\n vector<mint1> a1(size_fft, 0), b1(size_fft, 0), c1(size_fft, 0);\n vector<mint2> a2(size_fft, 0), b2(size_fft, 0), c2(size_fft, 0);\n for (int i = 0; i < N; ++i)\n a0[i] = A[i].val, a1[i] = A[i].val, a2[i] = A[i].val;\n for (int i = 0; i < M; ++i)\n b0[i] = B[i].val, b1[i] = B[i].val, b2[i] = B[i].val;\n trans(a0), trans(a1), trans(a2), trans(b0), trans(b1), trans(b2);\n for (int i = 0; i < size_fft; ++i) {\n c0[i] = a0[i] * b0[i];\n c1[i] = a1[i] * b1[i];\n c2[i] = a2[i] * b2[i];\n }\n trans(c0, true), trans(c1, true), trans(c2, true);\n static const mint mod0 = MOD0, mod01 = mod0 * MOD1;\n vector<mint> res(N + M - 1);\n for (int i = 0; i < N + M - 1; ++i) {\n int y0 = c0[i].val;\n int y1 = (imod0 * (c1[i] - y0)).val;\n int y2 = (imod01 * (c2[i] - y0) - imod1 * y1).val;\n res[i] = mod01 * y2 + mod0 * y1 + y0;\n }\n return res;\n }\n\n // long long\n vector<long long> mul\n (const vector<long long> &A, const vector<long long> &B) {\n if (A.empty() || B.empty()) return {};\n int N = (int)A.size(), M = (int)B.size();\n if (min(N, M) < 30) return naive_mul(A, B);\n int size_fft = get_fft_size(N, M);\n vector<mint0> a0(size_fft, 0), b0(size_fft, 0), c0(size_fft, 0);\n vector<mint1> a1(size_fft, 0), b1(size_fft, 0), c1(size_fft, 0);\n vector<mint2> a2(size_fft, 0), b2(size_fft, 0), c2(size_fft, 0);\n for (int i = 0; i < N; ++i)\n a0[i] = A[i], a1[i] = A[i], a2[i] = A[i];\n for (int i = 0; i < M; ++i)\n b0[i] = B[i], b1[i] = B[i], b2[i] = B[i];\n trans(a0), trans(a1), trans(a2), trans(b0), trans(b1), trans(b2);\n for (int i = 0; i < size_fft; ++i) {\n c0[i] = a0[i] * b0[i];\n c1[i] = a1[i] * b1[i];\n c2[i] = a2[i] * b2[i];\n }\n trans(c0, true), trans(c1, true), trans(c2, true);\n static const long long mod0 = MOD0, mod01 = mod0 * MOD1;\n vector<long long> res(N + M - 1);\n for (int i = 0; i < N + M - 1; ++i) {\n int y0 = c0[i].val;\n int y1 = (imod0 * (c1[i] - y0)).val;\n int y2 = (imod01 * (c2[i] - y0) - imod1 * y1).val;\n res[i] = mod01 * y2 + mod0 * y1 + y0;\n }\n return res;\n }\n};\n\nconst int MOD = 998244353;\nusing mint = Fp<MOD>;\nusing namespace NTT;\n\n\nint main() {\n long long N, L, M, D;\n cin >> N >> L;\n vector<long long> t(N);\n for (int i = 0; i < N; ++i) cin >> t[i];\n cin >> M >> D;\n vector<long long> x(M + 1, L);\n vector<mint> p(M);\n for (int i = 0; i < M; ++i) cin >> x[i] >> p[i], p[i] /= 100;\n\n priority_queue<pair<int,vector<mint>>, vector<pair<int,vector<mint>>>, greater<pair<int,vector<mint>>>> que;\n for (int i = 0; i < M; ++i) {\n long long l = x[i+1] - x[i];\n vector<mint> v(l+1, 0);\n v[0] = mint(1) - p[i];\n v[l] = p[i];\n que.push({l+1, v});\n }\n while (que.size() >= 2) {\n auto left = que.top(); que.pop();\n auto right = que.top(); que.pop();\n auto mul = left.second * right.second;\n que.push({mul.size(), mul});\n }\n auto f = que.top().second;\n long long deg = f.size() - 1;\n auto g = f;\n reverse(g.begin(), g.end());\n auto fg = f * g;\n int size = fg.size();\n vector<mint> sum(size+1, 0);\n for (int i = 0; i < size; ++i) sum[i+1] = sum[i] + fg[i];\n\n mint res = 1;\n for (int i = 1; i < N; ++i) {\n long long lim = deg + (L * (t[0] - t[i]) + D * 20000000 + D * 2 - 1) / (D * 2) - 10000000;\n chmax(lim, 0LL);\n chmin(lim, (long long)sum.size() - 1);\n res += sum[lim];\n\n //cout << i << \": \" << lim << endl;\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":400,"memory_kb":20024,"score_of_the_acc":-0.327,"final_rank":5},{"submission_id":"aoj_3182_4855128","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\n{ for(auto it : P) { s << \"<\" << it << \"> \"; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for(auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s << endl; }\n\n\n// modint\ntemplate<int MOD> struct Fp {\n long long val;\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\n if (val < 0) val += MOD;\n }\n constexpr int getmod() const { return MOD; }\n constexpr Fp operator - () const noexcept {\n return val ? MOD - val : 0;\n }\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\n constexpr Fp& operator += (const Fp& r) noexcept {\n val += r.val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -= (const Fp& r) noexcept {\n val -= r.val;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp& operator *= (const Fp& r) noexcept {\n val = val * r.val % MOD;\n return *this;\n }\n constexpr Fp& operator /= (const Fp& r) noexcept {\n long long a = r.val, b = MOD, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b, swap(a, b);\n u -= t * v, swap(u, v);\n }\n val = val * u % MOD;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr bool operator == (const Fp& r) const noexcept {\n return this->val == r.val;\n }\n constexpr bool operator != (const Fp& r) const noexcept {\n return this->val != r.val;\n }\n constexpr bool operator < (const Fp& r) const noexcept {\n return this->val < r.val;\n }\n friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {\n is >> x.val;\n x.val %= MOD;\n if (x.val < 0) x.val += MOD;\n return is;\n }\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\n return os << x.val;\n }\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\n if (n == 0) return 1;\n auto t = modpow(a, n / 2);\n t = t * t;\n if (n & 1) t = t * a;\n return t;\n }\n};\n\nnamespace NTT {\n long long modpow(long long a, long long n, int mod) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n }\n\n long long modinv(long long a, int mod) {\n long long b = mod, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b, swap(a, b);\n u -= t * v, swap(u, v);\n }\n u %= mod;\n if (u < 0) u += mod;\n return u;\n }\n\n int calc_primitive_root(int mod) {\n if (mod == 2) return 1;\n if (mod == 167772161) return 3;\n if (mod == 469762049) return 3;\n if (mod == 754974721) return 11;\n if (mod == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n long long x = (mod - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (long long i = 3; i * i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) x /= i;\n }\n }\n if (x > 1) divs[cnt++] = x;\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (modpow(g, (mod - 1) / divs[i], mod) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n }\n\n int get_fft_size(int N, int M) {\n int size_a = 1, size_b = 1;\n while (size_a < N) size_a <<= 1;\n while (size_b < M) size_b <<= 1;\n return max(size_a, size_b) << 1;\n }\n\n // number-theoretic transform\n template<class mint> void trans(vector<mint> &v, bool inv = false) {\n if (v.empty()) return;\n int N = (int)v.size();\n int MOD = v[0].getmod();\n int PR = calc_primitive_root(MOD);\n static bool first = true;\n static vector<long long> vbw(30), vibw(30);\n if (first) {\n first = false;\n for (int k = 0; k < 30; ++k) {\n vbw[k] = modpow(PR, (MOD - 1) >> (k + 1), MOD);\n vibw[k] = modinv(vbw[k], MOD);\n }\n }\n for (int i = 0, j = 1; j < N - 1; j++) {\n for (int k = N >> 1; k > (i ^= k); k >>= 1);\n if (i > j) swap(v[i], v[j]);\n }\n for (int k = 0, t = 2; t <= N; ++k, t <<= 1) {\n long long bw = vbw[k];\n if (inv) bw = vibw[k];\n for (int i = 0; i < N; i += t) {\n mint w = 1;\n for (int j = 0; j < t/2; ++j) {\n int j1 = i + j, j2 = i + j + t/2;\n mint c1 = v[j1], c2 = v[j2] * w;\n v[j1] = c1 + c2;\n v[j2] = c1 - c2;\n w *= bw;\n }\n }\n }\n if (inv) {\n long long invN = modinv(N, MOD);\n for (int i = 0; i < N; ++i) v[i] = v[i] * invN;\n }\n }\n\n // for garner\n static constexpr int MOD0 = 754974721;\n static constexpr int MOD1 = 167772161;\n static constexpr int MOD2 = 469762049;\n using mint0 = Fp<MOD0>;\n using mint1 = Fp<MOD1>;\n using mint2 = Fp<MOD2>;\n static const mint1 imod0 = 95869806; // modinv(MOD0, MOD1);\n static const mint2 imod1 = 104391568; // modinv(MOD1, MOD2);\n static const mint2 imod01 = 187290749; // imod1 / MOD0;\n\n // small case (T = mint, long long)\n template<class T> vector<T> naive_mul \n (const vector<T> &A, const vector<T> &B) {\n if (A.empty() || B.empty()) return {};\n int N = (int)A.size(), M = (int)B.size();\n vector<T> res(N + M - 1);\n for (int i = 0; i < N; ++i)\n for (int j = 0; j < M; ++j)\n res[i + j] += A[i] * B[j];\n return res;\n }\n\n // mint\n template<class mint> vector<mint> operator * \n (const vector<mint> &A, const vector<mint> &B) {\n if (A.empty() || B.empty()) return {};\n int N = (int)A.size(), M = (int)B.size();\n if (min(N, M) < 30) return naive_mul(A, B);\n int MOD = A[0].getmod();\n int size_fft = get_fft_size(N, M);\n if (MOD == 998244353) {\n vector<mint> a(size_fft), b(size_fft), c(size_fft);\n for (int i = 0; i < N; ++i) a[i] = A[i];\n for (int i = 0; i < M; ++i) b[i] = B[i];\n trans(a), trans(b);\n vector<mint> res(size_fft);\n for (int i = 0; i < size_fft; ++i) res[i] = a[i] * b[i];\n trans(res, true);\n res.resize(N + M - 1);\n return res;\n }\n vector<mint0> a0(size_fft, 0), b0(size_fft, 0), c0(size_fft, 0);\n vector<mint1> a1(size_fft, 0), b1(size_fft, 0), c1(size_fft, 0);\n vector<mint2> a2(size_fft, 0), b2(size_fft, 0), c2(size_fft, 0);\n for (int i = 0; i < N; ++i)\n a0[i] = A[i].val, a1[i] = A[i].val, a2[i] = A[i].val;\n for (int i = 0; i < M; ++i)\n b0[i] = B[i].val, b1[i] = B[i].val, b2[i] = B[i].val;\n trans(a0), trans(a1), trans(a2), trans(b0), trans(b1), trans(b2);\n for (int i = 0; i < size_fft; ++i) {\n c0[i] = a0[i] * b0[i];\n c1[i] = a1[i] * b1[i];\n c2[i] = a2[i] * b2[i];\n }\n trans(c0, true), trans(c1, true), trans(c2, true);\n static const mint mod0 = MOD0, mod01 = mod0 * MOD1;\n vector<mint> res(N + M - 1);\n for (int i = 0; i < N + M - 1; ++i) {\n int y0 = c0[i].val;\n int y1 = (imod0 * (c1[i] - y0)).val;\n int y2 = (imod01 * (c2[i] - y0) - imod1 * y1).val;\n res[i] = mod01 * y2 + mod0 * y1 + y0;\n }\n return res;\n }\n\n // long long\n vector<long long> mul\n (const vector<long long> &A, const vector<long long> &B) {\n if (A.empty() || B.empty()) return {};\n int N = (int)A.size(), M = (int)B.size();\n if (min(N, M) < 30) return naive_mul(A, B);\n int size_fft = get_fft_size(N, M);\n vector<mint0> a0(size_fft, 0), b0(size_fft, 0), c0(size_fft, 0);\n vector<mint1> a1(size_fft, 0), b1(size_fft, 0), c1(size_fft, 0);\n vector<mint2> a2(size_fft, 0), b2(size_fft, 0), c2(size_fft, 0);\n for (int i = 0; i < N; ++i)\n a0[i] = A[i], a1[i] = A[i], a2[i] = A[i];\n for (int i = 0; i < M; ++i)\n b0[i] = B[i], b1[i] = B[i], b2[i] = B[i];\n trans(a0), trans(a1), trans(a2), trans(b0), trans(b1), trans(b2);\n for (int i = 0; i < size_fft; ++i) {\n c0[i] = a0[i] * b0[i];\n c1[i] = a1[i] * b1[i];\n c2[i] = a2[i] * b2[i];\n }\n trans(c0, true), trans(c1, true), trans(c2, true);\n static const long long mod0 = MOD0, mod01 = mod0 * MOD1;\n vector<long long> res(N + M - 1);\n for (int i = 0; i < N + M - 1; ++i) {\n int y0 = c0[i].val;\n int y1 = (imod0 * (c1[i] - y0)).val;\n int y2 = (imod01 * (c2[i] - y0) - imod1 * y1).val;\n res[i] = mod01 * y2 + mod0 * y1 + y0;\n }\n return res;\n }\n};\n\nconst int MOD = 998244353;\nusing mint = Fp<MOD>;\nusing namespace NTT;\n\n\nint main() {\n long long N, L, M, D;\n cin >> N >> L;\n vector<long long> t(N);\n for (int i = 0; i < N; ++i) cin >> t[i];\n cin >> M >> D;\n vector<long long> x(M + 1, L);\n vector<mint> p(M);\n for (int i = 0; i < M; ++i) cin >> x[i] >> p[i], p[i] /= 100;\n\n priority_queue<pair<int,vector<mint>>, vector<pair<int,vector<mint>>>, greater<pair<int,vector<mint>>>> que;\n for (int i = 0; i < M; ++i) {\n long long l = x[i+1] - x[i];\n vector<mint> v(l+1, 0);\n v[0] = mint(1) - p[i];\n v[l] = p[i];\n que.push({l+1, v});\n }\n while (que.size() >= 2) {\n auto left = que.top(); que.pop();\n auto right = que.top(); que.pop();\n auto mul = left.second * right.second;\n que.push({mul.size(), mul});\n }\n auto f = que.top().second;\n int deg = f.size() - 1;\n auto g = f;\n reverse(g.begin(), g.end());\n auto fg = f * g;\n int size = fg.size();\n vector<mint> sum(size+1, 0);\n for (int i = 0; i < size; ++i) sum[i+1] = sum[i] + fg[i];\n\n mint res = 1;\n for (int i = 1; i < N; ++i) {\n int lim = deg + (L * (t[0] - t[i]) + D * 20000000 + D * 2 - 1) / (D * 2) - 10000000;\n chmax(lim, 0);\n chmin(lim, (int)sum.size() - 1);\n res += sum[lim];\n }\n cout << res << endl;\n}","accuracy":0.6,"time_ms":370,"memory_kb":19960,"score_of_the_acc":-0.2921,"final_rank":13},{"submission_id":"aoj_3182_4852327","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <set>\n#include <tuple>\n#define mkp make_pair\n#define mkt make_tuple\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=998244353;\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\n\nll mod_pow(ll x,ll n){\n x%=MOD;\n ll res=1;\n while(n>0){\n if(n&1) res=res*x%MOD;\n x=x*x%MOD;\n n>>=1;\n }\n return res;\n}\n\nll mod_inverse(ll x){\n return mod_pow(x,MOD-2);\n}\n\nvoid add(ll &a,ll b){\n a=(a+b)%MOD;\n}\n\nvoid mul(ll &a,ll b){\n a%=MOD;b%=MOD;\n a=a*b%MOD;\n}\n\n//const ll MOD=998244353; // MOD == 119*2^23+1\n//depends on mod_pow,mod_inverse\n\nll root[24],invroot[24];\n\nvoid NTT_init(){\n for(int i=0;i<24;++i){\n root[i]=mod_pow(3,(MOD-1)/(1<<i));\n invroot[i]=mod_inverse(root[i]);\n }\n}\n\nvector<ll> NTT(vector<ll> a,bool inverse=false){\n int n=a.size();\n int high=0;\n for(int i=0;(1<<i)<n;++i) high++;\n\n for(int i=0;i<n;++i){\n int mask=0;\n for(int k=0;k<high;++k){\n if(i>>k&1) mask|=(1<<(high-1-k));\n }\n if(i<mask) swap(a[i],a[mask]);\n }\n\n for(int j=1;(1<<j)<=n;++j){\n int m=(1<<j);\n ll zeta=root[j];\n if(inverse) zeta=invroot[j];\n for(int i=0;i<n;i+=m){\n ll powzeta=1;\n for(int k=i;k<i+m/2;++k){\n ll s=a[k];\n ll t=a[k+m/2]*powzeta%MOD;\n\n a[k]=(s+t)%MOD;\n a[k+m/2]=(s-t+MOD)%MOD;\n powzeta=powzeta*zeta%MOD;\n }\n }\n }\n\n if(inverse){\n ll invn=mod_inverse(n);\n for(int i=0;i<n;++i) a[i]=a[i]*invn%MOD;\n }\n return a;\n}\n\nvector<ll> convolute(const vector<ll> &a,const vector<ll> &b){\n int size=a.size()+b.size()-1;\n int n=1;\n while(n<size) n<<=1;\n\n vector<ll> A(n,0),B(n,0);\n for(int i=0;i<a.size();i++) A[i]=a[i];\n for(int i=0;i<b.size();i++) B[i]=b[i];\n\n A=NTT(A);\n B=NTT(B);\n\n for(int i=0;i<n;++i) A[i]=A[i]*B[i]%MOD;\n A=NTT(A,true);\n\n A.resize(size);\n return A;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int N;\n ll L;\n cin>>N>>L;\n vector<ll> T(N);\n rep(i,N) cin>>T[i];\n int M;\n ll D;\n cin>>M>>D;\n vector<ll> X(M+1),P(M+1);\n rep(i,M) cin>>X[i]>>P[i];\n X[M]=L;\n\n NTT_init();\n\n ll inv100=mod_inverse(100);\n vector<vector<ll>> B(M);\n rep(i,M){\n int diff=X[i+1]-X[i];\n B[i].resize(diff+1,0);\n B[i][0]=P[i]*inv100%MOD;\n B[i][diff]=(100-P[i])*inv100%MOD;\n }\n\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\n rep(i,M) PQ.push(mkp(B[i].size(),i));\n while(PQ.size()>1){\n auto f=PQ.top();\n PQ.pop();\n auto s=PQ.top();\n PQ.pop();\n\n int ft=f.second;\n int st=s.second;\n B[ft]=convolute(B[ft],B[st]);\n B[st].clear();\n\n PQ.push(mkp(B[ft].size(),ft));\n }\n\n auto f=PQ.top();PQ.pop();\n vector<ll> dist=B[f.second];\n int SZ=dist.size();\n\n vector<ll> revd=dist;\n reverse(all(revd));\n dist=convolute(dist,revd);\n\n int V=dist.size();\n vector<ll> rsum(V+1,0);\n for(int i=V-1;i>=0;i--) rsum[i]=(rsum[i+1]+dist[i])%MOD;\n\n ll ans=0;\n for(int i=1;i<N;i++){\n ll border=(L*abs(T[0]-T[i])+2*D-1)/(2*D);\n if(T[0]-T[i]<0) border*=(-1);\n if(T[0]-T[i]<0&&(L*abs(T[0]-T[i]))%(2*D)) ++border;\n if(border+SZ-1>V) continue;\n add(ans,rsum[max(0ll,border+SZ-1)]);\n }\n ans=(N-ans+MOD)%MOD;\n add(ans,MOD);\n cout<<ans<<endl;\n\n\n return 0;\n}","accuracy":1,"time_ms":540,"memory_kb":45732,"score_of_the_acc":-0.9807,"final_rank":10},{"submission_id":"aoj_3182_4852232","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <set>\n#include <tuple>\n#define mkp make_pair\n#define mkt make_tuple\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=998244353;\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\n\nll mod_pow(ll x,ll n){\n x%=MOD;\n ll res=1;\n while(n>0){\n if(n&1) res=res*x%MOD;\n x=x*x%MOD;\n n>>=1;\n }\n return res;\n}\n\nll mod_inverse(ll x){\n return mod_pow(x,MOD-2);\n}\n\nvoid add(ll &a,ll b){\n a=(a+b)%MOD;\n}\n\nvoid mul(ll &a,ll b){\n a%=MOD;b%=MOD;\n a=a*b%MOD;\n}\n\n//const ll MOD=998244353; // MOD == 119*2^23+1\n//depends on mod_pow,mod_inverse\n\nll root[24],invroot[24];\n\nvoid NTT_init(){\n for(int i=0;i<24;++i){\n root[i]=mod_pow(3,(MOD-1)/(1<<i));\n invroot[i]=mod_inverse(root[i]);\n }\n}\n\nvector<ll> NTT(vector<ll> a,bool inverse=false){\n int n=a.size();\n int high=0;\n for(int i=0;(1<<i)<n;++i) high++;\n\n for(int i=0;i<n;++i){\n int mask=0;\n for(int k=0;k<high;++k){\n if(i>>k&1) mask|=(1<<(high-1-k));\n }\n if(i<mask) swap(a[i],a[mask]);\n }\n\n for(int j=1;(1<<j)<=n;++j){\n int m=(1<<j);\n ll zeta=root[j];\n if(inverse) zeta=invroot[j];\n for(int i=0;i<n;i+=m){\n ll powzeta=1;\n for(int k=i;k<i+m/2;++k){\n ll s=a[k];\n ll t=a[k+m/2]*powzeta%MOD;\n\n a[k]=(s+t)%MOD;\n a[k+m/2]=(s-t+MOD)%MOD;\n powzeta=powzeta*zeta%MOD;\n }\n }\n }\n\n if(inverse){\n ll invn=mod_inverse(n);\n for(int i=0;i<n;++i) a[i]=a[i]*invn%MOD;\n }\n return a;\n}\n\nvector<ll> convolute(const vector<ll> &a,const vector<ll> &b){\n int size=a.size()+b.size()-1;\n int n=1;\n while(n<size) n<<=1;\n\n vector<ll> A(n,0),B(n,0);\n for(int i=0;i<a.size();i++) A[i]=a[i];\n for(int i=0;i<b.size();i++) B[i]=b[i];\n\n A=NTT(A);\n B=NTT(B);\n\n for(int i=0;i<n;++i) A[i]=A[i]*B[i]%MOD;\n A=NTT(A,true);\n\n A.resize(size);\n return A;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int N;\n ll L;\n cin>>N>>L;\n vector<ll> T(N);\n rep(i,N) cin>>T[i];\n int M;\n ll D;\n cin>>M>>D;\n vector<ll> X(M+1),P(M+1);\n rep(i,M) cin>>X[i]>>P[i];\n X[M]=L;\n\n NTT_init();\n\n ll inv100=mod_inverse(100);\n vector<vector<ll>> B(M);\n rep(i,M){\n int diff=X[i+1]-X[i];\n B[i].resize(diff+1,0);\n B[i][0]=P[i]*inv100%MOD;\n B[i][diff]=(100-P[i])*inv100%MOD;\n }\n\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\n rep(i,M) PQ.push(mkp(B[i].size(),i));\n while(PQ.size()>1){\n auto f=PQ.top();\n PQ.pop();\n auto s=PQ.top();\n PQ.pop();\n\n int ft=f.second;\n int st=s.second;\n B[ft]=convolute(B[ft],B[st]);\n B[st].clear();\n\n PQ.push(mkp(B[ft].size(),ft));\n }\n\n auto f=PQ.top();PQ.pop();\n vector<ll> dist=B[f.second];\n vector<ll> revd=dist;\n reverse(all(revd));\n dist=convolute(dist,revd);\n\n int V=dist.size();\n vector<ll> rsum(V+1,0);\n for(int i=V-1;i>=0;i--) rsum[i]=(rsum[i+1]+dist[i])%MOD;\n\n ll ans=0;\n for(int i=1;i<N;i++){\n ll border=L*(T[0]-T[i])/(2*D);\n if(T[0]-T[i]<0&&(L*abs(T[0]-T[i]))%(2*D)) --border;\n if(border+L>V) continue;\n ans+=rsum[max(0ll,border+L)];\n ans=(ans+MOD)%MOD;\n }\n ans=(N-ans+MOD)%MOD;\n cout<<ans<<endl;\n\n\n return 0;\n}","accuracy":0.075,"time_ms":600,"memory_kb":45444,"score_of_the_acc":-1.0425,"final_rank":20},{"submission_id":"aoj_3182_4852229","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <set>\n#include <tuple>\n#define mkp make_pair\n#define mkt make_tuple\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=998244353;\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\n\nll mod_pow(ll x,ll n){\n x%=MOD;\n ll res=1;\n while(n>0){\n if(n&1) res=res*x%MOD;\n x=x*x%MOD;\n n>>=1;\n }\n return res;\n}\n\nll mod_inverse(ll x){\n return mod_pow(x,MOD-2);\n}\n\nvoid add(ll &a,ll b){\n a=(a+b)%MOD;\n}\n\nvoid mul(ll &a,ll b){\n a%=MOD;b%=MOD;\n a=a*b%MOD;\n}\n\n//const ll MOD=998244353; // MOD == 119*2^23+1\n//depends on mod_pow,mod_inverse\n\nll root[24],invroot[24];\n\nvoid NTT_init(){\n for(int i=0;i<24;++i){\n root[i]=mod_pow(3,(MOD-1)/(1<<i));\n invroot[i]=mod_inverse(root[i]);\n }\n}\n\nvector<ll> NTT(vector<ll> a,bool inverse=false){\n int n=a.size();\n int high=0;\n for(int i=0;(1<<i)<n;++i) high++;\n\n for(int i=0;i<n;++i){\n int mask=0;\n for(int k=0;k<high;++k){\n if(i>>k&1) mask|=(1<<(high-1-k));\n }\n if(i<mask) swap(a[i],a[mask]);\n }\n\n for(int j=1;(1<<j)<=n;++j){\n int m=(1<<j);\n ll zeta=root[j];\n if(inverse) zeta=invroot[j];\n for(int i=0;i<n;i+=m){\n ll powzeta=1;\n for(int k=i;k<i+m/2;++k){\n ll s=a[k];\n ll t=a[k+m/2]*powzeta%MOD;\n\n a[k]=(s+t)%MOD;\n a[k+m/2]=(s-t+MOD)%MOD;\n powzeta=powzeta*zeta%MOD;\n }\n }\n }\n\n if(inverse){\n ll invn=mod_inverse(n);\n for(int i=0;i<n;++i) a[i]=a[i]*invn%MOD;\n }\n return a;\n}\n\nvector<ll> convolute(const vector<ll> &a,const vector<ll> &b){\n int size=a.size()+b.size()-1;\n int n=1;\n while(n<size) n<<=1;\n\n vector<ll> A(n,0),B(n,0);\n for(int i=0;i<a.size();i++) A[i]=a[i];\n for(int i=0;i<b.size();i++) B[i]=b[i];\n\n A=NTT(A);\n B=NTT(B);\n\n for(int i=0;i<n;++i) A[i]=A[i]*B[i]%MOD;\n A=NTT(A,true);\n\n A.resize(size);\n return A;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int N;\n ll L;\n cin>>N>>L;\n vector<ll> T(N);\n rep(i,N) cin>>T[i];\n int M;\n ll D;\n cin>>M>>D;\n vector<ll> X(M+1),P(M+1);\n rep(i,M) cin>>X[i]>>P[i];\n X[M]=L;\n\n NTT_init();\n\n ll inv100=mod_inverse(100);\n vector<vector<ll>> B(M);\n rep(i,M){\n int diff=X[i+1]-X[i];\n B[i].resize(diff+1,0);\n B[i][0]=P[i]*inv100%MOD;\n B[i][diff]=(100-P[i])*inv100%MOD;\n }\n\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\n rep(i,M) PQ.push(mkp(B[i].size(),i));\n while(PQ.size()>1){\n auto f=PQ.top();\n PQ.pop();\n auto s=PQ.top();\n PQ.pop();\n\n int ft=f.second;\n int st=s.second;\n B[ft]=convolute(B[ft],B[st]);\n B[st].clear();\n\n PQ.push(mkp(B[ft].size(),ft));\n }\n\n auto f=PQ.top();PQ.pop();\n vector<ll> dist=B[f.second];\n vector<ll> revd=dist;\n reverse(all(revd));\n dist=convolute(dist,revd);\n\n int V=dist.size();\n vector<ll> rsum(V+1,0);\n for(int i=V-1;i>=0;i--) rsum[i]=rsum[i+1]+dist[i];\n\n ll ans=0;\n for(int i=1;i<N;i++){\n ll border=L*(T[0]-T[i])/(2*D);\n if(T[0]-T[i]<0&&(L*abs(T[0]-T[i]))%(2*D)) --border;\n if(border+L>V) continue;\n ans+=rsum[max(0ll,border+L)];\n ans=(ans+MOD)%MOD;\n }\n ans=(N-ans+MOD)%MOD;\n cout<<ans<<endl;\n\n\n return 0;\n}","accuracy":0.075,"time_ms":570,"memory_kb":45464,"score_of_the_acc":-1.0092,"final_rank":19},{"submission_id":"aoj_3182_4852227","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <set>\n#include <tuple>\n#define mkp make_pair\n#define mkt make_tuple\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=998244353;\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\n\nll mod_pow(ll x,ll n){\n x%=MOD;\n ll res=1;\n while(n>0){\n if(n&1) res=res*x%MOD;\n x=x*x%MOD;\n n>>=1;\n }\n return res;\n}\n\nll mod_inverse(ll x){\n return mod_pow(x,MOD-2);\n}\n\nvoid add(ll &a,ll b){\n a=(a+b)%MOD;\n}\n\nvoid mul(ll &a,ll b){\n a%=MOD;b%=MOD;\n a=a*b%MOD;\n}\n\n//const ll MOD=998244353; // MOD == 119*2^23+1\n//depends on mod_pow,mod_inverse\n\nll root[24],invroot[24];\n\nvoid NTT_init(){\n for(int i=0;i<24;++i){\n root[i]=mod_pow(3,(MOD-1)/(1<<i));\n invroot[i]=mod_inverse(root[i]);\n }\n}\n\nvector<ll> NTT(vector<ll> a,bool inverse=false){\n int n=a.size();\n int high=0;\n for(int i=0;(1<<i)<n;++i) high++;\n\n for(int i=0;i<n;++i){\n int mask=0;\n for(int k=0;k<high;++k){\n if(i>>k&1) mask|=(1<<(high-1-k));\n }\n if(i<mask) swap(a[i],a[mask]);\n }\n\n for(int j=1;(1<<j)<=n;++j){\n int m=(1<<j);\n ll zeta=root[j];\n if(inverse) zeta=invroot[j];\n for(int i=0;i<n;i+=m){\n ll powzeta=1;\n for(int k=i;k<i+m/2;++k){\n ll s=a[k];\n ll t=a[k+m/2]*powzeta%MOD;\n\n a[k]=(s+t)%MOD;\n a[k+m/2]=(s-t+MOD)%MOD;\n powzeta=powzeta*zeta%MOD;\n }\n }\n }\n\n if(inverse){\n ll invn=mod_inverse(n);\n for(int i=0;i<n;++i) a[i]=a[i]*invn%MOD;\n }\n return a;\n}\n\nvector<ll> convolute(const vector<ll> &a,const vector<ll> &b){\n int size=a.size()+b.size()-1;\n int n=1;\n while(n<size) n<<=1;\n\n vector<ll> A(n,0),B(n,0);\n for(int i=0;i<a.size();i++) A[i]=a[i];\n for(int i=0;i<b.size();i++) B[i]=b[i];\n\n A=NTT(A);\n B=NTT(B);\n\n for(int i=0;i<n;++i) A[i]=A[i]*B[i]%MOD;\n A=NTT(A,true);\n\n A.resize(size);\n return A;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int N;\n ll L;\n cin>>N>>L;\n vector<ll> T(N);\n rep(i,N) cin>>T[i];\n int M;\n ll D;\n cin>>M>>D;\n vector<ll> X(M+1),P(M+1);\n rep(i,M) cin>>X[i]>>P[i];\n X[M]=L;\n\n NTT_init();\n\n ll inv100=mod_inverse(100);\n vector<vector<ll>> B(M);\n rep(i,M){\n int diff=X[i+1]-X[i];\n B[i].resize(diff+1,0);\n B[i][0]=P[i]*inv100%MOD;\n B[i][diff]=(100-P[i])*inv100%MOD;\n }\n\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\n rep(i,M) PQ.push(mkp(B[i].size(),i));\n while(PQ.size()>1){\n auto f=PQ.top();\n PQ.pop();\n auto s=PQ.top();\n PQ.pop();\n\n int ft=f.second;\n int st=s.second;\n B[ft]=convolute(B[ft],B[st]);\n B[st].clear();\n\n PQ.push(mkp(B[ft].size(),ft));\n }\n\n auto f=PQ.top();PQ.pop();\n vector<ll> dist=B[f.second];\n vector<ll> revd=dist;\n reverse(all(revd));\n dist=convolute(dist,revd);\n\n int V=dist.size();\n vector<ll> rsum(V+1,0);\n for(int i=V-1;i>=0;i--) rsum[i]=rsum[i+1]+dist[i];\n\n ll ans=0;\n for(int i=1;i<N;i++){\n ll border=L*(T[0]-T[i])/(2*D);\n if(T[0]-T[i]<0&&(L*abs(T[0]-T[i]))%(2*D)) --border;\n if(border+L<0||border+L>V) continue;\n ans+=rsum[border+L];\n ans=(ans+MOD)%MOD;\n }\n ans=(N-ans+MOD)%MOD;\n cout<<ans<<endl;\n\n\n return 0;\n}","accuracy":0.075,"time_ms":530,"memory_kb":45696,"score_of_the_acc":-0.9687,"final_rank":18},{"submission_id":"aoj_3182_4852226","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <set>\n#include <tuple>\n#define mkp make_pair\n#define mkt make_tuple\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=998244353;\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\n\nll mod_pow(ll x,ll n){\n x%=MOD;\n ll res=1;\n while(n>0){\n if(n&1) res=res*x%MOD;\n x=x*x%MOD;\n n>>=1;\n }\n return res;\n}\n\nll mod_inverse(ll x){\n return mod_pow(x,MOD-2);\n}\n\nvoid add(ll &a,ll b){\n a=(a+b)%MOD;\n}\n\nvoid mul(ll &a,ll b){\n a%=MOD;b%=MOD;\n a=a*b%MOD;\n}\n\n//const ll MOD=998244353; // MOD == 119*2^23+1\n//depends on mod_pow,mod_inverse\n\nll root[24],invroot[24];\n\nvoid NTT_init(){\n for(int i=0;i<24;++i){\n root[i]=mod_pow(3,(MOD-1)/(1<<i));\n invroot[i]=mod_inverse(root[i]);\n }\n}\n\nvector<ll> NTT(vector<ll> a,bool inverse=false){\n int n=a.size();\n int high=0;\n for(int i=0;(1<<i)<n;++i) high++;\n\n for(int i=0;i<n;++i){\n int mask=0;\n for(int k=0;k<high;++k){\n if(i>>k&1) mask|=(1<<(high-1-k));\n }\n if(i<mask) swap(a[i],a[mask]);\n }\n\n for(int j=1;(1<<j)<=n;++j){\n int m=(1<<j);\n ll zeta=root[j];\n if(inverse) zeta=invroot[j];\n for(int i=0;i<n;i+=m){\n ll powzeta=1;\n for(int k=i;k<i+m/2;++k){\n ll s=a[k];\n ll t=a[k+m/2]*powzeta%MOD;\n\n a[k]=(s+t)%MOD;\n a[k+m/2]=(s-t+MOD)%MOD;\n powzeta=powzeta*zeta%MOD;\n }\n }\n }\n\n if(inverse){\n ll invn=mod_inverse(n);\n for(int i=0;i<n;++i) a[i]=a[i]*invn%MOD;\n }\n return a;\n}\n\nvector<ll> convolute(const vector<ll> &a,const vector<ll> &b){\n int size=a.size()+b.size()-1;\n int n=1;\n while(n<size) n<<=1;\n\n vector<ll> A(n,0),B(n,0);\n for(int i=0;i<a.size();i++) A[i]=a[i];\n for(int i=0;i<b.size();i++) B[i]=b[i];\n\n A=NTT(A);\n B=NTT(B);\n\n for(int i=0;i<n;++i) A[i]=A[i]*B[i]%MOD;\n A=NTT(A,true);\n\n A.resize(size);\n return A;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int N;\n ll L;\n cin>>N>>L;\n vector<ll> T(N);\n rep(i,N) cin>>T[i];\n int M;\n ll D;\n cin>>M>>D;\n vector<ll> X(M+1),P(M+1);\n rep(i,M) cin>>X[i]>>P[i];\n X[M]=L;\n\n NTT_init();\n\n ll inv100=mod_inverse(100);\n vector<vector<ll>> B(M);\n rep(i,M){\n int diff=X[i+1]-X[i];\n B[i].resize(diff+1,0);\n B[i][0]=P[i]*inv100%MOD;\n B[i][diff]=(100-P[i])*inv100%MOD;\n }\n\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\n rep(i,M) PQ.push(mkp(B[i].size(),i));\n while(PQ.size()>1){\n auto f=PQ.top();\n PQ.pop();\n auto s=PQ.top();\n PQ.pop();\n\n int ft=f.second;\n int st=s.second;\n B[ft]=convolute(B[ft],B[st]);\n B[st].clear();\n\n PQ.push(mkp(B[ft].size(),ft));\n }\n\n auto f=PQ.top();PQ.pop();\n vector<ll> dist=B[f.second];\n vector<ll> revd=dist;\n reverse(all(revd));\n dist=convolute(dist,revd);\n\n int V=dist.size();\n vector<ll> rsum(V+1,0);\n for(int i=V-1;i>=0;i--) rsum[i]=rsum[i+1]+dist[i];\n\n ll ans=0;\n for(int i=1;i<N;i++){\n ll border=L*(T[0]-T[i])/(2*D);\n if(T[0]-T[i]<0&&(L*abs(T[0]-T[i]))%(2*D)) --border;\n ans+=rsum[min((ll)V,border+L)];\n ans=(ans+MOD)%MOD;\n }\n ans=(N-ans+MOD)%MOD;\n cout<<ans<<endl;\n\n\n return 0;\n}","accuracy":0.075,"time_ms":460,"memory_kb":45924,"score_of_the_acc":-0.8945,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_3182_5823737\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cmath>\\n#include <ctime>\\n#include <cstdlib>\\n#include <cassert>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <string>\\n#include <algorithm>\\n#include <utility>\\n#include <complex>\\n#include <unordered_set>\\n#include <unordered_map>\\n#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)\\n#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)\\n#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)\\n#define chmin(x, y) (x) = min((x), (y))\\n#define chmax(x, y) (x) = max((x), (y))\\n#define sz(x) ((ll)(x).size())\\n#define ceil(x, y) (((x)+(y)-1) / (y))\\n#define all(x) (x).begin(),(x).end()\\n#define outl(...) dump_func(__VA_ARGS__)\\n#define outf(x) cout << fixed << setprecision(16) << (x) << endl\\n#define inf 1e18\\nconst double PI = 3.1415926535897932384626433;\\n\\nusing namespace std;\\n\\ntypedef long long llint;\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\n\\nstruct edge{\\n\\tll to, cost;\\n\\tedge(){}\\n\\tedge(ll a, ll b){ to = a, cost = b;}\\n};\\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};\\n\\n//const int mod = 1000000007;\\nconst int mod = 998244353;\\n\\nstruct mint{\\n\\tint x;\\n\\tmint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}\\n\\tmint(const mint &ope) {x = ope.x;}\\n\\t\\n\\tmint operator-(){return mint(-x);}\\n\\tmint operator+(const mint &ope){return mint(x) += ope;}\\n\\tmint operator-(const mint &ope){return mint(x) -= ope;}\\n\\tmint operator*(const mint &ope){return mint(x) *= ope;}\\n\\tmint operator/(const mint &ope){return mint(x) /= ope;}\\n\\tmint& operator+=(const mint &ope){\\n\\t\\tx += ope.x;\\n\\t\\tif(x >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tmint& operator-=(const mint &ope){\\n\\t\\tx += mod - ope.x;\\n\\t\\tif(x >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tmint& operator*=(const mint &ope){\\n\\t\\tll tmp = x;\\n\\t\\ttmp *= ope.x, tmp %= mod;\\n\\t\\tx = tmp;\\n\\t\\treturn *this;\\n\\t}\\n\\tmint& operator/=(const mint &ope){\\n\\t\\tll n = mod-2; mint mul = ope;\\n\\t\\twhile(n){\\n\\t\\t\\tif(n & 1) *this *= mul;\\n\\t\\t\\tmul *= mul;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\tmint inverse(){return mint(1) / *this;}\\n\\tbool operator ==(const mint &ope){return x == ope.x;}\\n\\tbool operator !=(const mint &ope){return x != ope.x;}\\n\\tbool operator <(const mint &ope){return x < ope.x;}\\n};\\nmint modpow(mint a, ll n){\\n\\tif(n == 0) return mint(1);\\n\\tif(n % 2) return a * modpow(a, n-1);\\n\\telse return modpow(a*a, n/2);\\n}\\nistream& operator >>(istream &is, mint &ope){\\n\\tll t; is >> t, ope.x = t;\\n\\treturn is;\\n}\\nostream& operator <<(ostream &os, mint &ope){return os << ope.x;}\\nostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}\\n\\nvector<mint> fact, fact_inv;\\nvoid make_fact(int n){\\n\\tfact.resize(n+1), fact_inv.resize(n+1);\\n\\tfact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);\\n\\tfact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);\\n}\\nmint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}\\nmint perm(int n, int k){ return comb(n, k) * fact[k]; }\\n\\nvector<int> prime, pvec;\\nvoid make_prime(int n){\\n\\tprime.resize(n+1);\\n\\trep(i, 2, n){\\n\\t\\tif(prime[i]) continue;\\n\\t\\tfor(int j = i; j <= n; j+=i) prime[j] = i;\\n\\t}\\n\\trep(i, 2, n) if(prime[i] == i) pvec.push_back(i);\\n}\\n\\nbool exceed(ll x, ll y, ll m){return x >= m / y + 1;}\\nvoid mark(){ cout << \\\"*\\\" << endl; }\\nvoid yes(){ cout << \\\"YES\\\" << endl; }\\nvoid no(){ cout << \\\"NO\\\" << endl; }\\nll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}\\nll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}\\nll lcm(ll a, ll b){return a/gcd(a, b)*b;}\\nll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}\\nll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}\\nstring lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}\\nll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}\\ntemplate<typename T>\\nvoid uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}\\n\\ntemplate<class S, class T> pair<S, T>& operator+=(pair<S,T> &s, const pair<S,T> &t){\\n\\ts.first += t.first, s.second += t.second;\\n\\treturn s;\\n}\\ntemplate<class S, class T> pair<S, T>& operator-=(pair<S,T> &s, const pair<S,T> &t){\\n\\ts.first -= t.first, s.second -= t.second;\\n\\treturn s;\\n}\\ntemplate<class S, class T> pair<S, T> operator+(const pair<S,T> &s, const pair<S,T> &t){\\n\\treturn pair<S,T>(s.first+t.first, s.second+t.second);\\n}\\ntemplate<class S, class T> pair<S, T> operator-(const pair<S,T> &s, const pair<S,T> &t){\\n\\treturn pair<S,T>(s.first-t.first, s.second-t.second);\\n}\\ntemplate<typename T>\\nostream& operator << (ostream& os, vector<T>& vec) {\\n\\tfor(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\" \\\");\\n\\treturn os;\\n}\\ntemplate<typename T>\\nostream& operator << (ostream& os, deque<T>& deq) {\\n\\tfor(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? \\\"\\\" : \\\" \\\");\\n\\treturn os;\\n}\\ntemplate<typename T, typename U>\\nostream& operator << (ostream& os, pair<T, U>& pair_var) {\\n\\tos << \\\"(\\\" << pair_var.first << \\\", \\\" << pair_var.second << \\\")\\\";\\n\\treturn os;\\n}\\ntemplate<typename T, typename U>\\nostream& operator << (ostream& os, const pair<T, U>& pair_var) {\\n\\tos << \\\"(\\\" << pair_var.first << \\\", \\\" << pair_var.second << \\\")\\\";\\n\\treturn os;\\n}\\ntemplate<typename T, typename U>\\nostream& operator << (ostream& os, map<T, U>& map_var) {\\n\\tfor(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {\\n\\t\\tos << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n\\t\\titr++; if(itr != map_var.end()) os << \\\",\\\"; itr--;\\n\\t}\\n\\treturn os;\\n}\\ntemplate<typename T>\\nostream& operator << (ostream& os, set<T>& set_var) {\\n\\tfor(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {\\n\\t\\tos << *itr; ++itr; if(itr != set_var.end()) os << \\\" \\\"; itr--;\\n\\t}\\n\\treturn os;\\n}\\ntemplate<typename T>\\nostream& operator << (ostream& os, multiset<T>& set_var) {\\n\\tfor(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {\\n\\t\\tos << *itr; ++itr; if(itr != set_var.end()) os << \\\" \\\"; itr--;\\n\\t}\\n\\treturn os;\\n}\\ntemplate<typename T>\\nvoid outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << \\\" \\\";}cout << endl;}\\nvoid dump_func(){cout << endl;}\\ntemplate <class Head, class... Tail>\\nvoid dump_func(Head &&head, Tail &&... tail) {\\n\\tcout << head;\\n\\tif(sizeof...(Tail) > 0) cout << \\\" \\\";\\n\\tdump_func(std::move(tail)...);\\n}\\n\\n/*\\n{1224736769, 3}, // 2^24 * 73 + 1,\\n{1053818881, 7}, // 2^20 * 3 * 5 * 67 + 1\\n{1051721729, 6}, // 2^20 * 17 * 59 + 1\\n{1045430273, 3}, // 2^20 * 997 + 1\\n{1012924417, 5}, // 2^21 * 3 * 7 * 23 + 1\\n{1007681537, 3}, // 2^20 * 31^2 + 1\\n{1004535809, 3}, // 2^21 * 479 + 1\\n{998244353, 3}, // 2^23 * 7 * 17 + 1\\n{985661441, 3}, // 2^22 * 5 * 47 + 1\\n{976224257, 3}, // 2^20 * 7^2 * 19 + 1\\n{975175681, 17}, // 2^21 * 3 * 5 * 31 + 1\\n{962592769, 7}, // 2^21 * 3^3 * 17 + 1\\n{950009857, 7}, // 2^21 * 4 * 151 + 1\\n{943718401, 7}, // 2^22 * 3^2 * 5^2 + 1\\n{935329793, 3}, // 2^22 * 223 + 1\\n{924844033, 5}, // 2^21 * 3^2 * 7^2 + 1\\n{469762049, 3}, // 2^26 * 7 + 1\\n{167772161, 3}, // 2^25 * 5 + 1\\n*/\\n\\nstruct FFT_Convolution{\\n\\ttypedef complex<double> C;\\n\\t\\n\\tFFT_Convolution(){};\\n\\tstatic int rev(int x, int n){\\n\\t\\tint ret = 0;\\n\\t\\tfor(int i = 0; i < n; i++) ret <<= 1, ret |= (x>>i) & 1;\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tstatic void DFT(vector<C> &f, vector<C> &F, int n)\\n\\t{\\n\\t\\tint N = 1<<n;\\n\\t\\tF.resize(N);\\n\\t\\tfor(int i = 0; i < N; i++) F[rev(i, n)] = f[i];\\n\\t\\t\\n\\t\\tC a, b, x, z;\\n\\t\\tfor(int i = 1; i <= n; i++){\\n\\t\\t\\tint l = 1<<i;\\n\\t\\t\\tz = C(cos(2*PI/l), sin(2*PI/l));\\n\\t\\t\\tfor(int j = 0; j < N/l; j++){\\n\\t\\t\\t\\tx = C(1, 0);\\n\\t\\t\\t\\tfor(int k = 0; k < l/2; k++){\\n\\t\\t\\t\\t\\ta = F[j*l+k], b = F[j*l+k+l/2];\\n\\t\\t\\t\\t\\tF[j*l+k] = a + x * b;\\n\\t\\t\\t\\t\\tF[j*l+k+l/2] = a - x * b;\\n\\t\\t\\t\\t\\tx *= z;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstatic void IDFT(vector<C> &F, vector<C> &f, int n)\\n\\t{\\n\\t\\tint N = 1<<n;\\n\\t\\tfor(int i = 0; i < N; i++) f[rev(i, n)] = F[i];\\n\\t\\t\\n\\t\\tC a, b, x, z;\\n\\t\\tfor(int i = 1; i <= n; i++){\\n\\t\\t\\tint l = 1<<i;\\n\\t\\t\\tz = C(cos(2*PI/l), -sin(2*PI/l));\\n\\t\\t\\tfor(int j = 0; j < N/l; j++){\\n\\t\\t\\t\\tx = C(1, 0);\\n\\t\\t\\t\\tfor(int k = 0; k < l/2; k++){\\n\\t\\t\\t\\t\\ta = f[j*l+k], b = f[j*l+k+l/2];\\n\\t\\t\\t\\t\\tf[j*l+k] = a + x * b;\\n\\t\\t\\t\\t\\tf[j*l+k+l/2] = a - x * b;\\n\\t\\t\\t\\t\\tx *= z;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < N; i++) f[i] /= N;\\n\\t}\\n\\tstatic ll round(C c){return (ll)(c.real()+0.5);}\\n\\t\\n\\tstatic void conv(vector<ll> f, vector<ll> g, vector<ll> &dest)\\n\\t{\\n\\t\\tll logf = 0, logg = 0, len = f.size() + g.size();\\n\\t\\tfor(int i = f.size(); i; i /= 2) logf++;\\n\\t\\tfor(int i = g.size(); i; i /= 2) logg++;\\n\\t\\t\\n\\t\\tll n = max(logf, logg)+1, N = 1<<n;\\n\\t\\tvector<C> f2(N), g2(N);\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tif(i < f.size()) f2[i] = C(f[i], 0);\\n\\t\\t\\telse f2[i] = C(0, 0);\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tif(i < g.size()) g2[i] = C(g[i], 0);\\n\\t\\t\\telse g2[i] = C(0, 0);\\n\\t\\t}\\n\\t\\t\\n\\t\\tvector<C> F, G;\\n\\t\\tDFT(f2, F, n), DFT(g2, G, n);\\n\\t\\tfor(int i = 0; i < N; i++) F[i] *= G[i];\\n\\t\\tIDFT(F, f2, n);\\n\\t\\t\\n\\t\\tdest.resize(len-1);\\n\\t\\tfor(int i = 0; i < dest.size(); i++) dest[i] = round(f2[i]);\\n\\t}\\n};\\n\\nstruct NTT_Convolution{\\n\\tNTT_Convolution(){};\\n\\tstatic int rev(int x, int n){\\n\\t\\tint ret = 0;\\n\\t\\tfor(int i = 0; i < n; i++) ret <<= 1, ret |= (x>>i) & 1;\\n\\t\\treturn ret;\\n\\t}\\n\\tstatic void DFT(vector<mint> &f, vector<mint> &F, int n, mint root, bool inv = false)\\n\\t{\\n\\t\\tint N = 1<<n;\\n\\t\\tF.resize(N);\\n\\t\\tfor(int i = 0; i < N; i++) F[rev(i, n)] = f[i];\\n\\t\\tif(inv) root = root.inverse();\\n\\t\\t\\n\\t\\tmint a, b, x, z;\\n\\t\\tfor(int i = 0; i < n; i++){\\n\\t\\t\\tint l = 1<<i;\\n\\t\\t\\tz = modpow(root, 1<<(n-(i+1)));\\n\\t\\t\\tfor(int j = 0; j < N; j+=l*2){\\n\\t\\t\\t\\tx = 1;\\n\\t\\t\\t\\tfor(int k = j; k < j+l; k++){\\n\\t\\t\\t\\t\\ta = F[k], b = F[k+l] * x;\\n\\t\\t\\t\\t\\tF[k] = a + b, F[k+l] = a - b, x *= z;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(inv){\\n\\t\\t\\tmint Ninv = mint(N).inverse();\\n\\t\\t\\tfor(int i = 0; i < N; i++) F[i] *= Ninv;\\n\\t\\t}\\n\\t}\\n\\tstatic void conv(vector<mint> f, vector<mint> g, vector<mint> &dest)\\n\\t{\\n\\t\\tll logf = 0, logg = 0, len = f.size() + g.size();\\n\\t\\tfor(int i = f.size(); i; i /= 2) logf++;\\n\\t\\tfor(int i = g.size(); i; i /= 2) logg++;\\n\\t\\t\\n\\t\\tll n = max(logf, logg)+1, N = 1<<n;\\n\\t\\tf.resize(N), g.resize(N);\\n\\t\\tmint root = modpow(mint(3), 119 * (1<<23-n));\\n\\t\\t\\n\\t\\tvector<mint> F, G;\\n\\t\\tDFT(f, F, n, root), DFT(g, G, n, root);\\n\\t\\tfor(int i = 0; i < N; i++) F[i] *= G[i];\\n\\t\\tDFT(F, f, n, root, true);\\n\\t\\t\\n\\t\\tf.resize(len-1);\\n\\t\\tdest = f;\\n\\t}\\n};\\n\\nstruct ConvolutionMerge{\\n\\tint id;\\n\\tvector<vector<mint> > vec;\\n\\tpriority_queue<P, vector<P>, greater<P> >Q;\\n\\t\\n\\tConvolutionMerge(){init();}\\n\\tvoid init(){\\n\\t\\tid = 0;\\n\\t\\tvec.clear();\\n\\t\\twhile(Q.size()) Q.pop();\\n\\t\\tvector<mint> f;\\n\\t\\tf.push_back(mint(1));\\n\\t\\tadd(f);\\n\\t}\\n\\tvoid add(vector<mint> &f){\\n\\t\\tQ.push(P(f.size(), id++));\\n\\t\\tvec.push_back(f);\\n\\t}\\n\\tvoid calc(vector<mint> &dest){\\n\\t\\twhile(Q.size() >= 2){\\n\\t\\t\\tll u = Q.top().second; Q.pop();\\n\\t\\t\\tll v = Q.top().second; Q.pop();\\n\\t\\t\\tNTT_Convolution::conv(vec[u], vec[v], vec[u]);\\n\\t\\t\\tQ.push(P(vec[u].size(), u));\\n\\t\\t}\\n\\t\\tdest = vec[Q.top().second];\\n\\t}\\n};\\n\\nllint n, L;\\nllint t[100005];\\nllint m, d;\\nllint x[100005], w[100005];\\nmint p[100005], sum[200005];\\nConvolutionMerge cm;\\n\\nint main(void)\\n{\\n\\tios::sync_with_stdio(0);\\n\\tcin.tie(0);\\n\\t\\n\\tcin >> n >> L;\\n\\tfor(int i = 1; i <= n; i++) cin >> t[i];\\n\\tcin >> m >> d;\\n\\tfor(int i = 1; i <= m; i++) cin >> x[i] >> p[i];\\n\\t\\n\\tmint inv100 = mint(100).inverse();\\n\\t\\n\\tx[m+1] = L;\\n\\tfor(int i = 1; i <= m; i++){\\n\\t\\tw[i] = x[i+1] - x[i];\\n\\t\\tp[i] *= inv100;\\n\\t}\\n\\t\\n\\tvector<mint> vec;\\n\\tfor(int i = 1; i <= m; i++){\\n\\t\\tvec.clear(), vec.resize(w[i]+1);\\n\\t\\tvec[0] = mint(1) - p[i];\\n\\t\\tvec[w[i]] = p[i];\\n\\t\\tcm.add(vec);\\n\\t}\\n\\tcm.calc(vec);\\n\\t\\n\\tvector<mint> f(L+1), g(L+1);\\n\\treps(i, vec) f[i] = vec[i], g[L-i] = vec[i];\\n\\tNTT_Convolution::conv(f, g, f);\\n\\tfor(int i = 2*L; i >= 0; i--) sum[i] = sum[i+1] + f[i];\\n\\t\\n\\tmint ans = 1;\\n\\tfor(int i = 2; i <= n; i++){\\n\\t\\tllint b = (L*(t[1]-t[i])+2*d-1)/(2*d);\\n\\t\\tif(L*(t[1]-t[i]) < 0) b = L*(t[1]-t[i])/(2*d);\\n\\t\\t\\n\\t\\tmint p = 0;\\n\\t\\tif(b <= -L) p = 1;\\n\\t\\telse if(b <= L) p = sum[b+L];\\n\\t\\tans += mint(1) - p;\\n\\t}\\n\\toutl(ans);\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 26196,\n \"score_of_the_acc\": -0.4237,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3182_5304761\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\n#include <algorithm>\\n#include <array>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param n `0 <= n`\\n// @return minimum non-negative `x` s.t. `n <= 2**x`\\nint ceil_pow2(int n) {\\n int x = 0;\\n while ((1U << x) < (unsigned int)(n)) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nint bsf(unsigned int n) {\\n#ifdef _MSC_VER\\n unsigned long index;\\n _BitScanForward(&index, n);\\n return index;\\n#else\\n return __builtin_ctz(n);\\n#endif\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n\\n#include <utility>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast moduler by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m`\\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n for (long long a : {2, 7, 61}) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <type_traits>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\\nvoid butterfly(std::vector<mint>& a) {\\n static constexpr int g = internal::primitive_root<mint::mod()>;\\n int n = int(a.size());\\n int h = internal::ceil_pow2(n);\\n\\n static bool first = true;\\n static mint sum_e[30]; // sum_e[i] = ies[0] * ... * ies[i - 1] * es[i]\\n if (first) {\\n first = false;\\n mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1\\n int cnt2 = bsf(mint::mod() - 1);\\n mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();\\n for (int i = cnt2; i >= 2; i--) {\\n // e^(2^i) == 1\\n es[i - 2] = e;\\n ies[i - 2] = ie;\\n e *= e;\\n ie *= ie;\\n }\\n mint now = 1;\\n for (int i = 0; i < cnt2 - 2; i++) {\\n sum_e[i] = es[i] * now;\\n now *= ies[i];\\n }\\n }\\n for (int ph = 1; ph <= h; ph++) {\\n int w = 1 << (ph - 1), p = 1 << (h - ph);\\n mint now = 1;\\n for (int s = 0; s < w; s++) {\\n int offset = s << (h - ph + 1);\\n for (int i = 0; i < p; i++) {\\n auto l = a[i + offset];\\n auto r = a[i + offset + p] * now;\\n a[i + offset] = l + r;\\n a[i + offset + p] = l - r;\\n }\\n now *= sum_e[bsf(~(unsigned int)(s))];\\n }\\n }\\n}\\n\\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\\nvoid butterfly_inv(std::vector<mint>& a) {\\n static constexpr int g = internal::primitive_root<mint::mod()>;\\n int n = int(a.size());\\n int h = internal::ceil_pow2(n);\\n\\n static bool first = true;\\n static mint sum_ie[30]; // sum_ie[i] = es[0] * ... * es[i - 1] * ies[i]\\n if (first) {\\n first = false;\\n mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1\\n int cnt2 = bsf(mint::mod() - 1);\\n mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();\\n for (int i = cnt2; i >= 2; i--) {\\n // e^(2^i) == 1\\n es[i - 2] = e;\\n ies[i - 2] = ie;\\n e *= e;\\n ie *= ie;\\n }\\n mint now = 1;\\n for (int i = 0; i < cnt2 - 2; i++) {\\n sum_ie[i] = ies[i] * now;\\n now *= es[i];\\n }\\n }\\n\\n for (int ph = h; ph >= 1; ph--) {\\n int w = 1 << (ph - 1), p = 1 << (h - ph);\\n mint inow = 1;\\n for (int s = 0; s < w; s++) {\\n int offset = s << (h - ph + 1);\\n for (int i = 0; i < p; i++) {\\n auto l = a[i + offset];\\n auto r = a[i + offset + p];\\n a[i + offset] = l + r;\\n a[i + offset + p] =\\n (unsigned long long)(mint::mod() + l.val() - r.val()) *\\n inow.val();\\n }\\n inow *= sum_ie[bsf(~(unsigned int)(s))];\\n }\\n }\\n}\\n\\n} // namespace internal\\n\\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\\nstd::vector<mint> convolution(std::vector<mint> a, std::vector<mint> b) {\\n int n = int(a.size()), m = int(b.size());\\n if (!n || !m) return {};\\n if (std::min(n, m) <= 60) {\\n if (n < m) {\\n std::swap(n, m);\\n std::swap(a, b);\\n }\\n std::vector<mint> ans(n + m - 1);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n ans[i + j] += a[i] * b[j];\\n }\\n }\\n return ans;\\n }\\n int z = 1 << internal::ceil_pow2(n + m - 1);\\n a.resize(z);\\n internal::butterfly(a);\\n b.resize(z);\\n internal::butterfly(b);\\n for (int i = 0; i < z; i++) {\\n a[i] *= b[i];\\n }\\n internal::butterfly_inv(a);\\n a.resize(n + m - 1);\\n mint iz = mint(z).inv();\\n for (int i = 0; i < n + m - 1; i++) a[i] *= iz;\\n return a;\\n}\\n\\ntemplate <unsigned int mod = 998244353,\\n class T,\\n std::enable_if_t<internal::is_integral<T>::value>* = nullptr>\\nstd::vector<T> convolution(const std::vector<T>& a, const std::vector<T>& b) {\\n int n = int(a.size()), m = int(b.size());\\n if (!n || !m) return {};\\n\\n using mint = static_modint<mod>;\\n std::vector<mint> a2(n), b2(m);\\n for (int i = 0; i < n; i++) {\\n a2[i] = mint(a[i]);\\n }\\n for (int i = 0; i < m; i++) {\\n b2[i] = mint(b[i]);\\n }\\n auto c2 = convolution(move(a2), move(b2));\\n std::vector<T> c(n + m - 1);\\n for (int i = 0; i < n + m - 1; i++) {\\n c[i] = c2[i].val();\\n }\\n return c;\\n}\\n\\nstd::vector<long long> convolution_ll(const std::vector<long long>& a,\\n const std::vector<long long>& b) {\\n int n = int(a.size()), m = int(b.size());\\n if (!n || !m) return {};\\n\\n static constexpr unsigned long long MOD1 = 754974721; // 2^24\\n static constexpr unsigned long long MOD2 = 167772161; // 2^25\\n static constexpr unsigned long long MOD3 = 469762049; // 2^26\\n static constexpr unsigned long long M2M3 = MOD2 * MOD3;\\n static constexpr unsigned long long M1M3 = MOD1 * MOD3;\\n static constexpr unsigned long long M1M2 = MOD1 * MOD2;\\n static constexpr unsigned long long M1M2M3 = MOD1 * MOD2 * MOD3;\\n\\n static constexpr unsigned long long i1 =\\n internal::inv_gcd(MOD2 * MOD3, MOD1).second;\\n static constexpr unsigned long long i2 =\\n internal::inv_gcd(MOD1 * MOD3, MOD2).second;\\n static constexpr unsigned long long i3 =\\n internal::inv_gcd(MOD1 * MOD2, MOD3).second;\\n\\n auto c1 = convolution<MOD1>(a, b);\\n auto c2 = convolution<MOD2>(a, b);\\n auto c3 = convolution<MOD3>(a, b);\\n\\n std::vector<long long> c(n + m - 1);\\n for (int i = 0; i < n + m - 1; i++) {\\n unsigned long long x = 0;\\n x += (c1[i] * i1) % MOD1 * M2M3;\\n x += (c2[i] * i2) % MOD2 * M1M3;\\n x += (c3[i] * i3) % MOD3 * M1M2;\\n // B = 2^63, -B <= x, r(real value) < B\\n // (x, x - M, x - 2M, or x - 3M) = r (mod 2B)\\n // r = c1[i] (mod MOD1)\\n // focus on MOD1\\n // r = x, x - M', x - 2M', x - 3M' (M' = M % 2^64) (mod 2B)\\n // r = x,\\n // x - M' + (0 or 2B),\\n // x - 2M' + (0, 2B or 4B),\\n // x - 3M' + (0, 2B, 4B or 6B) (without mod!)\\n // (r - x) = 0, (0)\\n // - M' + (0 or 2B), (1)\\n // -2M' + (0 or 2B or 4B), (2)\\n // -3M' + (0 or 2B or 4B or 6B) (3) (mod MOD1)\\n // we checked that\\n // ((1) mod MOD1) mod 5 = 2\\n // ((2) mod MOD1) mod 5 = 3\\n // ((3) mod MOD1) mod 5 = 4\\n long long diff =\\n c1[i] - internal::safe_mod((long long)(x), (long long)(MOD1));\\n if (diff < 0) diff += MOD1;\\n static constexpr unsigned long long offset[5] = {\\n 0, 0, M1M2M3, 2 * M1M2M3, 3 * M1M2M3};\\n x -= offset[diff % 5];\\n c[i] = x;\\n }\\n\\n return c;\\n}\\n\\n} // namespace atcoder\\n\\n\\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\\n#define rep(i, n) For((i), 0, (n))\\n#define rrep(i, n) rFor((i), (n), 0)\\n#define fi first\\n#define se second\\n\\nusing namespace std;\\n\\ntypedef long long lint;\\ntypedef unsigned long long ulint;\\ntypedef pair<int, int> pii;\\ntypedef pair<lint, lint> pll;\\n\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T>\\nT div_floor(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a >= 0 ? a / b : (a + 1) / b - 1;\\n}\\ntemplate <class T>\\nT div_ceil(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a > 0 ? (a - 1) / b + 1 : a / b;\\n}\\n\\ntemplate <typename T>\\nstruct coord_comp {\\n vector<T> v;\\n bool sorted = false;\\n\\n coord_comp() {}\\n\\n int size() { return v.size(); }\\n\\n void add(T x) { v.push_back(x); }\\n\\n void build() {\\n sort(v.begin(), v.end());\\n v.erase(unique(v.begin(), v.end()), v.end());\\n sorted = true;\\n }\\n\\n int get_idx(T x) {\\n assert(sorted);\\n return lower_bound(v.begin(), v.end(), x) - v.begin();\\n }\\n};\\n\\nconstexpr lint mod = 1000000007;\\nconstexpr lint INF = mod * mod;\\nconstexpr int MAX = 200010;\\n\\nusing namespace atcoder;\\nusing mint = modint998244353;\\nusing poly = vector<mint>;\\n\\nint main() {\\n int n;\\n lint L;\\n scanf(\\\"%d%lld\\\", &n, &L);\\n lint t[n];\\n rep(i, n) scanf(\\\"%lld\\\", &t[i]);\\n int m;\\n lint D;\\n scanf(\\\"%d%lld\\\", &m, &D);\\n int x[m + 1];\\n mint p[m];\\n mint inv100 = mint(100).inv();\\n rep(i, m) {\\n int tmp;\\n scanf(\\\"%d%d\\\", &x[i], &tmp);\\n p[i] = mint(tmp) * inv100;\\n }\\n x[m] = L;\\n\\n auto cmp = [&](const poly &a, const poly &b) {\\n return a.size() > b.size();\\n };\\n priority_queue<poly, vector<poly>, decltype(cmp)> que(cmp);\\n rep(i, m) {\\n mint a = p[i] * (mint(1) - p[i]);\\n mint b = p[i].pow(2) + (mint(1) - p[i]).pow(2);\\n poly v(2 * (x[i + 1] - x[i]) + 1);\\n v[0] = v[2 * (x[i + 1] - x[i])] = a;\\n v[x[i + 1] - x[i]] = b;\\n que.push(v);\\n }\\n while (que.size() >= 2) {\\n auto a = que.top();\\n que.pop();\\n auto b = que.top();\\n que.pop();\\n que.push(convolution(a, b));\\n }\\n auto a = que.top();\\n rrep(i, a.size() - 1) a[i] += a[i + 1];\\n\\n mint ans = 1;\\n For(i, 1, n) {\\n lint k = div_floor(L * (t[i] - t[0]), 2 * D) + 1 + L - x[0];\\n if (k < (int)a.size()) ans += a[max(0LL, k)];\\n }\\n printf(\\\"%u\\\\n\\\", ans.val());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 14212,\n \"score_of_the_acc\": -0.0126,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3182_4951247\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\nusing mint = ModInt<>;\\n\\ntemplate <int mod = 998244353>\\nstruct NTT {\\n int base, maxb, root;\\n vector<int> rv, roots, invr;\\n NTT() : base(1), rv({0, 1}), roots({0, 1}), invr({0, 1}) {\\n assert(mod >= 3 && mod & 1);\\n int tmp = mod - 1;\\n maxb = 0;\\n while (!(tmp & 1)) tmp >>= 1, ++maxb;\\n root = 2;\\n while (mpow(root, (mod - 1) >> 1) == 1) ++root;\\n assert(mpow(root, mod - 1) == 1);\\n root = mpow(root, (mod - 1) >> maxb);\\n }\\n\\n inline int mpow(int x, int n) {\\n int res = 1;\\n while (n) {\\n if (n & 1) res = mul(res, x);\\n x = mul(x, x);\\n n >>= 1;\\n }\\n return res;\\n }\\n\\n inline int inv(int x) {\\n assert(x != 0);\\n return mpow(x, mod - 2);\\n }\\n\\n inline int add(int x, int y) {\\n if ((x += y) >= mod) x -= mod;\\n return x;\\n }\\n\\n inline int mul(int x, int y) { return (int)(1LL * x * y % mod); }\\n\\n void ensure_base(int nb) {\\n if (nb <= base) return;\\n rv.resize(1 << nb);\\n roots.resize(1 << nb);\\n invr.resize(1 << nb);\\n for (int i = 0; i < (1 << nb); ++i)\\n rv[i] = (rv[i >> 1] >> 1) + ((i & 1) << (nb - 1));\\n assert(nb <= maxb);\\n while (base < nb) {\\n int z = mpow(root, 1 << (maxb - 1 - base)), invz = inv(z);\\n for (int i = 1 << (base - 1); i < (1 << base); ++i) {\\n roots[i << 1] = roots[i];\\n roots[(i << 1) + 1] = mul(roots[i], z);\\n invr[i << 1] = invr[i];\\n invr[(i << 1) + 1] = mul(invr[i], invz);\\n }\\n ++base;\\n }\\n }\\n void ntt(vector<int> &a, int n, bool sg = 0) {\\n assert((n & (n - 1)) == 0);\\n int dif = base - __builtin_ctz(n);\\n for (int i = 0; i < n; ++i)\\n if (i < (rv[i] >> dif)) swap(a[i], a[rv[i] >> dif]);\\n for (int k = 1; k < n; k <<= 1)\\n for (int i = 0; i < n; i += 2 * k)\\n for (int j = 0; j < k; ++j) {\\n int z = mul(a[i + j + k], (sg ? roots[j + k] : invr[j + k]));\\n a[i + j + k] = add(a[i + j], mod - z);\\n a[i + j] = add(a[i + j], z);\\n }\\n int invn = inv(n);\\n if (sg)\\n for (int i = 0; i < n; ++i) a[i] = mul(a[i], invn);\\n }\\n template <class T>\\n vector<T> multiply(const vector<T> &a, const vector<T> &b) {\\n int need = a.size() + b.size() - 1;\\n int nb = 1;\\n while ((1 << nb) < need) ++nb;\\n ensure_base(nb);\\n int sz = 1 << nb;\\n vector<int> fa(sz, 0), fb(sz, 0);\\n for (int i = 0; i < sz; ++i) {\\n if (i < a.size()) fa[i] = a[i];\\n if (i < b.size()) fb[i] = b[i];\\n }\\n ntt(fa, sz);\\n ntt(fb, sz);\\n for (int i = 0; i < sz; ++i) fa[i] = mul(fa[i], fb[i]);\\n ntt(fa, sz, 1);\\n vector<T> res(need);\\n for (int i = 0; i < need; ++i) res[i] = fa[i];\\n return res;\\n }\\n};\\n\\nint n, l, m, d;\\nvector<int> t, x, p;\\nvector<mint> sum;\\nNTT ntt;\\n\\nmint solve();\\n\\nint main() {\\n cin >> n >> l;\\n t.resize(n);\\n for (auto &i : t) cin >> i;\\n cin >> m >> d;\\n x.resize(m);\\n p.resize(m);\\n for (int i = 0; i < m; ++i) cin >> x[i] >> p[i];\\n x.push_back(l);\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nmint solve() {\\n { // pre\\n queue<vector<int>> qu;\\n for (int i = 0; i < m; ++i) {\\n int len = x[i + 1] - x[i];\\n vector<int> v(2 * len + 1, 0);\\n mint np = mint(p[i]) / 100, revp = -np + 1;\\n v[0] = v[2 * len] = (np * revp).x;\\n v[len] = mint(1 - 2 * v[0]).x;\\n qu.push(v);\\n }\\n while (qu.size() > 1) {\\n auto lv = qu.front();\\n qu.pop();\\n qu.push(ntt.multiply(lv, qu.front()));\\n qu.pop();\\n }\\n auto v = qu.front();\\n int len = v.size();\\n sum.resize(len);\\n for (int i = 0; i < len; ++i) {\\n sum[i] = v[i];\\n if (i) sum[i] += sum[i - 1];\\n }\\n }\\n mint res = n;\\n int len = sum.size();\\n for (int i = 1; i < n; ++i) {\\n long long time = 1LL * (t[i] - t[0]) * l + 2LL * d * (l - x[0]);\\n if (time >= 0) res -= sum[min(time / (2 * d), len - 1LL)];\\n }\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 15812,\n \"score_of_the_acc\": -0.1446,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3182_4950800\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\nusing mint = ModInt<>;\\n\\ntemplate <int mod = 998244353>\\nstruct NTT {\\n int base, maxb, root;\\n vector<int> rv, roots, invr;\\n NTT() : base(1), rv({0, 1}), roots({0, 1}), invr({0, 1}) {\\n assert(mod >= 3 && mod & 1);\\n int tmp = mod - 1;\\n maxb = 0;\\n while (!(tmp & 1)) tmp >>= 1, ++maxb;\\n root = 2;\\n while (mpow(root, (mod - 1) >> 1) == 1) ++root;\\n assert(mpow(root, mod - 1) == 1);\\n root = mpow(root, (mod - 1) >> maxb);\\n }\\n\\n inline int mpow(int x, int n) {\\n int res = 1;\\n while (n) {\\n if (n & 1) res = mul(res, x);\\n x = mul(x, x);\\n n >>= 1;\\n }\\n return res;\\n }\\n\\n inline int inv(int x) { return mpow(x, mod - 2); }\\n\\n inline int add(int x, int y) {\\n if ((x += y) >= mod) x -= mod;\\n return x;\\n }\\n\\n inline int mul(int x, int y) { return (int)(1LL * x * y % mod); }\\n\\n void ensure_base(int nb) {\\n if (nb <= base) return;\\n rv.resize(1 << nb);\\n roots.resize(1 << nb);\\n invr.resize(1 << nb);\\n for (int i = 0; i < (1 << nb); ++i)\\n rv[i] = (rv[i >> 1] >> 1) + ((i & 1) << (nb - 1));\\n assert(nb <= maxb);\\n while (base < nb) {\\n int z = mpow(root, 1 << (maxb - 1 - base)), invz = inv(z);\\n for (int i = 1 << (base - 1); i < (1 << base); ++i) {\\n roots[i << 1] = roots[i];\\n roots[(i << 1) + 1] = mul(roots[i], z);\\n invr[i << 1] = invr[i];\\n invr[(i << 1) + 1] = mul(invr[i], invz);\\n }\\n ++base;\\n }\\n }\\n void ntt(vector<int> &a, int n, bool sg = 0) {\\n assert((n & (n - 1)) == 0);\\n for (int i = 0; i < n; ++i)\\n if (i < rv[i]) swap(a[i], a[rv[i]]);\\n for (int k = 1; k < n; k <<= 1)\\n for (int i = 0; i < n; i += 2 * k)\\n for (int j = 0; j < k; ++j) {\\n int z = mul(a[i + j + k], (sg ? roots[j + k] : invr[j + k]));\\n a[i + j + k] = add(a[i + j], mod - z);\\n a[i + j] = add(a[i + j], z);\\n }\\n int invn = inv(n);\\n if (sg)\\n for (int i = 0; i < n; ++i) a[i] = mul(a[i], invn);\\n }\\n template <class T>\\n vector<T> multiply(const vector<T> &a, const vector<T> &b) {\\n int need = a.size() + b.size() - 1;\\n int nb = 1;\\n while ((1 << nb) < need) ++nb;\\n ensure_base(nb);\\n int sz = 1 << nb;\\n vector<int> fa(sz, 0), fb(sz, 0);\\n for (int i = 0; i < sz; ++i) {\\n if (i < a.size()) fa[i] = a[i];\\n if (i < b.size()) fb[i] = b[i];\\n }\\n ntt(fa, sz);\\n ntt(fb, sz);\\n for (int i = 0; i < sz; ++i) fa[i] = mul(fa[i], fb[i]);\\n ntt(fa, sz, 1);\\n vector<T> res(need);\\n for (int i = 0; i < need; ++i) res[i] = fa[i];\\n mint x = 0;\\n for (auto p : res) x += p;\\n cout << x << endl;\\n x = 0;\\n for (auto p : a) x += p;\\n cout << x << endl;\\n x = 0;\\n for (auto p : b) x += p;\\n cout << x << endl;\\n return res;\\n }\\n};\\n\\ntemplate <int mod>\\nstruct NumberTheoreticTransform {\\n vector<int> rev, rts;\\n int base, max_base, root;\\n\\n NumberTheoreticTransform() : base(1), rev{0, 1}, rts{0, 1} {\\n assert(mod >= 3 && mod % 2 == 1);\\n auto tmp = mod - 1;\\n max_base = 0;\\n while (tmp % 2 == 0) tmp >>= 1, max_base++;\\n root = 2;\\n while (mod_pow(root, (mod - 1) >> 1) == 1) ++root;\\n assert(mod_pow(root, mod - 1) == 1);\\n root = mod_pow(root, (mod - 1) >> max_base);\\n }\\n\\n inline int mod_pow(int x, int n) {\\n int ret = 1;\\n while (n > 0) {\\n if (n & 1) ret = mul(ret, x);\\n x = mul(x, x);\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n inline int inverse(int x) { return mod_pow(x, mod - 2); }\\n\\n inline unsigned add(unsigned x, unsigned y) {\\n x += y;\\n if (x >= mod) x -= mod;\\n return x;\\n }\\n\\n inline unsigned mul(unsigned a, unsigned b) {\\n return 1ull * a * b % (unsigned long long)mod;\\n }\\n\\n void ensure_base(int nbase) {\\n if (nbase <= base) return;\\n rev.resize(1 << nbase);\\n rts.resize(1 << nbase);\\n for (int i = 0; i < (1 << nbase); i++) {\\n rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));\\n }\\n assert(nbase <= max_base);\\n while (base < nbase) {\\n int z = mod_pow(root, 1 << (max_base - 1 - base));\\n for (int i = 1 << (base - 1); i < (1 << base); i++) {\\n rts[i << 1] = rts[i];\\n rts[(i << 1) + 1] = mul(rts[i], z);\\n }\\n ++base;\\n }\\n }\\n\\n void ntt(vector<int> &a) {\\n const int n = (int)a.size();\\n assert((n & (n - 1)) == 0);\\n int zeros = __builtin_ctz(n);\\n ensure_base(zeros);\\n int shift = base - zeros;\\n for (int i = 0; i < n; i++) {\\n if (i < (rev[i] >> shift)) {\\n swap(a[i], a[rev[i] >> shift]);\\n }\\n }\\n for (int k = 1; k < n; k <<= 1) {\\n for (int i = 0; i < n; i += 2 * k) {\\n for (int j = 0; j < k; j++) {\\n int z = mul(a[i + j + k], rts[j + k]);\\n a[i + j + k] = add(a[i + j], mod - z);\\n a[i + j] = add(a[i + j], z);\\n }\\n }\\n }\\n }\\n\\n vector<int> multiply(vector<int> a, vector<int> b) {\\n int need = a.size() + b.size() - 1;\\n int nbase = 1;\\n while ((1 << nbase) < need) nbase++;\\n ensure_base(nbase);\\n int sz = 1 << nbase;\\n a.resize(sz, 0);\\n b.resize(sz, 0);\\n ntt(a);\\n ntt(b);\\n int inv_sz = inverse(sz);\\n for (int i = 0; i < sz; i++) {\\n a[i] = mul(a[i], mul(b[i], inv_sz));\\n }\\n reverse(a.begin() + 1, a.end());\\n ntt(a);\\n a.resize(need);\\n return a;\\n }\\n};\\n\\nint n, l, m, d;\\nvector<int> t, x, p;\\nvector<mint> sum;\\nNTT ntt;\\n\\nmint solve();\\n\\nint main() {\\n cin >> n >> l;\\n t.resize(n);\\n for (auto &i : t) cin >> i;\\n cin >> m >> d;\\n x.resize(m);\\n p.resize(m);\\n for (int i = 0; i < m; ++i) cin >> x[i] >> p[i];\\n x.push_back(l);\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nmint solve() {\\n { // pre\\n queue<vector<int>> qu;\\n for (int i = 0; i < m; ++i) {\\n int len = x[i + 1] - x[i];\\n vector<int> v(2 * len + 1, 0);\\n mint np = mint(p[i]) / 100, revp = -np + 1;\\n v[0] = v[2 * len] = (np * revp).x;\\n v[len] = mint(1 - 2 * v[0]).x;\\n qu.push(v);\\n }\\n NumberTheoreticTransform<998244353> ntt2;\\n while (qu.size() > 1) {\\n auto lv = qu.front();\\n qu.pop();\\n auto rv = qu.front();\\n qu.pop();\\n auto v = ntt2.multiply(lv, rv);\\n qu.push(v);\\n }\\n auto v = qu.front();\\n int len = v.size();\\n sum.resize(len);\\n for (int i = 0; i < len; ++i) {\\n sum[i] = v[i];\\n if (i) sum[i] += sum[i - 1];\\n }\\n }\\n mint res = n;\\n int len = sum.size();\\n for (int i = 1; i < n; ++i) {\\n long long time = 1LL * (t[i] - t[0]) * l + 2LL * d * (l - x[0]);\\n if (time >= 0) res -= sum[min(time / (2 * d), len - 1LL)];\\n }\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 14480,\n \"score_of_the_acc\": -0.1301,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3182_4950763\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(998244353)>\\nstruct ModInt {\\n int x;\\n constexpr ModInt() : x(0) {}\\n constexpr ModInt(int64_t y)\\n : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n constexpr ModInt &operator+=(const ModInt &p) noexcept {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator-=(const ModInt &p) noexcept {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr ModInt &operator*=(const ModInt &p) noexcept {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n constexpr ModInt &operator/=(const ModInt &p) noexcept {\\n *this *= p.inverse();\\n return *this;\\n }\\n constexpr ModInt operator-() const { return ModInt(-x); }\\n constexpr ModInt operator+(const ModInt &p) const noexcept {\\n return ModInt(*this) += p;\\n }\\n constexpr ModInt operator-(const ModInt &p) const noexcept {\\n return ModInt(*this) -= p;\\n }\\n constexpr ModInt operator*(const ModInt &p) const noexcept {\\n return ModInt(*this) *= p;\\n }\\n constexpr ModInt operator/(const ModInt &p) const noexcept {\\n return ModInt(*this) /= p;\\n }\\n constexpr bool operator==(const ModInt &p) const noexcept { return x == p.x; }\\n constexpr bool operator!=(const ModInt &p) const noexcept { return x != p.x; }\\n constexpr ModInt inverse() const noexcept {\\n int a = x, b = mod, u = 1, v = 0, t = 0;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n constexpr ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr ostream &operator<<(ostream &os, const ModInt &p) noexcept {\\n return os << p.x;\\n }\\n friend constexpr istream &operator>>(istream &is, ModInt &a) noexcept {\\n int64_t t = 0;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n constexpr int get_mod() { return mod; }\\n};\\nusing mint = ModInt<>;\\n\\ntemplate <int mod = 998244353>\\nstruct NTT {\\n int base, maxb, root;\\n vector<int> rv, roots, invr;\\n NTT() : base(1), rv({0, 1}), roots({0, 1}), invr({0, 1}) {\\n assert(mod >= 3 && mod & 1);\\n int tmp = mod - 1;\\n maxb = 0;\\n while (!(tmp & 1)) tmp >>= 1, ++maxb;\\n root = 2;\\n while (mpow(root, (mod - 1) >> 1) == 1) ++root;\\n assert(mpow(root, mod - 1) == 1);\\n root = mpow(root, (mod - 1) >> maxb);\\n }\\n\\n inline int mpow(int x, int n) {\\n int res = 1;\\n while (n) {\\n if (n & 1) res = mul(res, x);\\n x = mul(x, x);\\n n >>= 1;\\n }\\n return res;\\n }\\n\\n inline int inv(int x) { return mpow(x, mod - 2); }\\n\\n inline int add(int x, int y) {\\n if ((x += y) >= mod) x -= mod;\\n return x;\\n }\\n\\n inline int mul(int x, int y) { return (int)(1LL * x * y % mod); }\\n\\n void ensure_base(int nb) {\\n if (nb <= base) return;\\n rv.resize(1 << nb);\\n roots.resize(1 << nb);\\n invr.resize(1 << nb);\\n for (int i = 0; i < (1 << nb); ++i)\\n rv[i] = (rv[i >> 1] >> 1) + ((i & 1) << (nb - 1));\\n assert(nb <= maxb);\\n while (base < nb) {\\n int z = mpow(root, 1 << (maxb - 1 - base)), invz = inv(z);\\n for (int i = 1 << (base - 1); i < (1 << base); ++i) {\\n roots[i << 1] = roots[i];\\n roots[(i << 1) + 1] = mul(roots[i], z);\\n invr[i << 1] = invr[i];\\n invr[(i << 1) + 1] = mul(invr[i], invz);\\n }\\n ++base;\\n }\\n }\\n void ntt(vector<int> &a, int n, bool sg = 0) {\\n assert((n & (n - 1)) == 0);\\n for (int i = 0; i < n; ++i)\\n if (i < rv[i]) swap(a[i], a[rv[i]]);\\n for (int k = 1; k < n; k <<= 1)\\n for (int i = 0; i < n; i += 2 * k)\\n for (int j = 0; j < k; ++j) {\\n int z = mul(a[i + j + k], (sg ? roots[j + k] : invr[j + k]));\\n a[i + j + k] = add(a[i + j], mod - z);\\n a[i + j] = add(a[i + j], z);\\n }\\n int invn = inv(n);\\n if (sg)\\n for (int i = 0; i < n; ++i) a[i] = mul(a[i], invn);\\n }\\n template <class T>\\n vector<T> multiply(const vector<T> &a, const vector<T> &b) {\\n int need = a.size() + b.size() - 1;\\n int nb = 1;\\n while ((1 << nb) < need) ++nb;\\n ensure_base(nb);\\n int sz = 1 << nb;\\n vector<int> fa(sz, 0), fb(sz, 0);\\n for (int i = 0; i < sz; ++i) {\\n if (i < a.size()) fa[i] = a[i];\\n if (i < b.size()) fb[i] = b[i];\\n }\\n ntt(fa, sz);\\n ntt(fb, sz);\\n for (int i = 0; i < sz; ++i) fa[i] = mul(fa[i], fb[i]);\\n ntt(fa, sz, 1);\\n vector<T> res(need);\\n for (int i = 0; i < need; ++i) res[i] = fa[i];\\n mint x = 0;\\n for (auto p : res) x += p;\\n cout << x << endl;\\n x = 0;\\n for (auto p : a) x += p;\\n cout << x << endl;\\n x = 0;\\n for (auto p : b) x += p;\\n cout << x << endl;\\n return res;\\n }\\n};\\n\\ntemplate <int mod>\\nstruct NumberTheoreticTransform {\\n vector<int> rev, rts;\\n int base, max_base, root;\\n\\n NumberTheoreticTransform() : base(1), rev{0, 1}, rts{0, 1} {\\n assert(mod >= 3 && mod % 2 == 1);\\n auto tmp = mod - 1;\\n max_base = 0;\\n while (tmp % 2 == 0) tmp >>= 1, max_base++;\\n root = 2;\\n while (mod_pow(root, (mod - 1) >> 1) == 1) ++root;\\n assert(mod_pow(root, mod - 1) == 1);\\n root = mod_pow(root, (mod - 1) >> max_base);\\n }\\n\\n inline int mod_pow(int x, int n) {\\n int ret = 1;\\n while (n > 0) {\\n if (n & 1) ret = mul(ret, x);\\n x = mul(x, x);\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n inline int inverse(int x) { return mod_pow(x, mod - 2); }\\n\\n inline unsigned add(unsigned x, unsigned y) {\\n x += y;\\n if (x >= mod) x -= mod;\\n return x;\\n }\\n\\n inline unsigned mul(unsigned a, unsigned b) {\\n return 1ull * a * b % (unsigned long long)mod;\\n }\\n\\n void ensure_base(int nbase) {\\n if (nbase <= base) return;\\n rev.resize(1 << nbase);\\n rts.resize(1 << nbase);\\n for (int i = 0; i < (1 << nbase); i++) {\\n rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));\\n }\\n assert(nbase <= max_base);\\n while (base < nbase) {\\n int z = mod_pow(root, 1 << (max_base - 1 - base));\\n for (int i = 1 << (base - 1); i < (1 << base); i++) {\\n rts[i << 1] = rts[i];\\n rts[(i << 1) + 1] = mul(rts[i], z);\\n }\\n ++base;\\n }\\n }\\n\\n void ntt(vector<int> &a) {\\n const int n = (int)a.size();\\n assert((n & (n - 1)) == 0);\\n int zeros = __builtin_ctz(n);\\n ensure_base(zeros);\\n int shift = base - zeros;\\n for (int i = 0; i < n; i++) {\\n if (i < (rev[i] >> shift)) {\\n swap(a[i], a[rev[i] >> shift]);\\n }\\n }\\n for (int k = 1; k < n; k <<= 1) {\\n for (int i = 0; i < n; i += 2 * k) {\\n for (int j = 0; j < k; j++) {\\n int z = mul(a[i + j + k], rts[j + k]);\\n a[i + j + k] = add(a[i + j], mod - z);\\n a[i + j] = add(a[i + j], z);\\n }\\n }\\n }\\n }\\n\\n vector<int> multiply(vector<int> a, vector<int> b) {\\n int need = a.size() + b.size() - 1;\\n int nbase = 1;\\n while ((1 << nbase) < need) nbase++;\\n ensure_base(nbase);\\n int sz = 1 << nbase;\\n a.resize(sz, 0);\\n b.resize(sz, 0);\\n ntt(a);\\n ntt(b);\\n int inv_sz = inverse(sz);\\n for (int i = 0; i < sz; i++) {\\n a[i] = mul(a[i], mul(b[i], inv_sz));\\n }\\n reverse(a.begin() + 1, a.end());\\n ntt(a);\\n a.resize(need);\\n return a;\\n }\\n};\\n\\nint n, l, m, d;\\nvector<int> t, x, p;\\nvector<mint> sum;\\nNTT ntt;\\n\\nmint solve();\\n\\nint main() {\\n cin >> n >> l;\\n t.resize(n);\\n for (auto &i : t) cin >> i;\\n cin >> m >> d;\\n x.resize(m);\\n p.resize(m);\\n for (int i = 0; i < m; ++i) cin >> x[i] >> p[i];\\n x.push_back(l);\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nmint solve() {\\n { // pre\\n queue<vector<int>> qu;\\n for (int i = 0; i < m; ++i) {\\n int len = x[i + 1] - x[i];\\n vector<int> v(2 * len + 1, 0);\\n mint np = mint(p[i]) / 100, revp = -np + 1;\\n v[0] = v[2 * len] = (np * revp).x;\\n v[len] = mint(1 - 2 * v[0]).x;\\n qu.push(v);\\n }\\n NumberTheoreticTransform<998244353> ntt2;\\n while (qu.size() > 1) {\\n auto lv = qu.front();\\n qu.pop();\\n auto rv = qu.front();\\n qu.pop();\\n auto v = ntt2.multiply(lv, rv);\\n qu.push(v);\\n }\\n auto v = qu.front();\\n int len = v.size();\\n sum.resize(len);\\n for (int i = 0; i < len; ++i) {\\n sum[i] = v[i];\\n if (i) sum[i] += sum[i - 1];\\n }\\n }\\n mint res = n;\\n for (int i = 1; i < n; ++i) {\\n long long time = 1LL * (t[i] - t[0]) * l + 2LL * d * (l - x[0]);\\n if (time >= 0) res -= sum[time / (2 * d)];\\n }\\n return res;\\n}\",\n \"accuracy\": 0.075,\n \"time_ms\": 320,\n \"memory_kb\": 13560,\n \"score_of_the_acc\": -0.1124,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3182_4906211\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n\\n friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) += rhs;\\n }\\n friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) -= rhs;\\n }\\n friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) *= rhs;\\n }\\n friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) {\\n return ModInt(lhs) /= rhs;\\n }\\n\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\nusing modint = ModInt< MOD9 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}\\n//using modint=ld;\\ntemplate< typename Mint >\\nstruct NumberTheoreticTransformFriendlyModInt {\\n\\n vector< Mint > dw, idw;\\n int max_base;\\n Mint root;\\n\\n NumberTheoreticTransformFriendlyModInt() {\\n const unsigned mod = Mint::get_mod();\\n assert(mod >= 3 && mod % 2 == 1);\\n auto tmp = mod - 1;\\n max_base = 0;\\n while(tmp % 2 == 0) tmp >>= 1, max_base++;\\n root = 2;\\n while(root.pow((mod - 1) >> 1) == 1) root += 1;\\n assert(root.pow(mod - 1) == 1);\\n dw.resize(max_base);\\n idw.resize(max_base);\\n for(int i = 0; i < max_base; i++) {\\n dw[i] = -root.pow((mod - 1) >> (i + 2));\\n idw[i] = Mint(1) / dw[i];\\n }\\n }\\n\\n void ntt(vector< Mint > &a) {\\n const int n = (int) a.size();\\n assert((n & (n - 1)) == 0);\\n assert(__builtin_ctz(n) <= max_base);\\n for(int m = n; m >>= 1;) {\\n Mint w = 1;\\n for(int s = 0, k = 0; s < n; s += 2 * m) {\\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\\n auto x = a[i], y = a[j] * w;\\n a[i] = x + y, a[j] = x - y;\\n }\\n w *= dw[__builtin_ctz(++k)];\\n }\\n }\\n }\\n\\n void intt(vector< Mint > &a, bool f = true) {\\n const int n = (int) a.size();\\n assert((n & (n - 1)) == 0);\\n assert(__builtin_ctz(n) <= max_base);\\n for(int m = 1; m < n; m *= 2) {\\n Mint w = 1;\\n for(int s = 0, k = 0; s < n; s += 2 * m) {\\n for(int i = s, j = s + m; i < s + m; ++i, ++j) {\\n auto x = a[i], y = a[j];\\n a[i] = x + y, a[j] = (x - y) * w;\\n }\\n w *= idw[__builtin_ctz(++k)];\\n }\\n }\\n if(f) {\\n Mint inv_sz = Mint(1) / n;\\n for(int i = 0; i < n; i++) a[i] *= inv_sz;\\n }\\n }\\n\\n vector< Mint > multiply(vector< Mint > a, vector< Mint > b) {\\n int need = a.size() + b.size() - 1;\\n int nbase = 1;\\n while((1 << nbase) < need) nbase++;\\n int sz = 1 << nbase;\\n a.resize(sz, 0);\\n b.resize(sz, 0);\\n ntt(a);\\n ntt(b);\\n Mint inv_sz = Mint(1) / sz;\\n for(int i = 0; i < sz; i++) a[i] *= b[i] * inv_sz;\\n intt(a, false);\\n a.resize(need);\\n return a;\\n }\\n};\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n ll n,l;cin>>n>>l;\\n vector<ll>t(n);\\n rep(i,0,n)cin>>t[i];\\n ll m,d;cin>>m>>d;\\n vector<ll>x(m),p(m);\\n rep(i,0,m)cin>>x[i]>>p[i];\\n x.PB(l);\\n vector<vector<modint>>f(m);\\n ll geta=0;\\n queue<ll>que;\\n rep(i,0,m){\\n modint prob=(modint)p[i]/100;\\n ll sz=x[i+1]-x[i];\\n f[i].assign(4*sz+1,0);\\n geta+=2*sz;\\n f[i][0]=(1-prob)*prob;\\n f[i][2*sz]=prob*prob+(1-prob)*(1-prob);\\n f[i][4*sz]=(1-prob)*prob;\\n que.push(i);\\n }\\n NumberTheoreticTransformFriendlyModInt<modint>ntt;\\n while(que.size()>=2){\\n auto l=que.front();que.pop();\\n auto r=que.front();que.pop();\\n f[l]=ntt.multiply(f[l],f[r]);\\n //debug(f[l],f[l].size());\\n que.push(l);\\n }\\n ll r=que.front();\\n vector<modint>fb(f[r].size()+1);\\n rep(i,0,f[r].size())fb[i+1]=fb[i]+f[r][i];\\n ll sz=f[r].size();\\n //cout<<f[r][0]*4<<endl;\\n //cout<<f<<endl;\\n //debug(fb,sz+1);\\n //debug(f[r],sz);\\n modint ret=1;\\n rep(i,1,n){\\n ll dif=(t[0]-t[i])*l;\\n if(dif>0)dif=(dif+d-1)/d;\\n else dif/=d;\\n //cout<<dif spa geta spa clamp(dif+geta,0LL,sz)<<endl;\\n ret+=fb[clamp(dif+geta,0LL,sz)];\\n }\\n cout<<ret<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 550,\n \"memory_kb\": 65356,\n \"score_of_the_acc\": -1.3708,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3182_4877008\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 2020000;\\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\n#define MOD 998244353\\n#define root 3\\n \\nunsigned int add(const unsigned int x, const unsigned int y)\\n{\\n return (x + y < MOD) ? x + y : x + y - MOD;\\n}\\n \\nunsigned int sub(const unsigned int x, const unsigned int y)\\n{\\n return (x >= y) ? (x - y) : (MOD - y + x);\\n}\\n \\nunsigned int mul(const unsigned int x, const unsigned int y)\\n{\\n return (unsigned long long)x * y % MOD;\\n}\\n \\nunsigned int mod_pow(unsigned int x, unsigned int n)\\n{\\n unsigned int res = 1;\\n while(n > 0){\\n if(n & 1){ res = mul(res, x); }\\n x = mul(x, x);\\n n >>= 1;\\n }\\n return res;\\n}\\n \\nunsigned int inverse(const unsigned int x)\\n{\\n return mod_pow(x, MOD - 2);\\n}\\n \\nvoid ntt(vector<int>& a, const bool rev = false)\\n{\\n unsigned int i, j, k, l, p, q, r, s;\\n const unsigned int size = a.size();\\n if(size == 1) return;\\n vector<int> b(size);\\n r = rev ? (MOD - 1 - (MOD - 1) / size) : (MOD - 1) / size;\\n s = mod_pow(root, r);\\n vector<unsigned int> kp(size / 2 + 1, 1);\\n for(i = 0; i < size / 2; ++i) kp[i + 1] = mul(kp[i], s);\\n for(i = 1, l = size / 2; i < size; i <<= 1, l >>= 1){\\n for(j = 0, r = 0; j < l; ++j, r += i){\\n for(k = 0, s = kp[i * j]; k < i; ++k){\\n p = a[k + r], q = a[k + r + size / 2];\\n b[k + 2 * r] = add(p, q);\\n b[k + 2 * r + i] = mul(sub(p, q), s);\\n }\\n }\\n swap(a, b);\\n }\\n if(rev){\\n s = inverse(size);\\n for(i = 0; i < size; i++){ a[i] = mul(a[i], s); }\\n }\\n}\\n \\nvector<int> convolute(const vector<int>& a, const vector<int>& b)\\n{\\n const int size = (int)a.size() + (int)b.size() - 1;\\n int t = 1;\\n while(t < size){ t <<= 1; }\\n vector<int> A(t, 0), B(t, 0);\\n for(int i = 0; i < (int)a.size(); i++){ A[i] = a[i]; }\\n for(int i = 0; i < (int)b.size(); i++){ B[i] = b[i]; }\\n ntt(A), ntt(B);\\n for (int i = 0; i < t; i++){ A[i] = mul(A[i], B[i]); }\\n ntt(A, true);\\n A.resize(size);\\n return A;\\n}\\n\\nll modpow(ll x, ll n, ll mod){\\n\\tll res = 1;\\n\\twhile(n > 0){\\n\\t\\tif(n & 1) res = res * x % mod;\\n\\t\\tx = x * x % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tll n,L; cin >> n >> L;\\n\\tvector<int> t(n); rep(i,n) cin >> t[i];\\n\\tint m,d; cin >> m >> d;\\n\\tvector<int> x(m+1),p(m);\\n\\trep(i,m) cin >> x[i] >> p[i];\\n\\tx[m] = L;\\n\\tvector<vector<int>> v;\\n\\tint id = 0;\\n\\tpriority_queue<P,vector<P>,greater<P>> pq;\\n\\tint inv = modpow(100,mod-2,mod);\\n\\trep(i,m){\\n\\t\\tll dist = x[i+1] - x[i];\\n\\t\\tvector<int> vec(dist+1,0);\\n\\t\\tpq.emplace(dist+1,id);\\n\\t\\tvec[0] = (ll)p[i] * inv % mod;\\n\\t\\tvec[dist] = (1 - (ll)p[i] * inv % mod + mod) % mod;\\n\\t\\tv.push_back(vec);\\n\\t\\tid++;\\n\\t}\\n\\twhile(pq.size() > 1){\\n\\t\\tint w = pq.top().second; pq.pop();\\n\\t\\tint y = pq.top().second; pq.pop();\\n\\t\\tv[y] = convolute(v[w], v[y]);\\n\\t\\tpq.emplace(v[y].size(), y);\\n\\t}\\n\\tint z = pq.top().second;\\n\\tauto b = v[z];\\n\\treverse(all(b));\\n\\tauto c = convolute(v[z], b);\\n\\tvector<int> acc(2*L+1, 0);\\n\\trep(i,c.size()) acc[i+1] = (acc[i] + c[i]) % mod;\\n\\tfor(int i=c.size(); i<2*L; i++) acc[i+1] = acc[i];\\n\\tll ans = 1;\\n\\tREP(i,1,n){\\n\\t\\tll lim;\\n\\t\\tif(t[0] > t[i]){\\n\\t\\t\\tlim = (L * (t[0] - t[i]) + 2*d - 1) / (2*d);\\n\\t\\t}else{\\n\\t\\t\\tlim = (L * (t[0] - t[i])) / (2*d);\\n\\t\\t}\\n\\t\\tans += acc[min(2*L,max(0LL,lim+L-x[0]))];\\n\\t}\\n\\tans %= mod;\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 440,\n \"memory_kb\": 27452,\n \"score_of_the_acc\": -0.5154,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3182_4877007\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 2020000;\\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\n#define MOD 998244353\\n#define root 3\\n \\nunsigned int add(const unsigned int x, const unsigned int y)\\n{\\n return (x + y < MOD) ? x + y : x + y - MOD;\\n}\\n \\nunsigned int sub(const unsigned int x, const unsigned int y)\\n{\\n return (x >= y) ? (x - y) : (MOD - y + x);\\n}\\n \\nunsigned int mul(const unsigned int x, const unsigned int y)\\n{\\n return (unsigned long long)x * y % MOD;\\n}\\n \\nunsigned int mod_pow(unsigned int x, unsigned int n)\\n{\\n unsigned int res = 1;\\n while(n > 0){\\n if(n & 1){ res = mul(res, x); }\\n x = mul(x, x);\\n n >>= 1;\\n }\\n return res;\\n}\\n \\nunsigned int inverse(const unsigned int x)\\n{\\n return mod_pow(x, MOD - 2);\\n}\\n \\nvoid ntt(vector<int>& a, const bool rev = false)\\n{\\n unsigned int i, j, k, l, p, q, r, s;\\n const unsigned int size = a.size();\\n if(size == 1) return;\\n vector<int> b(size);\\n r = rev ? (MOD - 1 - (MOD - 1) / size) : (MOD - 1) / size;\\n s = mod_pow(root, r);\\n vector<unsigned int> kp(size / 2 + 1, 1);\\n for(i = 0; i < size / 2; ++i) kp[i + 1] = mul(kp[i], s);\\n for(i = 1, l = size / 2; i < size; i <<= 1, l >>= 1){\\n for(j = 0, r = 0; j < l; ++j, r += i){\\n for(k = 0, s = kp[i * j]; k < i; ++k){\\n p = a[k + r], q = a[k + r + size / 2];\\n b[k + 2 * r] = add(p, q);\\n b[k + 2 * r + i] = mul(sub(p, q), s);\\n }\\n }\\n swap(a, b);\\n }\\n if(rev){\\n s = inverse(size);\\n for(i = 0; i < size; i++){ a[i] = mul(a[i], s); }\\n }\\n}\\n \\nvector<int> convolute(const vector<int>& a, const vector<int>& b)\\n{\\n const int size = (int)a.size() + (int)b.size() - 1;\\n int t = 1;\\n while(t < size){ t <<= 1; }\\n vector<int> A(t, 0), B(t, 0);\\n for(int i = 0; i < (int)a.size(); i++){ A[i] = a[i]; }\\n for(int i = 0; i < (int)b.size(); i++){ B[i] = b[i]; }\\n ntt(A), ntt(B);\\n for (int i = 0; i < t; i++){ A[i] = mul(A[i], B[i]); }\\n ntt(A, true);\\n A.resize(size);\\n return A;\\n}\\n\\nll modpow(ll x, ll n, ll mod){\\n\\tll res = 1;\\n\\twhile(n > 0){\\n\\t\\tif(n & 1) res = res * x % mod;\\n\\t\\tx = x * x % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tint n,L; cin >> n >> L;\\n\\tvector<int> t(n); rep(i,n) cin >> t[i];\\n\\tint m,d; cin >> m >> d;\\n\\tvector<int> x(m+1),p(m);\\n\\trep(i,m) cin >> x[i] >> p[i];\\n\\tx[m] = L;\\n\\tvector<vector<int>> v;\\n\\tint id = 0;\\n\\tpriority_queue<P,vector<P>,greater<P>> pq;\\n\\tint inv = modpow(100,mod-2,mod);\\n\\trep(i,m){\\n\\t\\tll dist = x[i+1] - x[i];\\n\\t\\tvector<int> vec(dist+1,0);\\n\\t\\tpq.emplace(dist+1,id);\\n\\t\\tvec[0] = (ll)p[i] * inv % mod;\\n\\t\\tvec[dist] = (1 - (ll)p[i] * inv % mod + mod) % mod;\\n\\t\\tv.push_back(vec);\\n\\t\\tid++;\\n\\t}\\n\\twhile(pq.size() > 1){\\n\\t\\tint w = pq.top().second; pq.pop();\\n\\t\\tint y = pq.top().second; pq.pop();\\n\\t\\tv[y] = convolute(v[w], v[y]);\\n\\t\\tpq.emplace(v[y].size(), y);\\n\\t}\\n\\tint z = pq.top().second;\\n\\tauto b = v[z];\\n\\treverse(all(b));\\n\\tauto c = convolute(v[z], b);\\n\\tvector<int> acc(2*L+1, 0);\\n\\trep(i,c.size()) acc[i+1] = (acc[i] + c[i]) % mod;\\n\\tfor(int i=c.size(); i<2*L; i++) acc[i+1] = acc[i];\\n\\tll ans = 1;\\n\\tREP(i,1,n){\\n\\t\\tint lim;\\n\\t\\tif(t[0] > t[i]){\\n\\t\\t\\tlim = ((ll)L * (t[0] - t[i]) + 2*d - 1) / (2*d);\\n\\t\\t}else{\\n\\t\\t\\tlim = ((ll)L * (t[0] - t[i])) / (2*d);\\n\\t\\t}\\n\\t\\tans += (mod + acc[min(2*L,max(0,lim+L-x[0]))]) % mod;\\n\\t\\tans %= mod;\\n\\t}\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.6,\n \"time_ms\": 400,\n \"memory_kb\": 27444,\n \"score_of_the_acc\": -0.4703,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3182_4877002\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 2020000;\\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\n#define MOD 998244353\\n#define root 3\\n \\nunsigned int add(const unsigned int x, const unsigned int y)\\n{\\n return (x + y < MOD) ? x + y : x + y - MOD;\\n}\\n \\nunsigned int sub(const unsigned int x, const unsigned int y)\\n{\\n return (x >= y) ? (x - y) : (MOD - y + x);\\n}\\n \\nunsigned int mul(const unsigned int x, const unsigned int y)\\n{\\n return (unsigned long long)x * y % MOD;\\n}\\n \\nunsigned int mod_pow(unsigned int x, unsigned int n)\\n{\\n unsigned int res = 1;\\n while(n > 0){\\n if(n & 1){ res = mul(res, x); }\\n x = mul(x, x);\\n n >>= 1;\\n }\\n return res;\\n}\\n \\nunsigned int inverse(const unsigned int x)\\n{\\n return mod_pow(x, MOD - 2);\\n}\\n \\nvoid ntt(vector<int>& a, const bool rev = false)\\n{\\n unsigned int i, j, k, l, p, q, r, s;\\n const unsigned int size = a.size();\\n if(size == 1) return;\\n vector<int> b(size);\\n r = rev ? (MOD - 1 - (MOD - 1) / size) : (MOD - 1) / size;\\n s = mod_pow(root, r);\\n vector<unsigned int> kp(size / 2 + 1, 1);\\n for(i = 0; i < size / 2; ++i) kp[i + 1] = mul(kp[i], s);\\n for(i = 1, l = size / 2; i < size; i <<= 1, l >>= 1){\\n for(j = 0, r = 0; j < l; ++j, r += i){\\n for(k = 0, s = kp[i * j]; k < i; ++k){\\n p = a[k + r], q = a[k + r + size / 2];\\n b[k + 2 * r] = add(p, q);\\n b[k + 2 * r + i] = mul(sub(p, q), s);\\n }\\n }\\n swap(a, b);\\n }\\n if(rev){\\n s = inverse(size);\\n for(i = 0; i < size; i++){ a[i] = mul(a[i], s); }\\n }\\n}\\n \\nvector<int> convolute(const vector<int>& a, const vector<int>& b)\\n{\\n const int size = (int)a.size() + (int)b.size() - 1;\\n int t = 1;\\n while(t < size){ t <<= 1; }\\n vector<int> A(t, 0), B(t, 0);\\n for(int i = 0; i < (int)a.size(); i++){ A[i] = a[i]; }\\n for(int i = 0; i < (int)b.size(); i++){ B[i] = b[i]; }\\n ntt(A), ntt(B);\\n for (int i = 0; i < t; i++){ A[i] = mul(A[i], B[i]); }\\n ntt(A, true);\\n A.resize(size);\\n return A;\\n}\\n\\nll modpow(ll x, ll n, ll mod){\\n\\tll res = 1;\\n\\twhile(n > 0){\\n\\t\\tif(n & 1) res = res * x % mod;\\n\\t\\tx = x * x % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tint n,L; cin >> n >> L;\\n\\tvector<int> t(n); rep(i,n) cin >> t[i];\\n\\tint m,d; cin >> m >> d;\\n\\tvector<int> x(m+1),p(m);\\n\\trep(i,m) cin >> x[i] >> p[i];\\n\\tx[m] = L;\\n\\tvector<vector<int>> v;\\n\\tint id = 0;\\n\\tpriority_queue<P,vector<P>,greater<P>> pq;\\n\\tint inv = modpow(100,mod-2,mod);\\n\\trep(i,m){\\n\\t\\tll dist = x[i+1] - x[i];\\n\\t\\tvector<int> vec(dist+1,0);\\n\\t\\tpq.emplace(dist+1,id);\\n\\t\\tvec[0] = (ll)p[i] * inv % mod;\\n\\t\\tvec[dist] = (1 - (ll)p[i] * inv % mod + mod) % mod;\\n\\t\\tv.push_back(vec);\\n\\t\\tid++;\\n\\t}\\n\\twhile(pq.size() > 1){\\n\\t\\tint w = pq.top().second; pq.pop();\\n\\t\\tint y = pq.top().second; pq.pop();\\n\\t\\tv[y] = convolute(v[w], v[y]);\\n\\t\\tpq.emplace(v[y].size(), y);\\n\\t}\\n\\tint z = pq.top().second;\\n\\tauto b = v[z];\\n\\treverse(all(b));\\n\\tauto c = convolute(v[z], b);\\n\\tvector<int> acc(2*L+1, 0);\\n\\trep(i,c.size()) acc[i+1] = (acc[i] + c[i]) % mod;\\n\\tfor(int i=c.size(); i<2*L; i++) acc[i+1] = acc[i];\\n\\tll ans = 1;\\n\\tREP(i,1,n){\\n\\t\\tint lim;\\n\\t\\tif(t[0] > t[i]){\\n\\t\\t\\tlim = (L * (t[0] - t[i]) + 2*d - 1) / (2*d);\\n\\t\\t}else{\\n\\t\\t\\tlim = (L * (t[0] - t[i])) / (2*d);\\n\\t\\t}\\n\\t\\tans += (mod + acc[min(2*L,max(0,lim+L-x[0]))]) % mod;\\n\\t\\tans %= mod;\\n\\t}\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.125,\n \"time_ms\": 400,\n \"memory_kb\": 27360,\n \"score_of_the_acc\": -0.4687,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3182_4868134\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <chrono>\\n//#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\\n#define Rrep(i,n) Rreps(i,n,0)\\n#define ALL(a) a.begin(), a.end()\\n#define fi first\\n#define se second\\n\\nusing ll = long long;\\nusing vec = vector<ll>;\\nusing mat = vector<vec>;\\n\\nll N,M,H,W,Q,K,A,B;\\nstring S;\\ntypedef pair<ll, ll> P;\\nconst ll INF = (1LL<<58);\\n\\ntemplate<class T> bool chmin(T &a, const T &b){\\n if(a > b) {a = b; return true;}\\n else return false;\\n}\\ntemplate<class T> bool chmax(T &a, const T &b){\\n if(a < b) {a = b; return true;}\\n else return false;\\n}\\n\\ntemplate <unsigned long long mod > class modint{\\npublic:\\n ll x;\\n constexpr modint(){x = 0;}\\n constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}\\n constexpr void set_raw(ll _x){\\n //_x in [0, mod)\\n x = _x;\\n }\\n constexpr modint operator-(){\\n return x == 0 ? 0 : mod - x;\\n }\\n constexpr modint& operator+=(const modint& a){\\n if((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr modint operator+(const modint& a) const{\\n return modint(*this) += a;\\n }\\n constexpr modint& operator-=(const modint& a){\\n if((x -= a.x) < 0) x += mod;\\n return *this;\\n }\\n constexpr modint operator-(const modint& a) const{\\n return modint(*this) -= a;\\n }\\n constexpr modint& operator*=(const modint& a){\\n (x *= a.x)%=mod;\\n return *this;\\n }\\n constexpr modint operator*(const modint& a) const{\\n return modint(*this) *= a;\\n }\\n constexpr modint pow(unsigned long long pw) const{\\n modint res(1), comp(*this);\\n while(pw){\\n if(pw&1) res *= comp;\\n comp *= comp;\\n pw >>= 1;\\n }\\n return res;\\n }\\n //以下、modが素数のときのみ\\n constexpr modint inv() const{\\n return modint(*this).pow(mod - 2);\\n }\\n constexpr modint& operator/=(const modint &a){\\n (x *= a.inv().x)%=mod;\\n return *this;\\n }\\n constexpr modint operator/(const modint &a) const{\\n return modint(*this) /= a;\\n }\\n};\\n#define mod1 998244353\\nusing mint = modint<mod1>;\\n\\nostream& operator<<(ostream& os, const mint& a){\\n os << a.x;\\n return os;\\n}\\nusing vm = vector<mint>;\\nclass NTT{\\n const int root;\\n\\n void make_root_pow(int n, vm &root_pow){\\n root_pow.resize(n + 1);\\n mint new_root = mint(root).pow((mod1 - 1) / n);\\n root_pow[0].x = 1;\\n rep(i,n){\\n root_pow[i + 1] = root_pow[i] * new_root;\\n }\\n }\\n static void make_bit_reverse(int n, vector<int> &v){\\n v.resize(n);\\n iota(ALL(v), 0);\\n for(int i = 1; (1<<i) <= n; ++i){\\n int l = 1<<(i - 1), r = 1<<i;\\n int plus = n >> i;\\n for(int j = l; j < r; ++j){\\n int temp = v[j - l] + plus;\\n if(j < temp) swap(v[j], v[temp]);\\n }\\n }\\n }\\n static void dft(int n, vm &f, bool inv, vm &root_pow, vector<int> &id){\\n vm g(n);\\n rep(i,n) g[i] = f[id[i]];\\n swap(f, g);\\n for(int l = n / 2, len = 1; l >= 1; l /= 2, len *= 2){\\n for(int i = 0; i < n; i += len * 2){\\n rep(j, len){\\n mint z_f = (inv ? root_pow[n - l * j] : root_pow[l * j]) * f[i + len + j];\\n g[i + j] = f[i + j] + z_f;\\n g[i + len + j] = f[i + j] - z_f;\\n }\\n }\\n swap(f, g);\\n }\\n if(inv) {\\n mint n_inv = mint(n).inv();\\n rep(i, n) f[i] *= n_inv;\\n }\\n }\\npublic:\\n NTT(int _x = 3) : root(_x){}\\n vm convolution(vm &a, vm &b, int size_a = INT_MAX, int size_b = INT_MAX){\\n chmin(size_a, (int)a.size());\\n chmin(size_b, (int)b.size());\\n int sz = size_a + size_b - 1, n = 1;\\n while(sz > n) n *= 2;\\n vm g(n), h(n), root_pow, gh(n);\\n vector<int> id;\\n copy(a.begin(), a.begin() + size_a, g.begin());\\n copy(b.begin(), b.begin() + size_b, h.begin());\\n make_root_pow(n, root_pow);\\n make_bit_reverse(n, id);\\n dft(n, g, false, root_pow, id);\\n dft(n, h, false, root_pow, id);\\n rep(i, n) gh[i] = g[i] * h[i];\\n dft(n, gh, true, root_pow, id);\\n gh.resize(sz);\\n return gh;\\n }\\n};\\n\\nvm polynomial_product(vector<vm> &polys){\\n //time complexity : O(N log^2 N) (N : sum of polys[i].size())\\n struct _cmp{\\n int sz;\\n vm a;\\n _cmp(int _sz, vm _a) : sz(_sz), a(_a){}\\n bool operator > (const _cmp &b){ return sz > b.sz;}\\n };\\n priority_queue<_cmp, vector<_cmp>, greater<> > pque;\\n for(vm &a : polys) pque.emplace((int)a.size(), a);\\n NTT ntt;\\n while(pque.size() > 1){\\n _cmp c = pque.top(); pque.pop();\\n _cmp d = pque.top(); pque.pop();\\n vm res = ntt.convolution(c.a, d.a);\\n pque.emplace(res.size(), res);\\n }\\n return pque.top().a;\\n}\\n\\nint main() {\\n ll L, D;\\n cin>>N>>L;\\n vec t(N);\\n rep(i, N) cin>>t[i];\\n cin>>M>>D;\\n vec x(M), p(M);\\n rep(i, M) cin>>x[i]>>p[i];\\n x.push_back(L);\\n vector<vm> polys(0);\\n rep(i, M){\\n int d = x[i+1] - x[i];\\n vm temp(d + 1);\\n temp[d] = mint(p[i]) / 100;\\n temp[0] = mint(1) - temp[d];\\n polys.push_back(temp);\\n }\\n vm plus = polynomial_product(polys), plus_rev(plus);\\n reverse(ALL(plus_rev));\\n NTT ntt;\\n vm diff = ntt.convolution(plus, plus_rev);\\n ll n = (L - x[0]) * 2;\\n rep(i, n) diff[i + 1] += diff[i];\\n if(diff[n].x != 1) cout<<diff[n]<<endl;\\n mint res(N);\\n reps(i, 1, N){\\n ll base_adv = L * (t[i] - t[0]);\\n if(n * D <= base_adv) res -= 1;\\n else if(base_adv >= - n * D) res -= diff[(base_adv + n * D) / (D * 2)];\\n }\\n cout<<res<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 23548,\n \"score_of_the_acc\": -0.3389,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3182_4868117\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <chrono>\\n//#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\\n#define Rrep(i,n) Rreps(i,n,0)\\n#define ALL(a) a.begin(), a.end()\\n#define fi first\\n#define se second\\n\\nusing ll = long long;\\nusing vec = vector<ll>;\\nusing mat = vector<vec>;\\n\\nll N,M,H,W,Q,K,A,B;\\nstring S;\\ntypedef pair<ll, ll> P;\\nconst ll INF = (1LL<<58);\\n\\ntemplate<class T> bool chmin(T &a, const T &b){\\n if(a > b) {a = b; return true;}\\n else return false;\\n}\\ntemplate<class T> bool chmax(T &a, const T &b){\\n if(a < b) {a = b; return true;}\\n else return false;\\n}\\n\\ntemplate <unsigned long long mod > class modint{\\npublic:\\n ll x;\\n constexpr modint(){x = 0;}\\n constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}\\n constexpr void set_raw(ll _x){\\n //_x in [0, mod)\\n x = _x;\\n }\\n constexpr modint operator-(){\\n return x == 0 ? 0 : mod - x;\\n }\\n constexpr modint& operator+=(const modint& a){\\n if((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n constexpr modint operator+(const modint& a) const{\\n return modint(*this) += a;\\n }\\n constexpr modint& operator-=(const modint& a){\\n if((x -= a.x) < 0) x += mod;\\n return *this;\\n }\\n constexpr modint operator-(const modint& a) const{\\n return modint(*this) -= a;\\n }\\n constexpr modint& operator*=(const modint& a){\\n (x *= a.x)%=mod;\\n return *this;\\n }\\n constexpr modint operator*(const modint& a) const{\\n return modint(*this) *= a;\\n }\\n constexpr modint pow(unsigned long long pw) const{\\n modint res(1), comp(*this);\\n while(pw){\\n if(pw&1) res *= comp;\\n comp *= comp;\\n pw >>= 1;\\n }\\n return res;\\n }\\n //以下、modが素数のときのみ\\n constexpr modint inv() const{\\n return modint(*this).pow(mod - 2);\\n }\\n constexpr modint& operator/=(const modint &a){\\n (x *= a.inv().x)%=mod;\\n return *this;\\n }\\n constexpr modint operator/(const modint &a) const{\\n return modint(*this) /= a;\\n }\\n};\\n#define mod1 998244353\\nusing mint = modint<mod1>;\\n\\nostream& operator<<(ostream& os, const mint& a){\\n os << a.x;\\n return os;\\n}\\nusing vm = vector<mint>;\\nclass NTT{\\n const int root;\\n\\n void make_root_pow(int n, vm &root_pow){\\n root_pow.resize(n + 1);\\n mint new_root = mint(root).pow((mod1 - 1) / n);\\n root_pow[0].x = 1;\\n rep(i,n){\\n root_pow[i + 1] = root_pow[i] * new_root;\\n }\\n }\\n static void make_bit_reverse(int n, vector<int> &v){\\n v.resize(n);\\n iota(ALL(v), 0);\\n for(int i = 1; (1<<i) <= n; ++i){\\n int l = 1<<(i - 1), r = 1<<i;\\n int plus = n >> i;\\n for(int j = l; j < r; ++j){\\n int temp = v[j - l] + plus;\\n if(j < temp) swap(v[j], v[temp]);\\n }\\n }\\n }\\n static void dft(int n, vm &f, bool inv, vm &root_pow, vector<int> &id){\\n vm g(n);\\n rep(i,n) g[i] = f[id[i]];\\n swap(f, g);\\n for(int l = n / 2, len = 1; l >= 1; l /= 2, len *= 2){\\n for(int i = 0; i < n; i += len * 2){\\n rep(j, len){\\n mint z_f = (inv ? root_pow[n - l * j] : root_pow[l * j]) * f[i + len + j];\\n g[i + j] = f[i + j] + z_f;\\n g[i + len + j] = f[i + j] - z_f;\\n }\\n }\\n swap(f, g);\\n }\\n if(inv) {\\n mint n_inv = mint(n).inv();\\n rep(i, n) f[i] *= n_inv;\\n }\\n }\\npublic:\\n NTT(int _x = 3) : root(_x){}\\n vm convolution(vm &a, vm &b, int size_a = INT_MAX, int size_b = INT_MAX){\\n chmin(size_a, (int)a.size());\\n chmin(size_b, (int)b.size());\\n int sz = size_a + size_b - 1, n = 1;\\n while(sz > n) n *= 2;\\n vm g(n), h(n), root_pow, gh(n);\\n vector<int> id;\\n copy(a.begin(), a.begin() + size_a, g.begin());\\n copy(b.begin(), b.begin() + size_b, h.begin());\\n make_root_pow(n, root_pow);\\n make_bit_reverse(n, id);\\n dft(n, g, false, root_pow, id);\\n dft(n, h, false, root_pow, id);\\n rep(i, n) gh[i] = g[i] * h[i];\\n dft(n, gh, true, root_pow, id);\\n gh.resize(sz);\\n return gh;\\n }\\n};\\n\\nvm polynomial_product(vector<vm> polys){\\n //time complexity : O(N log^2 N) (N : sum of polys[i].size())\\n struct _cmp{\\n int sz;\\n vm a;\\n _cmp(int _sz, vm _a) : sz(_sz), a(_a){}\\n bool operator > (const _cmp &b){ return sz > b.sz;}\\n };\\n priority_queue<_cmp, vector<_cmp>, greater<> > pque;\\n for(vm a : polys) pque.emplace((int)a.size(), a);\\n NTT ntt;\\n while(pque.size() > 1){\\n _cmp c = pque.top(); pque.pop();\\n _cmp d = pque.top(); pque.pop();\\n vm res = ntt.convolution(c.a, d.a);\\n pque.emplace(res.size(), res);\\n }\\n return pque.top().a;\\n}\\n\\nint main() {\\n ll L, D;\\n cin>>N>>L;\\n vec t(N);\\n rep(i, N) cin>>t[i];\\n cin>>M>>D;\\n vec x(M), p(M);\\n rep(i, M) cin>>x[i]>>p[i];\\n x.push_back(L);\\n vector<vm> polys(0);\\n rep(i, M){\\n int d = x[i+1] - x[i];\\n vm temp(d + 1);\\n temp[d] = mint(p[i]) / 100;\\n temp[0] = mint(1) - temp[d];\\n polys.push_back(temp);\\n }\\n vm plus = polynomial_product(polys), plus_rev(plus);\\n reverse(ALL(plus_rev));\\n NTT ntt;\\n vm diff = ntt.convolution(plus, plus_rev);\\n ll n = (L - x[0]) * 2;\\n rep(i, n) diff[i + 1] += diff[i];\\n if(diff[n].x != 1) cout<<diff[n]<<endl;\\n mint res(N);\\n reps(i, 1, N){\\n ll base_adv = L * (t[i] - t[0]);\\n if(n * D <= base_adv) res -= 1;\\n else if(base_adv >= - n * D) res -= diff[(base_adv + n * D) / (D * 2)];\\n }\\n cout<<res<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 26124,\n \"score_of_the_acc\": -0.3886,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3182_4858043\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<set>\\n#include<queue>\\n#include<map>\\n#include<algorithm>\\n#include<cstring>\\n#include<string>\\n#include<cassert>\\n#include<cmath>\\n#include<climits>\\n#include<iomanip>\\n#include<stack>\\n#include<unordered_map>\\n#include<bitset>\\n#include<limits>\\n#include<complex>\\n#include<array>\\n#include<numeric>\\n#include<functional>\\n#include<random>\\n\\n\\nusing namespace std;\\n#define ll long long\\n#define ull unsigned long long\\n#define rep(i,m,n) for(ll (i)=(ll)(m);i<(ll)(n);i++)\\n#define REP(i,n) rep(i,0,n)\\n#define all(hoge) (hoge).begin(),(hoge).end()\\ntypedef pair<ll, ll> P;\\nconstexpr long double m_pi = 3.1415926535897932L;\\nconstexpr ll MOD = 1000000007;\\nconstexpr ll INF = 1LL << 61;\\nconstexpr long double EPS = 1e-10;\\ntemplate<typename T> using vector2 = vector<vector<T>>;\\ntemplate<typename T> using vector3 = vector<vector2<T>>;\\ntypedef vector<ll> Array;\\ntypedef vector<Array> Matrix;\\nstring operator*(const string& s, int k) {\\n\\tif (k == 0) return \\\"\\\";\\n\\tstring p = (s + s) * (k / 2);\\n\\tif (k % 2 == 1) p += s;\\n\\treturn p;\\n}\\n\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }\\n\\nstruct Edge {//グラフ\\n\\tint to, rev; ll cap;\\n\\tEdge(int _to, ll _cap, int _rev) {\\n\\t\\tto = _to; cap = _cap; rev = _rev;\\n\\t}\\n};\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\nvoid add_edge(Graph& G, int from, int to, ll cap, bool revFlag, ll revCap) {//最大フロー求める Ford-fulkerson\\n\\tG[from].push_back(Edge(to, cap, (ll)G[to].size() + (from == to)));\\n\\tif (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));//最小カットの場合逆辺は0にする\\n}\\n\\nll max_flow_dfs(Graph& G, ll v, ll t, ll f, vector<bool>& used)\\n{\\n\\tif (v == t)\\n\\t\\treturn f;\\n\\tused[v] = true;\\n\\tfor (int i = 0; i < G[v].size(); ++i) {\\n\\t\\tEdge& e = G[v][i];\\n\\t\\tif (!used[e.to] && e.cap > 0) {\\n\\t\\t\\tll d = max_flow_dfs(G, e.to, t, min(f, e.cap), used);\\n\\t\\t\\tif (d > 0) {\\n\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\n//二分グラフの最大マッチングを求めたりも出来る また二部グラフの最大独立集合は頂点数-最大マッチングのサイズ\\nll max_flow(Graph& G, ll s, ll t)//O(V(V+E))\\n{\\n\\tll flow = 0;\\n\\tfor (;;) {\\n\\t\\tvector<bool> used(G.size());\\n\\t\\tREP(i, used.size())used[i] = false;\\n\\t\\tll f = max_flow_dfs(G, s, t, INF, used);\\n\\t\\tif (f == 0) {\\n\\t\\t\\treturn flow;\\n\\t\\t}\\n\\t\\tflow += f;\\n\\t}\\n}\\n\\nvoid BellmanFord(Graph& G, ll s, Array& d, Array& negative) {//O(|E||V|)\\n\\td.resize(G.size());\\n\\tnegative.resize(G.size());\\n\\tREP(i, d.size())d[i] = INF;\\n\\tREP(i, d.size())negative[i] = false;\\n\\td[s] = 0;\\n\\tREP(k, G.size() - 1) {\\n\\t\\tREP(i, G.size()) {\\n\\t\\t\\tREP(j, G[i].size()) {\\n\\t\\t\\t\\tif (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {\\n\\t\\t\\t\\t\\td[G[i][j].to] = d[i] + G[i][j].cap;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tREP(k, G.size() - 1) {\\n\\t\\tREP(i, G.size()) {\\n\\t\\t\\tREP(j, G[i].size()) {\\n\\t\\t\\t\\tif (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {\\n\\t\\t\\t\\t\\td[G[i][j].to] = d[i] + G[i][j].cap;\\n\\t\\t\\t\\t\\tnegative[G[i][j].to] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (negative[i] == true)negative[G[i][j].to] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid Dijkstra(Graph& G, ll s, Array& d) {//O(|E|log|V|)\\n\\td.resize(G.size());\\n\\tREP(i, d.size())d[i] = INF;\\n\\td[s] = 0;\\n\\tpriority_queue<P, vector<P>, greater<P>> q;\\n\\tq.push(make_pair(0, s));\\n\\twhile (!q.empty()) {\\n\\t\\tP a = q.top();\\n\\t\\tq.pop();\\n\\t\\tif (d[a.second] < a.first)continue;\\n\\t\\tREP(i, G[a.second].size()) {\\n\\t\\t\\tEdge e = G[a.second][i];\\n\\t\\t\\tif (d[e.to] > d[a.second] + e.cap) {\\n\\t\\t\\t\\td[e.to] = d[a.second] + e.cap;\\n\\t\\t\\t\\tq.push(make_pair(d[e.to], e.to));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid WarshallFloyd(Graph& G, Matrix& d) {//O(V^3)\\n\\td.resize(G.size());\\n\\tREP(i, d.size())d[i].resize(G.size());\\n\\tREP(i, d.size()) {\\n\\t\\tREP(j, d[i].size()) {\\n\\t\\t\\td[i][j] = ((i != j) ? INF : 0);\\n\\t\\t}\\n\\t}\\n\\tREP(i, G.size()) {\\n\\t\\tREP(j, G[i].size()) {\\n\\t\\t\\tchmin(d[i][G[i][j].to], G[i][j].cap);\\n\\t\\t}\\n\\t}\\n\\tREP(i, G.size()) {\\n\\t\\tREP(j, G.size()) {\\n\\t\\t\\tREP(k, G.size()) {\\n\\t\\t\\t\\tif (d[j][i] != INF && d[i][k] != INF)chmin(d[j][k], d[j][i] + d[i][k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nbool tsort(Graph& graph, vector<int>& order) {//トポロジカルソートO(E+V)\\n\\tint n = graph.size(), k = 0;\\n\\tvector<int> in(n);\\n\\tfor (auto& es : graph)\\n\\t\\tfor (auto& e : es)in[e.to]++;\\n\\tpriority_queue<int, vector<int>, greater<int>> que;\\n\\tREP(i, n)\\n\\t\\tif (in[i] == 0)que.push(i);\\n\\twhile (que.size()) {\\n\\t\\tint v = que.top();\\n\\t\\tque.pop();\\n\\t\\torder.push_back(v);\\n\\t\\tfor (auto& e : graph[v])\\n\\t\\t\\tif (--in[e.to] == 0)que.push(e.to);\\n\\t}\\n\\tif (order.size() != n)return false;\\n\\telse return true;\\n}\\nclass Lca {\\npublic:\\n\\tconst int n = 0;\\n\\tconst int log2_n = 0;\\n\\tstd::vector<std::vector<int>> parent;\\n\\tstd::vector<int> depth;\\n\\n\\tLca() {}\\n\\n\\tLca(const Graph& g, int root)\\n\\t\\t: n(g.size()), log2_n(log2(n) + 1), parent(log2_n, std::vector<int>(n)), depth(n) {\\n\\t\\tdfs(g, root, -1, 0);\\n\\t\\tfor (int k = 0; k + 1 < log2_n; k++) {\\n\\t\\t\\tfor (int v = 0; v < (int)g.size(); v++) {\\n\\t\\t\\t\\tif (parent[k][v] < 0)\\n\\t\\t\\t\\t\\tparent[k + 1][v] = -1;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tparent[k + 1][v] = parent[k][parent[k][v]];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid dfs(const Graph& g, int v, int p, int d) {\\n\\t\\tparent[0][v] = p;\\n\\t\\tdepth[v] = d;\\n\\t\\tfor (auto& e : g[v]) {\\n\\t\\t\\tif (e.to != p) dfs(g, e.to, v, d + 1);\\n\\t\\t}\\n\\t}\\n\\n\\tint get(int u, int v) {\\n\\t\\tif (depth[u] > depth[v]) std::swap(u, v);\\n\\t\\tfor (int k = 0; k < log2_n; k++) {\\n\\t\\t\\tif ((depth[v] - depth[u]) >> k & 1) {\\n\\t\\t\\t\\tv = parent[k][v];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (u == v) return u;\\n\\t\\tfor (int k = log2_n - 1; k >= 0; k--) {\\n\\t\\t\\tif (parent[k][u] != parent[k][v]) {\\n\\t\\t\\t\\tu = parent[k][u];\\n\\t\\t\\t\\tv = parent[k][v];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn parent[0][u];\\n\\t}\\n};\\n\\nclass UnionFind {\\n\\tvector<int> data;\\n\\tint n;\\npublic:\\n\\tUnionFind(int size) : data(size, -1), n(size) { }\\n\\tbool merge(int x, int y) {//xとyの集合を統合する\\n\\t\\tx = root(x); y = root(y);\\n\\t\\tif (x != y) {\\n\\t\\t\\tif (data[y] < data[x]) swap(x, y);\\n\\t\\t\\tdata[x] += data[y]; data[y] = x;\\n\\t\\t}\\n\\t\\tn -= (x != y);\\n\\t\\treturn x != y;\\n\\t}\\n\\tbool same(int x, int y) {//xとyが同じ集合か返す\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n\\tint root(int x) {//xのルートを返す\\n\\t\\treturn data[x] < 0 ? x : data[x] = root(data[x]);\\n\\t}\\n\\tint size(int x) {//xの集合のサイズを返す\\n\\t\\treturn -data[root(x)];\\n\\t}\\n\\tint num() {//集合の数を返す\\n\\t\\treturn n;\\n\\t}\\n};\\n\\ntemplate<typename T, typename F>\\nclass SegmentTree {\\nprivate:\\n\\tT identity;\\n\\tF merge;\\n\\tll n;\\n\\tvector<T> dat;\\npublic:\\n\\tSegmentTree(F f, T id, vector<T> v) :merge(f), identity(id) {\\n\\t\\tint _n = v.size();\\n\\t\\tn = 1;\\n\\t\\twhile (n < _n)n *= 2;\\n\\t\\tdat.resize(2 * n - 1, identity);\\n\\t\\tREP(i, _n)dat[n + i - 1] = v[i];\\n\\t\\tfor (int i = n - 2; i >= 0; i--)dat[i] = merge(dat[i * 2 + 1], dat[i * 2 + 2]);\\n\\t}\\n\\tSegmentTree(F f, T id, int _n) :merge(f), identity(id) {\\n\\t\\tn = 1;\\n\\t\\twhile (n < _n)n *= 2;\\n\\t\\tdat.resize(2 * n - 1, identity);\\n\\t}\\n\\tvoid set_val(int i, T x) {\\n\\t\\ti += n - 1;\\n\\t\\tdat[i] = x;\\n\\t\\twhile (i > 0) {\\n\\t\\t\\ti = (i - 1) / 2;\\n\\t\\t\\tdat[i] = merge(dat[i * 2 + 1], dat[i * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tT query(int l, int r) {\\n\\t\\tT left = identity, right = identity;\\n\\t\\tl += n - 1; r += n - 1;\\n\\t\\twhile (l < r) {\\n\\t\\t\\tif ((l & 1) == 0)left = merge(left, dat[l]);\\n\\t\\t\\tif ((r & 1) == 0)right = merge(dat[r - 1], right);\\n\\t\\t\\tl = l / 2;\\n\\t\\t\\tr = (r - 1) / 2;\\n\\t\\t}\\n\\t\\treturn merge(left, right);\\n\\t}\\n};\\n\\ntemplate< typename T >\\nclass FenwickTree {\\n\\tvector< T > data;\\n\\tint n;\\n\\tint p;\\npublic:\\n\\tFenwickTree(int n) :n(n) {\\n\\t\\tdata.resize(n + 1LL, 0);\\n\\t\\tp = 1;\\n\\t\\twhile (p < data.size())p *= 2;\\n\\t}\\n\\tT sum(int k) {\\n\\t\\tT ret = 0;\\n\\t\\tfor (; k > 0; k -= k & -k) ret += data[k];\\n\\t\\treturn (ret);\\n\\t}\\n\\n\\tT sum(int a, int b) { return sum(b) - sum(a); }//[a,b)\\n\\n\\tvoid add(int k, T x) {\\n\\t\\tfor (++k; k <= n; k += k & -k) data[k] += x;\\n\\t}\\n\\n\\tint lower_bound(ll w) {\\n\\t\\tif (w <= 0)return -1;\\n\\t\\tint x = 0;\\n\\t\\tfor (int k = p / 2; k > 0; k /= 2) {\\n\\t\\t\\tif (x + k <= n && data[x + k] < w)w -= data[x + k], x += k;\\n\\t\\t}\\n\\t\\treturn x;\\n\\t}\\n};\\n\\n\\n\\n//約数求める //約数\\nvoid divisor(ll n, vector<ll>& ret) {\\n\\tfor (ll i = 1; i * i <= n; i++) {\\n\\t\\tif (n % i == 0) {\\n\\t\\t\\tret.push_back(i);\\n\\t\\t\\tif (i * i != n) ret.push_back(n / i);\\n\\t\\t}\\n\\t}\\n\\tsort(ret.begin(), ret.end());\\n}\\n\\nvoid prime_factorization(ll n, vector<P>& ret) {\\n\\tfor (ll i = 2; i * i <= n; i++) {\\n\\t\\tif (n % i == 0) {\\n\\t\\t\\tret.push_back({ i,0 });\\n\\t\\t\\twhile (n % i == 0) {\\n\\t\\t\\t\\tn /= i;\\n\\t\\t\\t\\tret[ret.size() - 1].second++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (n != 1)ret.push_back({ n,1 });\\n}\\n\\n\\ninline ll mod_pow(ll x, ll n, ll mod) {\\n\\tll res = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) res = res * x % mod;\\n\\t\\tx = x * x % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\ninline ll mod_inv(ll x, ll mod) {\\n\\treturn mod_pow(x, mod - 2, mod);\\n}\\n\\nclass Combination {\\npublic:\\n\\tArray fact;\\n\\tArray fact_inv;\\n\\tll mod;\\n\\t//if n >= mod use lucas \\n\\tll nCr(ll n, ll r) {\\n\\t\\tif (n < r)return 0;\\n\\t\\tif (n < mod)return ((fact[n] * fact_inv[r] % mod) * fact_inv[n - r]) % mod;\\n\\n\\t\\tll ret = 1;\\n\\t\\twhile (n || r) {\\n\\t\\t\\tll _n = n % mod, _r = r % mod;\\n\\t\\t\\tn /= mod; r /= mod;\\n\\t\\t\\t(ret *= nCr(_n, _r)) %= mod;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tll nPr(ll n, ll r) {\\n\\t\\treturn (fact[n] * fact_inv[n - r]) % mod;\\n\\t}\\n\\tll nHr(ll n, ll r) {\\n\\t\\treturn nCr(r + n - 1, r);\\n\\t}\\n\\tCombination(ll _n, ll _mod) {\\n\\t\\tmod = _mod;\\n\\t\\tll n = min(_n + 1, mod);\\n\\t\\tfact.resize(n);\\n\\t\\tfact[0] = 1;\\n\\t\\tREP(i, n - 1) {\\n\\t\\t\\tfact[i + 1] = (fact[i] * (i + 1LL)) % mod;\\n\\t\\t}\\n\\t\\tfact_inv.resize(n);\\n\\t\\tfact_inv[n - 1] = mod_inv(fact[n - 1], mod);\\n\\t\\tfor (int i = n - 1; i > 0; i--) {\\n\\t\\t\\tfact_inv[i - 1] = fact_inv[i] * i % mod;\\n\\t\\t}\\n\\t}\\n};\\n\\nll popcount(ll x) {\\n\\tx = (x & 0x5555555555555555) + (x >> 1 & 0x5555555555555555);\\n\\tx = (x & 0x3333333333333333) + (x >> 2 & 0x3333333333333333);\\n\\tx = (x & 0x0F0F0F0F0F0F0F0F) + (x >> 4 & 0x0F0F0F0F0F0F0F0F);\\n\\tx = (x & 0x00FF00FF00FF00FF) + (x >> 8 & 0x00FF00FF00FF00FF);\\n\\tx = (x & 0x0000FFFF0000FFFF) + (x >> 16 & 0x0000FFFF0000FFFF);\\n\\tx = (x & 0x00000000FFFFFFFF) + (x >> 32 & 0x00000000FFFFFFFF);\\n\\n\\treturn x;\\n}\\n\\n\\n\\ntemplate<ll mod, ll root>//特殊な素数と原始根 998244353のとき3\\nclass NTT {\\nprivate:\\n\\ttemplate<typename T>\\n\\tinline void bit_reverse(vector<T>& a) {\\n\\t\\tint n = a.size();\\n\\t\\tint i = 0;\\n\\t\\tfor (int j = 1; j < n - 1; ++j) {\\n\\t\\t\\tfor (int k = n >> 1; k > (i ^= k); k >>= 1);\\n\\t\\t\\tif (j < i) swap(a[i], a[j]);\\n\\t\\t}\\n\\t}\\n\\tvoid _ntt(vector<long long>& a, int sign) {\\n\\t\\tconst int n = a.size();\\n\\t\\tassert((n ^ (n & -n)) == 0); //n = 2^k\\n\\n\\t\\tlong long tmp = (mod - 1) * mod_pow((ll)n, mod - 2, mod) % mod; // -1/n\\n\\t\\tlong long h = mod_pow(root, tmp, mod); // ^n√g\\n\\t\\tif (sign == -1) h = mod_pow(h, mod - 2, mod);\\n\\n\\t\\tbit_reverse(a);\\n\\n\\t\\tfor (ll m = 1; m < n; m <<= 1) {\\n\\t\\t\\tconst ll m2 = 2 * m;\\n\\t\\t\\tlong long _base = mod_pow((ll)h, (ll)(n / m2), mod);\\n\\t\\t\\tlong long _w = 1;\\n\\t\\t\\tfor (int x = 0; x < m; ++x) {//計算量わからない\\n\\t\\t\\t\\tfor (ll s = x; s < n; s += m2) {\\n\\t\\t\\t\\t\\tlong long u = a[s];\\n\\t\\t\\t\\t\\tlong long d = (a[s + m] * _w) % mod;\\n\\t\\t\\t\\t\\ta[s] = (u + d) % mod;\\n\\t\\t\\t\\t\\ta[s + m] = (u - d + mod) % mod;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t_w = (_w * _base) % mod;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid ntt(vector<long long>& input) { _ntt(input, 1); }//フーリエ変換\\n\\n\\tvoid intt(vector<long long>& input) {//フーリエ逆変換\\n\\t\\t_ntt(input, -1);\\n\\t\\tconst long long n_inv = mod_pow((ll)input.size(), mod - 2, mod);\\n\\t\\tfor (auto& x : input) x = (x * n_inv) % mod;\\n\\t}\\npublic:\\n\\t// 畳み込み演算を行う\\n\\tvector<long long> convolution(const vector<long long>& a, const vector<long long>& b) {\\n\\t\\tint result_size = a.size() + b.size() - 1;\\n\\t\\tint n = 1; while (n < result_size) n <<= 1;\\n\\n\\t\\tvector<long long> _a = a, _b = b;\\n\\t\\t_a.resize(n, 0);\\n\\t\\t_b.resize(n, 0);\\n\\n\\t\\tntt(_a);\\n\\t\\tntt(_b);\\n\\t\\tfor (int i = 0; i < n; ++i) _a[i] = (_a[i] * _b[i]) % mod;\\n\\t\\tintt(_a);\\n\\n\\t\\t_a.resize(result_size);\\n\\t\\treturn _a;\\n\\t}\\n\\tvector<long long> convolution(const vector<long long>& a, ll m, ll mx_sz) {//多項式に落とし込めるdpが解ける\\n\\t\\tint result_size = mx_sz;\\n\\t\\tint n = 1; while (n < result_size) n <<= 1;\\n\\n\\t\\tvector<long long> _a = a;\\n\\t\\t_a.resize(n, 0);\\n\\n\\t\\tntt(_a);\\n\\t\\tfor (int i = 0; i < n; ++i) _a[i] = mod_pow(_a[i], m, mod);\\n\\t\\tintt(_a);\\n\\n\\t\\t_a.resize(result_size);\\n\\t\\treturn _a;\\n\\t}\\n};\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tstd::cin.tie(0);\\n\\tstd::cout.tie(0);\\n\\n\\tconstexpr ll mod = 998244353;\\n\\tll n, l;\\n\\tcin >> n >> l;\\n\\tArray t(n);\\n\\tfor (auto& e : t)cin >> e;\\n\\tll m, d;\\n\\tcin >> m >> d;\\n\\tArray x(m), p(m);\\n\\tx.push_back(l);\\n\\tREP(i, m)cin >> x[i] >> p[i];\\n\\tdeque<Array> c;\\n\\tREP(i, m) {\\n\\t\\tArray tmp(2 * (x[i + 1] - x[i]) + 1, 0);\\n\\t\\ttmp[0] = p[i];\\n\\t\\ttmp.back() = 100 - p[i];\\n\\t\\tc.emplace_back(tmp);\\n\\t}\\n\\tNTT<998244353, 3> ntt;\\n\\twhile (c.size() > 1) {\\n\\t\\tauto a = c.front();\\n\\t\\tc.pop_front();\\n\\t\\tauto b = c.front();\\n\\t\\tc.pop_front();\\n\\t\\tc.emplace_back(ntt.convolution(a, b));\\n\\t}\\n\\tArray u(4 * l + 4, 0), v(4 * l + 4, 0);\\n\\tu[2 * l + 1] = 1;\\n\\trep(i, 1, n) {\\n\\t\\tll dif = (t[0] - t[i]) * l;\\n\\t\\tif (dif >= 0) {\\n\\t\\t\\tdif = min((dif + d - 1) / d, 2 * l + 1);\\n\\t\\t\\tv[2 * l + 1 - dif]++;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tdif *= -1;\\n\\t\\t\\tdif = min(dif / d + (dif%(2*d)==0?1:0), 2 * l + 1);\\n\\t\\t\\tv[2 * l + 1 + dif]++;\\n\\t\\t}\\n\\t}\\n\\t//for (auto e : u)cout << e << \\\" \\\";\\n\\t//cout << endl;\\n\\t//for (auto e : v)cout << e << \\\" \\\";\\n\\t//cout << endl;\\n\\tu = ntt.convolution(u, c.front());\\n\\tv = ntt.convolution(v, c.front());\\n\\t//for (auto e : u)cout << e << \\\" \\\";\\n\\t//cout << endl;\\n\\t//for (auto e : v)cout << e << \\\" \\\";\\n\\t//cout << endl;\\n\\n\\tll ans = 0;\\n\\tll total = accumulate(all(u), 0LL, [&](ll a, ll b) {return (a + b) % mod; });\\n\\tll now = 0;\\n\\tREP(i, u.size()) {\\n\\t\\tif (u[i] != 0) (ans += (now * mod_inv(total, mod) % mod) % mod * u[i] % mod) %= mod;\\n\\t\\t(now += v[i]) %= mod;\\n\\t}\\n//\\tcout << ans << \\\"\\\\n\\\";\\n\\tcout << (1 + ans * mod_inv(total, mod) % mod) % mod << \\\"\\\\n\\\";\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1110,\n \"memory_kb\": 46324,\n \"score_of_the_acc\": -1.6326,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3182_4855205\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n// modint\\ntemplate<int MOD> struct Fp {\\n long long val;\\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\\n if (val < 0) val += MOD;\\n }\\n constexpr int getmod() const { return MOD; }\\n constexpr Fp operator - () const noexcept {\\n return val ? MOD - val : 0;\\n }\\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\\n constexpr Fp& operator += (const Fp& r) noexcept {\\n val += r.val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -= (const Fp& r) noexcept {\\n val -= r.val;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp& operator *= (const Fp& r) noexcept {\\n val = val * r.val % MOD;\\n return *this;\\n }\\n constexpr Fp& operator /= (const Fp& r) noexcept {\\n long long a = r.val, b = MOD, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b, swap(a, b);\\n u -= t * v, swap(u, v);\\n }\\n val = val * u % MOD;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr bool operator == (const Fp& r) const noexcept {\\n return this->val == r.val;\\n }\\n constexpr bool operator != (const Fp& r) const noexcept {\\n return this->val != r.val;\\n }\\n constexpr bool operator < (const Fp& r) const noexcept {\\n return this->val < r.val;\\n }\\n friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {\\n is >> x.val;\\n x.val %= MOD;\\n if (x.val < 0) x.val += MOD;\\n return is;\\n }\\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\\n return os << x.val;\\n }\\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\\n if (n == 0) return 1;\\n auto t = modpow(a, n / 2);\\n t = t * t;\\n if (n & 1) t = t * a;\\n return t;\\n }\\n};\\n\\nnamespace NTT {\\n long long modpow(long long a, long long n, int mod) {\\n long long res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a % mod;\\n a = a * a % mod;\\n n >>= 1;\\n }\\n return res;\\n }\\n\\n long long modinv(long long a, int mod) {\\n long long b = mod, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b, swap(a, b);\\n u -= t * v, swap(u, v);\\n }\\n u %= mod;\\n if (u < 0) u += mod;\\n return u;\\n }\\n\\n int calc_primitive_root(int mod) {\\n if (mod == 2) return 1;\\n if (mod == 167772161) return 3;\\n if (mod == 469762049) return 3;\\n if (mod == 754974721) return 11;\\n if (mod == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n long long x = (mod - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (long long i = 3; i * i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) x /= i;\\n }\\n }\\n if (x > 1) divs[cnt++] = x;\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (modpow(g, (mod - 1) / divs[i], mod) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n }\\n\\n int get_fft_size(int N, int M) {\\n int size_a = 1, size_b = 1;\\n while (size_a < N) size_a <<= 1;\\n while (size_b < M) size_b <<= 1;\\n return max(size_a, size_b) << 1;\\n }\\n\\n // number-theoretic transform\\n template<class mint> void trans(vector<mint> &v, bool inv = false) {\\n if (v.empty()) return;\\n int N = (int)v.size();\\n int MOD = v[0].getmod();\\n int PR = calc_primitive_root(MOD);\\n static bool first = true;\\n static vector<long long> vbw(30), vibw(30);\\n if (first) {\\n first = false;\\n for (int k = 0; k < 30; ++k) {\\n vbw[k] = modpow(PR, (MOD - 1) >> (k + 1), MOD);\\n vibw[k] = modinv(vbw[k], MOD);\\n }\\n }\\n for (int i = 0, j = 1; j < N - 1; j++) {\\n for (int k = N >> 1; k > (i ^= k); k >>= 1);\\n if (i > j) swap(v[i], v[j]);\\n }\\n for (int k = 0, t = 2; t <= N; ++k, t <<= 1) {\\n long long bw = vbw[k];\\n if (inv) bw = vibw[k];\\n for (int i = 0; i < N; i += t) {\\n mint w = 1;\\n for (int j = 0; j < t/2; ++j) {\\n int j1 = i + j, j2 = i + j + t/2;\\n mint c1 = v[j1], c2 = v[j2] * w;\\n v[j1] = c1 + c2;\\n v[j2] = c1 - c2;\\n w *= bw;\\n }\\n }\\n }\\n if (inv) {\\n long long invN = modinv(N, MOD);\\n for (int i = 0; i < N; ++i) v[i] = v[i] * invN;\\n }\\n }\\n\\n // small case (T = mint, long long)\\n template<class T> vector<T> naive_mul \\n (const vector<T> &A, const vector<T> &B) {\\n if (A.empty() || B.empty()) return {};\\n int N = (int)A.size(), M = (int)B.size();\\n vector<T> res(N + M - 1);\\n for (int i = 0; i < N; ++i)\\n for (int j = 0; j < M; ++j)\\n res[i + j] += A[i] * B[j];\\n return res;\\n }\\n\\n // mint\\n template<class mint> vector<mint> operator * \\n (const vector<mint> &A, const vector<mint> &B) {\\n if (A.empty() || B.empty()) return {};\\n int N = (int)A.size(), M = (int)B.size();\\n if (min(N, M) < 30) return naive_mul(A, B);\\n int MOD = A[0].getmod();\\n int size_fft = get_fft_size(N, M);\\n vector<mint> a(size_fft), b(size_fft), c(size_fft);\\n for (int i = 0; i < N; ++i) a[i] = A[i];\\n for (int i = 0; i < M; ++i) b[i] = B[i];\\n trans(a), trans(b);\\n vector<mint> res(size_fft);\\n for (int i = 0; i < size_fft; ++i) res[i] = a[i] * b[i];\\n trans(res, true);\\n res.resize(N + M - 1);\\n return res;\\n }\\n};\\n\\nconst int MOD = 998244353;\\nusing mint = Fp<MOD>;\\nusing namespace NTT;\\n\\n\\nint main() {\\n long long N, L, M, D;\\n cin >> N >> L;\\n vector<long long> t(N);\\n for (int i = 0; i < N; ++i) cin >> t[i];\\n cin >> M >> D;\\n vector<long long> x(M + 1, L);\\n vector<mint> p(M);\\n for (int i = 0; i < M; ++i) cin >> x[i] >> p[i], p[i] /= 100;\\n\\n priority_queue<pair<int,vector<mint>>, vector<pair<int,vector<mint>>>, greater<pair<int,vector<mint>>>> que;\\n for (int i = 0; i < M; ++i) {\\n long long l = x[i+1] - x[i];\\n vector<mint> v(l+1, 0);\\n v[0] = mint(1) - p[i];\\n v[l] = p[i];\\n que.push({l+1, v});\\n }\\n while (que.size() >= 2) {\\n auto left = que.top(); que.pop();\\n auto right = que.top(); que.pop();\\n auto mul = left.second * right.second;\\n que.push({mul.size(), mul});\\n }\\n auto f = que.top().second;\\n long long deg = f.size() - 1;\\n auto g = f;\\n reverse(g.begin(), g.end());\\n auto fg = f * g;\\n vector<mint> sum(fg.size()+1, 0);\\n for (int i = 0; i < fg.size(); ++i) sum[i+1] = sum[i] + fg[i];\\n\\n mint res = 1;\\n for (int i = 1; i < N; ++i) {\\n long long lim = deg + (L * (t[0] - t[i]) + D * 20000000 + D * 2 - 1) / (D * 2) - 10000000;\\n chmax(lim, 0LL);\\n chmin(lim, (long long)sum.size() - 1);\\n res += sum[lim];\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 20028,\n \"score_of_the_acc\": -0.2822,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3182_4855175\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it << \\\"> \\\"; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it.first << \\\"->\\\" << it.second << \\\"> \\\"; } return s << endl; }\\n\\n\\n// modint\\ntemplate<int MOD> struct Fp {\\n long long val;\\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\\n if (val < 0) val += MOD;\\n }\\n constexpr int getmod() const { return MOD; }\\n constexpr Fp operator - () const noexcept {\\n return val ? MOD - val : 0;\\n }\\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\\n constexpr Fp& operator += (const Fp& r) noexcept {\\n val += r.val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -= (const Fp& r) noexcept {\\n val -= r.val;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp& operator *= (const Fp& r) noexcept {\\n val = val * r.val % MOD;\\n return *this;\\n }\\n constexpr Fp& operator /= (const Fp& r) noexcept {\\n long long a = r.val, b = MOD, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b, swap(a, b);\\n u -= t * v, swap(u, v);\\n }\\n val = val * u % MOD;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr bool operator == (const Fp& r) const noexcept {\\n return this->val == r.val;\\n }\\n constexpr bool operator != (const Fp& r) const noexcept {\\n return this->val != r.val;\\n }\\n constexpr bool operator < (const Fp& r) const noexcept {\\n return this->val < r.val;\\n }\\n friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {\\n is >> x.val;\\n x.val %= MOD;\\n if (x.val < 0) x.val += MOD;\\n return is;\\n }\\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\\n return os << x.val;\\n }\\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\\n if (n == 0) return 1;\\n auto t = modpow(a, n / 2);\\n t = t * t;\\n if (n & 1) t = t * a;\\n return t;\\n }\\n};\\n\\nnamespace NTT {\\n long long modpow(long long a, long long n, int mod) {\\n long long res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a % mod;\\n a = a * a % mod;\\n n >>= 1;\\n }\\n return res;\\n }\\n\\n long long modinv(long long a, int mod) {\\n long long b = mod, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b, swap(a, b);\\n u -= t * v, swap(u, v);\\n }\\n u %= mod;\\n if (u < 0) u += mod;\\n return u;\\n }\\n\\n int calc_primitive_root(int mod) {\\n if (mod == 2) return 1;\\n if (mod == 167772161) return 3;\\n if (mod == 469762049) return 3;\\n if (mod == 754974721) return 11;\\n if (mod == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n long long x = (mod - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (long long i = 3; i * i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) x /= i;\\n }\\n }\\n if (x > 1) divs[cnt++] = x;\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (modpow(g, (mod - 1) / divs[i], mod) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n }\\n\\n int get_fft_size(int N, int M) {\\n int size_a = 1, size_b = 1;\\n while (size_a < N) size_a <<= 1;\\n while (size_b < M) size_b <<= 1;\\n return max(size_a, size_b) << 1;\\n }\\n\\n // number-theoretic transform\\n template<class mint> void trans(vector<mint> &v, bool inv = false) {\\n if (v.empty()) return;\\n int N = (int)v.size();\\n int MOD = v[0].getmod();\\n int PR = calc_primitive_root(MOD);\\n static bool first = true;\\n static vector<long long> vbw(30), vibw(30);\\n if (first) {\\n first = false;\\n for (int k = 0; k < 30; ++k) {\\n vbw[k] = modpow(PR, (MOD - 1) >> (k + 1), MOD);\\n vibw[k] = modinv(vbw[k], MOD);\\n }\\n }\\n for (int i = 0, j = 1; j < N - 1; j++) {\\n for (int k = N >> 1; k > (i ^= k); k >>= 1);\\n if (i > j) swap(v[i], v[j]);\\n }\\n for (int k = 0, t = 2; t <= N; ++k, t <<= 1) {\\n long long bw = vbw[k];\\n if (inv) bw = vibw[k];\\n for (int i = 0; i < N; i += t) {\\n mint w = 1;\\n for (int j = 0; j < t/2; ++j) {\\n int j1 = i + j, j2 = i + j + t/2;\\n mint c1 = v[j1], c2 = v[j2] * w;\\n v[j1] = c1 + c2;\\n v[j2] = c1 - c2;\\n w *= bw;\\n }\\n }\\n }\\n if (inv) {\\n long long invN = modinv(N, MOD);\\n for (int i = 0; i < N; ++i) v[i] = v[i] * invN;\\n }\\n }\\n\\n // for garner\\n static constexpr int MOD0 = 754974721;\\n static constexpr int MOD1 = 167772161;\\n static constexpr int MOD2 = 469762049;\\n using mint0 = Fp<MOD0>;\\n using mint1 = Fp<MOD1>;\\n using mint2 = Fp<MOD2>;\\n static const mint1 imod0 = 95869806; // modinv(MOD0, MOD1);\\n static const mint2 imod1 = 104391568; // modinv(MOD1, MOD2);\\n static const mint2 imod01 = 187290749; // imod1 / MOD0;\\n\\n // small case (T = mint, long long)\\n template<class T> vector<T> naive_mul \\n (const vector<T> &A, const vector<T> &B) {\\n if (A.empty() || B.empty()) return {};\\n int N = (int)A.size(), M = (int)B.size();\\n vector<T> res(N + M - 1);\\n for (int i = 0; i < N; ++i)\\n for (int j = 0; j < M; ++j)\\n res[i + j] += A[i] * B[j];\\n return res;\\n }\\n\\n // mint\\n template<class mint> vector<mint> operator * \\n (const vector<mint> &A, const vector<mint> &B) {\\n if (A.empty() || B.empty()) return {};\\n int N = (int)A.size(), M = (int)B.size();\\n if (min(N, M) < 30) return naive_mul(A, B);\\n int MOD = A[0].getmod();\\n int size_fft = get_fft_size(N, M);\\n if (MOD == 998244353) {\\n vector<mint> a(size_fft), b(size_fft), c(size_fft);\\n for (int i = 0; i < N; ++i) a[i] = A[i];\\n for (int i = 0; i < M; ++i) b[i] = B[i];\\n trans(a), trans(b);\\n vector<mint> res(size_fft);\\n for (int i = 0; i < size_fft; ++i) res[i] = a[i] * b[i];\\n trans(res, true);\\n res.resize(N + M - 1);\\n return res;\\n }\\n vector<mint0> a0(size_fft, 0), b0(size_fft, 0), c0(size_fft, 0);\\n vector<mint1> a1(size_fft, 0), b1(size_fft, 0), c1(size_fft, 0);\\n vector<mint2> a2(size_fft, 0), b2(size_fft, 0), c2(size_fft, 0);\\n for (int i = 0; i < N; ++i)\\n a0[i] = A[i].val, a1[i] = A[i].val, a2[i] = A[i].val;\\n for (int i = 0; i < M; ++i)\\n b0[i] = B[i].val, b1[i] = B[i].val, b2[i] = B[i].val;\\n trans(a0), trans(a1), trans(a2), trans(b0), trans(b1), trans(b2);\\n for (int i = 0; i < size_fft; ++i) {\\n c0[i] = a0[i] * b0[i];\\n c1[i] = a1[i] * b1[i];\\n c2[i] = a2[i] * b2[i];\\n }\\n trans(c0, true), trans(c1, true), trans(c2, true);\\n static const mint mod0 = MOD0, mod01 = mod0 * MOD1;\\n vector<mint> res(N + M - 1);\\n for (int i = 0; i < N + M - 1; ++i) {\\n int y0 = c0[i].val;\\n int y1 = (imod0 * (c1[i] - y0)).val;\\n int y2 = (imod01 * (c2[i] - y0) - imod1 * y1).val;\\n res[i] = mod01 * y2 + mod0 * y1 + y0;\\n }\\n return res;\\n }\\n\\n // long long\\n vector<long long> mul\\n (const vector<long long> &A, const vector<long long> &B) {\\n if (A.empty() || B.empty()) return {};\\n int N = (int)A.size(), M = (int)B.size();\\n if (min(N, M) < 30) return naive_mul(A, B);\\n int size_fft = get_fft_size(N, M);\\n vector<mint0> a0(size_fft, 0), b0(size_fft, 0), c0(size_fft, 0);\\n vector<mint1> a1(size_fft, 0), b1(size_fft, 0), c1(size_fft, 0);\\n vector<mint2> a2(size_fft, 0), b2(size_fft, 0), c2(size_fft, 0);\\n for (int i = 0; i < N; ++i)\\n a0[i] = A[i], a1[i] = A[i], a2[i] = A[i];\\n for (int i = 0; i < M; ++i)\\n b0[i] = B[i], b1[i] = B[i], b2[i] = B[i];\\n trans(a0), trans(a1), trans(a2), trans(b0), trans(b1), trans(b2);\\n for (int i = 0; i < size_fft; ++i) {\\n c0[i] = a0[i] * b0[i];\\n c1[i] = a1[i] * b1[i];\\n c2[i] = a2[i] * b2[i];\\n }\\n trans(c0, true), trans(c1, true), trans(c2, true);\\n static const long long mod0 = MOD0, mod01 = mod0 * MOD1;\\n vector<long long> res(N + M - 1);\\n for (int i = 0; i < N + M - 1; ++i) {\\n int y0 = c0[i].val;\\n int y1 = (imod0 * (c1[i] - y0)).val;\\n int y2 = (imod01 * (c2[i] - y0) - imod1 * y1).val;\\n res[i] = mod01 * y2 + mod0 * y1 + y0;\\n }\\n return res;\\n }\\n};\\n\\nconst int MOD = 998244353;\\nusing mint = Fp<MOD>;\\nusing namespace NTT;\\n\\n\\nint main() {\\n long long N, L, M, D;\\n cin >> N >> L;\\n vector<long long> t(N);\\n for (int i = 0; i < N; ++i) cin >> t[i];\\n cin >> M >> D;\\n vector<long long> x(M + 1, L);\\n vector<mint> p(M);\\n for (int i = 0; i < M; ++i) cin >> x[i] >> p[i], p[i] /= 100;\\n\\n priority_queue<pair<int,vector<mint>>, vector<pair<int,vector<mint>>>, greater<pair<int,vector<mint>>>> que;\\n for (int i = 0; i < M; ++i) {\\n long long l = x[i+1] - x[i];\\n vector<mint> v(l+1, 0);\\n v[0] = mint(1) - p[i];\\n v[l] = p[i];\\n que.push({l+1, v});\\n }\\n while (que.size() >= 2) {\\n auto left = que.top(); que.pop();\\n auto right = que.top(); que.pop();\\n auto mul = left.second * right.second;\\n que.push({mul.size(), mul});\\n }\\n auto f = que.top().second;\\n long long deg = f.size() - 1;\\n auto g = f;\\n reverse(g.begin(), g.end());\\n auto fg = f * g;\\n int size = fg.size();\\n vector<mint> sum(size+1, 0);\\n for (int i = 0; i < size; ++i) sum[i+1] = sum[i] + fg[i];\\n\\n mint res = 1;\\n for (int i = 1; i < N; ++i) {\\n long long lim = deg + (L * (t[0] - t[i]) + D * 20000000 + D * 2 - 1) / (D * 2) - 10000000;\\n chmax(lim, 0LL);\\n chmin(lim, (long long)sum.size() - 1);\\n res += sum[lim];\\n\\n //cout << i << \\\": \\\" << lim << endl;\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 20024,\n \"score_of_the_acc\": -0.327,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3182_4855128\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it << \\\"> \\\"; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it.first << \\\"->\\\" << it.second << \\\"> \\\"; } return s << endl; }\\n\\n\\n// modint\\ntemplate<int MOD> struct Fp {\\n long long val;\\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\\n if (val < 0) val += MOD;\\n }\\n constexpr int getmod() const { return MOD; }\\n constexpr Fp operator - () const noexcept {\\n return val ? MOD - val : 0;\\n }\\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\\n constexpr Fp& operator += (const Fp& r) noexcept {\\n val += r.val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -= (const Fp& r) noexcept {\\n val -= r.val;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp& operator *= (const Fp& r) noexcept {\\n val = val * r.val % MOD;\\n return *this;\\n }\\n constexpr Fp& operator /= (const Fp& r) noexcept {\\n long long a = r.val, b = MOD, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b, swap(a, b);\\n u -= t * v, swap(u, v);\\n }\\n val = val * u % MOD;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr bool operator == (const Fp& r) const noexcept {\\n return this->val == r.val;\\n }\\n constexpr bool operator != (const Fp& r) const noexcept {\\n return this->val != r.val;\\n }\\n constexpr bool operator < (const Fp& r) const noexcept {\\n return this->val < r.val;\\n }\\n friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {\\n is >> x.val;\\n x.val %= MOD;\\n if (x.val < 0) x.val += MOD;\\n return is;\\n }\\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {\\n return os << x.val;\\n }\\n friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {\\n if (n == 0) return 1;\\n auto t = modpow(a, n / 2);\\n t = t * t;\\n if (n & 1) t = t * a;\\n return t;\\n }\\n};\\n\\nnamespace NTT {\\n long long modpow(long long a, long long n, int mod) {\\n long long res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a % mod;\\n a = a * a % mod;\\n n >>= 1;\\n }\\n return res;\\n }\\n\\n long long modinv(long long a, int mod) {\\n long long b = mod, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b, swap(a, b);\\n u -= t * v, swap(u, v);\\n }\\n u %= mod;\\n if (u < 0) u += mod;\\n return u;\\n }\\n\\n int calc_primitive_root(int mod) {\\n if (mod == 2) return 1;\\n if (mod == 167772161) return 3;\\n if (mod == 469762049) return 3;\\n if (mod == 754974721) return 11;\\n if (mod == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n long long x = (mod - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (long long i = 3; i * i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) x /= i;\\n }\\n }\\n if (x > 1) divs[cnt++] = x;\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (modpow(g, (mod - 1) / divs[i], mod) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n }\\n\\n int get_fft_size(int N, int M) {\\n int size_a = 1, size_b = 1;\\n while (size_a < N) size_a <<= 1;\\n while (size_b < M) size_b <<= 1;\\n return max(size_a, size_b) << 1;\\n }\\n\\n // number-theoretic transform\\n template<class mint> void trans(vector<mint> &v, bool inv = false) {\\n if (v.empty()) return;\\n int N = (int)v.size();\\n int MOD = v[0].getmod();\\n int PR = calc_primitive_root(MOD);\\n static bool first = true;\\n static vector<long long> vbw(30), vibw(30);\\n if (first) {\\n first = false;\\n for (int k = 0; k < 30; ++k) {\\n vbw[k] = modpow(PR, (MOD - 1) >> (k + 1), MOD);\\n vibw[k] = modinv(vbw[k], MOD);\\n }\\n }\\n for (int i = 0, j = 1; j < N - 1; j++) {\\n for (int k = N >> 1; k > (i ^= k); k >>= 1);\\n if (i > j) swap(v[i], v[j]);\\n }\\n for (int k = 0, t = 2; t <= N; ++k, t <<= 1) {\\n long long bw = vbw[k];\\n if (inv) bw = vibw[k];\\n for (int i = 0; i < N; i += t) {\\n mint w = 1;\\n for (int j = 0; j < t/2; ++j) {\\n int j1 = i + j, j2 = i + j + t/2;\\n mint c1 = v[j1], c2 = v[j2] * w;\\n v[j1] = c1 + c2;\\n v[j2] = c1 - c2;\\n w *= bw;\\n }\\n }\\n }\\n if (inv) {\\n long long invN = modinv(N, MOD);\\n for (int i = 0; i < N; ++i) v[i] = v[i] * invN;\\n }\\n }\\n\\n // for garner\\n static constexpr int MOD0 = 754974721;\\n static constexpr int MOD1 = 167772161;\\n static constexpr int MOD2 = 469762049;\\n using mint0 = Fp<MOD0>;\\n using mint1 = Fp<MOD1>;\\n using mint2 = Fp<MOD2>;\\n static const mint1 imod0 = 95869806; // modinv(MOD0, MOD1);\\n static const mint2 imod1 = 104391568; // modinv(MOD1, MOD2);\\n static const mint2 imod01 = 187290749; // imod1 / MOD0;\\n\\n // small case (T = mint, long long)\\n template<class T> vector<T> naive_mul \\n (const vector<T> &A, const vector<T> &B) {\\n if (A.empty() || B.empty()) return {};\\n int N = (int)A.size(), M = (int)B.size();\\n vector<T> res(N + M - 1);\\n for (int i = 0; i < N; ++i)\\n for (int j = 0; j < M; ++j)\\n res[i + j] += A[i] * B[j];\\n return res;\\n }\\n\\n // mint\\n template<class mint> vector<mint> operator * \\n (const vector<mint> &A, const vector<mint> &B) {\\n if (A.empty() || B.empty()) return {};\\n int N = (int)A.size(), M = (int)B.size();\\n if (min(N, M) < 30) return naive_mul(A, B);\\n int MOD = A[0].getmod();\\n int size_fft = get_fft_size(N, M);\\n if (MOD == 998244353) {\\n vector<mint> a(size_fft), b(size_fft), c(size_fft);\\n for (int i = 0; i < N; ++i) a[i] = A[i];\\n for (int i = 0; i < M; ++i) b[i] = B[i];\\n trans(a), trans(b);\\n vector<mint> res(size_fft);\\n for (int i = 0; i < size_fft; ++i) res[i] = a[i] * b[i];\\n trans(res, true);\\n res.resize(N + M - 1);\\n return res;\\n }\\n vector<mint0> a0(size_fft, 0), b0(size_fft, 0), c0(size_fft, 0);\\n vector<mint1> a1(size_fft, 0), b1(size_fft, 0), c1(size_fft, 0);\\n vector<mint2> a2(size_fft, 0), b2(size_fft, 0), c2(size_fft, 0);\\n for (int i = 0; i < N; ++i)\\n a0[i] = A[i].val, a1[i] = A[i].val, a2[i] = A[i].val;\\n for (int i = 0; i < M; ++i)\\n b0[i] = B[i].val, b1[i] = B[i].val, b2[i] = B[i].val;\\n trans(a0), trans(a1), trans(a2), trans(b0), trans(b1), trans(b2);\\n for (int i = 0; i < size_fft; ++i) {\\n c0[i] = a0[i] * b0[i];\\n c1[i] = a1[i] * b1[i];\\n c2[i] = a2[i] * b2[i];\\n }\\n trans(c0, true), trans(c1, true), trans(c2, true);\\n static const mint mod0 = MOD0, mod01 = mod0 * MOD1;\\n vector<mint> res(N + M - 1);\\n for (int i = 0; i < N + M - 1; ++i) {\\n int y0 = c0[i].val;\\n int y1 = (imod0 * (c1[i] - y0)).val;\\n int y2 = (imod01 * (c2[i] - y0) - imod1 * y1).val;\\n res[i] = mod01 * y2 + mod0 * y1 + y0;\\n }\\n return res;\\n }\\n\\n // long long\\n vector<long long> mul\\n (const vector<long long> &A, const vector<long long> &B) {\\n if (A.empty() || B.empty()) return {};\\n int N = (int)A.size(), M = (int)B.size();\\n if (min(N, M) < 30) return naive_mul(A, B);\\n int size_fft = get_fft_size(N, M);\\n vector<mint0> a0(size_fft, 0), b0(size_fft, 0), c0(size_fft, 0);\\n vector<mint1> a1(size_fft, 0), b1(size_fft, 0), c1(size_fft, 0);\\n vector<mint2> a2(size_fft, 0), b2(size_fft, 0), c2(size_fft, 0);\\n for (int i = 0; i < N; ++i)\\n a0[i] = A[i], a1[i] = A[i], a2[i] = A[i];\\n for (int i = 0; i < M; ++i)\\n b0[i] = B[i], b1[i] = B[i], b2[i] = B[i];\\n trans(a0), trans(a1), trans(a2), trans(b0), trans(b1), trans(b2);\\n for (int i = 0; i < size_fft; ++i) {\\n c0[i] = a0[i] * b0[i];\\n c1[i] = a1[i] * b1[i];\\n c2[i] = a2[i] * b2[i];\\n }\\n trans(c0, true), trans(c1, true), trans(c2, true);\\n static const long long mod0 = MOD0, mod01 = mod0 * MOD1;\\n vector<long long> res(N + M - 1);\\n for (int i = 0; i < N + M - 1; ++i) {\\n int y0 = c0[i].val;\\n int y1 = (imod0 * (c1[i] - y0)).val;\\n int y2 = (imod01 * (c2[i] - y0) - imod1 * y1).val;\\n res[i] = mod01 * y2 + mod0 * y1 + y0;\\n }\\n return res;\\n }\\n};\\n\\nconst int MOD = 998244353;\\nusing mint = Fp<MOD>;\\nusing namespace NTT;\\n\\n\\nint main() {\\n long long N, L, M, D;\\n cin >> N >> L;\\n vector<long long> t(N);\\n for (int i = 0; i < N; ++i) cin >> t[i];\\n cin >> M >> D;\\n vector<long long> x(M + 1, L);\\n vector<mint> p(M);\\n for (int i = 0; i < M; ++i) cin >> x[i] >> p[i], p[i] /= 100;\\n\\n priority_queue<pair<int,vector<mint>>, vector<pair<int,vector<mint>>>, greater<pair<int,vector<mint>>>> que;\\n for (int i = 0; i < M; ++i) {\\n long long l = x[i+1] - x[i];\\n vector<mint> v(l+1, 0);\\n v[0] = mint(1) - p[i];\\n v[l] = p[i];\\n que.push({l+1, v});\\n }\\n while (que.size() >= 2) {\\n auto left = que.top(); que.pop();\\n auto right = que.top(); que.pop();\\n auto mul = left.second * right.second;\\n que.push({mul.size(), mul});\\n }\\n auto f = que.top().second;\\n int deg = f.size() - 1;\\n auto g = f;\\n reverse(g.begin(), g.end());\\n auto fg = f * g;\\n int size = fg.size();\\n vector<mint> sum(size+1, 0);\\n for (int i = 0; i < size; ++i) sum[i+1] = sum[i] + fg[i];\\n\\n mint res = 1;\\n for (int i = 1; i < N; ++i) {\\n int lim = deg + (L * (t[0] - t[i]) + D * 20000000 + D * 2 - 1) / (D * 2) - 10000000;\\n chmax(lim, 0);\\n chmin(lim, (int)sum.size() - 1);\\n res += sum[lim];\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 0.6,\n \"time_ms\": 370,\n \"memory_kb\": 19960,\n \"score_of_the_acc\": -0.2921,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3182_4852327\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <iomanip>\\n#include <set>\\n#include <tuple>\\n#define mkp make_pair\\n#define mkt make_tuple\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD=998244353;\\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\\n\\nll mod_pow(ll x,ll n){\\n x%=MOD;\\n ll res=1;\\n while(n>0){\\n if(n&1) res=res*x%MOD;\\n x=x*x%MOD;\\n n>>=1;\\n }\\n return res;\\n}\\n\\nll mod_inverse(ll x){\\n return mod_pow(x,MOD-2);\\n}\\n\\nvoid add(ll &a,ll b){\\n a=(a+b)%MOD;\\n}\\n\\nvoid mul(ll &a,ll b){\\n a%=MOD;b%=MOD;\\n a=a*b%MOD;\\n}\\n\\n//const ll MOD=998244353; // MOD == 119*2^23+1\\n//depends on mod_pow,mod_inverse\\n\\nll root[24],invroot[24];\\n\\nvoid NTT_init(){\\n for(int i=0;i<24;++i){\\n root[i]=mod_pow(3,(MOD-1)/(1<<i));\\n invroot[i]=mod_inverse(root[i]);\\n }\\n}\\n\\nvector<ll> NTT(vector<ll> a,bool inverse=false){\\n int n=a.size();\\n int high=0;\\n for(int i=0;(1<<i)<n;++i) high++;\\n\\n for(int i=0;i<n;++i){\\n int mask=0;\\n for(int k=0;k<high;++k){\\n if(i>>k&1) mask|=(1<<(high-1-k));\\n }\\n if(i<mask) swap(a[i],a[mask]);\\n }\\n\\n for(int j=1;(1<<j)<=n;++j){\\n int m=(1<<j);\\n ll zeta=root[j];\\n if(inverse) zeta=invroot[j];\\n for(int i=0;i<n;i+=m){\\n ll powzeta=1;\\n for(int k=i;k<i+m/2;++k){\\n ll s=a[k];\\n ll t=a[k+m/2]*powzeta%MOD;\\n\\n a[k]=(s+t)%MOD;\\n a[k+m/2]=(s-t+MOD)%MOD;\\n powzeta=powzeta*zeta%MOD;\\n }\\n }\\n }\\n\\n if(inverse){\\n ll invn=mod_inverse(n);\\n for(int i=0;i<n;++i) a[i]=a[i]*invn%MOD;\\n }\\n return a;\\n}\\n\\nvector<ll> convolute(const vector<ll> &a,const vector<ll> &b){\\n int size=a.size()+b.size()-1;\\n int n=1;\\n while(n<size) n<<=1;\\n\\n vector<ll> A(n,0),B(n,0);\\n for(int i=0;i<a.size();i++) A[i]=a[i];\\n for(int i=0;i<b.size();i++) B[i]=b[i];\\n\\n A=NTT(A);\\n B=NTT(B);\\n\\n for(int i=0;i<n;++i) A[i]=A[i]*B[i]%MOD;\\n A=NTT(A,true);\\n\\n A.resize(size);\\n return A;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int N;\\n ll L;\\n cin>>N>>L;\\n vector<ll> T(N);\\n rep(i,N) cin>>T[i];\\n int M;\\n ll D;\\n cin>>M>>D;\\n vector<ll> X(M+1),P(M+1);\\n rep(i,M) cin>>X[i]>>P[i];\\n X[M]=L;\\n\\n NTT_init();\\n\\n ll inv100=mod_inverse(100);\\n vector<vector<ll>> B(M);\\n rep(i,M){\\n int diff=X[i+1]-X[i];\\n B[i].resize(diff+1,0);\\n B[i][0]=P[i]*inv100%MOD;\\n B[i][diff]=(100-P[i])*inv100%MOD;\\n }\\n\\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\\n rep(i,M) PQ.push(mkp(B[i].size(),i));\\n while(PQ.size()>1){\\n auto f=PQ.top();\\n PQ.pop();\\n auto s=PQ.top();\\n PQ.pop();\\n\\n int ft=f.second;\\n int st=s.second;\\n B[ft]=convolute(B[ft],B[st]);\\n B[st].clear();\\n\\n PQ.push(mkp(B[ft].size(),ft));\\n }\\n\\n auto f=PQ.top();PQ.pop();\\n vector<ll> dist=B[f.second];\\n int SZ=dist.size();\\n\\n vector<ll> revd=dist;\\n reverse(all(revd));\\n dist=convolute(dist,revd);\\n\\n int V=dist.size();\\n vector<ll> rsum(V+1,0);\\n for(int i=V-1;i>=0;i--) rsum[i]=(rsum[i+1]+dist[i])%MOD;\\n\\n ll ans=0;\\n for(int i=1;i<N;i++){\\n ll border=(L*abs(T[0]-T[i])+2*D-1)/(2*D);\\n if(T[0]-T[i]<0) border*=(-1);\\n if(T[0]-T[i]<0&&(L*abs(T[0]-T[i]))%(2*D)) ++border;\\n if(border+SZ-1>V) continue;\\n add(ans,rsum[max(0ll,border+SZ-1)]);\\n }\\n ans=(N-ans+MOD)%MOD;\\n add(ans,MOD);\\n cout<<ans<<endl;\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 45732,\n \"score_of_the_acc\": -0.9807,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3182_4852232\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <iomanip>\\n#include <set>\\n#include <tuple>\\n#define mkp make_pair\\n#define mkt make_tuple\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD=998244353;\\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\\n\\nll mod_pow(ll x,ll n){\\n x%=MOD;\\n ll res=1;\\n while(n>0){\\n if(n&1) res=res*x%MOD;\\n x=x*x%MOD;\\n n>>=1;\\n }\\n return res;\\n}\\n\\nll mod_inverse(ll x){\\n return mod_pow(x,MOD-2);\\n}\\n\\nvoid add(ll &a,ll b){\\n a=(a+b)%MOD;\\n}\\n\\nvoid mul(ll &a,ll b){\\n a%=MOD;b%=MOD;\\n a=a*b%MOD;\\n}\\n\\n//const ll MOD=998244353; // MOD == 119*2^23+1\\n//depends on mod_pow,mod_inverse\\n\\nll root[24],invroot[24];\\n\\nvoid NTT_init(){\\n for(int i=0;i<24;++i){\\n root[i]=mod_pow(3,(MOD-1)/(1<<i));\\n invroot[i]=mod_inverse(root[i]);\\n }\\n}\\n\\nvector<ll> NTT(vector<ll> a,bool inverse=false){\\n int n=a.size();\\n int high=0;\\n for(int i=0;(1<<i)<n;++i) high++;\\n\\n for(int i=0;i<n;++i){\\n int mask=0;\\n for(int k=0;k<high;++k){\\n if(i>>k&1) mask|=(1<<(high-1-k));\\n }\\n if(i<mask) swap(a[i],a[mask]);\\n }\\n\\n for(int j=1;(1<<j)<=n;++j){\\n int m=(1<<j);\\n ll zeta=root[j];\\n if(inverse) zeta=invroot[j];\\n for(int i=0;i<n;i+=m){\\n ll powzeta=1;\\n for(int k=i;k<i+m/2;++k){\\n ll s=a[k];\\n ll t=a[k+m/2]*powzeta%MOD;\\n\\n a[k]=(s+t)%MOD;\\n a[k+m/2]=(s-t+MOD)%MOD;\\n powzeta=powzeta*zeta%MOD;\\n }\\n }\\n }\\n\\n if(inverse){\\n ll invn=mod_inverse(n);\\n for(int i=0;i<n;++i) a[i]=a[i]*invn%MOD;\\n }\\n return a;\\n}\\n\\nvector<ll> convolute(const vector<ll> &a,const vector<ll> &b){\\n int size=a.size()+b.size()-1;\\n int n=1;\\n while(n<size) n<<=1;\\n\\n vector<ll> A(n,0),B(n,0);\\n for(int i=0;i<a.size();i++) A[i]=a[i];\\n for(int i=0;i<b.size();i++) B[i]=b[i];\\n\\n A=NTT(A);\\n B=NTT(B);\\n\\n for(int i=0;i<n;++i) A[i]=A[i]*B[i]%MOD;\\n A=NTT(A,true);\\n\\n A.resize(size);\\n return A;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int N;\\n ll L;\\n cin>>N>>L;\\n vector<ll> T(N);\\n rep(i,N) cin>>T[i];\\n int M;\\n ll D;\\n cin>>M>>D;\\n vector<ll> X(M+1),P(M+1);\\n rep(i,M) cin>>X[i]>>P[i];\\n X[M]=L;\\n\\n NTT_init();\\n\\n ll inv100=mod_inverse(100);\\n vector<vector<ll>> B(M);\\n rep(i,M){\\n int diff=X[i+1]-X[i];\\n B[i].resize(diff+1,0);\\n B[i][0]=P[i]*inv100%MOD;\\n B[i][diff]=(100-P[i])*inv100%MOD;\\n }\\n\\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\\n rep(i,M) PQ.push(mkp(B[i].size(),i));\\n while(PQ.size()>1){\\n auto f=PQ.top();\\n PQ.pop();\\n auto s=PQ.top();\\n PQ.pop();\\n\\n int ft=f.second;\\n int st=s.second;\\n B[ft]=convolute(B[ft],B[st]);\\n B[st].clear();\\n\\n PQ.push(mkp(B[ft].size(),ft));\\n }\\n\\n auto f=PQ.top();PQ.pop();\\n vector<ll> dist=B[f.second];\\n vector<ll> revd=dist;\\n reverse(all(revd));\\n dist=convolute(dist,revd);\\n\\n int V=dist.size();\\n vector<ll> rsum(V+1,0);\\n for(int i=V-1;i>=0;i--) rsum[i]=(rsum[i+1]+dist[i])%MOD;\\n\\n ll ans=0;\\n for(int i=1;i<N;i++){\\n ll border=L*(T[0]-T[i])/(2*D);\\n if(T[0]-T[i]<0&&(L*abs(T[0]-T[i]))%(2*D)) --border;\\n if(border+L>V) continue;\\n ans+=rsum[max(0ll,border+L)];\\n ans=(ans+MOD)%MOD;\\n }\\n ans=(N-ans+MOD)%MOD;\\n cout<<ans<<endl;\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 0.075,\n \"time_ms\": 600,\n \"memory_kb\": 45444,\n \"score_of_the_acc\": -1.0425,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3182_4852229\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <iomanip>\\n#include <set>\\n#include <tuple>\\n#define mkp make_pair\\n#define mkt make_tuple\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD=998244353;\\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\\n\\nll mod_pow(ll x,ll n){\\n x%=MOD;\\n ll res=1;\\n while(n>0){\\n if(n&1) res=res*x%MOD;\\n x=x*x%MOD;\\n n>>=1;\\n }\\n return res;\\n}\\n\\nll mod_inverse(ll x){\\n return mod_pow(x,MOD-2);\\n}\\n\\nvoid add(ll &a,ll b){\\n a=(a+b)%MOD;\\n}\\n\\nvoid mul(ll &a,ll b){\\n a%=MOD;b%=MOD;\\n a=a*b%MOD;\\n}\\n\\n//const ll MOD=998244353; // MOD == 119*2^23+1\\n//depends on mod_pow,mod_inverse\\n\\nll root[24],invroot[24];\\n\\nvoid NTT_init(){\\n for(int i=0;i<24;++i){\\n root[i]=mod_pow(3,(MOD-1)/(1<<i));\\n invroot[i]=mod_inverse(root[i]);\\n }\\n}\\n\\nvector<ll> NTT(vector<ll> a,bool inverse=false){\\n int n=a.size();\\n int high=0;\\n for(int i=0;(1<<i)<n;++i) high++;\\n\\n for(int i=0;i<n;++i){\\n int mask=0;\\n for(int k=0;k<high;++k){\\n if(i>>k&1) mask|=(1<<(high-1-k));\\n }\\n if(i<mask) swap(a[i],a[mask]);\\n }\\n\\n for(int j=1;(1<<j)<=n;++j){\\n int m=(1<<j);\\n ll zeta=root[j];\\n if(inverse) zeta=invroot[j];\\n for(int i=0;i<n;i+=m){\\n ll powzeta=1;\\n for(int k=i;k<i+m/2;++k){\\n ll s=a[k];\\n ll t=a[k+m/2]*powzeta%MOD;\\n\\n a[k]=(s+t)%MOD;\\n a[k+m/2]=(s-t+MOD)%MOD;\\n powzeta=powzeta*zeta%MOD;\\n }\\n }\\n }\\n\\n if(inverse){\\n ll invn=mod_inverse(n);\\n for(int i=0;i<n;++i) a[i]=a[i]*invn%MOD;\\n }\\n return a;\\n}\\n\\nvector<ll> convolute(const vector<ll> &a,const vector<ll> &b){\\n int size=a.size()+b.size()-1;\\n int n=1;\\n while(n<size) n<<=1;\\n\\n vector<ll> A(n,0),B(n,0);\\n for(int i=0;i<a.size();i++) A[i]=a[i];\\n for(int i=0;i<b.size();i++) B[i]=b[i];\\n\\n A=NTT(A);\\n B=NTT(B);\\n\\n for(int i=0;i<n;++i) A[i]=A[i]*B[i]%MOD;\\n A=NTT(A,true);\\n\\n A.resize(size);\\n return A;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int N;\\n ll L;\\n cin>>N>>L;\\n vector<ll> T(N);\\n rep(i,N) cin>>T[i];\\n int M;\\n ll D;\\n cin>>M>>D;\\n vector<ll> X(M+1),P(M+1);\\n rep(i,M) cin>>X[i]>>P[i];\\n X[M]=L;\\n\\n NTT_init();\\n\\n ll inv100=mod_inverse(100);\\n vector<vector<ll>> B(M);\\n rep(i,M){\\n int diff=X[i+1]-X[i];\\n B[i].resize(diff+1,0);\\n B[i][0]=P[i]*inv100%MOD;\\n B[i][diff]=(100-P[i])*inv100%MOD;\\n }\\n\\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\\n rep(i,M) PQ.push(mkp(B[i].size(),i));\\n while(PQ.size()>1){\\n auto f=PQ.top();\\n PQ.pop();\\n auto s=PQ.top();\\n PQ.pop();\\n\\n int ft=f.second;\\n int st=s.second;\\n B[ft]=convolute(B[ft],B[st]);\\n B[st].clear();\\n\\n PQ.push(mkp(B[ft].size(),ft));\\n }\\n\\n auto f=PQ.top();PQ.pop();\\n vector<ll> dist=B[f.second];\\n vector<ll> revd=dist;\\n reverse(all(revd));\\n dist=convolute(dist,revd);\\n\\n int V=dist.size();\\n vector<ll> rsum(V+1,0);\\n for(int i=V-1;i>=0;i--) rsum[i]=rsum[i+1]+dist[i];\\n\\n ll ans=0;\\n for(int i=1;i<N;i++){\\n ll border=L*(T[0]-T[i])/(2*D);\\n if(T[0]-T[i]<0&&(L*abs(T[0]-T[i]))%(2*D)) --border;\\n if(border+L>V) continue;\\n ans+=rsum[max(0ll,border+L)];\\n ans=(ans+MOD)%MOD;\\n }\\n ans=(N-ans+MOD)%MOD;\\n cout<<ans<<endl;\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 0.075,\n \"time_ms\": 570,\n \"memory_kb\": 45464,\n \"score_of_the_acc\": -1.0092,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3182_4852227\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <iomanip>\\n#include <set>\\n#include <tuple>\\n#define mkp make_pair\\n#define mkt make_tuple\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD=998244353;\\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\\n\\nll mod_pow(ll x,ll n){\\n x%=MOD;\\n ll res=1;\\n while(n>0){\\n if(n&1) res=res*x%MOD;\\n x=x*x%MOD;\\n n>>=1;\\n }\\n return res;\\n}\\n\\nll mod_inverse(ll x){\\n return mod_pow(x,MOD-2);\\n}\\n\\nvoid add(ll &a,ll b){\\n a=(a+b)%MOD;\\n}\\n\\nvoid mul(ll &a,ll b){\\n a%=MOD;b%=MOD;\\n a=a*b%MOD;\\n}\\n\\n//const ll MOD=998244353; // MOD == 119*2^23+1\\n//depends on mod_pow,mod_inverse\\n\\nll root[24],invroot[24];\\n\\nvoid NTT_init(){\\n for(int i=0;i<24;++i){\\n root[i]=mod_pow(3,(MOD-1)/(1<<i));\\n invroot[i]=mod_inverse(root[i]);\\n }\\n}\\n\\nvector<ll> NTT(vector<ll> a,bool inverse=false){\\n int n=a.size();\\n int high=0;\\n for(int i=0;(1<<i)<n;++i) high++;\\n\\n for(int i=0;i<n;++i){\\n int mask=0;\\n for(int k=0;k<high;++k){\\n if(i>>k&1) mask|=(1<<(high-1-k));\\n }\\n if(i<mask) swap(a[i],a[mask]);\\n }\\n\\n for(int j=1;(1<<j)<=n;++j){\\n int m=(1<<j);\\n ll zeta=root[j];\\n if(inverse) zeta=invroot[j];\\n for(int i=0;i<n;i+=m){\\n ll powzeta=1;\\n for(int k=i;k<i+m/2;++k){\\n ll s=a[k];\\n ll t=a[k+m/2]*powzeta%MOD;\\n\\n a[k]=(s+t)%MOD;\\n a[k+m/2]=(s-t+MOD)%MOD;\\n powzeta=powzeta*zeta%MOD;\\n }\\n }\\n }\\n\\n if(inverse){\\n ll invn=mod_inverse(n);\\n for(int i=0;i<n;++i) a[i]=a[i]*invn%MOD;\\n }\\n return a;\\n}\\n\\nvector<ll> convolute(const vector<ll> &a,const vector<ll> &b){\\n int size=a.size()+b.size()-1;\\n int n=1;\\n while(n<size) n<<=1;\\n\\n vector<ll> A(n,0),B(n,0);\\n for(int i=0;i<a.size();i++) A[i]=a[i];\\n for(int i=0;i<b.size();i++) B[i]=b[i];\\n\\n A=NTT(A);\\n B=NTT(B);\\n\\n for(int i=0;i<n;++i) A[i]=A[i]*B[i]%MOD;\\n A=NTT(A,true);\\n\\n A.resize(size);\\n return A;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int N;\\n ll L;\\n cin>>N>>L;\\n vector<ll> T(N);\\n rep(i,N) cin>>T[i];\\n int M;\\n ll D;\\n cin>>M>>D;\\n vector<ll> X(M+1),P(M+1);\\n rep(i,M) cin>>X[i]>>P[i];\\n X[M]=L;\\n\\n NTT_init();\\n\\n ll inv100=mod_inverse(100);\\n vector<vector<ll>> B(M);\\n rep(i,M){\\n int diff=X[i+1]-X[i];\\n B[i].resize(diff+1,0);\\n B[i][0]=P[i]*inv100%MOD;\\n B[i][diff]=(100-P[i])*inv100%MOD;\\n }\\n\\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\\n rep(i,M) PQ.push(mkp(B[i].size(),i));\\n while(PQ.size()>1){\\n auto f=PQ.top();\\n PQ.pop();\\n auto s=PQ.top();\\n PQ.pop();\\n\\n int ft=f.second;\\n int st=s.second;\\n B[ft]=convolute(B[ft],B[st]);\\n B[st].clear();\\n\\n PQ.push(mkp(B[ft].size(),ft));\\n }\\n\\n auto f=PQ.top();PQ.pop();\\n vector<ll> dist=B[f.second];\\n vector<ll> revd=dist;\\n reverse(all(revd));\\n dist=convolute(dist,revd);\\n\\n int V=dist.size();\\n vector<ll> rsum(V+1,0);\\n for(int i=V-1;i>=0;i--) rsum[i]=rsum[i+1]+dist[i];\\n\\n ll ans=0;\\n for(int i=1;i<N;i++){\\n ll border=L*(T[0]-T[i])/(2*D);\\n if(T[0]-T[i]<0&&(L*abs(T[0]-T[i]))%(2*D)) --border;\\n if(border+L<0||border+L>V) continue;\\n ans+=rsum[border+L];\\n ans=(ans+MOD)%MOD;\\n }\\n ans=(N-ans+MOD)%MOD;\\n cout<<ans<<endl;\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 0.075,\n \"time_ms\": 530,\n \"memory_kb\": 45696,\n \"score_of_the_acc\": -0.9687,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3182_4852226\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <iomanip>\\n#include <set>\\n#include <tuple>\\n#define mkp make_pair\\n#define mkt make_tuple\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\ntypedef long long ll;\\nconst ll MOD=998244353;\\ntemplate<class T> void chmin(T &a,const T &b){if(a>b) a=b;}\\ntemplate<class T> void chmax(T &a,const T &b){if(a<b) a=b;}\\n\\nll mod_pow(ll x,ll n){\\n x%=MOD;\\n ll res=1;\\n while(n>0){\\n if(n&1) res=res*x%MOD;\\n x=x*x%MOD;\\n n>>=1;\\n }\\n return res;\\n}\\n\\nll mod_inverse(ll x){\\n return mod_pow(x,MOD-2);\\n}\\n\\nvoid add(ll &a,ll b){\\n a=(a+b)%MOD;\\n}\\n\\nvoid mul(ll &a,ll b){\\n a%=MOD;b%=MOD;\\n a=a*b%MOD;\\n}\\n\\n//const ll MOD=998244353; // MOD == 119*2^23+1\\n//depends on mod_pow,mod_inverse\\n\\nll root[24],invroot[24];\\n\\nvoid NTT_init(){\\n for(int i=0;i<24;++i){\\n root[i]=mod_pow(3,(MOD-1)/(1<<i));\\n invroot[i]=mod_inverse(root[i]);\\n }\\n}\\n\\nvector<ll> NTT(vector<ll> a,bool inverse=false){\\n int n=a.size();\\n int high=0;\\n for(int i=0;(1<<i)<n;++i) high++;\\n\\n for(int i=0;i<n;++i){\\n int mask=0;\\n for(int k=0;k<high;++k){\\n if(i>>k&1) mask|=(1<<(high-1-k));\\n }\\n if(i<mask) swap(a[i],a[mask]);\\n }\\n\\n for(int j=1;(1<<j)<=n;++j){\\n int m=(1<<j);\\n ll zeta=root[j];\\n if(inverse) zeta=invroot[j];\\n for(int i=0;i<n;i+=m){\\n ll powzeta=1;\\n for(int k=i;k<i+m/2;++k){\\n ll s=a[k];\\n ll t=a[k+m/2]*powzeta%MOD;\\n\\n a[k]=(s+t)%MOD;\\n a[k+m/2]=(s-t+MOD)%MOD;\\n powzeta=powzeta*zeta%MOD;\\n }\\n }\\n }\\n\\n if(inverse){\\n ll invn=mod_inverse(n);\\n for(int i=0;i<n;++i) a[i]=a[i]*invn%MOD;\\n }\\n return a;\\n}\\n\\nvector<ll> convolute(const vector<ll> &a,const vector<ll> &b){\\n int size=a.size()+b.size()-1;\\n int n=1;\\n while(n<size) n<<=1;\\n\\n vector<ll> A(n,0),B(n,0);\\n for(int i=0;i<a.size();i++) A[i]=a[i];\\n for(int i=0;i<b.size();i++) B[i]=b[i];\\n\\n A=NTT(A);\\n B=NTT(B);\\n\\n for(int i=0;i<n;++i) A[i]=A[i]*B[i]%MOD;\\n A=NTT(A,true);\\n\\n A.resize(size);\\n return A;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int N;\\n ll L;\\n cin>>N>>L;\\n vector<ll> T(N);\\n rep(i,N) cin>>T[i];\\n int M;\\n ll D;\\n cin>>M>>D;\\n vector<ll> X(M+1),P(M+1);\\n rep(i,M) cin>>X[i]>>P[i];\\n X[M]=L;\\n\\n NTT_init();\\n\\n ll inv100=mod_inverse(100);\\n vector<vector<ll>> B(M);\\n rep(i,M){\\n int diff=X[i+1]-X[i];\\n B[i].resize(diff+1,0);\\n B[i][0]=P[i]*inv100%MOD;\\n B[i][diff]=(100-P[i])*inv100%MOD;\\n }\\n\\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\\n rep(i,M) PQ.push(mkp(B[i].size(),i));\\n while(PQ.size()>1){\\n auto f=PQ.top();\\n PQ.pop();\\n auto s=PQ.top();\\n PQ.pop();\\n\\n int ft=f.second;\\n int st=s.second;\\n B[ft]=convolute(B[ft],B[st]);\\n B[st].clear();\\n\\n PQ.push(mkp(B[ft].size(),ft));\\n }\\n\\n auto f=PQ.top();PQ.pop();\\n vector<ll> dist=B[f.second];\\n vector<ll> revd=dist;\\n reverse(all(revd));\\n dist=convolute(dist,revd);\\n\\n int V=dist.size();\\n vector<ll> rsum(V+1,0);\\n for(int i=V-1;i>=0;i--) rsum[i]=rsum[i+1]+dist[i];\\n\\n ll ans=0;\\n for(int i=1;i<N;i++){\\n ll border=L*(T[0]-T[i])/(2*D);\\n if(T[0]-T[i]<0&&(L*abs(T[0]-T[i]))%(2*D)) --border;\\n ans+=rsum[min((ll)V,border+L)];\\n ans=(ans+MOD)%MOD;\\n }\\n ans=(N-ans+MOD)%MOD;\\n cout<<ans<<endl;\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 0.075,\n \"time_ms\": 460,\n \"memory_kb\": 45924,\n \"score_of_the_acc\": -0.8945,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1994,"cells":{"group_id":{"kind":"string","value":"aoj_3180_cpp"},"problem_description":{"kind":"string","value":"I GCDMST\n問題文\n$1,\\ldots,N$ の番号を振られた $N$ 個の頂点があります。\n最初、これらを繋ぐ辺はありません。\nあなたはいくつかの辺を追加してこのグラフを連結にしたいと思いました。\n頂点 $i$ と $j$ を繋ぐ辺を追加するには $A_{\\gcd(i,j)}$ のコストがかかります。\nこのグラフを連結にするように辺を追加するとき、かかるコストの和の最小値を求めてください。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$\n$A_1$ $\\cdots$ $A_N$\n制約\n入力はすべて整数である。\n$2 \\leq N \\leq 2\\times10^5$\n$1 \\leq A_i \\leq 10^9$\n出力\n答えを 1 行に出力せよ。\n入力例1\n5\n9 7 3 4 8\n出力例1\n34\n例えば $\\{1,2\\},\\{2,4\\},\\{3,4\\},\\{4,5\\}$ をつなぐ辺をはることで、コスト $34$ でグラフを連結にすることができます。\n$\\mathrm{gcd}(2,4)$ つまり $2$ と $4$ の最大公約数は $2$ なので $\\{2,4\\}$ を結ぶ辺のコストは $A_2=7$ です。\n入力例2\n10\n10 8 9 7 6 1 6 7 2 1\n出力例2\n75"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3180_9552743","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n//make -f ../makefile SRC=\n\n/*\nbrute force => RE or TLE\nfrom index or rather k(th) infers v and w\n*/\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 1000000000;\n\nconst int MAX_N = 200000;\n//static int vect[MAX_N];\n\n//------------------------------------------------------------------------------\nstruct Element\n{\n int i, v;\n\n Element(): i(-1), v(-INF) {}\n Element(int idx, int val): i(idx), v(val) {}\n bool operator<(const Element& e1) const\n {\n if (v == e1.v) return i < e1.i;\n return v < e1.v;\n }\n void debug() const { printf(\"i=%d, v=%d\\n\", i, v); }\n};\n\ntypedef vector<Element> Elements;\n//------------------------------------------------------------------------------\nclass QuickUnion\n{\n public:\n int N;\n int M; // no. of edges\n int* parent;\n int* count_; // no. of nodes rooted at n\n QuickUnion(int num): N(num), M(0)\n {\n parent = new int[N]; // 0-based nodes\n count_ = new int[N];\n for (int n=0; n<N; n++) { parent[n]=n; count_[n]=1; }\n }\n\n ~QuickUnion() { delete[] parent; delete[] count_; }\n\n int size(int n) //<--------------------\n {\n int p = root(n);\n return count_[p];\n }\n\n bool connected()\n {\n return M+1 >= N;\n }\n\n bool unite(int n1, int n2) //<---------- return true if action is successful\n {\n int r1 = root(n1);\n int r2 = root(n2);\n if (r1==r2) return false;\n M++; //<---------- for checking whether all are connected\n\n if (count_[r1] < count_[r2]) { parent[r1] = r2; count_[r2] += count_[r1]; }\n else { parent[r2] = r1; count_[r1] += count_[r2]; }\n return true;\n }\n\n bool find(int n1, int n2)\n {\n return root(n1)==root(n2);\n }\n\n int root(int node)\n {\n int n = node;\n while (n != parent[n])\n {\n parent[n] = parent[parent[n]]; // vs compression\n n = parent[n];\n }\n parent[node] = n;\n return n;\n }\n\n void debug() const\n {\n for (int n=0; n<N; n++) printf(\"node=%d, root=%d\\n\", n, parent[n]);\n printf(\"\\n\");\n }\n};\n\n//------------------------------------------------------------------------------\nint64_t kruskal(int N, Elements& E)\n{\n int64_t res = 0;\n QuickUnion QU(N);\n sort(E.begin(), E.end());\n for (Element e: E)\n {\n if (QU.connected()) break;\n for (int k=1; (e.i+1)*k-1<N; ++k)\n {\n if (QU.unite(e.i, (e.i+1)*k-1))\n {\n res += e.v;\n }\n }\n }\n return res;\n}\n\n\n//------------------------------------------------------------------------------\nvoid test()\n{\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //DEBUG = true;\n //test(); return 0;\n //--------------------------------------------------------------------------\n int N, K, L, R, v, num;\n num = scanf(\"%d \", &N);\n Elements E(N);\n for (int n=0; n<N; ++n)\n {\n num = scanf(\"%d \", &v);\n E[n] = Element(n, v);\n }\n int64_t res = kruskal(N, E);\n printf(\"%ld\\n\", res);\n return 0;\n}\n\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":30,"memory_kb":6276,"score_of_the_acc":-0.0448,"final_rank":6},{"submission_id":"aoj_3180_9488088","code_snippet":"// competitive-verifier: PROBLEM\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\n/**\n * @brief 素集合データ構造\n * @details Implement (union by size) + (path compression)\n * @see https://github.com/atcoder/ac-library/blob/master/atcoder/dsu.hpp\n */\nstruct union_find {\n union_find() = default;\n explicit union_find(int _n) : _rank(_n), data(_n, -1) {}\n const int &operator[](std::size_t x) const { return data[x]; }\n int &operator[](std::size_t x) { return data[x]; }\n int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }\n int get_root(int x) { return root(x); }\n bool is_root(int x) const { return data[x] < 0; }\n bool same(int x, int y) { return root(x) == root(y); }\n bool is_same(int x, int y) { return same(x, y); }\n int rank() { return _rank; }\n int size(int x) { return -(data[root(x)]); }\n int get_size(int x) { return size(x); }\n std::vector<int> leaders() {\n std::vector<int> res;\n for (int i = 0; i < (int)data.size(); ++i) {\n if (is_root(i)) res.emplace_back(i);\n }\n return res;\n }\n bool unite(int x, int y) {\n x = root(x), y = root(y);\n if (x == y) return false;\n --_rank;\n if (data[x] > data[y]) std::swap(x, y);\n data[x] += data[y];\n data[y] = x;\n return true;\n }\n template <class F>\n bool unite(int x, int y, F f) {\n x = root(x), y = root(y);\n if (x != y) {\n if (data[x] > data[y]) std::swap(x, y);\n data[x] += data[y];\n data[y] = x;\n }\n f(x, y);\n return x != y;\n }\n private:\n int _rank;\n std::vector<int> data;\n};\nint main(void) {\n int n;\n cin >> n;\n vector<ll> a(n);\n cin >> a;\n vector<pair<ll, ll>> b(n);\n rep (i, n) b[i] = {a[i], i + 1};\n sort(all(b));\n union_find uf(n);\n ll ans = 0;\n for (auto [x, y] : b) {\n ll p = y - 1;\n while (p + y < n) {\n if (uf.unite(p, p + y))\n ans += x;\n p += y;\n }\n }\n co(ans);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":8888,"score_of_the_acc":-0.0334,"final_rank":3},{"submission_id":"aoj_3180_8514126","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3180.cc: GCDMST\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<utility>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 200000;\n\n/* typedef */\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\n\nstruct UFT {\n vector<int> links, ranks, sizes;\n UFT() {}\n\n void init(int n) {\n links.resize(n);\n for (int i = 0; i < n; i++) links[i] = i;\n ranks.assign(n, 1);\n sizes.assign(n, 1);\n }\n\n int root(int i) {\n int i0 = i;\n while (links[i0] != i0) i0 = links[i0];\n return (links[i] = i0);\n }\n\n int rank(int i) { return ranks[root(i)]; }\n int size(int i) { return sizes[root(i)]; }\n bool same(int i, int j) { return root(i) == root(j); }\n\n int merge(int i0, int i1) {\n int r0 = root(i0), r1 = root(i1), mr;\n if (r0 == r1) return r0;\n if (ranks[r0] == ranks[r1]) {\n links[r1] = r0;\n sizes[r0] += sizes[r1];\n ranks[r0]++;\n mr = r0;\n }\n else if (ranks[r0] > ranks[r1]) {\n links[r1] = r0;\n sizes[r0] += sizes[r1];\n mr = r0;\n }\n else {\n links[r0] = r1;\n sizes[r1] += sizes[r0];\n mr = r1;\n }\n return mr;\n }\n};\n\n/* global variables */\n\nint as[MAX_N + 1];\npii ps[MAX_N];\nUFT uft;\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n for (int i = 1; i <= n; i++) scanf(\"%d\", as + i);\n\n int hn = n / 2;\n for (int i = 1; i <= hn; i++) ps[i - 1] = pii(as[i], i);\n sort(ps, ps + hn);\n\n uft.init(n + 1);\n ll sum = 0;\n\n for (int i = 0; i < hn; i++) {\n int aj = ps[i].first, j = ps[i].second;\n\n for (int k = j * 2; k <= n; k += j) {\n if (! uft.same(j, k)) {\n\tuft.merge(j, k);\n\tsum += aj;\n }\n }\n }\n\n printf(\"%lld\\n\", sum);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":6512,"score_of_the_acc":-0.0101,"final_rank":2},{"submission_id":"aoj_3180_8002441","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N;\n cin>>N;\n vector<pair<ll,ll>> P(N);\n rep(i,N){\n cin>>P[i].first;\n P[i].second=i+1;\n }\n sort(all(P));\n vll L(N+1,0);\n vvll D(N+1);\n rep(i,N){\n L[i+1]=i+1;\n D[i+1].push_back(i+1);\n }\n ll an=0;\n rep(i,N){\n ll a=P[i].first;\n ll b=P[i].second;\n for(ll j=b*2;j<=N;j+=b){\n if(L[j]==L[b])continue;\n //cout<<j<<\" \"<<b<<endl;\n an+=a;\n if(D[L[j]].size()<D[L[b]].size()){\n for(auto d:D[L[j]]){\n L[d]=L[b];\n D[L[b]].push_back(d);\n }\n }\n else{\n for(auto d:D[L[b]]){\n L[d]=L[j];\n D[L[j]].push_back(d);\n }\n }\n }\n }\n cout<<an<<endl;\n}","accuracy":1,"time_ms":40,"memory_kb":24076,"score_of_the_acc":-0.2562,"final_rank":16},{"submission_id":"aoj_3180_7011359","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3180.cc: GCDMST\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<utility>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 200000;\n\n/* typedef */\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\n\nstruct UFT {\n vector<int> links, ranks, sizes;\n UFT() {}\n\n void init(int n) {\n links.resize(n);\n for (int i = 0; i < n; i++) links[i] = i;\n ranks.assign(n, 1);\n sizes.assign(n, 1);\n }\n\n int root(int i) {\n int i0 = i;\n while (links[i0] != i0) i0 = links[i0];\n return (links[i] = i0);\n }\n\n int rank(int i) { return ranks[root(i)]; }\n int size(int i) { return sizes[root(i)]; }\n bool same(int i, int j) { return root(i) == root(j); }\n\n int merge(int i0, int i1) {\n int r0 = root(i0), r1 = root(i1), mr;\n if (r0 == r1) return r0;\n if (ranks[r0] == ranks[r1]) {\n links[r1] = r0;\n sizes[r0] += sizes[r1];\n ranks[r0]++;\n mr = r0;\n }\n else if (ranks[r0] > ranks[r1]) {\n links[r1] = r0;\n sizes[r0] += sizes[r1];\n mr = r0;\n }\n else {\n links[r0] = r1;\n sizes[r1] += sizes[r0];\n mr = r1;\n }\n return mr;\n }\n};\n\n/* global variables */\n\nint as[MAX_N + 1];\npii ps[MAX_N];\nUFT uft;\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n for (int i = 1; i <= n; i++) scanf(\"%d\", as + i);\n\n int hn = n / 2;\n for (int i = 1; i <= hn; i++) ps[i - 1] = pii(as[i], i);\n sort(ps, ps + hn);\n\n uft.init(n + 1);\n ll sum = 0;\n\n for (int i = 0; i < hn; i++) {\n int aj = ps[i].first, j = ps[i].second;\n\n for (int k = 2; k * j <= n; k++) {\n int u = (k - 1) * j, v = k * j;\n if (! uft.same(u, v)) {\n\tuft.merge(u, v);\n\tsum += aj;\n }\n }\n }\n\n printf(\"%lld\\n\", sum);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":6492,"score_of_the_acc":-0.0099,"final_rank":1},{"submission_id":"aoj_3180_6740047","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <queue>\n#include <array>\n#include <algorithm>\n#include <numeric>\n#include <unordered_map>\n#include <unordered_set>\n#include <map>\n#include <set>\n#include <cassert>\n#include <iterator>\n#include <random>\n#include <stack>\n#include <climits>\n#include <chrono>\n#include <iomanip>\n\n\nint gcd(const int a, const int b) {\n\treturn (b == 0) ? a : gcd(b, a % b);\n}\nclass UnionFind {\n\tstd::vector<int> vec;\npublic:\n\tUnionFind(const int size) : vec(size, -1) {};\n\tint find(const int a) {\n\t\treturn vec[a] < 0 ? a : vec[a] = find(vec[a]);\n\t}\n\tbool same(const int a, const int b) {\n\t\treturn find(a) == find(b);\n\t}\n\tvoid unite(int a, int b) {\n\t\ta = find(a);\n\t\tb = find(b);\n\t\tif (a == b) return;\n\t\tif (vec[a] > vec[b]) std::swap(a, b);\n\t\tvec[a] += vec[b];\n\t\tvec[b] = a;\n\t}\n};\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<int> cost(n);\n\tfor (auto& a : cost) {\n\t\tstd::cin >> a;\n\t}\n\tstd::vector<int> order_by_cost(n); std::iota(order_by_cost.begin(), order_by_cost.end(), 0);\n\tstd::sort(order_by_cost.begin(), order_by_cost.end(), [&](const auto i, const auto j) {return cost[i] < cost[j]; });\n\tlong long int result{ 0 };\n\tUnionFind uft(n);\n\tfor (const auto g : order_by_cost) {\n\t\tfor (auto i = g; i + g + 1 < n; i += g + 1) {\n\t\t\tif (uft.same(i, i + g + 1)) continue;\n\t\t\tuft.unite(i, i + g + 1);\n\t\t\tresult += cost[g];\n\t\t}\n\t}\n\tstd::cout << result << '\\n';\n}","accuracy":1,"time_ms":60,"memory_kb":5480,"score_of_the_acc":-0.1481,"final_rank":14},{"submission_id":"aoj_3180_6452177","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline ll time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nstruct UnionFind{\n vector<int> par,num;\n UnionFind(int n):par(n),num(n,1){\n iota(par.begin(),par.end(),0); //include<numeric>\n }\n int find(int v){\n return (par[v]==v)?v:(par[v]=find(par[v]));\n }\n void unite(int u,int v){\n u=find(u),v=find(v);\n if(u==v)return;\n if(num[u]<num[v])swap(u,v);\n num[u]+=num[v];\n par[v]=u;\n }\n bool same(int u,int v){\n return find(u) == find(v);\n }\n int size(int v){\n return num[find(v)];\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n; cin >> n;\n UnionFind uf(n+1);\n vector<pair<int,int>> v(n);\n for(int i=0;i<n;i++){\n cin >> v[i].first;\n v[i].second = i+1;\n }\n sort(v.begin(), v.end());\n ll res = 0;\n for(auto p:v){\n int i = p.second;\n for(int j=i+i;j<=n;j+=i){\n if(!uf.same(i,j)){\n uf.unite(i, j);\n res += p.first;\n }\n }\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":6280,"score_of_the_acc":-0.0449,"final_rank":7},{"submission_id":"aoj_3180_4918600","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nstruct Info{\n\tInfo(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tindex = arg_index;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\n\t\treturn value < arg.value;\n\t}\n\tll value,index;\n};\n\nint N;\nint boss[SIZE],height[SIZE];\nvector<Info> info;\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\nint main(){\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 1; i <= N; i++){\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t}\n\n\tll tmp;\n\n\tfor(int i = 1; i <= N; i++){\n\n\t\tscanf(\"%lld\",&tmp);\n\t\tinfo.push_back(Info(tmp,i));\n\t}\n\tsort(info.begin(),info.end());\n\n\tll ans = 0;\n\tfor(int i = 0; i < info.size(); i++){\n\n\t\tfor(ll k = 2*(info[i].index); k <= N; k += info[i].index){\n\t\t\tif(isSame(info[i].index,k))continue;\n\n\t\t\tunite(info[i].index,k);\n\n\t\t\tans += info[i].value;\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":8552,"score_of_the_acc":-0.1042,"final_rank":12},{"submission_id":"aoj_3180_4894815","code_snippet":"#ifdef ONLINE_JUDGE\n#pragma GCC target(\"avx2,avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing pii = pair<int, int>;\nusing pll = pair<long long, long long>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\n#define all(x) (x).begin(),(x).end()\nconstexpr char ln = '\\n';\nistream& operator>>(istream& is, __int128_t &x) {\n x = 0;\n string s;\n is >> s;\n int n = int(s.size()), it = 0;\n if (s[0] == '-') it++;\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\n if (s[0] == '-') x = -x;\n return is;\n}\nostream& operator<<(ostream& os, __int128_t x) {\n if (x == 0) return os << 0;\n if (x < 0) os << '-', x = -x;\n deque<int> deq;\n while (x) deq.emplace_front(x % 10), x /= 10;\n for (int e : deq) os << e;\n return os;\n}\ntemplate<class T1, class T2>\nostream& operator<<(ostream& os, const pair<T1, T2>& p) {\n return os << \"(\" << p.first << \", \" << p.second << \")\";\n}\ntemplate<class T> \nostream& operator<<(ostream& os, const vector<T>& v) {\n os << \"[\";\n for(auto e : v) os << e << \", \";\n return os << \"]\";\n}\ntemplate<class Container> inline int SZ(Container& v) {return int(v.size());}\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\ninline int topbit(int x) {return x == 0 ? -1 : 31 - __builtin_clz(x);}\ninline int topbit(long long x) {return x == 0 ? -1 : 63 - __builtin_clzll(x);}\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\ninline int popcount(int x) {return __builtin_popcount(x);}\ninline int popcount(long long x) {return __builtin_popcountll(x);}\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\ninline constexpr long long TEN(int x) {return x == 0 ? 1 : TEN(x-1) * 10;}\nnamespace detail {\n template<typename Tp, int Nb>\n auto make_vector(vector<int>& sizes, Tp const& x) {\n if constexpr (Nb == 1) {\n return vector(sizes[0], x);\n } else {\n int size = sizes[Nb-1];\n sizes.pop_back();\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\n }\n }\n}\ntemplate<typename Tp, int Nb>\nauto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {\n vector<int> s(Nb);\n for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];\n return detail::make_vector<Tp, Nb>(s, x);\n}\ninline void print() {cout << \"\\n\";}\ntemplate<class T>\ninline void print(const vector<T>& v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \" \";\n print();\n}\ntemplate<class T, class... Args>\ninline void print(const T &x, const Args &... args) {\n cout << x << \" \";\n print(args...);\n}\n#ifdef MINATO_LOCAL\n#define dump(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\ninline void debug() {cerr << endl;}\ntemplate<class T>\ninline void debug(const vector<T> &v) {\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \" \";\n debug();\n}\ntemplate<class T, class... Args>\ninline void debug(const T &x, const Args &... args) {\n cerr << x << \" \";\n debug(args...);\n}\n#else\n#define dump(x) void(0)\ninline void debug() {}\ntemplate<class T> inline void debug(const vector<T> &v) {}\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\n#endif\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\nstruct UnionFind {\n int N;\n vector<int> node;\n\n UnionFind(){}\n UnionFind(int N) : N(N), node(N,-1) {}\n\n void init(int x) {\n node.assign(x,-1);\n N = x;\n }\n\n bool merge(int x, int y) {\n x = root(x); y = root(y);\n if (x == y) return false;\n if (node[x] > node[y]) swap(x,y);\n node[x] += node[y];\n node[y] = x;\n N--;\n return true; \n }\n\n bool same(int x, int y) {return root(x) == root(y);}\n\n int root(int x) {\n if (node[x] < 0) return x;\n return node[x] = root(node[x]);\n }\n\n int size(int x) {return -node[root(x)];}\n\n int count() const {return N;}\n};\n\nint main() {\n int N; cin >> N;\n vector<ll> A(N+1,1e18);\n rep(i,N) cin >> A[i+1];\n\n vector<int> idx(N+1);\n iota(all(idx),0);\n sort(all(idx),[&](int i, int j){return A[i] < A[j];});\n UnionFind uf(N+1);\n ll ans = 0;\n rep(i,N) {\n int u = idx[i];\n for (int j = 2*u; j <= N; j += u) {\n if (uf.merge(j,j-u)) {\n ans += A[u];\n }\n }\n }\n\n cout << ans << ln;\n}","accuracy":1,"time_ms":30,"memory_kb":6248,"score_of_the_acc":-0.0446,"final_rank":5},{"submission_id":"aoj_3180_4879538","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)\n#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)\n#define REP(i, n) rep(i, 0, n)\n#define REP2(i, n) rep2(i, 0, n)\n#define all(hoge) (hoge).begin(), (hoge).end()\n#define en '\\n'\nusing ll = long long;\nusing ull = unsigned long long;\ntemplate <class T>\nusing vec = vector<T>;\ntemplate <class T>\nusing vvec = vector<vec<T>>;\ntypedef pair<ll, ll> P;\nusing tp = tuple<ll, ll, ll>;\nconstexpr long long INF = 1LL << 60;\nconstexpr int INF_INT = 1 << 25;\n//constexpr long long MOD = (ll)1e9 + 7;\nconstexpr long long MOD = 998244353LL;\nusing ld = long double;\nstatic const ld pi = 3.141592653589793L;\ntypedef vector<ll> Array;\ntypedef vector<Array> Matrix;\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//グラフ関連\nstruct Edge {\n ll to, cap, rev;\n Edge(ll _to, ll _cap, ll _rev) {\n to = _to;\n cap = _cap;\n rev = _rev;\n }\n};\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {\n G[from].push_back(Edge(to, cap, (ll)G[to].size()));\n if(revFlag)\n G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\n}\n\nclass UnionFind {\n vector<int> data;\n int num;\n\n public:\n UnionFind(int size) : data(size, -1), num(size) {}\n bool unionSet(int x, int y) {\n x = root(x);\n y = root(y);\n if(x != y) {\n if(data[y] < data[x])\n swap(x, y);\n data[x] += data[y];\n data[y] = x;\n num--;\n }\n return x != y;\n }\n bool findSet(int x, int y) {\n return root(x) == root(y);\n }\n int root(int x) {\n return data[x] < 0 ? x : data[x] = root(data[x]);\n }\n int size(int x) {\n return -data[root(x)];\n }\n int numSet() {\n return num;\n }\n};\n\nvoid solve() {\n ll n;\n cin >> n;\n vec<P> a(n);\n\n REP(i, n) {\n cin >> a[i].first;\n a[i].second = i + 1;\n }\n sort(all(a));\n\n UnionFind uni(n + 1);\n ll ans = 0;\n REP(i, n) {\n auto [cost, k] = a[i];\n for(int j = 2; j * k <= n; j++) {\n if(uni.unionSet(k, j * k)) {\n ans += cost;\n }\n }\n }\n cout << ans << en;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n /*\n ll t;\n cin >> t;\n while(t--)*/\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":7032,"score_of_the_acc":-0.0522,"final_rank":9},{"submission_id":"aoj_3180_4878957","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n//BEGIN CUT HERE\nstruct UnionFind{\n int num;//連結成分の数\n vector<int> r,p;//そのグループのサイズ,自分の親っぽいやつ\n UnionFind(){}\n UnionFind(int n):num(n),r(n,1),p(n,0){iota(p.begin(),p.end(),0);}\n\n int find(int x){//どのグループに所属するか\n return (x==p[x]?x:p[x]=find(p[x]));//xがグループの名前と一致するまでxを親にする\n }\n\n bool same(int x,int y){//同じグループかどうか\n return find(x)==find(y);\n }\n\n void unite(int x,int y){//xとyを同じグループにする\n x=find(x);y=find(y);//xとyのグループの名前をどっちかが変える\n if(x==y) return;\n if(r[x]<r[y]) swap(x,y);//サイズが大きい方をxとする\n r[x]+=r[y];//yの親をxにする（今までyだったグループ名がxになる）\n p[y]=x;\n num--;\n }\n\n int size(int x){//グループの大きさ\n return r[find(x)];\n }\n\n int count() const{//グループの数\n return num;\n }\n};\n //END CUT HERE\ntypedef pair<int,int> P;\n\nsigned main(){\n int n;cin>>n;\n vector<P> v(n);\n UnionFind uf(n);\n for(int i=0;i<n;i++){\n int a;cin>>a;v[i]=P(a,i+1);\n }\n int ans=0;\n sort(v.begin(),v.end());\n for(int i=0;i<n;i++){\n int p=v[i].second;\n for(int j=2*p;j<=n;j+=p){\n if(uf.same(p-1,j-1))continue;\n uf.unite(p-1,j-1);\n ans+=v[i].first;\n }\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":70,"memory_kb":9168,"score_of_the_acc":-0.2213,"final_rank":15},{"submission_id":"aoj_3180_4875834","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=Int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\n\nstruct UnionFind{\n Int num;\n vector<Int> rs,ps;\n UnionFind(){}\n UnionFind(Int n):num(n),rs(n,1),ps(n,0){iota(ps.begin(),ps.end(),0);}\n Int find(Int x){\n return (x==ps[x]?x:ps[x]=find(ps[x]));\n }\n bool same(Int x,Int y){\n return find(x)==find(y);\n }\n void unite(Int x,Int y){\n x=find(x);y=find(y);\n if(x==y) return;\n if(rs[x]<rs[y]) swap(x,y);\n rs[x]+=rs[y];\n ps[y]=x;\n num--;\n }\n Int size(Int x){\n return rs[find(x)];\n }\n Int count() const{\n return num;\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n Int n;\n cin>>n;\n\n auto as=read(n);\n as.emplace(as.begin(),0);\n using P = pair<Int, Int>;\n vector<P> vp;\n for(Int i=1;i<=n;i++)\n vp.emplace_back(as[i],i);\n\n sort(vp.begin(),vp.end());\n\n UnionFind uf(n+1);\n\n Int ans=0;\n for(auto[c,i]:vp){\n set<Int> ss;\n for(Int j=i;j<=n;j+=i)\n ss.emplace(uf.find(j));\n ans+=c*(ss.size()-1);\n for(Int j=i;j<=n;j+=i)\n uf.unite(i,j);\n }\n cout<<ans<<newl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":20668,"score_of_the_acc":-0.371,"final_rank":18},{"submission_id":"aoj_3180_4868336","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T> inline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T> inline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\n#define DEBUG\n#ifdef DEBUG\nvoid debug_out() { cerr << endl; }\ntemplate <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {\n cerr << \" \" << H;\n debug_out(T...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debug_out(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\nstruct Setup {\n Setup() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n }\n} __Setup;\n\nusing ll = long long;\n#define ALL(v) (v).begin(), (v).end()\n#define RALL(v) (v).rbegin(), (v).rend()\nconst double EPS = 1e-7;\nconst int INF = 1 << 30;\nconst ll LLINF = 1LL << 60;\nconstexpr int MOD = 1000000007;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\n//-------------------------------------\n\nstruct UnionFind {\n vector<int> par;\n\n UnionFind(int n) : par(n, -1) {}\n void init(int n) { par.assign(n, -1); }\n\n int root(int x) {\n if(par[x] < 0)\n return x;\n else\n return par[x] = root(par[x]);\n }\n\n bool issame(int x, int y) { return root(x) == root(y); }\n\n bool merge(int x, int y) {\n x = root(x);\n y = root(y);\n if(x == y)\n return false;\n if(par[x] > par[y])\n swap(x, y); // merge technique\n par[x] += par[y];\n par[y] = x;\n return true;\n }\n\n int size(int x) { return -par[root(x)]; }\n};\n\nstruct edge {\n int from, to;\n ll cost;\n edge() = default;\n edge(int from, int to, ll cost) : from(from), to(to), cost(cost) {}\n};\n\nint main() {\n int n;\n cin >> n;\n vector<ll> a(n);\n for(auto &i : a) {\n cin >> i;\n }\n\n vector<edge> edges;\n for(int i = 1; i <= n; i++) {\n for(int j = 2 * i; j <= n; j += i) {\n edges.emplace_back(edge(i - 1, j - 1, a[i - 1]));\n }\n }\n\n sort(ALL(edges),\n [](const edge &l, const edge &r) { return (l.cost < r.cost); });\n UnionFind uf(n);\n\n ll ans = 0;\n for(auto e : edges) {\n if(!uf.issame(e.from, e.to)) {\n uf.merge(e.from, e.to);\n ans += e.cost;\n }\n }\n\n cout << ans << \"\\n\";\n}","accuracy":1,"time_ms":80,"memory_kb":72280,"score_of_the_acc":-0.8765,"final_rank":19},{"submission_id":"aoj_3180_4863532","code_snippet":"#include <bits/stdc++.h>\n//#include <chrono>\n//#pragma GCC optimize(\"Ofast\")\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\n#define Rrep(i,n) Rreps(i,n,0)\n#define ALL(a) a.begin(), a.end()\n#define fi first\n#define se second\n\nusing ll = long long;\nusing vec = vector<ll>;\nusing mat = vector<vec>;\n\nll N,M,H,W,Q,K,A,B;\nstring S;\ntypedef pair<ll, ll> P;\nconst ll INF = (1LL<<60);\n\nint main() {\n class union_find {\n vector<long> parent, tree_size;\n public:\n union_find(unsigned long _n) : parent(_n), tree_size(_n, 1) {\n for (unsigned long i = 0; i < _n; ++i) parent[i] = i;\n }\n\n ll find(ll x) {\n while (parent[x] != x)x = parent[x] = parent[parent[x]];\n return x;\n }\n\n void merge(ll a, ll b) {\n a = find(a);\n b = find(b);\n if (a == b) return;\n if (tree_size[a] < tree_size[b])swap(a, b);\n tree_size[a] += tree_size[b];\n parent[b] = a;\n }\n\n bool same(ll a, ll b) {\n a = find(a);\n b = find(b);\n return a == b;\n }\n };\n cin>>N;\n vec a(N + 1, INF), ord(N + 1);\n rep(i, N) cin>>a[i + 1];\n iota(ALL(ord), 0);\n sort(ALL(ord), [&](int x, int y){\n return a[x] < a[y];\n });\n union_find uf(N + 1);\n ll res(0);\n rep(i, N){\n int id = ord[i];\n for(int j = id * 2; j <= N; j += id){\n if(!uf.same(id, j)){\n res += a[id];\n uf.merge(j, id);\n }\n }\n }\n cout<<res<<endl;\n}","accuracy":1,"time_ms":80,"memory_kb":9232,"score_of_the_acc":-0.259,"final_rank":17},{"submission_id":"aoj_3180_4849658","code_snippet":"// #define _GLIBCXX_DEBUG // for STL debug (optional)\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\nusing namespace std;\nusing ll = long long int;\nusing int64 = long long int;\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst int INF = 1LL << 29;\nconst ll LONGINF = 1LL << 60;\nconst ll MOD = 1000000007LL;\n\n/**\n * @brief Union-Find\n * @docs ./docs/union_find.md\n */\n\n#include <algorithm>\n#include <vector>\n\nstruct UnionFind {\nprivate:\n const int n;\n int size_;\n vector<int> uf;\npublic:\n // 初期化 UnionFind uni(n) のように宣言すれば良い\n UnionFind(int _n) : n(_n), size_(_n), uf(_n, -1) {}\n // find (木の根を求める)\n int find(int x) {return (uf[x] < 0) ? x : uf[x] = find(uf[x]);}\n // x と y が同じ集合に属するかどうか\n bool same(int x, int y) {return find(x) == find(y);}\n // x が属する集合の要素数\n int size(int x) {return -uf[find(x)];}\n // 集合はいくつあるか\n int size() {return size_;}\n // x と y の属する集合を併合\n bool unite(int x, int y) {\n x = find(x); y = find(y);\n if(x == y) return false;\n size_--;\n if(-uf[x] < -uf[y]) swap(x, y);\n uf[x] += uf[y]; uf[y] = x;\n return true;\n }\n};\n\nint main() {\n int N; scanf(\"%d\", &N);\n vector<int> A(N), ord(N);\n for(int i=0; i<N; i++) {\n scanf(\"%d\", &A[i]);\n ord[i] = i;\n }\n sort(ord.begin(), ord.end(), [&](auto x, auto y) {\n return A[x] < A[y];\n });\n\n ll ans = 0;\n UnionFind uf(N);\n for(int i=0; i<N; i++) {\n int v = A[ ord[i] ], k = ord[i];\n for(int j=k; j<N; j+=k+1) {\n if(!uf.same(k, j)) {\n uf.unite(k, j);\n ans += v;\n }\n }\n }\n printf(\"%lld\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":5504,"score_of_the_acc":-0.0373,"final_rank":4},{"submission_id":"aoj_3180_4849246","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n\nstruct UnionFind {\n std::vector<int> par, sz;\n int gnum;\n\n explicit UnionFind(int n)\n : par(n), sz(n, 1), gnum(n) {\n std::iota(par.begin(), par.end(), 0);\n }\n\n int find(int v) {\n return (par[v] == v) ? v : (par[v] = find(par[v]));\n }\n\n void unite(int u, int v) {\n u = find(u), v = find(v);\n if (u == v) return;\n\n if (sz[u] < sz[v]) std::swap(u, v);\n sz[u] += sz[v];\n par[v] = u;\n --gnum;\n }\n\n bool same(int u, int v) { return find(u) == find(v); }\n bool ispar(int v) { return v == find(v); }\n int size(int v) { return sz[find(v)]; }\n};\n\nusing lint = long long;\n\nvoid solve() {\n int n;\n std::cin >> n;\n\n std::vector<std::pair<lint, int>> ps(n);\n for (int i = 0; i < n; ++i) {\n auto& [x, j] = ps[i];\n std::cin >> x;\n j = i + 1;\n }\n std::sort(ps.begin(), ps.end());\n\n UnionFind uf(n + 1);\n lint ans = 0;\n for (auto [x, g] : ps) {\n for (int i = g * 2; i <= n; i += g) {\n if (uf.same(g, i)) continue;\n uf.unite(g, i);\n ans += x;\n }\n }\n\n std::cout << ans << \"\\n\";\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":7824,"score_of_the_acc":-0.06,"final_rank":11},{"submission_id":"aoj_3180_4849167","code_snippet":"// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region aliases\n\n#define rep(i, n) for(long long i = 0; i < (n); i++)\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bcnt(n) __builtin_popcountll(n)\n#define endk endl\n#define ednl endl\n#define enld endl\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vb = vector<bool>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing mll = map<long long, long long>;\nusing pll = pair<long long, long long>;\nusing qll = queue<long long>;\nusing sll = set<long long>;\nusing vpll = vector<pair<long long, long long>>;\ntemplate <class T = ll>\nusing V = vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\n//昇順pq(小さい方から取り出す)\ntemplate <class T = ll>\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\n//降順pq(大きい方から取り出す)\ntemplate <class T = ll>\nusing pqdn = priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\nlong long const dekai = 3e16;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\n\nconst int mod = 1000000007;\n// const int mod = 998244353;\n\n#pragma endregion\n\n#pragma region basic_procedure\n\ntemplate <class T>\ninline bool isin(T x, T lef, T rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { cout << (f ? \"Yes\" : \"No\") << \"\\n\"; }\nvoid No() { cout << \"No\\n\"; }\nvoid YES(bool f = 1) { cout << (f ? \"YES\" : \"NO\") << \"\\n\"; }\nvoid NO() { cout << \"NO\\n\"; }\ntemplate <class T>\nvoid drop(T answer) {\n\tcout << answer << \"\\n\";\n\texit(0);\n}\nvoid err() {\n\tcout << -1 << \"\\n\";\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(vector<T> &v, bool tate = 0) {\n\tif(v.size() > 0) {\n\t\tfor(auto it = v.begin(); it < v.end(); it++) {\n\t\t\tcout << *it;\n\t\t\tif(it != v.end() - 1) {\n\t\t\t\tif(tate)\n\t\t\t\t\tcout << endl;\n\t\t\t\telse\n\t\t\t\t\tcout << \" \";\n\t\t\t}\n\t\t}\n\t}\n\tcout << endl;\n}\n\ntemplate <class T>\nvoid add(vector<T> &v, T val) {\t //ベクトルの各要素に加算\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\n// vectorの中身を数える map<要素,個数>を返す\ntemplate <class T>\nmap<T, long long> cntv(vector<T> v) {\n\tmap<T, long long> m;\n\tfor(auto &g : v) {\n\t\tif(m.count(g))\n\t\t\tm[g]++;\n\t\telse\n\t\t\tm[g] = 1;\n\t}\n\treturn m;\n}\n\n//配列圧縮\n//{1,36,1,3,8,-2,-92}を\n//{2, 5,2,3,4, 1, 0}にする\ntemplate <class T>\nvector<long long> press(vector<T> &v) {\n\tlong long n = v.size();\n\tvector<long long> w(n);\n\tmap<T, long long> m;\n\tfor(T &p : v) m[p] = 0;\n\tlong long i = 0;\n\tfor(auto &p : m) {\n\t\tp.second = i;\n\t\ti++;\n\t}\n\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\n\treturn w;\n}\n\n// 切り上げ除算\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\tT x = abs(a);\n\tT y = abs(b);\n\tT z = (x + y - 1) / y;\n\tif((a < 0 && b > 0) || (a > 0 && b < 0))\n\t\treturn -z;\n\telse if(a == 0)\n\t\treturn 0;\n\telse\n\t\treturn z;\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\n// a * x % mod == __gcd(a,mod)なるxを返す\n// a が modの倍数でないことが条件\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tswap(a, b);\n\t\tu -= t * v;\n\t\tswap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\nvector<vector<long long>> comb(100, vector<long long>(100, -1));\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\n\tassert(n < 100 && k < 100);\n\tif(n < k || k < 0 || n < 0) return 0;\n\tif(comb[n][k] != -1) return comb[n][k];\n\tll res;\n\tif(n - k < k)\n\t\tres = com(n, n - k);\n\telse if(k == 0)\n\t\tres = 1;\n\telse\n\t\tres = com(n - 1, k - 1) + com(n - 1, k);\n\tcomb[n][k] = res;\n\treturn res;\n}\n\n// nCk modを求める\nconst int MAX = 5100000;\n// この値は求める二項計数の値に応じて変える\n// MAX=3*10^7のとき1900msほど、ほぼ比例\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid cominit() {\n\t// テーブルを作る前処理\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor(int i = 2; i < MAX; i++) {\n\t\tfac[i] = fac[i - 1] * i % mod;\n\t\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\n\t\tfinv[i] = finv[i - 1] * inv[i] % mod;\n\t}\n}\nlong long commod(long long n, long long k) { // 二項係数\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\nlong long pmod(long long n, long long k) {\t// 順列\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * finv[n - k] % mod;\n}\n// n個の区別しないボールを区別するk個の箱に入れる方法の総数\nlong long hmod(long long n, long long k) {\t// 重複組み合わせ\n\treturn commod(n + k - 1, n);\n}\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tINPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tINPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n\ntemplate <class T>\nvoid scan(T &a) {\n\tcin >> a;\n}\ntemplate <class T>\nvoid scan(vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\ntemplate <class T, class L>\nvoid scan(pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\ntemplate <class T>\ninline void print(T x) {\n\tcout << x << '\\n';\n}\n\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tcerr << \", \";\n\tview(p.second);\n\tcerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(std::set<T> &s) {\n\tif(s.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tcerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tcerr << \", \";\n\t\tview(c.second);\n\t\tcerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tcerr << \"] : \";\n\t\tview(t.second);\n\t\tcerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tview(H);\n\tcerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tcerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tview(x); \\\n\t\tcerr << \"\\n\"; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\nstruct UF {\t\t\t // Union_Find木 (平衡操作あり)\n\tvector<int> data; // data[root] = -size, data[not_root] = parent\n\tUF(int N) : data(N) {\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tdata[i] = -1;\n\t\t}\n\t}\n\tint root(int x) {\n\t\tif(data[x] < 0) return x;\n\t\treturn data[x] = root(data[x]);\n\t}\n\t// 2つのデータx, yが属する木が同じならtrueを返す\n\tbool same(int x, int y) { return root(x) == root(y); }\n\tbool unite(int x, int y) {\t// xとyの木を併合\n\t\tx = root(x);\n\t\ty = root(y);\n\t\tif(x == y) return false;\n\t\tif(data[x] > data[y]) swap(x, y); // 平衡操作 sizeは-1倍なのでこれで正しい\n\t\tdata[x] += data[y];\n\t\tdata[y] = x;\n\t\treturn true;\n\t}\n\tint size(int x) { return -data[root(x)]; }\n};\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tINT(n);\n\tVEC(ll, a, n);\n\n\tpqup<pll> q;\n\trep(i, n) { q.push({a[i], i + 1}); }\n\n\tUF uf(n);\n\tll ans = 0;\n\n\twhile(!q.empty()) {\n\t\tll sa, cost;\n\t\ttie(cost, sa) = q.top();\n\t\tq.pop();\n\t\tll b = sa - 1;\n\t\tll c = sa + sa - 1;\n\t\twhile(c < n) {\n\t\t\tif(uf.unite(b, c)) {\n\t\t\t\tans += cost;\n\t\t\t}\n\t\t\tc += sa;\n\t\t}\n\t}\n\tdrop(ans);\n\t;\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":10572,"score_of_the_acc":-0.1239,"final_rank":13},{"submission_id":"aoj_3180_4848384","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 1020000;\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\nconst double pi = acos(-1);\nconst double eps = 1e-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << \"debug: \" << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << \"debug: \" << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\nstruct UnionFind{\n\tvl p;\n\tvl rank;\n\tvl cnt;\n\n\tUnionFind(ll n){\n\t\trank.resize(n,0);\n\t\tp.resize(n,0);\n\t\tcnt.resize(n,0);\n\t\trep(i,n){\n\t\t\tp[i] = i;\n\t\t\trank[i] = 0;\n\t\t\tcnt[i] = 1;\n\t\t}\n\t}\n\n\tll find(ll x){\n\t\tif(x != p[x]) p[x] = find(p[x]);\n\t\treturn p[x];\n\t}\n\n\tbool same(ll x, ll y){\n\t\treturn find(x) == find(y);\n\t}\n\n\tvoid unite(ll x, ll y){\n\t\tx = find(x);\n\t\ty = find(y);\n\t\tif(x == y) return;\n\t\tif(rank[x] > rank[y]){\n\t\t\tp[y] = x;\n\t\t\tcnt[x] += cnt[y];\n\t\t}else{\n\t\t\tp[x] = y;\n\t\t\tcnt[y] += cnt[x];\n\t\t\tif(rank[x] == rank[y]) rank[y]++;\n\t\t}\n\t}\n\n\tll size(ll x){\n\t\treturn cnt[find(x)];\n\t}\n};\n\nint main(){\n\tint n; cin >> n;\n\tvl a(n); rep(i,n) cin >> a[i];\n\tUnionFind uf(n);\n\tvector<tapu> edges;\n\tfor(int i=1; i<=n; i++){\n\t\tfor(int j=i; j+i<=n; j+=i){\n\t\t\tedges.emplace_back(a[i-1],j-1,j+i-1);\n\t\t}\n\t}\n\tsort(all(edges));\n\tll ans = 0;\n\tfor(auto e : edges){\n\t\tll cost, u, v;\n\t\ttie(cost, u, v) = e;\n\t\tif(uf.same(u,v)) continue;\n\t\tuf.unite(u,v);\n\t\tans += cost;\n\t}\n\tcout << ans << \"\\n\";\n}","accuracy":1,"time_ms":290,"memory_kb":107580,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_3180_4847972","code_snippet":"#include <bits/stdc++.h>\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\n#define rep(i, n) For((i), 0, (n))\n#define rrep(i, n) rFor((i), (n), 0)\n#define fi first\n#define se second\nusing namespace std;\ntypedef long long lint;\ntypedef unsigned long long ulint;\ntypedef pair<int, int> pii;\ntypedef pair<lint, lint> pll;\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nT div_floor(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a >= 0 ? a / b : (a + 1) / b - 1;\n}\ntemplate <class T>\nT div_ceil(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a > 0 ? (a - 1) / b + 1 : a / b;\n}\n\nconstexpr lint mod = 1000000007;\nconstexpr lint INF = mod * mod;\nconstexpr int MAX = 100010;\n\ntypedef struct UnionFindTree {\n vector<int> par;\n\n UnionFindTree(int n) { par.resize(n, -1); }\n\n bool is_root(int x) { return par[x] < 0; }\n\n int find(int x) {\n if (is_root(x)) return x;\n return par[x] = find(par[x]);\n }\n\n int size(int x) { return -par[find(x)]; }\n\n bool unite(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y) return false;\n if (size(x) < size(y)) swap(x, y);\n par[x] += par[y];\n par[y] = x;\n return true;\n }\n\n bool same(int x, int y) { return find(x) == find(y); }\n} UF;\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n vector<pair<lint, int>> a(n);\n rep(i, n) {\n scanf(\"%lld\", &a[i].fi);\n a[i].se = i + 1;\n }\n sort(a.begin(), a.end());\n lint ans = 0;\n UF uf(n + 1);\n for (auto &p : a) {\n for (int k = 1; p.se * k <= n; ++k) {\n if (uf.unite(p.se, p.se * k)) ans += p.fi;\n }\n }\n printf(\"%lld\\n\", ans);\n}","accuracy":1,"time_ms":30,"memory_kb":7024,"score_of_the_acc":-0.0522,"final_rank":8},{"submission_id":"aoj_3180_4847680","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acos(-1.0);\n\nstruct uf {\nprivate:\n\tvector<int> par, ran;\npublic:\n\tuf(int n) {\n\t\tpar.resize(n, 0);\n\t\tran.resize(n, 0);\n\t\trep(i, n) {\n\t\t\tpar[i] = i;\n\t\t}\n\t}\n\tint find(int x) {\n\t\tif (par[x] == x)return x;\n\t\telse return par[x] = find(par[x]);\n\t}\n\tvoid unite(int x, int y) {\n\t\tx = find(x), y = find(y);\n\t\tif (x == y)return;\n\t\tif (ran[x] < ran[y]) {\n\t\t\tpar[x] = y;\n\t\t}\n\t\telse {\n\t\t\tpar[y] = x;\n\t\t\tif (ran[x] == ran[y])ran[x]++;\n\t\t}\n\t}\n\tbool same(int x, int y) {\n\t\treturn find(x) == find(y);\n\t}\n};\nint gcd(int a, int b) {\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tint r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\n\n\nvoid solve() {\n\tint n; cin >> n;\n\tvector<ll> a(n + 1);\n\trep1(i, n)cin >> a[i];\n\tvector<P> pairs;\n\trep1(i, n)pairs.push_back({ a[i],i });\n\tsort(all(pairs));\n\tuf u(n + 1);\n\tll ans = 0;\n\tfor (P p : pairs) {\n\t\tint val = p.first;\n\t\tint g = p.second;\n\t\tfor (int i = 2 * g; i <= n; i += g) {\n\t\t\tif (!u.same(i, g)) {\n\t\t\t\tu.unite(i, g);\n\t\t\t\tans += val;\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << \"\\n\";\n}\n\n\n\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":7520,"score_of_the_acc":-0.057,"final_rank":10}],"string":"[\n {\n \"submission_id\": \"aoj_3180_9552743\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n\\n/*\\nbrute force => RE or TLE\\nfrom index or rather k(th) infers v and w\\n*/\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\nconst int INF = 1000000000;\\n\\nconst int MAX_N = 200000;\\n//static int vect[MAX_N];\\n\\n//------------------------------------------------------------------------------\\nstruct Element\\n{\\n int i, v;\\n\\n Element(): i(-1), v(-INF) {}\\n Element(int idx, int val): i(idx), v(val) {}\\n bool operator<(const Element& e1) const\\n {\\n if (v == e1.v) return i < e1.i;\\n return v < e1.v;\\n }\\n void debug() const { printf(\\\"i=%d, v=%d\\\\n\\\", i, v); }\\n};\\n\\ntypedef vector<Element> Elements;\\n//------------------------------------------------------------------------------\\nclass QuickUnion\\n{\\n public:\\n int N;\\n int M; // no. of edges\\n int* parent;\\n int* count_; // no. of nodes rooted at n\\n QuickUnion(int num): N(num), M(0)\\n {\\n parent = new int[N]; // 0-based nodes\\n count_ = new int[N];\\n for (int n=0; n<N; n++) { parent[n]=n; count_[n]=1; }\\n }\\n\\n ~QuickUnion() { delete[] parent; delete[] count_; }\\n\\n int size(int n) //<--------------------\\n {\\n int p = root(n);\\n return count_[p];\\n }\\n\\n bool connected()\\n {\\n return M+1 >= N;\\n }\\n\\n bool unite(int n1, int n2) //<---------- return true if action is successful\\n {\\n int r1 = root(n1);\\n int r2 = root(n2);\\n if (r1==r2) return false;\\n M++; //<---------- for checking whether all are connected\\n\\n if (count_[r1] < count_[r2]) { parent[r1] = r2; count_[r2] += count_[r1]; }\\n else { parent[r2] = r1; count_[r1] += count_[r2]; }\\n return true;\\n }\\n\\n bool find(int n1, int n2)\\n {\\n return root(n1)==root(n2);\\n }\\n\\n int root(int node)\\n {\\n int n = node;\\n while (n != parent[n])\\n {\\n parent[n] = parent[parent[n]]; // vs compression\\n n = parent[n];\\n }\\n parent[node] = n;\\n return n;\\n }\\n\\n void debug() const\\n {\\n for (int n=0; n<N; n++) printf(\\\"node=%d, root=%d\\\\n\\\", n, parent[n]);\\n printf(\\\"\\\\n\\\");\\n }\\n};\\n\\n//------------------------------------------------------------------------------\\nint64_t kruskal(int N, Elements& E)\\n{\\n int64_t res = 0;\\n QuickUnion QU(N);\\n sort(E.begin(), E.end());\\n for (Element e: E)\\n {\\n if (QU.connected()) break;\\n for (int k=1; (e.i+1)*k-1<N; ++k)\\n {\\n if (QU.unite(e.i, (e.i+1)*k-1))\\n {\\n res += e.v;\\n }\\n }\\n }\\n return res;\\n}\\n\\n\\n//------------------------------------------------------------------------------\\nvoid test()\\n{\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //DEBUG = true;\\n //test(); return 0;\\n //--------------------------------------------------------------------------\\n int N, K, L, R, v, num;\\n num = scanf(\\\"%d \\\", &N);\\n Elements E(N);\\n for (int n=0; n<N; ++n)\\n {\\n num = scanf(\\\"%d \\\", &v);\\n E[n] = Element(n, v);\\n }\\n int64_t res = kruskal(N, E);\\n printf(\\\"%ld\\\\n\\\", res);\\n return 0;\\n}\\n\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6276,\n \"score_of_the_acc\": -0.0448,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3180_9488088\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\n/**\\n * @brief 素集合データ構造\\n * @details Implement (union by size) + (path compression)\\n * @see https://github.com/atcoder/ac-library/blob/master/atcoder/dsu.hpp\\n */\\nstruct union_find {\\n union_find() = default;\\n explicit union_find(int _n) : _rank(_n), data(_n, -1) {}\\n const int &operator[](std::size_t x) const { return data[x]; }\\n int &operator[](std::size_t x) { return data[x]; }\\n int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }\\n int get_root(int x) { return root(x); }\\n bool is_root(int x) const { return data[x] < 0; }\\n bool same(int x, int y) { return root(x) == root(y); }\\n bool is_same(int x, int y) { return same(x, y); }\\n int rank() { return _rank; }\\n int size(int x) { return -(data[root(x)]); }\\n int get_size(int x) { return size(x); }\\n std::vector<int> leaders() {\\n std::vector<int> res;\\n for (int i = 0; i < (int)data.size(); ++i) {\\n if (is_root(i)) res.emplace_back(i);\\n }\\n return res;\\n }\\n bool unite(int x, int y) {\\n x = root(x), y = root(y);\\n if (x == y) return false;\\n --_rank;\\n if (data[x] > data[y]) std::swap(x, y);\\n data[x] += data[y];\\n data[y] = x;\\n return true;\\n }\\n template <class F>\\n bool unite(int x, int y, F f) {\\n x = root(x), y = root(y);\\n if (x != y) {\\n if (data[x] > data[y]) std::swap(x, y);\\n data[x] += data[y];\\n data[y] = x;\\n }\\n f(x, y);\\n return x != y;\\n }\\n private:\\n int _rank;\\n std::vector<int> data;\\n};\\nint main(void) {\\n int n;\\n cin >> n;\\n vector<ll> a(n);\\n cin >> a;\\n vector<pair<ll, ll>> b(n);\\n rep (i, n) b[i] = {a[i], i + 1};\\n sort(all(b));\\n union_find uf(n);\\n ll ans = 0;\\n for (auto [x, y] : b) {\\n ll p = y - 1;\\n while (p + y < n) {\\n if (uf.unite(p, p + y))\\n ans += x;\\n p += y;\\n }\\n }\\n co(ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 8888,\n \"score_of_the_acc\": -0.0334,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3180_8514126\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3180.cc: GCDMST\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<algorithm>\\n#include<utility>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 200000;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n\\nstruct UFT {\\n vector<int> links, ranks, sizes;\\n UFT() {}\\n\\n void init(int n) {\\n links.resize(n);\\n for (int i = 0; i < n; i++) links[i] = i;\\n ranks.assign(n, 1);\\n sizes.assign(n, 1);\\n }\\n\\n int root(int i) {\\n int i0 = i;\\n while (links[i0] != i0) i0 = links[i0];\\n return (links[i] = i0);\\n }\\n\\n int rank(int i) { return ranks[root(i)]; }\\n int size(int i) { return sizes[root(i)]; }\\n bool same(int i, int j) { return root(i) == root(j); }\\n\\n int merge(int i0, int i1) {\\n int r0 = root(i0), r1 = root(i1), mr;\\n if (r0 == r1) return r0;\\n if (ranks[r0] == ranks[r1]) {\\n links[r1] = r0;\\n sizes[r0] += sizes[r1];\\n ranks[r0]++;\\n mr = r0;\\n }\\n else if (ranks[r0] > ranks[r1]) {\\n links[r1] = r0;\\n sizes[r0] += sizes[r1];\\n mr = r0;\\n }\\n else {\\n links[r0] = r1;\\n sizes[r1] += sizes[r0];\\n mr = r1;\\n }\\n return mr;\\n }\\n};\\n\\n/* global variables */\\n\\nint as[MAX_N + 1];\\npii ps[MAX_N];\\nUFT uft;\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n for (int i = 1; i <= n; i++) scanf(\\\"%d\\\", as + i);\\n\\n int hn = n / 2;\\n for (int i = 1; i <= hn; i++) ps[i - 1] = pii(as[i], i);\\n sort(ps, ps + hn);\\n\\n uft.init(n + 1);\\n ll sum = 0;\\n\\n for (int i = 0; i < hn; i++) {\\n int aj = ps[i].first, j = ps[i].second;\\n\\n for (int k = j * 2; k <= n; k += j) {\\n if (! uft.same(j, k)) {\\n\\tuft.merge(j, k);\\n\\tsum += aj;\\n }\\n }\\n }\\n\\n printf(\\\"%lld\\\\n\\\", sum);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6512,\n \"score_of_the_acc\": -0.0101,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3180_8002441\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\n#define all(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n ll N;\\n cin>>N;\\n vector<pair<ll,ll>> P(N);\\n rep(i,N){\\n cin>>P[i].first;\\n P[i].second=i+1;\\n }\\n sort(all(P));\\n vll L(N+1,0);\\n vvll D(N+1);\\n rep(i,N){\\n L[i+1]=i+1;\\n D[i+1].push_back(i+1);\\n }\\n ll an=0;\\n rep(i,N){\\n ll a=P[i].first;\\n ll b=P[i].second;\\n for(ll j=b*2;j<=N;j+=b){\\n if(L[j]==L[b])continue;\\n //cout<<j<<\\\" \\\"<<b<<endl;\\n an+=a;\\n if(D[L[j]].size()<D[L[b]].size()){\\n for(auto d:D[L[j]]){\\n L[d]=L[b];\\n D[L[b]].push_back(d);\\n }\\n }\\n else{\\n for(auto d:D[L[b]]){\\n L[d]=L[j];\\n D[L[j]].push_back(d);\\n }\\n }\\n }\\n }\\n cout<<an<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 24076,\n \"score_of_the_acc\": -0.2562,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3180_7011359\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3180.cc: GCDMST\\n */\\n\\n#include<cstdio>\\n#include<vector>\\n#include<algorithm>\\n#include<utility>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 200000;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n\\nstruct UFT {\\n vector<int> links, ranks, sizes;\\n UFT() {}\\n\\n void init(int n) {\\n links.resize(n);\\n for (int i = 0; i < n; i++) links[i] = i;\\n ranks.assign(n, 1);\\n sizes.assign(n, 1);\\n }\\n\\n int root(int i) {\\n int i0 = i;\\n while (links[i0] != i0) i0 = links[i0];\\n return (links[i] = i0);\\n }\\n\\n int rank(int i) { return ranks[root(i)]; }\\n int size(int i) { return sizes[root(i)]; }\\n bool same(int i, int j) { return root(i) == root(j); }\\n\\n int merge(int i0, int i1) {\\n int r0 = root(i0), r1 = root(i1), mr;\\n if (r0 == r1) return r0;\\n if (ranks[r0] == ranks[r1]) {\\n links[r1] = r0;\\n sizes[r0] += sizes[r1];\\n ranks[r0]++;\\n mr = r0;\\n }\\n else if (ranks[r0] > ranks[r1]) {\\n links[r1] = r0;\\n sizes[r0] += sizes[r1];\\n mr = r0;\\n }\\n else {\\n links[r0] = r1;\\n sizes[r1] += sizes[r0];\\n mr = r1;\\n }\\n return mr;\\n }\\n};\\n\\n/* global variables */\\n\\nint as[MAX_N + 1];\\npii ps[MAX_N];\\nUFT uft;\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n for (int i = 1; i <= n; i++) scanf(\\\"%d\\\", as + i);\\n\\n int hn = n / 2;\\n for (int i = 1; i <= hn; i++) ps[i - 1] = pii(as[i], i);\\n sort(ps, ps + hn);\\n\\n uft.init(n + 1);\\n ll sum = 0;\\n\\n for (int i = 0; i < hn; i++) {\\n int aj = ps[i].first, j = ps[i].second;\\n\\n for (int k = 2; k * j <= n; k++) {\\n int u = (k - 1) * j, v = k * j;\\n if (! uft.same(u, v)) {\\n\\tuft.merge(u, v);\\n\\tsum += aj;\\n }\\n }\\n }\\n\\n printf(\\\"%lld\\\\n\\\", sum);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6492,\n \"score_of_the_acc\": -0.0099,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3180_6740047\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <queue>\\n#include <array>\\n#include <algorithm>\\n#include <numeric>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <map>\\n#include <set>\\n#include <cassert>\\n#include <iterator>\\n#include <random>\\n#include <stack>\\n#include <climits>\\n#include <chrono>\\n#include <iomanip>\\n\\n\\nint gcd(const int a, const int b) {\\n\\treturn (b == 0) ? a : gcd(b, a % b);\\n}\\nclass UnionFind {\\n\\tstd::vector<int> vec;\\npublic:\\n\\tUnionFind(const int size) : vec(size, -1) {};\\n\\tint find(const int a) {\\n\\t\\treturn vec[a] < 0 ? a : vec[a] = find(vec[a]);\\n\\t}\\n\\tbool same(const int a, const int b) {\\n\\t\\treturn find(a) == find(b);\\n\\t}\\n\\tvoid unite(int a, int b) {\\n\\t\\ta = find(a);\\n\\t\\tb = find(b);\\n\\t\\tif (a == b) return;\\n\\t\\tif (vec[a] > vec[b]) std::swap(a, b);\\n\\t\\tvec[a] += vec[b];\\n\\t\\tvec[b] = a;\\n\\t}\\n};\\nint main() {\\n\\tint n; std::cin >> n;\\n\\tstd::vector<int> cost(n);\\n\\tfor (auto& a : cost) {\\n\\t\\tstd::cin >> a;\\n\\t}\\n\\tstd::vector<int> order_by_cost(n); std::iota(order_by_cost.begin(), order_by_cost.end(), 0);\\n\\tstd::sort(order_by_cost.begin(), order_by_cost.end(), [&](const auto i, const auto j) {return cost[i] < cost[j]; });\\n\\tlong long int result{ 0 };\\n\\tUnionFind uft(n);\\n\\tfor (const auto g : order_by_cost) {\\n\\t\\tfor (auto i = g; i + g + 1 < n; i += g + 1) {\\n\\t\\t\\tif (uft.same(i, i + g + 1)) continue;\\n\\t\\t\\tuft.unite(i, i + g + 1);\\n\\t\\t\\tresult += cost[g];\\n\\t\\t}\\n\\t}\\n\\tstd::cout << result << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5480,\n \"score_of_the_acc\": -0.1481,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3180_6452177\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline ll time() {\\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nstruct UnionFind{\\n vector<int> par,num;\\n UnionFind(int n):par(n),num(n,1){\\n iota(par.begin(),par.end(),0); //include<numeric>\\n }\\n int find(int v){\\n return (par[v]==v)?v:(par[v]=find(par[v]));\\n }\\n void unite(int u,int v){\\n u=find(u),v=find(v);\\n if(u==v)return;\\n if(num[u]<num[v])swap(u,v);\\n num[u]+=num[v];\\n par[v]=u;\\n }\\n bool same(int u,int v){\\n return find(u) == find(v);\\n }\\n int size(int v){\\n return num[find(v)];\\n }\\n};\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n; cin >> n;\\n UnionFind uf(n+1);\\n vector<pair<int,int>> v(n);\\n for(int i=0;i<n;i++){\\n cin >> v[i].first;\\n v[i].second = i+1;\\n }\\n sort(v.begin(), v.end());\\n ll res = 0;\\n for(auto p:v){\\n int i = p.second;\\n for(int j=i+i;j<=n;j+=i){\\n if(!uf.same(i,j)){\\n uf.unite(i, j);\\n res += p.first;\\n }\\n }\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6280,\n \"score_of_the_acc\": -0.0449,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3180_4918600\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 200005\\n\\nstruct Info{\\n\\tInfo(ll arg_value,ll arg_index){\\n\\t\\tvalue = arg_value;\\n\\t\\tindex = arg_index;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\n\\t\\treturn value < arg.value;\\n\\t}\\n\\tll value,index;\\n};\\n\\nint N;\\nint boss[SIZE],height[SIZE];\\nvector<Info> info;\\n\\nint get_boss(int id){\\n\\tif(boss[id] == id)return id;\\n\\telse{\\n\\t\\treturn boss[id] = get_boss(boss[id]);\\n\\t}\\n}\\n\\nint isSame(int x,int y){\\n\\treturn get_boss(x) == get_boss(y);\\n}\\n\\nvoid unite(int x,int y){\\n\\tint boss_x = get_boss(x);\\n\\tint boss_y = get_boss(y);\\n\\n\\tif(boss_x == boss_y)return;\\n\\n\\tif(height[boss_x] > height[boss_y]){\\n\\n\\t\\tboss[boss_y] = boss_x;\\n\\n\\t}else if(height[boss_x] < height[boss_y]){\\n\\n\\t\\tboss[boss_x] = boss_y;\\n\\n\\t}else{ //height[boss_x] == height[boss_y]\\n\\n\\t\\tboss[boss_y] = boss_x;\\n\\t\\theight[x]++;\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tint N;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tboss[i] = i;\\n\\t\\theight[i] = 0;\\n\\t}\\n\\n\\tll tmp;\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\n\\t\\tscanf(\\\"%lld\\\",&tmp);\\n\\t\\tinfo.push_back(Info(tmp,i));\\n\\t}\\n\\tsort(info.begin(),info.end());\\n\\n\\tll ans = 0;\\n\\tfor(int i = 0; i < info.size(); i++){\\n\\n\\t\\tfor(ll k = 2*(info[i].index); k <= N; k += info[i].index){\\n\\t\\t\\tif(isSame(info[i].index,k))continue;\\n\\n\\t\\t\\tunite(info[i].index,k);\\n\\n\\t\\t\\tans += info[i].value;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 8552,\n \"score_of_the_acc\": -0.1042,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3180_4894815\",\n \"code_snippet\": \"#ifdef ONLINE_JUDGE\\n#pragma GCC target(\\\"avx2,avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<long long, long long>;\\n#define rep(i, n) for(int i = 0; i < (n); ++i)\\n#define all(x) (x).begin(),(x).end()\\nconstexpr char ln = '\\\\n';\\nistream& operator>>(istream& is, __int128_t &x) {\\n x = 0;\\n string s;\\n is >> s;\\n int n = int(s.size()), it = 0;\\n if (s[0] == '-') it++;\\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\\n if (s[0] == '-') x = -x;\\n return is;\\n}\\nostream& operator<<(ostream& os, __int128_t x) {\\n if (x == 0) return os << 0;\\n if (x < 0) os << '-', x = -x;\\n deque<int> deq;\\n while (x) deq.emplace_front(x % 10), x /= 10;\\n for (int e : deq) os << e;\\n return os;\\n}\\ntemplate<class T1, class T2>\\nostream& operator<<(ostream& os, const pair<T1, T2>& p) {\\n return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n}\\ntemplate<class T> \\nostream& operator<<(ostream& os, const vector<T>& v) {\\n os << \\\"[\\\";\\n for(auto e : v) os << e << \\\", \\\";\\n return os << \\\"]\\\";\\n}\\ntemplate<class Container> inline int SZ(Container& v) {return int(v.size());}\\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\\ninline int topbit(int x) {return x == 0 ? -1 : 31 - __builtin_clz(x);}\\ninline int topbit(long long x) {return x == 0 ? -1 : 63 - __builtin_clzll(x);}\\ninline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}\\ninline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}\\ninline int popcount(int x) {return __builtin_popcount(x);}\\ninline int popcount(long long x) {return __builtin_popcountll(x);}\\ninline int kthbit(long long x, int k) {return (x>>k)&1;}\\ninline constexpr long long TEN(int x) {return x == 0 ? 1 : TEN(x-1) * 10;}\\nnamespace detail {\\n template<typename Tp, int Nb>\\n auto make_vector(vector<int>& sizes, Tp const& x) {\\n if constexpr (Nb == 1) {\\n return vector(sizes[0], x);\\n } else {\\n int size = sizes[Nb-1];\\n sizes.pop_back();\\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\\n }\\n }\\n}\\ntemplate<typename Tp, int Nb>\\nauto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {\\n vector<int> s(Nb);\\n for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];\\n return detail::make_vector<Tp, Nb>(s, x);\\n}\\ninline void print() {cout << \\\"\\\\n\\\";}\\ntemplate<class T>\\ninline void print(const vector<T>& v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << \\\" \\\";\\n print();\\n}\\ntemplate<class T, class... Args>\\ninline void print(const T &x, const Args &... args) {\\n cout << x << \\\" \\\";\\n print(args...);\\n}\\n#ifdef MINATO_LOCAL\\n#define dump(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\ninline void debug() {cerr << endl;}\\ntemplate<class T>\\ninline void debug(const vector<T> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << \\\" \\\";\\n debug();\\n}\\ntemplate<class T, class... Args>\\ninline void debug(const T &x, const Args &... args) {\\n cerr << x << \\\" \\\";\\n debug(args...);\\n}\\n#else\\n#define dump(x) void(0)\\ninline void debug() {}\\ntemplate<class T> inline void debug(const vector<T> &v) {}\\ntemplate<class T, class... Args> inline void debug(const T &x, const Args &... args) {}\\n#endif\\nstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\nstruct UnionFind {\\n int N;\\n vector<int> node;\\n\\n UnionFind(){}\\n UnionFind(int N) : N(N), node(N,-1) {}\\n\\n void init(int x) {\\n node.assign(x,-1);\\n N = x;\\n }\\n\\n bool merge(int x, int y) {\\n x = root(x); y = root(y);\\n if (x == y) return false;\\n if (node[x] > node[y]) swap(x,y);\\n node[x] += node[y];\\n node[y] = x;\\n N--;\\n return true; \\n }\\n\\n bool same(int x, int y) {return root(x) == root(y);}\\n\\n int root(int x) {\\n if (node[x] < 0) return x;\\n return node[x] = root(node[x]);\\n }\\n\\n int size(int x) {return -node[root(x)];}\\n\\n int count() const {return N;}\\n};\\n\\nint main() {\\n int N; cin >> N;\\n vector<ll> A(N+1,1e18);\\n rep(i,N) cin >> A[i+1];\\n\\n vector<int> idx(N+1);\\n iota(all(idx),0);\\n sort(all(idx),[&](int i, int j){return A[i] < A[j];});\\n UnionFind uf(N+1);\\n ll ans = 0;\\n rep(i,N) {\\n int u = idx[i];\\n for (int j = 2*u; j <= N; j += u) {\\n if (uf.merge(j,j-u)) {\\n ans += A[u];\\n }\\n }\\n }\\n\\n cout << ans << ln;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6248,\n \"score_of_the_acc\": -0.0446,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3180_4879538\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)\\n#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)\\n#define REP(i, n) rep(i, 0, n)\\n#define REP2(i, n) rep2(i, 0, n)\\n#define all(hoge) (hoge).begin(), (hoge).end()\\n#define en '\\\\n'\\nusing ll = long long;\\nusing ull = unsigned long long;\\ntemplate <class T>\\nusing vec = vector<T>;\\ntemplate <class T>\\nusing vvec = vector<vec<T>>;\\ntypedef pair<ll, ll> P;\\nusing tp = tuple<ll, ll, ll>;\\nconstexpr long long INF = 1LL << 60;\\nconstexpr int INF_INT = 1 << 25;\\n//constexpr long long MOD = (ll)1e9 + 7;\\nconstexpr long long MOD = 998244353LL;\\nusing ld = long double;\\nstatic const ld pi = 3.141592653589793L;\\ntypedef vector<ll> Array;\\ntypedef vector<Array> Matrix;\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n//グラフ関連\\nstruct Edge {\\n ll to, cap, rev;\\n Edge(ll _to, ll _cap, ll _rev) {\\n to = _to;\\n cap = _cap;\\n rev = _rev;\\n }\\n};\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {\\n G[from].push_back(Edge(to, cap, (ll)G[to].size()));\\n if(revFlag)\\n G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));\\n}\\n\\nclass UnionFind {\\n vector<int> data;\\n int num;\\n\\n public:\\n UnionFind(int size) : data(size, -1), num(size) {}\\n bool unionSet(int x, int y) {\\n x = root(x);\\n y = root(y);\\n if(x != y) {\\n if(data[y] < data[x])\\n swap(x, y);\\n data[x] += data[y];\\n data[y] = x;\\n num--;\\n }\\n return x != y;\\n }\\n bool findSet(int x, int y) {\\n return root(x) == root(y);\\n }\\n int root(int x) {\\n return data[x] < 0 ? x : data[x] = root(data[x]);\\n }\\n int size(int x) {\\n return -data[root(x)];\\n }\\n int numSet() {\\n return num;\\n }\\n};\\n\\nvoid solve() {\\n ll n;\\n cin >> n;\\n vec<P> a(n);\\n\\n REP(i, n) {\\n cin >> a[i].first;\\n a[i].second = i + 1;\\n }\\n sort(all(a));\\n\\n UnionFind uni(n + 1);\\n ll ans = 0;\\n REP(i, n) {\\n auto [cost, k] = a[i];\\n for(int j = 2; j * k <= n; j++) {\\n if(uni.unionSet(k, j * k)) {\\n ans += cost;\\n }\\n }\\n }\\n cout << ans << en;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout.tie(0);\\n /*\\n ll t;\\n cin >> t;\\n while(t--)*/\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7032,\n \"score_of_the_acc\": -0.0522,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3180_4878957\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n//BEGIN CUT HERE\\nstruct UnionFind{\\n int num;//連結成分の数\\n vector<int> r,p;//そのグループのサイズ,自分の親っぽいやつ\\n UnionFind(){}\\n UnionFind(int n):num(n),r(n,1),p(n,0){iota(p.begin(),p.end(),0);}\\n\\n int find(int x){//どのグループに所属するか\\n return (x==p[x]?x:p[x]=find(p[x]));//xがグループの名前と一致するまでxを親にする\\n }\\n\\n bool same(int x,int y){//同じグループかどうか\\n return find(x)==find(y);\\n }\\n\\n void unite(int x,int y){//xとyを同じグループにする\\n x=find(x);y=find(y);//xとyのグループの名前をどっちかが変える\\n if(x==y) return;\\n if(r[x]<r[y]) swap(x,y);//サイズが大きい方をxとする\\n r[x]+=r[y];//yの親をxにする（今までyだったグループ名がxになる）\\n p[y]=x;\\n num--;\\n }\\n\\n int size(int x){//グループの大きさ\\n return r[find(x)];\\n }\\n\\n int count() const{//グループの数\\n return num;\\n }\\n};\\n //END CUT HERE\\ntypedef pair<int,int> P;\\n\\nsigned main(){\\n int n;cin>>n;\\n vector<P> v(n);\\n UnionFind uf(n);\\n for(int i=0;i<n;i++){\\n int a;cin>>a;v[i]=P(a,i+1);\\n }\\n int ans=0;\\n sort(v.begin(),v.end());\\n for(int i=0;i<n;i++){\\n int p=v[i].second;\\n for(int j=2*p;j<=n;j+=p){\\n if(uf.same(p-1,j-1))continue;\\n uf.unite(p-1,j-1);\\n ans+=v[i].first;\\n }\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 9168,\n \"score_of_the_acc\": -0.2213,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3180_4875834\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=Int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\n\\nstruct UnionFind{\\n Int num;\\n vector<Int> rs,ps;\\n UnionFind(){}\\n UnionFind(Int n):num(n),rs(n,1),ps(n,0){iota(ps.begin(),ps.end(),0);}\\n Int find(Int x){\\n return (x==ps[x]?x:ps[x]=find(ps[x]));\\n }\\n bool same(Int x,Int y){\\n return find(x)==find(y);\\n }\\n void unite(Int x,Int y){\\n x=find(x);y=find(y);\\n if(x==y) return;\\n if(rs[x]<rs[y]) swap(x,y);\\n rs[x]+=rs[y];\\n ps[y]=x;\\n num--;\\n }\\n Int size(Int x){\\n return rs[find(x)];\\n }\\n Int count() const{\\n return num;\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n Int n;\\n cin>>n;\\n\\n auto as=read(n);\\n as.emplace(as.begin(),0);\\n using P = pair<Int, Int>;\\n vector<P> vp;\\n for(Int i=1;i<=n;i++)\\n vp.emplace_back(as[i],i);\\n\\n sort(vp.begin(),vp.end());\\n\\n UnionFind uf(n+1);\\n\\n Int ans=0;\\n for(auto[c,i]:vp){\\n set<Int> ss;\\n for(Int j=i;j<=n;j+=i)\\n ss.emplace(uf.find(j));\\n ans+=c*(ss.size()-1);\\n for(Int j=i;j<=n;j+=i)\\n uf.unite(i,j);\\n }\\n cout<<ans<<newl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 20668,\n \"score_of_the_acc\": -0.371,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3180_4868336\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T> inline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T> inline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\n#define DEBUG\\n#ifdef DEBUG\\nvoid debug_out() { cerr << endl; }\\ntemplate <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {\\n cerr << \\\" \\\" << H;\\n debug_out(T...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debug_out(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\nstruct Setup {\\n Setup() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n }\\n} __Setup;\\n\\nusing ll = long long;\\n#define ALL(v) (v).begin(), (v).end()\\n#define RALL(v) (v).rbegin(), (v).rend()\\nconst double EPS = 1e-7;\\nconst int INF = 1 << 30;\\nconst ll LLINF = 1LL << 60;\\nconstexpr int MOD = 1000000007;\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\n\\n//-------------------------------------\\n\\nstruct UnionFind {\\n vector<int> par;\\n\\n UnionFind(int n) : par(n, -1) {}\\n void init(int n) { par.assign(n, -1); }\\n\\n int root(int x) {\\n if(par[x] < 0)\\n return x;\\n else\\n return par[x] = root(par[x]);\\n }\\n\\n bool issame(int x, int y) { return root(x) == root(y); }\\n\\n bool merge(int x, int y) {\\n x = root(x);\\n y = root(y);\\n if(x == y)\\n return false;\\n if(par[x] > par[y])\\n swap(x, y); // merge technique\\n par[x] += par[y];\\n par[y] = x;\\n return true;\\n }\\n\\n int size(int x) { return -par[root(x)]; }\\n};\\n\\nstruct edge {\\n int from, to;\\n ll cost;\\n edge() = default;\\n edge(int from, int to, ll cost) : from(from), to(to), cost(cost) {}\\n};\\n\\nint main() {\\n int n;\\n cin >> n;\\n vector<ll> a(n);\\n for(auto &i : a) {\\n cin >> i;\\n }\\n\\n vector<edge> edges;\\n for(int i = 1; i <= n; i++) {\\n for(int j = 2 * i; j <= n; j += i) {\\n edges.emplace_back(edge(i - 1, j - 1, a[i - 1]));\\n }\\n }\\n\\n sort(ALL(edges),\\n [](const edge &l, const edge &r) { return (l.cost < r.cost); });\\n UnionFind uf(n);\\n\\n ll ans = 0;\\n for(auto e : edges) {\\n if(!uf.issame(e.from, e.to)) {\\n uf.merge(e.from, e.to);\\n ans += e.cost;\\n }\\n }\\n\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 72280,\n \"score_of_the_acc\": -0.8765,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3180_4863532\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <chrono>\\n//#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)\\n#define Rrep(i,n) Rreps(i,n,0)\\n#define ALL(a) a.begin(), a.end()\\n#define fi first\\n#define se second\\n\\nusing ll = long long;\\nusing vec = vector<ll>;\\nusing mat = vector<vec>;\\n\\nll N,M,H,W,Q,K,A,B;\\nstring S;\\ntypedef pair<ll, ll> P;\\nconst ll INF = (1LL<<60);\\n\\nint main() {\\n class union_find {\\n vector<long> parent, tree_size;\\n public:\\n union_find(unsigned long _n) : parent(_n), tree_size(_n, 1) {\\n for (unsigned long i = 0; i < _n; ++i) parent[i] = i;\\n }\\n\\n ll find(ll x) {\\n while (parent[x] != x)x = parent[x] = parent[parent[x]];\\n return x;\\n }\\n\\n void merge(ll a, ll b) {\\n a = find(a);\\n b = find(b);\\n if (a == b) return;\\n if (tree_size[a] < tree_size[b])swap(a, b);\\n tree_size[a] += tree_size[b];\\n parent[b] = a;\\n }\\n\\n bool same(ll a, ll b) {\\n a = find(a);\\n b = find(b);\\n return a == b;\\n }\\n };\\n cin>>N;\\n vec a(N + 1, INF), ord(N + 1);\\n rep(i, N) cin>>a[i + 1];\\n iota(ALL(ord), 0);\\n sort(ALL(ord), [&](int x, int y){\\n return a[x] < a[y];\\n });\\n union_find uf(N + 1);\\n ll res(0);\\n rep(i, N){\\n int id = ord[i];\\n for(int j = id * 2; j <= N; j += id){\\n if(!uf.same(id, j)){\\n res += a[id];\\n uf.merge(j, id);\\n }\\n }\\n }\\n cout<<res<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 9232,\n \"score_of_the_acc\": -0.259,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3180_4849658\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG // for STL debug (optional)\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <cfloat>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <fstream>\\n#include <functional>\\n#include <bitset>\\nusing namespace std;\\nusing ll = long long int;\\nusing int64 = long long int;\\n \\ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\\n \\nint dx[] = {0, 0, 1, -1};\\nint dy[] = {1, -1, 0, 0};\\nconst int INF = 1LL << 29;\\nconst ll LONGINF = 1LL << 60;\\nconst ll MOD = 1000000007LL;\\n\\n/**\\n * @brief Union-Find\\n * @docs ./docs/union_find.md\\n */\\n\\n#include <algorithm>\\n#include <vector>\\n\\nstruct UnionFind {\\nprivate:\\n const int n;\\n int size_;\\n vector<int> uf;\\npublic:\\n // 初期化 UnionFind uni(n) のように宣言すれば良い\\n UnionFind(int _n) : n(_n), size_(_n), uf(_n, -1) {}\\n // find (木の根を求める)\\n int find(int x) {return (uf[x] < 0) ? x : uf[x] = find(uf[x]);}\\n // x と y が同じ集合に属するかどうか\\n bool same(int x, int y) {return find(x) == find(y);}\\n // x が属する集合の要素数\\n int size(int x) {return -uf[find(x)];}\\n // 集合はいくつあるか\\n int size() {return size_;}\\n // x と y の属する集合を併合\\n bool unite(int x, int y) {\\n x = find(x); y = find(y);\\n if(x == y) return false;\\n size_--;\\n if(-uf[x] < -uf[y]) swap(x, y);\\n uf[x] += uf[y]; uf[y] = x;\\n return true;\\n }\\n};\\n\\nint main() {\\n int N; scanf(\\\"%d\\\", &N);\\n vector<int> A(N), ord(N);\\n for(int i=0; i<N; i++) {\\n scanf(\\\"%d\\\", &A[i]);\\n ord[i] = i;\\n }\\n sort(ord.begin(), ord.end(), [&](auto x, auto y) {\\n return A[x] < A[y];\\n });\\n\\n ll ans = 0;\\n UnionFind uf(N);\\n for(int i=0; i<N; i++) {\\n int v = A[ ord[i] ], k = ord[i];\\n for(int j=k; j<N; j+=k+1) {\\n if(!uf.same(k, j)) {\\n uf.unite(k, j);\\n ans += v;\\n }\\n }\\n }\\n printf(\\\"%lld\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5504,\n \"score_of_the_acc\": -0.0373,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3180_4849246\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <numeric>\\n#include <vector>\\n\\nstruct UnionFind {\\n std::vector<int> par, sz;\\n int gnum;\\n\\n explicit UnionFind(int n)\\n : par(n), sz(n, 1), gnum(n) {\\n std::iota(par.begin(), par.end(), 0);\\n }\\n\\n int find(int v) {\\n return (par[v] == v) ? v : (par[v] = find(par[v]));\\n }\\n\\n void unite(int u, int v) {\\n u = find(u), v = find(v);\\n if (u == v) return;\\n\\n if (sz[u] < sz[v]) std::swap(u, v);\\n sz[u] += sz[v];\\n par[v] = u;\\n --gnum;\\n }\\n\\n bool same(int u, int v) { return find(u) == find(v); }\\n bool ispar(int v) { return v == find(v); }\\n int size(int v) { return sz[find(v)]; }\\n};\\n\\nusing lint = long long;\\n\\nvoid solve() {\\n int n;\\n std::cin >> n;\\n\\n std::vector<std::pair<lint, int>> ps(n);\\n for (int i = 0; i < n; ++i) {\\n auto& [x, j] = ps[i];\\n std::cin >> x;\\n j = i + 1;\\n }\\n std::sort(ps.begin(), ps.end());\\n\\n UnionFind uf(n + 1);\\n lint ans = 0;\\n for (auto [x, g] : ps) {\\n for (int i = g * 2; i <= n; i += g) {\\n if (uf.same(g, i)) continue;\\n uf.unite(g, i);\\n ans += x;\\n }\\n }\\n\\n std::cout << ans << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7824,\n \"score_of_the_acc\": -0.06,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3180_4849167\",\n \"code_snippet\": \"// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region aliases\\n\\n#define rep(i, n) for(long long i = 0; i < (n); i++)\\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bcnt(n) __builtin_popcountll(n)\\n#define endk endl\\n#define ednl endl\\n#define enld endl\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vb = vector<bool>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing mll = map<long long, long long>;\\nusing pll = pair<long long, long long>;\\nusing qll = queue<long long>;\\nusing sll = set<long long>;\\nusing vpll = vector<pair<long long, long long>>;\\ntemplate <class T = ll>\\nusing V = vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\n//昇順pq(小さい方から取り出す)\\ntemplate <class T = ll>\\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\\n//降順pq(大きい方から取り出す)\\ntemplate <class T = ll>\\nusing pqdn = priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nlong long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18\\nlong long const dekai = 3e16;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\nint ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\\nint ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\\n\\nconst int mod = 1000000007;\\n// const int mod = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_procedure\\n\\ntemplate <class T>\\ninline bool isin(T x, T lef, T rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { cout << (f ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"; }\\nvoid No() { cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { cout << (f ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"; }\\nvoid NO() { cout << \\\"NO\\\\n\\\"; }\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tcout << answer << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\nvoid err() {\\n\\tcout << -1 << \\\"\\\\n\\\";\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(vector<T> &v, bool tate = 0) {\\n\\tif(v.size() > 0) {\\n\\t\\tfor(auto it = v.begin(); it < v.end(); it++) {\\n\\t\\t\\tcout << *it;\\n\\t\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\t\\tif(tate)\\n\\t\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tcout << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << endl;\\n}\\n\\ntemplate <class T>\\nvoid add(vector<T> &v, T val) {\\t //ベクトルの各要素に加算\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\n// vectorの中身を数える map<要素,個数>を返す\\ntemplate <class T>\\nmap<T, long long> cntv(vector<T> v) {\\n\\tmap<T, long long> m;\\n\\tfor(auto &g : v) {\\n\\t\\tif(m.count(g))\\n\\t\\t\\tm[g]++;\\n\\t\\telse\\n\\t\\t\\tm[g] = 1;\\n\\t}\\n\\treturn m;\\n}\\n\\n//配列圧縮\\n//{1,36,1,3,8,-2,-92}を\\n//{2, 5,2,3,4, 1, 0}にする\\ntemplate <class T>\\nvector<long long> press(vector<T> &v) {\\n\\tlong long n = v.size();\\n\\tvector<long long> w(n);\\n\\tmap<T, long long> m;\\n\\tfor(T &p : v) m[p] = 0;\\n\\tlong long i = 0;\\n\\tfor(auto &p : m) {\\n\\t\\tp.second = i;\\n\\t\\ti++;\\n\\t}\\n\\tfor(long long i = 0; i < n; i++) w.at(i) = m[v.at(i)];\\n\\treturn w;\\n}\\n\\n// 切り上げ除算\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\tT x = abs(a);\\n\\tT y = abs(b);\\n\\tT z = (x + y - 1) / y;\\n\\tif((a < 0 && b > 0) || (a > 0 && b < 0))\\n\\t\\treturn -z;\\n\\telse if(a == 0)\\n\\t\\treturn 0;\\n\\telse\\n\\t\\treturn z;\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\n// a * x % mod == __gcd(a,mod)なるxを返す\\n// a が modの倍数でないことが条件\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tswap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tswap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\nvector<vector<long long>> comb(100, vector<long long>(100, -1));\\nlong long com(long long n, long long k) { //普通の二項計数(overflowに注意)\\n\\tassert(n < 100 && k < 100);\\n\\tif(n < k || k < 0 || n < 0) return 0;\\n\\tif(comb[n][k] != -1) return comb[n][k];\\n\\tll res;\\n\\tif(n - k < k)\\n\\t\\tres = com(n, n - k);\\n\\telse if(k == 0)\\n\\t\\tres = 1;\\n\\telse\\n\\t\\tres = com(n - 1, k - 1) + com(n - 1, k);\\n\\tcomb[n][k] = res;\\n\\treturn res;\\n}\\n\\n// nCk modを求める\\nconst int MAX = 5100000;\\n// この値は求める二項計数の値に応じて変える\\n// MAX=3*10^7のとき1900msほど、ほぼ比例\\n// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\nvoid cominit() {\\n\\t// テーブルを作る前処理\\n\\tfac[0] = fac[1] = 1;\\n\\tfinv[0] = finv[1] = 1;\\n\\tinv[1] = 1;\\n\\tfor(int i = 2; i < MAX; i++) {\\n\\t\\tfac[i] = fac[i - 1] * i % mod;\\n\\t\\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\\n\\t\\tfinv[i] = finv[i - 1] * inv[i] % mod;\\n\\t}\\n}\\nlong long commod(long long n, long long k) { // 二項係数\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\nlong long pmod(long long n, long long k) {\\t// 順列\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * finv[n - k] % mod;\\n}\\n// n個の区別しないボールを区別するk個の箱に入れる方法の総数\\nlong long hmod(long long n, long long k) {\\t// 重複組み合わせ\\n\\treturn commod(n + k - 1, n);\\n}\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tINPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tINPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tcin >> a;\\n}\\ntemplate <class T>\\nvoid scan(vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\ntemplate <class T, class L>\\nvoid scan(pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\ntemplate <class T>\\ninline void print(T x) {\\n\\tcout << x << '\\\\n';\\n}\\n\\ntemplate <typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tcerr << \\\", \\\";\\n\\tview(p.second);\\n\\tcerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tcerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tcerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tcerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tcerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tcerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tview(H);\\n\\tcerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tcerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tview(x); \\\\\\n\\t\\tcerr << \\\"\\\\n\\\"; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\nstruct UF {\\t\\t\\t // Union_Find木 (平衡操作あり)\\n\\tvector<int> data; // data[root] = -size, data[not_root] = parent\\n\\tUF(int N) : data(N) {\\n\\t\\tfor(int i = 0; i < N; i++) {\\n\\t\\t\\tdata[i] = -1;\\n\\t\\t}\\n\\t}\\n\\tint root(int x) {\\n\\t\\tif(data[x] < 0) return x;\\n\\t\\treturn data[x] = root(data[x]);\\n\\t}\\n\\t// 2つのデータx, yが属する木が同じならtrueを返す\\n\\tbool same(int x, int y) { return root(x) == root(y); }\\n\\tbool unite(int x, int y) {\\t// xとyの木を併合\\n\\t\\tx = root(x);\\n\\t\\ty = root(y);\\n\\t\\tif(x == y) return false;\\n\\t\\tif(data[x] > data[y]) swap(x, y); // 平衡操作 sizeは-1倍なのでこれで正しい\\n\\t\\tdata[x] += data[y];\\n\\t\\tdata[y] = x;\\n\\t\\treturn true;\\n\\t}\\n\\tint size(int x) { return -data[root(x)]; }\\n};\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\tcout << fixed << setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tINT(n);\\n\\tVEC(ll, a, n);\\n\\n\\tpqup<pll> q;\\n\\trep(i, n) { q.push({a[i], i + 1}); }\\n\\n\\tUF uf(n);\\n\\tll ans = 0;\\n\\n\\twhile(!q.empty()) {\\n\\t\\tll sa, cost;\\n\\t\\ttie(cost, sa) = q.top();\\n\\t\\tq.pop();\\n\\t\\tll b = sa - 1;\\n\\t\\tll c = sa + sa - 1;\\n\\t\\twhile(c < n) {\\n\\t\\t\\tif(uf.unite(b, c)) {\\n\\t\\t\\t\\tans += cost;\\n\\t\\t\\t}\\n\\t\\t\\tc += sa;\\n\\t\\t}\\n\\t}\\n\\tdrop(ans);\\n\\t;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 10572,\n \"score_of_the_acc\": -0.1239,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3180_4848384\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 1020000;\\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\nstruct UnionFind{\\n\\tvl p;\\n\\tvl rank;\\n\\tvl cnt;\\n\\n\\tUnionFind(ll n){\\n\\t\\trank.resize(n,0);\\n\\t\\tp.resize(n,0);\\n\\t\\tcnt.resize(n,0);\\n\\t\\trep(i,n){\\n\\t\\t\\tp[i] = i;\\n\\t\\t\\trank[i] = 0;\\n\\t\\t\\tcnt[i] = 1;\\n\\t\\t}\\n\\t}\\n\\n\\tll find(ll x){\\n\\t\\tif(x != p[x]) p[x] = find(p[x]);\\n\\t\\treturn p[x];\\n\\t}\\n\\n\\tbool same(ll x, ll y){\\n\\t\\treturn find(x) == find(y);\\n\\t}\\n\\n\\tvoid unite(ll x, ll y){\\n\\t\\tx = find(x);\\n\\t\\ty = find(y);\\n\\t\\tif(x == y) return;\\n\\t\\tif(rank[x] > rank[y]){\\n\\t\\t\\tp[y] = x;\\n\\t\\t\\tcnt[x] += cnt[y];\\n\\t\\t}else{\\n\\t\\t\\tp[x] = y;\\n\\t\\t\\tcnt[y] += cnt[x];\\n\\t\\t\\tif(rank[x] == rank[y]) rank[y]++;\\n\\t\\t}\\n\\t}\\n\\n\\tll size(ll x){\\n\\t\\treturn cnt[find(x)];\\n\\t}\\n};\\n\\nint main(){\\n\\tint n; cin >> n;\\n\\tvl a(n); rep(i,n) cin >> a[i];\\n\\tUnionFind uf(n);\\n\\tvector<tapu> edges;\\n\\tfor(int i=1; i<=n; i++){\\n\\t\\tfor(int j=i; j+i<=n; j+=i){\\n\\t\\t\\tedges.emplace_back(a[i-1],j-1,j+i-1);\\n\\t\\t}\\n\\t}\\n\\tsort(all(edges));\\n\\tll ans = 0;\\n\\tfor(auto e : edges){\\n\\t\\tll cost, u, v;\\n\\t\\ttie(cost, u, v) = e;\\n\\t\\tif(uf.same(u,v)) continue;\\n\\t\\tuf.unite(u,v);\\n\\t\\tans += cost;\\n\\t}\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 107580,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3180_4847972\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\\n#define rep(i, n) For((i), 0, (n))\\n#define rrep(i, n) rFor((i), (n), 0)\\n#define fi first\\n#define se second\\nusing namespace std;\\ntypedef long long lint;\\ntypedef unsigned long long ulint;\\ntypedef pair<int, int> pii;\\ntypedef pair<lint, lint> pll;\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nT div_floor(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a >= 0 ? a / b : (a + 1) / b - 1;\\n}\\ntemplate <class T>\\nT div_ceil(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a > 0 ? (a - 1) / b + 1 : a / b;\\n}\\n\\nconstexpr lint mod = 1000000007;\\nconstexpr lint INF = mod * mod;\\nconstexpr int MAX = 100010;\\n\\ntypedef struct UnionFindTree {\\n vector<int> par;\\n\\n UnionFindTree(int n) { par.resize(n, -1); }\\n\\n bool is_root(int x) { return par[x] < 0; }\\n\\n int find(int x) {\\n if (is_root(x)) return x;\\n return par[x] = find(par[x]);\\n }\\n\\n int size(int x) { return -par[find(x)]; }\\n\\n bool unite(int x, int y) {\\n x = find(x);\\n y = find(y);\\n if (x == y) return false;\\n if (size(x) < size(y)) swap(x, y);\\n par[x] += par[y];\\n par[y] = x;\\n return true;\\n }\\n\\n bool same(int x, int y) { return find(x) == find(y); }\\n} UF;\\n\\nint main() {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n vector<pair<lint, int>> a(n);\\n rep(i, n) {\\n scanf(\\\"%lld\\\", &a[i].fi);\\n a[i].se = i + 1;\\n }\\n sort(a.begin(), a.end());\\n lint ans = 0;\\n UF uf(n + 1);\\n for (auto &p : a) {\\n for (int k = 1; p.se * k <= n; ++k) {\\n if (uf.unite(p.se, p.se * k)) ans += p.fi;\\n }\\n }\\n printf(\\\"%lld\\\\n\\\", ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7024,\n \"score_of_the_acc\": -0.0522,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3180_4847680\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acos(-1.0);\\n\\nstruct uf {\\nprivate:\\n\\tvector<int> par, ran;\\npublic:\\n\\tuf(int n) {\\n\\t\\tpar.resize(n, 0);\\n\\t\\tran.resize(n, 0);\\n\\t\\trep(i, n) {\\n\\t\\t\\tpar[i] = i;\\n\\t\\t}\\n\\t}\\n\\tint find(int x) {\\n\\t\\tif (par[x] == x)return x;\\n\\t\\telse return par[x] = find(par[x]);\\n\\t}\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x), y = find(y);\\n\\t\\tif (x == y)return;\\n\\t\\tif (ran[x] < ran[y]) {\\n\\t\\t\\tpar[x] = y;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tpar[y] = x;\\n\\t\\t\\tif (ran[x] == ran[y])ran[x]++;\\n\\t\\t}\\n\\t}\\n\\tbool same(int x, int y) {\\n\\t\\treturn find(x) == find(y);\\n\\t}\\n};\\nint gcd(int a, int b) {\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tint r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\n\\n\\nvoid solve() {\\n\\tint n; cin >> n;\\n\\tvector<ll> a(n + 1);\\n\\trep1(i, n)cin >> a[i];\\n\\tvector<P> pairs;\\n\\trep1(i, n)pairs.push_back({ a[i],i });\\n\\tsort(all(pairs));\\n\\tuf u(n + 1);\\n\\tll ans = 0;\\n\\tfor (P p : pairs) {\\n\\t\\tint val = p.first;\\n\\t\\tint g = p.second;\\n\\t\\tfor (int i = 2 * g; i <= n; i += g) {\\n\\t\\t\\tif (!u.same(i, g)) {\\n\\t\\t\\t\\tu.unite(i, g);\\n\\t\\t\\t\\tans += val;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\n\\n\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7520,\n \"score_of_the_acc\": -0.057,\n \"final_rank\": 10\n }\n]","isConversational":false}}},{"rowIdx":1995,"cells":{"group_id":{"kind":"string","value":"aoj_3183_cpp"},"problem_description":{"kind":"string","value":"L - Flipping a Path\n問題文\n$N$ 頂点 $M$ 辺の単純有向グラフが与えられます。\nこのグラフの頂点には $1$ から $N$ までの番号がついていて、辺には $1$ から $M$ までの番号がついています。\n辺 $i$ $(1 \\le i \\le M)$ は、頂点 $u_i$ から頂点 $v_i$ へ向かう辺です。\n次の条件を満たす辺素パスが存在するか判定し、存在する場合はそのようなパスの長さの最小値を求めてください。\nパスに含まれるすべての辺の向きを逆にすると、グラフ全体が強連結になる。\nここで長さ $K$ $(K \\ge 0)$ の辺素パスとは、次の条件を満たす辺の番号の列 $(e_1, e_2, \\ldots, e_K)$ のことです。\n$1 \\le i \\le K-1$ について $v_{e_i} = u_{e_{i+1}}$ である。\nどのような $1 \\le i < j \\le K$ についても、$e_i \\ne e_j$ である。\n特にこの問題では、長さ $K$ が $0$ となるものも辺素パスとして認めることにします。\nまた、「グラフが強連結である」とは、「そのグラフのどのような $2$ 頂点 $s, t$ $(s \\ne t)$ についても、$s$ から $t$ への辺素パス、つまり、$u_{e_0} = s$ かつ $v_{e_K} = t$ を満たす辺素パスが存在する」ということです。\n入力\n入力は以下の形式で標準入力から与えられる。\n$N$ $M$\n$u_1$ $v_1$\n$u_2$ $v_2$\n$\\vdots$\n$u_M$ $v_M$\n制約\n$2 \\le N \\le 10^5$\n$1 \\le M \\le \\min (10^5, N(N-1))$\n$1 \\le u_i \\le N$\n$1 \\le v_i \\le N$\n$u_i \\ne v_i$\nどのような $(i, j)$ $(1 \\le i < j \\le M)$ についても、$(u_i, v_i) \\ne (u_j, v_j)$\n出力\n条件を満たす辺素パスが存在しない場合は\n-1\nを出力せよ。\nそうでない場合は、条件を満たすパスの長さの最小値を出力せよ。\n入力例 1\n4 5\n1 2\n1 3\n2 3\n2 4\n3 4\n出力例 1\n2\n与えられるグラフは次のようになります。\n例えば長さ $2$ の辺素パス $(e_1, e_2) = (2, 5)$ を逆にすると、次の図のようにグラフ全体を強連結にすることができます。\n$1$ 本の辺を逆にしても強連結にはできないので、条件を満たすパスの長さの最小値は $2$ となります。\n入力例 2\n4 5\n1 2\n3 1\n2 3\n2 4\n4 3\n出力例 2\n0\n与えられるグラフは次のようになります。\nグラフはすでに強連結なので、辺を逆にする必要がありません。\n入力例 3\n2 1\n1 2\n出力例 3\n-1\n辺を逆にしてもしなくても、グラフは強連結になりません。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3183_8041018","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nstruct SCC{\n vector<vector<int> > gg,rg;\n vector<int> comp,order;\n vector<bool> used;\n vector<vector<int> > ng,vs;\n int n,nn;\n SCC(){}\n SCC(int v):gg(v),rg(v),comp(v,-1),used(v,0),n(v){}\n void add_edge(int x,int y){\n gg[x].push_back(y);\n rg[y].push_back(x);\n }\n void dfs(int v){\n used[v]=1;\n for(int i:gg[v]){\n if(!used[i])dfs(i);\n }\n order.push_back(v);\n }\n void rdfs(int v,int k){\n used[v]=1;\n comp[v]=k;\n for(int i:rg[v]){\n if(!used[i])rdfs(i,k);\n }\n }\n int build(){\n for(int i=0;i<n;i++){\n if(!used[i])dfs(i);\n }\n for(int i=0;i<n;i++){\n used[i]=0;\n }\n int k=0;\n for(int i=order.size()-1;i>=0;i--){\n if(!used[order[i]])rdfs(order[i],k++);\n }\n nn=k;\n // それぞれの強連結成分に含まれる頂点の番号\n vs.resize(k,vector<int>());\n for(int i=0;i<n;i++){\n vs[comp[i]].push_back(i);\n }\n // 強連結成分をまとめた後のグラフ\n ng.resize(k,vector<int>());\n for(int i=0;i<n;i++){\n for(int j:gg[i]){\n if(comp[i]!=comp[j]){\n ng[comp[i]].push_back(comp[j]);\n }\n }\n }\n for(int i=0;i<nn;i++){\n sort(ng[i].begin(),ng[i].end());\n ng[i].erase(unique(ng[i].begin(),ng[i].end()),ng[i].end());\n }\n return k;\n }\n};\n\ntemplate<typename T>\nstruct dinic{\n struct edge{\n int to;\n T c,f;\n };\n T eps;\n const T inf=numeric_limits<T>::max();\n int n,m = 0;\n vector<edge> e;\n vector<vector<int>> g;\n vector<int> level, ptr;\n dinic(int n): n(n), g(n), level(n), ptr(n) {\n eps = (T)1 / (T)1e9;\n }\n void add_edge(int s, int t, T c){\n e.push_back({t, c, 0});\n e.push_back({s, 0, 0});\n g[s].push_back(m++);\n g[t].push_back(m++);\n }\n bool bfs(int s, int t){\n fill(level.begin(), level.end(), -1);\n level[s] = 0;\n for(queue<int> q({s});q.size();q.pop()){\n int s = q.front();\n for(int i:g[s]){\n int t = e[i].to;\n if(level[t] == -1 and (e[i].c - e[i].f) > eps){\n level[t] = level[s] + 1;\n q.push(t);\n }\n }\n }\n return (level[t] != -1);\n }\n T dfs(int s, int t, T psh){\n if(!(psh > eps) or s == t) return psh;\n for(int &i = ptr[s]; i < (int)g[s].size(); ++i){\n auto &eg = e[g[s][i]];\n if(level[eg.to] != level[s] + 1 or !(eg.c - eg.f > eps)) continue;\n T f = dfs(eg.to, t, min(psh, eg.c-eg.f));\n if(f > eps){\n eg.f += f;\n e[g[s][i]^1].f -= f;\n return f;\n }\n }\n return 0;\n }\n T max_flow(int s, int t){\n T f = 0;\n while(bfs(s,t)){\n fill(ptr.begin(), ptr.end(), 0);\n while(1){\n T c = dfs(s, t, inf);\n if(c > eps){\n f += c;\n }\n else{\n break;\n }\n }\n }\n return f;\n }\n // ABC239-G\n vector<bool> min_cut(int s){\n vector<bool> visited(n);\n queue<int> q; q.push(s);\n while(q.size()){\n int p = q.front(); q.pop();\n visited[p] = true;\n for(auto idx:g[p]){\n auto eg = e[idx];\n if(eg.c - eg.f > eps and !visited[eg.to]){\n visited[eg.to] = true;\n q.push(eg.to);\n }\n }\n }\n return visited;\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,m; cin >> n >> m;\n SCC G(n);\n for (int i = 0; i < m; ++i) {\n int x,y; cin >> x >> y;\n x--; y--;\n G.add_edge(x, y);\n }\n int sz = G.build();\n if (sz == 1) {\n cout << 0 << endl;\n return 0;\n }\n auto ng = G.ng;\n int s = -1, t = -1;\n {\n vector<int> deg(sz);\n for (int i = 0; i < sz; ++i) {\n for (int j : ng[i]) {\n deg[j]++;\n }\n }\n for (int i = 0; i < sz; ++i) {\n if (deg[i] == 0) {\n if (s == -1) s = i;\n else {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n for (int i = 0; i < sz; ++i) {\n if (ng[i].size() == 0) {\n if (t == -1) t = i;\n else {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n }\n vector<vector<int>> g(n+2);\n dinic<int> dc(n+2);\n for (int i = 0; i < n; ++i) {\n int u = (G.comp[i] == s ? n : i);\n for (int j : G.gg[i]) {\n int v = (G.comp[j] == t ? n+1 : j);\n g[u].push_back(v);\n dc.add_edge(u, v, 1);\n }\n }\n if (dc.max_flow(n, n+1) == 1) {\n cout << -1 << endl;\n return 0;\n }\n vector<int> d(n+2, -1);\n queue<int> q;\n q.push(n); d[n] = 0;\n while (q.size()) {\n int p = q.front(); q.pop();\n for (int pp : g[p]) {\n if (d[pp] == -1) {\n d[pp] = d[p] + 1;\n q.push(pp);\n }\n }\n }\n cout << d[n+1] << endl;\n}","accuracy":1,"time_ms":80,"memory_kb":49784,"score_of_the_acc":-1.3333,"final_rank":7},{"submission_id":"aoj_3183_8041004","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nstruct SCC{\n vector<vector<int> > gg,rg;\n vector<int> comp,order;\n vector<bool> used;\n vector<vector<int> > ng,vs;\n int n,nn;\n SCC(){}\n SCC(int v):gg(v),rg(v),comp(v,-1),used(v,0),n(v){}\n void add_edge(int x,int y){\n gg[x].push_back(y);\n rg[y].push_back(x);\n }\n void dfs(int v){\n used[v]=1;\n for(int i:gg[v]){\n if(!used[i])dfs(i);\n }\n order.push_back(v);\n }\n void rdfs(int v,int k){\n used[v]=1;\n comp[v]=k;\n for(int i:rg[v]){\n if(!used[i])rdfs(i,k);\n }\n }\n int build(){\n for(int i=0;i<n;i++){\n if(!used[i])dfs(i);\n }\n for(int i=0;i<n;i++){\n used[i]=0;\n }\n int k=0;\n for(int i=order.size()-1;i>=0;i--){\n if(!used[order[i]])rdfs(order[i],k++);\n }\n nn=k;\n // それぞれの強連結成分に含まれる頂点の番号\n vs.resize(k,vector<int>());\n for(int i=0;i<n;i++){\n vs[comp[i]].push_back(i);\n }\n // 強連結成分をまとめた後のグラフ\n ng.resize(k,vector<int>());\n for(int i=0;i<n;i++){\n for(int j:gg[i]){\n if(comp[i]!=comp[j]){\n ng[comp[i]].push_back(comp[j]);\n }\n }\n }\n for(int i=0;i<nn;i++){\n sort(ng[i].begin(),ng[i].end());\n ng[i].erase(unique(ng[i].begin(),ng[i].end()),ng[i].end());\n }\n return k;\n }\n};\n\ntemplate<typename T>\nstruct dinic{\n struct edge{\n int to;\n T c,f;\n };\n T eps;\n const T inf=numeric_limits<T>::max();\n int n,m = 0;\n vector<edge> e;\n vector<vector<int>> g;\n vector<int> level, ptr;\n dinic(int n): n(n), g(n), level(n), ptr(n) {\n eps = (T)1 / (T)1e9;\n }\n void add_edge(int s, int t, T c){\n e.push_back({t, c, 0});\n e.push_back({s, 0, 0});\n g[s].push_back(m++);\n g[t].push_back(m++);\n }\n bool bfs(int s, int t){\n fill(level.begin(), level.end(), -1);\n level[s] = 0;\n for(queue<int> q({s});q.size();q.pop()){\n int s = q.front();\n for(int i:g[s]){\n int t = e[i].to;\n if(level[t] == -1 and (e[i].c - e[i].f) > eps){\n level[t] = level[s] + 1;\n q.push(t);\n }\n }\n }\n return (level[t] != -1);\n }\n T dfs(int s, int t, T psh){\n if(!(psh > eps) or s == t) return psh;\n for(int &i = ptr[s]; i < (int)g[s].size(); ++i){\n auto &eg = e[g[s][i]];\n if(level[eg.to] != level[s] + 1 or !(eg.c - eg.f > eps)) continue;\n T f = dfs(eg.to, t, min(psh, eg.c-eg.f));\n if(f > eps){\n eg.f += f;\n e[g[s][i]^1].f -= f;\n return f;\n }\n }\n return 0;\n }\n T max_flow(int s, int t){\n T f = 0;\n while(bfs(s,t)){\n fill(ptr.begin(), ptr.end(), 0);\n while(1){\n T c = dfs(s, t, inf);\n if(c > eps){\n f += c;\n }\n else{\n break;\n }\n }\n }\n return f;\n }\n // ABC239-G\n vector<bool> min_cut(int s){\n vector<bool> visited(n);\n queue<int> q; q.push(s);\n while(q.size()){\n int p = q.front(); q.pop();\n visited[p] = true;\n for(auto idx:g[p]){\n auto eg = e[idx];\n if(eg.c - eg.f > eps and !visited[eg.to]){\n visited[eg.to] = true;\n q.push(eg.to);\n }\n }\n }\n return visited;\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,m; cin >> n >> m;\n SCC G(n);\n for (int i = 0; i < m; ++i) {\n int x,y; cin >> x >> y;\n x--; y--;\n G.add_edge(x, y);\n }\n int sz = G.build();\n if (sz == 1) {\n cout << 0 << endl;\n return 0;\n }\n auto ng = G.ng;\n int s = -1, t = -1;\n {\n vector<int> deg(sz);\n for (int i = 0; i < sz; ++i) {\n for (int j : ng[i]) {\n deg[j]++;\n }\n }\n for (int i = 0; i < sz; ++i) {\n if (deg[i] == 0) {\n if (s == -1) s = i;\n else {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n for (int i = 0; i < sz; ++i) {\n if (ng[i].size() == 0) {\n if (t == -1) t = i;\n else {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n }\n vector<vector<int>> g(n+2);\n dinic<int> dc(n+2);\n for (int i = 0; i < n; ++i) {\n int u = (i == s ? n : i);\n for (int j : G.gg[i]) {\n int v = (j == t ? n+1 : j);\n g[u].push_back(v);\n dc.add_edge(u, v, 1);\n }\n }\n if (dc.max_flow(n, n+1) == 1) {\n cout << -1 << endl;\n return 0;\n }\n vector<int> d(n+2, -1);\n queue<int> q;\n q.push(n); d[n] = 0;\n while (q.size()) {\n int p = q.front(); q.pop();\n for (int pp : g[p]) {\n if (d[pp] == -1) {\n d[pp] = d[p] + 1;\n q.push(pp);\n }\n }\n }\n cout << d[n+1] << endl;\n}","accuracy":0.3783783783783784,"time_ms":30,"memory_kb":21464,"score_of_the_acc":0,"final_rank":16},{"submission_id":"aoj_3183_4878836","code_snippet":"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3183\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\nstruct SCC{\n vector< vector<int> > G,R,H,C;\n vector<int> vs,used,blg;\n SCC(){}\n SCC(int n):G(n),R(n),used(n),blg(n){}\n\n void add_edge(int u,int v){\n G[u].emplace_back(v);\n R[v].emplace_back(u);\n }\n\n void dfs(int v){\n used[v]=1;\n for(int u:G[v])\n if(!used[u]) dfs(u);\n vs.emplace_back(v);\n }\n\n void rdfs(int v,int k){\n used[v]=1;\n blg[v]=k;\n C[k].emplace_back(v);\n for(int u:R[v])\n if(!used[u]) rdfs(u,k);\n }\n\n int build(bool uniq=true){\n int n=G.size();\n for(int v=0;v<n;v++)\n if(!used[v]) dfs(v);\n\n fill(used.begin(),used.end(),0);\n int k=0;\n for(int i=n-1;i>=0;i--){\n if(!used[vs[i]]){\n H.emplace_back();\n C.emplace_back();\n rdfs(vs[i],k++);\n }\n }\n\n for(int v=0;v<n;v++)\n for(int u:G[v])\n if(blg[v]!=blg[u])\n H[blg[v]].push_back(blg[u]);\n\n if(uniq){\n for(int i=0;i<k;i++){\n sort(H[i].begin(),H[i].end());\n H[i].erase(unique(H[i].begin(),H[i].end()),H[i].end());\n }\n }\n return k;\n }\n\n int operator[](int k) const{return blg[k];}\n};\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T>\nstruct Dijkstra{\n struct Edge{\n int to;\n T cost;\n Edge(int to,T cost):to(to),cost(cost){}\n bool operator<(const Edge &o)const{return cost>o.cost;}\n };\n\n vector< vector<Edge> > G;\n vector<T> ds;\n vector<int> bs;\n Dijkstra(int n):G(n){}\n\n void add_edge(int u,int v,T c){\n G[u].emplace_back(v,c);\n }\n\n void build(int s){\n int n=G.size();\n ds.assign(n,numeric_limits<T>::max());\n bs.assign(n,-1);\n\n priority_queue<Edge> pq;\n ds[s]=0;\n pq.emplace(s,ds[s]);\n\n while(!pq.empty()){\n auto p=pq.top();pq.pop();\n int v=p.to;\n if(ds[v]<p.cost) continue;\n for(auto e:G[v]){\n if(ds[e.to]>ds[v]+e.cost){\n ds[e.to]=ds[v]+e.cost;\n bs[e.to]=v;\n pq.emplace(e.to,ds[e.to]);\n }\n }\n }\n }\n\n T operator[](int k){return ds[k];}\n\n vector<int> restore(int to){\n vector<int> res;\n if(bs[to]<0) return res;\n while(~to) res.emplace_back(to),to=bs[to];\n reverse(res.begin(),res.end());\n return res;\n }\n};\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\n// O(F E \\log V)\ntemplate<typename Flow, bool directed>\nstruct FordFulkerson{\n struct edge{\n int dst;\n Flow cap;\n int rev;\n edge(){}\n edge(int dst,Flow cap,int rev):dst(dst),cap(cap),rev(rev){}\n };\n\n vector< vector<edge> > G;\n vector<int> used;\n\n FordFulkerson(){}\n FordFulkerson(int n):G(n),used(n){}\n\n int add_edge(int src,int dst,Flow cap){\n int e=G[src].size();\n int r=(src==dst?e+1:G[dst].size());\n G[src].emplace_back(dst,cap,r);\n G[dst].emplace_back(src,directed?0:cap,e);\n return e;\n }\n\n Flow dfs(int v,int t,Flow f){\n if(v==t) return f;\n used[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n edge &e=G[v][i];\n if(!used[e.dst]&&e.cap>0){\n Flow d=dfs(e.dst,t,min(f,e.cap));\n if(d==0) continue;\n e.cap-=d;\n G[e.dst][e.rev].cap+=d;\n return d;\n }\n }\n return 0;\n }\n\n Flow flow(int s,int t,Flow lim){\n Flow fl=0;\n while(1){\n fill(used.begin(),used.end(),0);\n Flow f=dfs(s,t,lim);\n if(f==0) break;\n fl+=f;\n lim-=f;\n }\n return fl;\n }\n\n Flow flow(int s,int t){\n return flow(s,t,numeric_limits<Flow>::max()/2);\n }\n};\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nconst int MAX = 303;\nint G[MAX][MAX]={};\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n,m;\n cin>>n>>m;\n SCC G(n);\n\n int S=n,T=n+1;\n Dijkstra<int> D(n+2);\n FordFulkerson<int, true> F(n+2);\n for(int i=0;i<m;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G.add_edge(u,v);\n D.add_edge(u,v,1);\n F.add_edge(u,v,1);\n }\n int k=G.build();\n\n vector<int> indeg(n,0);\n vector<int> outdeg(n,0);\n\n for(int i=0;i<k;i++)\n for(int j:G.H[i])\n outdeg[i]++,indeg[j]++;\n\n for(int i=0;i<k;i++){\n if(i!=0 and indeg[i]==0) drop(-1);\n if(i!=k-1 and outdeg[i]==0) drop(-1);\n }\n\n for(int i=0;i<n;i++){\n if(G.blg[i]==0){\n D.add_edge(S,i,0);\n F.add_edge(S,i,2);\n }\n if(G.blg[i]==k-1){\n D.add_edge(i,T,0);\n F.add_edge(i,T,2);\n }\n }\n\n int res=F.flow(S,T,2);\n if(res!=2) drop(-1);\n\n D.build(S);\n if(~D.bs[T]) drop(D[T]);\n drop(-1);\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":47928,"score_of_the_acc":-1.3345,"final_rank":8},{"submission_id":"aoj_3183_4875839","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\n\nstruct SCC{\n vector< vector<int> > G,R,T,C;\n vector<int> vs,used,blg;\n SCC(){}\n SCC(int n):G(n),R(n),used(n),blg(n){}\n\n void add_edge(int u,int v){\n G[u].emplace_back(v);\n R[v].emplace_back(u);\n }\n\n void dfs(int v){\n used[v]=1;\n for(int u:G[v])\n if(!used[u]) dfs(u);\n vs.emplace_back(v);\n }\n\n void rdfs(int v,int k){\n used[v]=1;\n blg[v]=k;\n C[k].emplace_back(v);\n for(int u:R[v])\n if(!used[u]) rdfs(u,k);\n }\n\n int build(){\n int n=G.size();\n for(int v=0;v<n;v++)\n if(!used[v]) dfs(v);\n\n fill(used.begin(),used.end(),0);\n int k=0;\n for(int i=n-1;i>=0;i--){\n if(!used[vs[i]]){\n T.emplace_back();\n C.emplace_back();\n rdfs(vs[i],k++);\n }\n }\n\n for(int v=0;v<n;v++)\n for(int u:G[v])\n if(blg[v]!=blg[u])\n T[blg[v]].push_back(blg[u]);\n/*\n for(int i=0;i<k;i++){\n sort(T[i].begin(),T[i].end());\n T[i].erase(unique(T[i].begin(),T[i].end()),T[i].end());\n }\n*/\n return k;\n }\n\n int operator[](int k) const{return blg[k];}\n};\n\n\ntemplate<typename T,bool directed>\nstruct FordFulkerson{\n struct edge{\n int to;\n T cap;\n int rev;\n edge(){}\n edge(int to,T cap,int rev):to(to),cap(cap),rev(rev){}\n };\n\n vector< vector<edge> > G;\n vector<int> used;\n\n FordFulkerson(){}\n FordFulkerson(int n):G(n),used(n){}\n\n void add_edge(int from,int to,T cap){\n G[from].emplace_back(to,cap,G[to].size());\n G[to].emplace_back(from,directed?0:cap,G[from].size()-1);\n }\n\n T dfs(int v,int t,T f){\n if(v==t) return f;\n used[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n edge &e=G[v][i];\n if(!used[e.to]&&e.cap>0){\n T d=dfs(e.to,t,min(f,e.cap));\n if(d==0) continue;\n e.cap-=d;\n G[e.to][e.rev].cap+=d;\n return d;\n }\n }\n return 0;\n }\n\n T flow(int s,int t,T lim){\n T fl=0;\n while(1){\n fill(used.begin(),used.end(),0);\n T f=dfs(s,t,lim);\n if(f==0) break;\n fl+=f;\n lim-=f;\n }\n return fl;\n }\n\n T flow(int s,int t){\n return flow(s,t,numeric_limits<T>::max()/2);\n }\n};\n\n\ntemplate<typename T>\nstruct Dijkstra{\n struct Edge{\n int to;\n T cost;\n Edge(int to,T cost):to(to),cost(cost){}\n bool operator<(const Edge &o)const{return cost>o.cost;}\n };\n\n vector< vector<Edge> > G;\n vector<T> ds;\n vector<int> bs;\n Dijkstra(int n):G(n){}\n\n void add_edge(int u,int v,T c){\n G[u].emplace_back(v,c);\n }\n\n void build(int s){\n int n=G.size();\n ds.assign(n,numeric_limits<T>::max());\n bs.assign(n,-1);\n\n priority_queue<Edge> pq;\n ds[s]=0;\n pq.emplace(s,ds[s]);\n\n while(!pq.empty()){\n auto p=pq.top();pq.pop();\n int v=p.to;\n if(ds[v]<p.cost) continue;\n for(auto e:G[v]){\n if(ds[e.to]>ds[v]+e.cost){\n ds[e.to]=ds[v]+e.cost;\n bs[e.to]=v;\n pq.emplace(e.to,ds[e.to]);\n }\n }\n }\n }\n\n T operator[](int k){return ds[k];}\n\n vector<int> restore(int to){\n vector<int> res;\n if(bs[to]<0) return res;\n while(~to) res.emplace_back(to),to=bs[to];\n reverse(res.begin(),res.end());\n return res;\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n,m;\n cin>>n>>m;\n SCC G(n);\n\n int S=n,T=n+1;\n Dijkstra<int> D(n+2);\n FordFulkerson<int, true> F(n+2);\n for(int i=0;i<m;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G.add_edge(u,v);\n D.add_edge(u,v,1);\n F.add_edge(u,v,1);\n }\n int k=G.build();\n\n vector<int> indeg(n,0);\n vector<int> outdeg(n,0);\n\n for(int i=0;i<k;i++)\n for(int j:G.T[i])\n outdeg[i]++,indeg[j]++;\n\n for(int i=0;i<k;i++){\n if(i!=0 and indeg[i]==0) drop(-1);\n if(i!=k-1 and outdeg[i]==0) drop(-1);\n }\n\n for(int i=0;i<n;i++){\n if(G.blg[i]==0){\n D.add_edge(S,i,0);\n F.add_edge(S,i,2);\n }\n if(G.blg[i]==k-1){\n D.add_edge(i,T,0);\n F.add_edge(i,T,2);\n }\n }\n\n int res=F.flow(S,T,2);\n // cout<<res<<endl;\n if(res!=2) drop(-1);\n\n D.build(S);\n if(~D.bs[T]) drop(D[T]);\n drop(-1);\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":47256,"score_of_the_acc":-1.3774,"final_rank":10},{"submission_id":"aoj_3183_4850510","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF INT_MAX/3\n#define mod 1000000007\n\n#define MAX_V 100010\n\nstruct edge{ int to,cap,rev; };\nvector<edge> g[MAX_V];\nint level[MAX_V];\nint iter[MAX_V];\n\nvoid add_edge_f(int from,int to,int cap){\n g[from].push_back((edge){to,cap,(int)g[to].size()});\n g[to].push_back((edge){from,0,(int)g[from].size()-1});\n}\n\nvoid bfs_f(int s){\n memset(level,-1,sizeof(level));\n queue<int> que;\n level[s]=0;\n que.push(s);\n while(!que.empty()){\n int v=que.front(); que.pop();\n for(int i=0;i<(int)g[v].size();i++){\n edge &e=g[v][i];\n if(e.cap>0&&level[e.to]<0){\n level[e.to]=level[v]+1;\n que.push(e.to);\n }\n }\n }\n}\n\nint min_dist_f(int s, int t){\n memset(level,-1,sizeof(level));\n queue<int> que;\n level[s]=0;\n que.push(s);\n while(!que.empty()){\n int v=que.front(); que.pop();\n for(int i=0;i<(int)g[v].size();i++){\n edge &e=g[v][i];\n if(e.cap>0&&level[e.to]<0){\n level[e.to]=level[v]+1;\n que.push(e.to);\n }\n }\n }\n return level[t];\n}\n\nint dfs_f(int v,int t,int f){\n if(v==t)return f;\n for(int &i=iter[v];i<(int)g[v].size();i++){\n edge &e=g[v][i];\n if(e.cap>0&&level[v]<level[e.to]){\n int d=dfs_f(e.to,t,min(f,e.cap));\n if(d>0){\n e.cap-=d;\n g[e.to][e.rev].cap+=d;\n return d;\n }\n }\n }\n return 0;\n}\n\nint max_flow(int s,int t){\n int flow=0;\n while(1){\n bfs_f(s);\n if(level[t]<0)return flow;\n memset(iter,0,sizeof(iter));\n int f;\n while((f=dfs_f(s,t,INF))>0){\n flow+=f;\n }\n }\n}\n\nint V;\nvector<int> G[MAX_V];\nvector<int> rG[MAX_V];\nvector<int> vs;\nbool used[MAX_V];\nint cmp[MAX_V];\n\nvoid add_edge(int from,int to){\n G[from].push_back(to);\n rG[to].push_back(from);\n}\n\nvoid dfs(int v){\n used[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n if(!used[G[v][i]])dfs(G[v][i]);\n }\n vs.push_back(v);\n}\n\nvoid rdfs(int v,int k){\n used[v]=true;\n cmp[v]=k;\n for(int i=0;i<(int)rG[v].size();i++){\n if(!used[rG[v][i]])rdfs(rG[v][i],k);\n }\n}\n\nint scc(){\n memset(used,0,sizeof(used));\n vs.clear();\n for(int v=0;v<V;v++){\n if(!used[v])dfs(v);\n }\n memset(used,0,sizeof(used));\n int k=0;\n for(int i=(int)vs.size()-1;i>=0;i--){\n if(!used[vs[i]])rdfs(vs[i],k++);\n }\n return k;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int N,M;\n cin>>N>>M;\n rep(i,M){\n int a,b;\n cin>>a>>b;\n a--;b--;\n add_edge(a,b);\n }\n V=N;\n int K=scc();\n if(K==1){\n cout<<0<<endl;\n return 0;\n }\n\n vector<int> ideg(K,0),odeg(K,0);\n rep(i,N){\n for(int v : G[i]){\n if(cmp[i]==cmp[v])continue;\n odeg[cmp[i]]++;\n ideg[cmp[v]]++;\n }\n }\n\n int izcnt=0,ozcnt=0;\n int icmp=-1,ocmp=-1;\n rep(i,K){\n if(ideg[i]==0){\n izcnt++;\n icmp=i;\n }\n if(odeg[i]==0){\n ozcnt++;\n ocmp=i;\n }\n }\n if(izcnt>1||ozcnt>1){\n cout<<-1<<endl;\n return 0;\n }\n\n int source=N,sink=N+1;\n rep(i,N){\n if(cmp[i]==icmp){\n for(int v : G[i]){\n if(cmp[v]==icmp)continue;\n if(cmp[v]==ocmp){\n add_edge_f(source,sink,1);\n }else{\n add_edge_f(source,v,1);\n }\n }\n }else if(cmp[i]==ocmp){\n\n }else{\n for(int v : G[i]){\n if(cmp[v]==ocmp){\n add_edge_f(i,sink,1);\n }else{\n add_edge_f(i,v,1);\n }\n }\n }\n }\n\n int min_d = min_dist_f(source,sink);\n int max_f = max_flow(source,sink);\n if(max_f>1) cout<<min_d<<endl;\n else cout<<-1<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":25028,"score_of_the_acc":-0.3258,"final_rank":1},{"submission_id":"aoj_3183_4850419","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF INT_MAX/3\n#define mod 1000000007\n\n#define MAX_V 100010\n\nstruct edge{ int to,cap,rev; };\nvector<edge> g[MAX_V];\nint level[MAX_V];\nint iter[MAX_V];\n\nvoid add_edge_f(int from,int to,int cap){\n g[from].push_back((edge){to,cap,(int)g[to].size()});\n g[to].push_back((edge){from,0,(int)g[from].size()-1});\n}\n\nvoid bfs_f(int s){\n memset(level,-1,sizeof(level));\n queue<int> que;\n level[s]=0;\n que.push(s);\n while(!que.empty()){\n int v=que.front(); que.pop();\n for(int i=0;i<(int)g[v].size();i++){\n edge &e=g[v][i];\n if(e.cap>0&&level[e.to]<0){\n level[e.to]=level[v]+1;\n que.push(e.to);\n }\n }\n }\n}\n\nint min_dist_f(int s, int t){\n memset(level,-1,sizeof(level));\n queue<int> que;\n level[s]=0;\n que.push(s);\n while(!que.empty()){\n int v=que.front(); que.pop();\n for(int i=0;i<(int)g[v].size();i++){\n edge &e=g[v][i];\n if(e.cap>0&&level[e.to]<0){\n level[e.to]=level[v]+1;\n que.push(e.to);\n }\n }\n }\n return level[t];\n}\n\nint dfs_f(int v,int t,int f){\n if(v==t)return f;\n for(int &i=iter[v];i<(int)g[v].size();i++){\n edge &e=g[v][i];\n if(e.cap>0&&level[v]<level[e.to]){\n int d=dfs_f(e.to,t,min(f,e.cap));\n if(d>0){\n e.cap-=d;\n g[e.to][e.rev].cap+=d;\n return d;\n }\n }\n }\n return 0;\n}\n\nint max_flow(int s,int t){\n int flow=0;\n while(1){\n bfs_f(s);\n if(level[t]<0)return flow;\n memset(iter,0,sizeof(iter));\n int f;\n while((f=dfs_f(s,t,INF))>0){\n flow+=f;\n }\n }\n}\n\nint V;\nvector<int> G[MAX_V];\nvector<int> rG[MAX_V];\nvector<int> vs;\nbool used[MAX_V];\nint cmp[MAX_V];\n\nvoid add_edge(int from,int to){\n G[from].push_back(to);\n rG[to].push_back(from);\n}\n\nvoid dfs(int v){\n used[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n if(!used[G[v][i]])dfs(G[v][i]);\n }\n vs.push_back(v);\n}\n\nvoid rdfs(int v,int k){\n used[v]=true;\n cmp[v]=k;\n for(int i=0;i<(int)rG[v].size();i++){\n if(!used[rG[v][i]])rdfs(rG[v][i],k);\n }\n}\n\nint scc(){\n memset(used,0,sizeof(used));\n vs.clear();\n for(int v=0;v<V;v++){\n if(!used[v])dfs(v);\n }\n memset(used,0,sizeof(used));\n int k=0;\n for(int i=(int)vs.size()-1;i>=0;i--){\n if(!used[vs[i]])rdfs(vs[i],k++);\n }\n return k;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int N,M;\n cin>>N>>M;\n rep(i,M){\n int a,b;\n cin>>a>>b;\n a--;b--;\n add_edge(a,b);\n }\n V=N;\n int K=scc();\n if(K==1){\n cout<<0<<endl;\n return 0;\n }\n\n vector<int> ideg(K,0),odeg(K,0);\n rep(i,N){\n for(int v : G[i]){\n odeg[cmp[i]]++;\n ideg[cmp[v]]++;\n }\n }\n\n int izcnt=0,ozcnt=0;\n int icmp=-1,ocmp=-1;\n rep(i,K){\n if(ideg[i]==0){\n izcnt++;\n icmp=i;\n }\n if(odeg[i]==0){\n ozcnt++;\n ocmp=i;\n }\n }\n if(izcnt>1||ozcnt>1){\n cout<<-1<<endl;\n return 0;\n }\n\n int source=N,sink=N+1;\n rep(i,N){\n if(cmp[i]==icmp){\n for(int v : G[i]){\n if(cmp[v]==icmp)continue;\n if(cmp[v]==ocmp){\n add_edge_f(source,sink,1);\n }else{\n add_edge_f(source,v,1);\n }\n }\n }else if(cmp[i]==ocmp){\n\n }else{\n for(int v : G[i]){\n if(cmp[v]==ocmp){\n add_edge_f(i,sink,1);\n }else{\n add_edge_f(i,v,1);\n }\n }\n }\n }\n\n int min_d = min_dist_f(source,sink);\n int max_f = max_flow(source,sink);\n if(max_f>1)cout<<min_d<<endl;\n else cout<<-1<<endl;\n\n return 0;\n}","accuracy":0.5,"time_ms":40,"memory_kb":22612,"score_of_the_acc":-0.1072,"final_rank":11},{"submission_id":"aoj_3183_4850412","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF INT_MAX/3\n#define mod 1000000007\n\n#define MAX_V 100010\n\nstruct edge{ int to,cap,rev; };\nvector<edge> g[MAX_V];\nint level[MAX_V];\nint iter[MAX_V];\n\nvoid add_edge_f(int from,int to,int cap){\n g[from].push_back((edge){to,cap,(int)g[to].size()});\n g[to].push_back((edge){from,0,(int)g[from].size()-1});\n}\n\nvoid bfs_f(int s){\n memset(level,-1,sizeof(level));\n queue<int> que;\n level[s]=0;\n que.push(s);\n while(!que.empty()){\n int v=que.front(); que.pop();\n for(int i=0;i<(int)g[v].size();i++){\n edge &e=g[v][i];\n if(e.cap>0&&level[e.to]<0){\n level[e.to]=level[v]+1;\n que.push(e.to);\n }\n }\n }\n}\n\nint min_dist_f(int s, int t){\n memset(level,-1,sizeof(level));\n queue<int> que;\n level[s]=0;\n que.push(s);\n while(!que.empty()){\n int v=que.front(); que.pop();\n for(int i=0;i<(int)g[v].size();i++){\n edge &e=g[v][i];\n if(e.cap>0&&level[e.to]<0){\n level[e.to]=level[v]+1;\n que.push(e.to);\n }\n }\n }\n return level[t];\n}\n\nint dfs_f(int v,int t,int f){\n if(v==t)return f;\n for(int &i=iter[v];i<(int)g[v].size();i++){\n edge &e=g[v][i];\n if(e.cap>0&&level[v]<level[e.to]){\n int d=dfs_f(e.to,t,min(f,e.cap));\n if(d>0){\n e.cap-=d;\n g[e.to][e.rev].cap+=d;\n return d;\n }\n }\n }\n return 0;\n}\n\nint max_flow(int s,int t){\n int flow=0;\n while(1){\n bfs_f(s);\n if(level[t]<0)return flow;\n memset(iter,0,sizeof(iter));\n int f;\n while((f=dfs_f(s,t,INF))>0){\n flow+=f;\n }\n }\n}\n\nint V;\nvector<int> G[MAX_V];\nvector<int> rG[MAX_V];\nvector<int> vs;\nbool used[MAX_V];\nint cmp[MAX_V];\n\nvoid add_edge(int from,int to){\n G[from].push_back(to);\n rG[to].push_back(from);\n}\n\nvoid dfs(int v){\n used[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n if(!used[G[v][i]])dfs(G[v][i]);\n }\n vs.push_back(v);\n}\n\nvoid rdfs(int v,int k){\n used[v]=true;\n cmp[v]=k;\n for(int i=0;i<(int)rG[v].size();i++){\n if(!used[rG[v][i]])rdfs(rG[v][i],k);\n }\n}\n\nint scc(){\n memset(used,0,sizeof(used));\n vs.clear();\n for(int v=0;v<V;v++){\n if(!used[v])dfs(v);\n }\n memset(used,0,sizeof(used));\n int k=0;\n for(int i=(int)vs.size()-1;i>=0;i--){\n if(!used[vs[i]])rdfs(vs[i],k++);\n }\n return k;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int N,M;\n cin>>N>>M;\n rep(i,M){\n int a,b;\n cin>>a>>b;\n a--;b--;\n add_edge(a,b);\n }\n V=N;\n int K=scc();\n if(K==1){\n cout<<0<<endl;\n return 0;\n }\n\n vector<int> ideg(K,0),odeg(K,0);\n rep(i,N){\n for(int v : G[i]){\n odeg[cmp[i]]++;\n ideg[cmp[v]]++;\n }\n }\n\n int izcnt=0,ozcnt=0;\n int icmp=-1,ocmp=-1;\n rep(i,K){\n if(ideg[i]==0){\n izcnt++;\n icmp=i;\n }\n if(odeg[i]==0){\n ozcnt++;\n ocmp=i;\n }\n }\n if(izcnt>1||ozcnt>1){\n cout<<-1<<endl;\n }\n\n int source=N,sink=N+1;\n rep(i,N){\n if(cmp[i]==icmp){\n for(int v : G[i]){\n if(cmp[v]==icmp)continue;\n if(cmp[v]==ocmp){\n add_edge_f(source,sink,1);\n }else{\n add_edge_f(source,v,1);\n }\n }\n }else if(cmp[i]==ocmp){\n\n }else{\n for(int v : G[i]){\n if(cmp[v]==ocmp){\n add_edge_f(i,sink,1);\n }else{\n add_edge_f(i,v,1);\n }\n }\n }\n }\n\n int min_d = min_dist_f(source,sink);\n int max_f = max_flow(source,sink);\n if(max_f>1)cout<<min_d<<endl;\n else cout<<-1<<endl;\n\n return 0;\n}","accuracy":0.28378378378378377,"time_ms":30,"memory_kb":22692,"score_of_the_acc":-0.0434,"final_rank":20},{"submission_id":"aoj_3183_4849188","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T,class U> using P = pair<T,U>;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using vvec = vector<vec<T>>;\n\nclass strong_components{\npublic:\n\tvector<vector<int>> v,rv,nv;\n\tvector<int> rs,visited,cmp,cmp_size;\n\tvoid dfs(int n){\n\t\tvisited[n] = 1;\n\t\tfor(auto x:v[n]) if(!visited[x]) dfs(x);\n\t\trs.push_back(n);\n\t}\n\tvoid rdfs(int n,int cnt){\n\t\tvisited[n] = 1;\n\t\tcmp[n] = cnt;\n\t\tfor(auto x:rv[n]) if(!visited[x]) rdfs(x,cnt);\n\t}\n\tstrong_components(int N,vector<vector<int>>& graph){\n\t\tv = graph;\n\t\trv = vector<vector<int>>(N);\n\t\tvisited = cmp = cmp_size = vector<int>(N,0);\n\t\tfor(int i=0;i<N;i++) for(auto x:v[i]) rv[x].push_back(i);\n\t\tfor(int i=0;i<N;i++) if(!visited[i]) dfs(i);\n\t\tfor(int i=0;i<N;i++) visited[i] = 0;\n\t\tint now = 0;\n\t\tfor(int i=rs.size()-1;i>=0;i--) if(!visited[rs[i]]) rdfs(rs[i],now++);\n\t\tnv = vector<vector<int>>(now);\n\t\tfor(int i=0;i<N;i++){\n\t\t\tfor(auto x:v[i]){\n\t\t\t\tif(cmp[i]!=cmp[x]){\n\t\t\t\t\tnv[cmp[i]].push_back(cmp[x]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<N;i++) cmp_size[cmp[i]]++;\n\t}\n\tint find(int n){return cmp[n];}\n\tint size(int n){return cmp_size[cmp[n]];}\n\tbool is_same_group(int a,int b){return cmp[a]==cmp[b];}\n};\n\nconstexpr int inf = 1e9;\nclass network_flow{\nprivate:\n\tstruct edge{int to, cap, rev;};\n\tvector<vector<edge>> G;\n\tvector<bool> used;\npublic:\n\tnetwork_flow(int N){\n\t\tG = vector<vector<edge>>(N+1);\n\t\tused = vector<bool>(N+1,0); \n\t}\n\tvoid add_edge(int from, int to, int cap){\n\t\tG[from].push_back((edge){to,cap,(int) G[to].size()});\n\t\tG[to].push_back((edge){from,0,(int) G[from].size()-1});\n\t}\n\tint dfs(int v,int t,int f){\n\t\tif(v==t) return f;\n\t\tused[v] = true;\n\t\tfor(int i=0;i<G[v].size();i++){\n\t\t\tedge &e = G[v][i];\n\t\t\tif(!used[e.to] && e.cap>0){\n\t\t\t\tint d = dfs(e.to,t,min(f,e.cap));\n\t\t\t\tif(d>0){\n\t\t\t\t\te.cap -= d;\n\t\t\t\t\tG[e.to][e.rev].cap += d;\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\tint max_flow(int s,int t){\n\t\tint flow = 0;\n\t\tfor(;;){\n\t\t\tif(flow>1) return flow;\n\t\t\tfor(int i=0;i<(int)used.size();i++) used[i] = 0;\n\t\t\tint f = dfs(s,t,inf);\n\t\t\tif(f==0) return flow;\n\t\t\tflow += f;\n\t\t}\n\t}\n};\n\nint main(){\n\tint N,M;\n\tcin >> N >> M;\n\tvvec<int> g(N);\n\tfor(int i=0;i<M;i++){\n\t\tint a,b;\n\t\tcin >> a >> b;\n\t\ta--; b--;\n\t\tg[a].push_back(b);\n\t}\n\tstrong_components SCC(N,g);\n\tvvec<int> cmp_g = SCC.nv;\n\tint n = cmp_g.size();\n\tif(n==1){\n\t\tcout << 0 << \"\\n\";\n\t\treturn 0;\n\t}\n\tvec<int> indeg(n);\n\tint c = 0,t = 0;\n\tfor(int i=0;i<n;i++){\n\t\tif(cmp_g[i].size()==0){\n\t\t\tt = i;\n\t\t\tc++;\n\t\t}\n\t\tfor(auto& x:cmp_g[i]) indeg[x]++;\n\t}\n\tif(c>1 || count(indeg.begin(),indeg.end(),0)>1){\n\t\tcout << -1 << \"\\n\";\n\t\treturn 0;\n\t}\n\tint s = find(indeg.begin(),indeg.end(),0)-indeg.begin();\n\tvec<int> dist(N,inf);\n\tqueue<int> Q;\n\tfor(int i=0;i<N;i++){\n\t\tif(SCC.find(i)==s){\n\t\t\tdist[i] = 0;\n\t\t\tQ.push(i);\n\t\t}\n\t}\n\twhile(!Q.empty()){\n\t\tint cur = Q.front(); Q.pop();\n\t\tfor(auto& to:g[cur]){\n\t\t\tif(dist[to]>dist[cur]+1){\n\t\t\t\tdist[to] = dist[cur]+1;\n\t\t\t\tQ.push(to);\n\t\t\t}\n\t\t}\n\t}\n\tint ans = inf;\n\tfor(int i=0;i<N;i++) if(SCC.find(i)==t) ans = min(ans,dist[i]);\n\tnetwork_flow flow(N+2);\n\tint S = N,T = N+1;\n\tfor(int i=0;i<N;i++){\n\t\tfor(auto& x:g[i]) flow.add_edge(i,x,1);\n\t\tif(SCC.find(i)==s) flow.add_edge(S,i,2);\n\t\tif(SCC.find(i)==t) flow.add_edge(i,T,2);\n\t}\n\tif(flow.max_flow(S,T)<2){\n\t\tcout << -1 << \"\\n\";\n\t}else{\n\t\tcout << ans << \"\\n\";\n\t}\n}","accuracy":1,"time_ms":70,"memory_kb":42040,"score_of_the_acc":-0.9932,"final_rank":5},{"submission_id":"aoj_3183_4849185","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T,class U> using P = pair<T,U>;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using vvec = vector<vec<T>>;\n\nclass strong_components{\npublic:\n\tvector<vector<int>> v,rv,nv;\n\tvector<int> rs,visited,cmp,cmp_size;\n\tvoid dfs(int n){\n\t\tvisited[n] = 1;\n\t\tfor(auto x:v[n]) if(!visited[x]) dfs(x);\n\t\trs.push_back(n);\n\t}\n\tvoid rdfs(int n,int cnt){\n\t\tvisited[n] = 1;\n\t\tcmp[n] = cnt;\n\t\tfor(auto x:rv[n]) if(!visited[x]) rdfs(x,cnt);\n\t}\n\tstrong_components(int N,vector<vector<int>>& graph){\n\t\tv = graph;\n\t\trv = vector<vector<int>>(N);\n\t\tvisited = cmp = cmp_size = vector<int>(N,0);\n\t\tfor(int i=0;i<N;i++) for(auto x:v[i]) rv[x].push_back(i);\n\t\tfor(int i=0;i<N;i++) if(!visited[i]) dfs(i);\n\t\tfor(int i=0;i<N;i++) visited[i] = 0;\n\t\tint now = 0;\n\t\tfor(int i=rs.size()-1;i>=0;i--) if(!visited[rs[i]]) rdfs(rs[i],now++);\n\t\tnv = vector<vector<int>>(now);\n\t\tfor(int i=0;i<N;i++){\n\t\t\tfor(auto x:v[i]){\n\t\t\t\tif(cmp[i]!=cmp[x]){\n\t\t\t\t\tnv[cmp[i]].push_back(cmp[x]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<N;i++) cmp_size[cmp[i]]++;\n\t}\n\tint find(int n){return cmp[n];}\n\tint size(int n){return cmp_size[cmp[n]];}\n\tbool is_same_group(int a,int b){return cmp[a]==cmp[b];}\n};\n\nconstexpr int inf = 1e9;\nclass network_flow{\nprivate:\n\tstruct edge{int to, cap, rev;};\n\tvector<vector<edge>> G;\n\tvector<bool> used;\npublic:\n\tnetwork_flow(int N){\n\t\tG = vector<vector<edge>>(N+1);\n\t\tused = vector<bool>(N+1,0); \n\t}\n\tvoid add_edge(int from, int to, int cap){\n\t\tG[from].push_back((edge){to,cap,(int) G[to].size()});\n\t\tG[to].push_back((edge){from,0,(int) G[from].size()-1});\n\t}\n\tint dfs(int v,int t,int f){\n\t\tif(v==t) return f;\n\t\tused[v] = true;\n\t\tfor(int i=0;i<G[v].size();i++){\n\t\t\tedge &e = G[v][i];\n\t\t\tif(!used[e.to] && e.cap>0){\n\t\t\t\tint d = dfs(e.to,t,min(f,e.cap));\n\t\t\t\tif(d>0){\n\t\t\t\t\te.cap -= d;\n\t\t\t\t\tG[e.to][e.rev].cap += d;\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\tint max_flow(int s,int t){\n\t\tint flow = 0;\n\t\tfor(;;){\n\t\t\tif(flow>1) return flow;\n\t\t\tfor(int i=0;i<(int)used.size();i++) used[i] = 0;\n\t\t\tint f = dfs(s,t,inf);\n\t\t\tif(f==0) return flow;\n\t\t\tflow += f;\n\t\t}\n\t}\n};\n\nint main(){\n\tint N,M;\n\tcin >> N >> M;\n\tvvec<int> g(N);\n\tfor(int i=0;i<M;i++){\n\t\tint a,b;\n\t\tcin >> a >> b;\n\t\ta--; b--;\n\t\tg[a].push_back(b);\n\t}\n\tstrong_components SCC(N,g);\n\tvvec<int> cmp_g = SCC.nv;\n\tint n = cmp_g.size();\n\tif(n==1){\n\t\tcout << 0 << \"\\n\";\n\t\treturn 0;\n\t}\n\tvec<int> indeg(n);\n\tint c = 0,t = 0;\n\tfor(int i=0;i<n;i++){\n\t\tif(cmp_g[i].size()==0){\n\t\t\tt = i;\n\t\t\tc++;\n\t\t}\n\t\tfor(auto& x:cmp_g[i]) indeg[x]++;\n\t}\n\tif(c>1 || count(indeg.begin(),indeg.end(),0)>1){\n\t\tcout << -1 << \"\\n\";\n\t\treturn 0;\n\t}\n\tint s = find(indeg.begin(),indeg.end(),0)-indeg.begin();\n\tvec<int> dist(N,inf);\n\tqueue<int> Q;\n\tfor(int i=0;i<N;i++){\n\t\tif(SCC.find(i)==s){\n\t\t\tdist[i] = 0;\n\t\t\tQ.push(i);\n\t\t}\n\t}\n\twhile(!Q.empty()){\n\t\tint cur = Q.front(); Q.pop();\n\t\tfor(auto& to:g[cur]){\n\t\t\tif(dist[to]>dist[cur]+1){\n\t\t\t\tdist[to] = dist[cur]+1;\n\t\t\t\tQ.push(to);\n\t\t\t}\n\t\t}\n\t}\n\tint ans = inf;\n\tfor(int i=0;i<N;i++) if(SCC.find(i)==t) ans = min(ans,dist[i]);\n\tnetwork_flow flow(n);\n\tfor(int i=0;i<n;i++){\n\t\tfor(auto& x:cmp_g[i]) flow.add_edge(i,x,1);\n\t}\n\tif(flow.max_flow(s,t)<2){\n\t\tcout << -1 << \"\\n\";\n\t}else{\n\t\tcout << ans << \"\\n\";\n\t}\n}","accuracy":0.35135135135135137,"time_ms":50,"memory_kb":25896,"score_of_the_acc":-0.2898,"final_rank":19},{"submission_id":"aoj_3183_4847727","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acos(-1.0);\n\n\nstruct graph {\nprivate:\n\tint n;\n\tvector<vector<int>> G, rG;\n\tvector<bool> used;\n\tvector<int> vs;\n\n\tint mk;\n\tvector<vector<int>> fG;\n\tvector<vector<int>> ori;\n\tvector<int> trans;\npublic:\n\tgraph(int sz) {\n\t\tn = sz;\n\t\tG.resize(n);\n\t\trG.resize(n);\n\t\tused.resize(n);\n\n\t\tfG.resize(n);\n\t\ttrans.resize(n, -1);\n\t\tori.resize(n);\n\t}\n\tvoid add_edge(int a, int b) {\n\t\tG[a].push_back(b);\n\t\trG[b].push_back(a);\n\t}\n\tvoid dfs(int v) {\n\t\tused[v] = true;\n\t\trep(i, G[v].size()) {\n\t\t\tif (!used[G[v][i]])dfs(G[v][i]);\n\t\t}\n\t\tvs.push_back(v);\n\t}\n\tvoid rdfs(int v, int k) {\n\t\tused[v] = true;\n\t\tqueue<int> q; q.push(v);\n\t\tvector<int> c;\n\t\twhile (!q.empty()) {\n\t\t\tint id = q.front(); q.pop();\n\t\t\tori[k].push_back(id);\n\t\t\trep(j, rG[id].size()) {\n\t\t\t\tint to = rG[id][j];\n\t\t\t\tif (used[to]) {\n\t\t\t\t\tif (trans[to] >= 0)c.push_back(trans[to]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tused[to] = true; q.push(to);\n\t\t\t}\n\t\t}\n\t\tsort(c.begin(), c.end());\n\t\tint len = unique(c.begin(), c.end()) - c.begin();\n\t\trep(i, len) {\n\t\t\tfG[c[i]].push_back(k);\n\t\t}\n\t\trep(i, ori[k].size()) {\n\t\t\ttrans[ori[k][i]] = k;\n\t\t}\n\t}\n\tvoid scc() {\n\t\tfill(used.begin(), used.end(), false);\n\t\trep(i, n) {\n\t\t\tif (!used[i])dfs(i);\n\t\t}\n\t\tfill(used.begin(), used.end(), false);\n\t\tint k = 0;\n\t\tper(i, (int)vs.size()) {\n\t\t\tif (!used[vs[i]]) {\n\t\t\t\trdfs(vs[i], k); k++;\n\t\t\t}\n\t\t}\n\t\tmk = k;\n\t}\n\tvoid query() {\n\t\tif (mk == 1) {\n\t\t\tcout << 0 << \"\\n\"; return;\n\t\t}\n\t\tvector<int> cnt(mk);\n\t\trep(i, mk)for (int to : fG[i])cnt[to]++;\n\t\tvector<int> sta, goa;\n\t\trep(i, mk) {\n\t\t\tif (fG[i].empty())goa.push_back(i);\n\t\t\tif (cnt[i] == 0)sta.push_back(i);\n\t\t}\n\t\tif (sta.size() > 1 || goa.size() > 1) {\n\t\t\tcout << -1 << \"\\n\"; return;\n\t\t}\n\t\tvector<int> pre(n);\n\t\tvector<int> dist(n, mod);\n\t\tqueue<int> q;\n\t\tfor (int id : ori[sta[0]]) {\n\t\t\tdist[id] = 0; pre[id] = -1;\n\t\t\tq.push(id);\n\t\t}\n\t\twhile (!q.empty()) {\n\t\t\tint v = q.front(); q.pop();\n\t\t\tfor (int to : G[v]) {\n\t\t\t\tif (dist[v] + 1 < dist[to]) {\n\t\t\t\t\tdist[to] = dist[v] + 1;\n\t\t\t\t\tpre[to] = v;\n\t\t\t\t\tq.push(to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<vector<int>> g(n);\n\t\tvector<int> ban(n,-1);\n\t\tint ans = mod;\n\t\tint las = 0;\n\t\tfor (int id : ori[goa[0]]) {\n\t\t\tif (ans > dist[id]) {\n\t\t\t\tans = dist[id]; las = id;\n\t\t\t}\n\t\t}\n\t\twhile (pre[las]>= 0) {\n\t\t\tint p = pre[las];\n\t\t\tg[las].push_back(p);\n\t\t\tban[p] = las;\n\t\t\tlas = p;\n\t\t}\n\t\trep(i, n)for (int to : G[i])if (ban[i] != to) {\n\t\t\tg[i].push_back(to);\n\t\t}\n\t\tvector<bool> exi(n, false);\n\t\tq.push(las);\n\t\twhile (!q.empty()) {\n\t\t\tint v = q.front(); q.pop();\n\t\t\tfor (int to : g[v])if (!exi[to]) {\n\t\t\t\texi[to] = true;\n\t\t\t\tq.push(to);\n\t\t\t}\n\t\t}\n\t\trep(i, n)if (!exi[i]) {\n\t\t\tcout << -1 << \"\\n\"; return;\n\t\t}\n\t\tcout << ans << \"\\n\";\n\t}\n};\n\n\nvoid solve() {\n\tint n, m; cin >> n >> m;\n\tgraph g(n);\n\trep(i, m) {\n\t\tint a, b; cin >> a >> b; a--; b--;\n\t\tg.add_edge(a, b);\n\t}\n\n\tg.scc();\n\tg.query();\n}\n\n\n\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":33484,"score_of_the_acc":-0.8911,"final_rank":3},{"submission_id":"aoj_3183_4847565","code_snippet":"#line 1 \"other/l2.cpp\"\n#include <bits/extc++.h>\n\n#line 5 \"Library/config.hpp\"\nnamespace config {\nconst auto start_time{std::chrono::system_clock::now()};\nint64_t elapsed() {\n using namespace std::chrono;\n const auto end_time{system_clock::now()};\n return duration_cast<milliseconds>(end_time - start_time).count();\n}\n__attribute__((constructor)) void setup() {\n using namespace std;\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n#ifdef _buffer_check\n atexit([] {\n char bufc;\n if (cin >> bufc)\n cerr << \"\\n\\033[43m\\033[30mwarning: buffer not empty.\\033[0m\\n\\n\";\n });\n#endif\n}\nunsigned cases(void), caseid = 1;\ntemplate <class C> void main() {\n for (const unsigned total = cases(); caseid <= total; ++caseid) C();\n}\n} // namespace config\n#line 3 \"Library/gcc_builtin.hpp\"\nnamespace workspace {\nconstexpr int clz32(const uint32_t &n) noexcept { return __builtin_clz(n); }\nconstexpr int clz64(const uint64_t &n) noexcept{ return __builtin_clzll(n); }\nconstexpr int ctz(const uint64_t &n) noexcept { return __builtin_ctzll(n); }\nconstexpr int popcnt(const uint64_t &n) noexcept { return __builtin_popcountll(n); }\n} // namespace workspace\n#line 2 \"Library/gcc_option.hpp\"\n#ifdef ONLINE_JUDGE\n #pragma GCC optimize(\"O3\")\n #pragma GCC target(\"avx,avx2\")\n #pragma GCC optimize(\"unroll-loops\")\n#endif\n#line 5 \"Library/utils/binary_search.hpp\"\nnamespace workspace {\n// binary search on discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\n iter_type>\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\n assert(ok != ng);\n __int128_t dist(ng - ok);\n while (dist > 1 || dist < -1) {\n iter_type mid(ok + dist / 2);\n if (pred(mid))\n ok = mid, dist -= dist / 2;\n else\n ng = mid, dist /= 2;\n }\n return ok;\n}\n// parallel binary search on discrete range.\ntemplate <class iter_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\n std::vector<bool>>,\n std::vector<iter_type>>\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\n pred_type pred) {\n std::vector<iter_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n iter_type mid(ok + (ng - ok) / 2);\n if (mids[i] != mid) {\n all_found = false;\n mids[i] = mid;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n// binary search on real numbers.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\n real_type>\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\n assert(ok != ng);\n while (ok + eps < ng || ng + eps < ok) {\n real_type mid{(ok + ng) / 2};\n (pred(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n// parallel binary search on real numbers.\ntemplate <class real_type, class pred_type>\nstd::enable_if_t<std::is_convertible_v<\n std::invoke_result_t<pred_type, std::vector<real_type>>,\n std::vector<bool>>,\n std::vector<real_type>>\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\n const real_type eps, pred_type pred) {\n std::vector<real_type> mids(ends.size());\n for (;;) {\n bool all_found = true;\n for (size_t i{}; i != ends.size(); ++i) {\n auto [ok, ng] = ends[i];\n if (ok + eps < ng || ng + eps < ok) {\n all_found = false;\n mids[i] = (ok + ng) / 2;\n }\n }\n if (all_found) break;\n auto res = pred(mids);\n for (size_t i{}; i != ends.size(); ++i) {\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\n }\n }\n return mids;\n}\n} // namespace workspace\n#line 3 \"Library/utils/casefmt.hpp\"\nnamespace workspace {\nstd::ostream &casefmt(std::ostream& os) { return os << \"Case #\" << config::caseid << \": \"; }\n} // namespace workspace\n#line 3 \"Library/utils/chval.hpp\"\nnamespace workspace {\ntemplate <class T, class Comp = std::less<T>> bool chle(T &x, const T &y, Comp comp = Comp()) { return comp(y, x) ? x = y, true : false; }\ntemplate <class T, class Comp = std::less<T>> bool chge(T &x, const T &y, Comp comp = Comp()) { return comp(x, y) ? x = y, true : false; }\n} // namespace workspace\n#line 3 \"Library/utils/fixed_point.hpp\"\nnamespace workspace {\n// specify the return type of lambda.\ntemplate <class lambda_type>\nclass fixed_point\n{\n lambda_type func;\npublic:\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\n template <class... Args> auto operator()(Args &&... args) const { return func(*this, std::forward<Args>(args)...); }\n};\n} // namespace workspace\n#line 3 \"Library/utils/sfinae.hpp\"\n#include <type_traits>\n\ntemplate <class type, template <class> class trait>\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\n\ntemplate <class Container>\nusing element_type = typename std::decay<decltype(\n *std::begin(std::declval<Container&>()))>::type;\n\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\ntemplate <class T>\nstruct is_integral_ext<\n T, typename std::enable_if<std::is_integral<T>::value>::type>\n : std::true_type {};\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\n#if __cplusplus >= 201402\ntemplate <class T>\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\n#endif\n\ntemplate <typename T, typename = void> struct multiplicable_uint {\n using type = uint_least32_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\n using type = uint_least64_t;\n};\ntemplate <typename T>\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\n using type = __uint128_t;\n};\n#line 7 \"Library/utils/hash.hpp\"\nnamespace workspace {\ntemplate <class T, class = void>\nstruct hash : std::hash<T> {};\ntemplate <class Unique_bits_type>\nstruct hash<Unique_bits_type, enable_if_trait_type<Unique_bits_type, std::has_unique_object_representations>>\n{\n size_t operator()(uint64_t x) const\n {\n static const uint64_t m = std::random_device{}();\n x ^= x >> 23;\n // x *= 0x2127599bf4325c37ULL;\n x ^= m;\n x ^= x >> 47;\n return x - (x >> 32);\n }\n};\ntemplate <class Key>\nsize_t hash_combine(const size_t &seed, const Key &key)\n{\n return seed ^ (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */ );\n}\ntemplate <class T1, class T2>\nstruct hash<std::pair<T1, T2>>\n{\n size_t operator()(const std::pair<T1, T2> &pair) const\n {\n return hash_combine(hash<T1>()(pair.first), pair.second);\n }\n};\ntemplate <class... T>\nclass hash<std::tuple<T...>>\n{\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1> struct tuple_hash { static uint64_t apply(const Tuple &t) { return hash_combine(tuple_hash<Tuple, index - 1>::apply(t), std::get<index>(t)); } };\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> { static uint64_t apply(const Tuple &t) { return 0; } };\npublic:\n uint64_t operator()(const std::tuple<T...> &t) const { return tuple_hash<std::tuple<T...>>::apply(t); }\n};\ntemplate <class hash_table>\nstruct hash_table_wrapper : hash_table\n{\n using key_type = typename hash_table::key_type;\n size_t count(const key_type &key) const { return hash_table::find(key) != hash_table::end(); }\n template <class... Args> auto emplace(Args&&... args) { return hash_table::insert(typename hash_table::value_type(args...)); }\n};\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing cc_hash_table = hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\nusing gp_hash_table = hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\ntemplate <class Key, class Mapped>\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\ntemplate <class Key>\nusing unordered_set = std::unordered_set<Key, hash<Key>>;\n} // namespace workspace\n#line 3 \"Library/utils/make_vector.hpp\"\nnamespace workspace {\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\n if constexpr (N)\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\n else\n return init;\n}\ntemplate <typename T, size_t N>\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\n return make_vector<T, N>((size_t*)sizes, init);\n}\n} // namespace workspace\n#line 3 \"Library/utils/read.hpp\"\nnamespace workspace {\n// read with std::cin.\ntemplate <class T = void>\nstruct read\n{\n typename std::remove_const<T>::type value;\n template <class... types>\n read(types... args) : value(args...) { std::cin >> value; }\n operator T() const { return value; }\n};\ntemplate <>\nstruct read<void>\n{\n template <class T>\n operator T() const { T value; std::cin >> value; return value; }\n};\n} // namespace workspace\n#line 4 \"Library/utils/stream.hpp\"\n\n#line 6 \"Library/utils/stream.hpp\"\nnamespace std {\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ' ' << p.second;\n}\ntemplate <class tuple_t, size_t index> struct tuple_is {\n static istream &apply(istream &is, tuple_t &t) {\n tuple_is<tuple_t, index - 1>::apply(is, t);\n return is >> get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\n static istream &apply(istream &is, tuple_t &t) { return is; }\n};\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\n t);\n}\ntemplate <class tuple_t, size_t index> struct tuple_os {\n static ostream &apply(ostream &os, const tuple_t &t) {\n tuple_os<tuple_t, index - 1>::apply(os, t);\n return os << ' ' << get<index>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\n static ostream &apply(ostream &os, const tuple_t &t) {\n return os << get<0>(t);\n }\n};\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\n};\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\n t);\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n istream &>::type\noperator>>(istream &is, Container &cont) {\n for (auto &&e : cont) is >> e;\n return is;\n}\ntemplate <class Container, typename Value = element_type<Container>>\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\n !is_same<typename decay<Container>::type, char *>::value,\n ostream &>::type\noperator<<(ostream &os, const Container &cont) {\n bool head = true;\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\n return os;\n}\n} // namespace std\n#line 14 \"other/l2.cpp\"\nnamespace workspace {\nconstexpr char eol = '\\n';\nusing namespace std;\nusing i32 = int_least32_t;\nusing i64 = int_least64_t;\nusing i128 = __int128_t;\nusing u32 = uint_least32_t;\nusing u64 = uint_least64_t;\nusing u128 = __uint128_t;\ntemplate <class T, class Comp = std::less<T>>\nusing priority_queue = std::priority_queue<T, std::vector<T>, Comp>;\ntemplate <class T> using stack = std::stack<T, std::vector<T>>;\nstruct solver;\n} // namespace workspace\nint main() { config::main<workspace::solver>(); }\nunsigned config::cases() {\n // return -1; // not specified\n // int t; std::cin >> t; return t; // given\n return 1;\n}\n\n#line 4 \"Library/graph/directed/flow/base.hpp\"\n// the base class of flow algorithms.\ntemplate <class cap_t, class cost_t> struct flow_base {\n struct edge_t {\n size_t src, dst;\n cap_t cap;\n cost_t cost;\n edge_t *rev;\n edge_t() = default;\n edge_t(size_t src, size_t dst, cap_t cap, edge_t *rev)\n : src(src), dst(dst), cap(cap), rev(rev) {}\n edge_t(size_t src, size_t dst, cap_t cap, cost_t cost, edge_t *rev)\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\n void flow(cap_t f) { cap -= f, rev->cap += f; }\n bool avbl() const { return cap > 0; }\n }; // class edge_t\n\n class adj_type {\n edge_t *fst, *lst, *clst;\n\n public:\n template <class... Args> edge_t *emplace(Args &&... args) {\n if (lst == clst) {\n size_t len(clst - fst);\n edge_t *nfst = lst = new edge_t[len << 1];\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\n p->rev->rev = lst, *lst = *p;\n delete[] fst;\n fst = nfst;\n clst = lst + len;\n }\n *lst = edge_t(args...);\n return lst++;\n }\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\n ~adj_type() { delete[] fst; }\n edge_t &operator[](size_t i) {\n assert(i < size());\n return *(fst + i);\n }\n size_t size() const { return lst - fst; }\n edge_t *begin() const { return fst; }\n edge_t *end() const { return lst; }\n }; // class adj_type\n\n flow_base(size_t n = 0) : adjs(n) {}\n\n flow_base(const flow_base &other) : adjs(other.size()) {\n for (size_t node{}; node != size(); ++node)\n for (const auto &[src, dst, cap, cost, rev] : other[node])\n if (src == node) {\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\n rev->src = -1;\n } else {\n rev->rev->src = node;\n }\n }\n\n flow_base &operator=(const flow_base &rhs) {\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\n return *this;\n }\n\n size_t size() const { return adjs.size(); }\n\n adj_type &operator[](size_t node) {\n assert(node < size());\n return adjs[node];\n }\n const adj_type &operator[](size_t node) const {\n assert(node < size());\n return adjs[node];\n }\n\n virtual void add_edge(size_t src, size_t dst, cap_t cap, cost_t cost) {\n assert(src < size());\n assert(dst < size());\n if (!(cap > 0) || src == dst) return;\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\n }\n\n protected:\n std::vector<adj_type> adjs;\n}; // class flow_base\n#line 36 \"other/l2.cpp\"\n\ntemplate <class cap_t = int> class Dinic : public flow_base<cap_t, bool> {\n using base = flow_base<cap_t, bool>;\n using edge_t = typename base::edge_t;\n using base::adjs;\n\n std::vector<size_t> level;\n std::vector<edge_t *> itr;\n constexpr static size_t level_infty = -1;\n\n cap_t dfs(const size_t &src, const size_t &dst, cap_t bound) {\n if (src == dst || bound == 0) return bound;\n cap_t flow(0);\n for (edge_t *&e{itr[dst]}; e != adjs[dst].end(); ++e)\n if (e->rev->avbl() && level[e->dst] < level[dst])\n if (cap_t achv = dfs(src, e->dst, std::min(bound, e->rev->cap));\n achv > 0) {\n e->rev->flow(achv);\n flow += achv, bound -= achv;\n if (bound == 0) break;\n }\n return flow;\n }\n\n public:\n using base::size;\n\n Dinic(size_t n = 0) : base::flow_base(n), level(n, level_infty), itr(n) {}\n\n Dinic(const Dinic &other)\n : base::flow_base(other), level(other.level), itr(other.itr) {}\n\n Dinic &operator=(const Dinic &rhs) {\n if (this != &rhs) base::operator=(rhs), level = rhs.level, itr = rhs.itr;\n return *this;\n }\n\n void add_edge(size_t src, size_t dst, cap_t cap) {\n base::add_edge(src, dst, cap, false);\n }\n\n void add_undirected_edge(size_t src, size_t dst, cap_t cap) {\n base::add_undirected_edge(src, dst, cap, false);\n }\n\n int ans = -1, loop = 0;\n\n cap_t max_flow(size_t src, size_t dst) {\n assert(src < size());\n assert(dst < size());\n cap_t flow(0), bound(0);\n for (const edge_t &e : adjs[src]) bound += e.cap;\n for (std::vector<size_t> que(size());;\n std::fill(level.begin(), level.end(), level_infty)) {\n level[que.front() = src] = 0;\n for (auto ql{que.begin()}, qr{std::next(ql)};\n level[dst] == level_infty && ql != qr; ++ql)\n for (const edge_t &e : adjs[*ql])\n if (e.avbl() && level[e.dst] == level_infty)\n level[ *qr++ = e.dst] = level[*ql] + 1;\n if (level[dst] == level_infty) break;\n for (size_t node{}; node != size(); ++node)\n itr[node] = adjs[node].begin();\n flow += dfs(src, dst, bound);\n if (ans < 0 || (int)level[dst] < ans) ans = level[dst];\n loop++;\n }\n return flow;\n }\n}; // class Dinic\n\n#line 5 \"Library/graph/directed/strongly_connected_components.hpp\"\nstruct strongly_connected_components {\n strongly_connected_components(size_t n) : graph(n), low(n), made() {}\n\n // add an edge from the vertex s to the vertex t.\n void add_edge(size_t src, size_t dst) {\n assert(src < size());\n assert(dst < size());\n graph[src].emplace_back(dst);\n made = false;\n }\n\n // the number of the components.\n size_t count() {\n make();\n return comp_cnt;\n }\n\n size_t size() const { return graph.size(); }\n\n // the component which the vertex v belongs to.\n size_t operator[](size_t v) {\n make();\n return low[v];\n }\n\n // the directed acyclic graph consisting of the components.\n const std::vector<std::vector<size_t>> &shrinked_dag() {\n make();\n return dag;\n }\n\n protected:\n std::vector<std::vector<size_t>> graph, dag;\n std::vector<size_t> low;\n size_t comp_cnt;\n bool made;\n\n void make() {\n if (made) return;\n made = true, comp_cnt = 0;\n low.assign(size(), 0);\n size_t *itr = new size_t[size()];\n bool *const used = new bool[size()];\n for (size_t v{}, c{}; v != size(); ++v) affix(v, c, itr, used + size());\n delete[] itr;\n delete[] used;\n for (auto &e : low) e += comp_cnt;\n reverse(begin(dag), end(dag));\n for (auto &arcs : dag)\n for (auto &to : arcs) to += comp_cnt;\n }\n\n size_t affix(size_t src, size_t &c, size_t *&itr, bool *used) {\n if (low[src]) return low[src];\n size_t idx = ++c;\n low[src] = idx;\n *itr++ = src;\n for (size_t dst : graph[src])\n low[src] = std::min(low[src], affix(dst, c, itr, used));\n if (low[src] == idx) {\n ++comp_cnt;\n used[-comp_cnt] = true;\n dag.emplace_back(0);\n auto srcp = itr;\n do {\n low[*--srcp] = -comp_cnt;\n } while (*srcp != src);\n while (itr != srcp) {\n auto now = *--itr;\n for (auto to : graph[now]) {\n if (!used[(int)low[to]]) {\n dag.back().emplace_back(low[to]);\n used[(int)low[to]] = true;\n }\n }\n }\n for (int c : dag.back()) used[c] = false;\n used[-comp_cnt] = false;\n return idx;\n }\n return low[src];\n }\n}; // class strongly_connected_components\n#line 108 \"other/l2.cpp\"\n\nstruct workspace::solver {\n solver() {\n // start here!\n int n, m;\n cin >> n >> m;\n Dinic<int> dinic(n + 2);\n strongly_connected_components scc(n);\n for (int i = 0; i < m; i++) {\n int a, b;\n cin >> a >> b;\n --a, --b;\n scc.add_edge(a, b);\n dinic.add_edge(a, b, 1);\n }\n\n const auto &dag = scc.shrinked_dag();\n const int cn = dag.size();\n vector<int> ind(cn), oud(cn);\n int src = -1, dst = -1;\n for (int i = 0; i < cn; i++) {\n if (dag[i].empty()) {\n if (~dst) {\n cout << -1 << eol;\n return;\n }\n dst = i;\n }\n for (int j : dag[i]) ind[j]++;\n }\n for (int i = 0; i < cn; i++) {\n if (!ind[i]) {\n if (~src) {\n cout << -1 << eol;\n return;\n }\n src = i;\n }\n }\n\n if (scc.count() == 1) {\n cout << \"0\\n\";\n return;\n }\n\n const int fsrc = n + 1, fdst = n;\n for (int i = 0; i < n; i++) {\n if (scc[i] == src) {\n dinic.add_edge(fsrc, i, 2);\n } else if (scc[i] == dst) {\n dinic.add_edge(i, fdst, 2);\n }\n }\n\n if (dinic.max_flow(fsrc, fdst) < 2) {\n cout << \"-1\\n\";\n } else {\n cout << dinic.ans - 2 << eol;\n }\n }\n};","accuracy":1,"time_ms":50,"memory_kb":34532,"score_of_the_acc":-0.5948,"final_rank":2},{"submission_id":"aoj_3183_4846707","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n// arg : S, state : T, ret : U\n// void pre(int id, S &arg, T &state)\n// pair<int, S> in(int id, int prechild, U ret, S &arg, T &state)\n// U post(int id, S &arg, T &state)\ntemplate <typename S, typename T, typename U>\nU non_rec_dfs(int n, int start, S start_arg, function<void(int, S &, T &)> pre,\n function<pair<int, S>(int, int, U, S &, T &)> in,\n function<U(int, S &, T &)> post) {\n stack<pair<int, int>> st;\n vector<int> prech(n, -1);\n vector<S> arg(n);\n vector<T> state(n);\n vector<U> ret(n);\n st.emplace(start, 0);\n arg[start] = start_arg;\n while (!st.empty()) {\n auto p = st.top();\n int now = p.first;\n int mode = p.second;\n st.pop();\n if (mode == 0) {\n pre(now, arg[now], state[now]);\n st.emplace(now, 1);\n } else if (mode == 1) {\n pair<int, S> call =\n in(now, prech[now], ret[prech[now]], arg[now], state[now]);\n int nxt = call.first;\n arg[nxt] = call.second;\n if (nxt != -1) {\n prech[now] = nxt;\n st.emplace(now, 1);\n st.emplace(nxt, 0);\n } else {\n st.emplace(now, 2);\n }\n } else {\n ret[now] = post(now, arg[now], state[now]);\n }\n }\n return ret[start];\n}\n\nint n, m;\nvector<vector<int>> e, re;\nvector<int> num;\n\nvoid assign(vector<vector<int>> &edge) {\n struct sta {\n int idx;\n };\n num = vector<int>(n, -2);\n int tmp = 0;\n for (int i = 0; i < n; i++) {\n if (num[i] == -2) {\n tmp = non_rec_dfs<int, sta, int>(\n n, i, tmp,\n [&](int x, int &arg, sta &state) {\n num[x] = -1;\n state.idx = 0;\n return;\n },\n [&](int x, int prech, int ret, int &arg, sta &state) {\n if (prech != -1) arg = ret;\n for (; state.idx < edge[x].size(); state.idx++) {\n if (num[edge[x][state.idx]] == -2)\n return pair<int, int>(edge[x][state.idx++], arg);\n }\n return pair<int, int>(-1, 0);\n },\n [&](int x, int &arg, sta &state) {\n num[x] = arg;\n return arg + 1;\n });\n }\n }\n}\n\nint main() {\n cin >> n >> m;\n e = re = vector<vector<int>>(n);\n for (int i = 0; i < m; i++) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n e[u].push_back(v);\n re[v].push_back(u);\n }\n\n vector<int> d(n, -1);\n\n assign(e);\n vector<int> v(n);\n iota(v.begin(), v.end(), 0);\n sort(v.begin(), v.end(),\n [&](const int &l, const int &r) { return num[l] > num[r]; });\n queue<int> q, bfs;\n int start = v[0];\n d[v[0]] = 0;\n q.push(v[0]);\n bfs.push(v[0]);\n while (!q.empty()) {\n int now = q.front();\n q.pop();\n for (auto x : re[now]) {\n if (d[x] != -1) continue;\n d[x] = 0;\n q.push(x);\n bfs.push(x);\n }\n }\n\n if (bfs.size() == n) {\n cout << 0 << endl;\n return 0;\n }\n\n assign(re);\n sort(v.begin(), v.end(),\n [&](const int &l, const int &r) { return num[l] > num[r]; });\n d[v[0]] = -2;\n q.push(v[0]);\n while (!q.empty()) {\n int now = q.front();\n q.pop();\n for (auto x : e[now]) {\n if (d[x] != -1) continue;\n d[x] = -2;\n q.push(x);\n }\n }\n\n vector<int> par(n, -1);\n int g = -1;\n while (!bfs.empty()) {\n int now = bfs.front();\n bfs.pop();\n for (auto x : e[now]) {\n if (d[x] >= 0) continue;\n par[x] = now;\n if (d[x] == -2) {\n d[x] = d[now] + 1;\n g = x;\n goto found;\n }\n d[x] = d[now] + 1;\n bfs.push(x);\n }\n }\n\n cout << -1 << endl;\n return 0;\n\nfound:;\n int ans = d[g];\n set<pair<int, int>> st;\n while (par[g] != -1) {\n st.emplace(par[g], g);\n g = par[g];\n }\n\n vector<vector<int>> ne, nre;\n ne = nre = vector<vector<int>>(n);\n for (int u = 0; u < n; u++) {\n for (auto &v : e[u]) {\n if (st.find({u, v}) == st.end()) {\n ne[u].push_back(v);\n nre[v].push_back(u);\n } else {\n ne[v].push_back(u);\n nre[u].push_back(v);\n }\n }\n }\n\n assign(ne);\n sort(v.begin(), v.end(),\n [&](const int &l, const int &r) { return num[l] > num[r]; });\n int count = 1;\n d = vector<int>(n, false);\n d[v[0]] = true;\n q.push(v[0]);\n while (!q.empty()) {\n int now = q.front();\n q.pop();\n for (auto x : nre[now]) {\n if (d[x]) continue;\n count++;\n d[x] = true;\n q.push(x);\n }\n }\n\n if (count == n)\n cout << ans << endl;\n else\n cout << -1 << endl;\n\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":31084,"score_of_the_acc":-1.3397,"final_rank":9},{"submission_id":"aoj_3183_4846588","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int mod = 1e9 + 7;\n// const int mod = 998244353;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\ntemplate< typename T = int >\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n\n Edge() = default;\n\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\n\n operator int() const { return to; }\n};\n\ntemplate< typename T = int >\nstruct Graph {\n vector< vector< Edge< T > > > g;\n int es;\n\n Graph() = default;\n\n explicit Graph(int n) : g(n), es(0) {}\n\n size_t size() const {\n return g.size();\n }\n\n void add_directed_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es++);\n }\n\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a += padding;\n b += padding;\n T c = T(1);\n if(weighted) cin >> c;\n if(directed) add_directed_edge(a, b, c);\n else add_edge(a, b, c);\n }\n }\n};\n\ntemplate< typename T = int >\nusing Edges = vector< Edge< T > >;\n\n/**\n * @brief Strongly-Connected-Components(強連結成分分解)\n */\ntemplate< typename T = int >\nstruct StronglyConnectedComponents : Graph< T > {\npublic:\n using Graph< T >::Graph;\n using Graph< T >::g;\n vector< int > comp;\n Graph< T > dag;\n vector< vector< int > > group;\n\n void build() {\n rg = Graph< T >(g.size());\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n rg.add_directed_edge(e.to, e.from, e.cost);\n }\n }\n comp.assign(g.size(), -1);\n used.assign(g.size(), 0);\n for(int i = 0; i < g.size(); i++) dfs(i);\n reverse(begin(order), end(order));\n int ptr = 0;\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\n dag = Graph< T >(ptr);\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n int x = comp[e.from], y = comp[e.to];\n if(x == y) continue;\n dag.add_directed_edge(x, y, e.cost);\n }\n }\n group.resize(ptr);\n for(int i = 0; i < g.size(); i++) {\n group[comp[i]].emplace_back(i);\n }\n }\n\n int operator[](int k) const {\n return comp[k];\n }\n\nprivate:\n vector< int > order, used;\n Graph< T > rg;\n\n void dfs(int idx) {\n if(exchange(used[idx], true)) return;\n for(auto &to : g[idx]) dfs(to);\n order.push_back(idx);\n }\n\n void rdfs(int idx, int cnt) {\n if(comp[idx] != -1) return;\n comp[idx] = cnt;\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\n }\n};\n\n\n/**\n * @brief Ford-Fulkerson(最大流)\n * @docs docs/ford-fulkerson.md\n */\ntemplate< typename flow_t >\nstruct FordFulkerson {\n struct edge {\n int to;\n flow_t cap;\n int rev;\n bool isrev;\n int idx;\n };\n\n vector< vector< edge > > graph;\n vector< int > used;\n const flow_t INF;\n int timestamp;\n\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\n\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\n }\n\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\n if(idx == t) return flow;\n used[idx] = timestamp;\n for(auto &e : graph[idx]) {\n if(e.cap > 0 && used[e.to] != timestamp) {\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\n if(d > 0) {\n e.cap -= d;\n graph[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\n flow += f;\n if(flow >= 2) break;\n }\n return flow;\n }\n\n void output() {\n for(int i = 0; i < graph.size(); i++) {\n for(auto &e : graph[i]) {\n if(e.isrev) continue;\n auto &rev_e = graph[e.to][e.rev];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n }\n};\n\n/**\n * @brief Dijkstra(単一始点最短路)\n * @docs docs/dijkstra.md\n */\ntemplate< typename T >\nstruct ShortestPath {\n vector< T > dist;\n vector< int > from, id;\n};\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector< int > A(M), B(M);\n Graph<> rg(N);\n StronglyConnectedComponents<> scc(N);\n for(int i = 0; i < M; i++) {\n cin >> A[i] >> B[i];\n --A[i], --B[i];\n scc.add_directed_edge(A[i], B[i]);\n rg.add_directed_edge(B[i], A[i]);\n }\n scc.build();\n if(scc.dag.size() == 1) {\n cout << 0 << \"\\n\";\n exit(0);\n }\n vector< int > in(N), out(N);\n for(int i = 0; i < scc.dag.size(); i++) {\n if(scc.dag.g[i].size()) {\n in[i] = true;\n }\n for(auto &t : scc.dag.g[i]) {\n out[t] = true;\n }\n }\n\n vector< int > latte, malta;\n for(int i = 0; i < scc.dag.size(); i++) {\n if(!in[i]) {\n latte.emplace_back(i);\n }\n if(!out[i]) {\n malta.emplace_back(i);\n }\n }\n if(latte.size() != 1 && malta.size() != 1) {\n cout << -1 << \"\\n\";\n exit(0);\n }\n\n\n FordFulkerson< int > flow(N + 2);\n for(int i = 0; i < M; i++) {\n flow.add_edge(A[i], B[i], 1);\n }\n for(auto &p : scc.group[malta[0]]) {\n flow.add_edge(N, p, inf);\n }\n for(auto &p : scc.group[latte[0]]) {\n flow.add_edge(p, N + 1, inf);\n }\n if(flow.max_flow(N, N + 1) <= 1) {\n cout << \"-1\\n\";\n exit(0);\n }\n\n\n using T = int;\n const auto INF = numeric_limits< T >::max();\n vector< T > dist(scc.size(), INF);\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\n using Pi = pair< T, int >;\n priority_queue< Pi, vector< Pi >, greater<> > que;\n for(auto &p : scc.group[latte[0]]) {\n dist[p] = 0;\n que.emplace(0, p);\n }\n while(!que.empty()) {\n T cost;\n int idx;\n tie(cost, idx) = que.top();\n que.pop();\n if(dist[idx] < cost) continue;\n for(auto &e : rg.g[idx]) {\n auto next_cost = cost + e.cost;\n if(dist[e.to] <= next_cost) continue;\n dist[e.to] = next_cost;\n from[e.to] = idx;\n id[e.to] = e.idx;\n que.emplace(dist[e.to], e.to);\n }\n }\n int ans = inf;\n for(auto &p : scc.group[malta[0]]) {\n chmin(ans, dist[p]);\n }\n if(ans >= inf) ans = -1;\n cout << ans << \"\\n\";\n}","accuracy":1,"time_ms":70,"memory_kb":46852,"score_of_the_acc":-1.1631,"final_rank":6},{"submission_id":"aoj_3183_4846582","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int mod = 1e9 + 7;\n// const int mod = 998244353;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\ntemplate< typename T = int >\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n\n Edge() = default;\n\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\n\n operator int() const { return to; }\n};\n\ntemplate< typename T = int >\nstruct Graph {\n vector< vector< Edge< T > > > g;\n int es;\n\n Graph() = default;\n\n explicit Graph(int n) : g(n), es(0) {}\n\n size_t size() const {\n return g.size();\n }\n\n void add_directed_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es++);\n }\n\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a += padding;\n b += padding;\n T c = T(1);\n if(weighted) cin >> c;\n if(directed) add_directed_edge(a, b, c);\n else add_edge(a, b, c);\n }\n }\n};\n\ntemplate< typename T = int >\nusing Edges = vector< Edge< T > >;\n\n/**\n * @brief Strongly-Connected-Components(強連結成分分解)\n */\ntemplate< typename T = int >\nstruct StronglyConnectedComponents : Graph< T > {\npublic:\n using Graph< T >::Graph;\n using Graph< T >::g;\n vector< int > comp;\n Graph< T > dag;\n vector< vector< int > > group;\n\n void build() {\n rg = Graph< T >(g.size());\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n rg.add_directed_edge(e.to, e.from, e.cost);\n }\n }\n comp.assign(g.size(), -1);\n used.assign(g.size(), 0);\n for(int i = 0; i < g.size(); i++) dfs(i);\n reverse(begin(order), end(order));\n int ptr = 0;\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\n dag = Graph< T >(ptr);\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n int x = comp[e.from], y = comp[e.to];\n if(x == y) continue;\n dag.add_directed_edge(x, y, e.cost);\n }\n }\n group.resize(ptr);\n for(int i = 0; i < g.size(); i++) {\n group[comp[i]].emplace_back(i);\n }\n }\n\n int operator[](int k) const {\n return comp[k];\n }\n\nprivate:\n vector< int > order, used;\n Graph< T > rg;\n\n void dfs(int idx) {\n if(exchange(used[idx], true)) return;\n for(auto &to : g[idx]) dfs(to);\n order.push_back(idx);\n }\n\n void rdfs(int idx, int cnt) {\n if(comp[idx] != -1) return;\n comp[idx] = cnt;\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\n }\n};\n\n\n/**\n * @brief Ford-Fulkerson(最大流)\n * @docs docs/ford-fulkerson.md\n */\ntemplate< typename flow_t >\nstruct FordFulkerson {\n struct edge {\n int to;\n flow_t cap;\n int rev;\n bool isrev;\n int idx;\n };\n\n vector< vector< edge > > graph;\n vector< int > used;\n const flow_t INF;\n int timestamp;\n\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\n\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\n }\n\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\n if(idx == t) return flow;\n used[idx] = timestamp;\n for(auto &e : graph[idx]) {\n if(e.cap > 0 && used[e.to] != timestamp) {\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\n if(d > 0) {\n e.cap -= d;\n graph[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\n flow += f;\n }\n return flow;\n }\n\n void output() {\n for(int i = 0; i < graph.size(); i++) {\n for(auto &e : graph[i]) {\n if(e.isrev) continue;\n auto &rev_e = graph[e.to][e.rev];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n }\n};\n\n/**\n * @brief Dijkstra(単一始点最短路)\n * @docs docs/dijkstra.md\n */\ntemplate< typename T >\nstruct ShortestPath {\n vector< T > dist;\n vector< int > from, id;\n};\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector< int > A(M), B(M);\n Graph<> rg(N);\n StronglyConnectedComponents<> scc(N);\n for(int i = 0; i < M; i++) {\n cin >> A[i] >> B[i];\n --A[i], --B[i];\n scc.add_directed_edge(A[i], B[i]);\n rg.add_directed_edge(B[i], A[i]);\n }\n scc.build();\n if(scc.dag.size() == 1) {\n cout << 0 << \"\\n\";\n exit(0);\n }\n vector< int > in(N), out(N);\n for(int i = 0; i < scc.dag.size(); i++) {\n if(scc.dag.g[i].size()) {\n in[i] = true;\n }\n for(auto &t : scc.dag.g[i]) {\n out[t] = true;\n }\n }\n\n vector< int > latte, malta;\n for(int i = 0; i < scc.dag.size(); i++) {\n if(!in[i]) {\n latte.emplace_back(i);\n }\n if(!out[i]) {\n malta.emplace_back(i);\n }\n }\n if(latte.size() != 1 && malta.size() != 1) {\n cout << -1 << \"\\n\";\n exit(0);\n }\n\n\n FordFulkerson< int > flow(scc.dag.size());\n for(int i = 0; i < scc.dag.size(); i++) {\n for(auto &p : scc.dag.g[i]) {\n flow.add_edge(i, p, 1);\n }\n }\n if(flow.max_flow(malta[0], latte[0]) <= 1) {\n cout << \"-1\\n\";\n exit(0);\n }\n\n\n using T = int;\n const auto INF = numeric_limits< T >::max();\n vector< T > dist(scc.size(), INF);\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\n using Pi = pair< T, int >;\n priority_queue< Pi, vector< Pi >, greater<> > que;\n for(auto &p : scc.group[latte[0]]) {\n dist[p] = 0;\n que.emplace(0, p);\n }\n while(!que.empty()) {\n T cost;\n int idx;\n tie(cost, idx) = que.top();\n que.pop();\n if(dist[idx] < cost) continue;\n for(auto &e : rg.g[idx]) {\n auto next_cost = cost + e.cost;\n if(dist[e.to] <= next_cost) continue;\n dist[e.to] = next_cost;\n from[e.to] = idx;\n id[e.to] = e.idx;\n que.emplace(dist[e.to], e.to);\n }\n }\n int ans = inf;\n for(auto &p : scc.group[malta[0]]) {\n chmin(ans, dist[p]);\n }\n cout << ans << \"\\n\";\n}","accuracy":0.35135135135135137,"time_ms":30,"memory_kb":26864,"score_of_the_acc":-0.1907,"final_rank":18},{"submission_id":"aoj_3183_4846573","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int mod = 1e9 + 7;\n// const int mod = 998244353;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\ntemplate< typename T = int >\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n\n Edge() = default;\n\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\n\n operator int() const { return to; }\n};\n\ntemplate< typename T = int >\nstruct Graph {\n vector< vector< Edge< T > > > g;\n int es;\n\n Graph() = default;\n\n explicit Graph(int n) : g(n), es(0) {}\n\n size_t size() const {\n return g.size();\n }\n\n void add_directed_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es++);\n }\n\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a += padding;\n b += padding;\n T c = T(1);\n if(weighted) cin >> c;\n if(directed) add_directed_edge(a, b, c);\n else add_edge(a, b, c);\n }\n }\n};\n\ntemplate< typename T = int >\nusing Edges = vector< Edge< T > >;\n\n/**\n * @brief Strongly-Connected-Components(強連結成分分解)\n */\ntemplate< typename T = int >\nstruct StronglyConnectedComponents : Graph< T > {\npublic:\n using Graph< T >::Graph;\n using Graph< T >::g;\n vector< int > comp;\n Graph< T > dag;\n vector< vector< int > > group;\n\n void build() {\n rg = Graph< T >(g.size());\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n rg.add_directed_edge(e.to, e.from, e.cost);\n }\n }\n comp.assign(g.size(), -1);\n used.assign(g.size(), 0);\n for(int i = 0; i < g.size(); i++) dfs(i);\n reverse(begin(order), end(order));\n int ptr = 0;\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\n dag = Graph< T >(ptr);\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n int x = comp[e.from], y = comp[e.to];\n if(x == y) continue;\n dag.add_directed_edge(x, y, e.cost);\n }\n }\n group.resize(ptr);\n for(int i = 0; i < g.size(); i++) {\n group[comp[i]].emplace_back(i);\n }\n }\n\n int operator[](int k) const {\n return comp[k];\n }\n\nprivate:\n vector< int > order, used;\n Graph< T > rg;\n\n void dfs(int idx) {\n if(exchange(used[idx], true)) return;\n for(auto &to : g[idx]) dfs(to);\n order.push_back(idx);\n }\n\n void rdfs(int idx, int cnt) {\n if(comp[idx] != -1) return;\n comp[idx] = cnt;\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\n }\n};\n\n\n/**\n * @brief Ford-Fulkerson(最大流)\n * @docs docs/ford-fulkerson.md\n */\ntemplate< typename flow_t >\nstruct FordFulkerson {\n struct edge {\n int to;\n flow_t cap;\n int rev;\n bool isrev;\n int idx;\n };\n\n vector< vector< edge > > graph;\n vector< int > used;\n const flow_t INF;\n int timestamp;\n\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\n\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\n }\n\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\n if(idx == t) return flow;\n used[idx] = timestamp;\n for(auto &e : graph[idx]) {\n if(e.cap > 0 && used[e.to] != timestamp) {\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\n if(d > 0) {\n e.cap -= d;\n graph[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\n flow += f;\n }\n return flow;\n }\n\n void output() {\n for(int i = 0; i < graph.size(); i++) {\n for(auto &e : graph[i]) {\n if(e.isrev) continue;\n auto &rev_e = graph[e.to][e.rev];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n }\n};\n\n/**\n * @brief Dijkstra(単一始点最短路)\n * @docs docs/dijkstra.md\n */\ntemplate< typename T >\nstruct ShortestPath {\n vector< T > dist;\n vector< int > from, id;\n};\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector< int > A(M), B(M);\n Graph<> rg(N);\n StronglyConnectedComponents<> scc(N);\n for(int i = 0; i < M; i++) {\n cin >> A[i] >> B[i];\n --A[i], --B[i];\n scc.add_directed_edge(A[i], B[i]);\n rg.add_directed_edge(B[i], A[i]);\n }\n scc.build();\n if(scc.dag.size() == 1) {\n cout << 0 << \"\\n\";\n exit(0);\n }\n vector< int > in(N), out(N);\n for(int i = 0; i < scc.dag.size(); i++) {\n if(scc.dag.g[i].size()) {\n in[i] = true;\n }\n for(auto &t : scc.dag.g[i]) {\n out[t] = true;\n }\n }\n\n vector< int > latte, malta;\n for(int i = 0; i < scc.size(); i++) {\n if(!in[i]) {\n latte.emplace_back(i);\n }\n if(!out[i]) {\n malta.emplace_back(i);\n }\n }\n if(latte.size() != 1 && malta.size() != 1) {\n cout << -1 << \"\\n\";\n exit(0);\n }\n\n\n FordFulkerson< int > flow(scc.size());\n for(int i = 0; i < scc.size(); i++) {\n for(auto &p : scc.dag.g[i]) {\n flow.add_edge(i, p, 1);\n }\n }\n if(flow.max_flow(malta[0], latte[0]) <= 1) {\n cout << \"-1\\n\";\n exit(0);\n }\n\n\n using T = int;\n const auto INF = numeric_limits< T >::max();\n vector< T > dist(scc.size(), INF);\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\n using Pi = pair< T, int >;\n priority_queue< Pi, vector< Pi >, greater<> > que;\n for(auto &p : scc.group[latte[0]]) {\n dist[p] = 0;\n que.emplace(0, p);\n }\n while(!que.empty()) {\n T cost;\n int idx;\n tie(cost, idx) = que.top();\n que.pop();\n if(dist[idx] < cost) continue;\n for(auto &e : rg.g[idx]) {\n auto next_cost = cost + e.cost;\n if(dist[e.to] <= next_cost) continue;\n dist[e.to] = next_cost;\n from[e.to] = idx;\n id[e.to] = e.idx;\n que.emplace(dist[e.to], e.to);\n }\n }\n int ans = inf;\n for(auto &p : scc.group[malta[0]]) {\n chmin(ans, dist[p]);\n }\n cout << ans << \"\\n\";\n}","accuracy":0.5,"time_ms":40,"memory_kb":30020,"score_of_the_acc":-0.3688,"final_rank":12},{"submission_id":"aoj_3183_4846558","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int mod = 1e9 + 7;\n// const int mod = 998244353;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\ntemplate< typename T = int >\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n\n Edge() = default;\n\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\n\n operator int() const { return to; }\n};\n\ntemplate< typename T = int >\nstruct Graph {\n vector< vector< Edge< T > > > g;\n int es;\n\n Graph() = default;\n\n explicit Graph(int n) : g(n), es(0) {}\n\n size_t size() const {\n return g.size();\n }\n\n void add_directed_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es++);\n }\n\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a += padding;\n b += padding;\n T c = T(1);\n if(weighted) cin >> c;\n if(directed) add_directed_edge(a, b, c);\n else add_edge(a, b, c);\n }\n }\n};\n\ntemplate< typename T = int >\nusing Edges = vector< Edge< T > >;\n\n/**\n * @brief Strongly-Connected-Components(強連結成分分解)\n */\ntemplate< typename T = int >\nstruct StronglyConnectedComponents : Graph< T > {\npublic:\n using Graph< T >::Graph;\n using Graph< T >::g;\n vector< int > comp;\n Graph< T > dag;\n vector< vector< int > > group;\n\n void build() {\n rg = Graph< T >(g.size());\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n rg.add_directed_edge(e.to, e.from, e.cost);\n }\n }\n comp.assign(g.size(), -1);\n used.assign(g.size(), 0);\n for(int i = 0; i < g.size(); i++) dfs(i);\n reverse(begin(order), end(order));\n int ptr = 0;\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\n dag = Graph< T >(ptr);\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n int x = comp[e.from], y = comp[e.to];\n if(x == y) continue;\n dag.add_directed_edge(x, y, e.cost);\n }\n }\n group.resize(ptr);\n for(int i = 0; i < g.size(); i++) {\n group[comp[i]].emplace_back(i);\n }\n }\n\n int operator[](int k) const {\n return comp[k];\n }\n\nprivate:\n vector< int > order, used;\n Graph< T > rg;\n\n void dfs(int idx) {\n if(exchange(used[idx], true)) return;\n for(auto &to : g[idx]) dfs(to);\n order.push_back(idx);\n }\n\n void rdfs(int idx, int cnt) {\n if(comp[idx] != -1) return;\n comp[idx] = cnt;\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\n }\n};\n\n\n/**\n * @brief Ford-Fulkerson(最大流)\n * @docs docs/ford-fulkerson.md\n */\ntemplate< typename flow_t >\nstruct FordFulkerson {\n struct edge {\n int to;\n flow_t cap;\n int rev;\n bool isrev;\n int idx;\n };\n\n vector< vector< edge > > graph;\n vector< int > used;\n const flow_t INF;\n int timestamp;\n\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\n\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\n }\n\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\n if(idx == t) return flow;\n used[idx] = timestamp;\n for(auto &e : graph[idx]) {\n if(e.cap > 0 && used[e.to] != timestamp) {\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\n if(d > 0) {\n e.cap -= d;\n graph[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\n flow += f;\n if(flow >= 2) break;\n }\n return flow;\n }\n\n void output() {\n for(int i = 0; i < graph.size(); i++) {\n for(auto &e : graph[i]) {\n if(e.isrev) continue;\n auto &rev_e = graph[e.to][e.rev];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n }\n};\n\n/**\n * @brief Dijkstra(単一始点最短路)\n * @docs docs/dijkstra.md\n */\ntemplate< typename T >\nstruct ShortestPath {\n vector< T > dist;\n vector< int > from, id;\n};\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector< int > A(M), B(M);\n Graph<> rg(N);\n StronglyConnectedComponents<> scc(N);\n for(int i = 0; i < M; i++) {\n cin >> A[i] >> B[i];\n --A[i], --B[i];\n scc.add_directed_edge(A[i], B[i]);\n rg.add_directed_edge(B[i], A[i]);\n }\n scc.build();\n if(scc.dag.size() == 1) {\n cout << 0 << \"\\n\";\n exit(0);\n }\n vector< int > in(N), out(N);\n for(int i = 0; i < scc.dag.size(); i++) {\n if(scc.dag.g[i].size()) {\n in[i] = true;\n }\n for(auto &t : scc.dag.g[i]) {\n out[t] = true;\n }\n }\n\n vector< int > latte, malta;\n for(int i = 0; i < N; i++) {\n if(!in[i]) {\n latte.emplace_back(i);\n }\n if(!out[i]) {\n malta.emplace_back(i);\n }\n }\n if(latte.size() != 1 && malta.size() != 1) {\n cout << -1 << \"\\n\";\n exit(0);\n }\n\n\n FordFulkerson< int > flow(N + 2);\n for(int i = 0; i < M; i++) {\n flow.add_edge(A[i], B[i], 1);\n }\n for(auto &p : scc.group[malta[0]]) {\n flow.add_edge(N, p, inf);\n }\n for(auto &p : scc.group[latte[0]]) {\n flow.add_edge(p, N + 1, inf);\n }\n if(flow.max_flow(N, N + 1) <= 1) {\n cout << \"-1\\n\";\n exit(0);\n }\n\n\n using T = int;\n const auto INF = numeric_limits< T >::max();\n vector< T > dist(scc.size(), INF);\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\n using Pi = pair< T, int >;\n priority_queue< Pi, vector< Pi >, greater<> > que;\n for(auto &p : scc.group[latte[0]]) {\n dist[p] = 0;\n que.emplace(0, p);\n }\n while(!que.empty()) {\n T cost;\n int idx;\n tie(cost, idx) = que.top();\n que.pop();\n if(dist[idx] < cost) continue;\n for(auto &e : rg.g[idx]) {\n auto next_cost = cost + e.cost;\n if(dist[e.to] <= next_cost) continue;\n dist[e.to] = next_cost;\n from[e.to] = idx;\n id[e.to] = e.idx;\n que.emplace(dist[e.to], e.to);\n }\n }\n int ans = inf;\n for(auto &p : scc.group[malta[0]]) {\n chmin(ans, dist[p]);\n }\n if(ans >= inf) ans = -1;\n cout << ans << \"\\n\";\n}","accuracy":0.5,"time_ms":50,"memory_kb":30508,"score_of_the_acc":-0.4527,"final_rank":15},{"submission_id":"aoj_3183_4846412","code_snippet":"#include <bits/stdc++.h>\n\n// #include <atcoder/all>\n\nusing namespace std;\n// using namespace atcoder;\n \n#define DEBUG(x) cerr<<#x<<\": \"<<x<<endl;\n#define DEBUG_VEC(v) cerr<<#v<<\":\";for(int i=0;i<v.size();i++) cerr<<\" \"<<v[i]; cerr<<endl;\n#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<\" \";}cerr<<endl;}\ntypedef long long ll;\n// #define int ll\n \n#define vi vector<int>\n#define vl vector<ll>\n#define vii vector< vector<int> >\n#define vll vector< vector<ll> >\n#define vs vector<string>\n#define pii pair<int,int>\n#define pis pair<int,string>\n#define psi pair<string,int>\n#define pll pair<ll,ll>\ntemplate<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }\ntemplate<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }\ntemplate<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << \"(\" << p.first << \", \" << p.second << \")\"; return os; }\n#define X first\n#define Y second\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)\n#define rrep1(i,n) for(int i=(int)(n);i>0;i--)\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define in(x, a, b) (a <= x && x < b)\n#define all(c) c.begin(),c.end()\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }\n#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());\nconst ll inf = 1000000001;\nconst ll INF = (ll)1e18 + 1;\nconst long double pi = 3.1415926535897932384626433832795028841971L;\n#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;\n// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };\nvi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};\n// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };\n#define fio() cin.tie(0); ios::sync_with_stdio(false);\n// const ll MOD = 1000000007;\nconst ll MOD = 998244353;\n// #define mp make_pair\n//#define endl '\\n'\n\n\nnamespace internal {\n\ntemplate <class E> struct csr {\n std::vector<int> start;\n std::vector<E> elist;\n csr(int n, const std::vector<std::pair<int, E>>& edges)\n : start(n + 1), elist(edges.size()) {\n for (auto e : edges) {\n start[e.first + 1]++;\n }\n for (int i = 1; i <= n; i++) {\n start[i] += start[i - 1];\n }\n auto counter = start;\n for (auto e : edges) {\n elist[counter[e.first]++] = e.second;\n }\n }\n};\n\n// Reference:\n// R. Tarjan,\n// Depth-First Search and Linear Graph Algorithms\nstruct scc_graph {\n public:\n scc_graph(int n) : _n(n) {}\n\n int num_vertices() { return _n; }\n\n void add_edge(int from, int to) { edges.push_back({from, {to}}); }\n\n // @return pair of (# of scc, scc id)\n std::pair<int, std::vector<int>> scc_ids() {\n auto g = csr<edge>(_n, edges);\n int now_ord = 0, group_num = 0;\n std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);\n visited.reserve(_n);\n auto dfs = [&](auto self, int v) -> void {\n low[v] = ord[v] = now_ord++;\n visited.push_back(v);\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\n auto to = g.elist[i].to;\n if (ord[to] == -1) {\n self(self, to);\n low[v] = std::min(low[v], low[to]);\n } else {\n low[v] = std::min(low[v], ord[to]);\n }\n }\n if (low[v] == ord[v]) {\n while (true) {\n int u = visited.back();\n visited.pop_back();\n ord[u] = _n;\n ids[u] = group_num;\n if (u == v) break;\n }\n group_num++;\n }\n };\n for (int i = 0; i < _n; i++) {\n if (ord[i] == -1) dfs(dfs, i);\n }\n for (auto& x : ids) {\n x = group_num - 1 - x;\n }\n return {group_num, ids};\n }\n\n std::vector<std::vector<int>> scc() {\n auto ids = scc_ids();\n int group_num = ids.first;\n std::vector<int> counts(group_num);\n for (auto x : ids.second) counts[x]++;\n std::vector<std::vector<int>> groups(ids.first);\n for (int i = 0; i < group_num; i++) {\n groups[i].reserve(counts[i]);\n }\n for (int i = 0; i < _n; i++) {\n groups[ids.second[i]].push_back(i);\n }\n return groups;\n }\n\n private:\n int _n;\n struct edge {\n int to;\n };\n std::vector<std::pair<int, edge>> edges;\n};\n\n} // namespace internal\n\nstruct scc_graph {\n public:\n scc_graph() : internal(0) {}\n scc_graph(int n) : internal(n) {}\n\n void add_edge(int from, int to) {\n int n = internal.num_vertices();\n assert(0 <= from && from < n);\n assert(0 <= to && to < n);\n internal.add_edge(from, to);\n }\n\n std::vector<std::vector<int>> scc() { return internal.scc(); }\n\n private:\n internal::scc_graph internal;\n};\n\nvi group;\nint first_group, last_group;\n\n// bool dfs(int now, int target, vector<vector<pii>>& G, set<int>& used_edges, vector<bool> visited) {\n// if (now == target) return true;\n// visited[now] = true;\n// for (pii temp: G[now]) {\n// int v = temp.first;\n// if (visited[v]) continue;\n// int edge_idx = temp.second;\n// if (used_edges.count(edge_idx)) continue;\n// used_edges.insert(edge_idx);\n// if (dfs(v, target, G, used_edges, visited)) return true;\n// used_edges.erase(edge_idx);\n// }\n// return false;\n// }\n\n\n\n// �ӂ�\\���\\���� {�s��A�e�ʁA�t��}\nstruct edge { int to; ll cap; int rev; };\n#define V 101000\nint s, t; //s��start, t��goal\nvector< vector<edge> > G(V, vector<edge>());; //�O���t�̗אڃ��X�g�\\��\nvector<bool> used(V); //DEF�Œ��ׂ����̃t���O\n\n\t\t\t\t\t //from����to�������e��cap�̕ӂ��O���t�ɒlj�����\nvoid add_edge(int from, int to, ll cap) {\n\tedge a;\n\ta.to = to; a.cap = cap; a.rev = G[to].size();\n\tG[from].push_back(a);\n\ta.to = from; a.cap = 0; a.rev = G[from].size() - 1;\n\tG[to].push_back(a);\n}\n\nll dfs(int v, int t, ll f) {\n\tif (v == t) {\n\t\treturn f;\n\t}\n\tused[v] = true;\n\tfor (int i = 0; i < G[v].size(); i++) {\n\t\tedge &e = G[v][i];\n\t\tif (!used[e.to] && e.cap > 0) {\n\t\t\tll d = dfs(e.to, t, min(f, e.cap));\n\t\t\tif (d > 0) {\n\t\t\t\te.cap -= d;\n\t\t\t\tG[e.to][e.rev].cap += d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nll max_flow(int s, int t) {\n\tll flow = 0;\n\twhile (true) {\n\t\tfill(used.begin(), used.end(), false);\n\t\tll f = dfs(s, t, INF);\n\t\tif (f == 0) return flow;\n\t\tflow += f;\n if (flow >= 2) return flow;\n\t}\n}\n\n\nsigned main() {\n fio();\n int n, m;\n cin >> n >> m;\n scc_graph scc(n);\n\n vii G(n);\n rep (i, m) {\n int u, v;\n cin >> u >> v;\n u--; v--;\n G[u].push_back(v);\n scc.add_edge(u, v);\n add_edge(u, v, 1);\n }\n\n vii res = scc.scc();\n int k = res.size();\n if (k == 1) {\n cout << 0 << endl;\n return 0;\n }\n\n group.resize(n);\n rep (i, res.size()) {\n for (int u: res[i]) {\n group[u] = i;\n }\n }\n\n vii G2(k);\n vii rG2(k);\n rep (u, n) {\n for (int v: G[u]) {\n if (group[u] == group[v]) continue;\n G2[group[u]].push_back(group[v]);\n rG2[group[v]].push_back(group[u]);\n // add_edge(group[u], group[v], 1);\n }\n }\n // vector<vector<pii>> G3(k);\n // int edge_num = 0;\n // rep (u, k) {\n // for (int v: G2[u]) {\n // G3[u].push_back(pii(v, edge_num++));\n // }\n // }\n\n rep (u, k) {\n sort(all(G2[u]));\n UNIQUE(G2[u]);\n sort(all(rG2[u]));\n UNIQUE(rG2[u]);\n }\n\n vi in0, out0;\n rep (i, k) {\n if (G2[i].size() == 0) {\n out0.push_back(i);\n }\n if (rG2[i].size() == 0) {\n in0.push_back(i);\n }\n }\n\n if (in0.size() > 1 or out0.size() > 1) {\n cout << -1 << endl;\n return 0;\n }\n\n first_group = in0[0];\n last_group = out0[0];\n // int F = max_flow(first_group, last_group);\n int s = n, t = n + 1;\n rep (i, n) {\n if (group[i] == first_group) add_edge(s, i, 2);\n if (group[i] == last_group) add_edge(i, t, 2);\n }\n int F = max_flow(s, t);\n if (F < 2) {\n cout << -1 << endl;\n return 0;\n }\n\n // set<int> used_edges;\n // DEBUG_MAT(res);\n // DEBUG_MAT(G3);\n // vector<bool> visited(k);\n // if (not dfs(first_group, last_group, G3, used_edges, visited)) {\n // cout << -1 << endl;\n // return 0;\n // }\n // fill(all(visited), false);\n // if (not dfs(first_group, last_group, G3, used_edges, visited)) {\n // cout << -1 << endl;\n // return 0;\n // }\n\n vi dist(n, inf);\n queue<int> qu;\n for (int u: res[first_group]) {\n dist[u] = 0;\n qu.push(u);\n }\n // DEBUG_VEC(dist);\n // DEBUG_MAT(G); \n\n int ans = inf;\n while (qu.size()) {\n int u = qu.front();\n qu.pop();\n if (group[u] == last_group) {\n chmin(ans, dist[u]);\n }\n\n for (int v: G[u]) {\n if (dist[v] > dist[u] + 1) {\n dist[v] = dist[u] + 1;\n qu.push(v);\n }\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":41268,"score_of_the_acc":-0.966,"final_rank":4},{"submission_id":"aoj_3183_4846394","code_snippet":"#include <bits/stdc++.h>\n\n// #include <atcoder/all>\n\nusing namespace std;\n// using namespace atcoder;\n \n#define DEBUG(x) cerr<<#x<<\": \"<<x<<endl;\n#define DEBUG_VEC(v) cerr<<#v<<\":\";for(int i=0;i<v.size();i++) cerr<<\" \"<<v[i]; cerr<<endl;\n#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<\" \";}cerr<<endl;}\ntypedef long long ll;\n// #define int ll\n \n#define vi vector<int>\n#define vl vector<ll>\n#define vii vector< vector<int> >\n#define vll vector< vector<ll> >\n#define vs vector<string>\n#define pii pair<int,int>\n#define pis pair<int,string>\n#define psi pair<string,int>\n#define pll pair<ll,ll>\ntemplate<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }\ntemplate<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }\ntemplate<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << \"(\" << p.first << \", \" << p.second << \")\"; return os; }\n#define X first\n#define Y second\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)\n#define rrep1(i,n) for(int i=(int)(n);i>0;i--)\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define in(x, a, b) (a <= x && x < b)\n#define all(c) c.begin(),c.end()\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }\n#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());\nconst ll inf = 1000000001;\nconst ll INF = (ll)1e18 + 1;\nconst long double pi = 3.1415926535897932384626433832795028841971L;\n#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;\n// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };\nvi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};\n// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };\n#define fio() cin.tie(0); ios::sync_with_stdio(false);\n// const ll MOD = 1000000007;\nconst ll MOD = 998244353;\n// #define mp make_pair\n//#define endl '\\n'\n\n\nnamespace internal {\n\ntemplate <class E> struct csr {\n std::vector<int> start;\n std::vector<E> elist;\n csr(int n, const std::vector<std::pair<int, E>>& edges)\n : start(n + 1), elist(edges.size()) {\n for (auto e : edges) {\n start[e.first + 1]++;\n }\n for (int i = 1; i <= n; i++) {\n start[i] += start[i - 1];\n }\n auto counter = start;\n for (auto e : edges) {\n elist[counter[e.first]++] = e.second;\n }\n }\n};\n\n// Reference:\n// R. Tarjan,\n// Depth-First Search and Linear Graph Algorithms\nstruct scc_graph {\n public:\n scc_graph(int n) : _n(n) {}\n\n int num_vertices() { return _n; }\n\n void add_edge(int from, int to) { edges.push_back({from, {to}}); }\n\n // @return pair of (# of scc, scc id)\n std::pair<int, std::vector<int>> scc_ids() {\n auto g = csr<edge>(_n, edges);\n int now_ord = 0, group_num = 0;\n std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);\n visited.reserve(_n);\n auto dfs = [&](auto self, int v) -> void {\n low[v] = ord[v] = now_ord++;\n visited.push_back(v);\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\n auto to = g.elist[i].to;\n if (ord[to] == -1) {\n self(self, to);\n low[v] = std::min(low[v], low[to]);\n } else {\n low[v] = std::min(low[v], ord[to]);\n }\n }\n if (low[v] == ord[v]) {\n while (true) {\n int u = visited.back();\n visited.pop_back();\n ord[u] = _n;\n ids[u] = group_num;\n if (u == v) break;\n }\n group_num++;\n }\n };\n for (int i = 0; i < _n; i++) {\n if (ord[i] == -1) dfs(dfs, i);\n }\n for (auto& x : ids) {\n x = group_num - 1 - x;\n }\n return {group_num, ids};\n }\n\n std::vector<std::vector<int>> scc() {\n auto ids = scc_ids();\n int group_num = ids.first;\n std::vector<int> counts(group_num);\n for (auto x : ids.second) counts[x]++;\n std::vector<std::vector<int>> groups(ids.first);\n for (int i = 0; i < group_num; i++) {\n groups[i].reserve(counts[i]);\n }\n for (int i = 0; i < _n; i++) {\n groups[ids.second[i]].push_back(i);\n }\n return groups;\n }\n\n private:\n int _n;\n struct edge {\n int to;\n };\n std::vector<std::pair<int, edge>> edges;\n};\n\n} // namespace internal\n\nstruct scc_graph {\n public:\n scc_graph() : internal(0) {}\n scc_graph(int n) : internal(n) {}\n\n void add_edge(int from, int to) {\n int n = internal.num_vertices();\n assert(0 <= from && from < n);\n assert(0 <= to && to < n);\n internal.add_edge(from, to);\n }\n\n std::vector<std::vector<int>> scc() { return internal.scc(); }\n\n private:\n internal::scc_graph internal;\n};\n\nvi group;\nint first_group, last_group;\n\n// bool dfs(int now, int target, vector<vector<pii>>& G, set<int>& used_edges, vector<bool> visited) {\n// if (now == target) return true;\n// visited[now] = true;\n// for (pii temp: G[now]) {\n// int v = temp.first;\n// if (visited[v]) continue;\n// int edge_idx = temp.second;\n// if (used_edges.count(edge_idx)) continue;\n// used_edges.insert(edge_idx);\n// if (dfs(v, target, G, used_edges, visited)) return true;\n// used_edges.erase(edge_idx);\n// }\n// return false;\n// }\n\n\n\n// �ӂ�\\���\\���� {�s��A�e�ʁA�t��}\nstruct edge { int to; ll cap; int rev; };\n#define V 101000\nint s, t; //s��start, t��goal\nvector< vector<edge> > G(V, vector<edge>());; //�O���t�̗אڃ��X�g�\\��\nvector<bool> used(V); //DEF�Œ��ׂ����̃t���O\n\n\t\t\t\t\t //from����to�������e��cap�̕ӂ��O���t�ɒlj�����\nvoid add_edge(int from, int to, ll cap) {\n\tedge a;\n\ta.to = to; a.cap = cap; a.rev = G[to].size();\n\tG[from].push_back(a);\n\ta.to = from; a.cap = 0; a.rev = G[from].size() - 1;\n\tG[to].push_back(a);\n}\n\nll dfs(int v, int t, ll f) {\n\tif (v == t) {\n\t\treturn f;\n\t}\n\tused[v] = true;\n\tfor (int i = 0; i < G[v].size(); i++) {\n\t\tedge &e = G[v][i];\n\t\tif (!used[e.to] && e.cap > 0) {\n\t\t\tll d = dfs(e.to, t, min(f, e.cap));\n\t\t\tif (d > 0) {\n\t\t\t\te.cap -= d;\n\t\t\t\tG[e.to][e.rev].cap += d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nll max_flow(int s, int t) {\n\tll flow = 0;\n\twhile (true) {\n\t\tfill(used.begin(), used.end(), false);\n\t\tll f = dfs(s, t, INF);\n\t\tif (f == 0) return flow;\n\t\tflow += f;\n if (flow >= 2) return flow;\n\t}\n}\n\n\nsigned main() {\n fio();\n int n, m;\n cin >> n >> m;\n scc_graph scc(n);\n\n vii G(n);\n rep (i, m) {\n int u, v;\n cin >> u >> v;\n u--; v--;\n G[u].push_back(v);\n scc.add_edge(u, v);\n }\n\n vii res = scc.scc();\n int k = res.size();\n if (k == 1) {\n cout << 0 << endl;\n return 0;\n }\n\n group.resize(n);\n rep (i, res.size()) {\n for (int u: res[i]) {\n group[u] = i;\n }\n }\n\n vii G2(k);\n vii rG2(k);\n rep (u, n) {\n for (int v: G[u]) {\n if (group[u] == group[v]) continue;\n G2[group[u]].push_back(group[v]);\n rG2[group[v]].push_back(group[u]);\n add_edge(group[u], group[v], 1);\n }\n }\n // vector<vector<pii>> G3(k);\n // int edge_num = 0;\n // rep (u, k) {\n // for (int v: G2[u]) {\n // G3[u].push_back(pii(v, edge_num++));\n // }\n // }\n\n rep (u, k) {\n sort(all(G2[u]));\n UNIQUE(G2[u]);\n sort(all(rG2[u]));\n UNIQUE(rG2[u]);\n }\n\n vi in0, out0;\n rep (i, k) {\n if (G2[i].size() == 0) {\n out0.push_back(i);\n }\n if (rG2[i].size() == 0) {\n in0.push_back(i);\n }\n }\n\n if (in0.size() > 1 or out0.size() > 1) {\n cout << -1 << endl;\n return 0;\n }\n\n first_group = in0[0];\n last_group = out0[0];\n int F = max_flow(first_group, last_group);\n if (F < 2) {\n cout << -1 << endl;\n return 0;\n }\n\n // set<int> used_edges;\n // DEBUG_MAT(res);\n // DEBUG_MAT(G3);\n // vector<bool> visited(k);\n // if (not dfs(first_group, last_group, G3, used_edges, visited)) {\n // cout << -1 << endl;\n // return 0;\n // }\n // fill(all(visited), false);\n // if (not dfs(first_group, last_group, G3, used_edges, visited)) {\n // cout << -1 << endl;\n // return 0;\n // }\n\n vi dist(n, inf);\n queue<int> qu;\n for (int u: res[first_group]) {\n dist[u] = 0;\n qu.push(u);\n }\n // DEBUG_VEC(dist);\n // DEBUG_MAT(G); \n\n int ans = inf;\n while (qu.size()) {\n int u = qu.front();\n qu.pop();\n if (group[u] == last_group) {\n chmin(ans, dist[u]);\n }\n\n for (int v: G[u]) {\n if (dist[v] > dist[u] + 1) {\n dist[v] = dist[u] + 1;\n qu.push(v);\n }\n }\n }\n cout << ans << endl;\n}","accuracy":0.35135135135135137,"time_ms":30,"memory_kb":26632,"score_of_the_acc":-0.1825,"final_rank":17},{"submission_id":"aoj_3183_4846389","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int mod = 1e9 + 7;\n// const int mod = 998244353;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\ntemplate< typename T = int >\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n\n Edge() = default;\n\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\n\n operator int() const { return to; }\n};\n\ntemplate< typename T = int >\nstruct Graph {\n vector< vector< Edge< T > > > g;\n int es;\n\n Graph() = default;\n\n explicit Graph(int n) : g(n), es(0) {}\n\n size_t size() const {\n return g.size();\n }\n\n void add_directed_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es++);\n }\n\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a += padding;\n b += padding;\n T c = T(1);\n if(weighted) cin >> c;\n if(directed) add_directed_edge(a, b, c);\n else add_edge(a, b, c);\n }\n }\n};\n\ntemplate< typename T = int >\nusing Edges = vector< Edge< T > >;\n\n/**\n * @brief Strongly-Connected-Components(強連結成分分解)\n */\ntemplate< typename T = int >\nstruct StronglyConnectedComponents : Graph< T > {\npublic:\n using Graph< T >::Graph;\n using Graph< T >::g;\n vector< int > comp;\n Graph< T > dag;\n vector< vector< int > > group;\n\n void build() {\n rg = Graph< T >(g.size());\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n rg.add_directed_edge(e.to, e.from, e.cost);\n }\n }\n comp.assign(g.size(), -1);\n used.assign(g.size(), 0);\n for(int i = 0; i < g.size(); i++) dfs(i);\n reverse(begin(order), end(order));\n int ptr = 0;\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\n dag = Graph< T >(ptr);\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n int x = comp[e.from], y = comp[e.to];\n if(x == y) continue;\n dag.add_directed_edge(x, y, e.cost);\n }\n }\n group.resize(ptr);\n for(int i = 0; i < g.size(); i++) {\n group[comp[i]].emplace_back(i);\n }\n }\n\n int operator[](int k) const {\n return comp[k];\n }\n\nprivate:\n vector< int > order, used;\n Graph< T > rg;\n\n void dfs(int idx) {\n if(exchange(used[idx], true)) return;\n for(auto &to : g[idx]) dfs(to);\n order.push_back(idx);\n }\n\n void rdfs(int idx, int cnt) {\n if(comp[idx] != -1) return;\n comp[idx] = cnt;\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\n }\n};\n\n\n/**\n * @brief Ford-Fulkerson(最大流)\n * @docs docs/ford-fulkerson.md\n */\ntemplate< typename flow_t >\nstruct FordFulkerson {\n struct edge {\n int to;\n flow_t cap;\n int rev;\n bool isrev;\n int idx;\n };\n\n vector< vector< edge > > graph;\n vector< int > used;\n const flow_t INF;\n int timestamp;\n\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\n\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\n }\n\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\n if(idx == t) return flow;\n used[idx] = timestamp;\n for(auto &e : graph[idx]) {\n if(e.cap > 0 && used[e.to] != timestamp) {\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\n if(d > 0) {\n e.cap -= d;\n graph[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\n flow += f;\n if(flow >= 2) break;\n }\n return flow;\n }\n\n void output() {\n for(int i = 0; i < graph.size(); i++) {\n for(auto &e : graph[i]) {\n if(e.isrev) continue;\n auto &rev_e = graph[e.to][e.rev];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n }\n};\n\n/**\n * @brief Dijkstra(単一始点最短路)\n * @docs docs/dijkstra.md\n */\ntemplate< typename T >\nstruct ShortestPath {\n vector< T > dist;\n vector< int > from, id;\n};\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector< int > A(M), B(M);\n Graph<> rg(N);\n StronglyConnectedComponents<> scc(N);\n for(int i = 0; i < M; i++) {\n cin >> A[i] >> B[i];\n --A[i], --B[i];\n scc.add_directed_edge(A[i], B[i]);\n rg.add_directed_edge(B[i], A[i]);\n }\n scc.build();\n if(scc.dag.size() == 1) {\n cout << 0 << \"\\n\";\n exit(0);\n }\n vector< int > in(N), out(N);\n for(int i = 0; i < scc.dag.size(); i++) {\n if(scc.dag.g[i].size()) {\n in[i] = true;\n }\n for(auto &t : scc.dag.g[i]) {\n out[t] = true;\n }\n }\n\n vector< int > latte, malta;\n for(int i = 0; i < N; i++) {\n if(!in[i]) {\n latte.emplace_back(i);\n }\n if(!out[i]) {\n malta.emplace_back(i);\n }\n }\n if(latte.size() != 1 && malta.size() != 1) {\n cout << -1 << \"\\n\";\n exit(0);\n }\n\n\n FordFulkerson< int > flow(scc.size() + 2);\n for(int i = 0; i < M; i++) {\n flow.add_edge(A[i], B[i], 1);\n }\n for(auto &p : scc.group[malta[0]]) {\n flow.add_edge(scc.size(), p, inf);\n }\n for(auto &p : scc.group[latte[0]]) {\n flow.add_edge(p, scc.size() + 1, inf);\n }\n if(flow.max_flow(scc.size(), scc.size() + 1) <= 1) {\n cout << \"-1\\n\";\n exit(0);\n }\n\n\n using T = int;\n const auto INF = numeric_limits< T >::max();\n vector< T > dist(scc.size(), INF);\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\n using Pi = pair< T, int >;\n priority_queue< Pi, vector< Pi >, greater<> > que;\n for(auto &p : scc.group[latte[0]]) {\n dist[p] = 0;\n que.emplace(0, p);\n }\n while(!que.empty()) {\n T cost;\n int idx;\n tie(cost, idx) = que.top();\n que.pop();\n if(dist[idx] < cost) continue;\n for(auto &e : rg.g[idx]) {\n auto next_cost = cost + e.cost;\n if(dist[e.to] <= next_cost) continue;\n dist[e.to] = next_cost;\n from[e.to] = idx;\n id[e.to] = e.idx;\n que.emplace(dist[e.to], e.to);\n }\n }\n int ans = inf;\n for(auto &p : scc.group[malta[0]]) {\n chmin(ans, dist[p]);\n }\n if(ans >= inf) ans = -1;\n cout << ans << \"\\n\";\n}","accuracy":0.5,"time_ms":40,"memory_kb":30508,"score_of_the_acc":-0.386,"final_rank":13},{"submission_id":"aoj_3183_4846354","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int mod = 1e9 + 7;\n// const int mod = 998244353;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\ntemplate< typename T = int >\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n\n Edge() = default;\n\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\n\n operator int() const { return to; }\n};\n\ntemplate< typename T = int >\nstruct Graph {\n vector< vector< Edge< T > > > g;\n int es;\n\n Graph() = default;\n\n explicit Graph(int n) : g(n), es(0) {}\n\n size_t size() const {\n return g.size();\n }\n\n void add_directed_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es++);\n }\n\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a += padding;\n b += padding;\n T c = T(1);\n if(weighted) cin >> c;\n if(directed) add_directed_edge(a, b, c);\n else add_edge(a, b, c);\n }\n }\n};\n\ntemplate< typename T = int >\nusing Edges = vector< Edge< T > >;\n\n/**\n * @brief Strongly-Connected-Components(強連結成分分解)\n */\ntemplate< typename T = int >\nstruct StronglyConnectedComponents : Graph< T > {\npublic:\n using Graph< T >::Graph;\n using Graph< T >::g;\n vector< int > comp;\n Graph< T > dag;\n vector< vector< int > > group;\n\n void build() {\n rg = Graph< T >(g.size());\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n rg.add_directed_edge(e.to, e.from, e.cost);\n }\n }\n comp.assign(g.size(), -1);\n used.assign(g.size(), 0);\n for(int i = 0; i < g.size(); i++) dfs(i);\n reverse(begin(order), end(order));\n int ptr = 0;\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\n dag = Graph< T >(ptr);\n for(int i = 0; i < g.size(); i++) {\n for(auto &e : g[i]) {\n int x = comp[e.from], y = comp[e.to];\n if(x == y) continue;\n dag.add_directed_edge(x, y, e.cost);\n }\n }\n group.resize(ptr);\n for(int i = 0; i < g.size(); i++) {\n group[comp[i]].emplace_back(i);\n }\n }\n\n int operator[](int k) const {\n return comp[k];\n }\n\nprivate:\n vector< int > order, used;\n Graph< T > rg;\n\n void dfs(int idx) {\n if(exchange(used[idx], true)) return;\n for(auto &to : g[idx]) dfs(to);\n order.push_back(idx);\n }\n\n void rdfs(int idx, int cnt) {\n if(comp[idx] != -1) return;\n comp[idx] = cnt;\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\n }\n};\n\n\n/**\n * @brief Ford-Fulkerson(最大流)\n * @docs docs/ford-fulkerson.md\n */\ntemplate< typename flow_t >\nstruct FordFulkerson {\n struct edge {\n int to;\n flow_t cap;\n int rev;\n bool isrev;\n int idx;\n };\n\n vector< vector< edge > > graph;\n vector< int > used;\n const flow_t INF;\n int timestamp;\n\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\n\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\n }\n\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\n if(idx == t) return flow;\n used[idx] = timestamp;\n for(auto &e : graph[idx]) {\n if(e.cap > 0 && used[e.to] != timestamp) {\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\n if(d > 0) {\n e.cap -= d;\n graph[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\n flow += f;\n }\n return flow;\n }\n\n void output() {\n for(int i = 0; i < graph.size(); i++) {\n for(auto &e : graph[i]) {\n if(e.isrev) continue;\n auto &rev_e = graph[e.to][e.rev];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n }\n};\n\n/**\n * @brief Dijkstra(単一始点最短路)\n * @docs docs/dijkstra.md\n */\ntemplate< typename T >\nstruct ShortestPath {\n vector< T > dist;\n vector< int > from, id;\n};\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector< int > A(M), B(M);\n Graph<> rg(N);\n StronglyConnectedComponents<> scc(N);\n for(int i = 0; i < M; i++) {\n cin >> A[i] >> B[i];\n --A[i], --B[i];\n scc.add_directed_edge(A[i], B[i]);\n rg.add_directed_edge(B[i], A[i]);\n }\n scc.build();\n if(scc.dag.size() == 1) {\n cout << 0 << \"\\n\";\n exit(0);\n }\n vector< int > in(N), out(N);\n for(int i = 0; i < scc.dag.size(); i++) {\n if(scc.dag.g[i].size()) {\n in[i] = true;\n }\n for(auto &t : scc.dag.g[i]) {\n out[t] = true;\n }\n }\n\n vector< int > latte, malta;\n for(int i = 0; i < N; i++) {\n if(!in[i]) {\n latte.emplace_back(i);\n }\n if(!out[i]) {\n malta.emplace_back(i);\n }\n }\n if(latte.size() != 1 && malta.size() != 1) {\n cout << -1 << \"\\n\";\n exit(0);\n }\n\n\n FordFulkerson< int > flow(scc.size());\n for(int i = 0; i < scc.size(); i++) {\n for(auto &p : scc.dag.g[i]) {\n flow.add_edge(i, p, 1);\n }\n }\n if(flow.max_flow(malta[0], latte[0]) <= 1) {\n cout << \"-1\\n\";\n exit(0);\n }\n\n\n using T = int;\n const auto INF = numeric_limits< T >::max();\n vector< T > dist(scc.size(), INF);\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\n using Pi = pair< T, int >;\n priority_queue< Pi, vector< Pi >, greater<> > que;\n for(auto &p : scc.group[latte[0]]) {\n dist[p] = 0;\n que.emplace(0, p);\n }\n while(!que.empty()) {\n T cost;\n int idx;\n tie(cost, idx) = que.top();\n que.pop();\n if(dist[idx] < cost) continue;\n for(auto &e : rg.g[idx]) {\n auto next_cost = cost + e.cost;\n if(dist[e.to] <= next_cost) continue;\n dist[e.to] = next_cost;\n from[e.to] = idx;\n id[e.to] = e.idx;\n que.emplace(dist[e.to], e.to);\n }\n }\n int ans = inf;\n for(auto &p : scc.group[malta[0]]) {\n chmin(ans, dist[p]);\n }\n if(ans >= inf) ans = -1;\n cout << ans << \"\\n\";\n}","accuracy":0.5,"time_ms":50,"memory_kb":29876,"score_of_the_acc":-0.4304,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_3183_8041018\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nstruct SCC{\\n vector<vector<int> > gg,rg;\\n vector<int> comp,order;\\n vector<bool> used;\\n vector<vector<int> > ng,vs;\\n int n,nn;\\n SCC(){}\\n SCC(int v):gg(v),rg(v),comp(v,-1),used(v,0),n(v){}\\n void add_edge(int x,int y){\\n gg[x].push_back(y);\\n rg[y].push_back(x);\\n }\\n void dfs(int v){\\n used[v]=1;\\n for(int i:gg[v]){\\n if(!used[i])dfs(i);\\n }\\n order.push_back(v);\\n }\\n void rdfs(int v,int k){\\n used[v]=1;\\n comp[v]=k;\\n for(int i:rg[v]){\\n if(!used[i])rdfs(i,k);\\n }\\n }\\n int build(){\\n for(int i=0;i<n;i++){\\n if(!used[i])dfs(i);\\n }\\n for(int i=0;i<n;i++){\\n used[i]=0;\\n }\\n int k=0;\\n for(int i=order.size()-1;i>=0;i--){\\n if(!used[order[i]])rdfs(order[i],k++);\\n }\\n nn=k;\\n // それぞれの強連結成分に含まれる頂点の番号\\n vs.resize(k,vector<int>());\\n for(int i=0;i<n;i++){\\n vs[comp[i]].push_back(i);\\n }\\n // 強連結成分をまとめた後のグラフ\\n ng.resize(k,vector<int>());\\n for(int i=0;i<n;i++){\\n for(int j:gg[i]){\\n if(comp[i]!=comp[j]){\\n ng[comp[i]].push_back(comp[j]);\\n }\\n }\\n }\\n for(int i=0;i<nn;i++){\\n sort(ng[i].begin(),ng[i].end());\\n ng[i].erase(unique(ng[i].begin(),ng[i].end()),ng[i].end());\\n }\\n return k;\\n }\\n};\\n\\ntemplate<typename T>\\nstruct dinic{\\n struct edge{\\n int to;\\n T c,f;\\n };\\n T eps;\\n const T inf=numeric_limits<T>::max();\\n int n,m = 0;\\n vector<edge> e;\\n vector<vector<int>> g;\\n vector<int> level, ptr;\\n dinic(int n): n(n), g(n), level(n), ptr(n) {\\n eps = (T)1 / (T)1e9;\\n }\\n void add_edge(int s, int t, T c){\\n e.push_back({t, c, 0});\\n e.push_back({s, 0, 0});\\n g[s].push_back(m++);\\n g[t].push_back(m++);\\n }\\n bool bfs(int s, int t){\\n fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n for(queue<int> q({s});q.size();q.pop()){\\n int s = q.front();\\n for(int i:g[s]){\\n int t = e[i].to;\\n if(level[t] == -1 and (e[i].c - e[i].f) > eps){\\n level[t] = level[s] + 1;\\n q.push(t);\\n }\\n }\\n }\\n return (level[t] != -1);\\n }\\n T dfs(int s, int t, T psh){\\n if(!(psh > eps) or s == t) return psh;\\n for(int &i = ptr[s]; i < (int)g[s].size(); ++i){\\n auto &eg = e[g[s][i]];\\n if(level[eg.to] != level[s] + 1 or !(eg.c - eg.f > eps)) continue;\\n T f = dfs(eg.to, t, min(psh, eg.c-eg.f));\\n if(f > eps){\\n eg.f += f;\\n e[g[s][i]^1].f -= f;\\n return f;\\n }\\n }\\n return 0;\\n }\\n T max_flow(int s, int t){\\n T f = 0;\\n while(bfs(s,t)){\\n fill(ptr.begin(), ptr.end(), 0);\\n while(1){\\n T c = dfs(s, t, inf);\\n if(c > eps){\\n f += c;\\n }\\n else{\\n break;\\n }\\n }\\n }\\n return f;\\n }\\n // ABC239-G\\n vector<bool> min_cut(int s){\\n vector<bool> visited(n);\\n queue<int> q; q.push(s);\\n while(q.size()){\\n int p = q.front(); q.pop();\\n visited[p] = true;\\n for(auto idx:g[p]){\\n auto eg = e[idx];\\n if(eg.c - eg.f > eps and !visited[eg.to]){\\n visited[eg.to] = true;\\n q.push(eg.to);\\n }\\n }\\n }\\n return visited;\\n }\\n};\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n,m; cin >> n >> m;\\n SCC G(n);\\n for (int i = 0; i < m; ++i) {\\n int x,y; cin >> x >> y;\\n x--; y--;\\n G.add_edge(x, y);\\n }\\n int sz = G.build();\\n if (sz == 1) {\\n cout << 0 << endl;\\n return 0;\\n }\\n auto ng = G.ng;\\n int s = -1, t = -1;\\n {\\n vector<int> deg(sz);\\n for (int i = 0; i < sz; ++i) {\\n for (int j : ng[i]) {\\n deg[j]++;\\n }\\n }\\n for (int i = 0; i < sz; ++i) {\\n if (deg[i] == 0) {\\n if (s == -1) s = i;\\n else {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n for (int i = 0; i < sz; ++i) {\\n if (ng[i].size() == 0) {\\n if (t == -1) t = i;\\n else {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n }\\n vector<vector<int>> g(n+2);\\n dinic<int> dc(n+2);\\n for (int i = 0; i < n; ++i) {\\n int u = (G.comp[i] == s ? n : i);\\n for (int j : G.gg[i]) {\\n int v = (G.comp[j] == t ? n+1 : j);\\n g[u].push_back(v);\\n dc.add_edge(u, v, 1);\\n }\\n }\\n if (dc.max_flow(n, n+1) == 1) {\\n cout << -1 << endl;\\n return 0;\\n }\\n vector<int> d(n+2, -1);\\n queue<int> q;\\n q.push(n); d[n] = 0;\\n while (q.size()) {\\n int p = q.front(); q.pop();\\n for (int pp : g[p]) {\\n if (d[pp] == -1) {\\n d[pp] = d[p] + 1;\\n q.push(pp);\\n }\\n }\\n }\\n cout << d[n+1] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 49784,\n \"score_of_the_acc\": -1.3333,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3183_8041004\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nstruct SCC{\\n vector<vector<int> > gg,rg;\\n vector<int> comp,order;\\n vector<bool> used;\\n vector<vector<int> > ng,vs;\\n int n,nn;\\n SCC(){}\\n SCC(int v):gg(v),rg(v),comp(v,-1),used(v,0),n(v){}\\n void add_edge(int x,int y){\\n gg[x].push_back(y);\\n rg[y].push_back(x);\\n }\\n void dfs(int v){\\n used[v]=1;\\n for(int i:gg[v]){\\n if(!used[i])dfs(i);\\n }\\n order.push_back(v);\\n }\\n void rdfs(int v,int k){\\n used[v]=1;\\n comp[v]=k;\\n for(int i:rg[v]){\\n if(!used[i])rdfs(i,k);\\n }\\n }\\n int build(){\\n for(int i=0;i<n;i++){\\n if(!used[i])dfs(i);\\n }\\n for(int i=0;i<n;i++){\\n used[i]=0;\\n }\\n int k=0;\\n for(int i=order.size()-1;i>=0;i--){\\n if(!used[order[i]])rdfs(order[i],k++);\\n }\\n nn=k;\\n // それぞれの強連結成分に含まれる頂点の番号\\n vs.resize(k,vector<int>());\\n for(int i=0;i<n;i++){\\n vs[comp[i]].push_back(i);\\n }\\n // 強連結成分をまとめた後のグラフ\\n ng.resize(k,vector<int>());\\n for(int i=0;i<n;i++){\\n for(int j:gg[i]){\\n if(comp[i]!=comp[j]){\\n ng[comp[i]].push_back(comp[j]);\\n }\\n }\\n }\\n for(int i=0;i<nn;i++){\\n sort(ng[i].begin(),ng[i].end());\\n ng[i].erase(unique(ng[i].begin(),ng[i].end()),ng[i].end());\\n }\\n return k;\\n }\\n};\\n\\ntemplate<typename T>\\nstruct dinic{\\n struct edge{\\n int to;\\n T c,f;\\n };\\n T eps;\\n const T inf=numeric_limits<T>::max();\\n int n,m = 0;\\n vector<edge> e;\\n vector<vector<int>> g;\\n vector<int> level, ptr;\\n dinic(int n): n(n), g(n), level(n), ptr(n) {\\n eps = (T)1 / (T)1e9;\\n }\\n void add_edge(int s, int t, T c){\\n e.push_back({t, c, 0});\\n e.push_back({s, 0, 0});\\n g[s].push_back(m++);\\n g[t].push_back(m++);\\n }\\n bool bfs(int s, int t){\\n fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n for(queue<int> q({s});q.size();q.pop()){\\n int s = q.front();\\n for(int i:g[s]){\\n int t = e[i].to;\\n if(level[t] == -1 and (e[i].c - e[i].f) > eps){\\n level[t] = level[s] + 1;\\n q.push(t);\\n }\\n }\\n }\\n return (level[t] != -1);\\n }\\n T dfs(int s, int t, T psh){\\n if(!(psh > eps) or s == t) return psh;\\n for(int &i = ptr[s]; i < (int)g[s].size(); ++i){\\n auto &eg = e[g[s][i]];\\n if(level[eg.to] != level[s] + 1 or !(eg.c - eg.f > eps)) continue;\\n T f = dfs(eg.to, t, min(psh, eg.c-eg.f));\\n if(f > eps){\\n eg.f += f;\\n e[g[s][i]^1].f -= f;\\n return f;\\n }\\n }\\n return 0;\\n }\\n T max_flow(int s, int t){\\n T f = 0;\\n while(bfs(s,t)){\\n fill(ptr.begin(), ptr.end(), 0);\\n while(1){\\n T c = dfs(s, t, inf);\\n if(c > eps){\\n f += c;\\n }\\n else{\\n break;\\n }\\n }\\n }\\n return f;\\n }\\n // ABC239-G\\n vector<bool> min_cut(int s){\\n vector<bool> visited(n);\\n queue<int> q; q.push(s);\\n while(q.size()){\\n int p = q.front(); q.pop();\\n visited[p] = true;\\n for(auto idx:g[p]){\\n auto eg = e[idx];\\n if(eg.c - eg.f > eps and !visited[eg.to]){\\n visited[eg.to] = true;\\n q.push(eg.to);\\n }\\n }\\n }\\n return visited;\\n }\\n};\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n,m; cin >> n >> m;\\n SCC G(n);\\n for (int i = 0; i < m; ++i) {\\n int x,y; cin >> x >> y;\\n x--; y--;\\n G.add_edge(x, y);\\n }\\n int sz = G.build();\\n if (sz == 1) {\\n cout << 0 << endl;\\n return 0;\\n }\\n auto ng = G.ng;\\n int s = -1, t = -1;\\n {\\n vector<int> deg(sz);\\n for (int i = 0; i < sz; ++i) {\\n for (int j : ng[i]) {\\n deg[j]++;\\n }\\n }\\n for (int i = 0; i < sz; ++i) {\\n if (deg[i] == 0) {\\n if (s == -1) s = i;\\n else {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n for (int i = 0; i < sz; ++i) {\\n if (ng[i].size() == 0) {\\n if (t == -1) t = i;\\n else {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n }\\n vector<vector<int>> g(n+2);\\n dinic<int> dc(n+2);\\n for (int i = 0; i < n; ++i) {\\n int u = (i == s ? n : i);\\n for (int j : G.gg[i]) {\\n int v = (j == t ? n+1 : j);\\n g[u].push_back(v);\\n dc.add_edge(u, v, 1);\\n }\\n }\\n if (dc.max_flow(n, n+1) == 1) {\\n cout << -1 << endl;\\n return 0;\\n }\\n vector<int> d(n+2, -1);\\n queue<int> q;\\n q.push(n); d[n] = 0;\\n while (q.size()) {\\n int p = q.front(); q.pop();\\n for (int pp : g[p]) {\\n if (d[pp] == -1) {\\n d[pp] = d[p] + 1;\\n q.push(pp);\\n }\\n }\\n }\\n cout << d[n+1] << endl;\\n}\",\n \"accuracy\": 0.3783783783783784,\n \"time_ms\": 30,\n \"memory_kb\": 21464,\n \"score_of_the_acc\": 0,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3183_4878836\",\n \"code_snippet\": \"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3183\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\n//END CUT HERE\\n#ifndef call_from_test\\n//INSERT ABOVE HERE\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\nstruct SCC{\\n vector< vector<int> > G,R,H,C;\\n vector<int> vs,used,blg;\\n SCC(){}\\n SCC(int n):G(n),R(n),used(n),blg(n){}\\n\\n void add_edge(int u,int v){\\n G[u].emplace_back(v);\\n R[v].emplace_back(u);\\n }\\n\\n void dfs(int v){\\n used[v]=1;\\n for(int u:G[v])\\n if(!used[u]) dfs(u);\\n vs.emplace_back(v);\\n }\\n\\n void rdfs(int v,int k){\\n used[v]=1;\\n blg[v]=k;\\n C[k].emplace_back(v);\\n for(int u:R[v])\\n if(!used[u]) rdfs(u,k);\\n }\\n\\n int build(bool uniq=true){\\n int n=G.size();\\n for(int v=0;v<n;v++)\\n if(!used[v]) dfs(v);\\n\\n fill(used.begin(),used.end(),0);\\n int k=0;\\n for(int i=n-1;i>=0;i--){\\n if(!used[vs[i]]){\\n H.emplace_back();\\n C.emplace_back();\\n rdfs(vs[i],k++);\\n }\\n }\\n\\n for(int v=0;v<n;v++)\\n for(int u:G[v])\\n if(blg[v]!=blg[u])\\n H[blg[v]].push_back(blg[u]);\\n\\n if(uniq){\\n for(int i=0;i<k;i++){\\n sort(H[i].begin(),H[i].end());\\n H[i].erase(unique(H[i].begin(),H[i].end()),H[i].end());\\n }\\n }\\n return k;\\n }\\n\\n int operator[](int k) const{return blg[k];}\\n};\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T>\\nstruct Dijkstra{\\n struct Edge{\\n int to;\\n T cost;\\n Edge(int to,T cost):to(to),cost(cost){}\\n bool operator<(const Edge &o)const{return cost>o.cost;}\\n };\\n\\n vector< vector<Edge> > G;\\n vector<T> ds;\\n vector<int> bs;\\n Dijkstra(int n):G(n){}\\n\\n void add_edge(int u,int v,T c){\\n G[u].emplace_back(v,c);\\n }\\n\\n void build(int s){\\n int n=G.size();\\n ds.assign(n,numeric_limits<T>::max());\\n bs.assign(n,-1);\\n\\n priority_queue<Edge> pq;\\n ds[s]=0;\\n pq.emplace(s,ds[s]);\\n\\n while(!pq.empty()){\\n auto p=pq.top();pq.pop();\\n int v=p.to;\\n if(ds[v]<p.cost) continue;\\n for(auto e:G[v]){\\n if(ds[e.to]>ds[v]+e.cost){\\n ds[e.to]=ds[v]+e.cost;\\n bs[e.to]=v;\\n pq.emplace(e.to,ds[e.to]);\\n }\\n }\\n }\\n }\\n\\n T operator[](int k){return ds[k];}\\n\\n vector<int> restore(int to){\\n vector<int> res;\\n if(bs[to]<0) return res;\\n while(~to) res.emplace_back(to),to=bs[to];\\n reverse(res.begin(),res.end());\\n return res;\\n }\\n};\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\n// O(F E \\\\log V)\\ntemplate<typename Flow, bool directed>\\nstruct FordFulkerson{\\n struct edge{\\n int dst;\\n Flow cap;\\n int rev;\\n edge(){}\\n edge(int dst,Flow cap,int rev):dst(dst),cap(cap),rev(rev){}\\n };\\n\\n vector< vector<edge> > G;\\n vector<int> used;\\n\\n FordFulkerson(){}\\n FordFulkerson(int n):G(n),used(n){}\\n\\n int add_edge(int src,int dst,Flow cap){\\n int e=G[src].size();\\n int r=(src==dst?e+1:G[dst].size());\\n G[src].emplace_back(dst,cap,r);\\n G[dst].emplace_back(src,directed?0:cap,e);\\n return e;\\n }\\n\\n Flow dfs(int v,int t,Flow f){\\n if(v==t) return f;\\n used[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n edge &e=G[v][i];\\n if(!used[e.dst]&&e.cap>0){\\n Flow d=dfs(e.dst,t,min(f,e.cap));\\n if(d==0) continue;\\n e.cap-=d;\\n G[e.dst][e.rev].cap+=d;\\n return d;\\n }\\n }\\n return 0;\\n }\\n\\n Flow flow(int s,int t,Flow lim){\\n Flow fl=0;\\n while(1){\\n fill(used.begin(),used.end(),0);\\n Flow f=dfs(s,t,lim);\\n if(f==0) break;\\n fl+=f;\\n lim-=f;\\n }\\n return fl;\\n }\\n\\n Flow flow(int s,int t){\\n return flow(s,t,numeric_limits<Flow>::max()/2);\\n }\\n};\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#undef call_from_test\\n\\nconst int MAX = 303;\\nint G[MAX][MAX]={};\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int n,m;\\n cin>>n>>m;\\n SCC G(n);\\n\\n int S=n,T=n+1;\\n Dijkstra<int> D(n+2);\\n FordFulkerson<int, true> F(n+2);\\n for(int i=0;i<m;i++){\\n int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.add_edge(u,v);\\n D.add_edge(u,v,1);\\n F.add_edge(u,v,1);\\n }\\n int k=G.build();\\n\\n vector<int> indeg(n,0);\\n vector<int> outdeg(n,0);\\n\\n for(int i=0;i<k;i++)\\n for(int j:G.H[i])\\n outdeg[i]++,indeg[j]++;\\n\\n for(int i=0;i<k;i++){\\n if(i!=0 and indeg[i]==0) drop(-1);\\n if(i!=k-1 and outdeg[i]==0) drop(-1);\\n }\\n\\n for(int i=0;i<n;i++){\\n if(G.blg[i]==0){\\n D.add_edge(S,i,0);\\n F.add_edge(S,i,2);\\n }\\n if(G.blg[i]==k-1){\\n D.add_edge(i,T,0);\\n F.add_edge(i,T,2);\\n }\\n }\\n\\n int res=F.flow(S,T,2);\\n if(res!=2) drop(-1);\\n\\n D.build(S);\\n if(~D.bs[T]) drop(D[T]);\\n drop(-1);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 47928,\n \"score_of_the_acc\": -1.3345,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3183_4875839\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\n\\nstruct SCC{\\n vector< vector<int> > G,R,T,C;\\n vector<int> vs,used,blg;\\n SCC(){}\\n SCC(int n):G(n),R(n),used(n),blg(n){}\\n\\n void add_edge(int u,int v){\\n G[u].emplace_back(v);\\n R[v].emplace_back(u);\\n }\\n\\n void dfs(int v){\\n used[v]=1;\\n for(int u:G[v])\\n if(!used[u]) dfs(u);\\n vs.emplace_back(v);\\n }\\n\\n void rdfs(int v,int k){\\n used[v]=1;\\n blg[v]=k;\\n C[k].emplace_back(v);\\n for(int u:R[v])\\n if(!used[u]) rdfs(u,k);\\n }\\n\\n int build(){\\n int n=G.size();\\n for(int v=0;v<n;v++)\\n if(!used[v]) dfs(v);\\n\\n fill(used.begin(),used.end(),0);\\n int k=0;\\n for(int i=n-1;i>=0;i--){\\n if(!used[vs[i]]){\\n T.emplace_back();\\n C.emplace_back();\\n rdfs(vs[i],k++);\\n }\\n }\\n\\n for(int v=0;v<n;v++)\\n for(int u:G[v])\\n if(blg[v]!=blg[u])\\n T[blg[v]].push_back(blg[u]);\\n/*\\n for(int i=0;i<k;i++){\\n sort(T[i].begin(),T[i].end());\\n T[i].erase(unique(T[i].begin(),T[i].end()),T[i].end());\\n }\\n*/\\n return k;\\n }\\n\\n int operator[](int k) const{return blg[k];}\\n};\\n\\n\\ntemplate<typename T,bool directed>\\nstruct FordFulkerson{\\n struct edge{\\n int to;\\n T cap;\\n int rev;\\n edge(){}\\n edge(int to,T cap,int rev):to(to),cap(cap),rev(rev){}\\n };\\n\\n vector< vector<edge> > G;\\n vector<int> used;\\n\\n FordFulkerson(){}\\n FordFulkerson(int n):G(n),used(n){}\\n\\n void add_edge(int from,int to,T cap){\\n G[from].emplace_back(to,cap,G[to].size());\\n G[to].emplace_back(from,directed?0:cap,G[from].size()-1);\\n }\\n\\n T dfs(int v,int t,T f){\\n if(v==t) return f;\\n used[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n edge &e=G[v][i];\\n if(!used[e.to]&&e.cap>0){\\n T d=dfs(e.to,t,min(f,e.cap));\\n if(d==0) continue;\\n e.cap-=d;\\n G[e.to][e.rev].cap+=d;\\n return d;\\n }\\n }\\n return 0;\\n }\\n\\n T flow(int s,int t,T lim){\\n T fl=0;\\n while(1){\\n fill(used.begin(),used.end(),0);\\n T f=dfs(s,t,lim);\\n if(f==0) break;\\n fl+=f;\\n lim-=f;\\n }\\n return fl;\\n }\\n\\n T flow(int s,int t){\\n return flow(s,t,numeric_limits<T>::max()/2);\\n }\\n};\\n\\n\\ntemplate<typename T>\\nstruct Dijkstra{\\n struct Edge{\\n int to;\\n T cost;\\n Edge(int to,T cost):to(to),cost(cost){}\\n bool operator<(const Edge &o)const{return cost>o.cost;}\\n };\\n\\n vector< vector<Edge> > G;\\n vector<T> ds;\\n vector<int> bs;\\n Dijkstra(int n):G(n){}\\n\\n void add_edge(int u,int v,T c){\\n G[u].emplace_back(v,c);\\n }\\n\\n void build(int s){\\n int n=G.size();\\n ds.assign(n,numeric_limits<T>::max());\\n bs.assign(n,-1);\\n\\n priority_queue<Edge> pq;\\n ds[s]=0;\\n pq.emplace(s,ds[s]);\\n\\n while(!pq.empty()){\\n auto p=pq.top();pq.pop();\\n int v=p.to;\\n if(ds[v]<p.cost) continue;\\n for(auto e:G[v]){\\n if(ds[e.to]>ds[v]+e.cost){\\n ds[e.to]=ds[v]+e.cost;\\n bs[e.to]=v;\\n pq.emplace(e.to,ds[e.to]);\\n }\\n }\\n }\\n }\\n\\n T operator[](int k){return ds[k];}\\n\\n vector<int> restore(int to){\\n vector<int> res;\\n if(bs[to]<0) return res;\\n while(~to) res.emplace_back(to),to=bs[to];\\n reverse(res.begin(),res.end());\\n return res;\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int n,m;\\n cin>>n>>m;\\n SCC G(n);\\n\\n int S=n,T=n+1;\\n Dijkstra<int> D(n+2);\\n FordFulkerson<int, true> F(n+2);\\n for(int i=0;i<m;i++){\\n int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.add_edge(u,v);\\n D.add_edge(u,v,1);\\n F.add_edge(u,v,1);\\n }\\n int k=G.build();\\n\\n vector<int> indeg(n,0);\\n vector<int> outdeg(n,0);\\n\\n for(int i=0;i<k;i++)\\n for(int j:G.T[i])\\n outdeg[i]++,indeg[j]++;\\n\\n for(int i=0;i<k;i++){\\n if(i!=0 and indeg[i]==0) drop(-1);\\n if(i!=k-1 and outdeg[i]==0) drop(-1);\\n }\\n\\n for(int i=0;i<n;i++){\\n if(G.blg[i]==0){\\n D.add_edge(S,i,0);\\n F.add_edge(S,i,2);\\n }\\n if(G.blg[i]==k-1){\\n D.add_edge(i,T,0);\\n F.add_edge(i,T,2);\\n }\\n }\\n\\n int res=F.flow(S,T,2);\\n // cout<<res<<endl;\\n if(res!=2) drop(-1);\\n\\n D.build(S);\\n if(~D.bs[T]) drop(D[T]);\\n drop(-1);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 47256,\n \"score_of_the_acc\": -1.3774,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3183_4850510\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\n\\n#define fi first\\n#define se second\\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n#define mmax(x,y) (x>y?x:y)\\n#define mmin(x,y) (x<y?x:y)\\n#define maxch(x,y) x=mmax(x,y)\\n#define minch(x,y) x=mmin(x,y)\\n#define uni(x) x.erase(unique(all(x)),x.end())\\n#define exist(x,y) (find(all(x),y)!=x.end())\\n#define bcnt __builtin_popcountll\\n\\n#define INF INT_MAX/3\\n#define mod 1000000007\\n\\n#define MAX_V 100010\\n\\nstruct edge{ int to,cap,rev; };\\nvector<edge> g[MAX_V];\\nint level[MAX_V];\\nint iter[MAX_V];\\n\\nvoid add_edge_f(int from,int to,int cap){\\n g[from].push_back((edge){to,cap,(int)g[to].size()});\\n g[to].push_back((edge){from,0,(int)g[from].size()-1});\\n}\\n\\nvoid bfs_f(int s){\\n memset(level,-1,sizeof(level));\\n queue<int> que;\\n level[s]=0;\\n que.push(s);\\n while(!que.empty()){\\n int v=que.front(); que.pop();\\n for(int i=0;i<(int)g[v].size();i++){\\n edge &e=g[v][i];\\n if(e.cap>0&&level[e.to]<0){\\n level[e.to]=level[v]+1;\\n que.push(e.to);\\n }\\n }\\n }\\n}\\n\\nint min_dist_f(int s, int t){\\n memset(level,-1,sizeof(level));\\n queue<int> que;\\n level[s]=0;\\n que.push(s);\\n while(!que.empty()){\\n int v=que.front(); que.pop();\\n for(int i=0;i<(int)g[v].size();i++){\\n edge &e=g[v][i];\\n if(e.cap>0&&level[e.to]<0){\\n level[e.to]=level[v]+1;\\n que.push(e.to);\\n }\\n }\\n }\\n return level[t];\\n}\\n\\nint dfs_f(int v,int t,int f){\\n if(v==t)return f;\\n for(int &i=iter[v];i<(int)g[v].size();i++){\\n edge &e=g[v][i];\\n if(e.cap>0&&level[v]<level[e.to]){\\n int d=dfs_f(e.to,t,min(f,e.cap));\\n if(d>0){\\n e.cap-=d;\\n g[e.to][e.rev].cap+=d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint max_flow(int s,int t){\\n int flow=0;\\n while(1){\\n bfs_f(s);\\n if(level[t]<0)return flow;\\n memset(iter,0,sizeof(iter));\\n int f;\\n while((f=dfs_f(s,t,INF))>0){\\n flow+=f;\\n }\\n }\\n}\\n\\nint V;\\nvector<int> G[MAX_V];\\nvector<int> rG[MAX_V];\\nvector<int> vs;\\nbool used[MAX_V];\\nint cmp[MAX_V];\\n\\nvoid add_edge(int from,int to){\\n G[from].push_back(to);\\n rG[to].push_back(from);\\n}\\n\\nvoid dfs(int v){\\n used[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n if(!used[G[v][i]])dfs(G[v][i]);\\n }\\n vs.push_back(v);\\n}\\n\\nvoid rdfs(int v,int k){\\n used[v]=true;\\n cmp[v]=k;\\n for(int i=0;i<(int)rG[v].size();i++){\\n if(!used[rG[v][i]])rdfs(rG[v][i],k);\\n }\\n}\\n\\nint scc(){\\n memset(used,0,sizeof(used));\\n vs.clear();\\n for(int v=0;v<V;v++){\\n if(!used[v])dfs(v);\\n }\\n memset(used,0,sizeof(used));\\n int k=0;\\n for(int i=(int)vs.size()-1;i>=0;i--){\\n if(!used[vs[i]])rdfs(vs[i],k++);\\n }\\n return k;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int N,M;\\n cin>>N>>M;\\n rep(i,M){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n add_edge(a,b);\\n }\\n V=N;\\n int K=scc();\\n if(K==1){\\n cout<<0<<endl;\\n return 0;\\n }\\n\\n vector<int> ideg(K,0),odeg(K,0);\\n rep(i,N){\\n for(int v : G[i]){\\n if(cmp[i]==cmp[v])continue;\\n odeg[cmp[i]]++;\\n ideg[cmp[v]]++;\\n }\\n }\\n\\n int izcnt=0,ozcnt=0;\\n int icmp=-1,ocmp=-1;\\n rep(i,K){\\n if(ideg[i]==0){\\n izcnt++;\\n icmp=i;\\n }\\n if(odeg[i]==0){\\n ozcnt++;\\n ocmp=i;\\n }\\n }\\n if(izcnt>1||ozcnt>1){\\n cout<<-1<<endl;\\n return 0;\\n }\\n\\n int source=N,sink=N+1;\\n rep(i,N){\\n if(cmp[i]==icmp){\\n for(int v : G[i]){\\n if(cmp[v]==icmp)continue;\\n if(cmp[v]==ocmp){\\n add_edge_f(source,sink,1);\\n }else{\\n add_edge_f(source,v,1);\\n }\\n }\\n }else if(cmp[i]==ocmp){\\n\\n }else{\\n for(int v : G[i]){\\n if(cmp[v]==ocmp){\\n add_edge_f(i,sink,1);\\n }else{\\n add_edge_f(i,v,1);\\n }\\n }\\n }\\n }\\n\\n int min_d = min_dist_f(source,sink);\\n int max_f = max_flow(source,sink);\\n if(max_f>1) cout<<min_d<<endl;\\n else cout<<-1<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 25028,\n \"score_of_the_acc\": -0.3258,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3183_4850419\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\n\\n#define fi first\\n#define se second\\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n#define mmax(x,y) (x>y?x:y)\\n#define mmin(x,y) (x<y?x:y)\\n#define maxch(x,y) x=mmax(x,y)\\n#define minch(x,y) x=mmin(x,y)\\n#define uni(x) x.erase(unique(all(x)),x.end())\\n#define exist(x,y) (find(all(x),y)!=x.end())\\n#define bcnt __builtin_popcountll\\n\\n#define INF INT_MAX/3\\n#define mod 1000000007\\n\\n#define MAX_V 100010\\n\\nstruct edge{ int to,cap,rev; };\\nvector<edge> g[MAX_V];\\nint level[MAX_V];\\nint iter[MAX_V];\\n\\nvoid add_edge_f(int from,int to,int cap){\\n g[from].push_back((edge){to,cap,(int)g[to].size()});\\n g[to].push_back((edge){from,0,(int)g[from].size()-1});\\n}\\n\\nvoid bfs_f(int s){\\n memset(level,-1,sizeof(level));\\n queue<int> que;\\n level[s]=0;\\n que.push(s);\\n while(!que.empty()){\\n int v=que.front(); que.pop();\\n for(int i=0;i<(int)g[v].size();i++){\\n edge &e=g[v][i];\\n if(e.cap>0&&level[e.to]<0){\\n level[e.to]=level[v]+1;\\n que.push(e.to);\\n }\\n }\\n }\\n}\\n\\nint min_dist_f(int s, int t){\\n memset(level,-1,sizeof(level));\\n queue<int> que;\\n level[s]=0;\\n que.push(s);\\n while(!que.empty()){\\n int v=que.front(); que.pop();\\n for(int i=0;i<(int)g[v].size();i++){\\n edge &e=g[v][i];\\n if(e.cap>0&&level[e.to]<0){\\n level[e.to]=level[v]+1;\\n que.push(e.to);\\n }\\n }\\n }\\n return level[t];\\n}\\n\\nint dfs_f(int v,int t,int f){\\n if(v==t)return f;\\n for(int &i=iter[v];i<(int)g[v].size();i++){\\n edge &e=g[v][i];\\n if(e.cap>0&&level[v]<level[e.to]){\\n int d=dfs_f(e.to,t,min(f,e.cap));\\n if(d>0){\\n e.cap-=d;\\n g[e.to][e.rev].cap+=d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint max_flow(int s,int t){\\n int flow=0;\\n while(1){\\n bfs_f(s);\\n if(level[t]<0)return flow;\\n memset(iter,0,sizeof(iter));\\n int f;\\n while((f=dfs_f(s,t,INF))>0){\\n flow+=f;\\n }\\n }\\n}\\n\\nint V;\\nvector<int> G[MAX_V];\\nvector<int> rG[MAX_V];\\nvector<int> vs;\\nbool used[MAX_V];\\nint cmp[MAX_V];\\n\\nvoid add_edge(int from,int to){\\n G[from].push_back(to);\\n rG[to].push_back(from);\\n}\\n\\nvoid dfs(int v){\\n used[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n if(!used[G[v][i]])dfs(G[v][i]);\\n }\\n vs.push_back(v);\\n}\\n\\nvoid rdfs(int v,int k){\\n used[v]=true;\\n cmp[v]=k;\\n for(int i=0;i<(int)rG[v].size();i++){\\n if(!used[rG[v][i]])rdfs(rG[v][i],k);\\n }\\n}\\n\\nint scc(){\\n memset(used,0,sizeof(used));\\n vs.clear();\\n for(int v=0;v<V;v++){\\n if(!used[v])dfs(v);\\n }\\n memset(used,0,sizeof(used));\\n int k=0;\\n for(int i=(int)vs.size()-1;i>=0;i--){\\n if(!used[vs[i]])rdfs(vs[i],k++);\\n }\\n return k;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int N,M;\\n cin>>N>>M;\\n rep(i,M){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n add_edge(a,b);\\n }\\n V=N;\\n int K=scc();\\n if(K==1){\\n cout<<0<<endl;\\n return 0;\\n }\\n\\n vector<int> ideg(K,0),odeg(K,0);\\n rep(i,N){\\n for(int v : G[i]){\\n odeg[cmp[i]]++;\\n ideg[cmp[v]]++;\\n }\\n }\\n\\n int izcnt=0,ozcnt=0;\\n int icmp=-1,ocmp=-1;\\n rep(i,K){\\n if(ideg[i]==0){\\n izcnt++;\\n icmp=i;\\n }\\n if(odeg[i]==0){\\n ozcnt++;\\n ocmp=i;\\n }\\n }\\n if(izcnt>1||ozcnt>1){\\n cout<<-1<<endl;\\n return 0;\\n }\\n\\n int source=N,sink=N+1;\\n rep(i,N){\\n if(cmp[i]==icmp){\\n for(int v : G[i]){\\n if(cmp[v]==icmp)continue;\\n if(cmp[v]==ocmp){\\n add_edge_f(source,sink,1);\\n }else{\\n add_edge_f(source,v,1);\\n }\\n }\\n }else if(cmp[i]==ocmp){\\n\\n }else{\\n for(int v : G[i]){\\n if(cmp[v]==ocmp){\\n add_edge_f(i,sink,1);\\n }else{\\n add_edge_f(i,v,1);\\n }\\n }\\n }\\n }\\n\\n int min_d = min_dist_f(source,sink);\\n int max_f = max_flow(source,sink);\\n if(max_f>1)cout<<min_d<<endl;\\n else cout<<-1<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 40,\n \"memory_kb\": 22612,\n \"score_of_the_acc\": -0.1072,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3183_4850412\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\n\\n#define fi first\\n#define se second\\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n#define mmax(x,y) (x>y?x:y)\\n#define mmin(x,y) (x<y?x:y)\\n#define maxch(x,y) x=mmax(x,y)\\n#define minch(x,y) x=mmin(x,y)\\n#define uni(x) x.erase(unique(all(x)),x.end())\\n#define exist(x,y) (find(all(x),y)!=x.end())\\n#define bcnt __builtin_popcountll\\n\\n#define INF INT_MAX/3\\n#define mod 1000000007\\n\\n#define MAX_V 100010\\n\\nstruct edge{ int to,cap,rev; };\\nvector<edge> g[MAX_V];\\nint level[MAX_V];\\nint iter[MAX_V];\\n\\nvoid add_edge_f(int from,int to,int cap){\\n g[from].push_back((edge){to,cap,(int)g[to].size()});\\n g[to].push_back((edge){from,0,(int)g[from].size()-1});\\n}\\n\\nvoid bfs_f(int s){\\n memset(level,-1,sizeof(level));\\n queue<int> que;\\n level[s]=0;\\n que.push(s);\\n while(!que.empty()){\\n int v=que.front(); que.pop();\\n for(int i=0;i<(int)g[v].size();i++){\\n edge &e=g[v][i];\\n if(e.cap>0&&level[e.to]<0){\\n level[e.to]=level[v]+1;\\n que.push(e.to);\\n }\\n }\\n }\\n}\\n\\nint min_dist_f(int s, int t){\\n memset(level,-1,sizeof(level));\\n queue<int> que;\\n level[s]=0;\\n que.push(s);\\n while(!que.empty()){\\n int v=que.front(); que.pop();\\n for(int i=0;i<(int)g[v].size();i++){\\n edge &e=g[v][i];\\n if(e.cap>0&&level[e.to]<0){\\n level[e.to]=level[v]+1;\\n que.push(e.to);\\n }\\n }\\n }\\n return level[t];\\n}\\n\\nint dfs_f(int v,int t,int f){\\n if(v==t)return f;\\n for(int &i=iter[v];i<(int)g[v].size();i++){\\n edge &e=g[v][i];\\n if(e.cap>0&&level[v]<level[e.to]){\\n int d=dfs_f(e.to,t,min(f,e.cap));\\n if(d>0){\\n e.cap-=d;\\n g[e.to][e.rev].cap+=d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint max_flow(int s,int t){\\n int flow=0;\\n while(1){\\n bfs_f(s);\\n if(level[t]<0)return flow;\\n memset(iter,0,sizeof(iter));\\n int f;\\n while((f=dfs_f(s,t,INF))>0){\\n flow+=f;\\n }\\n }\\n}\\n\\nint V;\\nvector<int> G[MAX_V];\\nvector<int> rG[MAX_V];\\nvector<int> vs;\\nbool used[MAX_V];\\nint cmp[MAX_V];\\n\\nvoid add_edge(int from,int to){\\n G[from].push_back(to);\\n rG[to].push_back(from);\\n}\\n\\nvoid dfs(int v){\\n used[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n if(!used[G[v][i]])dfs(G[v][i]);\\n }\\n vs.push_back(v);\\n}\\n\\nvoid rdfs(int v,int k){\\n used[v]=true;\\n cmp[v]=k;\\n for(int i=0;i<(int)rG[v].size();i++){\\n if(!used[rG[v][i]])rdfs(rG[v][i],k);\\n }\\n}\\n\\nint scc(){\\n memset(used,0,sizeof(used));\\n vs.clear();\\n for(int v=0;v<V;v++){\\n if(!used[v])dfs(v);\\n }\\n memset(used,0,sizeof(used));\\n int k=0;\\n for(int i=(int)vs.size()-1;i>=0;i--){\\n if(!used[vs[i]])rdfs(vs[i],k++);\\n }\\n return k;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int N,M;\\n cin>>N>>M;\\n rep(i,M){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n add_edge(a,b);\\n }\\n V=N;\\n int K=scc();\\n if(K==1){\\n cout<<0<<endl;\\n return 0;\\n }\\n\\n vector<int> ideg(K,0),odeg(K,0);\\n rep(i,N){\\n for(int v : G[i]){\\n odeg[cmp[i]]++;\\n ideg[cmp[v]]++;\\n }\\n }\\n\\n int izcnt=0,ozcnt=0;\\n int icmp=-1,ocmp=-1;\\n rep(i,K){\\n if(ideg[i]==0){\\n izcnt++;\\n icmp=i;\\n }\\n if(odeg[i]==0){\\n ozcnt++;\\n ocmp=i;\\n }\\n }\\n if(izcnt>1||ozcnt>1){\\n cout<<-1<<endl;\\n }\\n\\n int source=N,sink=N+1;\\n rep(i,N){\\n if(cmp[i]==icmp){\\n for(int v : G[i]){\\n if(cmp[v]==icmp)continue;\\n if(cmp[v]==ocmp){\\n add_edge_f(source,sink,1);\\n }else{\\n add_edge_f(source,v,1);\\n }\\n }\\n }else if(cmp[i]==ocmp){\\n\\n }else{\\n for(int v : G[i]){\\n if(cmp[v]==ocmp){\\n add_edge_f(i,sink,1);\\n }else{\\n add_edge_f(i,v,1);\\n }\\n }\\n }\\n }\\n\\n int min_d = min_dist_f(source,sink);\\n int max_f = max_flow(source,sink);\\n if(max_f>1)cout<<min_d<<endl;\\n else cout<<-1<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.28378378378378377,\n \"time_ms\": 30,\n \"memory_kb\": 22692,\n \"score_of_the_acc\": -0.0434,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3183_4849188\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\ntemplate<class T,class U> using P = pair<T,U>;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using vvec = vector<vec<T>>;\\n\\nclass strong_components{\\npublic:\\n\\tvector<vector<int>> v,rv,nv;\\n\\tvector<int> rs,visited,cmp,cmp_size;\\n\\tvoid dfs(int n){\\n\\t\\tvisited[n] = 1;\\n\\t\\tfor(auto x:v[n]) if(!visited[x]) dfs(x);\\n\\t\\trs.push_back(n);\\n\\t}\\n\\tvoid rdfs(int n,int cnt){\\n\\t\\tvisited[n] = 1;\\n\\t\\tcmp[n] = cnt;\\n\\t\\tfor(auto x:rv[n]) if(!visited[x]) rdfs(x,cnt);\\n\\t}\\n\\tstrong_components(int N,vector<vector<int>>& graph){\\n\\t\\tv = graph;\\n\\t\\trv = vector<vector<int>>(N);\\n\\t\\tvisited = cmp = cmp_size = vector<int>(N,0);\\n\\t\\tfor(int i=0;i<N;i++) for(auto x:v[i]) rv[x].push_back(i);\\n\\t\\tfor(int i=0;i<N;i++) if(!visited[i]) dfs(i);\\n\\t\\tfor(int i=0;i<N;i++) visited[i] = 0;\\n\\t\\tint now = 0;\\n\\t\\tfor(int i=rs.size()-1;i>=0;i--) if(!visited[rs[i]]) rdfs(rs[i],now++);\\n\\t\\tnv = vector<vector<int>>(now);\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tfor(auto x:v[i]){\\n\\t\\t\\t\\tif(cmp[i]!=cmp[x]){\\n\\t\\t\\t\\t\\tnv[cmp[i]].push_back(cmp[x]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<N;i++) cmp_size[cmp[i]]++;\\n\\t}\\n\\tint find(int n){return cmp[n];}\\n\\tint size(int n){return cmp_size[cmp[n]];}\\n\\tbool is_same_group(int a,int b){return cmp[a]==cmp[b];}\\n};\\n\\nconstexpr int inf = 1e9;\\nclass network_flow{\\nprivate:\\n\\tstruct edge{int to, cap, rev;};\\n\\tvector<vector<edge>> G;\\n\\tvector<bool> used;\\npublic:\\n\\tnetwork_flow(int N){\\n\\t\\tG = vector<vector<edge>>(N+1);\\n\\t\\tused = vector<bool>(N+1,0); \\n\\t}\\n\\tvoid add_edge(int from, int to, int cap){\\n\\t\\tG[from].push_back((edge){to,cap,(int) G[to].size()});\\n\\t\\tG[to].push_back((edge){from,0,(int) G[from].size()-1});\\n\\t}\\n\\tint dfs(int v,int t,int f){\\n\\t\\tif(v==t) return f;\\n\\t\\tused[v] = true;\\n\\t\\tfor(int i=0;i<G[v].size();i++){\\n\\t\\t\\tedge &e = G[v][i];\\n\\t\\t\\tif(!used[e.to] && e.cap>0){\\n\\t\\t\\t\\tint d = dfs(e.to,t,min(f,e.cap));\\n\\t\\t\\t\\tif(d>0){\\n\\t\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\tint max_flow(int s,int t){\\n\\t\\tint flow = 0;\\n\\t\\tfor(;;){\\n\\t\\t\\tif(flow>1) return flow;\\n\\t\\t\\tfor(int i=0;i<(int)used.size();i++) used[i] = 0;\\n\\t\\t\\tint f = dfs(s,t,inf);\\n\\t\\t\\tif(f==0) return flow;\\n\\t\\t\\tflow += f;\\n\\t\\t}\\n\\t}\\n};\\n\\nint main(){\\n\\tint N,M;\\n\\tcin >> N >> M;\\n\\tvvec<int> g(N);\\n\\tfor(int i=0;i<M;i++){\\n\\t\\tint a,b;\\n\\t\\tcin >> a >> b;\\n\\t\\ta--; b--;\\n\\t\\tg[a].push_back(b);\\n\\t}\\n\\tstrong_components SCC(N,g);\\n\\tvvec<int> cmp_g = SCC.nv;\\n\\tint n = cmp_g.size();\\n\\tif(n==1){\\n\\t\\tcout << 0 << \\\"\\\\n\\\";\\n\\t\\treturn 0;\\n\\t}\\n\\tvec<int> indeg(n);\\n\\tint c = 0,t = 0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(cmp_g[i].size()==0){\\n\\t\\t\\tt = i;\\n\\t\\t\\tc++;\\n\\t\\t}\\n\\t\\tfor(auto& x:cmp_g[i]) indeg[x]++;\\n\\t}\\n\\tif(c>1 || count(indeg.begin(),indeg.end(),0)>1){\\n\\t\\tcout << -1 << \\\"\\\\n\\\";\\n\\t\\treturn 0;\\n\\t}\\n\\tint s = find(indeg.begin(),indeg.end(),0)-indeg.begin();\\n\\tvec<int> dist(N,inf);\\n\\tqueue<int> Q;\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tif(SCC.find(i)==s){\\n\\t\\t\\tdist[i] = 0;\\n\\t\\t\\tQ.push(i);\\n\\t\\t}\\n\\t}\\n\\twhile(!Q.empty()){\\n\\t\\tint cur = Q.front(); Q.pop();\\n\\t\\tfor(auto& to:g[cur]){\\n\\t\\t\\tif(dist[to]>dist[cur]+1){\\n\\t\\t\\t\\tdist[to] = dist[cur]+1;\\n\\t\\t\\t\\tQ.push(to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = inf;\\n\\tfor(int i=0;i<N;i++) if(SCC.find(i)==t) ans = min(ans,dist[i]);\\n\\tnetwork_flow flow(N+2);\\n\\tint S = N,T = N+1;\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tfor(auto& x:g[i]) flow.add_edge(i,x,1);\\n\\t\\tif(SCC.find(i)==s) flow.add_edge(S,i,2);\\n\\t\\tif(SCC.find(i)==t) flow.add_edge(i,T,2);\\n\\t}\\n\\tif(flow.max_flow(S,T)<2){\\n\\t\\tcout << -1 << \\\"\\\\n\\\";\\n\\t}else{\\n\\t\\tcout << ans << \\\"\\\\n\\\";\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 42040,\n \"score_of_the_acc\": -0.9932,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3183_4849185\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\ntemplate<class T,class U> using P = pair<T,U>;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using vvec = vector<vec<T>>;\\n\\nclass strong_components{\\npublic:\\n\\tvector<vector<int>> v,rv,nv;\\n\\tvector<int> rs,visited,cmp,cmp_size;\\n\\tvoid dfs(int n){\\n\\t\\tvisited[n] = 1;\\n\\t\\tfor(auto x:v[n]) if(!visited[x]) dfs(x);\\n\\t\\trs.push_back(n);\\n\\t}\\n\\tvoid rdfs(int n,int cnt){\\n\\t\\tvisited[n] = 1;\\n\\t\\tcmp[n] = cnt;\\n\\t\\tfor(auto x:rv[n]) if(!visited[x]) rdfs(x,cnt);\\n\\t}\\n\\tstrong_components(int N,vector<vector<int>>& graph){\\n\\t\\tv = graph;\\n\\t\\trv = vector<vector<int>>(N);\\n\\t\\tvisited = cmp = cmp_size = vector<int>(N,0);\\n\\t\\tfor(int i=0;i<N;i++) for(auto x:v[i]) rv[x].push_back(i);\\n\\t\\tfor(int i=0;i<N;i++) if(!visited[i]) dfs(i);\\n\\t\\tfor(int i=0;i<N;i++) visited[i] = 0;\\n\\t\\tint now = 0;\\n\\t\\tfor(int i=rs.size()-1;i>=0;i--) if(!visited[rs[i]]) rdfs(rs[i],now++);\\n\\t\\tnv = vector<vector<int>>(now);\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tfor(auto x:v[i]){\\n\\t\\t\\t\\tif(cmp[i]!=cmp[x]){\\n\\t\\t\\t\\t\\tnv[cmp[i]].push_back(cmp[x]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<N;i++) cmp_size[cmp[i]]++;\\n\\t}\\n\\tint find(int n){return cmp[n];}\\n\\tint size(int n){return cmp_size[cmp[n]];}\\n\\tbool is_same_group(int a,int b){return cmp[a]==cmp[b];}\\n};\\n\\nconstexpr int inf = 1e9;\\nclass network_flow{\\nprivate:\\n\\tstruct edge{int to, cap, rev;};\\n\\tvector<vector<edge>> G;\\n\\tvector<bool> used;\\npublic:\\n\\tnetwork_flow(int N){\\n\\t\\tG = vector<vector<edge>>(N+1);\\n\\t\\tused = vector<bool>(N+1,0); \\n\\t}\\n\\tvoid add_edge(int from, int to, int cap){\\n\\t\\tG[from].push_back((edge){to,cap,(int) G[to].size()});\\n\\t\\tG[to].push_back((edge){from,0,(int) G[from].size()-1});\\n\\t}\\n\\tint dfs(int v,int t,int f){\\n\\t\\tif(v==t) return f;\\n\\t\\tused[v] = true;\\n\\t\\tfor(int i=0;i<G[v].size();i++){\\n\\t\\t\\tedge &e = G[v][i];\\n\\t\\t\\tif(!used[e.to] && e.cap>0){\\n\\t\\t\\t\\tint d = dfs(e.to,t,min(f,e.cap));\\n\\t\\t\\t\\tif(d>0){\\n\\t\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\tint max_flow(int s,int t){\\n\\t\\tint flow = 0;\\n\\t\\tfor(;;){\\n\\t\\t\\tif(flow>1) return flow;\\n\\t\\t\\tfor(int i=0;i<(int)used.size();i++) used[i] = 0;\\n\\t\\t\\tint f = dfs(s,t,inf);\\n\\t\\t\\tif(f==0) return flow;\\n\\t\\t\\tflow += f;\\n\\t\\t}\\n\\t}\\n};\\n\\nint main(){\\n\\tint N,M;\\n\\tcin >> N >> M;\\n\\tvvec<int> g(N);\\n\\tfor(int i=0;i<M;i++){\\n\\t\\tint a,b;\\n\\t\\tcin >> a >> b;\\n\\t\\ta--; b--;\\n\\t\\tg[a].push_back(b);\\n\\t}\\n\\tstrong_components SCC(N,g);\\n\\tvvec<int> cmp_g = SCC.nv;\\n\\tint n = cmp_g.size();\\n\\tif(n==1){\\n\\t\\tcout << 0 << \\\"\\\\n\\\";\\n\\t\\treturn 0;\\n\\t}\\n\\tvec<int> indeg(n);\\n\\tint c = 0,t = 0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(cmp_g[i].size()==0){\\n\\t\\t\\tt = i;\\n\\t\\t\\tc++;\\n\\t\\t}\\n\\t\\tfor(auto& x:cmp_g[i]) indeg[x]++;\\n\\t}\\n\\tif(c>1 || count(indeg.begin(),indeg.end(),0)>1){\\n\\t\\tcout << -1 << \\\"\\\\n\\\";\\n\\t\\treturn 0;\\n\\t}\\n\\tint s = find(indeg.begin(),indeg.end(),0)-indeg.begin();\\n\\tvec<int> dist(N,inf);\\n\\tqueue<int> Q;\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tif(SCC.find(i)==s){\\n\\t\\t\\tdist[i] = 0;\\n\\t\\t\\tQ.push(i);\\n\\t\\t}\\n\\t}\\n\\twhile(!Q.empty()){\\n\\t\\tint cur = Q.front(); Q.pop();\\n\\t\\tfor(auto& to:g[cur]){\\n\\t\\t\\tif(dist[to]>dist[cur]+1){\\n\\t\\t\\t\\tdist[to] = dist[cur]+1;\\n\\t\\t\\t\\tQ.push(to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = inf;\\n\\tfor(int i=0;i<N;i++) if(SCC.find(i)==t) ans = min(ans,dist[i]);\\n\\tnetwork_flow flow(n);\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(auto& x:cmp_g[i]) flow.add_edge(i,x,1);\\n\\t}\\n\\tif(flow.max_flow(s,t)<2){\\n\\t\\tcout << -1 << \\\"\\\\n\\\";\\n\\t}else{\\n\\t\\tcout << ans << \\\"\\\\n\\\";\\n\\t}\\n}\",\n \"accuracy\": 0.35135135135135137,\n \"time_ms\": 50,\n \"memory_kb\": 25896,\n \"score_of_the_acc\": -0.2898,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3183_4847727\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acos(-1.0);\\n\\n\\nstruct graph {\\nprivate:\\n\\tint n;\\n\\tvector<vector<int>> G, rG;\\n\\tvector<bool> used;\\n\\tvector<int> vs;\\n\\n\\tint mk;\\n\\tvector<vector<int>> fG;\\n\\tvector<vector<int>> ori;\\n\\tvector<int> trans;\\npublic:\\n\\tgraph(int sz) {\\n\\t\\tn = sz;\\n\\t\\tG.resize(n);\\n\\t\\trG.resize(n);\\n\\t\\tused.resize(n);\\n\\n\\t\\tfG.resize(n);\\n\\t\\ttrans.resize(n, -1);\\n\\t\\tori.resize(n);\\n\\t}\\n\\tvoid add_edge(int a, int b) {\\n\\t\\tG[a].push_back(b);\\n\\t\\trG[b].push_back(a);\\n\\t}\\n\\tvoid dfs(int v) {\\n\\t\\tused[v] = true;\\n\\t\\trep(i, G[v].size()) {\\n\\t\\t\\tif (!used[G[v][i]])dfs(G[v][i]);\\n\\t\\t}\\n\\t\\tvs.push_back(v);\\n\\t}\\n\\tvoid rdfs(int v, int k) {\\n\\t\\tused[v] = true;\\n\\t\\tqueue<int> q; q.push(v);\\n\\t\\tvector<int> c;\\n\\t\\twhile (!q.empty()) {\\n\\t\\t\\tint id = q.front(); q.pop();\\n\\t\\t\\tori[k].push_back(id);\\n\\t\\t\\trep(j, rG[id].size()) {\\n\\t\\t\\t\\tint to = rG[id][j];\\n\\t\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\t\\tif (trans[to] >= 0)c.push_back(trans[to]);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tused[to] = true; q.push(to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsort(c.begin(), c.end());\\n\\t\\tint len = unique(c.begin(), c.end()) - c.begin();\\n\\t\\trep(i, len) {\\n\\t\\t\\tfG[c[i]].push_back(k);\\n\\t\\t}\\n\\t\\trep(i, ori[k].size()) {\\n\\t\\t\\ttrans[ori[k][i]] = k;\\n\\t\\t}\\n\\t}\\n\\tvoid scc() {\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\trep(i, n) {\\n\\t\\t\\tif (!used[i])dfs(i);\\n\\t\\t}\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\tint k = 0;\\n\\t\\tper(i, (int)vs.size()) {\\n\\t\\t\\tif (!used[vs[i]]) {\\n\\t\\t\\t\\trdfs(vs[i], k); k++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmk = k;\\n\\t}\\n\\tvoid query() {\\n\\t\\tif (mk == 1) {\\n\\t\\t\\tcout << 0 << \\\"\\\\n\\\"; return;\\n\\t\\t}\\n\\t\\tvector<int> cnt(mk);\\n\\t\\trep(i, mk)for (int to : fG[i])cnt[to]++;\\n\\t\\tvector<int> sta, goa;\\n\\t\\trep(i, mk) {\\n\\t\\t\\tif (fG[i].empty())goa.push_back(i);\\n\\t\\t\\tif (cnt[i] == 0)sta.push_back(i);\\n\\t\\t}\\n\\t\\tif (sta.size() > 1 || goa.size() > 1) {\\n\\t\\t\\tcout << -1 << \\\"\\\\n\\\"; return;\\n\\t\\t}\\n\\t\\tvector<int> pre(n);\\n\\t\\tvector<int> dist(n, mod);\\n\\t\\tqueue<int> q;\\n\\t\\tfor (int id : ori[sta[0]]) {\\n\\t\\t\\tdist[id] = 0; pre[id] = -1;\\n\\t\\t\\tq.push(id);\\n\\t\\t}\\n\\t\\twhile (!q.empty()) {\\n\\t\\t\\tint v = q.front(); q.pop();\\n\\t\\t\\tfor (int to : G[v]) {\\n\\t\\t\\t\\tif (dist[v] + 1 < dist[to]) {\\n\\t\\t\\t\\t\\tdist[to] = dist[v] + 1;\\n\\t\\t\\t\\t\\tpre[to] = v;\\n\\t\\t\\t\\t\\tq.push(to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<int>> g(n);\\n\\t\\tvector<int> ban(n,-1);\\n\\t\\tint ans = mod;\\n\\t\\tint las = 0;\\n\\t\\tfor (int id : ori[goa[0]]) {\\n\\t\\t\\tif (ans > dist[id]) {\\n\\t\\t\\t\\tans = dist[id]; las = id;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile (pre[las]>= 0) {\\n\\t\\t\\tint p = pre[las];\\n\\t\\t\\tg[las].push_back(p);\\n\\t\\t\\tban[p] = las;\\n\\t\\t\\tlas = p;\\n\\t\\t}\\n\\t\\trep(i, n)for (int to : G[i])if (ban[i] != to) {\\n\\t\\t\\tg[i].push_back(to);\\n\\t\\t}\\n\\t\\tvector<bool> exi(n, false);\\n\\t\\tq.push(las);\\n\\t\\twhile (!q.empty()) {\\n\\t\\t\\tint v = q.front(); q.pop();\\n\\t\\t\\tfor (int to : g[v])if (!exi[to]) {\\n\\t\\t\\t\\texi[to] = true;\\n\\t\\t\\t\\tq.push(to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i, n)if (!exi[i]) {\\n\\t\\t\\tcout << -1 << \\\"\\\\n\\\"; return;\\n\\t\\t}\\n\\t\\tcout << ans << \\\"\\\\n\\\";\\n\\t}\\n};\\n\\n\\nvoid solve() {\\n\\tint n, m; cin >> n >> m;\\n\\tgraph g(n);\\n\\trep(i, m) {\\n\\t\\tint a, b; cin >> a >> b; a--; b--;\\n\\t\\tg.add_edge(a, b);\\n\\t}\\n\\n\\tg.scc();\\n\\tg.query();\\n}\\n\\n\\n\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 33484,\n \"score_of_the_acc\": -0.8911,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3183_4847565\",\n \"code_snippet\": \"#line 1 \\\"other/l2.cpp\\\"\\n#include <bits/extc++.h>\\n\\n#line 5 \\\"Library/config.hpp\\\"\\nnamespace config {\\nconst auto start_time{std::chrono::system_clock::now()};\\nint64_t elapsed() {\\n using namespace std::chrono;\\n const auto end_time{system_clock::now()};\\n return duration_cast<milliseconds>(end_time - start_time).count();\\n}\\n__attribute__((constructor)) void setup() {\\n using namespace std;\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n#ifdef _buffer_check\\n atexit([] {\\n char bufc;\\n if (cin >> bufc)\\n cerr << \\\"\\\\n\\\\033[43m\\\\033[30mwarning: buffer not empty.\\\\033[0m\\\\n\\\\n\\\";\\n });\\n#endif\\n}\\nunsigned cases(void), caseid = 1;\\ntemplate <class C> void main() {\\n for (const unsigned total = cases(); caseid <= total; ++caseid) C();\\n}\\n} // namespace config\\n#line 3 \\\"Library/gcc_builtin.hpp\\\"\\nnamespace workspace {\\nconstexpr int clz32(const uint32_t &n) noexcept { return __builtin_clz(n); }\\nconstexpr int clz64(const uint64_t &n) noexcept{ return __builtin_clzll(n); }\\nconstexpr int ctz(const uint64_t &n) noexcept { return __builtin_ctzll(n); }\\nconstexpr int popcnt(const uint64_t &n) noexcept { return __builtin_popcountll(n); }\\n} // namespace workspace\\n#line 2 \\\"Library/gcc_option.hpp\\\"\\n#ifdef ONLINE_JUDGE\\n #pragma GCC optimize(\\\"O3\\\")\\n #pragma GCC target(\\\"avx,avx2\\\")\\n #pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n#line 5 \\\"Library/utils/binary_search.hpp\\\"\\nnamespace workspace {\\n// binary search on discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,\\n iter_type>\\nbinary_search(iter_type ok, iter_type ng, pred_type pred) {\\n assert(ok != ng);\\n __int128_t dist(ng - ok);\\n while (dist > 1 || dist < -1) {\\n iter_type mid(ok + dist / 2);\\n if (pred(mid))\\n ok = mid, dist -= dist / 2;\\n else\\n ng = mid, dist /= 2;\\n }\\n return ok;\\n}\\n// parallel binary search on discrete range.\\ntemplate <class iter_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<iter_type>>,\\n std::vector<bool>>,\\n std::vector<iter_type>>\\nbinary_search(std::vector<std::pair<iter_type, iter_type>> ends,\\n pred_type pred) {\\n std::vector<iter_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n iter_type mid(ok + (ng - ok) / 2);\\n if (mids[i] != mid) {\\n all_found = false;\\n mids[i] = mid;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n// binary search on real numbers.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<\\n std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,\\n real_type>\\nbinary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {\\n assert(ok != ng);\\n while (ok + eps < ng || ng + eps < ok) {\\n real_type mid{(ok + ng) / 2};\\n (pred(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n// parallel binary search on real numbers.\\ntemplate <class real_type, class pred_type>\\nstd::enable_if_t<std::is_convertible_v<\\n std::invoke_result_t<pred_type, std::vector<real_type>>,\\n std::vector<bool>>,\\n std::vector<real_type>>\\nbinary_search(std::vector<std::pair<real_type, real_type>> ends,\\n const real_type eps, pred_type pred) {\\n std::vector<real_type> mids(ends.size());\\n for (;;) {\\n bool all_found = true;\\n for (size_t i{}; i != ends.size(); ++i) {\\n auto [ok, ng] = ends[i];\\n if (ok + eps < ng || ng + eps < ok) {\\n all_found = false;\\n mids[i] = (ok + ng) / 2;\\n }\\n }\\n if (all_found) break;\\n auto res = pred(mids);\\n for (size_t i{}; i != ends.size(); ++i) {\\n (res[i] ? ends[i].first : ends[i].second) = mids[i];\\n }\\n }\\n return mids;\\n}\\n} // namespace workspace\\n#line 3 \\\"Library/utils/casefmt.hpp\\\"\\nnamespace workspace {\\nstd::ostream &casefmt(std::ostream& os) { return os << \\\"Case #\\\" << config::caseid << \\\": \\\"; }\\n} // namespace workspace\\n#line 3 \\\"Library/utils/chval.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class Comp = std::less<T>> bool chle(T &x, const T &y, Comp comp = Comp()) { return comp(y, x) ? x = y, true : false; }\\ntemplate <class T, class Comp = std::less<T>> bool chge(T &x, const T &y, Comp comp = Comp()) { return comp(x, y) ? x = y, true : false; }\\n} // namespace workspace\\n#line 3 \\\"Library/utils/fixed_point.hpp\\\"\\nnamespace workspace {\\n// specify the return type of lambda.\\ntemplate <class lambda_type>\\nclass fixed_point\\n{\\n lambda_type func;\\npublic:\\n fixed_point(lambda_type &&f) : func(std::move(f)) {}\\n template <class... Args> auto operator()(Args &&... args) const { return func(*this, std::forward<Args>(args)...); }\\n};\\n} // namespace workspace\\n#line 3 \\\"Library/utils/sfinae.hpp\\\"\\n#include <type_traits>\\n\\ntemplate <class type, template <class> class trait>\\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\\n\\ntemplate <class Container>\\nusing element_type = typename std::decay<decltype(\\n *std::begin(std::declval<Container&>()))>::type;\\n\\ntemplate <class T, class = void> struct is_integral_ext : std::false_type {};\\ntemplate <class T>\\nstruct is_integral_ext<\\n T, typename std::enable_if<std::is_integral<T>::value>::type>\\n : std::true_type {};\\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\\n#if __cplusplus >= 201402\\ntemplate <class T>\\nconstexpr static bool is_integral_ext_v = is_integral_ext<T>::value;\\n#endif\\n\\ntemplate <typename T, typename = void> struct multiplicable_uint {\\n using type = uint_least32_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {\\n using type = uint_least64_t;\\n};\\ntemplate <typename T>\\nstruct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {\\n using type = __uint128_t;\\n};\\n#line 7 \\\"Library/utils/hash.hpp\\\"\\nnamespace workspace {\\ntemplate <class T, class = void>\\nstruct hash : std::hash<T> {};\\ntemplate <class Unique_bits_type>\\nstruct hash<Unique_bits_type, enable_if_trait_type<Unique_bits_type, std::has_unique_object_representations>>\\n{\\n size_t operator()(uint64_t x) const\\n {\\n static const uint64_t m = std::random_device{}();\\n x ^= x >> 23;\\n // x *= 0x2127599bf4325c37ULL;\\n x ^= m;\\n x ^= x >> 47;\\n return x - (x >> 32);\\n }\\n};\\ntemplate <class Key>\\nsize_t hash_combine(const size_t &seed, const Key &key)\\n{\\n return seed ^ (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */ );\\n}\\ntemplate <class T1, class T2>\\nstruct hash<std::pair<T1, T2>>\\n{\\n size_t operator()(const std::pair<T1, T2> &pair) const\\n {\\n return hash_combine(hash<T1>()(pair.first), pair.second);\\n }\\n};\\ntemplate <class... T>\\nclass hash<std::tuple<T...>>\\n{\\n template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1> struct tuple_hash { static uint64_t apply(const Tuple &t) { return hash_combine(tuple_hash<Tuple, index - 1>::apply(t), std::get<index>(t)); } };\\n template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> { static uint64_t apply(const Tuple &t) { return 0; } };\\npublic:\\n uint64_t operator()(const std::tuple<T...> &t) const { return tuple_hash<std::tuple<T...>>::apply(t); }\\n};\\ntemplate <class hash_table>\\nstruct hash_table_wrapper : hash_table\\n{\\n using key_type = typename hash_table::key_type;\\n size_t count(const key_type &key) const { return hash_table::find(key) != hash_table::end(); }\\n template <class... Args> auto emplace(Args&&... args) { return hash_table::insert(typename hash_table::value_type(args...)); }\\n};\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing cc_hash_table = hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped = __gnu_pbds::null_type>\\nusing gp_hash_table = hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;\\ntemplate <class Key, class Mapped>\\nusing unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;\\ntemplate <class Key>\\nusing unordered_set = std::unordered_set<Key, hash<Key>>;\\n} // namespace workspace\\n#line 3 \\\"Library/utils/make_vector.hpp\\\"\\nnamespace workspace {\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(size_t* sizes, T const& init = T()) {\\n if constexpr (N)\\n return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));\\n else\\n return init;\\n}\\ntemplate <typename T, size_t N>\\nconstexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {\\n return make_vector<T, N>((size_t*)sizes, init);\\n}\\n} // namespace workspace\\n#line 3 \\\"Library/utils/read.hpp\\\"\\nnamespace workspace {\\n// read with std::cin.\\ntemplate <class T = void>\\nstruct read\\n{\\n typename std::remove_const<T>::type value;\\n template <class... types>\\n read(types... args) : value(args...) { std::cin >> value; }\\n operator T() const { return value; }\\n};\\ntemplate <>\\nstruct read<void>\\n{\\n template <class T>\\n operator T() const { T value; std::cin >> value; return value; }\\n};\\n} // namespace workspace\\n#line 4 \\\"Library/utils/stream.hpp\\\"\\n\\n#line 6 \\\"Library/utils/stream.hpp\\\"\\nnamespace std {\\ntemplate <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ' ' << p.second;\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_is {\\n static istream &apply(istream &is, tuple_t &t) {\\n tuple_is<tuple_t, index - 1>::apply(is, t);\\n return is >> get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {\\n static istream &apply(istream &is, tuple_t &t) { return is; }\\n};\\ntemplate <class... T> istream &operator>>(istream &is, tuple<T...> &t) {\\n return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,\\n t);\\n}\\ntemplate <class tuple_t, size_t index> struct tuple_os {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n tuple_os<tuple_t, index - 1>::apply(os, t);\\n return os << ' ' << get<index>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, 0> {\\n static ostream &apply(ostream &os, const tuple_t &t) {\\n return os << get<0>(t);\\n }\\n};\\ntemplate <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {\\n static ostream &apply(ostream &os, const tuple_t &t) { return os; }\\n};\\ntemplate <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {\\n return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,\\n t);\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n istream &>::type\\noperator>>(istream &is, Container &cont) {\\n for (auto &&e : cont) is >> e;\\n return is;\\n}\\ntemplate <class Container, typename Value = element_type<Container>>\\ntypename enable_if<!is_same<typename decay<Container>::type, string>::value &&\\n !is_same<typename decay<Container>::type, char *>::value,\\n ostream &>::type\\noperator<<(ostream &os, const Container &cont) {\\n bool head = true;\\n for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;\\n return os;\\n}\\n} // namespace std\\n#line 14 \\\"other/l2.cpp\\\"\\nnamespace workspace {\\nconstexpr char eol = '\\\\n';\\nusing namespace std;\\nusing i32 = int_least32_t;\\nusing i64 = int_least64_t;\\nusing i128 = __int128_t;\\nusing u32 = uint_least32_t;\\nusing u64 = uint_least64_t;\\nusing u128 = __uint128_t;\\ntemplate <class T, class Comp = std::less<T>>\\nusing priority_queue = std::priority_queue<T, std::vector<T>, Comp>;\\ntemplate <class T> using stack = std::stack<T, std::vector<T>>;\\nstruct solver;\\n} // namespace workspace\\nint main() { config::main<workspace::solver>(); }\\nunsigned config::cases() {\\n // return -1; // not specified\\n // int t; std::cin >> t; return t; // given\\n return 1;\\n}\\n\\n#line 4 \\\"Library/graph/directed/flow/base.hpp\\\"\\n// the base class of flow algorithms.\\ntemplate <class cap_t, class cost_t> struct flow_base {\\n struct edge_t {\\n size_t src, dst;\\n cap_t cap;\\n cost_t cost;\\n edge_t *rev;\\n edge_t() = default;\\n edge_t(size_t src, size_t dst, cap_t cap, edge_t *rev)\\n : src(src), dst(dst), cap(cap), rev(rev) {}\\n edge_t(size_t src, size_t dst, cap_t cap, cost_t cost, edge_t *rev)\\n : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\\n void flow(cap_t f) { cap -= f, rev->cap += f; }\\n bool avbl() const { return cap > 0; }\\n }; // class edge_t\\n\\n class adj_type {\\n edge_t *fst, *lst, *clst;\\n\\n public:\\n template <class... Args> edge_t *emplace(Args &&... args) {\\n if (lst == clst) {\\n size_t len(clst - fst);\\n edge_t *nfst = lst = new edge_t[len << 1];\\n for (edge_t *p{fst}; p != clst; ++p, ++lst)\\n p->rev->rev = lst, *lst = *p;\\n delete[] fst;\\n fst = nfst;\\n clst = lst + len;\\n }\\n *lst = edge_t(args...);\\n return lst++;\\n }\\n adj_type() : fst(new edge_t[1]), lst(fst), clst(fst + 1) {}\\n ~adj_type() { delete[] fst; }\\n edge_t &operator[](size_t i) {\\n assert(i < size());\\n return *(fst + i);\\n }\\n size_t size() const { return lst - fst; }\\n edge_t *begin() const { return fst; }\\n edge_t *end() const { return lst; }\\n }; // class adj_type\\n\\n flow_base(size_t n = 0) : adjs(n) {}\\n\\n flow_base(const flow_base &other) : adjs(other.size()) {\\n for (size_t node{}; node != size(); ++node)\\n for (const auto &[src, dst, cap, cost, rev] : other[node])\\n if (src == node) {\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, rev->cap, -cost, ptr);\\n rev->src = -1;\\n } else {\\n rev->rev->src = node;\\n }\\n }\\n\\n flow_base &operator=(const flow_base &rhs) {\\n if (this != &rhs) adjs.swap(flow_base(rhs).adjs);\\n return *this;\\n }\\n\\n size_t size() const { return adjs.size(); }\\n\\n adj_type &operator[](size_t node) {\\n assert(node < size());\\n return adjs[node];\\n }\\n const adj_type &operator[](size_t node) const {\\n assert(node < size());\\n return adjs[node];\\n }\\n\\n virtual void add_edge(size_t src, size_t dst, cap_t cap, cost_t cost) {\\n assert(src < size());\\n assert(dst < size());\\n if (!(cap > 0) || src == dst) return;\\n edge_t *ptr = adjs[src].emplace(src, dst, cap, cost, nullptr);\\n ptr->rev = adjs[dst].emplace(dst, src, 0, -cost, ptr);\\n }\\n\\n protected:\\n std::vector<adj_type> adjs;\\n}; // class flow_base\\n#line 36 \\\"other/l2.cpp\\\"\\n\\ntemplate <class cap_t = int> class Dinic : public flow_base<cap_t, bool> {\\n using base = flow_base<cap_t, bool>;\\n using edge_t = typename base::edge_t;\\n using base::adjs;\\n\\n std::vector<size_t> level;\\n std::vector<edge_t *> itr;\\n constexpr static size_t level_infty = -1;\\n\\n cap_t dfs(const size_t &src, const size_t &dst, cap_t bound) {\\n if (src == dst || bound == 0) return bound;\\n cap_t flow(0);\\n for (edge_t *&e{itr[dst]}; e != adjs[dst].end(); ++e)\\n if (e->rev->avbl() && level[e->dst] < level[dst])\\n if (cap_t achv = dfs(src, e->dst, std::min(bound, e->rev->cap));\\n achv > 0) {\\n e->rev->flow(achv);\\n flow += achv, bound -= achv;\\n if (bound == 0) break;\\n }\\n return flow;\\n }\\n\\n public:\\n using base::size;\\n\\n Dinic(size_t n = 0) : base::flow_base(n), level(n, level_infty), itr(n) {}\\n\\n Dinic(const Dinic &other)\\n : base::flow_base(other), level(other.level), itr(other.itr) {}\\n\\n Dinic &operator=(const Dinic &rhs) {\\n if (this != &rhs) base::operator=(rhs), level = rhs.level, itr = rhs.itr;\\n return *this;\\n }\\n\\n void add_edge(size_t src, size_t dst, cap_t cap) {\\n base::add_edge(src, dst, cap, false);\\n }\\n\\n void add_undirected_edge(size_t src, size_t dst, cap_t cap) {\\n base::add_undirected_edge(src, dst, cap, false);\\n }\\n\\n int ans = -1, loop = 0;\\n\\n cap_t max_flow(size_t src, size_t dst) {\\n assert(src < size());\\n assert(dst < size());\\n cap_t flow(0), bound(0);\\n for (const edge_t &e : adjs[src]) bound += e.cap;\\n for (std::vector<size_t> que(size());;\\n std::fill(level.begin(), level.end(), level_infty)) {\\n level[que.front() = src] = 0;\\n for (auto ql{que.begin()}, qr{std::next(ql)};\\n level[dst] == level_infty && ql != qr; ++ql)\\n for (const edge_t &e : adjs[*ql])\\n if (e.avbl() && level[e.dst] == level_infty)\\n level[ *qr++ = e.dst] = level[*ql] + 1;\\n if (level[dst] == level_infty) break;\\n for (size_t node{}; node != size(); ++node)\\n itr[node] = adjs[node].begin();\\n flow += dfs(src, dst, bound);\\n if (ans < 0 || (int)level[dst] < ans) ans = level[dst];\\n loop++;\\n }\\n return flow;\\n }\\n}; // class Dinic\\n\\n#line 5 \\\"Library/graph/directed/strongly_connected_components.hpp\\\"\\nstruct strongly_connected_components {\\n strongly_connected_components(size_t n) : graph(n), low(n), made() {}\\n\\n // add an edge from the vertex s to the vertex t.\\n void add_edge(size_t src, size_t dst) {\\n assert(src < size());\\n assert(dst < size());\\n graph[src].emplace_back(dst);\\n made = false;\\n }\\n\\n // the number of the components.\\n size_t count() {\\n make();\\n return comp_cnt;\\n }\\n\\n size_t size() const { return graph.size(); }\\n\\n // the component which the vertex v belongs to.\\n size_t operator[](size_t v) {\\n make();\\n return low[v];\\n }\\n\\n // the directed acyclic graph consisting of the components.\\n const std::vector<std::vector<size_t>> &shrinked_dag() {\\n make();\\n return dag;\\n }\\n\\n protected:\\n std::vector<std::vector<size_t>> graph, dag;\\n std::vector<size_t> low;\\n size_t comp_cnt;\\n bool made;\\n\\n void make() {\\n if (made) return;\\n made = true, comp_cnt = 0;\\n low.assign(size(), 0);\\n size_t *itr = new size_t[size()];\\n bool *const used = new bool[size()];\\n for (size_t v{}, c{}; v != size(); ++v) affix(v, c, itr, used + size());\\n delete[] itr;\\n delete[] used;\\n for (auto &e : low) e += comp_cnt;\\n reverse(begin(dag), end(dag));\\n for (auto &arcs : dag)\\n for (auto &to : arcs) to += comp_cnt;\\n }\\n\\n size_t affix(size_t src, size_t &c, size_t *&itr, bool *used) {\\n if (low[src]) return low[src];\\n size_t idx = ++c;\\n low[src] = idx;\\n *itr++ = src;\\n for (size_t dst : graph[src])\\n low[src] = std::min(low[src], affix(dst, c, itr, used));\\n if (low[src] == idx) {\\n ++comp_cnt;\\n used[-comp_cnt] = true;\\n dag.emplace_back(0);\\n auto srcp = itr;\\n do {\\n low[*--srcp] = -comp_cnt;\\n } while (*srcp != src);\\n while (itr != srcp) {\\n auto now = *--itr;\\n for (auto to : graph[now]) {\\n if (!used[(int)low[to]]) {\\n dag.back().emplace_back(low[to]);\\n used[(int)low[to]] = true;\\n }\\n }\\n }\\n for (int c : dag.back()) used[c] = false;\\n used[-comp_cnt] = false;\\n return idx;\\n }\\n return low[src];\\n }\\n}; // class strongly_connected_components\\n#line 108 \\\"other/l2.cpp\\\"\\n\\nstruct workspace::solver {\\n solver() {\\n // start here!\\n int n, m;\\n cin >> n >> m;\\n Dinic<int> dinic(n + 2);\\n strongly_connected_components scc(n);\\n for (int i = 0; i < m; i++) {\\n int a, b;\\n cin >> a >> b;\\n --a, --b;\\n scc.add_edge(a, b);\\n dinic.add_edge(a, b, 1);\\n }\\n\\n const auto &dag = scc.shrinked_dag();\\n const int cn = dag.size();\\n vector<int> ind(cn), oud(cn);\\n int src = -1, dst = -1;\\n for (int i = 0; i < cn; i++) {\\n if (dag[i].empty()) {\\n if (~dst) {\\n cout << -1 << eol;\\n return;\\n }\\n dst = i;\\n }\\n for (int j : dag[i]) ind[j]++;\\n }\\n for (int i = 0; i < cn; i++) {\\n if (!ind[i]) {\\n if (~src) {\\n cout << -1 << eol;\\n return;\\n }\\n src = i;\\n }\\n }\\n\\n if (scc.count() == 1) {\\n cout << \\\"0\\\\n\\\";\\n return;\\n }\\n\\n const int fsrc = n + 1, fdst = n;\\n for (int i = 0; i < n; i++) {\\n if (scc[i] == src) {\\n dinic.add_edge(fsrc, i, 2);\\n } else if (scc[i] == dst) {\\n dinic.add_edge(i, fdst, 2);\\n }\\n }\\n\\n if (dinic.max_flow(fsrc, fdst) < 2) {\\n cout << \\\"-1\\\\n\\\";\\n } else {\\n cout << dinic.ans - 2 << eol;\\n }\\n }\\n};\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 34532,\n \"score_of_the_acc\": -0.5948,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3183_4846707\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n// arg : S, state : T, ret : U\\n// void pre(int id, S &arg, T &state)\\n// pair<int, S> in(int id, int prechild, U ret, S &arg, T &state)\\n// U post(int id, S &arg, T &state)\\ntemplate <typename S, typename T, typename U>\\nU non_rec_dfs(int n, int start, S start_arg, function<void(int, S &, T &)> pre,\\n function<pair<int, S>(int, int, U, S &, T &)> in,\\n function<U(int, S &, T &)> post) {\\n stack<pair<int, int>> st;\\n vector<int> prech(n, -1);\\n vector<S> arg(n);\\n vector<T> state(n);\\n vector<U> ret(n);\\n st.emplace(start, 0);\\n arg[start] = start_arg;\\n while (!st.empty()) {\\n auto p = st.top();\\n int now = p.first;\\n int mode = p.second;\\n st.pop();\\n if (mode == 0) {\\n pre(now, arg[now], state[now]);\\n st.emplace(now, 1);\\n } else if (mode == 1) {\\n pair<int, S> call =\\n in(now, prech[now], ret[prech[now]], arg[now], state[now]);\\n int nxt = call.first;\\n arg[nxt] = call.second;\\n if (nxt != -1) {\\n prech[now] = nxt;\\n st.emplace(now, 1);\\n st.emplace(nxt, 0);\\n } else {\\n st.emplace(now, 2);\\n }\\n } else {\\n ret[now] = post(now, arg[now], state[now]);\\n }\\n }\\n return ret[start];\\n}\\n\\nint n, m;\\nvector<vector<int>> e, re;\\nvector<int> num;\\n\\nvoid assign(vector<vector<int>> &edge) {\\n struct sta {\\n int idx;\\n };\\n num = vector<int>(n, -2);\\n int tmp = 0;\\n for (int i = 0; i < n; i++) {\\n if (num[i] == -2) {\\n tmp = non_rec_dfs<int, sta, int>(\\n n, i, tmp,\\n [&](int x, int &arg, sta &state) {\\n num[x] = -1;\\n state.idx = 0;\\n return;\\n },\\n [&](int x, int prech, int ret, int &arg, sta &state) {\\n if (prech != -1) arg = ret;\\n for (; state.idx < edge[x].size(); state.idx++) {\\n if (num[edge[x][state.idx]] == -2)\\n return pair<int, int>(edge[x][state.idx++], arg);\\n }\\n return pair<int, int>(-1, 0);\\n },\\n [&](int x, int &arg, sta &state) {\\n num[x] = arg;\\n return arg + 1;\\n });\\n }\\n }\\n}\\n\\nint main() {\\n cin >> n >> m;\\n e = re = vector<vector<int>>(n);\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n cin >> u >> v;\\n u--, v--;\\n e[u].push_back(v);\\n re[v].push_back(u);\\n }\\n\\n vector<int> d(n, -1);\\n\\n assign(e);\\n vector<int> v(n);\\n iota(v.begin(), v.end(), 0);\\n sort(v.begin(), v.end(),\\n [&](const int &l, const int &r) { return num[l] > num[r]; });\\n queue<int> q, bfs;\\n int start = v[0];\\n d[v[0]] = 0;\\n q.push(v[0]);\\n bfs.push(v[0]);\\n while (!q.empty()) {\\n int now = q.front();\\n q.pop();\\n for (auto x : re[now]) {\\n if (d[x] != -1) continue;\\n d[x] = 0;\\n q.push(x);\\n bfs.push(x);\\n }\\n }\\n\\n if (bfs.size() == n) {\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n assign(re);\\n sort(v.begin(), v.end(),\\n [&](const int &l, const int &r) { return num[l] > num[r]; });\\n d[v[0]] = -2;\\n q.push(v[0]);\\n while (!q.empty()) {\\n int now = q.front();\\n q.pop();\\n for (auto x : e[now]) {\\n if (d[x] != -1) continue;\\n d[x] = -2;\\n q.push(x);\\n }\\n }\\n\\n vector<int> par(n, -1);\\n int g = -1;\\n while (!bfs.empty()) {\\n int now = bfs.front();\\n bfs.pop();\\n for (auto x : e[now]) {\\n if (d[x] >= 0) continue;\\n par[x] = now;\\n if (d[x] == -2) {\\n d[x] = d[now] + 1;\\n g = x;\\n goto found;\\n }\\n d[x] = d[now] + 1;\\n bfs.push(x);\\n }\\n }\\n\\n cout << -1 << endl;\\n return 0;\\n\\nfound:;\\n int ans = d[g];\\n set<pair<int, int>> st;\\n while (par[g] != -1) {\\n st.emplace(par[g], g);\\n g = par[g];\\n }\\n\\n vector<vector<int>> ne, nre;\\n ne = nre = vector<vector<int>>(n);\\n for (int u = 0; u < n; u++) {\\n for (auto &v : e[u]) {\\n if (st.find({u, v}) == st.end()) {\\n ne[u].push_back(v);\\n nre[v].push_back(u);\\n } else {\\n ne[v].push_back(u);\\n nre[u].push_back(v);\\n }\\n }\\n }\\n\\n assign(ne);\\n sort(v.begin(), v.end(),\\n [&](const int &l, const int &r) { return num[l] > num[r]; });\\n int count = 1;\\n d = vector<int>(n, false);\\n d[v[0]] = true;\\n q.push(v[0]);\\n while (!q.empty()) {\\n int now = q.front();\\n q.pop();\\n for (auto x : nre[now]) {\\n if (d[x]) continue;\\n count++;\\n d[x] = true;\\n q.push(x);\\n }\\n }\\n\\n if (count == n)\\n cout << ans << endl;\\n else\\n cout << -1 << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 31084,\n \"score_of_the_acc\": -1.3397,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3183_4846588\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\nconst int mod = 1e9 + 7;\\n// const int mod = 998244353;\\n\\nconst int64 infll = (1LL << 62) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\ntemplate< typename T = int >\\nstruct Edge {\\n int from, to;\\n T cost;\\n int idx;\\n\\n Edge() = default;\\n\\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\\n\\n operator int() const { return to; }\\n};\\n\\ntemplate< typename T = int >\\nstruct Graph {\\n vector< vector< Edge< T > > > g;\\n int es;\\n\\n Graph() = default;\\n\\n explicit Graph(int n) : g(n), es(0) {}\\n\\n size_t size() const {\\n return g.size();\\n }\\n\\n void add_directed_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es++);\\n }\\n\\n void add_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es);\\n g[to].emplace_back(to, from, cost, es++);\\n }\\n\\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n a += padding;\\n b += padding;\\n T c = T(1);\\n if(weighted) cin >> c;\\n if(directed) add_directed_edge(a, b, c);\\n else add_edge(a, b, c);\\n }\\n }\\n};\\n\\ntemplate< typename T = int >\\nusing Edges = vector< Edge< T > >;\\n\\n/**\\n * @brief Strongly-Connected-Components(強連結成分分解)\\n */\\ntemplate< typename T = int >\\nstruct StronglyConnectedComponents : Graph< T > {\\npublic:\\n using Graph< T >::Graph;\\n using Graph< T >::g;\\n vector< int > comp;\\n Graph< T > dag;\\n vector< vector< int > > group;\\n\\n void build() {\\n rg = Graph< T >(g.size());\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n rg.add_directed_edge(e.to, e.from, e.cost);\\n }\\n }\\n comp.assign(g.size(), -1);\\n used.assign(g.size(), 0);\\n for(int i = 0; i < g.size(); i++) dfs(i);\\n reverse(begin(order), end(order));\\n int ptr = 0;\\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\\n dag = Graph< T >(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n int x = comp[e.from], y = comp[e.to];\\n if(x == y) continue;\\n dag.add_directed_edge(x, y, e.cost);\\n }\\n }\\n group.resize(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n group[comp[i]].emplace_back(i);\\n }\\n }\\n\\n int operator[](int k) const {\\n return comp[k];\\n }\\n\\nprivate:\\n vector< int > order, used;\\n Graph< T > rg;\\n\\n void dfs(int idx) {\\n if(exchange(used[idx], true)) return;\\n for(auto &to : g[idx]) dfs(to);\\n order.push_back(idx);\\n }\\n\\n void rdfs(int idx, int cnt) {\\n if(comp[idx] != -1) return;\\n comp[idx] = cnt;\\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\\n }\\n};\\n\\n\\n/**\\n * @brief Ford-Fulkerson(最大流)\\n * @docs docs/ford-fulkerson.md\\n */\\ntemplate< typename flow_t >\\nstruct FordFulkerson {\\n struct edge {\\n int to;\\n flow_t cap;\\n int rev;\\n bool isrev;\\n int idx;\\n };\\n\\n vector< vector< edge > > graph;\\n vector< int > used;\\n const flow_t INF;\\n int timestamp;\\n\\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\\n\\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\\n }\\n\\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\\n if(idx == t) return flow;\\n used[idx] = timestamp;\\n for(auto &e : graph[idx]) {\\n if(e.cap > 0 && used[e.to] != timestamp) {\\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\\n if(d > 0) {\\n e.cap -= d;\\n graph[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\\n flow += f;\\n if(flow >= 2) break;\\n }\\n return flow;\\n }\\n\\n void output() {\\n for(int i = 0; i < graph.size(); i++) {\\n for(auto &e : graph[i]) {\\n if(e.isrev) continue;\\n auto &rev_e = graph[e.to][e.rev];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n }\\n};\\n\\n/**\\n * @brief Dijkstra(単一始点最短路)\\n * @docs docs/dijkstra.md\\n */\\ntemplate< typename T >\\nstruct ShortestPath {\\n vector< T > dist;\\n vector< int > from, id;\\n};\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n vector< int > A(M), B(M);\\n Graph<> rg(N);\\n StronglyConnectedComponents<> scc(N);\\n for(int i = 0; i < M; i++) {\\n cin >> A[i] >> B[i];\\n --A[i], --B[i];\\n scc.add_directed_edge(A[i], B[i]);\\n rg.add_directed_edge(B[i], A[i]);\\n }\\n scc.build();\\n if(scc.dag.size() == 1) {\\n cout << 0 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n vector< int > in(N), out(N);\\n for(int i = 0; i < scc.dag.size(); i++) {\\n if(scc.dag.g[i].size()) {\\n in[i] = true;\\n }\\n for(auto &t : scc.dag.g[i]) {\\n out[t] = true;\\n }\\n }\\n\\n vector< int > latte, malta;\\n for(int i = 0; i < scc.dag.size(); i++) {\\n if(!in[i]) {\\n latte.emplace_back(i);\\n }\\n if(!out[i]) {\\n malta.emplace_back(i);\\n }\\n }\\n if(latte.size() != 1 && malta.size() != 1) {\\n cout << -1 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n FordFulkerson< int > flow(N + 2);\\n for(int i = 0; i < M; i++) {\\n flow.add_edge(A[i], B[i], 1);\\n }\\n for(auto &p : scc.group[malta[0]]) {\\n flow.add_edge(N, p, inf);\\n }\\n for(auto &p : scc.group[latte[0]]) {\\n flow.add_edge(p, N + 1, inf);\\n }\\n if(flow.max_flow(N, N + 1) <= 1) {\\n cout << \\\"-1\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n using T = int;\\n const auto INF = numeric_limits< T >::max();\\n vector< T > dist(scc.size(), INF);\\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\\n using Pi = pair< T, int >;\\n priority_queue< Pi, vector< Pi >, greater<> > que;\\n for(auto &p : scc.group[latte[0]]) {\\n dist[p] = 0;\\n que.emplace(0, p);\\n }\\n while(!que.empty()) {\\n T cost;\\n int idx;\\n tie(cost, idx) = que.top();\\n que.pop();\\n if(dist[idx] < cost) continue;\\n for(auto &e : rg.g[idx]) {\\n auto next_cost = cost + e.cost;\\n if(dist[e.to] <= next_cost) continue;\\n dist[e.to] = next_cost;\\n from[e.to] = idx;\\n id[e.to] = e.idx;\\n que.emplace(dist[e.to], e.to);\\n }\\n }\\n int ans = inf;\\n for(auto &p : scc.group[malta[0]]) {\\n chmin(ans, dist[p]);\\n }\\n if(ans >= inf) ans = -1;\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 46852,\n \"score_of_the_acc\": -1.1631,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3183_4846582\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\nconst int mod = 1e9 + 7;\\n// const int mod = 998244353;\\n\\nconst int64 infll = (1LL << 62) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\ntemplate< typename T = int >\\nstruct Edge {\\n int from, to;\\n T cost;\\n int idx;\\n\\n Edge() = default;\\n\\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\\n\\n operator int() const { return to; }\\n};\\n\\ntemplate< typename T = int >\\nstruct Graph {\\n vector< vector< Edge< T > > > g;\\n int es;\\n\\n Graph() = default;\\n\\n explicit Graph(int n) : g(n), es(0) {}\\n\\n size_t size() const {\\n return g.size();\\n }\\n\\n void add_directed_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es++);\\n }\\n\\n void add_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es);\\n g[to].emplace_back(to, from, cost, es++);\\n }\\n\\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n a += padding;\\n b += padding;\\n T c = T(1);\\n if(weighted) cin >> c;\\n if(directed) add_directed_edge(a, b, c);\\n else add_edge(a, b, c);\\n }\\n }\\n};\\n\\ntemplate< typename T = int >\\nusing Edges = vector< Edge< T > >;\\n\\n/**\\n * @brief Strongly-Connected-Components(強連結成分分解)\\n */\\ntemplate< typename T = int >\\nstruct StronglyConnectedComponents : Graph< T > {\\npublic:\\n using Graph< T >::Graph;\\n using Graph< T >::g;\\n vector< int > comp;\\n Graph< T > dag;\\n vector< vector< int > > group;\\n\\n void build() {\\n rg = Graph< T >(g.size());\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n rg.add_directed_edge(e.to, e.from, e.cost);\\n }\\n }\\n comp.assign(g.size(), -1);\\n used.assign(g.size(), 0);\\n for(int i = 0; i < g.size(); i++) dfs(i);\\n reverse(begin(order), end(order));\\n int ptr = 0;\\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\\n dag = Graph< T >(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n int x = comp[e.from], y = comp[e.to];\\n if(x == y) continue;\\n dag.add_directed_edge(x, y, e.cost);\\n }\\n }\\n group.resize(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n group[comp[i]].emplace_back(i);\\n }\\n }\\n\\n int operator[](int k) const {\\n return comp[k];\\n }\\n\\nprivate:\\n vector< int > order, used;\\n Graph< T > rg;\\n\\n void dfs(int idx) {\\n if(exchange(used[idx], true)) return;\\n for(auto &to : g[idx]) dfs(to);\\n order.push_back(idx);\\n }\\n\\n void rdfs(int idx, int cnt) {\\n if(comp[idx] != -1) return;\\n comp[idx] = cnt;\\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\\n }\\n};\\n\\n\\n/**\\n * @brief Ford-Fulkerson(最大流)\\n * @docs docs/ford-fulkerson.md\\n */\\ntemplate< typename flow_t >\\nstruct FordFulkerson {\\n struct edge {\\n int to;\\n flow_t cap;\\n int rev;\\n bool isrev;\\n int idx;\\n };\\n\\n vector< vector< edge > > graph;\\n vector< int > used;\\n const flow_t INF;\\n int timestamp;\\n\\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\\n\\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\\n }\\n\\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\\n if(idx == t) return flow;\\n used[idx] = timestamp;\\n for(auto &e : graph[idx]) {\\n if(e.cap > 0 && used[e.to] != timestamp) {\\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\\n if(d > 0) {\\n e.cap -= d;\\n graph[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\\n flow += f;\\n }\\n return flow;\\n }\\n\\n void output() {\\n for(int i = 0; i < graph.size(); i++) {\\n for(auto &e : graph[i]) {\\n if(e.isrev) continue;\\n auto &rev_e = graph[e.to][e.rev];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n }\\n};\\n\\n/**\\n * @brief Dijkstra(単一始点最短路)\\n * @docs docs/dijkstra.md\\n */\\ntemplate< typename T >\\nstruct ShortestPath {\\n vector< T > dist;\\n vector< int > from, id;\\n};\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n vector< int > A(M), B(M);\\n Graph<> rg(N);\\n StronglyConnectedComponents<> scc(N);\\n for(int i = 0; i < M; i++) {\\n cin >> A[i] >> B[i];\\n --A[i], --B[i];\\n scc.add_directed_edge(A[i], B[i]);\\n rg.add_directed_edge(B[i], A[i]);\\n }\\n scc.build();\\n if(scc.dag.size() == 1) {\\n cout << 0 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n vector< int > in(N), out(N);\\n for(int i = 0; i < scc.dag.size(); i++) {\\n if(scc.dag.g[i].size()) {\\n in[i] = true;\\n }\\n for(auto &t : scc.dag.g[i]) {\\n out[t] = true;\\n }\\n }\\n\\n vector< int > latte, malta;\\n for(int i = 0; i < scc.dag.size(); i++) {\\n if(!in[i]) {\\n latte.emplace_back(i);\\n }\\n if(!out[i]) {\\n malta.emplace_back(i);\\n }\\n }\\n if(latte.size() != 1 && malta.size() != 1) {\\n cout << -1 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n FordFulkerson< int > flow(scc.dag.size());\\n for(int i = 0; i < scc.dag.size(); i++) {\\n for(auto &p : scc.dag.g[i]) {\\n flow.add_edge(i, p, 1);\\n }\\n }\\n if(flow.max_flow(malta[0], latte[0]) <= 1) {\\n cout << \\\"-1\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n using T = int;\\n const auto INF = numeric_limits< T >::max();\\n vector< T > dist(scc.size(), INF);\\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\\n using Pi = pair< T, int >;\\n priority_queue< Pi, vector< Pi >, greater<> > que;\\n for(auto &p : scc.group[latte[0]]) {\\n dist[p] = 0;\\n que.emplace(0, p);\\n }\\n while(!que.empty()) {\\n T cost;\\n int idx;\\n tie(cost, idx) = que.top();\\n que.pop();\\n if(dist[idx] < cost) continue;\\n for(auto &e : rg.g[idx]) {\\n auto next_cost = cost + e.cost;\\n if(dist[e.to] <= next_cost) continue;\\n dist[e.to] = next_cost;\\n from[e.to] = idx;\\n id[e.to] = e.idx;\\n que.emplace(dist[e.to], e.to);\\n }\\n }\\n int ans = inf;\\n for(auto &p : scc.group[malta[0]]) {\\n chmin(ans, dist[p]);\\n }\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.35135135135135137,\n \"time_ms\": 30,\n \"memory_kb\": 26864,\n \"score_of_the_acc\": -0.1907,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3183_4846573\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\nconst int mod = 1e9 + 7;\\n// const int mod = 998244353;\\n\\nconst int64 infll = (1LL << 62) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\ntemplate< typename T = int >\\nstruct Edge {\\n int from, to;\\n T cost;\\n int idx;\\n\\n Edge() = default;\\n\\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\\n\\n operator int() const { return to; }\\n};\\n\\ntemplate< typename T = int >\\nstruct Graph {\\n vector< vector< Edge< T > > > g;\\n int es;\\n\\n Graph() = default;\\n\\n explicit Graph(int n) : g(n), es(0) {}\\n\\n size_t size() const {\\n return g.size();\\n }\\n\\n void add_directed_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es++);\\n }\\n\\n void add_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es);\\n g[to].emplace_back(to, from, cost, es++);\\n }\\n\\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n a += padding;\\n b += padding;\\n T c = T(1);\\n if(weighted) cin >> c;\\n if(directed) add_directed_edge(a, b, c);\\n else add_edge(a, b, c);\\n }\\n }\\n};\\n\\ntemplate< typename T = int >\\nusing Edges = vector< Edge< T > >;\\n\\n/**\\n * @brief Strongly-Connected-Components(強連結成分分解)\\n */\\ntemplate< typename T = int >\\nstruct StronglyConnectedComponents : Graph< T > {\\npublic:\\n using Graph< T >::Graph;\\n using Graph< T >::g;\\n vector< int > comp;\\n Graph< T > dag;\\n vector< vector< int > > group;\\n\\n void build() {\\n rg = Graph< T >(g.size());\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n rg.add_directed_edge(e.to, e.from, e.cost);\\n }\\n }\\n comp.assign(g.size(), -1);\\n used.assign(g.size(), 0);\\n for(int i = 0; i < g.size(); i++) dfs(i);\\n reverse(begin(order), end(order));\\n int ptr = 0;\\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\\n dag = Graph< T >(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n int x = comp[e.from], y = comp[e.to];\\n if(x == y) continue;\\n dag.add_directed_edge(x, y, e.cost);\\n }\\n }\\n group.resize(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n group[comp[i]].emplace_back(i);\\n }\\n }\\n\\n int operator[](int k) const {\\n return comp[k];\\n }\\n\\nprivate:\\n vector< int > order, used;\\n Graph< T > rg;\\n\\n void dfs(int idx) {\\n if(exchange(used[idx], true)) return;\\n for(auto &to : g[idx]) dfs(to);\\n order.push_back(idx);\\n }\\n\\n void rdfs(int idx, int cnt) {\\n if(comp[idx] != -1) return;\\n comp[idx] = cnt;\\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\\n }\\n};\\n\\n\\n/**\\n * @brief Ford-Fulkerson(最大流)\\n * @docs docs/ford-fulkerson.md\\n */\\ntemplate< typename flow_t >\\nstruct FordFulkerson {\\n struct edge {\\n int to;\\n flow_t cap;\\n int rev;\\n bool isrev;\\n int idx;\\n };\\n\\n vector< vector< edge > > graph;\\n vector< int > used;\\n const flow_t INF;\\n int timestamp;\\n\\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\\n\\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\\n }\\n\\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\\n if(idx == t) return flow;\\n used[idx] = timestamp;\\n for(auto &e : graph[idx]) {\\n if(e.cap > 0 && used[e.to] != timestamp) {\\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\\n if(d > 0) {\\n e.cap -= d;\\n graph[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\\n flow += f;\\n }\\n return flow;\\n }\\n\\n void output() {\\n for(int i = 0; i < graph.size(); i++) {\\n for(auto &e : graph[i]) {\\n if(e.isrev) continue;\\n auto &rev_e = graph[e.to][e.rev];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n }\\n};\\n\\n/**\\n * @brief Dijkstra(単一始点最短路)\\n * @docs docs/dijkstra.md\\n */\\ntemplate< typename T >\\nstruct ShortestPath {\\n vector< T > dist;\\n vector< int > from, id;\\n};\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n vector< int > A(M), B(M);\\n Graph<> rg(N);\\n StronglyConnectedComponents<> scc(N);\\n for(int i = 0; i < M; i++) {\\n cin >> A[i] >> B[i];\\n --A[i], --B[i];\\n scc.add_directed_edge(A[i], B[i]);\\n rg.add_directed_edge(B[i], A[i]);\\n }\\n scc.build();\\n if(scc.dag.size() == 1) {\\n cout << 0 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n vector< int > in(N), out(N);\\n for(int i = 0; i < scc.dag.size(); i++) {\\n if(scc.dag.g[i].size()) {\\n in[i] = true;\\n }\\n for(auto &t : scc.dag.g[i]) {\\n out[t] = true;\\n }\\n }\\n\\n vector< int > latte, malta;\\n for(int i = 0; i < scc.size(); i++) {\\n if(!in[i]) {\\n latte.emplace_back(i);\\n }\\n if(!out[i]) {\\n malta.emplace_back(i);\\n }\\n }\\n if(latte.size() != 1 && malta.size() != 1) {\\n cout << -1 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n FordFulkerson< int > flow(scc.size());\\n for(int i = 0; i < scc.size(); i++) {\\n for(auto &p : scc.dag.g[i]) {\\n flow.add_edge(i, p, 1);\\n }\\n }\\n if(flow.max_flow(malta[0], latte[0]) <= 1) {\\n cout << \\\"-1\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n using T = int;\\n const auto INF = numeric_limits< T >::max();\\n vector< T > dist(scc.size(), INF);\\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\\n using Pi = pair< T, int >;\\n priority_queue< Pi, vector< Pi >, greater<> > que;\\n for(auto &p : scc.group[latte[0]]) {\\n dist[p] = 0;\\n que.emplace(0, p);\\n }\\n while(!que.empty()) {\\n T cost;\\n int idx;\\n tie(cost, idx) = que.top();\\n que.pop();\\n if(dist[idx] < cost) continue;\\n for(auto &e : rg.g[idx]) {\\n auto next_cost = cost + e.cost;\\n if(dist[e.to] <= next_cost) continue;\\n dist[e.to] = next_cost;\\n from[e.to] = idx;\\n id[e.to] = e.idx;\\n que.emplace(dist[e.to], e.to);\\n }\\n }\\n int ans = inf;\\n for(auto &p : scc.group[malta[0]]) {\\n chmin(ans, dist[p]);\\n }\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 40,\n \"memory_kb\": 30020,\n \"score_of_the_acc\": -0.3688,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3183_4846558\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\nconst int mod = 1e9 + 7;\\n// const int mod = 998244353;\\n\\nconst int64 infll = (1LL << 62) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\ntemplate< typename T = int >\\nstruct Edge {\\n int from, to;\\n T cost;\\n int idx;\\n\\n Edge() = default;\\n\\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\\n\\n operator int() const { return to; }\\n};\\n\\ntemplate< typename T = int >\\nstruct Graph {\\n vector< vector< Edge< T > > > g;\\n int es;\\n\\n Graph() = default;\\n\\n explicit Graph(int n) : g(n), es(0) {}\\n\\n size_t size() const {\\n return g.size();\\n }\\n\\n void add_directed_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es++);\\n }\\n\\n void add_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es);\\n g[to].emplace_back(to, from, cost, es++);\\n }\\n\\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n a += padding;\\n b += padding;\\n T c = T(1);\\n if(weighted) cin >> c;\\n if(directed) add_directed_edge(a, b, c);\\n else add_edge(a, b, c);\\n }\\n }\\n};\\n\\ntemplate< typename T = int >\\nusing Edges = vector< Edge< T > >;\\n\\n/**\\n * @brief Strongly-Connected-Components(強連結成分分解)\\n */\\ntemplate< typename T = int >\\nstruct StronglyConnectedComponents : Graph< T > {\\npublic:\\n using Graph< T >::Graph;\\n using Graph< T >::g;\\n vector< int > comp;\\n Graph< T > dag;\\n vector< vector< int > > group;\\n\\n void build() {\\n rg = Graph< T >(g.size());\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n rg.add_directed_edge(e.to, e.from, e.cost);\\n }\\n }\\n comp.assign(g.size(), -1);\\n used.assign(g.size(), 0);\\n for(int i = 0; i < g.size(); i++) dfs(i);\\n reverse(begin(order), end(order));\\n int ptr = 0;\\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\\n dag = Graph< T >(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n int x = comp[e.from], y = comp[e.to];\\n if(x == y) continue;\\n dag.add_directed_edge(x, y, e.cost);\\n }\\n }\\n group.resize(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n group[comp[i]].emplace_back(i);\\n }\\n }\\n\\n int operator[](int k) const {\\n return comp[k];\\n }\\n\\nprivate:\\n vector< int > order, used;\\n Graph< T > rg;\\n\\n void dfs(int idx) {\\n if(exchange(used[idx], true)) return;\\n for(auto &to : g[idx]) dfs(to);\\n order.push_back(idx);\\n }\\n\\n void rdfs(int idx, int cnt) {\\n if(comp[idx] != -1) return;\\n comp[idx] = cnt;\\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\\n }\\n};\\n\\n\\n/**\\n * @brief Ford-Fulkerson(最大流)\\n * @docs docs/ford-fulkerson.md\\n */\\ntemplate< typename flow_t >\\nstruct FordFulkerson {\\n struct edge {\\n int to;\\n flow_t cap;\\n int rev;\\n bool isrev;\\n int idx;\\n };\\n\\n vector< vector< edge > > graph;\\n vector< int > used;\\n const flow_t INF;\\n int timestamp;\\n\\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\\n\\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\\n }\\n\\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\\n if(idx == t) return flow;\\n used[idx] = timestamp;\\n for(auto &e : graph[idx]) {\\n if(e.cap > 0 && used[e.to] != timestamp) {\\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\\n if(d > 0) {\\n e.cap -= d;\\n graph[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\\n flow += f;\\n if(flow >= 2) break;\\n }\\n return flow;\\n }\\n\\n void output() {\\n for(int i = 0; i < graph.size(); i++) {\\n for(auto &e : graph[i]) {\\n if(e.isrev) continue;\\n auto &rev_e = graph[e.to][e.rev];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n }\\n};\\n\\n/**\\n * @brief Dijkstra(単一始点最短路)\\n * @docs docs/dijkstra.md\\n */\\ntemplate< typename T >\\nstruct ShortestPath {\\n vector< T > dist;\\n vector< int > from, id;\\n};\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n vector< int > A(M), B(M);\\n Graph<> rg(N);\\n StronglyConnectedComponents<> scc(N);\\n for(int i = 0; i < M; i++) {\\n cin >> A[i] >> B[i];\\n --A[i], --B[i];\\n scc.add_directed_edge(A[i], B[i]);\\n rg.add_directed_edge(B[i], A[i]);\\n }\\n scc.build();\\n if(scc.dag.size() == 1) {\\n cout << 0 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n vector< int > in(N), out(N);\\n for(int i = 0; i < scc.dag.size(); i++) {\\n if(scc.dag.g[i].size()) {\\n in[i] = true;\\n }\\n for(auto &t : scc.dag.g[i]) {\\n out[t] = true;\\n }\\n }\\n\\n vector< int > latte, malta;\\n for(int i = 0; i < N; i++) {\\n if(!in[i]) {\\n latte.emplace_back(i);\\n }\\n if(!out[i]) {\\n malta.emplace_back(i);\\n }\\n }\\n if(latte.size() != 1 && malta.size() != 1) {\\n cout << -1 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n FordFulkerson< int > flow(N + 2);\\n for(int i = 0; i < M; i++) {\\n flow.add_edge(A[i], B[i], 1);\\n }\\n for(auto &p : scc.group[malta[0]]) {\\n flow.add_edge(N, p, inf);\\n }\\n for(auto &p : scc.group[latte[0]]) {\\n flow.add_edge(p, N + 1, inf);\\n }\\n if(flow.max_flow(N, N + 1) <= 1) {\\n cout << \\\"-1\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n using T = int;\\n const auto INF = numeric_limits< T >::max();\\n vector< T > dist(scc.size(), INF);\\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\\n using Pi = pair< T, int >;\\n priority_queue< Pi, vector< Pi >, greater<> > que;\\n for(auto &p : scc.group[latte[0]]) {\\n dist[p] = 0;\\n que.emplace(0, p);\\n }\\n while(!que.empty()) {\\n T cost;\\n int idx;\\n tie(cost, idx) = que.top();\\n que.pop();\\n if(dist[idx] < cost) continue;\\n for(auto &e : rg.g[idx]) {\\n auto next_cost = cost + e.cost;\\n if(dist[e.to] <= next_cost) continue;\\n dist[e.to] = next_cost;\\n from[e.to] = idx;\\n id[e.to] = e.idx;\\n que.emplace(dist[e.to], e.to);\\n }\\n }\\n int ans = inf;\\n for(auto &p : scc.group[malta[0]]) {\\n chmin(ans, dist[p]);\\n }\\n if(ans >= inf) ans = -1;\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 50,\n \"memory_kb\": 30508,\n \"score_of_the_acc\": -0.4527,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3183_4846412\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n// #include <atcoder/all>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n \\n#define DEBUG(x) cerr<<#x<<\\\": \\\"<<x<<endl;\\n#define DEBUG_VEC(v) cerr<<#v<<\\\":\\\";for(int i=0;i<v.size();i++) cerr<<\\\" \\\"<<v[i]; cerr<<endl;\\n#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<\\\" \\\";}cerr<<endl;}\\ntypedef long long ll;\\n// #define int ll\\n \\n#define vi vector<int>\\n#define vl vector<ll>\\n#define vii vector< vector<int> >\\n#define vll vector< vector<ll> >\\n#define vs vector<string>\\n#define pii pair<int,int>\\n#define pis pair<int,string>\\n#define psi pair<string,int>\\n#define pll pair<ll,ll>\\ntemplate<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }\\ntemplate<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }\\ntemplate<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; return os; }\\n#define X first\\n#define Y second\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)\\n#define rrep1(i,n) for(int i=(int)(n);i>0;i--)\\n#define REP(i,a,b) for(int i=a;i<b;i++)\\n#define in(x, a, b) (a <= x && x < b)\\n#define all(c) c.begin(),c.end()\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }\\n#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());\\nconst ll inf = 1000000001;\\nconst ll INF = (ll)1e18 + 1;\\nconst long double pi = 3.1415926535897932384626433832795028841971L;\\n#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;\\n// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\n// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };\\nvi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};\\n// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };\\n#define fio() cin.tie(0); ios::sync_with_stdio(false);\\n// const ll MOD = 1000000007;\\nconst ll MOD = 998244353;\\n// #define mp make_pair\\n//#define endl '\\\\n'\\n\\n\\nnamespace internal {\\n\\ntemplate <class E> struct csr {\\n std::vector<int> start;\\n std::vector<E> elist;\\n csr(int n, const std::vector<std::pair<int, E>>& edges)\\n : start(n + 1), elist(edges.size()) {\\n for (auto e : edges) {\\n start[e.first + 1]++;\\n }\\n for (int i = 1; i <= n; i++) {\\n start[i] += start[i - 1];\\n }\\n auto counter = start;\\n for (auto e : edges) {\\n elist[counter[e.first]++] = e.second;\\n }\\n }\\n};\\n\\n// Reference:\\n// R. Tarjan,\\n// Depth-First Search and Linear Graph Algorithms\\nstruct scc_graph {\\n public:\\n scc_graph(int n) : _n(n) {}\\n\\n int num_vertices() { return _n; }\\n\\n void add_edge(int from, int to) { edges.push_back({from, {to}}); }\\n\\n // @return pair of (# of scc, scc id)\\n std::pair<int, std::vector<int>> scc_ids() {\\n auto g = csr<edge>(_n, edges);\\n int now_ord = 0, group_num = 0;\\n std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);\\n visited.reserve(_n);\\n auto dfs = [&](auto self, int v) -> void {\\n low[v] = ord[v] = now_ord++;\\n visited.push_back(v);\\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\\n auto to = g.elist[i].to;\\n if (ord[to] == -1) {\\n self(self, to);\\n low[v] = std::min(low[v], low[to]);\\n } else {\\n low[v] = std::min(low[v], ord[to]);\\n }\\n }\\n if (low[v] == ord[v]) {\\n while (true) {\\n int u = visited.back();\\n visited.pop_back();\\n ord[u] = _n;\\n ids[u] = group_num;\\n if (u == v) break;\\n }\\n group_num++;\\n }\\n };\\n for (int i = 0; i < _n; i++) {\\n if (ord[i] == -1) dfs(dfs, i);\\n }\\n for (auto& x : ids) {\\n x = group_num - 1 - x;\\n }\\n return {group_num, ids};\\n }\\n\\n std::vector<std::vector<int>> scc() {\\n auto ids = scc_ids();\\n int group_num = ids.first;\\n std::vector<int> counts(group_num);\\n for (auto x : ids.second) counts[x]++;\\n std::vector<std::vector<int>> groups(ids.first);\\n for (int i = 0; i < group_num; i++) {\\n groups[i].reserve(counts[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n groups[ids.second[i]].push_back(i);\\n }\\n return groups;\\n }\\n\\n private:\\n int _n;\\n struct edge {\\n int to;\\n };\\n std::vector<std::pair<int, edge>> edges;\\n};\\n\\n} // namespace internal\\n\\nstruct scc_graph {\\n public:\\n scc_graph() : internal(0) {}\\n scc_graph(int n) : internal(n) {}\\n\\n void add_edge(int from, int to) {\\n int n = internal.num_vertices();\\n assert(0 <= from && from < n);\\n assert(0 <= to && to < n);\\n internal.add_edge(from, to);\\n }\\n\\n std::vector<std::vector<int>> scc() { return internal.scc(); }\\n\\n private:\\n internal::scc_graph internal;\\n};\\n\\nvi group;\\nint first_group, last_group;\\n\\n// bool dfs(int now, int target, vector<vector<pii>>& G, set<int>& used_edges, vector<bool> visited) {\\n// if (now == target) return true;\\n// visited[now] = true;\\n// for (pii temp: G[now]) {\\n// int v = temp.first;\\n// if (visited[v]) continue;\\n// int edge_idx = temp.second;\\n// if (used_edges.count(edge_idx)) continue;\\n// used_edges.insert(edge_idx);\\n// if (dfs(v, target, G, used_edges, visited)) return true;\\n// used_edges.erase(edge_idx);\\n// }\\n// return false;\\n// }\\n\\n\\n\\n// �ӂ�\\\\���\\\\���� {�s��A�e�ʁA�t��}\\nstruct edge { int to; ll cap; int rev; };\\n#define V 101000\\nint s, t; //s��start, t��goal\\nvector< vector<edge> > G(V, vector<edge>());; //�O���t�̗אڃ��X�g�\\\\��\\nvector<bool> used(V); //DEF�Œ��ׂ����̃t���O\\n\\n\\t\\t\\t\\t\\t //from����to�������e��cap�̕ӂ��O���t�ɒlj�����\\nvoid add_edge(int from, int to, ll cap) {\\n\\tedge a;\\n\\ta.to = to; a.cap = cap; a.rev = G[to].size();\\n\\tG[from].push_back(a);\\n\\ta.to = from; a.cap = 0; a.rev = G[from].size() - 1;\\n\\tG[to].push_back(a);\\n}\\n\\nll dfs(int v, int t, ll f) {\\n\\tif (v == t) {\\n\\t\\treturn f;\\n\\t}\\n\\tused[v] = true;\\n\\tfor (int i = 0; i < G[v].size(); i++) {\\n\\t\\tedge &e = G[v][i];\\n\\t\\tif (!used[e.to] && e.cap > 0) {\\n\\t\\t\\tll d = dfs(e.to, t, min(f, e.cap));\\n\\t\\t\\tif (d > 0) {\\n\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\n\\nll max_flow(int s, int t) {\\n\\tll flow = 0;\\n\\twhile (true) {\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\tll f = dfs(s, t, INF);\\n\\t\\tif (f == 0) return flow;\\n\\t\\tflow += f;\\n if (flow >= 2) return flow;\\n\\t}\\n}\\n\\n\\nsigned main() {\\n fio();\\n int n, m;\\n cin >> n >> m;\\n scc_graph scc(n);\\n\\n vii G(n);\\n rep (i, m) {\\n int u, v;\\n cin >> u >> v;\\n u--; v--;\\n G[u].push_back(v);\\n scc.add_edge(u, v);\\n add_edge(u, v, 1);\\n }\\n\\n vii res = scc.scc();\\n int k = res.size();\\n if (k == 1) {\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n group.resize(n);\\n rep (i, res.size()) {\\n for (int u: res[i]) {\\n group[u] = i;\\n }\\n }\\n\\n vii G2(k);\\n vii rG2(k);\\n rep (u, n) {\\n for (int v: G[u]) {\\n if (group[u] == group[v]) continue;\\n G2[group[u]].push_back(group[v]);\\n rG2[group[v]].push_back(group[u]);\\n // add_edge(group[u], group[v], 1);\\n }\\n }\\n // vector<vector<pii>> G3(k);\\n // int edge_num = 0;\\n // rep (u, k) {\\n // for (int v: G2[u]) {\\n // G3[u].push_back(pii(v, edge_num++));\\n // }\\n // }\\n\\n rep (u, k) {\\n sort(all(G2[u]));\\n UNIQUE(G2[u]);\\n sort(all(rG2[u]));\\n UNIQUE(rG2[u]);\\n }\\n\\n vi in0, out0;\\n rep (i, k) {\\n if (G2[i].size() == 0) {\\n out0.push_back(i);\\n }\\n if (rG2[i].size() == 0) {\\n in0.push_back(i);\\n }\\n }\\n\\n if (in0.size() > 1 or out0.size() > 1) {\\n cout << -1 << endl;\\n return 0;\\n }\\n\\n first_group = in0[0];\\n last_group = out0[0];\\n // int F = max_flow(first_group, last_group);\\n int s = n, t = n + 1;\\n rep (i, n) {\\n if (group[i] == first_group) add_edge(s, i, 2);\\n if (group[i] == last_group) add_edge(i, t, 2);\\n }\\n int F = max_flow(s, t);\\n if (F < 2) {\\n cout << -1 << endl;\\n return 0;\\n }\\n\\n // set<int> used_edges;\\n // DEBUG_MAT(res);\\n // DEBUG_MAT(G3);\\n // vector<bool> visited(k);\\n // if (not dfs(first_group, last_group, G3, used_edges, visited)) {\\n // cout << -1 << endl;\\n // return 0;\\n // }\\n // fill(all(visited), false);\\n // if (not dfs(first_group, last_group, G3, used_edges, visited)) {\\n // cout << -1 << endl;\\n // return 0;\\n // }\\n\\n vi dist(n, inf);\\n queue<int> qu;\\n for (int u: res[first_group]) {\\n dist[u] = 0;\\n qu.push(u);\\n }\\n // DEBUG_VEC(dist);\\n // DEBUG_MAT(G); \\n\\n int ans = inf;\\n while (qu.size()) {\\n int u = qu.front();\\n qu.pop();\\n if (group[u] == last_group) {\\n chmin(ans, dist[u]);\\n }\\n\\n for (int v: G[u]) {\\n if (dist[v] > dist[u] + 1) {\\n dist[v] = dist[u] + 1;\\n qu.push(v);\\n }\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 41268,\n \"score_of_the_acc\": -0.966,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3183_4846394\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n// #include <atcoder/all>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n \\n#define DEBUG(x) cerr<<#x<<\\\": \\\"<<x<<endl;\\n#define DEBUG_VEC(v) cerr<<#v<<\\\":\\\";for(int i=0;i<v.size();i++) cerr<<\\\" \\\"<<v[i]; cerr<<endl;\\n#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<\\\" \\\";}cerr<<endl;}\\ntypedef long long ll;\\n// #define int ll\\n \\n#define vi vector<int>\\n#define vl vector<ll>\\n#define vii vector< vector<int> >\\n#define vll vector< vector<ll> >\\n#define vs vector<string>\\n#define pii pair<int,int>\\n#define pis pair<int,string>\\n#define psi pair<string,int>\\n#define pll pair<ll,ll>\\ntemplate<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }\\ntemplate<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }\\ntemplate<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; return os; }\\n#define X first\\n#define Y second\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)\\n#define rrep1(i,n) for(int i=(int)(n);i>0;i--)\\n#define REP(i,a,b) for(int i=a;i<b;i++)\\n#define in(x, a, b) (a <= x && x < b)\\n#define all(c) c.begin(),c.end()\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }\\n#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());\\nconst ll inf = 1000000001;\\nconst ll INF = (ll)1e18 + 1;\\nconst long double pi = 3.1415926535897932384626433832795028841971L;\\n#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;\\n// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\n// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };\\nvi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};\\n// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };\\n#define fio() cin.tie(0); ios::sync_with_stdio(false);\\n// const ll MOD = 1000000007;\\nconst ll MOD = 998244353;\\n// #define mp make_pair\\n//#define endl '\\\\n'\\n\\n\\nnamespace internal {\\n\\ntemplate <class E> struct csr {\\n std::vector<int> start;\\n std::vector<E> elist;\\n csr(int n, const std::vector<std::pair<int, E>>& edges)\\n : start(n + 1), elist(edges.size()) {\\n for (auto e : edges) {\\n start[e.first + 1]++;\\n }\\n for (int i = 1; i <= n; i++) {\\n start[i] += start[i - 1];\\n }\\n auto counter = start;\\n for (auto e : edges) {\\n elist[counter[e.first]++] = e.second;\\n }\\n }\\n};\\n\\n// Reference:\\n// R. Tarjan,\\n// Depth-First Search and Linear Graph Algorithms\\nstruct scc_graph {\\n public:\\n scc_graph(int n) : _n(n) {}\\n\\n int num_vertices() { return _n; }\\n\\n void add_edge(int from, int to) { edges.push_back({from, {to}}); }\\n\\n // @return pair of (# of scc, scc id)\\n std::pair<int, std::vector<int>> scc_ids() {\\n auto g = csr<edge>(_n, edges);\\n int now_ord = 0, group_num = 0;\\n std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);\\n visited.reserve(_n);\\n auto dfs = [&](auto self, int v) -> void {\\n low[v] = ord[v] = now_ord++;\\n visited.push_back(v);\\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\\n auto to = g.elist[i].to;\\n if (ord[to] == -1) {\\n self(self, to);\\n low[v] = std::min(low[v], low[to]);\\n } else {\\n low[v] = std::min(low[v], ord[to]);\\n }\\n }\\n if (low[v] == ord[v]) {\\n while (true) {\\n int u = visited.back();\\n visited.pop_back();\\n ord[u] = _n;\\n ids[u] = group_num;\\n if (u == v) break;\\n }\\n group_num++;\\n }\\n };\\n for (int i = 0; i < _n; i++) {\\n if (ord[i] == -1) dfs(dfs, i);\\n }\\n for (auto& x : ids) {\\n x = group_num - 1 - x;\\n }\\n return {group_num, ids};\\n }\\n\\n std::vector<std::vector<int>> scc() {\\n auto ids = scc_ids();\\n int group_num = ids.first;\\n std::vector<int> counts(group_num);\\n for (auto x : ids.second) counts[x]++;\\n std::vector<std::vector<int>> groups(ids.first);\\n for (int i = 0; i < group_num; i++) {\\n groups[i].reserve(counts[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n groups[ids.second[i]].push_back(i);\\n }\\n return groups;\\n }\\n\\n private:\\n int _n;\\n struct edge {\\n int to;\\n };\\n std::vector<std::pair<int, edge>> edges;\\n};\\n\\n} // namespace internal\\n\\nstruct scc_graph {\\n public:\\n scc_graph() : internal(0) {}\\n scc_graph(int n) : internal(n) {}\\n\\n void add_edge(int from, int to) {\\n int n = internal.num_vertices();\\n assert(0 <= from && from < n);\\n assert(0 <= to && to < n);\\n internal.add_edge(from, to);\\n }\\n\\n std::vector<std::vector<int>> scc() { return internal.scc(); }\\n\\n private:\\n internal::scc_graph internal;\\n};\\n\\nvi group;\\nint first_group, last_group;\\n\\n// bool dfs(int now, int target, vector<vector<pii>>& G, set<int>& used_edges, vector<bool> visited) {\\n// if (now == target) return true;\\n// visited[now] = true;\\n// for (pii temp: G[now]) {\\n// int v = temp.first;\\n// if (visited[v]) continue;\\n// int edge_idx = temp.second;\\n// if (used_edges.count(edge_idx)) continue;\\n// used_edges.insert(edge_idx);\\n// if (dfs(v, target, G, used_edges, visited)) return true;\\n// used_edges.erase(edge_idx);\\n// }\\n// return false;\\n// }\\n\\n\\n\\n// �ӂ�\\\\���\\\\���� {�s��A�e�ʁA�t��}\\nstruct edge { int to; ll cap; int rev; };\\n#define V 101000\\nint s, t; //s��start, t��goal\\nvector< vector<edge> > G(V, vector<edge>());; //�O���t�̗אڃ��X�g�\\\\��\\nvector<bool> used(V); //DEF�Œ��ׂ����̃t���O\\n\\n\\t\\t\\t\\t\\t //from����to�������e��cap�̕ӂ��O���t�ɒlj�����\\nvoid add_edge(int from, int to, ll cap) {\\n\\tedge a;\\n\\ta.to = to; a.cap = cap; a.rev = G[to].size();\\n\\tG[from].push_back(a);\\n\\ta.to = from; a.cap = 0; a.rev = G[from].size() - 1;\\n\\tG[to].push_back(a);\\n}\\n\\nll dfs(int v, int t, ll f) {\\n\\tif (v == t) {\\n\\t\\treturn f;\\n\\t}\\n\\tused[v] = true;\\n\\tfor (int i = 0; i < G[v].size(); i++) {\\n\\t\\tedge &e = G[v][i];\\n\\t\\tif (!used[e.to] && e.cap > 0) {\\n\\t\\t\\tll d = dfs(e.to, t, min(f, e.cap));\\n\\t\\t\\tif (d > 0) {\\n\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\n\\nll max_flow(int s, int t) {\\n\\tll flow = 0;\\n\\twhile (true) {\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\tll f = dfs(s, t, INF);\\n\\t\\tif (f == 0) return flow;\\n\\t\\tflow += f;\\n if (flow >= 2) return flow;\\n\\t}\\n}\\n\\n\\nsigned main() {\\n fio();\\n int n, m;\\n cin >> n >> m;\\n scc_graph scc(n);\\n\\n vii G(n);\\n rep (i, m) {\\n int u, v;\\n cin >> u >> v;\\n u--; v--;\\n G[u].push_back(v);\\n scc.add_edge(u, v);\\n }\\n\\n vii res = scc.scc();\\n int k = res.size();\\n if (k == 1) {\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n group.resize(n);\\n rep (i, res.size()) {\\n for (int u: res[i]) {\\n group[u] = i;\\n }\\n }\\n\\n vii G2(k);\\n vii rG2(k);\\n rep (u, n) {\\n for (int v: G[u]) {\\n if (group[u] == group[v]) continue;\\n G2[group[u]].push_back(group[v]);\\n rG2[group[v]].push_back(group[u]);\\n add_edge(group[u], group[v], 1);\\n }\\n }\\n // vector<vector<pii>> G3(k);\\n // int edge_num = 0;\\n // rep (u, k) {\\n // for (int v: G2[u]) {\\n // G3[u].push_back(pii(v, edge_num++));\\n // }\\n // }\\n\\n rep (u, k) {\\n sort(all(G2[u]));\\n UNIQUE(G2[u]);\\n sort(all(rG2[u]));\\n UNIQUE(rG2[u]);\\n }\\n\\n vi in0, out0;\\n rep (i, k) {\\n if (G2[i].size() == 0) {\\n out0.push_back(i);\\n }\\n if (rG2[i].size() == 0) {\\n in0.push_back(i);\\n }\\n }\\n\\n if (in0.size() > 1 or out0.size() > 1) {\\n cout << -1 << endl;\\n return 0;\\n }\\n\\n first_group = in0[0];\\n last_group = out0[0];\\n int F = max_flow(first_group, last_group);\\n if (F < 2) {\\n cout << -1 << endl;\\n return 0;\\n }\\n\\n // set<int> used_edges;\\n // DEBUG_MAT(res);\\n // DEBUG_MAT(G3);\\n // vector<bool> visited(k);\\n // if (not dfs(first_group, last_group, G3, used_edges, visited)) {\\n // cout << -1 << endl;\\n // return 0;\\n // }\\n // fill(all(visited), false);\\n // if (not dfs(first_group, last_group, G3, used_edges, visited)) {\\n // cout << -1 << endl;\\n // return 0;\\n // }\\n\\n vi dist(n, inf);\\n queue<int> qu;\\n for (int u: res[first_group]) {\\n dist[u] = 0;\\n qu.push(u);\\n }\\n // DEBUG_VEC(dist);\\n // DEBUG_MAT(G); \\n\\n int ans = inf;\\n while (qu.size()) {\\n int u = qu.front();\\n qu.pop();\\n if (group[u] == last_group) {\\n chmin(ans, dist[u]);\\n }\\n\\n for (int v: G[u]) {\\n if (dist[v] > dist[u] + 1) {\\n dist[v] = dist[u] + 1;\\n qu.push(v);\\n }\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.35135135135135137,\n \"time_ms\": 30,\n \"memory_kb\": 26632,\n \"score_of_the_acc\": -0.1825,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3183_4846389\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\nconst int mod = 1e9 + 7;\\n// const int mod = 998244353;\\n\\nconst int64 infll = (1LL << 62) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\ntemplate< typename T = int >\\nstruct Edge {\\n int from, to;\\n T cost;\\n int idx;\\n\\n Edge() = default;\\n\\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\\n\\n operator int() const { return to; }\\n};\\n\\ntemplate< typename T = int >\\nstruct Graph {\\n vector< vector< Edge< T > > > g;\\n int es;\\n\\n Graph() = default;\\n\\n explicit Graph(int n) : g(n), es(0) {}\\n\\n size_t size() const {\\n return g.size();\\n }\\n\\n void add_directed_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es++);\\n }\\n\\n void add_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es);\\n g[to].emplace_back(to, from, cost, es++);\\n }\\n\\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n a += padding;\\n b += padding;\\n T c = T(1);\\n if(weighted) cin >> c;\\n if(directed) add_directed_edge(a, b, c);\\n else add_edge(a, b, c);\\n }\\n }\\n};\\n\\ntemplate< typename T = int >\\nusing Edges = vector< Edge< T > >;\\n\\n/**\\n * @brief Strongly-Connected-Components(強連結成分分解)\\n */\\ntemplate< typename T = int >\\nstruct StronglyConnectedComponents : Graph< T > {\\npublic:\\n using Graph< T >::Graph;\\n using Graph< T >::g;\\n vector< int > comp;\\n Graph< T > dag;\\n vector< vector< int > > group;\\n\\n void build() {\\n rg = Graph< T >(g.size());\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n rg.add_directed_edge(e.to, e.from, e.cost);\\n }\\n }\\n comp.assign(g.size(), -1);\\n used.assign(g.size(), 0);\\n for(int i = 0; i < g.size(); i++) dfs(i);\\n reverse(begin(order), end(order));\\n int ptr = 0;\\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\\n dag = Graph< T >(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n int x = comp[e.from], y = comp[e.to];\\n if(x == y) continue;\\n dag.add_directed_edge(x, y, e.cost);\\n }\\n }\\n group.resize(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n group[comp[i]].emplace_back(i);\\n }\\n }\\n\\n int operator[](int k) const {\\n return comp[k];\\n }\\n\\nprivate:\\n vector< int > order, used;\\n Graph< T > rg;\\n\\n void dfs(int idx) {\\n if(exchange(used[idx], true)) return;\\n for(auto &to : g[idx]) dfs(to);\\n order.push_back(idx);\\n }\\n\\n void rdfs(int idx, int cnt) {\\n if(comp[idx] != -1) return;\\n comp[idx] = cnt;\\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\\n }\\n};\\n\\n\\n/**\\n * @brief Ford-Fulkerson(最大流)\\n * @docs docs/ford-fulkerson.md\\n */\\ntemplate< typename flow_t >\\nstruct FordFulkerson {\\n struct edge {\\n int to;\\n flow_t cap;\\n int rev;\\n bool isrev;\\n int idx;\\n };\\n\\n vector< vector< edge > > graph;\\n vector< int > used;\\n const flow_t INF;\\n int timestamp;\\n\\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\\n\\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\\n }\\n\\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\\n if(idx == t) return flow;\\n used[idx] = timestamp;\\n for(auto &e : graph[idx]) {\\n if(e.cap > 0 && used[e.to] != timestamp) {\\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\\n if(d > 0) {\\n e.cap -= d;\\n graph[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\\n flow += f;\\n if(flow >= 2) break;\\n }\\n return flow;\\n }\\n\\n void output() {\\n for(int i = 0; i < graph.size(); i++) {\\n for(auto &e : graph[i]) {\\n if(e.isrev) continue;\\n auto &rev_e = graph[e.to][e.rev];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n }\\n};\\n\\n/**\\n * @brief Dijkstra(単一始点最短路)\\n * @docs docs/dijkstra.md\\n */\\ntemplate< typename T >\\nstruct ShortestPath {\\n vector< T > dist;\\n vector< int > from, id;\\n};\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n vector< int > A(M), B(M);\\n Graph<> rg(N);\\n StronglyConnectedComponents<> scc(N);\\n for(int i = 0; i < M; i++) {\\n cin >> A[i] >> B[i];\\n --A[i], --B[i];\\n scc.add_directed_edge(A[i], B[i]);\\n rg.add_directed_edge(B[i], A[i]);\\n }\\n scc.build();\\n if(scc.dag.size() == 1) {\\n cout << 0 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n vector< int > in(N), out(N);\\n for(int i = 0; i < scc.dag.size(); i++) {\\n if(scc.dag.g[i].size()) {\\n in[i] = true;\\n }\\n for(auto &t : scc.dag.g[i]) {\\n out[t] = true;\\n }\\n }\\n\\n vector< int > latte, malta;\\n for(int i = 0; i < N; i++) {\\n if(!in[i]) {\\n latte.emplace_back(i);\\n }\\n if(!out[i]) {\\n malta.emplace_back(i);\\n }\\n }\\n if(latte.size() != 1 && malta.size() != 1) {\\n cout << -1 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n FordFulkerson< int > flow(scc.size() + 2);\\n for(int i = 0; i < M; i++) {\\n flow.add_edge(A[i], B[i], 1);\\n }\\n for(auto &p : scc.group[malta[0]]) {\\n flow.add_edge(scc.size(), p, inf);\\n }\\n for(auto &p : scc.group[latte[0]]) {\\n flow.add_edge(p, scc.size() + 1, inf);\\n }\\n if(flow.max_flow(scc.size(), scc.size() + 1) <= 1) {\\n cout << \\\"-1\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n using T = int;\\n const auto INF = numeric_limits< T >::max();\\n vector< T > dist(scc.size(), INF);\\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\\n using Pi = pair< T, int >;\\n priority_queue< Pi, vector< Pi >, greater<> > que;\\n for(auto &p : scc.group[latte[0]]) {\\n dist[p] = 0;\\n que.emplace(0, p);\\n }\\n while(!que.empty()) {\\n T cost;\\n int idx;\\n tie(cost, idx) = que.top();\\n que.pop();\\n if(dist[idx] < cost) continue;\\n for(auto &e : rg.g[idx]) {\\n auto next_cost = cost + e.cost;\\n if(dist[e.to] <= next_cost) continue;\\n dist[e.to] = next_cost;\\n from[e.to] = idx;\\n id[e.to] = e.idx;\\n que.emplace(dist[e.to], e.to);\\n }\\n }\\n int ans = inf;\\n for(auto &p : scc.group[malta[0]]) {\\n chmin(ans, dist[p]);\\n }\\n if(ans >= inf) ans = -1;\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 40,\n \"memory_kb\": 30508,\n \"score_of_the_acc\": -0.386,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3183_4846354\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\nconst int mod = 1e9 + 7;\\n// const int mod = 998244353;\\n\\nconst int64 infll = (1LL << 62) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\ntemplate< typename T = int >\\nstruct Edge {\\n int from, to;\\n T cost;\\n int idx;\\n\\n Edge() = default;\\n\\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\\n\\n operator int() const { return to; }\\n};\\n\\ntemplate< typename T = int >\\nstruct Graph {\\n vector< vector< Edge< T > > > g;\\n int es;\\n\\n Graph() = default;\\n\\n explicit Graph(int n) : g(n), es(0) {}\\n\\n size_t size() const {\\n return g.size();\\n }\\n\\n void add_directed_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es++);\\n }\\n\\n void add_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es);\\n g[to].emplace_back(to, from, cost, es++);\\n }\\n\\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n a += padding;\\n b += padding;\\n T c = T(1);\\n if(weighted) cin >> c;\\n if(directed) add_directed_edge(a, b, c);\\n else add_edge(a, b, c);\\n }\\n }\\n};\\n\\ntemplate< typename T = int >\\nusing Edges = vector< Edge< T > >;\\n\\n/**\\n * @brief Strongly-Connected-Components(強連結成分分解)\\n */\\ntemplate< typename T = int >\\nstruct StronglyConnectedComponents : Graph< T > {\\npublic:\\n using Graph< T >::Graph;\\n using Graph< T >::g;\\n vector< int > comp;\\n Graph< T > dag;\\n vector< vector< int > > group;\\n\\n void build() {\\n rg = Graph< T >(g.size());\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n rg.add_directed_edge(e.to, e.from, e.cost);\\n }\\n }\\n comp.assign(g.size(), -1);\\n used.assign(g.size(), 0);\\n for(int i = 0; i < g.size(); i++) dfs(i);\\n reverse(begin(order), end(order));\\n int ptr = 0;\\n for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;\\n dag = Graph< T >(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n for(auto &e : g[i]) {\\n int x = comp[e.from], y = comp[e.to];\\n if(x == y) continue;\\n dag.add_directed_edge(x, y, e.cost);\\n }\\n }\\n group.resize(ptr);\\n for(int i = 0; i < g.size(); i++) {\\n group[comp[i]].emplace_back(i);\\n }\\n }\\n\\n int operator[](int k) const {\\n return comp[k];\\n }\\n\\nprivate:\\n vector< int > order, used;\\n Graph< T > rg;\\n\\n void dfs(int idx) {\\n if(exchange(used[idx], true)) return;\\n for(auto &to : g[idx]) dfs(to);\\n order.push_back(idx);\\n }\\n\\n void rdfs(int idx, int cnt) {\\n if(comp[idx] != -1) return;\\n comp[idx] = cnt;\\n for(auto &to : rg.g[idx]) rdfs(to, cnt);\\n }\\n};\\n\\n\\n/**\\n * @brief Ford-Fulkerson(最大流)\\n * @docs docs/ford-fulkerson.md\\n */\\ntemplate< typename flow_t >\\nstruct FordFulkerson {\\n struct edge {\\n int to;\\n flow_t cap;\\n int rev;\\n bool isrev;\\n int idx;\\n };\\n\\n vector< vector< edge > > graph;\\n vector< int > used;\\n const flow_t INF;\\n int timestamp;\\n\\n explicit FordFulkerson(int V) : INF(numeric_limits< flow_t >::max()), graph(V), used(V, -1), timestamp(0) {}\\n\\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\\n }\\n\\n flow_t find_augment_path(int idx, const int t, flow_t flow) {\\n if(idx == t) return flow;\\n used[idx] = timestamp;\\n for(auto &e : graph[idx]) {\\n if(e.cap > 0 && used[e.to] != timestamp) {\\n flow_t d = find_augment_path(e.to, t, min(flow, e.cap));\\n if(d > 0) {\\n e.cap -= d;\\n graph[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n for(flow_t f; (f = find_augment_path(s, t, INF)) > 0; timestamp++) {\\n flow += f;\\n }\\n return flow;\\n }\\n\\n void output() {\\n for(int i = 0; i < graph.size(); i++) {\\n for(auto &e : graph[i]) {\\n if(e.isrev) continue;\\n auto &rev_e = graph[e.to][e.rev];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n }\\n};\\n\\n/**\\n * @brief Dijkstra(単一始点最短路)\\n * @docs docs/dijkstra.md\\n */\\ntemplate< typename T >\\nstruct ShortestPath {\\n vector< T > dist;\\n vector< int > from, id;\\n};\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n vector< int > A(M), B(M);\\n Graph<> rg(N);\\n StronglyConnectedComponents<> scc(N);\\n for(int i = 0; i < M; i++) {\\n cin >> A[i] >> B[i];\\n --A[i], --B[i];\\n scc.add_directed_edge(A[i], B[i]);\\n rg.add_directed_edge(B[i], A[i]);\\n }\\n scc.build();\\n if(scc.dag.size() == 1) {\\n cout << 0 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n vector< int > in(N), out(N);\\n for(int i = 0; i < scc.dag.size(); i++) {\\n if(scc.dag.g[i].size()) {\\n in[i] = true;\\n }\\n for(auto &t : scc.dag.g[i]) {\\n out[t] = true;\\n }\\n }\\n\\n vector< int > latte, malta;\\n for(int i = 0; i < N; i++) {\\n if(!in[i]) {\\n latte.emplace_back(i);\\n }\\n if(!out[i]) {\\n malta.emplace_back(i);\\n }\\n }\\n if(latte.size() != 1 && malta.size() != 1) {\\n cout << -1 << \\\"\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n FordFulkerson< int > flow(scc.size());\\n for(int i = 0; i < scc.size(); i++) {\\n for(auto &p : scc.dag.g[i]) {\\n flow.add_edge(i, p, 1);\\n }\\n }\\n if(flow.max_flow(malta[0], latte[0]) <= 1) {\\n cout << \\\"-1\\\\n\\\";\\n exit(0);\\n }\\n\\n\\n using T = int;\\n const auto INF = numeric_limits< T >::max();\\n vector< T > dist(scc.size(), INF);\\n vector< int > from(scc.size(), -1), id(scc.size(), -1);\\n using Pi = pair< T, int >;\\n priority_queue< Pi, vector< Pi >, greater<> > que;\\n for(auto &p : scc.group[latte[0]]) {\\n dist[p] = 0;\\n que.emplace(0, p);\\n }\\n while(!que.empty()) {\\n T cost;\\n int idx;\\n tie(cost, idx) = que.top();\\n que.pop();\\n if(dist[idx] < cost) continue;\\n for(auto &e : rg.g[idx]) {\\n auto next_cost = cost + e.cost;\\n if(dist[e.to] <= next_cost) continue;\\n dist[e.to] = next_cost;\\n from[e.to] = idx;\\n id[e.to] = e.idx;\\n que.emplace(dist[e.to], e.to);\\n }\\n }\\n int ans = inf;\\n for(auto &p : scc.group[malta[0]]) {\\n chmin(ans, dist[p]);\\n }\\n if(ans >= inf) ans = -1;\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 50,\n \"memory_kb\": 29876,\n \"score_of_the_acc\": -0.4304,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1996,"cells":{"group_id":{"kind":"string","value":"aoj_3170_cpp"},"problem_description":{"kind":"string","value":"G: Freqs\n問題\n長さ $N$ の数列 $A = (a_1, a_2, ..., a_N)$ が与えられます。以下で説明されるクエリを $Q$ 回処理してください。クエリは $4$ 種類あります。\nクエリ 1: $l, r, x$ が与えられるので、$a_i$ ($l \\leq i \\leq r$) を $\\min(a_i, x)$ に更新する。\nクエリ 2: $l, r, x$ が与えられるので、$a_i$ ($l \\leq i \\leq r$) を $\\max(a_i, x)$ に更新する。\nクエリ 3: $l, r, x$ が与えられるので、$a_i$ ($l \\leq i \\leq r$) を $a_i + x$ に更新する。\nクエリ 4: $l, r, x, y$ が与えられるので、$l \\leq i \\leq r$ かつ $x \\leq a_i \\leq y$ を満たす $i$ の個数を報告する。\n入力形式\n$N$ $Q$\n$a_1$ $a_2$ ... $a_N$\n$q_1$\n...\n$q_Q$\nただし、$q_j$ ($1\\leq j \\leq Q$) の形式は次のいずれかです。\nクエリ 1：\n1 $l$ $r$ $x$\nクエリ 2：\n2 $l$ $r$ $x$\nクエリ 3：\n3 $l$ $r$ $x$\nクエリ 4：\n4 $l$ $r$ $x$ $y$\n制約\n入力は全て整数で与えられる\n$1 \\leq N \\leq 10^5$\n$1 \\leq Q \\leq 10^5$\n$-10^9 \\leq a_i \\leq 10^9$ ($1 \\leq i \\leq N$)\n$1 \\leq l_i \\leq r_i \\leq N$ ($1 \\leq i \\leq Q$)\nクエリ 1, 2, 3 において $-10^9 \\leq x_i \\leq 10^9$ ($1 \\leq i \\leq Q$)\nクエリ 4 において $-10^{15} \\leq x_i \\leq y_i \\leq 10^{15}$ ($1 \\leq i \\leq Q$)\n出力形式\n各クエリ 4 に対して、その答えを一行ずつ出力してください。\n入力例1\n6 8\n3 1 4 1 5 9\n4 2 5 3 6\n2 2 5 3\n3 4 6 3\n4 2 5 4 7\n3 3 6 -10\n4 2 5 -5 5\n1 1 6 1\n4 1 6 -10 0\n出力例1\n2\n2\n3\n3\n$q_1$ のクエリ 4 について、条件を満たす $i$ は $3$ と $5$ なので、その個数 $2$ を出力します。クエリ 1, 2, 3 の更新により、数列 $A$ は次のように変化していきます。\n$q_2$ の直後：\n3 3 4 3 5 9\n$q_3$ の直後：\n3 3 4 6 8 12\n$q_5$ の直後：\n3 3 -6 -4 -2 2\n$q_7$ の直後：\n1 1 -6 -4 -2 1\n入力例2\n10 12\n1 -1 -3 9 0 1 -3 7 5 -8\n1 1 6 4\n4 2 10 3 9\n2 4 9 7\n3 5 8 -2\n2 1 3 1\n4 8 10 -10 1\n3 2 5 3\n4 1 3 3 7\n1 2 2 5\n4 1 9 1 5\n1 3 10 2\n4 5 7 -2 4\n出力例2\n3\n1\n2\n6\n3"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3170_10536492","code_snippet":"// AOJ #3170 Freqs\n// 2025.5.28\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nll Cinll() {\n\tll n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) {\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n pc('\\n');\n}\n\nconst int MAXN = 100000;\nconst int BSZ = 200;\nconst ll INF = (ll)4e18;\n\nint N, Q;\nll A[MAXN];\nint nb;\nint szb[MAXN/BSZ+5];\n\nll cm[MAXN/BSZ+5], cM[MAXN/BSZ+5], addv[MAXN/BSZ+5];\n\nll V[MAXN/BSZ+5][BSZ];\n\ninline void flush_block(int b, bool f_sort){\n int start = b*BSZ;\n ll cap_max = cm[b], cap_min = cM[b], ad = addv[b];\n int s = szb[b];\n for(int i=0;i<s;i++){\n int idx = start + i;\n ll v = A[idx];\n if(v > cap_max) v = cap_max;\n if(v < cap_min) v = cap_min;\n v += ad;\n A[idx] = v;\n V[b][i] = v;\n }\n if(f_sort) sort(V[b], V[b]+s);\n cm[b] = INF;\n cM[b] = -INF;\n addv[b] = 0;\n}\n\nint main(){\n N = Cin(), Q = Cin();\n for(int i=0;i<N;i++) A[i] = Cin();\n\n nb = (N + BSZ - 1) / BSZ;\n for(int b=0;b<nb;b++){\n int start = b*BSZ;\n int s = min(BSZ, N - start);\n szb[b] = s;\n for(int i=0;i<s;i++) V[b][i] = A[start + i];\n sort(V[b], V[b]+s);\n cm[b] = INF;\n cM[b] = -INF;\n addv[b] = 0;\n }\n\n while(Q--){\n int t = Cin(), l = Cin()-1, r = Cin()-1;\n ll x = Cinll();\n ll y;\n if(t==4) y = Cinll();\n\n int bL = l/BSZ, bR = r/BSZ;\n int ans = 0;\n if(bL == bR){\n flush_block(bL, true);\n for(int i=l;i<=r;i++){\n if(t==1) A[i] = min(A[i], x);\n else if(t==2) A[i] = max(A[i], x);\n else if(t==3) A[i] += x;\n else if(t==4) if(A[i]>=x && A[i]<=y) ans++;\n }\n int start=bL*BSZ, s=szb[bL];\n for(int i=0;i<s;i++) V[bL][i] = A[start+i];\n sort(V[bL], V[bL]+s);\n } else {\n flush_block(bL, false);\n flush_block(bR, false);\n\n int endL = (bL+1)*BSZ;\n for(int i=l;i<endL;i++){\n if(t==1) A[i] = min(A[i], x);\n else if(t==2) A[i] = max(A[i], x);\n else if(t==3) A[i] += x;\n else if(t==4) if(A[i]>=x && A[i]<=y) ans++;\n }\n int startR = bR*BSZ;\n for(int i=startR;i<=r;i++){\n if(t==1) A[i] = min(A[i], x);\n else if(t==2) A[i] = max(A[i], x);\n else if(t==3) A[i] += x;\n else if(t==4) if(A[i]>=x && A[i]<=y) ans++;\n }\n\n for(int b=bL+1; b<bR; b++){\n if(t==1){\n ll lim = x - addv[b];\n if(lim < cm[b]) cm[b] = lim;\n if(cM[b] > cm[b]) cM[b] = cm[b];\n }\n else if(t==2){\n ll lim = x - addv[b];\n if(lim > cM[b]) cM[b] = lim;\n if(cM[b] > cm[b]) cm[b] = cM[b];\n }\n else if(t==3) addv[b] += x;\n else {\n ll tl = x - addv[b], tr = y - addv[b];\n if(tl > cm[b] || tr < cM[b]) continue;\n ll lo = tl, hi = tr;\n if(cM[b] >= tl) lo = -INF;\n if(cm[b] <= tr) hi = +INF;\n int cnt = upper_bound(V[b], V[b]+szb[b], hi)\n - lower_bound(V[b], V[b]+szb[b], lo);\n ans += cnt;\n }\n }\n\n flush_block(bL, true);\n flush_block(bR, true);\n }\n if(t==4) Cout(ans);\n }\n return 0;\n}","accuracy":1,"time_ms":1200,"memory_kb":4940,"score_of_the_acc":-0.802,"final_rank":8},{"submission_id":"aoj_3170_10315691","code_snippet":"// AOJ #3170 Freqs\n// 2025.3.21\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(ll n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nstruct Block {\n int L, R;\n vector<ll> a;\n vector<ll> s;\n ll lz;\n ll mn, mx;\n\n void init(int L, int R, const vector<ll>& arr) {\n this->L = L; this->R = R;\n a.resize(R - L + 1);\n for (int i = L; i <= R; i++) a[i - L] = arr[i];\n lz = 0;\n rebuild();\n }\n void rebuild() {\n s = a;\n sort(s.begin(), s.end());\n if(!s.empty()){\n mn = s.front() + lz;\n mx = s.back() + lz;\n } else mn = mx = 0;\n }\n void push(){\n if(lz){\n for(auto &v : a) v += lz;\n lz = 0;\n rebuild();\n }\n }\n void add(ll x) {\n lz += x;\n mn += x;\n mx += x;\n }\n void chmin(ll x) {\n if(mx <= x) return;\n if(mn >= x){\n lz = 0;\n for(auto &v : a) v = x;\n rebuild();\n return;\n }\n push();\n for(auto &v : a) if(v > x) v = x;\n rebuild();\n }\n void chmax(ll x) {\n if(mn >= x) return;\n if(mx <= x){\n lz = 0;\n for(auto &v : a) v = x;\n rebuild();\n return;\n }\n push();\n for(auto &v : a) if(v < x) v = x;\n rebuild();\n }\n void add_range(int l, int r, ll x){\n push();\n for (int i = l; i <= r; i++) a[i] += x;\n rebuild();\n }\n void chmin_range(int l, int r, ll x){\n push();\n for (int i = l; i <= r; i++) if(a[i] > x) a[i] = x;\n rebuild();\n }\n void chmax_range(int l, int r, ll x){\n push();\n for (int i = l; i <= r; i++) if(a[i] < x) a[i] = x;\n rebuild();\n }\n int count_range(int l, int r, ll x, ll y){\n int cnt = 0;\n push();\n for (int i = l; i <= r; i++){\n ll v = a[i];\n if(v >= x && v <= y) cnt++;\n }\n return cnt;\n }\n int query(ll x, ll y){\n ll Lbound = x - lz, Rbound = y - lz;\n return (int)(upper_bound(s.begin(), s.end(), Rbound) - lower_bound(s.begin(), s.end(), Lbound));\n }\n};\n\nint main(){\n int n = Cin(), q = Cin();\n vector<ll> arr(n);\n for (int i = 0; i < n; i++) arr[i] = Cin();\n\n int bs = max(1, (int)sqrt(n));\n vector<Block> B;\n for (int i = 0; i < n; i += bs) {\n int r = min(n - 1, i + bs - 1);\n Block b;\n b.init(i, r, arr);\n B.push_back(b);\n }\n\n while(q--){\n int t = gc() & 0xf; gc();\n if(t == 1){\n int l = Cin()-1, r = Cin()-1;\n ll x = Cin();\n for(auto &b : B){\n if(b.R < l || b.L > r) continue;\n if(l <= b.L && b.R <= r) b.chmin(x);\n else {\n int li = max(l, b.L) - b.L, ri = min(r, b.R) - b.L;\n b.chmin_range(li, ri, x);\n }\n }\n } else if(t == 2){\n int l = Cin()-1, r = Cin()-1;\n ll x = Cin();\n for(auto &b : B){\n if(b.R < l || b.L > r) continue;\n if(l <= b.L && b.R <= r) b.chmax(x);\n else {\n int li = max(l, b.L) - b.L, ri = min(r, b.R) - b.L;\n b.chmax_range(li, ri, x);\n }\n }\n } else if(t == 3){\n int l = Cin()-1, r = Cin()-1;\n ll x = Cin();\n for(auto &b : B){\n if(b.R < l || b.L > r) continue;\n if(l <= b.L && b.R <= r) b.add(x);\n else {\n int li = max(l, b.L) - b.L, ri = min(r, b.R) - b.L;\n b.add_range(li, ri, x);\n }\n }\n } else if(t == 4){\n int l = Cin()-1, r = Cin()-1;\n ll x = Cin(), y= Cin();\n ll ans = 0;\n for(auto &b : B){\n if(b.R < l || b.L > r) continue;\n if(l <= b.L && b.R <= r)\n ans += b.query(x, y);\n else {\n int li = max(l, b.L) - b.L, ri = min(r, b.R) - b.L;\n ans += b.count_range(li, ri, x, y);\n }\n }\n Cout(ans);\n }\n }\n return 0;\n}","accuracy":0.09523809523809523,"time_ms":1290,"memory_kb":5308,"score_of_the_acc":-0.9079,"final_rank":20},{"submission_id":"aoj_3170_9983927","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <array>\n#include <tuple>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <cassert>\n#include <climits>\n#include <iomanip>\n#include <numeric>\n#include <memory>\n#include <random>\n#include <thread>\n#include <chrono>\n#define allof(obj) (obj).begin(), (obj).end()\n#define range(i, l, r) for(int i=l;i<r;i++)\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\n#define bit_kth(i, k) ((i >> k)&1)\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\nusing ll = long long;\nusing ld = long double;\nusing ul = uint64_t;\nusing pi = std::pair<int, int>;\nusing pl = std::pair<ll, ll>;\nusing namespace std;\n\ntemplate<typename F, typename S>\nstd::ostream &operator << (std::ostream &dest, const std::pair<F, S> &p) {\n dest << p.first << ' ' << p.second;\n return dest;\n}\n\ntemplate<typename A, typename B>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t);\n return dest;\n}\n\ntemplate<typename A, typename B, typename C>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t);\n return dest;\n}\n\ntemplate<typename A, typename B, typename C, typename D>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C, D> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t) << ' ' << std::get<3>(t);\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::vector<std::vector<T>> &v) {\n int sz = v.size();\n if (!sz) return dest;\n for (int i = 0; i < sz; i++) {\n int m = v[i].size();\n for (int j = 0; j < m; j++) dest << v[i][j] << (i != sz - 1 && j == m - 1 ? '\\n' : ' ');\n }\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::vector<T> &v) {\n int sz = v.size();\n if (!sz) return dest;\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\n dest << v[sz - 1];\n return dest;\n}\n\ntemplate<typename T, size_t sz>\nstd::ostream &operator << (std::ostream &dest, const std::array<T, sz> &v) {\n if (!sz) return dest;\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\n dest << v[sz - 1];\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::set<T> &v) {\n for (auto itr = v.begin(); itr != v.end();) {\n dest << *itr;\n itr++;\n if (itr != v.end()) dest << ' ';\n }\n return dest;\n}\n\ntemplate<typename T, typename E>\nstd::ostream &operator << (std::ostream &dest, const std::map<T, E> &v) {\n for (auto itr = v.begin(); itr != v.end(); ) {\n dest << '(' << itr->first << \", \" << itr->second << ')';\n itr++;\n if (itr != v.end()) dest << '\\n';\n }\n return dest;\n}\n\ntemplate<typename T>\nstd::vector<T> make_vec(size_t sz, T val) { return std::vector<T>(sz, val); }\n\ntemplate<typename T, typename... Tail>\nauto make_vec(size_t sz, Tail ...tail) {\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\n}\n\ntemplate<typename T>\nstd::vector<T> read_vec(size_t sz) {\n std::vector<T> v(sz);\n for (int i = 0; i < (int)sz; i++) std::cin >> v[i];\n return v;\n}\n\ntemplate<typename T, typename... Tail>\nauto read_vec(size_t sz, Tail ...tail) {\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\n for (int i = 0; i < (int)sz; i++) v[i] = read_vec<T>(tail...);\n return v;\n}\n\ntemplate<typename T, size_t size>\nauto make_array(T x) { \n std::array<T, size> res;\n res.fill(x);\n return res;\n}\n\ntemplate<typename T, size_t size, size_t size2, size_t... Tail>\nauto make_array(T x) {\n std::array<decltype(make_array<T, size2, Tail...>(x)), size> res;\n res.fill(make_array<T, size2, Tail...>(x));\n return res;\n}\n\n\n// x / y以上の最小の整数\nll ceil_div(ll x, ll y) {\n assert(y > 0);\n return (x + (x > 0 ? y - 1 : 0)) / y;\n}\n\n// x / y以下の最大の整数\nll floor_div(ll x, ll y) {\n assert(y > 0);\n return (x + (x > 0 ? 0 : -y + 1)) / y;\n}\n\nvoid io_init() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n}\n\n\n\n#include <limits>\n\ntemplate<typename T>\nstruct add_min_function{\n using F = add_min_function<T>;\n T add, upper;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n add_min_function(): add(0), upper(inf){}\n add_min_function(T _add, T _upper): add(_add), upper(_upper){}\n // g(f(x))\n static F merge(const F &f, const F &g){return {f.add + g.add, std::min(g.upper, f.upper + g.add)};}\n T fx(T x){return std::min(x + add, upper);}\n bool operator == (const F &r)const{return add == r.add && upper == r.upper;}\n};\n\n// f(x) = min(max(x + a, b), c)\ntemplate<typename T>\nstruct clamp_function{\n T add, lower, upper;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\n clamp_function(): add(0), lower(minf), upper(inf){}\n clamp_function(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper){lower = std::min(_lower, _upper);}\n // g(f(x))\n static clamp_function<T> merge(const clamp_function<T> &f, const clamp_function<T> &g){\n return {f.add + g.add, std::max(g.lower, std::min(f.upper, f.lower) + g.add), std::min(g.upper, std::max(g.lower, f.upper + g.add))};\n }\n T fx(T x){\n return std::min(std::max(x + add, lower), upper);\n }\n bool operator == (const clamp_function<T> &r)const{return add == r.add && lower == r.lower && upper == r.upper;}\n};\n// f(x) = min(max(x + a, b), c)\n// min部分によって減少した値をスコアとする\ntemplate<typename T, typename Tsum>\nstruct clamp_function_score{\npublic:\n T add, lower, upper, score_upper;\n Tsum score_sum;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\n clamp_function_score(): add(0), lower(minf), upper(inf), score_upper(inf), score_sum(0){}\n clamp_function_score(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper), score_upper(_upper), score_sum(0){lower = std::min(_lower, _upper);}\nprivate:\n clamp_function_score(T _add, T _lower, T _upper, T _supper, Tsum _ssum): add(_add), lower(_lower), upper(_upper), score_upper(_supper), score_sum(_ssum){}\npublic:\n // g(f(x))\n static clamp_function_score<T, Tsum> merge(const clamp_function_score<T, Tsum> &f, const clamp_function_score<T, Tsum> &g){\n T _add = f.add + g.add;\n T _lower = std::max(g.lower, std::min(f.upper, f.lower) + g.add);\n T _upper = std::min(g.upper, std::max(g.lower, f.upper + g.add));\n _lower = std::min(_lower, _upper);\n Tsum _ssum = f.score_sum + g.score_sum;\n if(f.lower == f.upper){\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\n return {_add, _lower, _upper, f.score_upper + g.add, _ssum};\n }else if(f.lower + g.add >= g.score_upper){\n assert(_lower == _upper);\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\n return {_add, _lower, _upper, f.lower + g.add, _ssum};\n }else{\n return {_add, _lower, _upper, std::min(f.score_upper + g.add, g.score_upper), _ssum};\n }\n }\n T fx(T x){\n return std::min(std::max(x + add, lower), upper);\n }\n Tsum fx_score(T x){\n return score_sum + std::max((T)0, x + add - score_upper);\n }\n bool operator == (const clamp_function_score<T, Tsum> &r)const{return add == r.add && lower == r.lower && upper == r.upper && score_upper == r.score_upper && score_sum == r.score_sum;}\n};\n\n\n\ntemplate<typename T>\nstruct prefixsum_min{\n T sum, pmin;\n static prefixsum_min<T> id(){\n return {0, std::numeric_limits<T>::max() / 2};\n }\n static prefixsum_min<T> merge(prefixsum_min<T> a, prefixsum_min<T> b){\n if(b.pmin == std::numeric_limits<T>::max() / 2) return a;\n return {a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin)};\n }\n};\ntemplate<typename T>\nstruct prefixsum_max{\n T sum, pmax;\n static prefixsum_max<T> id(){\n return {0, std::numeric_limits<T>::min() / 2};\n }\n static prefixsum_max<T> merge(prefixsum_max<T> a, prefixsum_max<T> b){\n if(b.pmax == std::numeric_limits<T>::min() / 2) return a;\n return {a.sum + b.sum, std::max(a.pmax, a.sum + b.pmax)};\n }\n};\ntemplate<typename T>\nstruct suffixsum_min{\n T sum, smin;\n static suffixsum_min<T> id(){\n return {0, std::numeric_limits<T>::max() / 2};\n }\n static suffixsum_min<T> merge(suffixsum_min<T> a, suffixsum_min<T> b){\n if(a.smin == std::numeric_limits<T>::max() / 2) return b;\n return {a.sum + b.sum, std::min(b.smin, b.sum + a.smin)};\n }\n};\ntemplate<typename T>\nstruct suffixsum_max{\n T sum, smax;\n static suffixsum_max<T> id(){\n return {0, std::numeric_limits<T>::min() / 2};\n }\n static suffixsum_max<T> merge(suffixsum_max<T> a, suffixsum_max<T> b){\n if(a.smax == std::numeric_limits<T>::min() / 2) return b;\n return {a.sum + b.sum, std::max(b.smax, b.sum + a.smax)};\n }\n};\ntemplate<typename T>\nstruct substringsum_max{\n T sum, pmax, smax, ssmax; // {区間全体のsum, prefixsumのmax, suffixsumのmax, substringsumのmax}\n static substringsum_max<T> id(){\n return {0, std::numeric_limits<T>::min(), 0, 0};\n }\n static substringsum_max<T> merge(substringsum_max<T> a, substringsum_max<T> b){\n if(b.pmax == std::numeric_limits<T>::min()) return a;\n if(a.pmax == std::numeric_limits<T>::min()) return b;\n T sum = a.sum + b.sum;\n T pmax = std::max(a.pmax, a.sum + b.pmax);\n T smax = std::max(a.smax + b.sum, b.smax);\n return {sum, pmax, smax, std::max({a.ssmax, b.ssmax, pmax, smax})};\n }\n};\n// 01列の0を-1として扱う\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax\nstruct excess_value{\npublic:\n int rank, sum, pmin, pmax;\n static constexpr int inf = 1 << 30;\n excess_value(): rank(inf), pmin(inf), pmax(-inf){}\n excess_value(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum){}\nprivate:\n excess_value(int a, int b, int c, int d): rank(a), sum(b), pmin(c), pmax(d){}\npublic:\n static excess_value merge(excess_value a, excess_value b){\n if(a.rank == inf) return b;\n if(b.rank == inf) return a;\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), std::max(a.pmax, a.sum + b.pmax)};\n }\n};\n// 01列の0を-1として扱う\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax, 接尾辞のmin, 接尾辞のmax\nstruct excess_value2{\npublic:\n int rank, sum, pmin, pmax, smin, smax;\n static constexpr int inf = 1 << 30;\n excess_value2(): rank(inf), pmin(inf), pmax(-inf), smin(inf), smax(-inf){}\n excess_value2(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum), smin(sum), smax(sum){}\nprivate:\n excess_value2(int a, int b, int c, int d, int e, int f): rank(a), sum(b), pmin(c), pmax(d), smin(e), smax(f){}\npublic:\n static excess_value2 merge(excess_value2 a, excess_value2 b){\n if(a.rank == inf) return b;\n if(b.rank == inf) return a;\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), \n std::max(a.pmax, a.sum + b.pmax), std::min(a.smin + b.sum, b.smin), std::max(a.smax + b.sum, b.smax)};\n }\n};\n\n\n// https://probablydance.com/2016/12/27/i-wrote-a-faster-sorting-algorithm/\nstruct PartitionInfo\n{\n PartitionInfo()\n : count(0)\n {\n }\n \n union\n {\n size_t count;\n size_t offset;\n };\n size_t next_offset;\n};\n \ntemplate<typename It, typename ExtractKey>\nvoid ska_byte_sort(It begin, It end, ExtractKey & extract_key)\n{\n PartitionInfo partitions[256];\n for (It it = begin; it != end; ++it)\n {\n ++partitions[extract_key(*it)].count;\n }\n uint8_t remaining_partitions[256];\n size_t total = 0;\n int num_partitions = 0;\n for (int i = 0; i < 256; ++i)\n {\n size_t count = partitions[i].count;\n if (count)\n {\n partitions[i].offset = total;\n total += count;\n remaining_partitions[num_partitions] = i;\n ++num_partitions;\n }\n partitions[i].next_offset = total;\n }\n for (uint8_t * last_remaining = remaining_partitions + num_partitions, * end_partition = remaining_partitions + 1; last_remaining > end_partition;)\n {\n last_remaining = custom_std_partition(remaining_partitions, last_remaining, [&](uint8_t partition)\n {\n size_t & begin_offset = partitions[partition].offset;\n size_t & end_offset = partitions[partition].next_offset;\n if (begin_offset == end_offset)\n return false;\n \n unroll_loop_four_times(begin + begin_offset, end_offset - begin_offset, [partitions = partitions, begin, &extract_key](It it)\n {\n uint8_t this_partition = extract_key(*it);\n size_t offset = partitions[this_partition].offset++;\n std::iter_swap(it, begin + offset);\n });\n return begin_offset != end_offset;\n });\n }\n}\n\ntemplate<typename T>\nstruct range_add_chmin_chmax_range_freq {\n private:\n static constexpr T inf = std::numeric_limits<T>::max();\n static constexpr T minf = std::numeric_limits<T>::min();\n using F = clamp_function<T>;\n int N;\n std::vector<T> V, B;\n std::vector<F> lz;\n std::vector<bool> is_sorted;\n static constexpr int sq = 128;\n \n public:\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V), lz((N + sq - 1) / sq, F()), is_sorted((N + sq - 1) / sq, true) {\n B = V;\n for (int i = 0; i < (N + sq - 1) / sq; i++) {\n int L = i * sq;\n int R = std::min(L + sq, N);\n std::sort(B.begin() + L, B.begin() + R);\n }\n }\n\n // [l, r)の x <- min(max(x + add, lower), upper)\n void apply(int l, int r, T add, T lower, T upper) {\n assert(l <= r && lower <= upper);\n int lb = (l + sq - 1) / sq, rb = r / sq;\n F f{add, lower, upper};\n if (l < lb * sq) is_sorted[lb - 1] = false;\n if (rb * sq < r) is_sorted[rb] = false;\n if (lb > rb) {\n int L = rb * sq, R = std::min(N, L + sq);\n for (int i = L; i < R; i++) {\n V[i] = lz[rb].fx(V[i]);\n if (l <= i && i < r) V[i] = f.fx(V[i]);\n }\n lz[rb] = F{};\n return;\n }\n if (l < lb * sq) {\n int L = (lb - 1) * sq, R = std::min(N, L + sq);\n for (int i = L; i < l; i++) {\n V[i] = lz[lb - 1].fx(V[i]);\n }\n for (int i = l; i < R; i++) {\n V[i] = f.fx(lz[lb - 1].fx(V[i]));\n }\n lz[lb - 1] = F{};\n }\n if (rb * sq < r) {\n int L = rb * sq, R = std::min(N, L + sq);\n for (int i = L; i < r; i++) {\n V[i] = f.fx(lz[rb].fx(V[i]));\n }\n for (int i = r; i < R; i++) {\n V[i] = lz[rb].fx(V[i]);\n }\n lz[rb] = F{};\n }\n for (int i = lb; i < rb; i++) {\n lz[i] = F::merge(lz[i], f);\n }\n }\n\n // [l, r)のx以上の最小要素\n T lower_bound(int l, int r, T x) {\n assert(l <= r);\n int lb = (l + sq - 1) / sq, rb = r / sq;\n T res = inf;\n if (lb > rb) {\n for (int i = l; i < r; i++) {\n T y = lz[rb].fx(V[i]);\n if (y >= x) res = std::min(res, y);\n }\n return res;\n }\n for (int i = l; i < lb * sq; i++) {\n T y = lz[lb - 1].fx(V[i]);\n if (y >= x) res = std::min(res, y);\n }\n for (int i = rb * sq; i < r; i++) {\n T y = lz[rb].fx(V[i]);\n if (y >= x) res = std::min(res, y);\n }\n for (int i = lb; i < rb; i++) {\n if (lz[i].upper < x) continue;\n int L = i * sq, R = std::min(N, L + sq);\n if (!is_sorted[i]) {\n for (int j = L; j < R; j++) B[j] = V[j];\n std::sort(B.begin() + L, B.begin() + R);\n is_sorted[i] = true;\n }\n auto itr = std::lower_bound(B.begin() + L, B.begin() + R, x - lz[i].add);\n if (lz[i].lower >= x && itr != B.begin() + L) {\n res = std::min(res, lz[i].lower);\n }\n if (itr != B.begin() + R) {\n res = std::min(res, lz[i].fx(*itr));\n }\n }\n return res;\n }\n\n // [l, r)のrx未満の要素数\n int range_freq(int l, int r, T rx) {\n assert(l <= r);\n int lb = (l + sq - 1) / sq, rb = r / sq;\n int res = 0;\n if (lb > rb) {\n for (int i = l; i < r; i++) {\n T y = lz[rb].fx(V[i]);\n if (y < rx) res++;\n }\n return res;\n }\n for (int i = l; i < lb * sq; i++) {\n T y = lz[lb - 1].fx(V[i]);\n if (y < rx) res++;\n }\n for (int i = rb * sq; i < r; i++) {\n T y = lz[rb].fx(V[i]);\n if (y < rx) res++;\n }\n for (int i = lb; i < rb; i++) {\n if (lz[i].lower >= rx) continue;\n int L = i * sq, R = std::min(N, L + sq);\n if (lz[i].upper < rx) {\n res += R - L;\n continue;\n }\n if (!is_sorted[i]) {\n for (int j = L; j < R; j++) B[j] = V[j];\n std::sort(B.begin() + L, B.begin() + R);\n is_sorted[i] = true;\n }\n res += std::lower_bound(B.begin() + L, B.begin() + R, rx - lz[i].add) - (B.begin() + L);\n }\n return res;\n }\n};\n\nint main() {\n io_init();\n int N, Q;\n std::cin >> N >> Q;\n auto A = read_vec<ll>(N);\n range_add_chmin_chmax_range_freq<ll> F(A);\n\n static constexpr ll inf = 1LL << 60, minf = -inf;\n for (int i = 0; i < Q; i++) {\n int t, l, r;\n ll x;\n std::cin >> t >> l >> r >> x;\n l--;\n if (t == 1) {\n F.apply(l, r, 0, minf, x);\n } else if (t == 2) {\n F.apply(l, r, 0, x, inf);\n } else if (t == 3) {\n F.apply(l, r, x, minf, inf);\n } else {\n ll y;\n std::cin >> y;\n ll ans = F.range_freq(l, r, y + 1) - F.range_freq(l, r, x);\n std::cout << ans << '\\n';\n }\n }\n}","accuracy":1,"time_ms":1010,"memory_kb":5468,"score_of_the_acc":-0.7467,"final_rank":6},{"submission_id":"aoj_3170_9983676","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <array>\n#include <tuple>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <cassert>\n#include <climits>\n#include <iomanip>\n#include <numeric>\n#include <memory>\n#include <random>\n#include <thread>\n#include <chrono>\n#define allof(obj) (obj).begin(), (obj).end()\n#define range(i, l, r) for(int i=l;i<r;i++)\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\n#define bit_kth(i, k) ((i >> k)&1)\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\nusing ll = long long;\nusing ld = long double;\nusing ul = uint64_t;\nusing pi = std::pair<int, int>;\nusing pl = std::pair<ll, ll>;\nusing namespace std;\n\ntemplate<typename F, typename S>\nstd::ostream &operator << (std::ostream &dest, const std::pair<F, S> &p) {\n dest << p.first << ' ' << p.second;\n return dest;\n}\n\ntemplate<typename A, typename B>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t);\n return dest;\n}\n\ntemplate<typename A, typename B, typename C>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t);\n return dest;\n}\n\ntemplate<typename A, typename B, typename C, typename D>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C, D> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t) << ' ' << std::get<3>(t);\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::vector<std::vector<T>> &v) {\n int sz = v.size();\n if (!sz) return dest;\n for (int i = 0; i < sz; i++) {\n int m = v[i].size();\n for (int j = 0; j < m; j++) dest << v[i][j] << (i != sz - 1 && j == m - 1 ? '\\n' : ' ');\n }\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::vector<T> &v) {\n int sz = v.size();\n if (!sz) return dest;\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\n dest << v[sz - 1];\n return dest;\n}\n\ntemplate<typename T, size_t sz>\nstd::ostream &operator << (std::ostream &dest, const std::array<T, sz> &v) {\n if (!sz) return dest;\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\n dest << v[sz - 1];\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::set<T> &v) {\n for (auto itr = v.begin(); itr != v.end();) {\n dest << *itr;\n itr++;\n if (itr != v.end()) dest << ' ';\n }\n return dest;\n}\n\ntemplate<typename T, typename E>\nstd::ostream &operator << (std::ostream &dest, const std::map<T, E> &v) {\n for (auto itr = v.begin(); itr != v.end(); ) {\n dest << '(' << itr->first << \", \" << itr->second << ')';\n itr++;\n if (itr != v.end()) dest << '\\n';\n }\n return dest;\n}\n\ntemplate<typename T>\nstd::vector<T> make_vec(size_t sz, T val) { return std::vector<T>(sz, val); }\n\ntemplate<typename T, typename... Tail>\nauto make_vec(size_t sz, Tail ...tail) {\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\n}\n\ntemplate<typename T>\nstd::vector<T> read_vec(size_t sz) {\n std::vector<T> v(sz);\n for (int i = 0; i < (int)sz; i++) std::cin >> v[i];\n return v;\n}\n\ntemplate<typename T, typename... Tail>\nauto read_vec(size_t sz, Tail ...tail) {\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\n for (int i = 0; i < (int)sz; i++) v[i] = read_vec<T>(tail...);\n return v;\n}\n\ntemplate<typename T, size_t size>\nauto make_array(T x) { \n std::array<T, size> res;\n res.fill(x);\n return res;\n}\n\ntemplate<typename T, size_t size, size_t size2, size_t... Tail>\nauto make_array(T x) {\n std::array<decltype(make_array<T, size2, Tail...>(x)), size> res;\n res.fill(make_array<T, size2, Tail...>(x));\n return res;\n}\n\n\n// x / y以上の最小の整数\nll ceil_div(ll x, ll y) {\n assert(y > 0);\n return (x + (x > 0 ? y - 1 : 0)) / y;\n}\n\n// x / y以下の最大の整数\nll floor_div(ll x, ll y) {\n assert(y > 0);\n return (x + (x > 0 ? 0 : -y + 1)) / y;\n}\n\nvoid io_init() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n}\n\n\n\n#include <limits>\n\ntemplate<typename T>\nstruct add_min_function{\n using F = add_min_function<T>;\n T add, upper;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n add_min_function(): add(0), upper(inf){}\n add_min_function(T _add, T _upper): add(_add), upper(_upper){}\n // g(f(x))\n static F merge(const F &f, const F &g){return {f.add + g.add, std::min(g.upper, f.upper + g.add)};}\n T fx(T x){return std::min(x + add, upper);}\n bool operator == (const F &r)const{return add == r.add && upper == r.upper;}\n};\n\n// f(x) = min(max(x + a, b), c)\ntemplate<typename T>\nstruct clamp_function{\n T add, lower, upper;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\n clamp_function(): add(0), lower(minf), upper(inf){}\n clamp_function(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper){lower = std::min(_lower, _upper);}\n // g(f(x))\n static clamp_function<T> merge(const clamp_function<T> &f, const clamp_function<T> &g){\n return {f.add + g.add, std::max(g.lower, std::min(f.upper, f.lower) + g.add), std::min(g.upper, std::max(g.lower, f.upper + g.add))};\n }\n T fx(T x){\n return std::min(std::max(x + add, lower), upper);\n }\n bool operator == (const clamp_function<T> &r)const{return add == r.add && lower == r.lower && upper == r.upper;}\n};\n// f(x) = min(max(x + a, b), c)\n// min部分によって減少した値をスコアとする\ntemplate<typename T, typename Tsum>\nstruct clamp_function_score{\npublic:\n T add, lower, upper, score_upper;\n Tsum score_sum;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\n clamp_function_score(): add(0), lower(minf), upper(inf), score_upper(inf), score_sum(0){}\n clamp_function_score(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper), score_upper(_upper), score_sum(0){lower = std::min(_lower, _upper);}\nprivate:\n clamp_function_score(T _add, T _lower, T _upper, T _supper, Tsum _ssum): add(_add), lower(_lower), upper(_upper), score_upper(_supper), score_sum(_ssum){}\npublic:\n // g(f(x))\n static clamp_function_score<T, Tsum> merge(const clamp_function_score<T, Tsum> &f, const clamp_function_score<T, Tsum> &g){\n T _add = f.add + g.add;\n T _lower = std::max(g.lower, std::min(f.upper, f.lower) + g.add);\n T _upper = std::min(g.upper, std::max(g.lower, f.upper + g.add));\n _lower = std::min(_lower, _upper);\n Tsum _ssum = f.score_sum + g.score_sum;\n if(f.lower == f.upper){\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\n return {_add, _lower, _upper, f.score_upper + g.add, _ssum};\n }else if(f.lower + g.add >= g.score_upper){\n assert(_lower == _upper);\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\n return {_add, _lower, _upper, f.lower + g.add, _ssum};\n }else{\n return {_add, _lower, _upper, std::min(f.score_upper + g.add, g.score_upper), _ssum};\n }\n }\n T fx(T x){\n return std::min(std::max(x + add, lower), upper);\n }\n Tsum fx_score(T x){\n return score_sum + std::max((T)0, x + add - score_upper);\n }\n bool operator == (const clamp_function_score<T, Tsum> &r)const{return add == r.add && lower == r.lower && upper == r.upper && score_upper == r.score_upper && score_sum == r.score_sum;}\n};\n\n\n\ntemplate<typename T>\nstruct prefixsum_min{\n T sum, pmin;\n static prefixsum_min<T> id(){\n return {0, std::numeric_limits<T>::max() / 2};\n }\n static prefixsum_min<T> merge(prefixsum_min<T> a, prefixsum_min<T> b){\n if(b.pmin == std::numeric_limits<T>::max() / 2) return a;\n return {a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin)};\n }\n};\ntemplate<typename T>\nstruct prefixsum_max{\n T sum, pmax;\n static prefixsum_max<T> id(){\n return {0, std::numeric_limits<T>::min() / 2};\n }\n static prefixsum_max<T> merge(prefixsum_max<T> a, prefixsum_max<T> b){\n if(b.pmax == std::numeric_limits<T>::min() / 2) return a;\n return {a.sum + b.sum, std::max(a.pmax, a.sum + b.pmax)};\n }\n};\ntemplate<typename T>\nstruct suffixsum_min{\n T sum, smin;\n static suffixsum_min<T> id(){\n return {0, std::numeric_limits<T>::max() / 2};\n }\n static suffixsum_min<T> merge(suffixsum_min<T> a, suffixsum_min<T> b){\n if(a.smin == std::numeric_limits<T>::max() / 2) return b;\n return {a.sum + b.sum, std::min(b.smin, b.sum + a.smin)};\n }\n};\ntemplate<typename T>\nstruct suffixsum_max{\n T sum, smax;\n static suffixsum_max<T> id(){\n return {0, std::numeric_limits<T>::min() / 2};\n }\n static suffixsum_max<T> merge(suffixsum_max<T> a, suffixsum_max<T> b){\n if(a.smax == std::numeric_limits<T>::min() / 2) return b;\n return {a.sum + b.sum, std::max(b.smax, b.sum + a.smax)};\n }\n};\ntemplate<typename T>\nstruct substringsum_max{\n T sum, pmax, smax, ssmax; // {区間全体のsum, prefixsumのmax, suffixsumのmax, substringsumのmax}\n static substringsum_max<T> id(){\n return {0, std::numeric_limits<T>::min(), 0, 0};\n }\n static substringsum_max<T> merge(substringsum_max<T> a, substringsum_max<T> b){\n if(b.pmax == std::numeric_limits<T>::min()) return a;\n if(a.pmax == std::numeric_limits<T>::min()) return b;\n T sum = a.sum + b.sum;\n T pmax = std::max(a.pmax, a.sum + b.pmax);\n T smax = std::max(a.smax + b.sum, b.smax);\n return {sum, pmax, smax, std::max({a.ssmax, b.ssmax, pmax, smax})};\n }\n};\n// 01列の0を-1として扱う\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax\nstruct excess_value{\npublic:\n int rank, sum, pmin, pmax;\n static constexpr int inf = 1 << 30;\n excess_value(): rank(inf), pmin(inf), pmax(-inf){}\n excess_value(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum){}\nprivate:\n excess_value(int a, int b, int c, int d): rank(a), sum(b), pmin(c), pmax(d){}\npublic:\n static excess_value merge(excess_value a, excess_value b){\n if(a.rank == inf) return b;\n if(b.rank == inf) return a;\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), std::max(a.pmax, a.sum + b.pmax)};\n }\n};\n// 01列の0を-1として扱う\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax, 接尾辞のmin, 接尾辞のmax\nstruct excess_value2{\npublic:\n int rank, sum, pmin, pmax, smin, smax;\n static constexpr int inf = 1 << 30;\n excess_value2(): rank(inf), pmin(inf), pmax(-inf), smin(inf), smax(-inf){}\n excess_value2(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum), smin(sum), smax(sum){}\nprivate:\n excess_value2(int a, int b, int c, int d, int e, int f): rank(a), sum(b), pmin(c), pmax(d), smin(e), smax(f){}\npublic:\n static excess_value2 merge(excess_value2 a, excess_value2 b){\n if(a.rank == inf) return b;\n if(b.rank == inf) return a;\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), \n std::max(a.pmax, a.sum + b.pmax), std::min(a.smin + b.sum, b.smin), std::max(a.smax + b.sum, b.smax)};\n }\n};\n\n\ntemplate<typename T>\nstruct range_add_chmin_chmax_range_freq {\n private:\n static constexpr T inf = std::numeric_limits<T>::max();\n static constexpr T minf = std::numeric_limits<T>::min();\n using F = clamp_function<T>;\n int N;\n std::vector<T> V, B;\n std::vector<F> lz;\n std::vector<bool> is_sorted;\n static constexpr int sq = 256;\n \n public:\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V), lz((N + sq - 1) / sq, F()), is_sorted((N + sq - 1) / sq, true) {\n B = V;\n for (int i = 0; i < (N + sq - 1) / sq; i++) {\n int L = i * sq;\n int R = std::min(L + sq, N);\n std::sort(B.begin() + L, B.begin() + R);\n }\n }\n\n // [l, r)の x <- min(max(x + add, lower), upper)\n void apply(int l, int r, T add, T lower, T upper) {\n assert(l <= r && lower <= upper);\n int lb = (l + sq - 1) / sq, rb = r / sq;\n F f{add, lower, upper};\n if (l < lb * sq) is_sorted[lb - 1] = false;\n if (rb * sq < r) is_sorted[rb] = false;\n if (lb > rb) {\n int L = rb * sq, R = std::min(N, L + sq);\n for (int i = L; i < R; i++) {\n V[i] = lz[rb].fx(V[i]);\n if (l <= i && i < r) V[i] = f.fx(V[i]);\n }\n lz[rb] = F{};\n return;\n }\n if (l < lb * sq) {\n int L = (lb - 1) * sq, R = std::min(N, L + sq);\n for (int i = L; i < l; i++) {\n V[i] = lz[lb - 1].fx(V[i]);\n }\n for (int i = l; i < R; i++) {\n V[i] = f.fx(lz[lb - 1].fx(V[i]));\n }\n lz[lb - 1] = F{};\n }\n if (rb * sq < r) {\n int L = rb * sq, R = std::min(N, L + sq);\n for (int i = L; i < r; i++) {\n V[i] = f.fx(lz[rb].fx(V[i]));\n }\n for (int i = r; i < R; i++) {\n V[i] = lz[rb].fx(V[i]);\n }\n lz[rb] = F{};\n }\n for (int i = lb; i < rb; i++) {\n lz[i] = F::merge(lz[i], f);\n }\n }\n\n /*\n // [l, r)のx以上の最小要素\n T lower_bound(int l, int r, T x) {\n assert(l <= r);\n int lb = (l + sq - 1) / sq, rb = r / sq;\n T res = inf;\n if (lb >= rb) {\n for (int i = l; i < r; i++) {\n if (V[i] >= x) res = std::min(res, V[i]);\n }\n return res;\n }\n //\n return res;\n }\n */\n\n // [l, r)のrx未満の要素数\n int range_freq(int l, int r, T rx) {\n assert(l <= r);\n int lb = (l + sq - 1) / sq, rb = r / sq;\n int res = 0;\n if (lb > rb) {\n for (int i = l; i < r; i++) {\n T y = lz[rb].fx(V[i]);\n if (y < rx) res++;\n }\n return res;\n }\n for (int i = l; i < lb * sq; i++) {\n T y = lz[lb - 1].fx(V[i]);\n if (y < rx) res++;\n }\n for (int i = rb * sq; i < r; i++) {\n T y = lz[rb].fx(V[i]);\n if (y < rx) res++;\n }\n for (int i = lb; i < rb; i++) {\n if (lz[i].lower >= rx) continue;\n int L = i * sq, R = std::min(N, L + sq);\n if (lz[i].upper < rx) {\n res += R - L;\n continue;\n }\n if (!is_sorted[i]) {\n for (int j = L; j < R; j++) B[j] = V[j];\n std::sort(B.begin() + L, B.begin() + R);\n is_sorted[i] = true;\n }\n res += std::lower_bound(B.begin() + L, B.begin() + R, rx - lz[i].add) - (B.begin() + L);\n }\n return res;\n }\n /*\n\n // [l, r)のrx未満の要素の和\n T range_freq_sum(int l, int r, T rx) {\n assert(l <= r);\n int lb = (l + sq - 1) / sq, rb = r / sq;\n T res = 0;\n if (lb >= rb) {\n for (int i = l; i < r; i++) {\n if (V[i] < rx) res += V[i];\n }\n return res;\n }\n //\n return res;\n }\n */\n};\n\nint main() {\n io_init();\n int N, Q;\n std::cin >> N >> Q;\n auto A = read_vec<ll>(N);\n range_add_chmin_chmax_range_freq<ll> F(A);\n\n static constexpr ll inf = 1LL << 60, minf = -inf;\n for (int i = 0; i < Q; i++) {\n int t, l, r;\n ll x;\n std::cin >> t >> l >> r >> x;\n l--;\n if (t == 1) {\n F.apply(l, r, 0, minf, x);\n } else if (t == 2) {\n F.apply(l, r, 0, x, inf);\n } else if (t == 3) {\n F.apply(l, r, x, minf, inf);\n } else {\n ll y;\n std::cin >> y;\n ll ans = F.range_freq(l, r, y + 1) - F.range_freq(l, r, x);\n std::cout << ans << '\\n';\n }\n }\n}","accuracy":1,"time_ms":1080,"memory_kb":5464,"score_of_the_acc":-0.7917,"final_rank":7},{"submission_id":"aoj_3170_9983653","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <array>\n#include <tuple>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <cassert>\n#include <climits>\n#include <iomanip>\n#include <numeric>\n#include <memory>\n#include <random>\n#include <thread>\n#include <chrono>\n#define allof(obj) (obj).begin(), (obj).end()\n#define range(i, l, r) for(int i=l;i<r;i++)\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\n#define bit_kth(i, k) ((i >> k)&1)\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\nusing ll = long long;\nusing ld = long double;\nusing ul = uint64_t;\nusing pi = std::pair<int, int>;\nusing pl = std::pair<ll, ll>;\nusing namespace std;\n\ntemplate<typename F, typename S>\nstd::ostream &operator << (std::ostream &dest, const std::pair<F, S> &p) {\n dest << p.first << ' ' << p.second;\n return dest;\n}\n\ntemplate<typename A, typename B>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t);\n return dest;\n}\n\ntemplate<typename A, typename B, typename C>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t);\n return dest;\n}\n\ntemplate<typename A, typename B, typename C, typename D>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C, D> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t) << ' ' << std::get<3>(t);\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::vector<std::vector<T>> &v) {\n int sz = v.size();\n if (!sz) return dest;\n for (int i = 0; i < sz; i++) {\n int m = v[i].size();\n for (int j = 0; j < m; j++) dest << v[i][j] << (i != sz - 1 && j == m - 1 ? '\\n' : ' ');\n }\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::vector<T> &v) {\n int sz = v.size();\n if (!sz) return dest;\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\n dest << v[sz - 1];\n return dest;\n}\n\ntemplate<typename T, size_t sz>\nstd::ostream &operator << (std::ostream &dest, const std::array<T, sz> &v) {\n if (!sz) return dest;\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\n dest << v[sz - 1];\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::set<T> &v) {\n for (auto itr = v.begin(); itr != v.end();) {\n dest << *itr;\n itr++;\n if (itr != v.end()) dest << ' ';\n }\n return dest;\n}\n\ntemplate<typename T, typename E>\nstd::ostream &operator << (std::ostream &dest, const std::map<T, E> &v) {\n for (auto itr = v.begin(); itr != v.end(); ) {\n dest << '(' << itr->first << \", \" << itr->second << ')';\n itr++;\n if (itr != v.end()) dest << '\\n';\n }\n return dest;\n}\n\ntemplate<typename T>\nstd::vector<T> make_vec(size_t sz, T val) { return std::vector<T>(sz, val); }\n\ntemplate<typename T, typename... Tail>\nauto make_vec(size_t sz, Tail ...tail) {\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\n}\n\ntemplate<typename T>\nstd::vector<T> read_vec(size_t sz) {\n std::vector<T> v(sz);\n for (int i = 0; i < (int)sz; i++) std::cin >> v[i];\n return v;\n}\n\ntemplate<typename T, typename... Tail>\nauto read_vec(size_t sz, Tail ...tail) {\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\n for (int i = 0; i < (int)sz; i++) v[i] = read_vec<T>(tail...);\n return v;\n}\n\ntemplate<typename T, size_t size>\nauto make_array(T x) { \n std::array<T, size> res;\n res.fill(x);\n return res;\n}\n\ntemplate<typename T, size_t size, size_t size2, size_t... Tail>\nauto make_array(T x) {\n std::array<decltype(make_array<T, size2, Tail...>(x)), size> res;\n res.fill(make_array<T, size2, Tail...>(x));\n return res;\n}\n\n\n// x / y以上の最小の整数\nll ceil_div(ll x, ll y) {\n assert(y > 0);\n return (x + (x > 0 ? y - 1 : 0)) / y;\n}\n\n// x / y以下の最大の整数\nll floor_div(ll x, ll y) {\n assert(y > 0);\n return (x + (x > 0 ? 0 : -y + 1)) / y;\n}\n\nvoid io_init() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n}\n\n\n\n#include <limits>\n\ntemplate<typename T>\nstruct add_min_function{\n using F = add_min_function<T>;\n T add, upper;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n add_min_function(): add(0), upper(inf){}\n add_min_function(T _add, T _upper): add(_add), upper(_upper){}\n // g(f(x))\n static F merge(const F &f, const F &g){return {f.add + g.add, std::min(g.upper, f.upper + g.add)};}\n T fx(T x){return std::min(x + add, upper);}\n bool operator == (const F &r)const{return add == r.add && upper == r.upper;}\n};\n\n// f(x) = min(max(x + a, b), c)\ntemplate<typename T>\nstruct clamp_function{\n T add, lower, upper;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\n clamp_function(): add(0), lower(minf), upper(inf){}\n clamp_function(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper){lower = std::min(_lower, _upper);}\n // g(f(x))\n static clamp_function<T> merge(const clamp_function<T> &f, const clamp_function<T> &g){\n return {f.add + g.add, std::max(g.lower, std::min(f.upper, f.lower) + g.add), std::min(g.upper, std::max(g.lower, f.upper + g.add))};\n }\n T fx(T x){\n return std::min(std::max(x + add, lower), upper);\n }\n bool operator == (const clamp_function<T> &r)const{return add == r.add && lower == r.lower && upper == r.upper;}\n};\n// f(x) = min(max(x + a, b), c)\n// min部分によって減少した値をスコアとする\ntemplate<typename T, typename Tsum>\nstruct clamp_function_score{\npublic:\n T add, lower, upper, score_upper;\n Tsum score_sum;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\n clamp_function_score(): add(0), lower(minf), upper(inf), score_upper(inf), score_sum(0){}\n clamp_function_score(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper), score_upper(_upper), score_sum(0){lower = std::min(_lower, _upper);}\nprivate:\n clamp_function_score(T _add, T _lower, T _upper, T _supper, Tsum _ssum): add(_add), lower(_lower), upper(_upper), score_upper(_supper), score_sum(_ssum){}\npublic:\n // g(f(x))\n static clamp_function_score<T, Tsum> merge(const clamp_function_score<T, Tsum> &f, const clamp_function_score<T, Tsum> &g){\n T _add = f.add + g.add;\n T _lower = std::max(g.lower, std::min(f.upper, f.lower) + g.add);\n T _upper = std::min(g.upper, std::max(g.lower, f.upper + g.add));\n _lower = std::min(_lower, _upper);\n Tsum _ssum = f.score_sum + g.score_sum;\n if(f.lower == f.upper){\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\n return {_add, _lower, _upper, f.score_upper + g.add, _ssum};\n }else if(f.lower + g.add >= g.score_upper){\n assert(_lower == _upper);\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\n return {_add, _lower, _upper, f.lower + g.add, _ssum};\n }else{\n return {_add, _lower, _upper, std::min(f.score_upper + g.add, g.score_upper), _ssum};\n }\n }\n T fx(T x){\n return std::min(std::max(x + add, lower), upper);\n }\n Tsum fx_score(T x){\n return score_sum + std::max((T)0, x + add - score_upper);\n }\n bool operator == (const clamp_function_score<T, Tsum> &r)const{return add == r.add && lower == r.lower && upper == r.upper && score_upper == r.score_upper && score_sum == r.score_sum;}\n};\n\n\n\ntemplate<typename T>\nstruct prefixsum_min{\n T sum, pmin;\n static prefixsum_min<T> id(){\n return {0, std::numeric_limits<T>::max() / 2};\n }\n static prefixsum_min<T> merge(prefixsum_min<T> a, prefixsum_min<T> b){\n if(b.pmin == std::numeric_limits<T>::max() / 2) return a;\n return {a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin)};\n }\n};\ntemplate<typename T>\nstruct prefixsum_max{\n T sum, pmax;\n static prefixsum_max<T> id(){\n return {0, std::numeric_limits<T>::min() / 2};\n }\n static prefixsum_max<T> merge(prefixsum_max<T> a, prefixsum_max<T> b){\n if(b.pmax == std::numeric_limits<T>::min() / 2) return a;\n return {a.sum + b.sum, std::max(a.pmax, a.sum + b.pmax)};\n }\n};\ntemplate<typename T>\nstruct suffixsum_min{\n T sum, smin;\n static suffixsum_min<T> id(){\n return {0, std::numeric_limits<T>::max() / 2};\n }\n static suffixsum_min<T> merge(suffixsum_min<T> a, suffixsum_min<T> b){\n if(a.smin == std::numeric_limits<T>::max() / 2) return b;\n return {a.sum + b.sum, std::min(b.smin, b.sum + a.smin)};\n }\n};\ntemplate<typename T>\nstruct suffixsum_max{\n T sum, smax;\n static suffixsum_max<T> id(){\n return {0, std::numeric_limits<T>::min() / 2};\n }\n static suffixsum_max<T> merge(suffixsum_max<T> a, suffixsum_max<T> b){\n if(a.smax == std::numeric_limits<T>::min() / 2) return b;\n return {a.sum + b.sum, std::max(b.smax, b.sum + a.smax)};\n }\n};\ntemplate<typename T>\nstruct substringsum_max{\n T sum, pmax, smax, ssmax; // {区間全体のsum, prefixsumのmax, suffixsumのmax, substringsumのmax}\n static substringsum_max<T> id(){\n return {0, std::numeric_limits<T>::min(), 0, 0};\n }\n static substringsum_max<T> merge(substringsum_max<T> a, substringsum_max<T> b){\n if(b.pmax == std::numeric_limits<T>::min()) return a;\n if(a.pmax == std::numeric_limits<T>::min()) return b;\n T sum = a.sum + b.sum;\n T pmax = std::max(a.pmax, a.sum + b.pmax);\n T smax = std::max(a.smax + b.sum, b.smax);\n return {sum, pmax, smax, std::max({a.ssmax, b.ssmax, pmax, smax})};\n }\n};\n// 01列の0を-1として扱う\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax\nstruct excess_value{\npublic:\n int rank, sum, pmin, pmax;\n static constexpr int inf = 1 << 30;\n excess_value(): rank(inf), pmin(inf), pmax(-inf){}\n excess_value(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum){}\nprivate:\n excess_value(int a, int b, int c, int d): rank(a), sum(b), pmin(c), pmax(d){}\npublic:\n static excess_value merge(excess_value a, excess_value b){\n if(a.rank == inf) return b;\n if(b.rank == inf) return a;\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), std::max(a.pmax, a.sum + b.pmax)};\n }\n};\n// 01列の0を-1として扱う\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax, 接尾辞のmin, 接尾辞のmax\nstruct excess_value2{\npublic:\n int rank, sum, pmin, pmax, smin, smax;\n static constexpr int inf = 1 << 30;\n excess_value2(): rank(inf), pmin(inf), pmax(-inf), smin(inf), smax(-inf){}\n excess_value2(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum), smin(sum), smax(sum){}\nprivate:\n excess_value2(int a, int b, int c, int d, int e, int f): rank(a), sum(b), pmin(c), pmax(d), smin(e), smax(f){}\npublic:\n static excess_value2 merge(excess_value2 a, excess_value2 b){\n if(a.rank == inf) return b;\n if(b.rank == inf) return a;\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), \n std::max(a.pmax, a.sum + b.pmax), std::min(a.smin + b.sum, b.smin), std::max(a.smax + b.sum, b.smax)};\n }\n};\n\n\n/*\ntemplate<typename T>\nstruct range_add_chmin_chmax_range_freq {\n private:\n using F = clamp_function<T>;\n struct query {\n int type, l, r;\n F f;\n };\n int N;\n std::vector<T> V;\n std::vector<query> Qs;\n \n public:\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V) {}\n\n // [l, r)の x <- min(max(x + add, lower), upper)\n void apply(int l, int r, T add, T lower, T upper) {\n assert(lower <= upper);\n Qs.push_back({0, l, r, F{add, lower, upper}});\n }\n\n // [l, r)のx以上の最小要素\n void lower_bound(int l, int r, T x) {\n Qs.push_back({1, l, r, F{x, x, x}});\n }\n\n // [l, r)のrx未満の要素数\n void range_freq(int l, int r, T rx) {\n Qs.push_back({2, l, r, F{rx, rx, rx}});\n }\n\n std::vector<T> solve() {\n int Q = Qs.size(), K = 2 * sqrt(N);\n std::vector<int> Bbegin{0};\n std::vector<F> lz{F{}};\n std::vector<T> B;\n\n auto propagate = [&]() -> void {\n for (int i = 0; i < (int)Bbegin.size(); i++) {\n if (lz[i] == F()) continue;\n int l = Bbegin[i];\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\n for (int j = l; j < r; j++) V[j] = lz[i].fx(V[j]);\n }\n };\n\n auto make_block = [&](int lq, int rq) -> void {\n Bbegin = {0};\n for (int i = lq; i < rq; i++) {\n Bbegin.push_back(Qs[i].l);\n Bbegin.push_back(Qs[i].r);\n }\n std::sort(Bbegin.begin(), Bbegin.end());\n Bbegin.erase(std::unique(Bbegin.begin(), Bbegin.end()), Bbegin.end());\n lz = std::vector<F>(Bbegin.size(), F());\n B = V;\n for (int i = 0; i < Bbegin.size(); i++) {\n int l = Bbegin[i];\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\n std::sort(B.begin() + l, B.begin() + r);\n }\n };\n\n std::vector<T> ans;\n\n for (int i = 0; i < Q; i++) {\n if (i % K == 0) {\n propagate();\n make_block(i, std::min(Q, i + K));\n }\n int l = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].l) - Bbegin.begin();\n int r = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].r) - Bbegin.begin();\n if (Qs[i].type == 0) {\n for (int j = l; j < r; j++) {\n lz[j] = F::merge(lz[j], Qs[i].f);\n }\n } else if (Qs[i].type == 1) {\n T lb = std::numeric_limits<T>::max();\n T x = Qs[i].f.add;\n for (int j = l; j < r; j++) { \n T y = x - lz[j].add;\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\n if (itr != B.begin() + Bbegin[j + 1]) {\n lb = std::min(lb, lz[j].fx(*itr));\n }\n if (itr != B.begin() + Bbegin[j] && lz[j].lower >= x) {\n lb = std::min(lb, lz[j].lower);\n }\n }\n ans.push_back(lb);\n } else if (Qs[i].type == 2) {\n T cnt = 0, rx = Qs[i].f.add;\n for (int j = l; j < r; j++) { \n if (lz[j].lower >= rx) continue;\n if (lz[j].upper < rx) {\n cnt += Bbegin[j + 1] - Bbegin[j];\n continue;\n }\n T y = rx - lz[j].add;\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\n cnt += itr - (B.begin() + Bbegin[j]);\n }\n ans.push_back(cnt);\n }\n }\n return ans;\n }\n};\n*/\n\ntemplate<typename T>\nstruct range_add_chmin_chmax_range_freq {\n private:\n static constexpr T inf = std::numeric_limits<T>::max();\n static constexpr T minf = std::numeric_limits<T>::min();\n using F = clamp_function<T>;\n int N;\n std::vector<T> V, B;\n std::vector<F> lz;\n std::vector<bool> is_sorted;\n static constexpr int sq = 128;\n \n public:\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V), lz((N + sq - 1) / sq, F()), is_sorted((N + sq - 1) / sq, true) {\n B = V;\n for (int i = 0; i < (N + sq - 1) / sq; i++) {\n int L = i * sq;\n int R = std::min(L + sq, N);\n std::sort(B.begin() + L, B.begin() + R);\n }\n }\n\n // [l, r)の x <- min(max(x + add, lower), upper)\n void apply(int l, int r, T add, T lower, T upper) {\n assert(l <= r && lower <= upper);\n int lb = (l + sq - 1) / sq, rb = r / sq;\n F f{add, lower, upper};\n if (l < lb * sq) is_sorted[lb - 1] = false;\n if (rb * sq < r) is_sorted[rb] = false;\n if (lb > rb) {\n int L = rb * sq, R = std::min(N, L + sq);\n for (int i = L; i < R; i++) {\n V[i] = lz[rb].fx(V[i]);\n if (l <= i && i < r) V[i] = f.fx(V[i]);\n }\n lz[rb] = F{};\n return;\n }\n if (l < lb * sq) {\n int L = (lb - 1) * sq, R = std::min(N, L + sq);\n for (int i = L; i < l; i++) {\n V[i] = lz[lb - 1].fx(V[i]);\n }\n for (int i = l; i < R; i++) {\n V[i] = f.fx(lz[lb - 1].fx(V[i]));\n }\n lz[lb - 1] = F{};\n }\n if (rb * sq < r) {\n int L = rb * sq, R = std::min(N, L + sq);\n for (int i = L; i < r; i++) {\n V[i] = f.fx(lz[rb].fx(V[i]));\n }\n for (int i = r; i < R; i++) {\n V[i] = lz[rb].fx(V[i]);\n }\n lz[rb] = F{};\n }\n for (int i = lb; i < rb; i++) {\n lz[i] = F::merge(lz[i], f);\n }\n }\n\n /*\n // [l, r)のx以上の最小要素\n T lower_bound(int l, int r, T x) {\n assert(l <= r);\n int lb = (l + sq - 1) / sq, rb = r / sq;\n T res = inf;\n if (lb >= rb) {\n for (int i = l; i < r; i++) {\n if (V[i] >= x) res = std::min(res, V[i]);\n }\n return res;\n }\n //\n return res;\n }\n */\n\n // [l, r)のrx未満の要素数\n int range_freq(int l, int r, T rx) {\n assert(l <= r);\n int lb = (l + sq - 1) / sq, rb = r / sq;\n int res = 0;\n if (lb > rb) {\n for (int i = l; i < r; i++) {\n T y = lz[rb].fx(V[i]);\n if (y < rx) res++;\n }\n return res;\n }\n for (int i = l; i < lb * sq; i++) {\n T y = lz[lb - 1].fx(V[i]);\n if (y < rx) res++;\n }\n for (int i = rb * sq; i < r; i++) {\n T y = lz[rb].fx(V[i]);\n if (y < rx) res++;\n }\n for (int i = lb; i < rb; i++) {\n if (lz[i].lower >= rx) continue;\n int L = i * sq, R = std::min(N, L + sq);\n if (lz[i].upper < rx) {\n res += R - L;\n continue;\n }\n if (!is_sorted[i]) {\n for (int j = L; j < R; j++) B[j] = V[j];\n std::sort(B.begin() + L, B.begin() + R);\n is_sorted[i] = true;\n }\n res += std::lower_bound(B.begin() + L, B.begin() + R, rx - lz[i].add) - (B.begin() + L);\n }\n return res;\n }\n /*\n\n // [l, r)のrx未満の要素の和\n T range_freq_sum(int l, int r, T rx) {\n assert(l <= r);\n int lb = (l + sq - 1) / sq, rb = r / sq;\n T res = 0;\n if (lb >= rb) {\n for (int i = l; i < r; i++) {\n if (V[i] < rx) res += V[i];\n }\n return res;\n }\n //\n return res;\n }\n */\n};\n\nint main() {\n io_init();\n int N, Q;\n std::cin >> N >> Q;\n auto A = read_vec<ll>(N);\n range_add_chmin_chmax_range_freq<ll> F(A);\n\n static constexpr ll inf = 1LL << 60, minf = -inf;\n for (int i = 0; i < Q; i++) {\n int t, l, r;\n ll x;\n std::cin >> t >> l >> r >> x;\n l--;\n if (t == 1) {\n F.apply(l, r, 0, minf, x);\n } else if (t == 2) {\n F.apply(l, r, 0, x, inf);\n } else if (t == 3) {\n F.apply(l, r, x, minf, inf);\n } else {\n ll y;\n std::cin >> y;\n ll ans = F.range_freq(l, r, y + 1) - F.range_freq(l, r, x);\n std::cout << ans << '\\n';\n }\n }\n}","accuracy":1,"time_ms":1000,"memory_kb":5468,"score_of_the_acc":-0.7402,"final_rank":5},{"submission_id":"aoj_3170_9983016","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <array>\n#include <tuple>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <cassert>\n#include <climits>\n#include <iomanip>\n#include <numeric>\n#include <memory>\n#include <random>\n#include <thread>\n#include <chrono>\n#define allof(obj) (obj).begin(), (obj).end()\n#define range(i, l, r) for(int i=l;i<r;i++)\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\n#define bit_kth(i, k) ((i >> k)&1)\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\nusing ll = long long;\nusing ld = long double;\nusing ul = uint64_t;\nusing pi = std::pair<int, int>;\nusing pl = std::pair<ll, ll>;\nusing namespace std;\n\ntemplate<typename F, typename S>\nstd::ostream &operator << (std::ostream &dest, const std::pair<F, S> &p) {\n dest << p.first << ' ' << p.second;\n return dest;\n}\n\ntemplate<typename A, typename B>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t);\n return dest;\n}\n\ntemplate<typename A, typename B, typename C>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t);\n return dest;\n}\n\ntemplate<typename A, typename B, typename C, typename D>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C, D> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t) << ' ' << std::get<3>(t);\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::vector<std::vector<T>> &v) {\n int sz = v.size();\n if (!sz) return dest;\n for (int i = 0; i < sz; i++) {\n int m = v[i].size();\n for (int j = 0; j < m; j++) dest << v[i][j] << (i != sz - 1 && j == m - 1 ? '\\n' : ' ');\n }\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::vector<T> &v) {\n int sz = v.size();\n if (!sz) return dest;\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\n dest << v[sz - 1];\n return dest;\n}\n\ntemplate<typename T, size_t sz>\nstd::ostream &operator << (std::ostream &dest, const std::array<T, sz> &v) {\n if (!sz) return dest;\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\n dest << v[sz - 1];\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::set<T> &v) {\n for (auto itr = v.begin(); itr != v.end();) {\n dest << *itr;\n itr++;\n if (itr != v.end()) dest << ' ';\n }\n return dest;\n}\n\ntemplate<typename T, typename E>\nstd::ostream &operator << (std::ostream &dest, const std::map<T, E> &v) {\n for (auto itr = v.begin(); itr != v.end(); ) {\n dest << '(' << itr->first << \", \" << itr->second << ')';\n itr++;\n if (itr != v.end()) dest << '\\n';\n }\n return dest;\n}\n\ntemplate<typename T>\nstd::vector<T> make_vec(size_t sz, T val) { return std::vector<T>(sz, val); }\n\ntemplate<typename T, typename... Tail>\nauto make_vec(size_t sz, Tail ...tail) {\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\n}\n\ntemplate<typename T>\nstd::vector<T> read_vec(size_t sz) {\n std::vector<T> v(sz);\n for (int i = 0; i < (int)sz; i++) std::cin >> v[i];\n return v;\n}\n\ntemplate<typename T, typename... Tail>\nauto read_vec(size_t sz, Tail ...tail) {\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\n for (int i = 0; i < (int)sz; i++) v[i] = read_vec<T>(tail...);\n return v;\n}\n\ntemplate<typename T, size_t size>\nauto make_array(T x) { \n std::array<T, size> res;\n res.fill(x);\n return res;\n}\n\ntemplate<typename T, size_t size, size_t size2, size_t... Tail>\nauto make_array(T x) {\n std::array<decltype(make_array<T, size2, Tail...>(x)), size> res;\n res.fill(make_array<T, size2, Tail...>(x));\n return res;\n}\n\n\n// x / y以上の最小の整数\nll ceil_div(ll x, ll y) {\n assert(y > 0);\n return (x + (x > 0 ? y - 1 : 0)) / y;\n}\n\n// x / y以下の最大の整数\nll floor_div(ll x, ll y) {\n assert(y > 0);\n return (x + (x > 0 ? 0 : -y + 1)) / y;\n}\n\nvoid io_init() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n}\n\n\n\n#include <limits>\n\ntemplate<typename T>\nstruct add_min_function{\n using F = add_min_function<T>;\n T add, upper;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n add_min_function(): add(0), upper(inf){}\n add_min_function(T _add, T _upper): add(_add), upper(_upper){}\n // g(f(x))\n static F merge(const F &f, const F &g){return {f.add + g.add, std::min(g.upper, f.upper + g.add)};}\n T fx(T x){return std::min(x + add, upper);}\n bool operator == (const F &r)const{return add == r.add && upper == r.upper;}\n};\n\n// f(x) = min(max(x + a, b), c)\ntemplate<typename T>\nstruct clamp_function{\n T add, lower, upper;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\n clamp_function(): add(0), lower(minf), upper(inf){}\n clamp_function(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper){lower = std::min(_lower, _upper);}\n // g(f(x))\n static clamp_function<T> merge(const clamp_function<T> &f, const clamp_function<T> &g){\n return {f.add + g.add, std::max(g.lower, std::min(f.upper, f.lower) + g.add), std::min(g.upper, std::max(g.lower, f.upper + g.add))};\n }\n T fx(T x){\n return std::min(std::max(x + add, lower), upper);\n }\n bool operator == (const clamp_function<T> &r)const{return add == r.add && lower == r.lower && upper == r.upper;}\n};\n// f(x) = min(max(x + a, b), c)\n// min部分によって減少した値をスコアとする\ntemplate<typename T, typename Tsum>\nstruct clamp_function_score{\npublic:\n T add, lower, upper, score_upper;\n Tsum score_sum;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\n clamp_function_score(): add(0), lower(minf), upper(inf), score_upper(inf), score_sum(0){}\n clamp_function_score(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper), score_upper(_upper), score_sum(0){lower = std::min(_lower, _upper);}\nprivate:\n clamp_function_score(T _add, T _lower, T _upper, T _supper, Tsum _ssum): add(_add), lower(_lower), upper(_upper), score_upper(_supper), score_sum(_ssum){}\npublic:\n // g(f(x))\n static clamp_function_score<T, Tsum> merge(const clamp_function_score<T, Tsum> &f, const clamp_function_score<T, Tsum> &g){\n T _add = f.add + g.add;\n T _lower = std::max(g.lower, std::min(f.upper, f.lower) + g.add);\n T _upper = std::min(g.upper, std::max(g.lower, f.upper + g.add));\n _lower = std::min(_lower, _upper);\n Tsum _ssum = f.score_sum + g.score_sum;\n if(f.lower == f.upper){\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\n return {_add, _lower, _upper, f.score_upper + g.add, _ssum};\n }else if(f.lower + g.add >= g.score_upper){\n assert(_lower == _upper);\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\n return {_add, _lower, _upper, f.lower + g.add, _ssum};\n }else{\n return {_add, _lower, _upper, std::min(f.score_upper + g.add, g.score_upper), _ssum};\n }\n }\n T fx(T x){\n return std::min(std::max(x + add, lower), upper);\n }\n Tsum fx_score(T x){\n return score_sum + std::max((T)0, x + add - score_upper);\n }\n bool operator == (const clamp_function_score<T, Tsum> &r)const{return add == r.add && lower == r.lower && upper == r.upper && score_upper == r.score_upper && score_sum == r.score_sum;}\n};\n\n\n\ntemplate<typename T>\nstruct prefixsum_min{\n T sum, pmin;\n static prefixsum_min<T> id(){\n return {0, std::numeric_limits<T>::max() / 2};\n }\n static prefixsum_min<T> merge(prefixsum_min<T> a, prefixsum_min<T> b){\n if(b.pmin == std::numeric_limits<T>::max() / 2) return a;\n return {a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin)};\n }\n};\ntemplate<typename T>\nstruct prefixsum_max{\n T sum, pmax;\n static prefixsum_max<T> id(){\n return {0, std::numeric_limits<T>::min() / 2};\n }\n static prefixsum_max<T> merge(prefixsum_max<T> a, prefixsum_max<T> b){\n if(b.pmax == std::numeric_limits<T>::min() / 2) return a;\n return {a.sum + b.sum, std::max(a.pmax, a.sum + b.pmax)};\n }\n};\ntemplate<typename T>\nstruct suffixsum_min{\n T sum, smin;\n static suffixsum_min<T> id(){\n return {0, std::numeric_limits<T>::max() / 2};\n }\n static suffixsum_min<T> merge(suffixsum_min<T> a, suffixsum_min<T> b){\n if(a.smin == std::numeric_limits<T>::max() / 2) return b;\n return {a.sum + b.sum, std::min(b.smin, b.sum + a.smin)};\n }\n};\ntemplate<typename T>\nstruct suffixsum_max{\n T sum, smax;\n static suffixsum_max<T> id(){\n return {0, std::numeric_limits<T>::min() / 2};\n }\n static suffixsum_max<T> merge(suffixsum_max<T> a, suffixsum_max<T> b){\n if(a.smax == std::numeric_limits<T>::min() / 2) return b;\n return {a.sum + b.sum, std::max(b.smax, b.sum + a.smax)};\n }\n};\ntemplate<typename T>\nstruct substringsum_max{\n T sum, pmax, smax, ssmax; // {区間全体のsum, prefixsumのmax, suffixsumのmax, substringsumのmax}\n static substringsum_max<T> id(){\n return {0, std::numeric_limits<T>::min(), 0, 0};\n }\n static substringsum_max<T> merge(substringsum_max<T> a, substringsum_max<T> b){\n if(b.pmax == std::numeric_limits<T>::min()) return a;\n if(a.pmax == std::numeric_limits<T>::min()) return b;\n T sum = a.sum + b.sum;\n T pmax = std::max(a.pmax, a.sum + b.pmax);\n T smax = std::max(a.smax + b.sum, b.smax);\n return {sum, pmax, smax, std::max({a.ssmax, b.ssmax, pmax, smax})};\n }\n};\n// 01列の0を-1として扱う\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax\nstruct excess_value{\npublic:\n int rank, sum, pmin, pmax;\n static constexpr int inf = 1 << 30;\n excess_value(): rank(inf), pmin(inf), pmax(-inf){}\n excess_value(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum){}\nprivate:\n excess_value(int a, int b, int c, int d): rank(a), sum(b), pmin(c), pmax(d){}\npublic:\n static excess_value merge(excess_value a, excess_value b){\n if(a.rank == inf) return b;\n if(b.rank == inf) return a;\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), std::max(a.pmax, a.sum + b.pmax)};\n }\n};\n// 01列の0を-1として扱う\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax, 接尾辞のmin, 接尾辞のmax\nstruct excess_value2{\npublic:\n int rank, sum, pmin, pmax, smin, smax;\n static constexpr int inf = 1 << 30;\n excess_value2(): rank(inf), pmin(inf), pmax(-inf), smin(inf), smax(-inf){}\n excess_value2(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum), smin(sum), smax(sum){}\nprivate:\n excess_value2(int a, int b, int c, int d, int e, int f): rank(a), sum(b), pmin(c), pmax(d), smin(e), smax(f){}\npublic:\n static excess_value2 merge(excess_value2 a, excess_value2 b){\n if(a.rank == inf) return b;\n if(b.rank == inf) return a;\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), \n std::max(a.pmax, a.sum + b.pmax), std::min(a.smin + b.sum, b.smin), std::max(a.smax + b.sum, b.smax)};\n }\n};\n\n\ntemplate<typename T>\nstruct range_add_chmin_chmax_range_freq {\n private:\n using F = clamp_function<T>;\n struct query {\n int type, l, r;\n F f;\n };\n int N;\n std::vector<T> V;\n std::vector<query> Qs;\n \n public:\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V) {}\n\n // [l, r)の x <- min(max(x + add, lower), upper)\n void apply(int l, int r, T add, T lower, T upper) {\n assert(lower <= upper);\n Qs.push_back({0, l, r, F{add, lower, upper}});\n }\n\n // [l, r)のx以上の最小要素\n void lower_bound(int l, int r, T x) {\n Qs.push_back({1, l, r, F{x, x, x}});\n }\n\n // [l, r)のrx未満の要素数\n void range_freq(int l, int r, T rx) {\n Qs.push_back({2, l, r, F{rx, rx, rx}});\n }\n\n /*\n // [l, r)のrx未満の要素の和\n void range_freq_sum(int l, int r, T rx) {\n //\n }\n */\n\n std::vector<T> solve() {\n int Q = Qs.size(), K = 2 * sqrt(N);\n std::vector<int> Bbegin{0};\n std::vector<F> lz{F{}};\n std::vector<T> B;\n\n auto propagate = [&]() -> void {\n for (int i = 0; i < (int)Bbegin.size(); i++) {\n if (lz[i] == F()) continue;\n int l = Bbegin[i];\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\n for (int j = l; j < r; j++) V[j] = lz[i].fx(V[j]);\n }\n };\n\n auto make_block = [&](int lq, int rq) -> void {\n Bbegin = {0};\n for (int i = lq; i < rq; i++) {\n Bbegin.push_back(Qs[i].l);\n Bbegin.push_back(Qs[i].r);\n }\n std::sort(Bbegin.begin(), Bbegin.end());\n Bbegin.erase(std::unique(Bbegin.begin(), Bbegin.end()), Bbegin.end());\n lz = std::vector<F>(Bbegin.size(), F());\n B = V;\n for (int i = 0; i < Bbegin.size(); i++) {\n int l = Bbegin[i];\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\n std::sort(B.begin() + l, B.begin() + r);\n }\n };\n\n std::vector<T> ans;\n\n for (int i = 0; i < Q; i++) {\n if (i % K == 0) {\n propagate();\n make_block(i, std::min(Q, i + K));\n }\n int l = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].l) - Bbegin.begin();\n int r = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].r) - Bbegin.begin();\n if (Qs[i].type == 0) {\n for (int j = l; j < r; j++) {\n lz[j] = F::merge(lz[j], Qs[i].f);\n }\n } else if (Qs[i].type == 1) {\n T lb = std::numeric_limits<T>::max();\n T x = Qs[i].f.add;\n for (int j = l; j < r; j++) { \n T y = x - lz[j].add;\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\n if (itr != B.begin() + Bbegin[j + 1]) {\n lb = std::min(lb, lz[j].fx(*itr));\n }\n if (itr != B.begin() + Bbegin[j] && lz[j].lower >= x) {\n lb = std::min(lb, lz[j].lower);\n }\n }\n ans.push_back(lb);\n } else if (Qs[i].type == 2) {\n T cnt = 0, rx = Qs[i].f.add;\n for (int j = l; j < r; j++) { \n if (lz[j].lower >= rx) continue;\n if (lz[j].upper < rx) {\n cnt += Bbegin[j + 1] - Bbegin[j];\n continue;\n }\n T y = rx - lz[j].add;\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\n cnt += itr - (B.begin() + Bbegin[j]);\n }\n ans.push_back(cnt);\n }\n }\n return ans;\n }\n};\n\nint main() {\n io_init();\n int N, Q;\n std::cin >> N >> Q;\n auto A = read_vec<ll>(N);\n range_add_chmin_chmax_range_freq<ll> F(A);\n\n static constexpr ll inf = 1LL << 60, minf = -inf;\n for (int i = 0; i < Q; i++) {\n int t, l, r;\n ll x;\n std::cin >> t >> l >> r >> x;\n l--;\n if (t == 1) {\n F.apply(l, r, 0, minf, x);\n } else if (t == 2) {\n F.apply(l, r, 0, x, inf);\n } else if (t == 3) {\n F.apply(l, r, x, minf, inf);\n } else {\n ll y;\n std::cin >> y;\n F.range_freq(l, r, x);\n F.range_freq(l, r, y + 1);\n }\n }\n\n auto ans = F.solve();\n\n for (int i = 0; i < ans.size(); i += 2) {\n std::cout << ans[i + 1] - ans[i] << '\\n';\n }\n\n}","accuracy":1,"time_ms":970,"memory_kb":11908,"score_of_the_acc":-1.5519,"final_rank":15},{"submission_id":"aoj_3170_9982954","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <array>\n#include <tuple>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <cassert>\n#include <climits>\n#include <iomanip>\n#include <numeric>\n#include <memory>\n#include <random>\n#include <thread>\n#include <chrono>\n#define allof(obj) (obj).begin(), (obj).end()\n#define range(i, l, r) for(int i=l;i<r;i++)\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\n#define bit_kth(i, k) ((i >> k)&1)\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\nusing ll = long long;\nusing ld = long double;\nusing ul = uint64_t;\nusing pi = std::pair<int, int>;\nusing pl = std::pair<ll, ll>;\nusing namespace std;\n\ntemplate<typename F, typename S>\nstd::ostream &operator << (std::ostream &dest, const std::pair<F, S> &p) {\n dest << p.first << ' ' << p.second;\n return dest;\n}\n\ntemplate<typename A, typename B>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t);\n return dest;\n}\n\ntemplate<typename A, typename B, typename C>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t);\n return dest;\n}\n\ntemplate<typename A, typename B, typename C, typename D>\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C, D> &t) {\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t) << ' ' << std::get<3>(t);\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::vector<std::vector<T>> &v) {\n int sz = v.size();\n if (!sz) return dest;\n for (int i = 0; i < sz; i++) {\n int m = v[i].size();\n for (int j = 0; j < m; j++) dest << v[i][j] << (i != sz - 1 && j == m - 1 ? '\\n' : ' ');\n }\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::vector<T> &v) {\n int sz = v.size();\n if (!sz) return dest;\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\n dest << v[sz - 1];\n return dest;\n}\n\ntemplate<typename T, size_t sz>\nstd::ostream &operator << (std::ostream &dest, const std::array<T, sz> &v) {\n if (!sz) return dest;\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\n dest << v[sz - 1];\n return dest;\n}\n\ntemplate<typename T>\nstd::ostream &operator << (std::ostream &dest, const std::set<T> &v) {\n for (auto itr = v.begin(); itr != v.end();) {\n dest << *itr;\n itr++;\n if (itr != v.end()) dest << ' ';\n }\n return dest;\n}\n\ntemplate<typename T, typename E>\nstd::ostream &operator << (std::ostream &dest, const std::map<T, E> &v) {\n for (auto itr = v.begin(); itr != v.end(); ) {\n dest << '(' << itr->first << \", \" << itr->second << ')';\n itr++;\n if (itr != v.end()) dest << '\\n';\n }\n return dest;\n}\n\ntemplate<typename T>\nstd::vector<T> make_vec(size_t sz, T val) { return std::vector<T>(sz, val); }\n\ntemplate<typename T, typename... Tail>\nauto make_vec(size_t sz, Tail ...tail) {\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\n}\n\ntemplate<typename T>\nstd::vector<T> read_vec(size_t sz) {\n std::vector<T> v(sz);\n for (int i = 0; i < (int)sz; i++) std::cin >> v[i];\n return v;\n}\n\ntemplate<typename T, typename... Tail>\nauto read_vec(size_t sz, Tail ...tail) {\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\n for (int i = 0; i < (int)sz; i++) v[i] = read_vec<T>(tail...);\n return v;\n}\n\ntemplate<typename T, size_t size>\nauto make_array(T x) { \n std::array<T, size> res;\n res.fill(x);\n return res;\n}\n\ntemplate<typename T, size_t size, size_t size2, size_t... Tail>\nauto make_array(T x) {\n std::array<decltype(make_array<T, size2, Tail...>(x)), size> res;\n res.fill(make_array<T, size2, Tail...>(x));\n return res;\n}\n\n\n// x / y以上の最小の整数\nll ceil_div(ll x, ll y) {\n assert(y > 0);\n return (x + (x > 0 ? y - 1 : 0)) / y;\n}\n\n// x / y以下の最大の整数\nll floor_div(ll x, ll y) {\n assert(y > 0);\n return (x + (x > 0 ? 0 : -y + 1)) / y;\n}\n\nvoid io_init() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n}\n\n\n\n#include <limits>\n\ntemplate<typename T>\nstruct add_min_function{\n using F = add_min_function<T>;\n T add, upper;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n add_min_function(): add(0), upper(inf){}\n add_min_function(T _add, T _upper): add(_add), upper(_upper){}\n // g(f(x))\n static F merge(const F &f, const F &g){return {f.add + g.add, std::min(g.upper, f.upper + g.add)};}\n T fx(T x){return std::min(x + add, upper);}\n bool operator == (const F &r)const{return add == r.add && upper == r.upper;}\n};\n\n// f(x) = min(max(x + a, b), c)\ntemplate<typename T>\nstruct clamp_function{\n T add, lower, upper;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\n clamp_function(): add(0), lower(minf), upper(inf){}\n clamp_function(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper){lower = std::min(_lower, _upper);}\n // g(f(x))\n static clamp_function<T> merge(const clamp_function<T> &f, const clamp_function<T> &g){\n return {f.add + g.add, std::max(g.lower, std::min(f.upper, f.lower) + g.add), std::min(g.upper, std::max(g.lower, f.upper + g.add))};\n }\n T fx(T x){\n return std::min(std::max(x + add, lower), upper);\n }\n bool operator == (const clamp_function<T> &r)const{return add == r.add && lower == r.lower && upper == r.upper;}\n};\n// f(x) = min(max(x + a, b), c)\n// min部分によって減少した値をスコアとする\ntemplate<typename T, typename Tsum>\nstruct clamp_function_score{\npublic:\n T add, lower, upper, score_upper;\n Tsum score_sum;\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\n clamp_function_score(): add(0), lower(minf), upper(inf), score_upper(inf), score_sum(0){}\n clamp_function_score(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper), score_upper(_upper), score_sum(0){lower = std::min(_lower, _upper);}\nprivate:\n clamp_function_score(T _add, T _lower, T _upper, T _supper, Tsum _ssum): add(_add), lower(_lower), upper(_upper), score_upper(_supper), score_sum(_ssum){}\npublic:\n // g(f(x))\n static clamp_function_score<T, Tsum> merge(const clamp_function_score<T, Tsum> &f, const clamp_function_score<T, Tsum> &g){\n T _add = f.add + g.add;\n T _lower = std::max(g.lower, std::min(f.upper, f.lower) + g.add);\n T _upper = std::min(g.upper, std::max(g.lower, f.upper + g.add));\n _lower = std::min(_lower, _upper);\n Tsum _ssum = f.score_sum + g.score_sum;\n if(f.lower == f.upper){\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\n return {_add, _lower, _upper, f.score_upper + g.add, _ssum};\n }else if(f.lower + g.add >= g.score_upper){\n assert(_lower == _upper);\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\n return {_add, _lower, _upper, f.lower + g.add, _ssum};\n }else{\n return {_add, _lower, _upper, std::min(f.score_upper + g.add, g.score_upper), _ssum};\n }\n }\n T fx(T x){\n return std::min(std::max(x + add, lower), upper);\n }\n Tsum fx_score(T x){\n return score_sum + std::max((T)0, x + add - score_upper);\n }\n bool operator == (const clamp_function_score<T, Tsum> &r)const{return add == r.add && lower == r.lower && upper == r.upper && score_upper == r.score_upper && score_sum == r.score_sum;}\n};\n\n\n\ntemplate<typename T>\nstruct prefixsum_min{\n T sum, pmin;\n static prefixsum_min<T> id(){\n return {0, std::numeric_limits<T>::max() / 2};\n }\n static prefixsum_min<T> merge(prefixsum_min<T> a, prefixsum_min<T> b){\n if(b.pmin == std::numeric_limits<T>::max() / 2) return a;\n return {a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin)};\n }\n};\ntemplate<typename T>\nstruct prefixsum_max{\n T sum, pmax;\n static prefixsum_max<T> id(){\n return {0, std::numeric_limits<T>::min() / 2};\n }\n static prefixsum_max<T> merge(prefixsum_max<T> a, prefixsum_max<T> b){\n if(b.pmax == std::numeric_limits<T>::min() / 2) return a;\n return {a.sum + b.sum, std::max(a.pmax, a.sum + b.pmax)};\n }\n};\ntemplate<typename T>\nstruct suffixsum_min{\n T sum, smin;\n static suffixsum_min<T> id(){\n return {0, std::numeric_limits<T>::max() / 2};\n }\n static suffixsum_min<T> merge(suffixsum_min<T> a, suffixsum_min<T> b){\n if(a.smin == std::numeric_limits<T>::max() / 2) return b;\n return {a.sum + b.sum, std::min(b.smin, b.sum + a.smin)};\n }\n};\ntemplate<typename T>\nstruct suffixsum_max{\n T sum, smax;\n static suffixsum_max<T> id(){\n return {0, std::numeric_limits<T>::min() / 2};\n }\n static suffixsum_max<T> merge(suffixsum_max<T> a, suffixsum_max<T> b){\n if(a.smax == std::numeric_limits<T>::min() / 2) return b;\n return {a.sum + b.sum, std::max(b.smax, b.sum + a.smax)};\n }\n};\ntemplate<typename T>\nstruct substringsum_max{\n T sum, pmax, smax, ssmax; // {区間全体のsum, prefixsumのmax, suffixsumのmax, substringsumのmax}\n static substringsum_max<T> id(){\n return {0, std::numeric_limits<T>::min(), 0, 0};\n }\n static substringsum_max<T> merge(substringsum_max<T> a, substringsum_max<T> b){\n if(b.pmax == std::numeric_limits<T>::min()) return a;\n if(a.pmax == std::numeric_limits<T>::min()) return b;\n T sum = a.sum + b.sum;\n T pmax = std::max(a.pmax, a.sum + b.pmax);\n T smax = std::max(a.smax + b.sum, b.smax);\n return {sum, pmax, smax, std::max({a.ssmax, b.ssmax, pmax, smax})};\n }\n};\n// 01列の0を-1として扱う\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax\nstruct excess_value{\npublic:\n int rank, sum, pmin, pmax;\n static constexpr int inf = 1 << 30;\n excess_value(): rank(inf), pmin(inf), pmax(-inf){}\n excess_value(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum){}\nprivate:\n excess_value(int a, int b, int c, int d): rank(a), sum(b), pmin(c), pmax(d){}\npublic:\n static excess_value merge(excess_value a, excess_value b){\n if(a.rank == inf) return b;\n if(b.rank == inf) return a;\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), std::max(a.pmax, a.sum + b.pmax)};\n }\n};\n// 01列の0を-1として扱う\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax, 接尾辞のmin, 接尾辞のmax\nstruct excess_value2{\npublic:\n int rank, sum, pmin, pmax, smin, smax;\n static constexpr int inf = 1 << 30;\n excess_value2(): rank(inf), pmin(inf), pmax(-inf), smin(inf), smax(-inf){}\n excess_value2(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum), smin(sum), smax(sum){}\nprivate:\n excess_value2(int a, int b, int c, int d, int e, int f): rank(a), sum(b), pmin(c), pmax(d), smin(e), smax(f){}\npublic:\n static excess_value2 merge(excess_value2 a, excess_value2 b){\n if(a.rank == inf) return b;\n if(b.rank == inf) return a;\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), \n std::max(a.pmax, a.sum + b.pmax), std::min(a.smin + b.sum, b.smin), std::max(a.smax + b.sum, b.smax)};\n }\n};\n\n\ntemplate<typename T>\nstruct range_add_chmin_chmax_range_freq {\n private:\n using F = clamp_function<T>;\n struct query {\n int type, l, r;\n F f;\n };\n int N;\n std::vector<T> V;\n std::vector<query> Qs;\n \n public:\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V) {}\n\n // [l, r)の x <- min(max(x + add, lower), upper)\n void apply(int l, int r, T add, T lower, T upper) {\n assert(lower <= upper);\n Qs.push_back({0, l, r, F{add, lower, upper}});\n }\n\n // [l, r)のx以上の最小要素\n void lower_bound(int l, int r, T x) {\n Qs.push_back({1, l, r, F{x, x, x}});\n }\n\n // [l, r)のrx未満の要素数\n void range_freq(int l, int r, T rx) {\n Qs.push_back({2, l, r, F{rx, rx, rx}});\n }\n\n /*\n // [l, r)のrx未満の要素の和\n void range_freq_sum(int l, int r, T rx) {\n //\n }\n */\n\n std::vector<T> solve() {\n int Q = Qs.size(), K = 2 * sqrt(N);\n std::vector<int> Bbegin{0};\n std::vector<F> lz{F{}};\n std::vector<T> B;\n\n auto propagate = [&]() -> void {\n for (int i = 0; i < (int)Bbegin.size(); i++) {\n if (lz[i] == F()) continue;\n int l = Bbegin[i];\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\n for (int j = l; j < r; j++) V[j] = lz[i].fx(V[j]);\n }\n };\n\n auto make_block = [&](int lq, int rq) -> void {\n Bbegin = {0};\n for (int i = lq; i < rq; i++) {\n Bbegin.push_back(Qs[i].l);\n Bbegin.push_back(Qs[i].r);\n }\n std::sort(Bbegin.begin(), Bbegin.end());\n Bbegin.erase(std::unique(Bbegin.begin(), Bbegin.end()), Bbegin.end());\n lz = std::vector<F>(Bbegin.size(), F());\n B = V;\n for (int i = 0; i < Bbegin.size(); i++) {\n int l = Bbegin[i];\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\n std::sort(B.begin() + l, B.begin() + r);\n }\n };\n\n std::vector<T> ans;\n\n for (int i = 0; i < Q; i++) {\n if (i % K == 0) {\n propagate();\n make_block(i, std::min(Q, i + K));\n }\n int l = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].l) - Bbegin.begin();\n int r = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].r) - Bbegin.begin();\n if (Qs[i].type == 0) {\n for (int j = l; j < r; j++) {\n lz[j] = F::merge(lz[j], Qs[i].f);\n }\n } else if (Qs[i].type == 1) {\n T lb = std::numeric_limits<T>::max();\n T x = Qs[i].f.add;\n for (int j = l; j < r; j++) { \n T y = x - lz[j].add;\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\n if (itr != B.begin() + Bbegin[j + 1]) {\n lb = std::min(lb, lz[j].fx(*itr));\n }\n if (itr != B.begin() + Bbegin[j] && lz[j].lower >= x) {\n lb = std::min(lb, lz[j].lower);\n }\n }\n ans.push_back(lb);\n } else if (Qs[i].type == 2) {\n T cnt = 0, rx = Qs[i].f.add;\n for (int j = l; j < r; j++) { \n if (lz[j].lower >= rx) continue;\n if (lz[j].upper < rx) {\n cnt += Bbegin[j + 1] - Bbegin[j];\n continue;\n }\n T y = rx - lz[j].add;\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\n cnt += itr - (B.begin() + Bbegin[j]);\n }\n ans.push_back(cnt);\n }\n }\n return ans;\n }\n};\n\nint main() {\n io_init();\n int N, Q;\n std::cin >> N >> Q;\n auto A = read_vec<ll>(N);\n range_add_chmin_chmax_range_freq<ll> F(A);\n\n static constexpr ll inf = 1LL << 60, minf = -inf;\n for (int i = 0; i < Q; i++) {\n int t, l, r, x;\n std::cin >> t >> l >> r >> x;\n l--;\n if (t == 1) {\n F.apply(l, r, 0, minf, x);\n } else if (t == 2) {\n F.apply(l, r, 0, x, inf);\n } else if (t == 3) {\n F.apply(l, r, x, minf, inf);\n } else {\n int y;\n std::cin >> y;\n F.range_freq(l, r, x);\n F.range_freq(l, r, y + 1);\n }\n }\n\n auto ans = F.solve();\n\n for (int i = 0; i < ans.size(); i += 2) {\n std::cout << ans[i + 1] - ans[i] << '\\n';\n }\n\n}","accuracy":0.09523809523809523,"time_ms":350,"memory_kb":8288,"score_of_the_acc":-0.6821,"final_rank":19},{"submission_id":"aoj_3170_9230140","code_snippet":"#pragma region Macros\n \n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n \n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n \n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n \n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n \n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n \n#define next asdnext\n#define prev asdprev\n \nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\nconst int MOD = 998244353;\n// const int MOD = 1000000007;\n \nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n \nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n \n#define EC int\nstruct Edge {\n int from, to;\n EC cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n bool operator <(const Edge& e) { return this->cost < e.cost; }\n bool operator >(const Edge& e) { return this->cost > e.cost; }\n};\n \nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n \nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n \nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n \ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\nbool is_pow4(i64 x) { return __builtin_popcount(x) == 1 && __builtin_ctz(x) % 2 == 0; }\n \ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n \ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n \ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n \ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n \nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n \ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n \ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\n}\n \n \n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = x / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n \ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n \ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n \nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n \n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n \nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n \n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n \n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n \n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n \n int size() { return sz; }\n \n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n \nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n \ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<T> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n \ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n \n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n \nusing mint = Modint<MOD>;\n \nistream &operator >>(istream &is, mint& x) {\n int t; is >> t; x = t; return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n \nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\nint modinv(__int128_t x, int mod) {\n assert(mod > 0);\n // assert(x > 0);\n if (x == 1 or x == 0) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n \nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n}\n \n__int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n \nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n \n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) { string s = \"\"; s += c; return s; }\n \ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n \nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n \nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n \n#pragma endregion\n\n// https://hashiryo.github.io/Library/src/DataStructure/SortedPerBucket.hpp\ntemplate <class T, int B= 700> class SortedPerBucket {\n static constexpr T INF= numeric_limits<T>::max() / 2;\n struct Dat {\n const int n;\n T a[B], sorted[B], acc[B + 1];\n T add, lb, ub;\n Dat(int b): n(b), a{0}, sorted{0}, acc{0}, add(0), lb(-INF), ub(INF) {}\n Dat(const T *bg, int b): n(b), a{0}, acc{0}, add(0), lb(-INF), ub(INF) {\n for (int i= n; i--;) a[i]= *(bg + i);\n build();\n }\n inline bool eval() {\n if (add == 0 && lb == -INF && ub == INF) return false;\n for (auto &x: a) x= clamp(x, lb, ub) + add;\n return add= 0, lb= -INF, ub= INF, true;\n }\n inline void build() { copy_n(a, B, sorted), sort(sorted, sorted + n), partial_sum(sorted, sorted + n, acc + 1); }\n inline int idx(T x) const { return lower_bound(sorted, sorted + n, x) - sorted; }\n inline int count(T x) const { return x-= add, (x <= lb ? 0 : ub < x ? n : idx(x)); }\n inline T sum() const {\n int l= idx(lb), u= idx(ub);\n return acc[u] - acc[l] + lb * l + ub * (n - u) + add * n;\n }\n inline T sum(T x) const {\n if (x-= add; x <= lb) return 0;\n if (ub < x) return sum();\n int l= idx(lb), u= idx(x);\n return acc[u] - acc[l] + lb * l + add * u;\n }\n inline T get(int k) const { return clamp(a[k], lb, ub) + add; }\n };\n const int n;\n vector<Dat> dat;\n template <class U, class All, class One> inline U fold(int l, int r, const All &all, const One &one) const {\n U ret= 0;\n if (int i= l / B, j= r / B, k= l % B, m= r % B; i < j) {\n if (k) {\n for (; k < dat[i].n; ++k) ret+= one(dat[i].get(k));\n ++i;\n }\n for (; i < j; ++i) ret+= all(dat[i]);\n for (; m--;) ret+= one(dat[j].get(m));\n } else\n for (; k < m; ++k) ret+= one(dat[i].get(k));\n return ret;\n }\n template <class All, class One> inline void update(int l, int r, const All &all, const One &one) {\n if (int i= l / B, j= r / B, k= l % B, m= r % B; i < j) {\n if (k) {\n for (dat[i].eval(); k < dat[i].n; k++) one(dat[i].a[k]);\n dat[i].build(), ++i;\n }\n for (; i < j; ++i) all(dat[i]);\n if (m) {\n for (dat[j].eval(); m--;) one(dat[j].a[m]);\n dat[j].build();\n }\n } else {\n for (dat[i].eval(); k < m; ++k) one(dat[i].a[k]);\n dat[i].build();\n }\n }\npublic:\n SortedPerBucket(int n): n(n) {\n for (int l= 0, r; l < n; l= r) r= min(l + B, n), dat.emplace_back(r - l);\n }\n SortedPerBucket(const vector<T> &a): n(a.size()) {\n for (int l= 0, r; l < n; l= r) r= min(l + B, n), dat.emplace_back(a.data() + l, r - l);\n }\n // count i s.t. (l <= i < r) && (a[i] < ub)\n int count(int l, int r, T ub) const {\n return fold<int>(\n l, r, [&](const Dat &d) { return d.count(ub); }, [&](T x) { return x < ub; });\n }\n // count i s.t. (l <= i < r) && (lb <= a[i] < ub)\n int count(int l, int r, T lb, T ub) const { return count(l, r, ub) - count(l, r, lb); }\n // sum a[i] s.t. (l <= i < r)\n T sum(int l, int r) const {\n return fold<T>(\n l, r, [&](const Dat &d) { return d.sum(); }, [&](T x) { return x; });\n }\n // sum a[i] s.t. (l <= i < r) && (a[i] < ub)\n T sum(int l, int r, T ub) const {\n return fold<T>(\n l, r, [&](const Dat &d) { return d.sum(ub); }, [&](T x) { return x < ub ? x : 0; });\n }\n // sum a[i] s.t. (l <= i < r) && (lb <= a[i] < ub)\n T sum(int l, int r, T lb, T ub) const { return sum(l, r, ub) - sum(l, r, lb); }\n void set(int k, T x) {\n int i= k / B, j= k % B;\n dat[i].eval(), dat[i].a[j]= x, dat[i].build();\n }\n T get(int k) const { return dat[k / B].get(k % B); }\n T operator[](int k) const { return get(k); }\n void add(int l, int r, T v) {\n update(\n l, r, [&](Dat &d) { d.add+= v; }, [&](T &x) { x+= v; });\n }\n void chmin(int l, int r, T ub) {\n auto f= [&](Dat &d) {\n T b= ub - d.add;\n d.ub= min(d.ub, b), d.lb= min(d.lb, b);\n };\n update(l, r, f, [&](T &x) { x= min(x, ub); });\n }\n void chmax(int l, int r, T lb) {\n auto f= [&](Dat &d) {\n T a= lb - d.add;\n d.lb= max(d.lb, a), d.ub= max(d.ub, a);\n };\n update(l, r, f, [&](T &x) { x= max(x, lb); });\n }\n void chclamp(int l, int r, T lb, T ub) {\n auto f= [&](Dat &d) {\n T a= lb - d.add, b= ub - d.add;\n d.ub= clamp(d.ub, a, b), d.lb= clamp(d.lb, a, b);\n };\n update(l, r, f, [&](T &x) { x= clamp(x, lb, ub); });\n }\n};\n\nsigned main() {\n int N, Q;\n cin >> N >> Q;\n vector<int> A(N);\n for (int i = 0; i < N; i++) cin >> A[i];\n\n SortedPerBucket<long long, 100> seg(A);\n for (int i = 0; i < Q; i++) {\n int t;\n cin >> t;\n if (t == 1) {\n int l, r, x;\n cin >> l >> r >> x;\n l--; r--; \n seg.chmin(l, r + 1, x);\n }\n if (t == 2) {\n int l, r, x;\n cin >> l >> r >> x;\n l--; r--; \n seg.chmax(l, r + 1, x);\n }\n if (t == 3) {\n int l, r, x;\n cin >> l >> r >> x;\n l--; r--; \n seg.add(l, r + 1, x);\n }\n if (t == 4) {\n int l, r, a, b;\n cin >> l >> r >> a >> b;\n l--; r--; \n cout << seg.count(l, r + 1, a, b + 1) << endl;\n }\n }\n}","accuracy":1,"time_ms":1060,"memory_kb":7632,"score_of_the_acc":-1.0585,"final_rank":13},{"submission_id":"aoj_3170_7517934","code_snippet":"#line 1 \"library-cpp/other/template.hpp\"\n// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing uint = unsigned int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<long long, long long>;\ntemplate <class T> using maxheap = priority_queue<T>;\ntemplate <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vvec = vector<vector<T>>;\n#define OVERLOAD_REP(_1, _2, _3, name, ...) name\n#define REP0(n) for (auto minato = decay_t<decltype(n)>{}; minato < (n); ++minato)\n#define REP1(i, n) for (auto i = decay_t<decltype(n)>{}; (i) < (n); (i)++)\n#define REP2(i, l, r) for (auto i = (l); (i) < (r); (i)++)\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\n#define OVERLOAD_RREP(_1, _2, _3, name, ...) name\n#define RREP1(i, n) for (auto i = (n) - 1; (i) >= decay_t<decltype(n)>{}; (i)--)\n#define RREP2(i, l, r) for (auto i = (r) - 1; (i) >= (l); (i)--)\n#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP2, RREP1)(__VA_ARGS__)\n#define all(x) begin(x), end(x)\ntemplate <class Container> int SZ(const Container& v) { return int(v.size()); }\ntemplate <class T> void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }\ntemplate <class T> T MAX(const vector<T>& v) { return *max_element(v.begin(), v.end()); }\ntemplate <class T> T MIN(const vector<T>& v) { return *min_element(v.begin(), v.end()); }\ntemplate <class T> T SUM(const vector<T>& v) { return accumulate(v.begin(), v.end(), T(0)); }\ntemplate <class T> T ABS(T x) { return max(x, -x); }\ntemplate <class T1, class T2> bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; }\ntemplate <class T1, class T2> bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; }\nint topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }\nint botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }\nint popcount(ull x) { return __builtin_popcountll(x); }\nint kthbit(ull x, int k) { return (x >> k) & 1; }\nconstexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; }\ntemplate <typename S> void rearrange(const vector<S>& id) { (void)id; }\ntemplate <typename S, typename T> void rearrange_exec(const vector<S>& id, vector<T>& v) { vector<T> w(v.size()); for (size_t i = 0; i < id.size(); i++) { w[i] = v[id[i]]; } v.swap(w); }\ntemplate <typename S, typename Head, typename... Tail> void rearrange(const vector<S>& id, Head& a, Tail& ...tail) { rearrange_exec(id, a); rearrange(id, tail...); }\nistream& operator>>(istream& is, __int128_t& x) {\n x = 0;\n string s;\n is >> s;\n int n = int(s.size()), it = 0;\n if (s[0] == '-') it++;\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\n if (s[0] == '-') x = -x;\n return is;\n}\nostream& operator<<(ostream& os, __int128_t x) {\n if (x == 0) return os << 0;\n if (x < 0) os << '-', x = -x;\n deque<int> deq;\n while (x) deq.emplace_front(x % 10), x /= 10;\n for (int e : deq) os << e;\n return os;\n}\ntemplate <class T> vector<T> &operator++(vector<T>& v) { for (auto& e : v) { e++; } return v;} \ntemplate <class T> vector<T> operator++(vector<T>& v, int) { auto res = v; for (auto& e : v) { e++; } return res; }\ntemplate <class T> vector<T> &operator--(vector<T>& v) { for (auto& e : v) { e--; } return v; }\ntemplate <class T> vector<T> operator--(vector<T>& v, int) { auto res = v; for (auto& e : v) { e--; } return res; }\ntemplate <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x) { return pair<T1, T2>(-x.first, -x.second); }\ntemplate <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first - y.first, x.second - y.second); }\ntemplate <class T1, class T2> pair<T1, T2> operator+(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first + y.first, x.second + y.second); }\ntemplate <class T1, class T2> pair<T1, T2> operator+=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l + r; }\ntemplate <class T1, class T2> pair<T1, T2> operator-=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l - r; }\nconstexpr char ln = '\\n';\nconst string YESNO[2] = {\"NO\", \"YES\"};\nconst string YesNo[2] = {\"No\", \"Yes\"};\nvoid YES(bool t = true) { cout << YESNO[t] << \"\\n\"; }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = true) { cout << YesNo[t] << \"\\n\"; }\nvoid No(bool t = 1) { Yes(!t); }\ntemplate <class T> void drop(T x) { cout << x << \"\\n\"; exit(0); }\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LDB(...) \\\n long double __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define VEC2(type, name1, name2, size) \\\n vector<type> name1(size), name2(size); \\\n for (int i = 0; i < size; i++) IN(name1[i], name2[i])\n#define VEC3(type, name1, name2, name3, size) \\\n vector<type> name1(size), name2(size), name3(size); \\\n for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\n#define VEC4(type, name1, name2, name3, name4, size) \\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\n for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\n#define VV(type, name, N, M) \\\n vector<vector<type>> name(N, vector<type>(M)); \\\n IN(name)\ntemplate <class T> void scan(T& a) { cin >> a; }\ntemplate <class T> void scan(vector<T>& a) { for (auto& i : a) scan(i); }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head& head, Tail&... tail) { scan(head); IN(tail...); }\nvoid print() { cout << \"\\n\"; }\ntemplate <class T> void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << \" \"; } cout << *it; } print(); }\ntemplate <class T, class... Args> void print(const T& x, const Args& ... args) { cout << x; if (sizeof...(Args)) cout << \" \"; print(args...); }\n#ifdef MINATO_LOCAL\ntemplate <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; }\ntemplate <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? \"\" : \", \") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); }\ntemplate <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << \"(\"; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << \")\"; }\nstring debug_delim(int& i) { return i++ == 0 ? \"\" : \", \"; }\n#define debug_embrace(x) { int i = 0; os << \"{\"; { x } return os << \"}\"; }\ntemplate <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) }\ntemplate <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }\ntemplate <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }\ntemplate <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }\ntemplate <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) }\ntemplate <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }\ntemplate <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) }\ntemplate <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) }\ntemplate <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }\ntemplate <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }\nvoid debug_out() { cerr << endl; }\ntemplate <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << \" \" << x; debug_out(args...); }\n#define debug(...) cerr << __LINE__ << \" : [\" << #__VA_ARGS__ << \"] =\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) (void(0))\n#endif\nstruct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); }; } fast_ios_;\n///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n// clang-format on\n#line 2 \"E.cpp\"\n\ntemplate <int W> struct SquareRootDecomposition {\n struct Ranges {\n optional<pair<int, int>> left_overflow_range;\n optional<pair<int, int>> bucket_range;\n optional<pair<int, int>> right_overflow_range;\n Ranges()\n : left_overflow_range(nullopt),\n bucket_range(nullopt),\n right_overflow_range(nullopt) {\n }\n };\n\n int n;\n\n SquareRootDecomposition() {\n }\n SquareRootDecomposition(int n) : n(n) {\n }\n\n int bucket_size() const {\n return (n + W - 1) / W;\n }\n\n /**\n * @brief クエリの範囲を分割する\n * @param l 左端\n * @param r 右端\n * @return 分割された範囲\n * @note [l, r) の範囲を分割する\n */\n Ranges query(int l, int r) const {\n assert(0 <= l && l < r && r <= n);\n Ranges ret;\n int l_bucket_id = bucket_id(l);\n int r_bucket_id = bucket_id(r - 1);\n auto [l_bucket_l, l_bucket_r] = bucket_range(l_bucket_id);\n auto [r_bucket_l, r_bucket_r] = bucket_range(r_bucket_id);\n if (l_bucket_id == r_bucket_id) {\n if (l == l_bucket_l && r == r_bucket_r) {\n ret.bucket_range = {l_bucket_id, l_bucket_id + 1};\n } else {\n ret.left_overflow_range = {l, r};\n }\n } else {\n if (l_bucket_id + 1 < r_bucket_id) {\n ret.bucket_range = {l_bucket_id + 1, r_bucket_id};\n }\n if (l == l_bucket_l) {\n if (ret.bucket_range) {\n ret.bucket_range->first--;\n } else {\n ret.bucket_range = {l_bucket_id, l_bucket_id + 1};\n }\n } else {\n ret.left_overflow_range = {l, l_bucket_r};\n }\n if (r == r_bucket_r) {\n if (ret.bucket_range) {\n ret.bucket_range->second++;\n } else {\n ret.bucket_range = {r_bucket_id, r_bucket_id + 1};\n }\n } else {\n ret.right_overflow_range = {r_bucket_l, r};\n }\n }\n return ret;\n }\n\n int bucket_id(int i) const {\n assert(0 <= i && i < n);\n return i / W;\n }\n\n pair<int, int> bucket_range(int i) const {\n assert(0 <= i && i < bucket_size());\n int l = i * W;\n int r = min((i + 1) * W, n);\n return {l, r};\n }\n};\n\nvoid solve() {\n constexpr ll INF = TEN(18);\n INT(N, Q);\n VEC(ll, A, N);\n\n SquareRootDecomposition<128> decomp(N);\n auto B = A;\n vec<ll> add(decomp.bucket_size(), 0);\n vec<ll> mn(decomp.bucket_size(), -INF);\n vec<ll> mx(decomp.bucket_size(), INF);\n // 足したあと切り詰める\n auto upd = [&](int k) {\n auto [l, r] = decomp.bucket_range(k);\n rep(i, l, r) A[i] += add[k];\n add[k] = 0;\n rep(i, l, r) A[i] = clamp(A[i], mn[k], mx[k]);\n rep(i, l, r) B[i] = A[i];\n sort(B.begin() + l, B.begin() + r);\n mn[k] = -INF;\n mx[k] = INF;\n };\n auto lazy = [&](int k, int t, ll x) {\n if (t == 1) {\n chmin(mn[k], x);\n chmin(mx[k], x);\n } else if (t == 2) {\n chmax(mn[k], x);\n chmax(mx[k], x);\n } else {\n add[k] += x;\n mn[k] += x;\n mx[k] += x;\n }\n };\n rep(i, decomp.bucket_size()) upd(i);\n rep(Q) {\n INT(t);\n if (t == 1) {\n LL(l, r, x);\n l--;\n auto ranges = decomp.query(l, r);\n if (ranges.left_overflow_range) {\n auto [p, q] = ranges.left_overflow_range.value();\n upd(decomp.bucket_id(p));\n rep(j, p, q) chmin(A[j], x);\n upd(decomp.bucket_id(p));\n }\n if (ranges.bucket_range) {\n auto [p, q] = ranges.bucket_range.value();\n rep(j, p, q) {\n lazy(j, t, x);\n }\n }\n if (ranges.right_overflow_range) {\n auto [p, q] = ranges.right_overflow_range.value();\n debug(p, q);\n upd(decomp.bucket_id(p));\n rep(j, p, q) chmin(A[j], x);\n upd(decomp.bucket_id(p));\n }\n } else if (t == 2) {\n LL(l, r, x);\n l--;\n auto ranges = decomp.query(l, r);\n if (ranges.left_overflow_range) {\n auto [p, q] = ranges.left_overflow_range.value();\n upd(decomp.bucket_id(p));\n rep(j, p, q) chmax(A[j], x);\n upd(decomp.bucket_id(p));\n }\n if (ranges.bucket_range) {\n auto [p, q] = ranges.bucket_range.value();\n rep(j, p, q) {\n lazy(j, t, x);\n }\n }\n if (ranges.right_overflow_range) {\n auto [p, q] = ranges.right_overflow_range.value();\n upd(decomp.bucket_id(p));\n rep(j, p, q) chmax(A[j], x);\n upd(decomp.bucket_id(p));\n }\n\n } else if (t == 3) {\n LL(l, r, x);\n l--;\n auto ranges = decomp.query(l, r);\n if (ranges.left_overflow_range) {\n auto [p, q] = ranges.left_overflow_range.value();\n upd(decomp.bucket_id(p));\n rep(j, p, q) A[j] += x;\n upd(decomp.bucket_id(p));\n }\n if (ranges.bucket_range) {\n auto [p, q] = ranges.bucket_range.value();\n rep(j, p, q) {\n lazy(j, t, x);\n }\n }\n if (ranges.right_overflow_range) {\n auto [p, q] = ranges.right_overflow_range.value();\n upd(decomp.bucket_id(p));\n rep(j, p, q) A[j] += x;\n upd(decomp.bucket_id(p));\n }\n\n } else {\n LL(l, r, x, y);\n l--;\n auto ranges = decomp.query(l, r);\n int ans = 0;\n if (ranges.left_overflow_range) {\n auto [p, q] = ranges.left_overflow_range.value();\n upd(decomp.bucket_id(p));\n rep(j, p, q) {\n if (x <= A[j] && A[j] <= y) ans++;\n }\n }\n if (ranges.bucket_range) {\n auto [p, q] = ranges.bucket_range.value();\n rep(j, p, q) {\n if (mn[j] > y || mx[j] < x) continue;\n auto [a, b] = decomp.bucket_range(j);\n int lb =\n lower_bound(B.begin() + a, B.begin() + b, x - add[j]) -\n B.begin();\n int ub =\n upper_bound(B.begin() + a, B.begin() + b, y - add[j]) -\n B.begin();\n if (mn[j] >= x) lb = a;\n if (mx[j] <= y) ub = b;\n ans += ub - lb;\n }\n }\n if (ranges.right_overflow_range) {\n auto [p, q] = ranges.right_overflow_range.value();\n upd(decomp.bucket_id(p));\n rep(j, p, q) {\n if (x <= A[j] && A[j] <= y) ans++;\n }\n }\n print(ans);\n }\n }\n}\n\nint main() {\n int T = 1;\n // cin >> T;\n for (int i = 0; i < T; i++) {\n solve();\n }\n}","accuracy":1,"time_ms":1320,"memory_kb":4684,"score_of_the_acc":-0.8469,"final_rank":10},{"submission_id":"aoj_3170_6377836","code_snippet":"// #pragma GCC optimize (\"O3\")\n// #pragma GCC target(\"avx512f\")\n// #pragma GCC optimize(\"unroll-loops\")\n// #ifndef ONLINE_JUDGE\n// #define _GLIBCXX_DEBUG\n// #endif\n#include<bits/stdc++.h>\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// #include <boost/rational.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint=mp::cpp_int;\n// using Real = mp::number<mp::cpp_dec_float<64>>;\n// #include<atcoder/all>\nusing namespace std;\n// using namespace atcoder;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rep1(n) for(ll i = 0; i < (n); ++i)\n#define rep2(i, n) for(ll i = 0; i < (n); ++i)\n#define rep3(i, a, b) for(ll i = (a); i < (b); ++i)\n#define rep4(i, a, b, c) for(ll i = (a); i < (b); i += (c))\n#define rrep(i, a, b) for(ll i = (b); i --> (a); )\nint scan(){ return getchar(); }\nvoid scan(int& a){ scanf(\"%d\", &a); }\nvoid scan(unsigned& a){ scanf(\"%u\", &a); }\nvoid scan(long long& a){ scanf(\"%lld\", &a); }\nvoid scan(unsigned long long& a){ scanf(\"%llu\", &a); }\nvoid scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\\n'); }\nvoid scan(float& a){ scanf(\"%f\", &a); }\nvoid scan(double& a){ scanf(\"%lf\", &a); }\nvoid scan(long double& a){ scanf(\"%Lf\", &a); }\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++) { int b; scan(b); a[i] = b; } }\nvoid scan(char a[]){ scanf(\"%s\", a); }\nvoid scan(string& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>&);\ntemplate<class T> void scan(deque<T>&);\ntemplate<class T, size_t size> void scan(array<T, size>&);\ntemplate<class T, class L> void scan(pair<T, L>&);\ntemplate<class T, size_t size> void scan(T(&)[size]);\ntemplate<class T> void scan(vector<T>& a){ for(auto& i : a) scan(i); }\ntemplate<class T> void scan(deque<T>& a){ for(auto& i : a) scan(i); }\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto& i : a) scan(i); }\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto& i : a) scan(i); }\ntemplate<class T> void scan(T& a){ cin >> a; }\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(unsigned a){ printf(\"%u\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(unsigned long long a){ printf(\"%llu\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(float a){ printf(\"%.15f\", a); }\nvoid print(double a){ printf(\"%.15f\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\ntemplate<class T> void print(const vector<T>&);\ntemplate<class T, size_t size> void print(const array<T, size>&);\ntemplate<class T, class L> void print(const pair<T, L>& p);\ntemplate<class T, size_t size> void print(const T (&)[size]);\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const T& a){ cout << a; }\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\n#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)\n#define VEC(type,name,size) vector<type> name(size); in(name)\n#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)\n#define bit(n,k) (((ll)n>>(ll)k)&1) /*nのk bit目*/\n#define pb push_back\n#define pf push_front\n#define fi first\n#define se second\n#define eb emplace_back\n#define endl '\\n'\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define debug(v) cout<<#v<<\":\";for(auto x:v){cout<<x<<' ';}cout<<endl;\n#define pi 3.14159265359\nconst double eps = 1e-12;\nconst long long INF= (long long)1e18+20;\nconst int inf= 1010101010;\ntypedef long double D; // 座標値の型。doubleかlong doubleを想定\ntypedef complex<D> Point; // Point\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl>vvl;\ntypedef vector<vvl>vvvl;\ntypedef vector<vvvl>vvvvl;\ntypedef vector<vvvvl>vvvvvl;\ntypedef vector<int>vi;\ntypedef vector<vi>vvi;\ntypedef vector<vvi>vvvi;\ntypedef vector<vvvi>vvvvi;\ntypedef vector<vvvvi>vvvvvi;\ntypedef pair<ll,ll> P;\n#define __builtin_popcount __builtin_popcountll\n// typedef double D; \ntemplate<class T> using minpq=priority_queue<T,vector<T>,greater<T>>;\n// const ll MOD=1000000007LL;\nconst ll MOD=998244353LL;\n// using mint=modint998244353;\n// using mint=modint1000000007;\n// using mint=modint;\n// typedef vector<mint> vm;\n// typedef vector<vector<mint> >vvm;\n// typedef vector<vector<vector<mint> > >vvvm;\n//上下右左\nvl dx={-1,1,0,0,1,1,-1,-1};\nvl dy={0,-0,1,-1,-1,1,-1,1};\n\n\ntemplate<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }\ntemplate<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {\n return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\n}\n\ntemplate<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\ntemplate<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}\ntemplate<class T> ll sum(const T& a){ return accumulate(all(a), 0LL); }\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\n\n//素因数分解O(√n)\nmap<ll,ll>prime_factor(ll n){\n map<ll,ll>res;\n for(ll i=2;i*i<=n;i++){\n while(n%i==0){\n res[i]++;\n n/=i;\n }\n }\n if(n!=1)res[n]=1;\n return res;\n}\n\nconst ll MAX = 5000010;//5*10^6\nlong long fac[MAX], finv[MAX], inv[MAX];\n//finvが階乗の逆元\n\n// テーブルを作る前処理\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (ll i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n\n// 二項係数計算\nlong long COM(ll n, ll k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\n\n//素数判定O(√n)\nbool is_prime(ll n){\n for(ll i=2;i*i<=n;i++){\n if(n%i==0)return false;\n }\n return n!=1;\n}\n\n//約数の列挙O(√n)\nvector<ll>divisor(ll n){\n vector<ll>res;\n for(ll i=1;i*i<=n;i++){\n if(n%i==0){\n res.push_back(i);\n if(i != n/i) res.push_back(n/i);\n }\n }\n return res;\n}\n\n\nll exp(ll n,ll r){\n if(r==0)return 1;\n return n*exp(n,r-1);\n}\n\nll factorial(int n){\n if(n==0)return 1;\n return n*factorial(n-1);\n}\n\n\npair<long long,long long>roop_search(vl next_index,ll first_point){\n\tll idx=first_point;\n\tmap<ll,ll>mp;\n\tmp[idx]=0;\n\tll cur=1;\n\tll roop_begin=-1;\n\tll roop_size=-1;\n\twhile(true){\n\t\tidx=next_index[idx];\n\t\tif(mp.count(idx)){\n\t\t\troop_begin=mp[idx];\n\t\t\troop_size=cur-roop_begin;\n\t\t\tbreak;\n\t\t}\n\t\tmp[idx]=cur++;\n\t}\n\treturn {roop_begin,roop_size};\n}\n\n\ntemplate< typename T >\nstruct Compress {\n vector< T > xs;\n\n Compress() = default;\n\n Compress(const vector< T > &vs) {\n add(vs);\n }\n\n Compress(const initializer_list< vector< T > > &vs) {\n for(auto &p : vs) add(p);\n }\n\n void add(const vector< T > &vs) {\n copy(begin(vs), end(vs), back_inserter(xs));\n }\n\n void add(const T &x) {\n xs.emplace_back(x);\n }\n\n void build() {\n sort(begin(xs), end(xs));\n xs.erase(unique(begin(xs), end(xs)), end(xs));\n }\n\n vector< int > get(const vector< T > &vs) const {\n vector< int > ret;\n transform(begin(vs), end(vs), back_inserter(ret), [&](const T &x) {\n return lower_bound(begin(xs), end(xs), x) - begin(xs);\n });\n return ret;\n }\n\n int get(const T &x) const {\n return lower_bound(begin(xs), end(xs), x) - begin(xs);\n }\n\n const T &operator[](int k) const {\n return xs[k];\n }\n};\n\n\ntemplate<class T>\nvoid rotate90(ll &h,ll &w,vector<vector<T>>&vec){\n vector<vector<T>>vec2(w,vector<T>(h));\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n vec2[j][h-1-i]=vec[i][j];\n }\n }\n vec=vec2;\n swap(h,w);\n}\n\nstruct RandomNumberGenerator {\n mt19937 mt;\n\n RandomNumberGenerator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}\n\n int operator()(int a, int b) { // [a, b)\n uniform_int_distribution< int > dist(a, b - 1);\n return dist(mt);\n }\n\n int operator()(int b) { // [0, b)\n return (*this)(0, b);\n }\n};\n\n\n\nint main(){\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(12);\n //主客転倒！二重和のときは一番内側の物が何回使われるか\n //√Nで分けるテク\n //絶対値は外して2通りの式にした後、変数ごとにまとめる\n //組み合わせが少ないそうなものはdfsで実行してみる（典型25）\n //DはDPのD\n //pow_mod,prime_factor,divisor,is_prime\n // g++ -fsanitize=undefined code.cpp -I.\n // valgrind ./a.out\n /*--------------------------------*/\n\n ll n,q;cin>>n>>q;\n vl a(n);\n rep(i,n)cin>>a[i];\n \n ll b=ceil(sqrt(n));//パケットのサイズ\n ll cnt=(n+b-1)/b;//パケットの個数\n \n vector<tuple<ll,ll,ll>>vec(cnt,{INF,-INF,0});//遅延評価するminmaxadd\n vvl sort_vec(cnt);//パケットごとにソート\n rep(i,n){\n sort_vec[i/b].pb(a[i]);\n }\n rep(i,b)sort(all(sort_vec));\n \n //両端の愚直更新\n auto f=[&](ll l,ll r,ll c1,ll b1,ll a1)->void{\n //l,rの属するパケットを遅延評価\n ll num=r/b;//numがパケットの番号\n ll dmin,dmax,dadd;\n tie(dmin,dmax,dadd)=vec[num];\n for(ll i=num*b;i<(num+1)*b;i++){\n a[i]+=dadd;\n chmax(a[i],dmax); \n chmin(a[i],dmin); \n }\n vec[num]={INF,-INF,0};\n for(ll i=l;i<=r;i++){\n a[i]+=a1;\n chmax(a[i],b1);\n chmin(a[i],c1);\n }\n vl new_sort_vec;\n for(ll i=num*b;i<(num+1)*b;i++){\n new_sort_vec.pb(a[i]);\n }\n sort(all(new_sort_vec));\n sort_vec[num]=new_sort_vec;\n };\n\n //パケット更新\n auto f2=[&](ll num,ll c2,ll b2,ll a2)->void{\n //numはパケット番号\n ll c1,b1,a1;\n tie(c1,b1,a1)=vec[num];\n ll na=a1+a2;\n ll nb=max(b2,min(c1+a2,b1+a2));\n ll nc=min(c2,max(b2,c1+a2));\n vec[num]={nc,nb,na};\n };\n\n //両端の愚直取得\n auto f3=[&](ll l,ll r,ll x)->ll {\n //l,rの属するパケットを遅延評価\n ll num=r/b;//numがパケットの番号\n ll dmin,dmax,dadd;\n tie(dmin,dmax,dadd)=vec[num];\n for(ll i=num*b;i<(num+1)*b;i++){\n a[i]+=dadd;\n chmax(a[i],dmax); \n chmin(a[i],dmin); \n }\n // if(l==8 and r==9 and (x==-10||x==1)){\n // cout<<\"OK\"<<endl;\n // cout<<a[8]<<\" \"<<a[9]<<endl;\n // }\n\n vec[num]={INF,-INF,0};\n vl new_sort_vec;\n for(ll i=num*b;i<(num+1)*b;i++){\n new_sort_vec.pb(a[i]);\n }\n sort(all(new_sort_vec));\n sort_vec[num]=new_sort_vec;\n \n //x以上の個数を取得\n \n ll res=0;\n for(ll i=l;i<=r;i++){\n if(a[i]>=x)res++;\n }\n return res;\n };\n \n //パケット取得\n auto f4=[&](ll num,ll x)->ll{\n //パケット番号numにおいて、x以上の個数\n ll c1,b1,a1;\n tie(c1,b1,a1)=vec[num];\n if(x>c1)return 0;\n if(x<=b1)return sort_vec[num].size();\n ll nx=x-a1;\n //sort_vecの中でnx以上の個数を求めればよい\n ll res=sort_vec[num].size();\n res-=lower_bound(all(sort_vec[num]),nx)-sort_vec[num].begin();\n return res;\n };\n\n while(q--){\n ll t;cin>>t;\n // debug(a);\n if(t==1){\n //chminクエリ\n ll l,r,x;cin>>l>>r>>x;\n l--;r--;\n if(l%b!=0){\n //左端愚直更新発生\n if((l+b-1)/b*b-1<=r){\n f(l,(l+b-1)/b*b-1,x,-INF,0);\n l=(l+b-1)/b*b;\n }\n else {\n f(l,r,x,-INF,0);\n l=r+1;\n }\n }\n if(r%b!=b-1){\n //右端愚直更新発生\n if(l<=r/b*b)f(r/b*b,r,x,-INF,0);\n r=r/b*b-1;\n }\n if(l<=r){\n for(ll i=l/b;i<=r/b;i++){\n //パケット更新\n f2(i,x,-INF,0);\n }\n }\n }\n if(t==2){\n //chmaxクエリ\n ll l,r,x;cin>>l>>r>>x;\n l--;r--;\n \n if(l%b!=0){\n //左端愚直更新発生\n if((l+b-1)/b*b-1<=r){\n f(l,(l+b-1)/b*b-1,INF,x,0);\n l=(l+b-1)/b*b;\n }\n else {\n f(l,r,INF,x,0);\n l=r+1;\n }\n }\n // if(check)cout<<l<<\" \"<<r<<endl;\n if(r%b!=b-1){\n //右端愚直更新発生\n if(l<=r/b*b)f(r/b*b,r,INF,x,0);\n r=r/b*b-1;\n }\n // if(check)cout<<l<<\" \"<<r<<endl;\n if(l<=r){\n for(ll i=l/b;i<=r/b;i++){\n //パケット更新\n f2(i,INF,x,0);\n }\n }\n // if(check)cout<<l<<\" \"<<r<<endl;\n }\n if(t==3){\n //addクエリ\n ll l,r,x;cin>>l>>r>>x;\n l--;r--;\n if(l%b!=0){\n //左端愚直更新発生\n if((l+b-1)/b*b-1<=r){\n f(l,(l+b-1)/b*b-1,INF,-INF,x);\n l=(l+b-1)/b*b;\n }\n else {\n f(l,r,INF,-INF,x);\n l=r+1;\n }\n }\n if(r%b!=b-1){\n //右端愚直更新発生\n if(l<=r/b*b)f(r/b*b,r,INF,-INF,x);\n r=r/b*b-1;\n }\n if(l<=r){\n for(ll i=l/b;i<=r/b;i++){\n //パケット更新\n f2(i,INF,-INF,x);\n }\n }\n }\n if(t==4){\n //取得クエリ\n ll l,r,x,y;cin>>l>>r>>x>>y;\n l--;r--;\n bool check=false;\n if(r==8){\n check=true;\n // debug(a);\n }\n // cout<<b<<endl;\n ll ans=0;\n if(l%b!=0){\n //左端愚直更新発生\n //x以上からy+1以上を引けばよい\n if((l+b-1)/b*b-1<=r){\n ans+=f3(l,(l+b-1)/b*b-1,x);\n ans-=f3(l,(l+b-1)/b*b-1,y+1);\n l=(l+b-1)/b*b;\n }\n else {\n ans+=f3(l,r,x);\n ans-=f3(l,r,y+1);\n l=r+1;\n }\n }\n // if(check)cout<<ans<<\" \"<<l<<\" \"<<r<<endl;\n if(r%b!=b-1){\n //右端愚直更新発生\n if(l<=r/b*b){\n ans+=f3(r/b*b,r,x);\n //引く方がホントは1になるはず\n // cout<<f3(r/b*b,r,x)<<\" \"<<f3(r/b*b,r,y+1)<<endl;\n ans-=f3(r/b*b,r,y+1);\n }\n r=r/b*b-1;\n }\n // if(check)cout<<ans<<\" \"<<l<<\" \"<<r<<endl;\n \n // if(l>r){\n // cout<<ans<<endl;\n // continue;\n // }\n // cout<<ans<<\" \"<<l<<\" \"<<r<<endl;\n if(l<=r){\n for(ll i=l/b;i<=r/b;i++){\n //パケット更新\n // if(l==0 and r==7){\n // cout<<\"OK\"<<endl;\n \n // }\n // if(check)cout<<i<<endl;\n ans+=f4(i,x);\n // cout<<ans<<endl;\n ans-=f4(i,y+1);\n // cout<<ans<<endl;\n }\n }\n cout<<ans<<endl;\n }\n // debug(a);\n // cout<<get<0>(vec[0])<<\" \"<<get<1>(vec[0])<<\" \"<<get<2>(vec[0])<<endl;\n // debug(a);\n }\n\n}","accuracy":0.09523809523809523,"time_ms":140,"memory_kb":5152,"score_of_the_acc":-0.141,"final_rank":16},{"submission_id":"aoj_3170_5454384","code_snippet":"#line 1 \"test/aizu-online-judge/3170.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3170\"\n\n#include <algorithm>\n#include <cstdio>\n\n#line 2 \"src/data_structure/buckets.hpp\"\n\n/**\n * @file buckets.hpp\n * @brief Buckets\n */\n\n#include <cmath>\n#include <vector>\n\nnamespace workspace {\n\n/**\n * @brief Buckets on a sequence.\n */\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\n // Require random access.\n static_assert(\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\n std::random_access_iterator_tag>::value);\n\n using difference_type =\n typename std::iterator_traits<_Iterator>::difference_type;\n\n _Iterator __begin, __end;\n\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\n std::declval<_Iterator>()));\n\n struct bucket {\n value_type __data;\n _Iterator __begin;\n _Iterator __end;\n };\n\n _Pack __pack;\n _Unpack __unpack;\n difference_type __unit;\n std::vector<bucket> __buckets;\n\n void prepare() {\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\n\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\n __buckets.push_back({__pack(__l, __r), __l, __r});\n }\n }\n\n public:\n /**\n * @brief Constuct a new buckets object.\n */\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\n difference_type __unit = 0)\n : __begin(__first),\n __end(__last),\n __pack(__pack),\n __unpack(__unpack),\n __unit(__unit) {\n prepare();\n }\n\n /**\n * @brief Number of buckets.\n */\n auto size() const { return __buckets.size(); }\n\n bool empty() const { return __begin == __end; }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __first\n * @param __last\n * @param __oper\n */\n template <class _Operator>\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\n if (__first == __last) return;\n\n auto __index = std::distance(__begin, __first);\n auto __b = std::next(__buckets.begin(), __index / __unit);\n\n if (__index % __unit) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\n\n auto __tmp = __pack(__first, __mid);\n __oper(__tmp);\n __unpack(__tmp, __first, __mid);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n ++__b;\n }\n\n while (true) {\n if (__b == __buckets.end()) return;\n if (std::distance(__b->__end, __last) < 0) break;\n\n __oper(__b->__data);\n ++__b;\n }\n\n if (std::distance(__b->__begin, __last) > 0) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __tmp = __pack(__b->__begin, __last);\n __oper(__tmp);\n __unpack(__tmp, __b->__begin, __last);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n }\n }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __i\n * @param __j\n * @param __oper\n */\n template <class _Operator>\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\n }\n};\n\n} // namespace workspace\n#line 7 \"test/aizu-online-judge/3170.test.cpp\"\n\nint main() {\n using namespace workspace;\n using i64 = int64_t;\n\n int n, q;\n scanf(\"%d%d\", &n, &q);\n std::vector<i64> a(n);\n for (auto&& x : a) {\n scanf(\"%lld\", &x);\n }\n\n struct data {\n i64 min, max, add;\n std::vector<i64> v;\n };\n\n constexpr auto inf = __INT64_MAX__;\n\n buckets b(\n begin(a), end(a),\n [](auto l, auto r) {\n data d;\n d.add = 0;\n d.min = inf;\n d.max = -inf;\n d.v = std::vector(l, r);\n sort(d.v.begin(), d.v.end());\n return d;\n },\n [](const auto& d, auto l, auto r) {\n while (l != r) {\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\n ++l;\n }\n },\n 128);\n\n for (int t, l, r; q--;) {\n i64 x, y;\n scanf(\"%d%d%d%lld\", &t, &l, &r, &x);\n --l;\n\n switch (--t) {\n case 0:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.min < c) return;\n d.min = c;\n if (d.max > c) d.max = c;\n });\n break;\n\n case 1:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.max > c) return;\n d.max = c;\n if (d.min < c) d.min = c;\n });\n break;\n\n case 2:\n b(l, r, [&](auto& d) { d.add += x; });\n break;\n\n case 3:\n scanf(\"%lld\", &y);\n int num = 0;\n b(l, r, [&](const auto& d) {\n int sign = 1;\n for (auto z : {x - 1 - d.add, y - d.add}) {\n sign *= -1;\n if (z < d.max) continue;\n if (z < d.min)\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\n d.v.begin());\n else\n num += sign * (int)d.v.size();\n }\n });\n printf(\"%d\\n\", num);\n break;\n }\n }\n}","accuracy":1,"time_ms":1200,"memory_kb":4160,"score_of_the_acc":-0.7013,"final_rank":3},{"submission_id":"aoj_3170_5454380","code_snippet":"#line 1 \"test/aizu-online-judge/3170.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3170\"\n\n#include <algorithm>\n#include <cstdio>\n\n#line 2 \"src/data_structure/buckets.hpp\"\n\n/**\n * @file buckets.hpp\n * @brief Buckets\n */\n\n#include <cmath>\n#include <vector>\n\nnamespace workspace {\n\n/**\n * @brief Buckets on a sequence.\n */\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\n // Require random access.\n static_assert(\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\n std::random_access_iterator_tag>::value);\n\n using difference_type =\n typename std::iterator_traits<_Iterator>::difference_type;\n\n _Iterator __begin, __end;\n\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\n std::declval<_Iterator>()));\n\n struct bucket {\n value_type __data;\n _Iterator __begin;\n _Iterator __end;\n };\n\n _Pack __pack;\n _Unpack __unpack;\n difference_type __unit;\n std::vector<bucket> __buckets;\n\n void prepare() {\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\n\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\n __buckets.push_back({__pack(__l, __r), __l, __r});\n }\n }\n\n public:\n /**\n * @brief Constuct a new buckets object.\n */\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\n difference_type __unit = 0)\n : __begin(__first),\n __end(__last),\n __pack(__pack),\n __unpack(__unpack),\n __unit(__unit) {\n prepare();\n }\n\n /**\n * @brief Number of buckets.\n */\n auto size() const { return __buckets.size(); }\n\n bool empty() const { return __begin == __end; }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __first\n * @param __last\n * @param __oper\n */\n template <class _Operator>\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\n if (__first == __last) return;\n\n auto __index = std::distance(__begin, __first);\n auto __b = std::next(__buckets.begin(), __index / __unit);\n\n if (__index % __unit) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\n\n auto __tmp = __pack(__first, __mid);\n __oper(__tmp);\n __unpack(__tmp, __first, __mid);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n ++__b;\n }\n\n while (true) {\n if (__b == __buckets.end()) return;\n if (std::distance(__b->__end, __last) < 0) break;\n\n __oper(__b->__data);\n ++__b;\n }\n\n if (std::distance(__b->__begin, __last) > 0) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __tmp = __pack(__b->__begin, __last);\n __oper(__tmp);\n __unpack(__tmp, __b->__begin, __last);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n }\n }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __i\n * @param __j\n * @param __oper\n */\n template <class _Operator>\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\n }\n};\n\n} // namespace workspace\n#line 7 \"test/aizu-online-judge/3170.test.cpp\"\n\nint main() {\n using namespace workspace;\n using i64 = int64_t;\n\n int n, q;\n scanf(\"%d%d\", &n, &q);\n std::vector<i64> a(n);\n for (auto&& x : a) {\n scanf(\"%lld\", &x);\n }\n\n struct data {\n i64 min, max, add;\n std::vector<i64> v;\n };\n\n constexpr auto inf = __INT64_MAX__;\n\n buckets b(\n begin(a), end(a),\n [](auto l, auto r) {\n data d;\n d.add = 0;\n d.min = inf;\n d.max = -inf;\n d.v = std::vector(l, r);\n sort(d.v.begin(), d.v.end());\n return d;\n },\n [](const auto& d, auto l, auto r) {\n while (l != r) {\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\n ++l;\n }\n },\n 100);\n\n for (int t, l, r; q--;) {\n i64 x, y;\n scanf(\"%d%d%d%lld\", &t, &l, &r, &x);\n --l;\n\n switch (--t) {\n case 0:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.min < c) return;\n d.min = c;\n if (d.max > c) d.max = c;\n });\n break;\n\n case 1:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.max > c) return;\n d.max = c;\n if (d.min < c) d.min = c;\n });\n break;\n\n case 2:\n b(l, r, [&](auto& d) { d.add += x; });\n break;\n\n case 3:\n scanf(\"%lld\", &y);\n int num = 0;\n b(l, r, [&](const auto& d) {\n int sign = 1;\n for (auto z : {x - 1 - d.add, y - d.add}) {\n sign *= -1;\n if (z < d.max) continue;\n if (z < d.min)\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\n d.v.begin());\n else\n num += sign * (int)d.v.size();\n }\n });\n printf(\"%d\\n\", num);\n break;\n }\n }\n}","accuracy":1,"time_ms":1090,"memory_kb":4196,"score_of_the_acc":-0.6345,"final_rank":2},{"submission_id":"aoj_3170_5454377","code_snippet":"#line 1 \"test/aizu-online-judge/3170.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3170\"\n\n#include <algorithm>\n#include <cstdio>\n\n#line 2 \"src/data_structure/buckets.hpp\"\n\n/**\n * @file buckets.hpp\n * @brief Buckets\n */\n\n#include <cmath>\n#include <vector>\n\nnamespace workspace {\n\n/**\n * @brief Buckets on a sequence.\n */\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\n // Require random access.\n static_assert(\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\n std::random_access_iterator_tag>::value);\n\n using difference_type =\n typename std::iterator_traits<_Iterator>::difference_type;\n\n _Iterator __begin, __end;\n\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\n std::declval<_Iterator>()));\n\n struct bucket {\n value_type __data;\n _Iterator __begin;\n _Iterator __end;\n };\n\n _Pack __pack;\n _Unpack __unpack;\n difference_type __unit;\n std::vector<bucket> __buckets;\n\n void prepare() {\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\n\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\n __buckets.push_back({__pack(__l, __r), __l, __r});\n }\n }\n\n public:\n /**\n * @brief Constuct a new buckets object.\n */\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\n difference_type __unit = 0)\n : __begin(__first),\n __end(__last),\n __pack(__pack),\n __unpack(__unpack),\n __unit(__unit) {\n prepare();\n }\n\n /**\n * @brief Number of buckets.\n */\n auto size() const { return __buckets.size(); }\n\n bool empty() const { return __begin == __end; }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __first\n * @param __last\n * @param __oper\n */\n template <class _Operator>\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\n if (__first == __last) return;\n\n auto __index = std::distance(__begin, __first);\n auto __b = std::next(__buckets.begin(), __index / __unit);\n\n if (__index % __unit) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\n\n auto __tmp = __pack(__first, __mid);\n __oper(__tmp);\n __unpack(__tmp, __first, __mid);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n ++__b;\n }\n\n while (true) {\n if (__b == __buckets.end()) return;\n if (std::distance(__b->__end, __last) < 0) break;\n\n __oper(__b->__data);\n ++__b;\n }\n\n if (std::distance(__b->__begin, __last) > 0) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __tmp = __pack(__b->__begin, __last);\n __oper(__tmp);\n __unpack(__tmp, __b->__begin, __last);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n }\n }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __i\n * @param __j\n * @param __oper\n */\n template <class _Operator>\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\n }\n};\n\n} // namespace workspace\n#line 7 \"test/aizu-online-judge/3170.test.cpp\"\n\nint main() {\n using namespace workspace;\n using i64 = int64_t;\n\n int n, q;\n scanf(\"%d%d\", &n, &q);\n std::vector<i64> a(n);\n for (auto&& x : a) {\n scanf(\"%lld\", &x);\n }\n\n struct data {\n i64 min, max, add;\n std::vector<i64> v;\n };\n\n constexpr auto inf = __INT64_MAX__;\n\n buckets b(\n begin(a), end(a),\n [](auto l, auto r) {\n data d;\n d.add = 0;\n d.min = inf;\n d.max = -inf;\n d.v = std::vector(l, r);\n sort(d.v.begin(), d.v.end());\n return d;\n },\n [](const auto& d, auto l, auto r) {\n while (l != r) {\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\n ++l;\n }\n },\n 30);\n\n for (int t, l, r; q--;) {\n i64 x, y;\n scanf(\"%d%d%d%lld\", &t, &l, &r, &x);\n --l;\n\n switch (--t) {\n case 0:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.min < c) return;\n d.min = c;\n if (d.max > c) d.max = c;\n });\n break;\n\n case 1:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.max > c) return;\n d.max = c;\n if (d.min < c) d.min = c;\n });\n break;\n\n case 2:\n b(l, r, [&](auto& d) { d.add += x; });\n break;\n\n case 3:\n scanf(\"%lld\", &y);\n int num = 0;\n b(l, r, [&](const auto& d) {\n int sign = 1;\n for (auto z : {x - 1 - d.add, y - d.add}) {\n sign *= -1;\n if (z < d.max) continue;\n if (z < d.min)\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\n d.v.begin());\n else\n num += sign * (int)d.v.size();\n }\n });\n printf(\"%d\\n\", num);\n break;\n }\n }\n}","accuracy":1,"time_ms":1210,"memory_kb":4404,"score_of_the_acc":-0.7393,"final_rank":4},{"submission_id":"aoj_3170_5454376","code_snippet":"#line 1 \"test/aizu-online-judge/3170.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3170\"\n\n#include <algorithm>\n#include <cstdio>\n\n#line 2 \"src/data_structure/buckets.hpp\"\n\n/**\n * @file buckets.hpp\n * @brief Buckets\n */\n\n#include <cmath>\n#include <vector>\n\nnamespace workspace {\n\n/**\n * @brief Buckets on a sequence.\n */\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\n // Require random access.\n static_assert(\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\n std::random_access_iterator_tag>::value);\n\n using difference_type =\n typename std::iterator_traits<_Iterator>::difference_type;\n\n _Iterator __begin, __end;\n\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\n std::declval<_Iterator>()));\n\n struct bucket {\n value_type __data;\n _Iterator __begin;\n _Iterator __end;\n };\n\n _Pack __pack;\n _Unpack __unpack;\n difference_type __unit;\n std::vector<bucket> __buckets;\n\n void prepare() {\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\n\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\n __buckets.push_back({__pack(__l, __r), __l, __r});\n }\n }\n\n public:\n /**\n * @brief Constuct a new buckets object.\n */\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\n difference_type __unit = 0)\n : __begin(__first),\n __end(__last),\n __pack(__pack),\n __unpack(__unpack),\n __unit(__unit) {\n prepare();\n }\n\n /**\n * @brief Number of buckets.\n */\n auto size() const { return __buckets.size(); }\n\n bool empty() const { return __begin == __end; }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __first\n * @param __last\n * @param __oper\n */\n template <class _Operator>\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\n if (__first == __last) return;\n\n auto __index = std::distance(__begin, __first);\n auto __b = std::next(__buckets.begin(), __index / __unit);\n\n if (__index % __unit) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\n\n auto __tmp = __pack(__first, __mid);\n __oper(__tmp);\n __unpack(__tmp, __first, __mid);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n ++__b;\n }\n\n while (true) {\n if (__b == __buckets.end()) return;\n if (std::distance(__b->__end, __last) < 0) break;\n\n __oper(__b->__data);\n ++__b;\n }\n\n if (std::distance(__b->__begin, __last) > 0) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __tmp = __pack(__b->__begin, __last);\n __oper(__tmp);\n __unpack(__tmp, __b->__begin, __last);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n }\n }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __i\n * @param __j\n * @param __oper\n */\n template <class _Operator>\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\n }\n};\n\n} // namespace workspace\n#line 7 \"test/aizu-online-judge/3170.test.cpp\"\n\nint main() {\n using namespace workspace;\n using i64 = int64_t;\n\n int n, q;\n scanf(\"%d%d\", &n, &q);\n std::vector<i64> a(n);\n for (auto&& x : a) {\n scanf(\"%lld\", &x);\n }\n\n struct data {\n i64 min, max, add;\n std::vector<i64> v;\n };\n\n constexpr auto inf = __INT64_MAX__;\n\n buckets b(\n begin(a), end(a),\n [](auto l, auto r) {\n data d;\n d.add = 0;\n d.min = inf;\n d.max = -inf;\n d.v = std::vector(l, r);\n sort(d.v.begin(), d.v.end());\n return d;\n },\n [](const auto& d, auto l, auto r) {\n while (l != r) {\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\n ++l;\n }\n },\n 50);\n\n for (int t, l, r; q--;) {\n i64 x, y;\n scanf(\"%d%d%d%lld\", &t, &l, &r, &x);\n --l;\n\n switch (--t) {\n case 0:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.min < c) return;\n d.min = c;\n if (d.max > c) d.max = c;\n });\n break;\n\n case 1:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.max > c) return;\n d.max = c;\n if (d.min < c) d.min = c;\n });\n break;\n\n case 2:\n b(l, r, [&](auto& d) { d.add += x; });\n break;\n\n case 3:\n scanf(\"%lld\", &y);\n int num = 0;\n b(l, r, [&](const auto& d) {\n int sign = 1;\n for (auto z : {x - 1 - d.add, y - d.add}) {\n sign *= -1;\n if (z < d.max) continue;\n if (z < d.min)\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\n d.v.begin());\n else\n num += sign * (int)d.v.size();\n }\n });\n printf(\"%d\\n\", num);\n break;\n }\n }\n}","accuracy":1,"time_ms":990,"memory_kb":4384,"score_of_the_acc":-0.5938,"final_rank":1},{"submission_id":"aoj_3170_5454371","code_snippet":"#line 1 \"test/aizu-online-judge/3170.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3170\"\n\n#include <algorithm>\n#include <cstdio>\n\n#line 2 \"src/data_structure/buckets.hpp\"\n\n/**\n * @file buckets.hpp\n * @brief Buckets\n */\n\n#include <cmath>\n#include <vector>\n\nnamespace workspace {\n\n/**\n * @brief Buckets on a sequence.\n */\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\n // Require random access.\n static_assert(\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\n std::random_access_iterator_tag>::value);\n\n using difference_type =\n typename std::iterator_traits<_Iterator>::difference_type;\n\n _Iterator __begin, __end;\n\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\n std::declval<_Iterator>()));\n\n struct bucket {\n value_type __data;\n _Iterator __begin;\n _Iterator __end;\n };\n\n _Pack __pack;\n _Unpack __unpack;\n difference_type __unit;\n std::vector<bucket> __buckets;\n\n void prepare() {\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\n\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\n __buckets.push_back({__pack(__l, __r), __l, __r});\n }\n }\n\n public:\n /**\n * @brief Constuct a new buckets object.\n */\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\n difference_type __unit = 0)\n : __begin(__first),\n __end(__last),\n __pack(__pack),\n __unpack(__unpack),\n __unit(__unit) {\n prepare();\n }\n\n /**\n * @brief Number of buckets.\n */\n auto size() const { return __buckets.size(); }\n\n bool empty() const { return __begin == __end; }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __first\n * @param __last\n * @param __oper\n */\n template <class _Operator>\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\n if (__first == __last) return;\n\n auto __index = std::distance(__begin, __first);\n auto __b = std::next(__buckets.begin(), __index / __unit);\n\n if (__index % __unit) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\n\n auto __tmp = __pack(__first, __mid);\n __oper(__tmp);\n __unpack(__tmp, __first, __mid);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n ++__b;\n }\n\n while (true) {\n if (__b == __buckets.end()) return;\n if (std::distance(__b->__end, __last) < 0) break;\n\n __oper(__b->__data);\n ++__b;\n }\n\n if (std::distance(__b->__begin, __last) > 0) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __tmp = __pack(__b->__begin, __last);\n __oper(__tmp);\n __unpack(__tmp, __b->__begin, __last);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n }\n }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __i\n * @param __j\n * @param __oper\n */\n template <class _Operator>\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\n }\n};\n\n} // namespace workspace\n#line 7 \"test/aizu-online-judge/3170.test.cpp\"\n\nint main() {\n using namespace workspace;\n using i64 = int64_t;\n\n int n, q;\n scanf(\"%d%d\", &n, &q);\n std::vector<i64> a(n);\n for (auto&& x : a) {\n scanf(\"%lld\", &x);\n }\n\n struct data {\n i64 min, max, add;\n std::vector<i64> v;\n };\n\n constexpr auto inf = __INT64_MAX__;\n\n buckets b(\n begin(a), end(a),\n [](auto l, auto r) {\n data d;\n d.add = 0;\n d.min = inf;\n d.max = -inf;\n d.v = std::vector(l, r);\n sort(d.v.begin(), d.v.end());\n return d;\n },\n [](const auto& d, auto l, auto r) {\n while (l != r) {\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\n ++l;\n }\n },\n 150);\n\n for (int t, l, r; q--;) {\n i64 x, y;\n scanf(\"%d%d%d%lld\", &t, &l, &r, &x);\n --l;\n\n switch (--t) {\n case 0:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.min < c) return;\n d.min = c;\n if (d.max > c) d.max = c;\n });\n break;\n\n case 1:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.max > c) return;\n d.max = c;\n if (d.min < c) d.min = c;\n });\n break;\n\n case 2:\n b(l, r, [&](auto& d) { d.add += x; });\n break;\n\n case 3:\n scanf(\"%lld\", &y);\n int num = 0;\n b(l, r, [&](const auto& d) {\n int sign = 1;\n for (auto z : {x - 1 - d.add, y - d.add}) {\n sign *= -1;\n if (z < d.max) continue;\n if (z < d.min)\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\n d.v.begin());\n else\n num += sign * (int)d.v.size();\n }\n });\n printf(\"%d\\n\", num);\n break;\n }\n }\n}","accuracy":1,"time_ms":1350,"memory_kb":4196,"score_of_the_acc":-0.8033,"final_rank":9},{"submission_id":"aoj_3170_5454366","code_snippet":"#line 1 \"test/aizu-online-judge/3170.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3170\"\n\n#include <algorithm>\n#include <cstdio>\n\n#line 2 \"src/data_structure/buckets.hpp\"\n\n/**\n * @file buckets.hpp\n * @brief Buckets\n */\n\n#include <cmath>\n#include <vector>\n\nnamespace workspace {\n\n/**\n * @brief Buckets on a sequence.\n */\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\n // Require random access.\n static_assert(\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\n std::random_access_iterator_tag>::value);\n\n using difference_type =\n typename std::iterator_traits<_Iterator>::difference_type;\n\n _Iterator __begin, __end;\n\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\n std::declval<_Iterator>()));\n\n struct bucket {\n value_type __data;\n _Iterator __begin;\n _Iterator __end;\n };\n\n _Pack __pack;\n _Unpack __unpack;\n difference_type __unit;\n std::vector<bucket> __buckets;\n\n void prepare() {\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\n\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\n __buckets.push_back({__pack(__l, __r), __l, __r});\n }\n }\n\n public:\n /**\n * @brief Constuct a new buckets object.\n */\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\n difference_type __unit = 0)\n : __begin(__first),\n __end(__last),\n __pack(__pack),\n __unpack(__unpack),\n __unit(__unit) {\n prepare();\n }\n\n /**\n * @brief Number of buckets.\n */\n auto size() const { return __buckets.size(); }\n\n bool empty() const { return __begin == __end; }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __first\n * @param __last\n * @param __oper\n */\n template <class _Operator>\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\n if (__first == __last) return;\n\n auto __index = std::distance(__begin, __first);\n auto __b = std::next(__buckets.begin(), __index / __unit);\n\n if (__index % __unit) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\n\n auto __tmp = __pack(__first, __mid);\n __oper(__tmp);\n __unpack(__tmp, __first, __mid);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n ++__b;\n }\n\n while (true) {\n if (__b == __buckets.end()) return;\n if (std::distance(__b->__end, __last) < 0) break;\n\n __oper(__b->__data);\n ++__b;\n }\n\n if (std::distance(__b->__begin, __last) > 0) {\n __unpack(__b->__data, __b->__begin, __b->__end);\n\n auto __tmp = __pack(__b->__begin, __last);\n __oper(__tmp);\n __unpack(__tmp, __b->__begin, __last);\n\n __b->__data = __pack(__b->__begin, __b->__end);\n }\n }\n\n /**\n * @brief Operate on a subsegment.\n *\n * @param __i\n * @param __j\n * @param __oper\n */\n template <class _Operator>\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\n }\n};\n\n} // namespace workspace\n#line 7 \"test/aizu-online-judge/3170.test.cpp\"\n\nint main() {\n using namespace workspace;\n using i64 = int64_t;\n\n int n, q;\n scanf(\"%d%d\", &n, &q);\n std::vector<i64> a(n);\n for (auto&& x : a) {\n scanf(\"%lld\", &x);\n }\n\n struct data {\n i64 min, max, add;\n std::vector<i64> v;\n };\n\n constexpr auto inf = __INT64_MAX__;\n\n buckets b(\n begin(a), end(a),\n [](auto l, auto r) {\n data d;\n d.add = 0;\n d.min = inf;\n d.max = -inf;\n d.v = std::vector(l, r);\n sort(d.v.begin(), d.v.end());\n return d;\n },\n [](const auto& d, auto l, auto r) {\n while (l != r) {\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\n ++l;\n }\n },\n 200);\n\n for (int t, l, r; q--;) {\n i64 x, y;\n scanf(\"%d%d%d%lld\", &t, &l, &r, &x);\n --l;\n\n switch (--t) {\n case 0:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.min < c) return;\n d.min = c;\n if (d.max > c) d.max = c;\n });\n break;\n\n case 1:\n b(l, r, [&](auto& d) {\n auto c = x - d.add;\n if (d.max > c) return;\n d.max = c;\n if (d.min < c) d.min = c;\n });\n break;\n\n case 2:\n b(l, r, [&](auto& d) { d.add += x; });\n break;\n\n case 3:\n scanf(\"%lld\", &y);\n int num = 0;\n b(l, r, [&](const auto& d) {\n int sign = 1;\n for (auto z : {x - 1 - d.add, y - d.add}) {\n sign *= -1;\n if (z < d.max) continue;\n if (z < d.min)\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\n d.v.begin());\n else\n num += sign * (int)d.v.size();\n }\n });\n printf(\"%d\\n\", num);\n break;\n }\n }\n}","accuracy":1,"time_ms":1660,"memory_kb":4432,"score_of_the_acc":-1.0351,"final_rank":12},{"submission_id":"aoj_3170_5383506","code_snippet":"#include <cmath>\n#include <vector>\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <algorithm>\n#include <set>\n#include <queue>\n#include <string>\n#include <map>\n#include <stack>\n#include <climits>\n#include <array>\n#include <unordered_set>\n#include <unordered_map>\n#include <memory>\n#include <functional>\n#include <cfloat>\n#include <numeric>\n#include <random>\n#include <sstream>\n#include <bitset>\n#include <complex>\n#include <chrono>\n#include <cassert>\nclass SqrtSegment {\n\tint sqrt;\n\tstd::vector<std::vector<std::pair<long long int, int>>> segments;\n\tstd::vector<long long int> min, max, add;\n\tvoid change_min_partial(const int from, const int until, const long long int x) {\n\t\tconst auto added = add[from / sqrt];\n\t\tconst auto upper_limit = min[from / sqrt];\n\t\tconst auto lower_limit = max[from / sqrt];\n\t\tfor (auto& [value, pos] : segments[from / sqrt]) {\n\t\t\tvalue = std::min(upper_limit, std::max(lower_limit, value));\n\t\t\tvalue += added;\n\t\t\tif (pos < from || until <= pos) continue;\n\t\t\tvalue = std::min(value, x);\n\t\t}\n\t\tstd::sort(segments[from / sqrt].begin(), segments[from / sqrt].end());\n\t\tadd[from / sqrt] = 0;\n\t\tmin[from / sqrt] = LLONG_MAX;\n\t\tmax[from / sqrt] = LLONG_MIN;\n\t}\n\tvoid change_max_partial(const int from, const int until, const long long int x) {\n\t\tconst auto added = add[from / sqrt];\n\t\tconst auto upper_limit = min[from / sqrt];\n\t\tconst auto lower_limit = max[from / sqrt];\n\t\tfor (auto& [value, pos] : segments[from / sqrt]) {\n\t\t\tvalue = std::min(upper_limit, std::max(lower_limit, value));\n\t\t\tvalue += added;\n\t\t\tif (pos < from || until <= pos) continue;\n\t\t\tvalue = std::max(value, x);\n\t\t}\n\t\tstd::sort(segments[from / sqrt].begin(), segments[from / sqrt].end());\n\t\tadd[from / sqrt] = 0;\n\t\tmin[from / sqrt] = LLONG_MAX;\n\t\tmax[from / sqrt] = LLONG_MIN;\n\t}\n\tvoid change_add_partial(const int from, const int until, const long long int x) {\n\t\tconst auto added = add[from / sqrt];\n\t\tconst auto upper_limit = min[from / sqrt];\n\t\tconst auto lower_limit = max[from / sqrt];\n\t\tfor (auto& [value, pos] : segments[from / sqrt]) {\n\t\t\tvalue = std::min(upper_limit, std::max(lower_limit, value));\n\t\t\tvalue += added;\n\t\t\tif (pos < from || until <= pos) continue;\n\t\t\tvalue += x;\n\t\t}\n\t\tstd::sort(segments[from / sqrt].begin(), segments[from / sqrt].end());\n\t\tadd[from / sqrt] = 0;\n\t\tmin[from / sqrt] = LLONG_MAX;\n\t\tmax[from / sqrt] = LLONG_MIN;\n\t}\n\tvoid change_min_segment(const int segment, const long long int x) {\n\t\tmin[segment] = std::min(min[segment], x - add[segment]);\n\t}\n\tvoid change_max_segment(const int segment, const long long int x) {\n\t\tmax[segment] = std::max(max[segment], x - add[segment]);\n\t}\n\tvoid change_add_segment(const int segment, const long long int x) {\n\t\tadd[segment] += x;\n\t}\n\tint count_partial(const int from, const int until, const long long int lower, const long long int upper) {\n\t\tint result{ 0 };\n\t\tconst auto added = add[from / sqrt];\n\t\tconst auto upper_limit = min[from / sqrt];\n\t\tconst auto lower_limit = max[from / sqrt];\n\t\tfor (auto& [value, pos] : segments[from / sqrt]) {\n\t\t\tvalue = std::min(upper_limit, std::max(lower_limit, value));\n\t\t\tvalue += added;\n\t\t\tif (pos < from || until <= pos) continue;\n\t\t\tif (lower <= value && value <= upper) ++result;\n\t\t}\n\t\tadd[from / sqrt] = 0;\n\t\tmin[from / sqrt] = LLONG_MAX;\n\t\tmax[from / sqrt] = LLONG_MIN;\n\t\treturn result;\n\t}\n\tint count_segment(const int segment, const long long int lower, const long long int upper) {\n\t\tconst auto upper_limit = std::min(upper - add[segment], min[segment]);\n\t\tconst auto lower_limit = std::max(lower - add[segment], max[segment]);\n\t\treturn std::distance(std::lower_bound(segments[segment].begin(), segments[segment].end(), std::make_pair(lower_limit, -1)), std::upper_bound(segments[segment].begin(), segments[segment].end(), std::make_pair(upper_limit, INT_MAX)));\n\t}\n\npublic:\n\tSqrtSegment(const std::vector<int>& initial) : sqrt{ (int)std::ceil(std::sqrt(initial.size() * std::log2(initial.size()))) }, segments((initial.size() + sqrt - 1) / sqrt), min(segments.size(), LLONG_MAX), max(segments.size(), LLONG_MIN), add(segments.size(), 0) {\n\t\tfor (auto i = 0; i < segments.size(); ++i) {\n\t\t\tconst auto offset = i * sqrt;\n\t\t\tfor (auto j = 0; j < sqrt; ++j) {\n\t\t\t\tif (offset + j >= initial.size()) break;\n\t\t\t\tsegments[i].emplace_back(initial[offset + j], offset + j);\n\t\t\t}\n\t\t\tstd::sort(segments[i].begin(), segments[i].end());\n\t\t}\n\t}\n\tstd::vector<long long int> show_value() const {\n\t\tstd::vector<std::pair<long long int, int>> values;\n\t\tfor (auto i = 0; i < segments.size(); ++i) {\n\t\t\tconst auto added = add[i];\n\t\t\tconst auto upper_limit = min[i];\n\t\t\tconst auto lower_limit = max[i];\n\t\t\tfor (const auto [value, pos]: segments[i]) {\n\t\t\t\tvalues.emplace_back(std::max(lower_limit, std::min(upper_limit, value)) + added, pos);\n\t\t\t}\n\t\t}\n\t\tstd::vector<long long int >result(values.size());\n\t\tfor (const auto [value, pos] : values) {\n\t\t\tresult[pos] = value;\n\t\t}\n\t\treturn result;\n\t}\n\tvoid change_min(const int left, const int right, const int x) {\n\t\tconst auto from = (left + sqrt - 1) / sqrt;\n\t\tconst auto until = right / sqrt;\n\t\tif (from > until) {\n\t\t\treturn change_min_partial(left, right + 1, x);\n\t\t}\n\t\tchange_min_partial(left, from * sqrt, x);\n\t\tfor (auto i = from; i < until; ++i) {\n\t\t\tchange_min_segment(i, x);\n\t\t}\n\t\tchange_min_partial(until * sqrt, right + 1, x);\n\t}\n\tvoid change_max(const int left, const int right, const int x) {\n\t\tconst auto from = (left + sqrt - 1) / sqrt;\n\t\tconst auto until = right / sqrt;\n\t\tif (from > until) {\n\t\t\treturn change_max_partial(left, right + 1, x);\n\t\t}\n\t\tchange_max_partial(left, from * sqrt, x);\n\t\tfor (auto i = from; i < until; ++i) {\n\t\t\tchange_max_segment(i, x);\n\t\t}\n\t\tchange_max_partial(until * sqrt, right + 1, x);\n\t}\n\tvoid change_add(const int left, const int right, const int x) {\n\t\tconst auto from = (left + sqrt - 1) / sqrt;\n\t\tconst auto until = right / sqrt;\n\t\tif (from > until) {\n\t\t\treturn change_add_partial(left, right + 1, x);\n\t\t}\n\t\tchange_add_partial(left, from * sqrt, x);\n\t\tfor (auto i = from; i < until; ++i) {\n\t\t\tchange_add_segment(i, x);\n\t\t}\n\t\tchange_add_partial(until * sqrt, right + 1, x);\n\t}\n\tint count(const int left, const int right, const long long int x, const long long int y) {\n\t\tconst auto from = (left + sqrt - 1) / sqrt;\n\t\tconst auto until = right / sqrt;\n\t\tif (from > until) {\n\t\t\treturn count_partial(left, right + 1, x, y);\n\t\t}\n\t\tlong long int result{ count_partial(left, from * sqrt, x, y) };\n\t\tfor (auto i = from; i < until; ++i) {\n\t\t\tresult += count_segment(i, x, y);\n\t\t}\n\t\tresult += count_partial(until * sqrt, right + 1, x, y);\n\t\treturn result;\n\t}\n};\n\nint main() {\n\tstd::cin.tie(nullptr); std::cin.sync_with_stdio(false);\n\tint n, q; std::cin >> n >> q;\n\tstd::vector<int> initial(n);\n\tfor (auto& a : initial) std::cin >> a;\n\tSqrtSegment seg(initial);\n\tfor (auto i = 0; i < q; ++i) {\n\t\tint type; std::cin >> type;\n\t\tif (type == 1) {\n\t\t\tint l, r, x; std::cin >> l >> r >> x; --l; --r;\n\t\t\tseg.change_min(l, r, x);\n\t\t}\n\t\telse if (type == 2) {\n\t\t\tint l, r, x; std::cin >> l >> r >> x; --l; --r;\n\t\t\tseg.change_max(l, r, x);\n\t\t}\n\t\telse if (type == 3) {\n\t\t\tint l, r, x; std::cin >> l >> r >> x; --l; --r;\n\t\t\tseg.change_add(l, r, x);\n\t\t}\n\t\telse {\n\t\t\tint l, r; long long int x, y; std::cin >> l >> r >> x >> y; --l; --r;\n\t\t\tstd::cout << seg.count(l, r, x, y) << '\\n';\n\t\t}\n\t}\n}\n\n\n/*\nhttps://onlinejudge.u-aizu.ac.jp/challenges/sources/VPC/HUPC/3170\n\n\n\n\n.*/","accuracy":0.09523809523809523,"time_ms":900,"memory_kb":5164,"score_of_the_acc":-0.6361,"final_rank":18},{"submission_id":"aoj_3170_5199970","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n__attribute__((constructor))\nvoid fast_io() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n}\n\ntemplate<class S,\n class F,\n S (*mapping)(F, S),\n F (*composition)(F, F),\n F (*id)(),\n class I,\n I (*precalculate)(const vector<S>&),\n class P,\n P (*op)(P, P),\n P (*e)()>\nclass sqrt_decomposition {\n using Calc_from_S = function<P(S)>;\n using Calc_from_I = function<P(const I&, F, int, int)>;\n \n class bucket {\n int l, r;\n vector<S> vs;\n F lazy_f;\n I info;\n\n void reflect_apply() {\n if (lazy_f == id()) return;\n for_each(vs.begin(), vs.end(), [&](S& v) { v = mapping(lazy_f, v); });\n lazy_f = id();\n }\n\n void reflect_prod() {\n info = precalculate(vs);\n }\n\n void partial_apply(int l, int r, F f) {\n reflect_apply();\n for_each(vs.begin() + l, vs.begin() + r, [&](S& v) { v = mapping(f, v); });\n reflect_prod();\n }\n\n void all_apply(F f) {\n lazy_f = composition(f, lazy_f);\n }\n\n P partial_prod(int l, int r, const Calc_from_S& cs) {\n reflect_apply();\n reflect_prod();\n P res = e();\n for_each(vs.begin() + l, vs.begin() + r, [&](S& v) { res = op(res, cs(v)); });\n return res;\n }\n\n P all_prod(const Calc_from_I& ci) {\n return ci(info, lazy_f, l, r);\n }\n \n public:\n bucket(const vector<S>& a, int l, int r)\n : l(l), r(r), vs(a.begin() + l, a.begin() + r), lazy_f(id()) { reflect_prod(); }\n\n void apply(int s, int t, F f) {\n if (t <= l || r <= s) return;\n if (s <= l && r <= t) {\n all_apply(f);\n } else {\n partial_apply(max(l, s) - l, min(r, t) - l, f);\n }\n }\n\n P prod(int s, int t, const Calc_from_S& cs, const Calc_from_I& ci) {\n if (t <= l || r <= s) return e();\n if (s <= l && r <= t) {\n return all_prod(ci);\n } else {\n return partial_prod(max(l, s) - l, min(r, t) - l, cs);\n }\n }\n };\n\n vector<bucket> bs;\n\npublic:\n sqrt_decomposition(const vector<S>& a, int bucket_size) {\n for (int i = 0; i < (int)a.size(); i += bucket_size) {\n bs.emplace_back(a, i, min(i + bucket_size, (int)a.size()));\n }\n }\n\n void apply(int l, int r, F f) {\n for_each(bs.begin(), bs.end(), [&](bucket& b) { b.apply(l, r, f); });\n }\n\n P prod(int l, int r, const Calc_from_S& cs, const Calc_from_I& ci) {\n P res = e();\n for_each(bs.begin(), bs.end(), [&](bucket& b) { res = op(res, b.prod(l, r, cs, ci)); });\n return res;\n }\n};\n\nusing S = long long;\nusing F = tuple<long long, long long, long long>;\nS mapping(F f, S x) {\n auto [chmin, chmax, add] = f;\n x = min(x, chmin);\n x = max(x, chmax);\n x += add;\n return x;\n}\nF composition(F f, F g) {\n auto [fchmin, fchmax, fadd] = f;\n auto [gchmin, gchmax, gadd] = g;\n long long chmin = min(gchmin, fchmin - gadd);\n long long chmax = max(min(gchmax, fchmin - gadd), fchmax - gadd);\n long long add = gadd + fadd;\n return {chmin, chmax, add};\n}\nF id() { return {LLONG_MAX / 2, LLONG_MIN / 2, 0}; }\nusing I = vector<long long>;\nI precalculate(const vector<S>& vs) {\n I res = vs;\n sort(res.begin(), res.end());\n return res;\n}\nusing P = int;\nP op(P a, P b) { return a + b; }\nP e() { return 0; }\n\nint main() {\n int n, q;\n cin >> n >> q;\n vector<S> a(n);\n for (auto& ai : a) cin >> ai;\n sqrt_decomposition<S, F, mapping, composition, id, I, precalculate, P, op, e> sqd(a, 128);\n\n while (q--) {\n int com, l, r;\n long long x, y;\n cin >> com >> l >> r >> x;\n l--;\n if (com == 4) {\n cin >> y;\n auto cs = [&](S s) { return x <= s && s <= y; };\n auto ci = [&](const I& info, F f, int l, int r) {\n auto [chmin, chmax, add] = f;\n auto calc = [&](long long ub) {\n if (chmax > ub - add) return 0;\n if (chmin <= ub - add) return r - l;\n return (int)distance(info.begin(), upper_bound(info.begin(), info.end(), ub - add));\n };\n return calc(y) - calc(x - 1);\n };\n cout << sqd.prod(l, r, cs, ci) << '\\n';\n } else {\n F f = id();\n auto& [chmin, chmax, add] = f;\n if (com == 1) chmin = x;\n if (com == 2) chmax = x;\n if (com == 3) add = x;\n sqd.apply(l, r, f);\n }\n }\n}","accuracy":1,"time_ms":1140,"memory_kb":5648,"score_of_the_acc":-0.8544,"final_rank":11},{"submission_id":"aoj_3170_5199942","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n__attribute__((constructor))\nvoid fast_io() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n}\n\ntemplate<class S,\n class F,\n S (*mapping)(F, S),\n F (*composition)(F, F),\n F (*id)(),\n class I,\n I (*precalculate)(const vector<S>&),\n class P,\n P (*op)(P, P),\n P (*e)()>\nclass sqrt_decomposition {\n using Calc_from_S = function<P(S)>;\n using Calc_from_I = function<P(const I&, const F&, int, int)>;\n \n class bucket {\n int l, r;\n vector<S> vs;\n F lazy_f;\n I info;\n\n void reflect_apply() {\n if (lazy_f == id()) return;\n for_each(vs.begin(), vs.end(), [&](S& v) { v = mapping(lazy_f, v); });\n lazy_f = id();\n }\n\n void reflect_prod() {\n info = precalculate(vs);\n }\n\n void partial_apply(int l, int r, const F& f) {\n reflect_apply();\n for_each(vs.begin() + l, vs.begin() + r, [&](S& v) { v = mapping(f, v); });\n reflect_prod();\n }\n\n void all_apply(const F& f) {\n lazy_f = composition(f, lazy_f);\n }\n\n P partial_prod(int l, int r, const Calc_from_S& cs) {\n reflect_apply();\n reflect_prod();\n P res = e();\n for_each(vs.begin() + l, vs.begin() + r, [&](S& v) { res = op(res, cs(v)); });\n return res;\n }\n\n P all_prod(const Calc_from_I& ci) {\n return ci(info, lazy_f, l, r);\n }\n \n public:\n bucket(const vector<S>& a, int l, int r)\n : l(l), r(r), vs(a.begin() + l, a.begin() + r), lazy_f(id()) { reflect_prod(); }\n\n void apply(int s, int t, const F& f) {\n if (t <= l || r <= s) return;\n if (s <= l && r <= t) {\n all_apply(f);\n } else {\n partial_apply(max(l, s) - l, min(r, t) - l, f);\n }\n }\n\n P prod(int s, int t, const Calc_from_S& cs, const Calc_from_I& ci) {\n if (t <= l || r <= s) return e();\n if (s <= l && r <= t) {\n return all_prod(ci);\n } else {\n return partial_prod(max(l, s) - l, min(r, t) - l, cs);\n }\n }\n };\n\n vector<bucket> bs;\n\npublic:\n sqrt_decomposition(const vector<S>& a, int bucket_size) {\n for (int i = 0; i < (int)a.size(); i += bucket_size) {\n bs.emplace_back(a, i, min(i + bucket_size, (int)a.size()));\n }\n }\n\n void apply(int l, int r, const F& f) {\n for_each(bs.begin(), bs.end(), [&](bucket& b) { b.apply(l, r, f); });\n }\n\n P prod(int l, int r, const Calc_from_S& cs, const Calc_from_I& ci) {\n P res = e();\n for_each(bs.begin(), bs.end(), [&](bucket& b) { res = op(res, b.prod(l, r, cs, ci)); });\n return res;\n }\n};\n\nusing S = long long;\nusing F = tuple<long long, long long, long long>;\nS mapping(F f, S x) {\n auto [chmin, chmax, add] = f;\n x = min(x, chmin);\n x = max(x, chmax);\n x += add;\n return x;\n}\nF composition(F f, F g) {\n auto [fchmin, fchmax, fadd] = f;\n auto [gchmin, gchmax, gadd] = g;\n long long chmin = min(gchmin, fchmin - gadd);\n long long chmax = max(min(gchmax, fchmin - gadd), fchmax - gadd);\n long long add = gadd + fadd;\n return {chmin, chmax, add};\n}\nF id() { return {LLONG_MAX / 10, LLONG_MIN / 10, 0}; }\nusing I = vector<long long>;\nI precalculate(const vector<S>& vs) {\n I res = vs;\n sort(res.begin(), res.end());\n return res;\n}\nusing P = int;\nP op(P a, P b) { return a + b; }\nP e() { return 0; }\n\nint main() {\n int n, q;\n cin >> n >> q;\n vector<S> a(n);\n for (auto& ai : a) cin >> ai;\n sqrt_decomposition<S, F, mapping, composition, id, I, precalculate, P, op, e> sqd(a, 256);\n\n while (q--) {\n int com, l, r;\n long long x, y;\n cin >> com >> l >> r >> x;\n l--;\n if (com == 4) {\n cin >> y;\n auto cs = [&](S s) { return x <= s && s <= y; };\n auto ci = [&](const I& info, const F& f, int l, int r) {\n auto [chmin, chmax, add] = f;\n auto calc = [&](long long border) {\n if (chmax > border - add) return 0;\n if (chmin <= border - add) return r - l;\n return (int)distance(info.begin(), upper_bound(info.begin(), info.end(), border - add));\n };\n return calc(y) - calc(x - 1);\n };\n cout << sqd.prod(l, r, cs, ci) << '\\n';\n } else {\n F f = id();\n auto& [chmin, chmax, add] = f;\n if (com == 1) chmin = x;\n if (com == 2) chmax = x;\n if (com == 3) add = x;\n sqd.apply(l, r, f);\n }\n }\n}","accuracy":1,"time_ms":1500,"memory_kb":5492,"score_of_the_acc":-1.068,"final_rank":14},{"submission_id":"aoj_3170_5141724","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream> // cout, endl, cin\n#include <string> // string, to_string, stoi\n#include <vector> // vector\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\n#include <utility> // pair, make_pair\n#include <tuple> // tuple, make_tuple\n#include <cstdint> // int64_t, int*_t\n#include <cstdio> // printf\n#include <map> // map\n#include <queue> // queue, priority_queue\n#include <set> // set\n#include <stack> // stack\n#include <deque> // deque\n#include <unordered_map> // unordered_map\n#include <unordered_set> // unordered_set\n#include <bitset> // bitset\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\n#include <iomanip> // setprecision\n#include <complex> // complex\n#include <math.h> \n#include <cmath>\n#include <functional>\n#include <cassert>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll,ll>;\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\n// constexpr ll mod = 1000000007;\nconstexpr ll mod = 998244353;\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\nconst char eol = '\\n';\n// --------------------------------------------------------------------------\n\nstruct SqrtDecomposition{\n const int sqrtN = 256;\n int N,K;\n vector<ll> data;\n vector<ll> bucketMin;\n vector<ll> bucketMax;\n vector<ll> bucketAdd;\n vector<vector<ll>> sortedBucket;\n SqrtDecomposition(vector<ll> A): data(A){\n N = data.size();\n K = (N + sqrtN - 1)/sqrtN;\n bucketMin.assign(K,INF);\n bucketMax.assign(K,-INF);\n bucketAdd.assign(K,0);\n sortedBucket = vector<vector<ll>>(K);\n for(int k=0; k<K; k++){\n int l = k * sqrtN;\n int r = (k+1) * sqrtN;\n chmin(r,N);\n for(int j=l; j<r; j++){\n sortedBucket[k].emplace_back(data[j]);\n }\n sort(sortedBucket[k].begin(),sortedBucket[k].end());\n }\n }\n void eval(int k){\n int l = k * sqrtN;\n int r = (k+1) * sqrtN;\n chmin(r,N);\n for(int i=l; i<r; i++){\n chmin(data[i],bucketMin[k]);\n chmax(data[i],bucketMax[k]);\n data[i] += bucketAdd[k];\n }\n bucketAdd[k] = 0;\n bucketMin[k] = INF;\n bucketMax[k] = -INF;\n }\n // [s,t)\n void update(int id,int s,int t,ll x){\n for(int k=0; k<K; k++){\n int l = k * sqrtN;\n int r = (k+1) * sqrtN;\n chmin(r,N);\n if(r <= s || t <= l) continue;\n if(s <= l && r <= t){\n if(id == 1){ // min \n x -= bucketAdd[k];\n chmin(bucketMin[k],x);\n if(bucketMin[k] < bucketMax[k]) bucketMax[k] = bucketMin[k];\n x += bucketAdd[k];\n }else if(id == 2){ // max\n x -= bucketAdd[k];\n chmax(bucketMax[k],x);\n if(bucketMin[k] < bucketMax[k]) bucketMin[k] = bucketMax[k];\n x += bucketAdd[k];\n }else{ // add\n bucketAdd[k] += x;\n }\n }else{\n eval(k);\n for(int i=max(l,s); i<min(r,t); i++){\n if(id == 1) chmin(data[i],x);\n else if(id == 2) chmax(data[i],x);\n else data[i] += x;\n }\n vector<ll> temp;\n for(int i=l; i<r; i++){\n temp.emplace_back(data[i]);\n }\n sort(temp.begin(),temp.end());\n sortedBucket[k] = temp;\n }\n }\n }\n\n // [s,t) [x,y]\n int query(int s,int t,ll x,ll y){\n int res = 0;\n for(int k=0; k<K; k++){\n int l = k * sqrtN;\n int r = (k+1) * sqrtN;\n chmin(r,N);\n if(r <= s || t <= l) continue;\n if(s <= l && r <= t){\n x -= bucketAdd[k];\n y -= bucketAdd[k];\n int sz = r - l;\n // [0,y]\n int posY = upper_bound(sortedBucket[k].begin(),sortedBucket[k].end(),y) - sortedBucket[k].begin();\n // [0,x) \n int posX = lower_bound(sortedBucket[k].begin(),sortedBucket[k].end(),x) - sortedBucket[k].begin();\n if(x <= bucketMax[k] && bucketMin[k] <= y){\n res += sz;\n }else if(x <= bucketMax[k] && bucketMax[k] <= y){\n res += posY;\n }else if(x <= bucketMin[k] && bucketMin[k] <= y){\n res += sz - posX;\n }else{\n res += posY - posX;\n }\n x += bucketAdd[k];\n y += bucketAdd[k];\n }else{\n eval(k);\n vector<ll> temp;\n for(int i=l; i<r; i++){\n temp.emplace_back(data[i]);\n }\n sort(temp.begin(),temp.end());\n sortedBucket[k] = temp;\n for(int i=max(l,s); i<min(r,t); i++){\n if(x <= data[i] && data[i] <= y) res++;\n }\n }\n } \n return res;\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N,Q;\n cin >> N >> Q;\n vector<ll> A(N);\n for(int i=0; i<N; i++) cin >> A[i];\n SqrtDecomposition SD(A);\n vector<int> ans;\n for(int i=0; i<Q; i++){\n int id;\n cin >> id;\n if(id == 4){\n int l,r;\n ll x,y;\n cin >> l >> r >> x >> y;\n l--;\n ans.emplace_back(SD.query(l,r,x,y));\n }else{\n int l,r;\n ll x;\n cin >> l >> r >> x;\n l--;\n SD.update(id,l,r,x);\n }\n }\n for(auto x: ans){\n cout << x << eol;\n }\n return 0;\n}","accuracy":0.09523809523809523,"time_ms":120,"memory_kb":6200,"score_of_the_acc":-0.2633,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_3170_10536492\",\n \"code_snippet\": \"// AOJ #3170 Freqs\\n// 2025.5.28\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() {\\n\\tint n = 0, c = gc();\\n\\tif (c == '-') {\\tc = gc();\\n\\t\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\t\\treturn -n;\\n\\t}\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nll Cinll() {\\n\\tll n = 0, c = gc();\\n\\tif (c == '-') {\\tc = gc();\\n\\t\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\t\\treturn -n;\\n\\t}\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nvoid Cout(int n) {\\n\\tchar b[30];\\n\\tif (!n) pc('0');\\n\\telse {\\n\\t\\tif (n < 0) pc('-'), n = -n;\\n\\t\\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\\n\\t\\twhile (i--) pc(b[i]);\\n\\t}\\n pc('\\\\n');\\n}\\n\\nconst int MAXN = 100000;\\nconst int BSZ = 200;\\nconst ll INF = (ll)4e18;\\n\\nint N, Q;\\nll A[MAXN];\\nint nb;\\nint szb[MAXN/BSZ+5];\\n\\nll cm[MAXN/BSZ+5], cM[MAXN/BSZ+5], addv[MAXN/BSZ+5];\\n\\nll V[MAXN/BSZ+5][BSZ];\\n\\ninline void flush_block(int b, bool f_sort){\\n int start = b*BSZ;\\n ll cap_max = cm[b], cap_min = cM[b], ad = addv[b];\\n int s = szb[b];\\n for(int i=0;i<s;i++){\\n int idx = start + i;\\n ll v = A[idx];\\n if(v > cap_max) v = cap_max;\\n if(v < cap_min) v = cap_min;\\n v += ad;\\n A[idx] = v;\\n V[b][i] = v;\\n }\\n if(f_sort) sort(V[b], V[b]+s);\\n cm[b] = INF;\\n cM[b] = -INF;\\n addv[b] = 0;\\n}\\n\\nint main(){\\n N = Cin(), Q = Cin();\\n for(int i=0;i<N;i++) A[i] = Cin();\\n\\n nb = (N + BSZ - 1) / BSZ;\\n for(int b=0;b<nb;b++){\\n int start = b*BSZ;\\n int s = min(BSZ, N - start);\\n szb[b] = s;\\n for(int i=0;i<s;i++) V[b][i] = A[start + i];\\n sort(V[b], V[b]+s);\\n cm[b] = INF;\\n cM[b] = -INF;\\n addv[b] = 0;\\n }\\n\\n while(Q--){\\n int t = Cin(), l = Cin()-1, r = Cin()-1;\\n ll x = Cinll();\\n ll y;\\n if(t==4) y = Cinll();\\n\\n int bL = l/BSZ, bR = r/BSZ;\\n int ans = 0;\\n if(bL == bR){\\n flush_block(bL, true);\\n for(int i=l;i<=r;i++){\\n if(t==1) A[i] = min(A[i], x);\\n else if(t==2) A[i] = max(A[i], x);\\n else if(t==3) A[i] += x;\\n else if(t==4) if(A[i]>=x && A[i]<=y) ans++;\\n }\\n int start=bL*BSZ, s=szb[bL];\\n for(int i=0;i<s;i++) V[bL][i] = A[start+i];\\n sort(V[bL], V[bL]+s);\\n } else {\\n flush_block(bL, false);\\n flush_block(bR, false);\\n\\n int endL = (bL+1)*BSZ;\\n for(int i=l;i<endL;i++){\\n if(t==1) A[i] = min(A[i], x);\\n else if(t==2) A[i] = max(A[i], x);\\n else if(t==3) A[i] += x;\\n else if(t==4) if(A[i]>=x && A[i]<=y) ans++;\\n }\\n int startR = bR*BSZ;\\n for(int i=startR;i<=r;i++){\\n if(t==1) A[i] = min(A[i], x);\\n else if(t==2) A[i] = max(A[i], x);\\n else if(t==3) A[i] += x;\\n else if(t==4) if(A[i]>=x && A[i]<=y) ans++;\\n }\\n\\n for(int b=bL+1; b<bR; b++){\\n if(t==1){\\n ll lim = x - addv[b];\\n if(lim < cm[b]) cm[b] = lim;\\n if(cM[b] > cm[b]) cM[b] = cm[b];\\n }\\n else if(t==2){\\n ll lim = x - addv[b];\\n if(lim > cM[b]) cM[b] = lim;\\n if(cM[b] > cm[b]) cm[b] = cM[b];\\n }\\n else if(t==3) addv[b] += x;\\n else {\\n ll tl = x - addv[b], tr = y - addv[b];\\n if(tl > cm[b] || tr < cM[b]) continue;\\n ll lo = tl, hi = tr;\\n if(cM[b] >= tl) lo = -INF;\\n if(cm[b] <= tr) hi = +INF;\\n int cnt = upper_bound(V[b], V[b]+szb[b], hi)\\n - lower_bound(V[b], V[b]+szb[b], lo);\\n ans += cnt;\\n }\\n }\\n\\n flush_block(bL, true);\\n flush_block(bR, true);\\n }\\n if(t==4) Cout(ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1200,\n \"memory_kb\": 4940,\n \"score_of_the_acc\": -0.802,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3170_10315691\",\n \"code_snippet\": \"// AOJ #3170 Freqs\\n// 2025.3.21\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() {\\n\\tint n = 0; int c = gc();\\n\\tif (c == '-') {\\tc = gc();\\n\\t\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\t\\treturn -n;\\n\\t}\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nvoid Cout(ll n) { // 整数の表示（出力）\\n\\tchar b[30];\\n\\tif (!n) pc('0');\\n\\telse {\\n\\t\\tif (n < 0) pc('-'), n = -n;\\n\\t\\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\\n\\t\\twhile (i--) pc(b[i]);\\n\\t}\\n\\tpc('\\\\n');\\n}\\n\\nstruct Block {\\n int L, R;\\n vector<ll> a;\\n vector<ll> s;\\n ll lz;\\n ll mn, mx;\\n\\n void init(int L, int R, const vector<ll>& arr) {\\n this->L = L; this->R = R;\\n a.resize(R - L + 1);\\n for (int i = L; i <= R; i++) a[i - L] = arr[i];\\n lz = 0;\\n rebuild();\\n }\\n void rebuild() {\\n s = a;\\n sort(s.begin(), s.end());\\n if(!s.empty()){\\n mn = s.front() + lz;\\n mx = s.back() + lz;\\n } else mn = mx = 0;\\n }\\n void push(){\\n if(lz){\\n for(auto &v : a) v += lz;\\n lz = 0;\\n rebuild();\\n }\\n }\\n void add(ll x) {\\n lz += x;\\n mn += x;\\n mx += x;\\n }\\n void chmin(ll x) {\\n if(mx <= x) return;\\n if(mn >= x){\\n lz = 0;\\n for(auto &v : a) v = x;\\n rebuild();\\n return;\\n }\\n push();\\n for(auto &v : a) if(v > x) v = x;\\n rebuild();\\n }\\n void chmax(ll x) {\\n if(mn >= x) return;\\n if(mx <= x){\\n lz = 0;\\n for(auto &v : a) v = x;\\n rebuild();\\n return;\\n }\\n push();\\n for(auto &v : a) if(v < x) v = x;\\n rebuild();\\n }\\n void add_range(int l, int r, ll x){\\n push();\\n for (int i = l; i <= r; i++) a[i] += x;\\n rebuild();\\n }\\n void chmin_range(int l, int r, ll x){\\n push();\\n for (int i = l; i <= r; i++) if(a[i] > x) a[i] = x;\\n rebuild();\\n }\\n void chmax_range(int l, int r, ll x){\\n push();\\n for (int i = l; i <= r; i++) if(a[i] < x) a[i] = x;\\n rebuild();\\n }\\n int count_range(int l, int r, ll x, ll y){\\n int cnt = 0;\\n push();\\n for (int i = l; i <= r; i++){\\n ll v = a[i];\\n if(v >= x && v <= y) cnt++;\\n }\\n return cnt;\\n }\\n int query(ll x, ll y){\\n ll Lbound = x - lz, Rbound = y - lz;\\n return (int)(upper_bound(s.begin(), s.end(), Rbound) - lower_bound(s.begin(), s.end(), Lbound));\\n }\\n};\\n\\nint main(){\\n int n = Cin(), q = Cin();\\n vector<ll> arr(n);\\n for (int i = 0; i < n; i++) arr[i] = Cin();\\n\\n int bs = max(1, (int)sqrt(n));\\n vector<Block> B;\\n for (int i = 0; i < n; i += bs) {\\n int r = min(n - 1, i + bs - 1);\\n Block b;\\n b.init(i, r, arr);\\n B.push_back(b);\\n }\\n\\n while(q--){\\n int t = gc() & 0xf; gc();\\n if(t == 1){\\n int l = Cin()-1, r = Cin()-1;\\n ll x = Cin();\\n for(auto &b : B){\\n if(b.R < l || b.L > r) continue;\\n if(l <= b.L && b.R <= r) b.chmin(x);\\n else {\\n int li = max(l, b.L) - b.L, ri = min(r, b.R) - b.L;\\n b.chmin_range(li, ri, x);\\n }\\n }\\n } else if(t == 2){\\n int l = Cin()-1, r = Cin()-1;\\n ll x = Cin();\\n for(auto &b : B){\\n if(b.R < l || b.L > r) continue;\\n if(l <= b.L && b.R <= r) b.chmax(x);\\n else {\\n int li = max(l, b.L) - b.L, ri = min(r, b.R) - b.L;\\n b.chmax_range(li, ri, x);\\n }\\n }\\n } else if(t == 3){\\n int l = Cin()-1, r = Cin()-1;\\n ll x = Cin();\\n for(auto &b : B){\\n if(b.R < l || b.L > r) continue;\\n if(l <= b.L && b.R <= r) b.add(x);\\n else {\\n int li = max(l, b.L) - b.L, ri = min(r, b.R) - b.L;\\n b.add_range(li, ri, x);\\n }\\n }\\n } else if(t == 4){\\n int l = Cin()-1, r = Cin()-1;\\n ll x = Cin(), y= Cin();\\n ll ans = 0;\\n for(auto &b : B){\\n if(b.R < l || b.L > r) continue;\\n if(l <= b.L && b.R <= r)\\n ans += b.query(x, y);\\n else {\\n int li = max(l, b.L) - b.L, ri = min(r, b.R) - b.L;\\n ans += b.count_range(li, ri, x, y);\\n }\\n }\\n Cout(ans);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 1290,\n \"memory_kb\": 5308,\n \"score_of_the_acc\": -0.9079,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3170_9983927\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <array>\\n#include <tuple>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <bitset>\\n#include <cmath>\\n#include <functional>\\n#include <cassert>\\n#include <climits>\\n#include <iomanip>\\n#include <numeric>\\n#include <memory>\\n#include <random>\\n#include <thread>\\n#include <chrono>\\n#define allof(obj) (obj).begin(), (obj).end()\\n#define range(i, l, r) for(int i=l;i<r;i++)\\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\\n#define bit_kth(i, k) ((i >> k)&1)\\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\\nusing ll = long long;\\nusing ld = long double;\\nusing ul = uint64_t;\\nusing pi = std::pair<int, int>;\\nusing pl = std::pair<ll, ll>;\\nusing namespace std;\\n\\ntemplate<typename F, typename S>\\nstd::ostream &operator << (std::ostream &dest, const std::pair<F, S> &p) {\\n dest << p.first << ' ' << p.second;\\n return dest;\\n}\\n\\ntemplate<typename A, typename B>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t);\\n return dest;\\n}\\n\\ntemplate<typename A, typename B, typename C>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t);\\n return dest;\\n}\\n\\ntemplate<typename A, typename B, typename C, typename D>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C, D> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t) << ' ' << std::get<3>(t);\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::vector<std::vector<T>> &v) {\\n int sz = v.size();\\n if (!sz) return dest;\\n for (int i = 0; i < sz; i++) {\\n int m = v[i].size();\\n for (int j = 0; j < m; j++) dest << v[i][j] << (i != sz - 1 && j == m - 1 ? '\\\\n' : ' ');\\n }\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::vector<T> &v) {\\n int sz = v.size();\\n if (!sz) return dest;\\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\\n dest << v[sz - 1];\\n return dest;\\n}\\n\\ntemplate<typename T, size_t sz>\\nstd::ostream &operator << (std::ostream &dest, const std::array<T, sz> &v) {\\n if (!sz) return dest;\\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\\n dest << v[sz - 1];\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::set<T> &v) {\\n for (auto itr = v.begin(); itr != v.end();) {\\n dest << *itr;\\n itr++;\\n if (itr != v.end()) dest << ' ';\\n }\\n return dest;\\n}\\n\\ntemplate<typename T, typename E>\\nstd::ostream &operator << (std::ostream &dest, const std::map<T, E> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ) {\\n dest << '(' << itr->first << \\\", \\\" << itr->second << ')';\\n itr++;\\n if (itr != v.end()) dest << '\\\\n';\\n }\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::vector<T> make_vec(size_t sz, T val) { return std::vector<T>(sz, val); }\\n\\ntemplate<typename T, typename... Tail>\\nauto make_vec(size_t sz, Tail ...tail) {\\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\\n}\\n\\ntemplate<typename T>\\nstd::vector<T> read_vec(size_t sz) {\\n std::vector<T> v(sz);\\n for (int i = 0; i < (int)sz; i++) std::cin >> v[i];\\n return v;\\n}\\n\\ntemplate<typename T, typename... Tail>\\nauto read_vec(size_t sz, Tail ...tail) {\\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\\n for (int i = 0; i < (int)sz; i++) v[i] = read_vec<T>(tail...);\\n return v;\\n}\\n\\ntemplate<typename T, size_t size>\\nauto make_array(T x) { \\n std::array<T, size> res;\\n res.fill(x);\\n return res;\\n}\\n\\ntemplate<typename T, size_t size, size_t size2, size_t... Tail>\\nauto make_array(T x) {\\n std::array<decltype(make_array<T, size2, Tail...>(x)), size> res;\\n res.fill(make_array<T, size2, Tail...>(x));\\n return res;\\n}\\n\\n\\n// x / y以上の最小の整数\\nll ceil_div(ll x, ll y) {\\n assert(y > 0);\\n return (x + (x > 0 ? y - 1 : 0)) / y;\\n}\\n\\n// x / y以下の最大の整数\\nll floor_div(ll x, ll y) {\\n assert(y > 0);\\n return (x + (x > 0 ? 0 : -y + 1)) / y;\\n}\\n\\nvoid io_init() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n}\\n\\n\\n\\n#include <limits>\\n\\ntemplate<typename T>\\nstruct add_min_function{\\n using F = add_min_function<T>;\\n T add, upper;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n add_min_function(): add(0), upper(inf){}\\n add_min_function(T _add, T _upper): add(_add), upper(_upper){}\\n // g(f(x))\\n static F merge(const F &f, const F &g){return {f.add + g.add, std::min(g.upper, f.upper + g.add)};}\\n T fx(T x){return std::min(x + add, upper);}\\n bool operator == (const F &r)const{return add == r.add && upper == r.upper;}\\n};\\n\\n// f(x) = min(max(x + a, b), c)\\ntemplate<typename T>\\nstruct clamp_function{\\n T add, lower, upper;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\\n clamp_function(): add(0), lower(minf), upper(inf){}\\n clamp_function(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper){lower = std::min(_lower, _upper);}\\n // g(f(x))\\n static clamp_function<T> merge(const clamp_function<T> &f, const clamp_function<T> &g){\\n return {f.add + g.add, std::max(g.lower, std::min(f.upper, f.lower) + g.add), std::min(g.upper, std::max(g.lower, f.upper + g.add))};\\n }\\n T fx(T x){\\n return std::min(std::max(x + add, lower), upper);\\n }\\n bool operator == (const clamp_function<T> &r)const{return add == r.add && lower == r.lower && upper == r.upper;}\\n};\\n// f(x) = min(max(x + a, b), c)\\n// min部分によって減少した値をスコアとする\\ntemplate<typename T, typename Tsum>\\nstruct clamp_function_score{\\npublic:\\n T add, lower, upper, score_upper;\\n Tsum score_sum;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\\n clamp_function_score(): add(0), lower(minf), upper(inf), score_upper(inf), score_sum(0){}\\n clamp_function_score(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper), score_upper(_upper), score_sum(0){lower = std::min(_lower, _upper);}\\nprivate:\\n clamp_function_score(T _add, T _lower, T _upper, T _supper, Tsum _ssum): add(_add), lower(_lower), upper(_upper), score_upper(_supper), score_sum(_ssum){}\\npublic:\\n // g(f(x))\\n static clamp_function_score<T, Tsum> merge(const clamp_function_score<T, Tsum> &f, const clamp_function_score<T, Tsum> &g){\\n T _add = f.add + g.add;\\n T _lower = std::max(g.lower, std::min(f.upper, f.lower) + g.add);\\n T _upper = std::min(g.upper, std::max(g.lower, f.upper + g.add));\\n _lower = std::min(_lower, _upper);\\n Tsum _ssum = f.score_sum + g.score_sum;\\n if(f.lower == f.upper){\\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\\n return {_add, _lower, _upper, f.score_upper + g.add, _ssum};\\n }else if(f.lower + g.add >= g.score_upper){\\n assert(_lower == _upper);\\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\\n return {_add, _lower, _upper, f.lower + g.add, _ssum};\\n }else{\\n return {_add, _lower, _upper, std::min(f.score_upper + g.add, g.score_upper), _ssum};\\n }\\n }\\n T fx(T x){\\n return std::min(std::max(x + add, lower), upper);\\n }\\n Tsum fx_score(T x){\\n return score_sum + std::max((T)0, x + add - score_upper);\\n }\\n bool operator == (const clamp_function_score<T, Tsum> &r)const{return add == r.add && lower == r.lower && upper == r.upper && score_upper == r.score_upper && score_sum == r.score_sum;}\\n};\\n\\n\\n\\ntemplate<typename T>\\nstruct prefixsum_min{\\n T sum, pmin;\\n static prefixsum_min<T> id(){\\n return {0, std::numeric_limits<T>::max() / 2};\\n }\\n static prefixsum_min<T> merge(prefixsum_min<T> a, prefixsum_min<T> b){\\n if(b.pmin == std::numeric_limits<T>::max() / 2) return a;\\n return {a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin)};\\n }\\n};\\ntemplate<typename T>\\nstruct prefixsum_max{\\n T sum, pmax;\\n static prefixsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min() / 2};\\n }\\n static prefixsum_max<T> merge(prefixsum_max<T> a, prefixsum_max<T> b){\\n if(b.pmax == std::numeric_limits<T>::min() / 2) return a;\\n return {a.sum + b.sum, std::max(a.pmax, a.sum + b.pmax)};\\n }\\n};\\ntemplate<typename T>\\nstruct suffixsum_min{\\n T sum, smin;\\n static suffixsum_min<T> id(){\\n return {0, std::numeric_limits<T>::max() / 2};\\n }\\n static suffixsum_min<T> merge(suffixsum_min<T> a, suffixsum_min<T> b){\\n if(a.smin == std::numeric_limits<T>::max() / 2) return b;\\n return {a.sum + b.sum, std::min(b.smin, b.sum + a.smin)};\\n }\\n};\\ntemplate<typename T>\\nstruct suffixsum_max{\\n T sum, smax;\\n static suffixsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min() / 2};\\n }\\n static suffixsum_max<T> merge(suffixsum_max<T> a, suffixsum_max<T> b){\\n if(a.smax == std::numeric_limits<T>::min() / 2) return b;\\n return {a.sum + b.sum, std::max(b.smax, b.sum + a.smax)};\\n }\\n};\\ntemplate<typename T>\\nstruct substringsum_max{\\n T sum, pmax, smax, ssmax; // {区間全体のsum, prefixsumのmax, suffixsumのmax, substringsumのmax}\\n static substringsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min(), 0, 0};\\n }\\n static substringsum_max<T> merge(substringsum_max<T> a, substringsum_max<T> b){\\n if(b.pmax == std::numeric_limits<T>::min()) return a;\\n if(a.pmax == std::numeric_limits<T>::min()) return b;\\n T sum = a.sum + b.sum;\\n T pmax = std::max(a.pmax, a.sum + b.pmax);\\n T smax = std::max(a.smax + b.sum, b.smax);\\n return {sum, pmax, smax, std::max({a.ssmax, b.ssmax, pmax, smax})};\\n }\\n};\\n// 01列の0を-1として扱う\\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax\\nstruct excess_value{\\npublic:\\n int rank, sum, pmin, pmax;\\n static constexpr int inf = 1 << 30;\\n excess_value(): rank(inf), pmin(inf), pmax(-inf){}\\n excess_value(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum){}\\nprivate:\\n excess_value(int a, int b, int c, int d): rank(a), sum(b), pmin(c), pmax(d){}\\npublic:\\n static excess_value merge(excess_value a, excess_value b){\\n if(a.rank == inf) return b;\\n if(b.rank == inf) return a;\\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), std::max(a.pmax, a.sum + b.pmax)};\\n }\\n};\\n// 01列の0を-1として扱う\\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax, 接尾辞のmin, 接尾辞のmax\\nstruct excess_value2{\\npublic:\\n int rank, sum, pmin, pmax, smin, smax;\\n static constexpr int inf = 1 << 30;\\n excess_value2(): rank(inf), pmin(inf), pmax(-inf), smin(inf), smax(-inf){}\\n excess_value2(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum), smin(sum), smax(sum){}\\nprivate:\\n excess_value2(int a, int b, int c, int d, int e, int f): rank(a), sum(b), pmin(c), pmax(d), smin(e), smax(f){}\\npublic:\\n static excess_value2 merge(excess_value2 a, excess_value2 b){\\n if(a.rank == inf) return b;\\n if(b.rank == inf) return a;\\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), \\n std::max(a.pmax, a.sum + b.pmax), std::min(a.smin + b.sum, b.smin), std::max(a.smax + b.sum, b.smax)};\\n }\\n};\\n\\n\\n// https://probablydance.com/2016/12/27/i-wrote-a-faster-sorting-algorithm/\\nstruct PartitionInfo\\n{\\n PartitionInfo()\\n : count(0)\\n {\\n }\\n \\n union\\n {\\n size_t count;\\n size_t offset;\\n };\\n size_t next_offset;\\n};\\n \\ntemplate<typename It, typename ExtractKey>\\nvoid ska_byte_sort(It begin, It end, ExtractKey & extract_key)\\n{\\n PartitionInfo partitions[256];\\n for (It it = begin; it != end; ++it)\\n {\\n ++partitions[extract_key(*it)].count;\\n }\\n uint8_t remaining_partitions[256];\\n size_t total = 0;\\n int num_partitions = 0;\\n for (int i = 0; i < 256; ++i)\\n {\\n size_t count = partitions[i].count;\\n if (count)\\n {\\n partitions[i].offset = total;\\n total += count;\\n remaining_partitions[num_partitions] = i;\\n ++num_partitions;\\n }\\n partitions[i].next_offset = total;\\n }\\n for (uint8_t * last_remaining = remaining_partitions + num_partitions, * end_partition = remaining_partitions + 1; last_remaining > end_partition;)\\n {\\n last_remaining = custom_std_partition(remaining_partitions, last_remaining, [&](uint8_t partition)\\n {\\n size_t & begin_offset = partitions[partition].offset;\\n size_t & end_offset = partitions[partition].next_offset;\\n if (begin_offset == end_offset)\\n return false;\\n \\n unroll_loop_four_times(begin + begin_offset, end_offset - begin_offset, [partitions = partitions, begin, &extract_key](It it)\\n {\\n uint8_t this_partition = extract_key(*it);\\n size_t offset = partitions[this_partition].offset++;\\n std::iter_swap(it, begin + offset);\\n });\\n return begin_offset != end_offset;\\n });\\n }\\n}\\n\\ntemplate<typename T>\\nstruct range_add_chmin_chmax_range_freq {\\n private:\\n static constexpr T inf = std::numeric_limits<T>::max();\\n static constexpr T minf = std::numeric_limits<T>::min();\\n using F = clamp_function<T>;\\n int N;\\n std::vector<T> V, B;\\n std::vector<F> lz;\\n std::vector<bool> is_sorted;\\n static constexpr int sq = 128;\\n \\n public:\\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V), lz((N + sq - 1) / sq, F()), is_sorted((N + sq - 1) / sq, true) {\\n B = V;\\n for (int i = 0; i < (N + sq - 1) / sq; i++) {\\n int L = i * sq;\\n int R = std::min(L + sq, N);\\n std::sort(B.begin() + L, B.begin() + R);\\n }\\n }\\n\\n // [l, r)の x <- min(max(x + add, lower), upper)\\n void apply(int l, int r, T add, T lower, T upper) {\\n assert(l <= r && lower <= upper);\\n int lb = (l + sq - 1) / sq, rb = r / sq;\\n F f{add, lower, upper};\\n if (l < lb * sq) is_sorted[lb - 1] = false;\\n if (rb * sq < r) is_sorted[rb] = false;\\n if (lb > rb) {\\n int L = rb * sq, R = std::min(N, L + sq);\\n for (int i = L; i < R; i++) {\\n V[i] = lz[rb].fx(V[i]);\\n if (l <= i && i < r) V[i] = f.fx(V[i]);\\n }\\n lz[rb] = F{};\\n return;\\n }\\n if (l < lb * sq) {\\n int L = (lb - 1) * sq, R = std::min(N, L + sq);\\n for (int i = L; i < l; i++) {\\n V[i] = lz[lb - 1].fx(V[i]);\\n }\\n for (int i = l; i < R; i++) {\\n V[i] = f.fx(lz[lb - 1].fx(V[i]));\\n }\\n lz[lb - 1] = F{};\\n }\\n if (rb * sq < r) {\\n int L = rb * sq, R = std::min(N, L + sq);\\n for (int i = L; i < r; i++) {\\n V[i] = f.fx(lz[rb].fx(V[i]));\\n }\\n for (int i = r; i < R; i++) {\\n V[i] = lz[rb].fx(V[i]);\\n }\\n lz[rb] = F{};\\n }\\n for (int i = lb; i < rb; i++) {\\n lz[i] = F::merge(lz[i], f);\\n }\\n }\\n\\n // [l, r)のx以上の最小要素\\n T lower_bound(int l, int r, T x) {\\n assert(l <= r);\\n int lb = (l + sq - 1) / sq, rb = r / sq;\\n T res = inf;\\n if (lb > rb) {\\n for (int i = l; i < r; i++) {\\n T y = lz[rb].fx(V[i]);\\n if (y >= x) res = std::min(res, y);\\n }\\n return res;\\n }\\n for (int i = l; i < lb * sq; i++) {\\n T y = lz[lb - 1].fx(V[i]);\\n if (y >= x) res = std::min(res, y);\\n }\\n for (int i = rb * sq; i < r; i++) {\\n T y = lz[rb].fx(V[i]);\\n if (y >= x) res = std::min(res, y);\\n }\\n for (int i = lb; i < rb; i++) {\\n if (lz[i].upper < x) continue;\\n int L = i * sq, R = std::min(N, L + sq);\\n if (!is_sorted[i]) {\\n for (int j = L; j < R; j++) B[j] = V[j];\\n std::sort(B.begin() + L, B.begin() + R);\\n is_sorted[i] = true;\\n }\\n auto itr = std::lower_bound(B.begin() + L, B.begin() + R, x - lz[i].add);\\n if (lz[i].lower >= x && itr != B.begin() + L) {\\n res = std::min(res, lz[i].lower);\\n }\\n if (itr != B.begin() + R) {\\n res = std::min(res, lz[i].fx(*itr));\\n }\\n }\\n return res;\\n }\\n\\n // [l, r)のrx未満の要素数\\n int range_freq(int l, int r, T rx) {\\n assert(l <= r);\\n int lb = (l + sq - 1) / sq, rb = r / sq;\\n int res = 0;\\n if (lb > rb) {\\n for (int i = l; i < r; i++) {\\n T y = lz[rb].fx(V[i]);\\n if (y < rx) res++;\\n }\\n return res;\\n }\\n for (int i = l; i < lb * sq; i++) {\\n T y = lz[lb - 1].fx(V[i]);\\n if (y < rx) res++;\\n }\\n for (int i = rb * sq; i < r; i++) {\\n T y = lz[rb].fx(V[i]);\\n if (y < rx) res++;\\n }\\n for (int i = lb; i < rb; i++) {\\n if (lz[i].lower >= rx) continue;\\n int L = i * sq, R = std::min(N, L + sq);\\n if (lz[i].upper < rx) {\\n res += R - L;\\n continue;\\n }\\n if (!is_sorted[i]) {\\n for (int j = L; j < R; j++) B[j] = V[j];\\n std::sort(B.begin() + L, B.begin() + R);\\n is_sorted[i] = true;\\n }\\n res += std::lower_bound(B.begin() + L, B.begin() + R, rx - lz[i].add) - (B.begin() + L);\\n }\\n return res;\\n }\\n};\\n\\nint main() {\\n io_init();\\n int N, Q;\\n std::cin >> N >> Q;\\n auto A = read_vec<ll>(N);\\n range_add_chmin_chmax_range_freq<ll> F(A);\\n\\n static constexpr ll inf = 1LL << 60, minf = -inf;\\n for (int i = 0; i < Q; i++) {\\n int t, l, r;\\n ll x;\\n std::cin >> t >> l >> r >> x;\\n l--;\\n if (t == 1) {\\n F.apply(l, r, 0, minf, x);\\n } else if (t == 2) {\\n F.apply(l, r, 0, x, inf);\\n } else if (t == 3) {\\n F.apply(l, r, x, minf, inf);\\n } else {\\n ll y;\\n std::cin >> y;\\n ll ans = F.range_freq(l, r, y + 1) - F.range_freq(l, r, x);\\n std::cout << ans << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1010,\n \"memory_kb\": 5468,\n \"score_of_the_acc\": -0.7467,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3170_9983676\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <array>\\n#include <tuple>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <bitset>\\n#include <cmath>\\n#include <functional>\\n#include <cassert>\\n#include <climits>\\n#include <iomanip>\\n#include <numeric>\\n#include <memory>\\n#include <random>\\n#include <thread>\\n#include <chrono>\\n#define allof(obj) (obj).begin(), (obj).end()\\n#define range(i, l, r) for(int i=l;i<r;i++)\\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\\n#define bit_kth(i, k) ((i >> k)&1)\\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\\nusing ll = long long;\\nusing ld = long double;\\nusing ul = uint64_t;\\nusing pi = std::pair<int, int>;\\nusing pl = std::pair<ll, ll>;\\nusing namespace std;\\n\\ntemplate<typename F, typename S>\\nstd::ostream &operator << (std::ostream &dest, const std::pair<F, S> &p) {\\n dest << p.first << ' ' << p.second;\\n return dest;\\n}\\n\\ntemplate<typename A, typename B>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t);\\n return dest;\\n}\\n\\ntemplate<typename A, typename B, typename C>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t);\\n return dest;\\n}\\n\\ntemplate<typename A, typename B, typename C, typename D>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C, D> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t) << ' ' << std::get<3>(t);\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::vector<std::vector<T>> &v) {\\n int sz = v.size();\\n if (!sz) return dest;\\n for (int i = 0; i < sz; i++) {\\n int m = v[i].size();\\n for (int j = 0; j < m; j++) dest << v[i][j] << (i != sz - 1 && j == m - 1 ? '\\\\n' : ' ');\\n }\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::vector<T> &v) {\\n int sz = v.size();\\n if (!sz) return dest;\\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\\n dest << v[sz - 1];\\n return dest;\\n}\\n\\ntemplate<typename T, size_t sz>\\nstd::ostream &operator << (std::ostream &dest, const std::array<T, sz> &v) {\\n if (!sz) return dest;\\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\\n dest << v[sz - 1];\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::set<T> &v) {\\n for (auto itr = v.begin(); itr != v.end();) {\\n dest << *itr;\\n itr++;\\n if (itr != v.end()) dest << ' ';\\n }\\n return dest;\\n}\\n\\ntemplate<typename T, typename E>\\nstd::ostream &operator << (std::ostream &dest, const std::map<T, E> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ) {\\n dest << '(' << itr->first << \\\", \\\" << itr->second << ')';\\n itr++;\\n if (itr != v.end()) dest << '\\\\n';\\n }\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::vector<T> make_vec(size_t sz, T val) { return std::vector<T>(sz, val); }\\n\\ntemplate<typename T, typename... Tail>\\nauto make_vec(size_t sz, Tail ...tail) {\\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\\n}\\n\\ntemplate<typename T>\\nstd::vector<T> read_vec(size_t sz) {\\n std::vector<T> v(sz);\\n for (int i = 0; i < (int)sz; i++) std::cin >> v[i];\\n return v;\\n}\\n\\ntemplate<typename T, typename... Tail>\\nauto read_vec(size_t sz, Tail ...tail) {\\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\\n for (int i = 0; i < (int)sz; i++) v[i] = read_vec<T>(tail...);\\n return v;\\n}\\n\\ntemplate<typename T, size_t size>\\nauto make_array(T x) { \\n std::array<T, size> res;\\n res.fill(x);\\n return res;\\n}\\n\\ntemplate<typename T, size_t size, size_t size2, size_t... Tail>\\nauto make_array(T x) {\\n std::array<decltype(make_array<T, size2, Tail...>(x)), size> res;\\n res.fill(make_array<T, size2, Tail...>(x));\\n return res;\\n}\\n\\n\\n// x / y以上の最小の整数\\nll ceil_div(ll x, ll y) {\\n assert(y > 0);\\n return (x + (x > 0 ? y - 1 : 0)) / y;\\n}\\n\\n// x / y以下の最大の整数\\nll floor_div(ll x, ll y) {\\n assert(y > 0);\\n return (x + (x > 0 ? 0 : -y + 1)) / y;\\n}\\n\\nvoid io_init() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n}\\n\\n\\n\\n#include <limits>\\n\\ntemplate<typename T>\\nstruct add_min_function{\\n using F = add_min_function<T>;\\n T add, upper;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n add_min_function(): add(0), upper(inf){}\\n add_min_function(T _add, T _upper): add(_add), upper(_upper){}\\n // g(f(x))\\n static F merge(const F &f, const F &g){return {f.add + g.add, std::min(g.upper, f.upper + g.add)};}\\n T fx(T x){return std::min(x + add, upper);}\\n bool operator == (const F &r)const{return add == r.add && upper == r.upper;}\\n};\\n\\n// f(x) = min(max(x + a, b), c)\\ntemplate<typename T>\\nstruct clamp_function{\\n T add, lower, upper;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\\n clamp_function(): add(0), lower(minf), upper(inf){}\\n clamp_function(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper){lower = std::min(_lower, _upper);}\\n // g(f(x))\\n static clamp_function<T> merge(const clamp_function<T> &f, const clamp_function<T> &g){\\n return {f.add + g.add, std::max(g.lower, std::min(f.upper, f.lower) + g.add), std::min(g.upper, std::max(g.lower, f.upper + g.add))};\\n }\\n T fx(T x){\\n return std::min(std::max(x + add, lower), upper);\\n }\\n bool operator == (const clamp_function<T> &r)const{return add == r.add && lower == r.lower && upper == r.upper;}\\n};\\n// f(x) = min(max(x + a, b), c)\\n// min部分によって減少した値をスコアとする\\ntemplate<typename T, typename Tsum>\\nstruct clamp_function_score{\\npublic:\\n T add, lower, upper, score_upper;\\n Tsum score_sum;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\\n clamp_function_score(): add(0), lower(minf), upper(inf), score_upper(inf), score_sum(0){}\\n clamp_function_score(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper), score_upper(_upper), score_sum(0){lower = std::min(_lower, _upper);}\\nprivate:\\n clamp_function_score(T _add, T _lower, T _upper, T _supper, Tsum _ssum): add(_add), lower(_lower), upper(_upper), score_upper(_supper), score_sum(_ssum){}\\npublic:\\n // g(f(x))\\n static clamp_function_score<T, Tsum> merge(const clamp_function_score<T, Tsum> &f, const clamp_function_score<T, Tsum> &g){\\n T _add = f.add + g.add;\\n T _lower = std::max(g.lower, std::min(f.upper, f.lower) + g.add);\\n T _upper = std::min(g.upper, std::max(g.lower, f.upper + g.add));\\n _lower = std::min(_lower, _upper);\\n Tsum _ssum = f.score_sum + g.score_sum;\\n if(f.lower == f.upper){\\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\\n return {_add, _lower, _upper, f.score_upper + g.add, _ssum};\\n }else if(f.lower + g.add >= g.score_upper){\\n assert(_lower == _upper);\\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\\n return {_add, _lower, _upper, f.lower + g.add, _ssum};\\n }else{\\n return {_add, _lower, _upper, std::min(f.score_upper + g.add, g.score_upper), _ssum};\\n }\\n }\\n T fx(T x){\\n return std::min(std::max(x + add, lower), upper);\\n }\\n Tsum fx_score(T x){\\n return score_sum + std::max((T)0, x + add - score_upper);\\n }\\n bool operator == (const clamp_function_score<T, Tsum> &r)const{return add == r.add && lower == r.lower && upper == r.upper && score_upper == r.score_upper && score_sum == r.score_sum;}\\n};\\n\\n\\n\\ntemplate<typename T>\\nstruct prefixsum_min{\\n T sum, pmin;\\n static prefixsum_min<T> id(){\\n return {0, std::numeric_limits<T>::max() / 2};\\n }\\n static prefixsum_min<T> merge(prefixsum_min<T> a, prefixsum_min<T> b){\\n if(b.pmin == std::numeric_limits<T>::max() / 2) return a;\\n return {a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin)};\\n }\\n};\\ntemplate<typename T>\\nstruct prefixsum_max{\\n T sum, pmax;\\n static prefixsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min() / 2};\\n }\\n static prefixsum_max<T> merge(prefixsum_max<T> a, prefixsum_max<T> b){\\n if(b.pmax == std::numeric_limits<T>::min() / 2) return a;\\n return {a.sum + b.sum, std::max(a.pmax, a.sum + b.pmax)};\\n }\\n};\\ntemplate<typename T>\\nstruct suffixsum_min{\\n T sum, smin;\\n static suffixsum_min<T> id(){\\n return {0, std::numeric_limits<T>::max() / 2};\\n }\\n static suffixsum_min<T> merge(suffixsum_min<T> a, suffixsum_min<T> b){\\n if(a.smin == std::numeric_limits<T>::max() / 2) return b;\\n return {a.sum + b.sum, std::min(b.smin, b.sum + a.smin)};\\n }\\n};\\ntemplate<typename T>\\nstruct suffixsum_max{\\n T sum, smax;\\n static suffixsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min() / 2};\\n }\\n static suffixsum_max<T> merge(suffixsum_max<T> a, suffixsum_max<T> b){\\n if(a.smax == std::numeric_limits<T>::min() / 2) return b;\\n return {a.sum + b.sum, std::max(b.smax, b.sum + a.smax)};\\n }\\n};\\ntemplate<typename T>\\nstruct substringsum_max{\\n T sum, pmax, smax, ssmax; // {区間全体のsum, prefixsumのmax, suffixsumのmax, substringsumのmax}\\n static substringsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min(), 0, 0};\\n }\\n static substringsum_max<T> merge(substringsum_max<T> a, substringsum_max<T> b){\\n if(b.pmax == std::numeric_limits<T>::min()) return a;\\n if(a.pmax == std::numeric_limits<T>::min()) return b;\\n T sum = a.sum + b.sum;\\n T pmax = std::max(a.pmax, a.sum + b.pmax);\\n T smax = std::max(a.smax + b.sum, b.smax);\\n return {sum, pmax, smax, std::max({a.ssmax, b.ssmax, pmax, smax})};\\n }\\n};\\n// 01列の0を-1として扱う\\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax\\nstruct excess_value{\\npublic:\\n int rank, sum, pmin, pmax;\\n static constexpr int inf = 1 << 30;\\n excess_value(): rank(inf), pmin(inf), pmax(-inf){}\\n excess_value(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum){}\\nprivate:\\n excess_value(int a, int b, int c, int d): rank(a), sum(b), pmin(c), pmax(d){}\\npublic:\\n static excess_value merge(excess_value a, excess_value b){\\n if(a.rank == inf) return b;\\n if(b.rank == inf) return a;\\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), std::max(a.pmax, a.sum + b.pmax)};\\n }\\n};\\n// 01列の0を-1として扱う\\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax, 接尾辞のmin, 接尾辞のmax\\nstruct excess_value2{\\npublic:\\n int rank, sum, pmin, pmax, smin, smax;\\n static constexpr int inf = 1 << 30;\\n excess_value2(): rank(inf), pmin(inf), pmax(-inf), smin(inf), smax(-inf){}\\n excess_value2(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum), smin(sum), smax(sum){}\\nprivate:\\n excess_value2(int a, int b, int c, int d, int e, int f): rank(a), sum(b), pmin(c), pmax(d), smin(e), smax(f){}\\npublic:\\n static excess_value2 merge(excess_value2 a, excess_value2 b){\\n if(a.rank == inf) return b;\\n if(b.rank == inf) return a;\\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), \\n std::max(a.pmax, a.sum + b.pmax), std::min(a.smin + b.sum, b.smin), std::max(a.smax + b.sum, b.smax)};\\n }\\n};\\n\\n\\ntemplate<typename T>\\nstruct range_add_chmin_chmax_range_freq {\\n private:\\n static constexpr T inf = std::numeric_limits<T>::max();\\n static constexpr T minf = std::numeric_limits<T>::min();\\n using F = clamp_function<T>;\\n int N;\\n std::vector<T> V, B;\\n std::vector<F> lz;\\n std::vector<bool> is_sorted;\\n static constexpr int sq = 256;\\n \\n public:\\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V), lz((N + sq - 1) / sq, F()), is_sorted((N + sq - 1) / sq, true) {\\n B = V;\\n for (int i = 0; i < (N + sq - 1) / sq; i++) {\\n int L = i * sq;\\n int R = std::min(L + sq, N);\\n std::sort(B.begin() + L, B.begin() + R);\\n }\\n }\\n\\n // [l, r)の x <- min(max(x + add, lower), upper)\\n void apply(int l, int r, T add, T lower, T upper) {\\n assert(l <= r && lower <= upper);\\n int lb = (l + sq - 1) / sq, rb = r / sq;\\n F f{add, lower, upper};\\n if (l < lb * sq) is_sorted[lb - 1] = false;\\n if (rb * sq < r) is_sorted[rb] = false;\\n if (lb > rb) {\\n int L = rb * sq, R = std::min(N, L + sq);\\n for (int i = L; i < R; i++) {\\n V[i] = lz[rb].fx(V[i]);\\n if (l <= i && i < r) V[i] = f.fx(V[i]);\\n }\\n lz[rb] = F{};\\n return;\\n }\\n if (l < lb * sq) {\\n int L = (lb - 1) * sq, R = std::min(N, L + sq);\\n for (int i = L; i < l; i++) {\\n V[i] = lz[lb - 1].fx(V[i]);\\n }\\n for (int i = l; i < R; i++) {\\n V[i] = f.fx(lz[lb - 1].fx(V[i]));\\n }\\n lz[lb - 1] = F{};\\n }\\n if (rb * sq < r) {\\n int L = rb * sq, R = std::min(N, L + sq);\\n for (int i = L; i < r; i++) {\\n V[i] = f.fx(lz[rb].fx(V[i]));\\n }\\n for (int i = r; i < R; i++) {\\n V[i] = lz[rb].fx(V[i]);\\n }\\n lz[rb] = F{};\\n }\\n for (int i = lb; i < rb; i++) {\\n lz[i] = F::merge(lz[i], f);\\n }\\n }\\n\\n /*\\n // [l, r)のx以上の最小要素\\n T lower_bound(int l, int r, T x) {\\n assert(l <= r);\\n int lb = (l + sq - 1) / sq, rb = r / sq;\\n T res = inf;\\n if (lb >= rb) {\\n for (int i = l; i < r; i++) {\\n if (V[i] >= x) res = std::min(res, V[i]);\\n }\\n return res;\\n }\\n //\\n return res;\\n }\\n */\\n\\n // [l, r)のrx未満の要素数\\n int range_freq(int l, int r, T rx) {\\n assert(l <= r);\\n int lb = (l + sq - 1) / sq, rb = r / sq;\\n int res = 0;\\n if (lb > rb) {\\n for (int i = l; i < r; i++) {\\n T y = lz[rb].fx(V[i]);\\n if (y < rx) res++;\\n }\\n return res;\\n }\\n for (int i = l; i < lb * sq; i++) {\\n T y = lz[lb - 1].fx(V[i]);\\n if (y < rx) res++;\\n }\\n for (int i = rb * sq; i < r; i++) {\\n T y = lz[rb].fx(V[i]);\\n if (y < rx) res++;\\n }\\n for (int i = lb; i < rb; i++) {\\n if (lz[i].lower >= rx) continue;\\n int L = i * sq, R = std::min(N, L + sq);\\n if (lz[i].upper < rx) {\\n res += R - L;\\n continue;\\n }\\n if (!is_sorted[i]) {\\n for (int j = L; j < R; j++) B[j] = V[j];\\n std::sort(B.begin() + L, B.begin() + R);\\n is_sorted[i] = true;\\n }\\n res += std::lower_bound(B.begin() + L, B.begin() + R, rx - lz[i].add) - (B.begin() + L);\\n }\\n return res;\\n }\\n /*\\n\\n // [l, r)のrx未満の要素の和\\n T range_freq_sum(int l, int r, T rx) {\\n assert(l <= r);\\n int lb = (l + sq - 1) / sq, rb = r / sq;\\n T res = 0;\\n if (lb >= rb) {\\n for (int i = l; i < r; i++) {\\n if (V[i] < rx) res += V[i];\\n }\\n return res;\\n }\\n //\\n return res;\\n }\\n */\\n};\\n\\nint main() {\\n io_init();\\n int N, Q;\\n std::cin >> N >> Q;\\n auto A = read_vec<ll>(N);\\n range_add_chmin_chmax_range_freq<ll> F(A);\\n\\n static constexpr ll inf = 1LL << 60, minf = -inf;\\n for (int i = 0; i < Q; i++) {\\n int t, l, r;\\n ll x;\\n std::cin >> t >> l >> r >> x;\\n l--;\\n if (t == 1) {\\n F.apply(l, r, 0, minf, x);\\n } else if (t == 2) {\\n F.apply(l, r, 0, x, inf);\\n } else if (t == 3) {\\n F.apply(l, r, x, minf, inf);\\n } else {\\n ll y;\\n std::cin >> y;\\n ll ans = F.range_freq(l, r, y + 1) - F.range_freq(l, r, x);\\n std::cout << ans << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1080,\n \"memory_kb\": 5464,\n \"score_of_the_acc\": -0.7917,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3170_9983653\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <array>\\n#include <tuple>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <bitset>\\n#include <cmath>\\n#include <functional>\\n#include <cassert>\\n#include <climits>\\n#include <iomanip>\\n#include <numeric>\\n#include <memory>\\n#include <random>\\n#include <thread>\\n#include <chrono>\\n#define allof(obj) (obj).begin(), (obj).end()\\n#define range(i, l, r) for(int i=l;i<r;i++)\\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\\n#define bit_kth(i, k) ((i >> k)&1)\\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\\nusing ll = long long;\\nusing ld = long double;\\nusing ul = uint64_t;\\nusing pi = std::pair<int, int>;\\nusing pl = std::pair<ll, ll>;\\nusing namespace std;\\n\\ntemplate<typename F, typename S>\\nstd::ostream &operator << (std::ostream &dest, const std::pair<F, S> &p) {\\n dest << p.first << ' ' << p.second;\\n return dest;\\n}\\n\\ntemplate<typename A, typename B>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t);\\n return dest;\\n}\\n\\ntemplate<typename A, typename B, typename C>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t);\\n return dest;\\n}\\n\\ntemplate<typename A, typename B, typename C, typename D>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C, D> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t) << ' ' << std::get<3>(t);\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::vector<std::vector<T>> &v) {\\n int sz = v.size();\\n if (!sz) return dest;\\n for (int i = 0; i < sz; i++) {\\n int m = v[i].size();\\n for (int j = 0; j < m; j++) dest << v[i][j] << (i != sz - 1 && j == m - 1 ? '\\\\n' : ' ');\\n }\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::vector<T> &v) {\\n int sz = v.size();\\n if (!sz) return dest;\\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\\n dest << v[sz - 1];\\n return dest;\\n}\\n\\ntemplate<typename T, size_t sz>\\nstd::ostream &operator << (std::ostream &dest, const std::array<T, sz> &v) {\\n if (!sz) return dest;\\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\\n dest << v[sz - 1];\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::set<T> &v) {\\n for (auto itr = v.begin(); itr != v.end();) {\\n dest << *itr;\\n itr++;\\n if (itr != v.end()) dest << ' ';\\n }\\n return dest;\\n}\\n\\ntemplate<typename T, typename E>\\nstd::ostream &operator << (std::ostream &dest, const std::map<T, E> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ) {\\n dest << '(' << itr->first << \\\", \\\" << itr->second << ')';\\n itr++;\\n if (itr != v.end()) dest << '\\\\n';\\n }\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::vector<T> make_vec(size_t sz, T val) { return std::vector<T>(sz, val); }\\n\\ntemplate<typename T, typename... Tail>\\nauto make_vec(size_t sz, Tail ...tail) {\\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\\n}\\n\\ntemplate<typename T>\\nstd::vector<T> read_vec(size_t sz) {\\n std::vector<T> v(sz);\\n for (int i = 0; i < (int)sz; i++) std::cin >> v[i];\\n return v;\\n}\\n\\ntemplate<typename T, typename... Tail>\\nauto read_vec(size_t sz, Tail ...tail) {\\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\\n for (int i = 0; i < (int)sz; i++) v[i] = read_vec<T>(tail...);\\n return v;\\n}\\n\\ntemplate<typename T, size_t size>\\nauto make_array(T x) { \\n std::array<T, size> res;\\n res.fill(x);\\n return res;\\n}\\n\\ntemplate<typename T, size_t size, size_t size2, size_t... Tail>\\nauto make_array(T x) {\\n std::array<decltype(make_array<T, size2, Tail...>(x)), size> res;\\n res.fill(make_array<T, size2, Tail...>(x));\\n return res;\\n}\\n\\n\\n// x / y以上の最小の整数\\nll ceil_div(ll x, ll y) {\\n assert(y > 0);\\n return (x + (x > 0 ? y - 1 : 0)) / y;\\n}\\n\\n// x / y以下の最大の整数\\nll floor_div(ll x, ll y) {\\n assert(y > 0);\\n return (x + (x > 0 ? 0 : -y + 1)) / y;\\n}\\n\\nvoid io_init() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n}\\n\\n\\n\\n#include <limits>\\n\\ntemplate<typename T>\\nstruct add_min_function{\\n using F = add_min_function<T>;\\n T add, upper;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n add_min_function(): add(0), upper(inf){}\\n add_min_function(T _add, T _upper): add(_add), upper(_upper){}\\n // g(f(x))\\n static F merge(const F &f, const F &g){return {f.add + g.add, std::min(g.upper, f.upper + g.add)};}\\n T fx(T x){return std::min(x + add, upper);}\\n bool operator == (const F &r)const{return add == r.add && upper == r.upper;}\\n};\\n\\n// f(x) = min(max(x + a, b), c)\\ntemplate<typename T>\\nstruct clamp_function{\\n T add, lower, upper;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\\n clamp_function(): add(0), lower(minf), upper(inf){}\\n clamp_function(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper){lower = std::min(_lower, _upper);}\\n // g(f(x))\\n static clamp_function<T> merge(const clamp_function<T> &f, const clamp_function<T> &g){\\n return {f.add + g.add, std::max(g.lower, std::min(f.upper, f.lower) + g.add), std::min(g.upper, std::max(g.lower, f.upper + g.add))};\\n }\\n T fx(T x){\\n return std::min(std::max(x + add, lower), upper);\\n }\\n bool operator == (const clamp_function<T> &r)const{return add == r.add && lower == r.lower && upper == r.upper;}\\n};\\n// f(x) = min(max(x + a, b), c)\\n// min部分によって減少した値をスコアとする\\ntemplate<typename T, typename Tsum>\\nstruct clamp_function_score{\\npublic:\\n T add, lower, upper, score_upper;\\n Tsum score_sum;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\\n clamp_function_score(): add(0), lower(minf), upper(inf), score_upper(inf), score_sum(0){}\\n clamp_function_score(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper), score_upper(_upper), score_sum(0){lower = std::min(_lower, _upper);}\\nprivate:\\n clamp_function_score(T _add, T _lower, T _upper, T _supper, Tsum _ssum): add(_add), lower(_lower), upper(_upper), score_upper(_supper), score_sum(_ssum){}\\npublic:\\n // g(f(x))\\n static clamp_function_score<T, Tsum> merge(const clamp_function_score<T, Tsum> &f, const clamp_function_score<T, Tsum> &g){\\n T _add = f.add + g.add;\\n T _lower = std::max(g.lower, std::min(f.upper, f.lower) + g.add);\\n T _upper = std::min(g.upper, std::max(g.lower, f.upper + g.add));\\n _lower = std::min(_lower, _upper);\\n Tsum _ssum = f.score_sum + g.score_sum;\\n if(f.lower == f.upper){\\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\\n return {_add, _lower, _upper, f.score_upper + g.add, _ssum};\\n }else if(f.lower + g.add >= g.score_upper){\\n assert(_lower == _upper);\\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\\n return {_add, _lower, _upper, f.lower + g.add, _ssum};\\n }else{\\n return {_add, _lower, _upper, std::min(f.score_upper + g.add, g.score_upper), _ssum};\\n }\\n }\\n T fx(T x){\\n return std::min(std::max(x + add, lower), upper);\\n }\\n Tsum fx_score(T x){\\n return score_sum + std::max((T)0, x + add - score_upper);\\n }\\n bool operator == (const clamp_function_score<T, Tsum> &r)const{return add == r.add && lower == r.lower && upper == r.upper && score_upper == r.score_upper && score_sum == r.score_sum;}\\n};\\n\\n\\n\\ntemplate<typename T>\\nstruct prefixsum_min{\\n T sum, pmin;\\n static prefixsum_min<T> id(){\\n return {0, std::numeric_limits<T>::max() / 2};\\n }\\n static prefixsum_min<T> merge(prefixsum_min<T> a, prefixsum_min<T> b){\\n if(b.pmin == std::numeric_limits<T>::max() / 2) return a;\\n return {a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin)};\\n }\\n};\\ntemplate<typename T>\\nstruct prefixsum_max{\\n T sum, pmax;\\n static prefixsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min() / 2};\\n }\\n static prefixsum_max<T> merge(prefixsum_max<T> a, prefixsum_max<T> b){\\n if(b.pmax == std::numeric_limits<T>::min() / 2) return a;\\n return {a.sum + b.sum, std::max(a.pmax, a.sum + b.pmax)};\\n }\\n};\\ntemplate<typename T>\\nstruct suffixsum_min{\\n T sum, smin;\\n static suffixsum_min<T> id(){\\n return {0, std::numeric_limits<T>::max() / 2};\\n }\\n static suffixsum_min<T> merge(suffixsum_min<T> a, suffixsum_min<T> b){\\n if(a.smin == std::numeric_limits<T>::max() / 2) return b;\\n return {a.sum + b.sum, std::min(b.smin, b.sum + a.smin)};\\n }\\n};\\ntemplate<typename T>\\nstruct suffixsum_max{\\n T sum, smax;\\n static suffixsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min() / 2};\\n }\\n static suffixsum_max<T> merge(suffixsum_max<T> a, suffixsum_max<T> b){\\n if(a.smax == std::numeric_limits<T>::min() / 2) return b;\\n return {a.sum + b.sum, std::max(b.smax, b.sum + a.smax)};\\n }\\n};\\ntemplate<typename T>\\nstruct substringsum_max{\\n T sum, pmax, smax, ssmax; // {区間全体のsum, prefixsumのmax, suffixsumのmax, substringsumのmax}\\n static substringsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min(), 0, 0};\\n }\\n static substringsum_max<T> merge(substringsum_max<T> a, substringsum_max<T> b){\\n if(b.pmax == std::numeric_limits<T>::min()) return a;\\n if(a.pmax == std::numeric_limits<T>::min()) return b;\\n T sum = a.sum + b.sum;\\n T pmax = std::max(a.pmax, a.sum + b.pmax);\\n T smax = std::max(a.smax + b.sum, b.smax);\\n return {sum, pmax, smax, std::max({a.ssmax, b.ssmax, pmax, smax})};\\n }\\n};\\n// 01列の0を-1として扱う\\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax\\nstruct excess_value{\\npublic:\\n int rank, sum, pmin, pmax;\\n static constexpr int inf = 1 << 30;\\n excess_value(): rank(inf), pmin(inf), pmax(-inf){}\\n excess_value(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum){}\\nprivate:\\n excess_value(int a, int b, int c, int d): rank(a), sum(b), pmin(c), pmax(d){}\\npublic:\\n static excess_value merge(excess_value a, excess_value b){\\n if(a.rank == inf) return b;\\n if(b.rank == inf) return a;\\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), std::max(a.pmax, a.sum + b.pmax)};\\n }\\n};\\n// 01列の0を-1として扱う\\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax, 接尾辞のmin, 接尾辞のmax\\nstruct excess_value2{\\npublic:\\n int rank, sum, pmin, pmax, smin, smax;\\n static constexpr int inf = 1 << 30;\\n excess_value2(): rank(inf), pmin(inf), pmax(-inf), smin(inf), smax(-inf){}\\n excess_value2(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum), smin(sum), smax(sum){}\\nprivate:\\n excess_value2(int a, int b, int c, int d, int e, int f): rank(a), sum(b), pmin(c), pmax(d), smin(e), smax(f){}\\npublic:\\n static excess_value2 merge(excess_value2 a, excess_value2 b){\\n if(a.rank == inf) return b;\\n if(b.rank == inf) return a;\\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), \\n std::max(a.pmax, a.sum + b.pmax), std::min(a.smin + b.sum, b.smin), std::max(a.smax + b.sum, b.smax)};\\n }\\n};\\n\\n\\n/*\\ntemplate<typename T>\\nstruct range_add_chmin_chmax_range_freq {\\n private:\\n using F = clamp_function<T>;\\n struct query {\\n int type, l, r;\\n F f;\\n };\\n int N;\\n std::vector<T> V;\\n std::vector<query> Qs;\\n \\n public:\\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V) {}\\n\\n // [l, r)の x <- min(max(x + add, lower), upper)\\n void apply(int l, int r, T add, T lower, T upper) {\\n assert(lower <= upper);\\n Qs.push_back({0, l, r, F{add, lower, upper}});\\n }\\n\\n // [l, r)のx以上の最小要素\\n void lower_bound(int l, int r, T x) {\\n Qs.push_back({1, l, r, F{x, x, x}});\\n }\\n\\n // [l, r)のrx未満の要素数\\n void range_freq(int l, int r, T rx) {\\n Qs.push_back({2, l, r, F{rx, rx, rx}});\\n }\\n\\n std::vector<T> solve() {\\n int Q = Qs.size(), K = 2 * sqrt(N);\\n std::vector<int> Bbegin{0};\\n std::vector<F> lz{F{}};\\n std::vector<T> B;\\n\\n auto propagate = [&]() -> void {\\n for (int i = 0; i < (int)Bbegin.size(); i++) {\\n if (lz[i] == F()) continue;\\n int l = Bbegin[i];\\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\\n for (int j = l; j < r; j++) V[j] = lz[i].fx(V[j]);\\n }\\n };\\n\\n auto make_block = [&](int lq, int rq) -> void {\\n Bbegin = {0};\\n for (int i = lq; i < rq; i++) {\\n Bbegin.push_back(Qs[i].l);\\n Bbegin.push_back(Qs[i].r);\\n }\\n std::sort(Bbegin.begin(), Bbegin.end());\\n Bbegin.erase(std::unique(Bbegin.begin(), Bbegin.end()), Bbegin.end());\\n lz = std::vector<F>(Bbegin.size(), F());\\n B = V;\\n for (int i = 0; i < Bbegin.size(); i++) {\\n int l = Bbegin[i];\\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\\n std::sort(B.begin() + l, B.begin() + r);\\n }\\n };\\n\\n std::vector<T> ans;\\n\\n for (int i = 0; i < Q; i++) {\\n if (i % K == 0) {\\n propagate();\\n make_block(i, std::min(Q, i + K));\\n }\\n int l = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].l) - Bbegin.begin();\\n int r = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].r) - Bbegin.begin();\\n if (Qs[i].type == 0) {\\n for (int j = l; j < r; j++) {\\n lz[j] = F::merge(lz[j], Qs[i].f);\\n }\\n } else if (Qs[i].type == 1) {\\n T lb = std::numeric_limits<T>::max();\\n T x = Qs[i].f.add;\\n for (int j = l; j < r; j++) { \\n T y = x - lz[j].add;\\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\\n if (itr != B.begin() + Bbegin[j + 1]) {\\n lb = std::min(lb, lz[j].fx(*itr));\\n }\\n if (itr != B.begin() + Bbegin[j] && lz[j].lower >= x) {\\n lb = std::min(lb, lz[j].lower);\\n }\\n }\\n ans.push_back(lb);\\n } else if (Qs[i].type == 2) {\\n T cnt = 0, rx = Qs[i].f.add;\\n for (int j = l; j < r; j++) { \\n if (lz[j].lower >= rx) continue;\\n if (lz[j].upper < rx) {\\n cnt += Bbegin[j + 1] - Bbegin[j];\\n continue;\\n }\\n T y = rx - lz[j].add;\\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\\n cnt += itr - (B.begin() + Bbegin[j]);\\n }\\n ans.push_back(cnt);\\n }\\n }\\n return ans;\\n }\\n};\\n*/\\n\\ntemplate<typename T>\\nstruct range_add_chmin_chmax_range_freq {\\n private:\\n static constexpr T inf = std::numeric_limits<T>::max();\\n static constexpr T minf = std::numeric_limits<T>::min();\\n using F = clamp_function<T>;\\n int N;\\n std::vector<T> V, B;\\n std::vector<F> lz;\\n std::vector<bool> is_sorted;\\n static constexpr int sq = 128;\\n \\n public:\\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V), lz((N + sq - 1) / sq, F()), is_sorted((N + sq - 1) / sq, true) {\\n B = V;\\n for (int i = 0; i < (N + sq - 1) / sq; i++) {\\n int L = i * sq;\\n int R = std::min(L + sq, N);\\n std::sort(B.begin() + L, B.begin() + R);\\n }\\n }\\n\\n // [l, r)の x <- min(max(x + add, lower), upper)\\n void apply(int l, int r, T add, T lower, T upper) {\\n assert(l <= r && lower <= upper);\\n int lb = (l + sq - 1) / sq, rb = r / sq;\\n F f{add, lower, upper};\\n if (l < lb * sq) is_sorted[lb - 1] = false;\\n if (rb * sq < r) is_sorted[rb] = false;\\n if (lb > rb) {\\n int L = rb * sq, R = std::min(N, L + sq);\\n for (int i = L; i < R; i++) {\\n V[i] = lz[rb].fx(V[i]);\\n if (l <= i && i < r) V[i] = f.fx(V[i]);\\n }\\n lz[rb] = F{};\\n return;\\n }\\n if (l < lb * sq) {\\n int L = (lb - 1) * sq, R = std::min(N, L + sq);\\n for (int i = L; i < l; i++) {\\n V[i] = lz[lb - 1].fx(V[i]);\\n }\\n for (int i = l; i < R; i++) {\\n V[i] = f.fx(lz[lb - 1].fx(V[i]));\\n }\\n lz[lb - 1] = F{};\\n }\\n if (rb * sq < r) {\\n int L = rb * sq, R = std::min(N, L + sq);\\n for (int i = L; i < r; i++) {\\n V[i] = f.fx(lz[rb].fx(V[i]));\\n }\\n for (int i = r; i < R; i++) {\\n V[i] = lz[rb].fx(V[i]);\\n }\\n lz[rb] = F{};\\n }\\n for (int i = lb; i < rb; i++) {\\n lz[i] = F::merge(lz[i], f);\\n }\\n }\\n\\n /*\\n // [l, r)のx以上の最小要素\\n T lower_bound(int l, int r, T x) {\\n assert(l <= r);\\n int lb = (l + sq - 1) / sq, rb = r / sq;\\n T res = inf;\\n if (lb >= rb) {\\n for (int i = l; i < r; i++) {\\n if (V[i] >= x) res = std::min(res, V[i]);\\n }\\n return res;\\n }\\n //\\n return res;\\n }\\n */\\n\\n // [l, r)のrx未満の要素数\\n int range_freq(int l, int r, T rx) {\\n assert(l <= r);\\n int lb = (l + sq - 1) / sq, rb = r / sq;\\n int res = 0;\\n if (lb > rb) {\\n for (int i = l; i < r; i++) {\\n T y = lz[rb].fx(V[i]);\\n if (y < rx) res++;\\n }\\n return res;\\n }\\n for (int i = l; i < lb * sq; i++) {\\n T y = lz[lb - 1].fx(V[i]);\\n if (y < rx) res++;\\n }\\n for (int i = rb * sq; i < r; i++) {\\n T y = lz[rb].fx(V[i]);\\n if (y < rx) res++;\\n }\\n for (int i = lb; i < rb; i++) {\\n if (lz[i].lower >= rx) continue;\\n int L = i * sq, R = std::min(N, L + sq);\\n if (lz[i].upper < rx) {\\n res += R - L;\\n continue;\\n }\\n if (!is_sorted[i]) {\\n for (int j = L; j < R; j++) B[j] = V[j];\\n std::sort(B.begin() + L, B.begin() + R);\\n is_sorted[i] = true;\\n }\\n res += std::lower_bound(B.begin() + L, B.begin() + R, rx - lz[i].add) - (B.begin() + L);\\n }\\n return res;\\n }\\n /*\\n\\n // [l, r)のrx未満の要素の和\\n T range_freq_sum(int l, int r, T rx) {\\n assert(l <= r);\\n int lb = (l + sq - 1) / sq, rb = r / sq;\\n T res = 0;\\n if (lb >= rb) {\\n for (int i = l; i < r; i++) {\\n if (V[i] < rx) res += V[i];\\n }\\n return res;\\n }\\n //\\n return res;\\n }\\n */\\n};\\n\\nint main() {\\n io_init();\\n int N, Q;\\n std::cin >> N >> Q;\\n auto A = read_vec<ll>(N);\\n range_add_chmin_chmax_range_freq<ll> F(A);\\n\\n static constexpr ll inf = 1LL << 60, minf = -inf;\\n for (int i = 0; i < Q; i++) {\\n int t, l, r;\\n ll x;\\n std::cin >> t >> l >> r >> x;\\n l--;\\n if (t == 1) {\\n F.apply(l, r, 0, minf, x);\\n } else if (t == 2) {\\n F.apply(l, r, 0, x, inf);\\n } else if (t == 3) {\\n F.apply(l, r, x, minf, inf);\\n } else {\\n ll y;\\n std::cin >> y;\\n ll ans = F.range_freq(l, r, y + 1) - F.range_freq(l, r, x);\\n std::cout << ans << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1000,\n \"memory_kb\": 5468,\n \"score_of_the_acc\": -0.7402,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3170_9983016\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <array>\\n#include <tuple>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <bitset>\\n#include <cmath>\\n#include <functional>\\n#include <cassert>\\n#include <climits>\\n#include <iomanip>\\n#include <numeric>\\n#include <memory>\\n#include <random>\\n#include <thread>\\n#include <chrono>\\n#define allof(obj) (obj).begin(), (obj).end()\\n#define range(i, l, r) for(int i=l;i<r;i++)\\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\\n#define bit_kth(i, k) ((i >> k)&1)\\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\\nusing ll = long long;\\nusing ld = long double;\\nusing ul = uint64_t;\\nusing pi = std::pair<int, int>;\\nusing pl = std::pair<ll, ll>;\\nusing namespace std;\\n\\ntemplate<typename F, typename S>\\nstd::ostream &operator << (std::ostream &dest, const std::pair<F, S> &p) {\\n dest << p.first << ' ' << p.second;\\n return dest;\\n}\\n\\ntemplate<typename A, typename B>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t);\\n return dest;\\n}\\n\\ntemplate<typename A, typename B, typename C>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t);\\n return dest;\\n}\\n\\ntemplate<typename A, typename B, typename C, typename D>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C, D> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t) << ' ' << std::get<3>(t);\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::vector<std::vector<T>> &v) {\\n int sz = v.size();\\n if (!sz) return dest;\\n for (int i = 0; i < sz; i++) {\\n int m = v[i].size();\\n for (int j = 0; j < m; j++) dest << v[i][j] << (i != sz - 1 && j == m - 1 ? '\\\\n' : ' ');\\n }\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::vector<T> &v) {\\n int sz = v.size();\\n if (!sz) return dest;\\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\\n dest << v[sz - 1];\\n return dest;\\n}\\n\\ntemplate<typename T, size_t sz>\\nstd::ostream &operator << (std::ostream &dest, const std::array<T, sz> &v) {\\n if (!sz) return dest;\\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\\n dest << v[sz - 1];\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::set<T> &v) {\\n for (auto itr = v.begin(); itr != v.end();) {\\n dest << *itr;\\n itr++;\\n if (itr != v.end()) dest << ' ';\\n }\\n return dest;\\n}\\n\\ntemplate<typename T, typename E>\\nstd::ostream &operator << (std::ostream &dest, const std::map<T, E> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ) {\\n dest << '(' << itr->first << \\\", \\\" << itr->second << ')';\\n itr++;\\n if (itr != v.end()) dest << '\\\\n';\\n }\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::vector<T> make_vec(size_t sz, T val) { return std::vector<T>(sz, val); }\\n\\ntemplate<typename T, typename... Tail>\\nauto make_vec(size_t sz, Tail ...tail) {\\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\\n}\\n\\ntemplate<typename T>\\nstd::vector<T> read_vec(size_t sz) {\\n std::vector<T> v(sz);\\n for (int i = 0; i < (int)sz; i++) std::cin >> v[i];\\n return v;\\n}\\n\\ntemplate<typename T, typename... Tail>\\nauto read_vec(size_t sz, Tail ...tail) {\\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\\n for (int i = 0; i < (int)sz; i++) v[i] = read_vec<T>(tail...);\\n return v;\\n}\\n\\ntemplate<typename T, size_t size>\\nauto make_array(T x) { \\n std::array<T, size> res;\\n res.fill(x);\\n return res;\\n}\\n\\ntemplate<typename T, size_t size, size_t size2, size_t... Tail>\\nauto make_array(T x) {\\n std::array<decltype(make_array<T, size2, Tail...>(x)), size> res;\\n res.fill(make_array<T, size2, Tail...>(x));\\n return res;\\n}\\n\\n\\n// x / y以上の最小の整数\\nll ceil_div(ll x, ll y) {\\n assert(y > 0);\\n return (x + (x > 0 ? y - 1 : 0)) / y;\\n}\\n\\n// x / y以下の最大の整数\\nll floor_div(ll x, ll y) {\\n assert(y > 0);\\n return (x + (x > 0 ? 0 : -y + 1)) / y;\\n}\\n\\nvoid io_init() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n}\\n\\n\\n\\n#include <limits>\\n\\ntemplate<typename T>\\nstruct add_min_function{\\n using F = add_min_function<T>;\\n T add, upper;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n add_min_function(): add(0), upper(inf){}\\n add_min_function(T _add, T _upper): add(_add), upper(_upper){}\\n // g(f(x))\\n static F merge(const F &f, const F &g){return {f.add + g.add, std::min(g.upper, f.upper + g.add)};}\\n T fx(T x){return std::min(x + add, upper);}\\n bool operator == (const F &r)const{return add == r.add && upper == r.upper;}\\n};\\n\\n// f(x) = min(max(x + a, b), c)\\ntemplate<typename T>\\nstruct clamp_function{\\n T add, lower, upper;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\\n clamp_function(): add(0), lower(minf), upper(inf){}\\n clamp_function(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper){lower = std::min(_lower, _upper);}\\n // g(f(x))\\n static clamp_function<T> merge(const clamp_function<T> &f, const clamp_function<T> &g){\\n return {f.add + g.add, std::max(g.lower, std::min(f.upper, f.lower) + g.add), std::min(g.upper, std::max(g.lower, f.upper + g.add))};\\n }\\n T fx(T x){\\n return std::min(std::max(x + add, lower), upper);\\n }\\n bool operator == (const clamp_function<T> &r)const{return add == r.add && lower == r.lower && upper == r.upper;}\\n};\\n// f(x) = min(max(x + a, b), c)\\n// min部分によって減少した値をスコアとする\\ntemplate<typename T, typename Tsum>\\nstruct clamp_function_score{\\npublic:\\n T add, lower, upper, score_upper;\\n Tsum score_sum;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\\n clamp_function_score(): add(0), lower(minf), upper(inf), score_upper(inf), score_sum(0){}\\n clamp_function_score(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper), score_upper(_upper), score_sum(0){lower = std::min(_lower, _upper);}\\nprivate:\\n clamp_function_score(T _add, T _lower, T _upper, T _supper, Tsum _ssum): add(_add), lower(_lower), upper(_upper), score_upper(_supper), score_sum(_ssum){}\\npublic:\\n // g(f(x))\\n static clamp_function_score<T, Tsum> merge(const clamp_function_score<T, Tsum> &f, const clamp_function_score<T, Tsum> &g){\\n T _add = f.add + g.add;\\n T _lower = std::max(g.lower, std::min(f.upper, f.lower) + g.add);\\n T _upper = std::min(g.upper, std::max(g.lower, f.upper + g.add));\\n _lower = std::min(_lower, _upper);\\n Tsum _ssum = f.score_sum + g.score_sum;\\n if(f.lower == f.upper){\\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\\n return {_add, _lower, _upper, f.score_upper + g.add, _ssum};\\n }else if(f.lower + g.add >= g.score_upper){\\n assert(_lower == _upper);\\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\\n return {_add, _lower, _upper, f.lower + g.add, _ssum};\\n }else{\\n return {_add, _lower, _upper, std::min(f.score_upper + g.add, g.score_upper), _ssum};\\n }\\n }\\n T fx(T x){\\n return std::min(std::max(x + add, lower), upper);\\n }\\n Tsum fx_score(T x){\\n return score_sum + std::max((T)0, x + add - score_upper);\\n }\\n bool operator == (const clamp_function_score<T, Tsum> &r)const{return add == r.add && lower == r.lower && upper == r.upper && score_upper == r.score_upper && score_sum == r.score_sum;}\\n};\\n\\n\\n\\ntemplate<typename T>\\nstruct prefixsum_min{\\n T sum, pmin;\\n static prefixsum_min<T> id(){\\n return {0, std::numeric_limits<T>::max() / 2};\\n }\\n static prefixsum_min<T> merge(prefixsum_min<T> a, prefixsum_min<T> b){\\n if(b.pmin == std::numeric_limits<T>::max() / 2) return a;\\n return {a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin)};\\n }\\n};\\ntemplate<typename T>\\nstruct prefixsum_max{\\n T sum, pmax;\\n static prefixsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min() / 2};\\n }\\n static prefixsum_max<T> merge(prefixsum_max<T> a, prefixsum_max<T> b){\\n if(b.pmax == std::numeric_limits<T>::min() / 2) return a;\\n return {a.sum + b.sum, std::max(a.pmax, a.sum + b.pmax)};\\n }\\n};\\ntemplate<typename T>\\nstruct suffixsum_min{\\n T sum, smin;\\n static suffixsum_min<T> id(){\\n return {0, std::numeric_limits<T>::max() / 2};\\n }\\n static suffixsum_min<T> merge(suffixsum_min<T> a, suffixsum_min<T> b){\\n if(a.smin == std::numeric_limits<T>::max() / 2) return b;\\n return {a.sum + b.sum, std::min(b.smin, b.sum + a.smin)};\\n }\\n};\\ntemplate<typename T>\\nstruct suffixsum_max{\\n T sum, smax;\\n static suffixsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min() / 2};\\n }\\n static suffixsum_max<T> merge(suffixsum_max<T> a, suffixsum_max<T> b){\\n if(a.smax == std::numeric_limits<T>::min() / 2) return b;\\n return {a.sum + b.sum, std::max(b.smax, b.sum + a.smax)};\\n }\\n};\\ntemplate<typename T>\\nstruct substringsum_max{\\n T sum, pmax, smax, ssmax; // {区間全体のsum, prefixsumのmax, suffixsumのmax, substringsumのmax}\\n static substringsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min(), 0, 0};\\n }\\n static substringsum_max<T> merge(substringsum_max<T> a, substringsum_max<T> b){\\n if(b.pmax == std::numeric_limits<T>::min()) return a;\\n if(a.pmax == std::numeric_limits<T>::min()) return b;\\n T sum = a.sum + b.sum;\\n T pmax = std::max(a.pmax, a.sum + b.pmax);\\n T smax = std::max(a.smax + b.sum, b.smax);\\n return {sum, pmax, smax, std::max({a.ssmax, b.ssmax, pmax, smax})};\\n }\\n};\\n// 01列の0を-1として扱う\\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax\\nstruct excess_value{\\npublic:\\n int rank, sum, pmin, pmax;\\n static constexpr int inf = 1 << 30;\\n excess_value(): rank(inf), pmin(inf), pmax(-inf){}\\n excess_value(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum){}\\nprivate:\\n excess_value(int a, int b, int c, int d): rank(a), sum(b), pmin(c), pmax(d){}\\npublic:\\n static excess_value merge(excess_value a, excess_value b){\\n if(a.rank == inf) return b;\\n if(b.rank == inf) return a;\\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), std::max(a.pmax, a.sum + b.pmax)};\\n }\\n};\\n// 01列の0を-1として扱う\\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax, 接尾辞のmin, 接尾辞のmax\\nstruct excess_value2{\\npublic:\\n int rank, sum, pmin, pmax, smin, smax;\\n static constexpr int inf = 1 << 30;\\n excess_value2(): rank(inf), pmin(inf), pmax(-inf), smin(inf), smax(-inf){}\\n excess_value2(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum), smin(sum), smax(sum){}\\nprivate:\\n excess_value2(int a, int b, int c, int d, int e, int f): rank(a), sum(b), pmin(c), pmax(d), smin(e), smax(f){}\\npublic:\\n static excess_value2 merge(excess_value2 a, excess_value2 b){\\n if(a.rank == inf) return b;\\n if(b.rank == inf) return a;\\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), \\n std::max(a.pmax, a.sum + b.pmax), std::min(a.smin + b.sum, b.smin), std::max(a.smax + b.sum, b.smax)};\\n }\\n};\\n\\n\\ntemplate<typename T>\\nstruct range_add_chmin_chmax_range_freq {\\n private:\\n using F = clamp_function<T>;\\n struct query {\\n int type, l, r;\\n F f;\\n };\\n int N;\\n std::vector<T> V;\\n std::vector<query> Qs;\\n \\n public:\\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V) {}\\n\\n // [l, r)の x <- min(max(x + add, lower), upper)\\n void apply(int l, int r, T add, T lower, T upper) {\\n assert(lower <= upper);\\n Qs.push_back({0, l, r, F{add, lower, upper}});\\n }\\n\\n // [l, r)のx以上の最小要素\\n void lower_bound(int l, int r, T x) {\\n Qs.push_back({1, l, r, F{x, x, x}});\\n }\\n\\n // [l, r)のrx未満の要素数\\n void range_freq(int l, int r, T rx) {\\n Qs.push_back({2, l, r, F{rx, rx, rx}});\\n }\\n\\n /*\\n // [l, r)のrx未満の要素の和\\n void range_freq_sum(int l, int r, T rx) {\\n //\\n }\\n */\\n\\n std::vector<T> solve() {\\n int Q = Qs.size(), K = 2 * sqrt(N);\\n std::vector<int> Bbegin{0};\\n std::vector<F> lz{F{}};\\n std::vector<T> B;\\n\\n auto propagate = [&]() -> void {\\n for (int i = 0; i < (int)Bbegin.size(); i++) {\\n if (lz[i] == F()) continue;\\n int l = Bbegin[i];\\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\\n for (int j = l; j < r; j++) V[j] = lz[i].fx(V[j]);\\n }\\n };\\n\\n auto make_block = [&](int lq, int rq) -> void {\\n Bbegin = {0};\\n for (int i = lq; i < rq; i++) {\\n Bbegin.push_back(Qs[i].l);\\n Bbegin.push_back(Qs[i].r);\\n }\\n std::sort(Bbegin.begin(), Bbegin.end());\\n Bbegin.erase(std::unique(Bbegin.begin(), Bbegin.end()), Bbegin.end());\\n lz = std::vector<F>(Bbegin.size(), F());\\n B = V;\\n for (int i = 0; i < Bbegin.size(); i++) {\\n int l = Bbegin[i];\\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\\n std::sort(B.begin() + l, B.begin() + r);\\n }\\n };\\n\\n std::vector<T> ans;\\n\\n for (int i = 0; i < Q; i++) {\\n if (i % K == 0) {\\n propagate();\\n make_block(i, std::min(Q, i + K));\\n }\\n int l = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].l) - Bbegin.begin();\\n int r = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].r) - Bbegin.begin();\\n if (Qs[i].type == 0) {\\n for (int j = l; j < r; j++) {\\n lz[j] = F::merge(lz[j], Qs[i].f);\\n }\\n } else if (Qs[i].type == 1) {\\n T lb = std::numeric_limits<T>::max();\\n T x = Qs[i].f.add;\\n for (int j = l; j < r; j++) { \\n T y = x - lz[j].add;\\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\\n if (itr != B.begin() + Bbegin[j + 1]) {\\n lb = std::min(lb, lz[j].fx(*itr));\\n }\\n if (itr != B.begin() + Bbegin[j] && lz[j].lower >= x) {\\n lb = std::min(lb, lz[j].lower);\\n }\\n }\\n ans.push_back(lb);\\n } else if (Qs[i].type == 2) {\\n T cnt = 0, rx = Qs[i].f.add;\\n for (int j = l; j < r; j++) { \\n if (lz[j].lower >= rx) continue;\\n if (lz[j].upper < rx) {\\n cnt += Bbegin[j + 1] - Bbegin[j];\\n continue;\\n }\\n T y = rx - lz[j].add;\\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\\n cnt += itr - (B.begin() + Bbegin[j]);\\n }\\n ans.push_back(cnt);\\n }\\n }\\n return ans;\\n }\\n};\\n\\nint main() {\\n io_init();\\n int N, Q;\\n std::cin >> N >> Q;\\n auto A = read_vec<ll>(N);\\n range_add_chmin_chmax_range_freq<ll> F(A);\\n\\n static constexpr ll inf = 1LL << 60, minf = -inf;\\n for (int i = 0; i < Q; i++) {\\n int t, l, r;\\n ll x;\\n std::cin >> t >> l >> r >> x;\\n l--;\\n if (t == 1) {\\n F.apply(l, r, 0, minf, x);\\n } else if (t == 2) {\\n F.apply(l, r, 0, x, inf);\\n } else if (t == 3) {\\n F.apply(l, r, x, minf, inf);\\n } else {\\n ll y;\\n std::cin >> y;\\n F.range_freq(l, r, x);\\n F.range_freq(l, r, y + 1);\\n }\\n }\\n\\n auto ans = F.solve();\\n\\n for (int i = 0; i < ans.size(); i += 2) {\\n std::cout << ans[i + 1] - ans[i] << '\\\\n';\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 970,\n \"memory_kb\": 11908,\n \"score_of_the_acc\": -1.5519,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3170_9982954\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <array>\\n#include <tuple>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <bitset>\\n#include <cmath>\\n#include <functional>\\n#include <cassert>\\n#include <climits>\\n#include <iomanip>\\n#include <numeric>\\n#include <memory>\\n#include <random>\\n#include <thread>\\n#include <chrono>\\n#define allof(obj) (obj).begin(), (obj).end()\\n#define range(i, l, r) for(int i=l;i<r;i++)\\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\\n#define bit_kth(i, k) ((i >> k)&1)\\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\\nusing ll = long long;\\nusing ld = long double;\\nusing ul = uint64_t;\\nusing pi = std::pair<int, int>;\\nusing pl = std::pair<ll, ll>;\\nusing namespace std;\\n\\ntemplate<typename F, typename S>\\nstd::ostream &operator << (std::ostream &dest, const std::pair<F, S> &p) {\\n dest << p.first << ' ' << p.second;\\n return dest;\\n}\\n\\ntemplate<typename A, typename B>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t);\\n return dest;\\n}\\n\\ntemplate<typename A, typename B, typename C>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t);\\n return dest;\\n}\\n\\ntemplate<typename A, typename B, typename C, typename D>\\nstd::ostream &operator << (std::ostream &dest, const std::tuple<A, B, C, D> &t) {\\n dest << std::get<0>(t) << ' ' << std::get<1>(t) << ' ' << std::get<2>(t) << ' ' << std::get<3>(t);\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::vector<std::vector<T>> &v) {\\n int sz = v.size();\\n if (!sz) return dest;\\n for (int i = 0; i < sz; i++) {\\n int m = v[i].size();\\n for (int j = 0; j < m; j++) dest << v[i][j] << (i != sz - 1 && j == m - 1 ? '\\\\n' : ' ');\\n }\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::vector<T> &v) {\\n int sz = v.size();\\n if (!sz) return dest;\\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\\n dest << v[sz - 1];\\n return dest;\\n}\\n\\ntemplate<typename T, size_t sz>\\nstd::ostream &operator << (std::ostream &dest, const std::array<T, sz> &v) {\\n if (!sz) return dest;\\n for (int i = 0; i < sz - 1; i++) dest << v[i] << ' ';\\n dest << v[sz - 1];\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::ostream &operator << (std::ostream &dest, const std::set<T> &v) {\\n for (auto itr = v.begin(); itr != v.end();) {\\n dest << *itr;\\n itr++;\\n if (itr != v.end()) dest << ' ';\\n }\\n return dest;\\n}\\n\\ntemplate<typename T, typename E>\\nstd::ostream &operator << (std::ostream &dest, const std::map<T, E> &v) {\\n for (auto itr = v.begin(); itr != v.end(); ) {\\n dest << '(' << itr->first << \\\", \\\" << itr->second << ')';\\n itr++;\\n if (itr != v.end()) dest << '\\\\n';\\n }\\n return dest;\\n}\\n\\ntemplate<typename T>\\nstd::vector<T> make_vec(size_t sz, T val) { return std::vector<T>(sz, val); }\\n\\ntemplate<typename T, typename... Tail>\\nauto make_vec(size_t sz, Tail ...tail) {\\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\\n}\\n\\ntemplate<typename T>\\nstd::vector<T> read_vec(size_t sz) {\\n std::vector<T> v(sz);\\n for (int i = 0; i < (int)sz; i++) std::cin >> v[i];\\n return v;\\n}\\n\\ntemplate<typename T, typename... Tail>\\nauto read_vec(size_t sz, Tail ...tail) {\\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\\n for (int i = 0; i < (int)sz; i++) v[i] = read_vec<T>(tail...);\\n return v;\\n}\\n\\ntemplate<typename T, size_t size>\\nauto make_array(T x) { \\n std::array<T, size> res;\\n res.fill(x);\\n return res;\\n}\\n\\ntemplate<typename T, size_t size, size_t size2, size_t... Tail>\\nauto make_array(T x) {\\n std::array<decltype(make_array<T, size2, Tail...>(x)), size> res;\\n res.fill(make_array<T, size2, Tail...>(x));\\n return res;\\n}\\n\\n\\n// x / y以上の最小の整数\\nll ceil_div(ll x, ll y) {\\n assert(y > 0);\\n return (x + (x > 0 ? y - 1 : 0)) / y;\\n}\\n\\n// x / y以下の最大の整数\\nll floor_div(ll x, ll y) {\\n assert(y > 0);\\n return (x + (x > 0 ? 0 : -y + 1)) / y;\\n}\\n\\nvoid io_init() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n}\\n\\n\\n\\n#include <limits>\\n\\ntemplate<typename T>\\nstruct add_min_function{\\n using F = add_min_function<T>;\\n T add, upper;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n add_min_function(): add(0), upper(inf){}\\n add_min_function(T _add, T _upper): add(_add), upper(_upper){}\\n // g(f(x))\\n static F merge(const F &f, const F &g){return {f.add + g.add, std::min(g.upper, f.upper + g.add)};}\\n T fx(T x){return std::min(x + add, upper);}\\n bool operator == (const F &r)const{return add == r.add && upper == r.upper;}\\n};\\n\\n// f(x) = min(max(x + a, b), c)\\ntemplate<typename T>\\nstruct clamp_function{\\n T add, lower, upper;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\\n clamp_function(): add(0), lower(minf), upper(inf){}\\n clamp_function(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper){lower = std::min(_lower, _upper);}\\n // g(f(x))\\n static clamp_function<T> merge(const clamp_function<T> &f, const clamp_function<T> &g){\\n return {f.add + g.add, std::max(g.lower, std::min(f.upper, f.lower) + g.add), std::min(g.upper, std::max(g.lower, f.upper + g.add))};\\n }\\n T fx(T x){\\n return std::min(std::max(x + add, lower), upper);\\n }\\n bool operator == (const clamp_function<T> &r)const{return add == r.add && lower == r.lower && upper == r.upper;}\\n};\\n// f(x) = min(max(x + a, b), c)\\n// min部分によって減少した値をスコアとする\\ntemplate<typename T, typename Tsum>\\nstruct clamp_function_score{\\npublic:\\n T add, lower, upper, score_upper;\\n Tsum score_sum;\\n static constexpr T inf = std::numeric_limits<T>::max() / 2;\\n static constexpr T minf = std::numeric_limits<T>::min() / 2;\\n clamp_function_score(): add(0), lower(minf), upper(inf), score_upper(inf), score_sum(0){}\\n clamp_function_score(T _add, T _lower, T _upper): add(_add), lower(_lower), upper(_upper), score_upper(_upper), score_sum(0){lower = std::min(_lower, _upper);}\\nprivate:\\n clamp_function_score(T _add, T _lower, T _upper, T _supper, Tsum _ssum): add(_add), lower(_lower), upper(_upper), score_upper(_supper), score_sum(_ssum){}\\npublic:\\n // g(f(x))\\n static clamp_function_score<T, Tsum> merge(const clamp_function_score<T, Tsum> &f, const clamp_function_score<T, Tsum> &g){\\n T _add = f.add + g.add;\\n T _lower = std::max(g.lower, std::min(f.upper, f.lower) + g.add);\\n T _upper = std::min(g.upper, std::max(g.lower, f.upper + g.add));\\n _lower = std::min(_lower, _upper);\\n Tsum _ssum = f.score_sum + g.score_sum;\\n if(f.lower == f.upper){\\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\\n return {_add, _lower, _upper, f.score_upper + g.add, _ssum};\\n }else if(f.lower + g.add >= g.score_upper){\\n assert(_lower == _upper);\\n _ssum += std::max((T)0, f.lower + g.add - g.score_upper);\\n return {_add, _lower, _upper, f.lower + g.add, _ssum};\\n }else{\\n return {_add, _lower, _upper, std::min(f.score_upper + g.add, g.score_upper), _ssum};\\n }\\n }\\n T fx(T x){\\n return std::min(std::max(x + add, lower), upper);\\n }\\n Tsum fx_score(T x){\\n return score_sum + std::max((T)0, x + add - score_upper);\\n }\\n bool operator == (const clamp_function_score<T, Tsum> &r)const{return add == r.add && lower == r.lower && upper == r.upper && score_upper == r.score_upper && score_sum == r.score_sum;}\\n};\\n\\n\\n\\ntemplate<typename T>\\nstruct prefixsum_min{\\n T sum, pmin;\\n static prefixsum_min<T> id(){\\n return {0, std::numeric_limits<T>::max() / 2};\\n }\\n static prefixsum_min<T> merge(prefixsum_min<T> a, prefixsum_min<T> b){\\n if(b.pmin == std::numeric_limits<T>::max() / 2) return a;\\n return {a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin)};\\n }\\n};\\ntemplate<typename T>\\nstruct prefixsum_max{\\n T sum, pmax;\\n static prefixsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min() / 2};\\n }\\n static prefixsum_max<T> merge(prefixsum_max<T> a, prefixsum_max<T> b){\\n if(b.pmax == std::numeric_limits<T>::min() / 2) return a;\\n return {a.sum + b.sum, std::max(a.pmax, a.sum + b.pmax)};\\n }\\n};\\ntemplate<typename T>\\nstruct suffixsum_min{\\n T sum, smin;\\n static suffixsum_min<T> id(){\\n return {0, std::numeric_limits<T>::max() / 2};\\n }\\n static suffixsum_min<T> merge(suffixsum_min<T> a, suffixsum_min<T> b){\\n if(a.smin == std::numeric_limits<T>::max() / 2) return b;\\n return {a.sum + b.sum, std::min(b.smin, b.sum + a.smin)};\\n }\\n};\\ntemplate<typename T>\\nstruct suffixsum_max{\\n T sum, smax;\\n static suffixsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min() / 2};\\n }\\n static suffixsum_max<T> merge(suffixsum_max<T> a, suffixsum_max<T> b){\\n if(a.smax == std::numeric_limits<T>::min() / 2) return b;\\n return {a.sum + b.sum, std::max(b.smax, b.sum + a.smax)};\\n }\\n};\\ntemplate<typename T>\\nstruct substringsum_max{\\n T sum, pmax, smax, ssmax; // {区間全体のsum, prefixsumのmax, suffixsumのmax, substringsumのmax}\\n static substringsum_max<T> id(){\\n return {0, std::numeric_limits<T>::min(), 0, 0};\\n }\\n static substringsum_max<T> merge(substringsum_max<T> a, substringsum_max<T> b){\\n if(b.pmax == std::numeric_limits<T>::min()) return a;\\n if(a.pmax == std::numeric_limits<T>::min()) return b;\\n T sum = a.sum + b.sum;\\n T pmax = std::max(a.pmax, a.sum + b.pmax);\\n T smax = std::max(a.smax + b.sum, b.smax);\\n return {sum, pmax, smax, std::max({a.ssmax, b.ssmax, pmax, smax})};\\n }\\n};\\n// 01列の0を-1として扱う\\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax\\nstruct excess_value{\\npublic:\\n int rank, sum, pmin, pmax;\\n static constexpr int inf = 1 << 30;\\n excess_value(): rank(inf), pmin(inf), pmax(-inf){}\\n excess_value(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum){}\\nprivate:\\n excess_value(int a, int b, int c, int d): rank(a), sum(b), pmin(c), pmax(d){}\\npublic:\\n static excess_value merge(excess_value a, excess_value b){\\n if(a.rank == inf) return b;\\n if(b.rank == inf) return a;\\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), std::max(a.pmax, a.sum + b.pmax)};\\n }\\n};\\n// 01列の0を-1として扱う\\n// 1の数, 合計, 接頭辞のmin, 接頭辞のmax, 接尾辞のmin, 接尾辞のmax\\nstruct excess_value2{\\npublic:\\n int rank, sum, pmin, pmax, smin, smax;\\n static constexpr int inf = 1 << 30;\\n excess_value2(): rank(inf), pmin(inf), pmax(-inf), smin(inf), smax(-inf){}\\n excess_value2(bool f): rank(f), sum(f ? 1 : -1), pmin(sum), pmax(sum), smin(sum), smax(sum){}\\nprivate:\\n excess_value2(int a, int b, int c, int d, int e, int f): rank(a), sum(b), pmin(c), pmax(d), smin(e), smax(f){}\\npublic:\\n static excess_value2 merge(excess_value2 a, excess_value2 b){\\n if(a.rank == inf) return b;\\n if(b.rank == inf) return a;\\n return {a.rank + b.rank, a.sum + b.sum, std::min(a.pmin, a.sum + b.pmin), \\n std::max(a.pmax, a.sum + b.pmax), std::min(a.smin + b.sum, b.smin), std::max(a.smax + b.sum, b.smax)};\\n }\\n};\\n\\n\\ntemplate<typename T>\\nstruct range_add_chmin_chmax_range_freq {\\n private:\\n using F = clamp_function<T>;\\n struct query {\\n int type, l, r;\\n F f;\\n };\\n int N;\\n std::vector<T> V;\\n std::vector<query> Qs;\\n \\n public:\\n range_add_chmin_chmax_range_freq(int _N) : range_add_chmin_chmax_range_freq(std::vector<T>(_N, 0)) {}\\n range_add_chmin_chmax_range_freq(const std::vector<T> &_V) : N(_V.size()), V(_V) {}\\n\\n // [l, r)の x <- min(max(x + add, lower), upper)\\n void apply(int l, int r, T add, T lower, T upper) {\\n assert(lower <= upper);\\n Qs.push_back({0, l, r, F{add, lower, upper}});\\n }\\n\\n // [l, r)のx以上の最小要素\\n void lower_bound(int l, int r, T x) {\\n Qs.push_back({1, l, r, F{x, x, x}});\\n }\\n\\n // [l, r)のrx未満の要素数\\n void range_freq(int l, int r, T rx) {\\n Qs.push_back({2, l, r, F{rx, rx, rx}});\\n }\\n\\n /*\\n // [l, r)のrx未満の要素の和\\n void range_freq_sum(int l, int r, T rx) {\\n //\\n }\\n */\\n\\n std::vector<T> solve() {\\n int Q = Qs.size(), K = 2 * sqrt(N);\\n std::vector<int> Bbegin{0};\\n std::vector<F> lz{F{}};\\n std::vector<T> B;\\n\\n auto propagate = [&]() -> void {\\n for (int i = 0; i < (int)Bbegin.size(); i++) {\\n if (lz[i] == F()) continue;\\n int l = Bbegin[i];\\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\\n for (int j = l; j < r; j++) V[j] = lz[i].fx(V[j]);\\n }\\n };\\n\\n auto make_block = [&](int lq, int rq) -> void {\\n Bbegin = {0};\\n for (int i = lq; i < rq; i++) {\\n Bbegin.push_back(Qs[i].l);\\n Bbegin.push_back(Qs[i].r);\\n }\\n std::sort(Bbegin.begin(), Bbegin.end());\\n Bbegin.erase(std::unique(Bbegin.begin(), Bbegin.end()), Bbegin.end());\\n lz = std::vector<F>(Bbegin.size(), F());\\n B = V;\\n for (int i = 0; i < Bbegin.size(); i++) {\\n int l = Bbegin[i];\\n int r = (i + 1 == Bbegin.size() ? N : Bbegin[i + 1]);\\n std::sort(B.begin() + l, B.begin() + r);\\n }\\n };\\n\\n std::vector<T> ans;\\n\\n for (int i = 0; i < Q; i++) {\\n if (i % K == 0) {\\n propagate();\\n make_block(i, std::min(Q, i + K));\\n }\\n int l = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].l) - Bbegin.begin();\\n int r = std::lower_bound(Bbegin.begin(), Bbegin.end(), Qs[i].r) - Bbegin.begin();\\n if (Qs[i].type == 0) {\\n for (int j = l; j < r; j++) {\\n lz[j] = F::merge(lz[j], Qs[i].f);\\n }\\n } else if (Qs[i].type == 1) {\\n T lb = std::numeric_limits<T>::max();\\n T x = Qs[i].f.add;\\n for (int j = l; j < r; j++) { \\n T y = x - lz[j].add;\\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\\n if (itr != B.begin() + Bbegin[j + 1]) {\\n lb = std::min(lb, lz[j].fx(*itr));\\n }\\n if (itr != B.begin() + Bbegin[j] && lz[j].lower >= x) {\\n lb = std::min(lb, lz[j].lower);\\n }\\n }\\n ans.push_back(lb);\\n } else if (Qs[i].type == 2) {\\n T cnt = 0, rx = Qs[i].f.add;\\n for (int j = l; j < r; j++) { \\n if (lz[j].lower >= rx) continue;\\n if (lz[j].upper < rx) {\\n cnt += Bbegin[j + 1] - Bbegin[j];\\n continue;\\n }\\n T y = rx - lz[j].add;\\n auto itr = std::lower_bound(B.begin() + Bbegin[j], B.begin() + Bbegin[j + 1], y);\\n cnt += itr - (B.begin() + Bbegin[j]);\\n }\\n ans.push_back(cnt);\\n }\\n }\\n return ans;\\n }\\n};\\n\\nint main() {\\n io_init();\\n int N, Q;\\n std::cin >> N >> Q;\\n auto A = read_vec<ll>(N);\\n range_add_chmin_chmax_range_freq<ll> F(A);\\n\\n static constexpr ll inf = 1LL << 60, minf = -inf;\\n for (int i = 0; i < Q; i++) {\\n int t, l, r, x;\\n std::cin >> t >> l >> r >> x;\\n l--;\\n if (t == 1) {\\n F.apply(l, r, 0, minf, x);\\n } else if (t == 2) {\\n F.apply(l, r, 0, x, inf);\\n } else if (t == 3) {\\n F.apply(l, r, x, minf, inf);\\n } else {\\n int y;\\n std::cin >> y;\\n F.range_freq(l, r, x);\\n F.range_freq(l, r, y + 1);\\n }\\n }\\n\\n auto ans = F.solve();\\n\\n for (int i = 0; i < ans.size(); i += 2) {\\n std::cout << ans[i + 1] - ans[i] << '\\\\n';\\n }\\n\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 350,\n \"memory_kb\": 8288,\n \"score_of_the_acc\": -0.6821,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3170_9230140\",\n \"code_snippet\": \"#pragma region Macros\\n \\n#pragma GCC optimize(\\\"O3,unroll-loops\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\\\")\\n \\n#include <bits/extc++.h>\\n// #include <atcoder/all>\\n// using namespace atcoder;\\nusing namespace std;\\nusing namespace __gnu_pbds;\\n \\n// #include <boost/multiprecision/cpp_dec_float.hpp>\\n// #include <boost/multiprecision/cpp_int.hpp>\\n// namespace mp = boost::multiprecision;\\n// using Bint = mp::cpp_int;\\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\\n \\n#define pb emplace_back\\n#define int ll\\n#define endl '\\\\n'\\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \\n \\n#define sqrt __builtin_sqrtl\\n#define cbrt __builtin_cbrtl\\n#define hypot __builtin_hypotl\\n \\n#define next asdnext\\n#define prev asdprev\\n \\nusing ll = long long;\\nusing ld = long double;\\nconst ld PI = acosl(-1);\\nconst int INF = 1 << 30;\\nconst ll INFL = 1LL << 61;\\nconst int MOD = 998244353;\\n// const int MOD = 1000000007;\\n \\nconst ld EPS = 1e-10;\\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\\n \\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\\n \\n#define EC int\\nstruct Edge {\\n int from, to;\\n EC cost;\\n Edge() : from(-1), to(-1), cost(-1) {}\\n Edge(int to, EC cost) : to(to), cost(cost) {}\\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\\n bool operator ==(const Edge& e) {\\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\\n }\\n bool operator !=(const Edge& e) {\\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\\n }\\n bool operator <(const Edge& e) { return this->cost < e.cost; }\\n bool operator >(const Edge& e) { return this->cost > e.cost; }\\n};\\n \\nchrono::system_clock::time_point start;\\n__attribute__((constructor))\\nvoid constructor() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(10);\\n start = chrono::system_clock::now();\\n}\\n \\nrandom_device seed_gen;\\nmt19937_64 rng(seed_gen());\\nuniform_int_distribution<int> dist_x(0, 1e9);\\nstruct RNG {\\n unsigned Int(unsigned l, unsigned r) {\\n return dist_x(rng) % (r - l + 1) + l;\\n }\\n ld Double() {\\n return ld(dist_x(rng)) / 1e9;\\n }\\n} rnd;\\n \\nusing i64 = ll;\\n// using i64 = uint64_t;\\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\\n \\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\\nbool is_pow4(i64 x) { return __builtin_popcount(x) == 1 && __builtin_ctz(x) % 2 == 0; }\\n \\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\\ni64 bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\\n// i64 next_bit(i64 x, i64 k) { return 0; }\\n// i64 prev_bit(i64 x, i64 k) { return 0; }\\n// i64 kth_bit(i64 x, i64 k) { return 0; }\\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\\ni64 LSB(i64 x) { return (x & -x); } // mask\\n \\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\\ni64 countl_one(i64 x) {\\n i64 ret = 0, k = 63 - __builtin_clzll(x);\\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\\n return ret;\\n}\\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\\n \\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\\n \\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\\n i64 w = bit_width(x); k %= w;\\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\\n}\\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\\ni64 rotr(i64 x, i64 k) {\\n i64 w = bit_width(x); k %= w;\\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\\n}\\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\\n i64 r = 0, w = bit_width(x);\\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\\n return r;\\n}\\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\\n \\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\\n \\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\\n \\ni64 next_combination(i64 x) {\\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\\n}\\n \\n \\n__int128_t POW(__int128_t x, int n) {\\n __int128_t ret = 1;\\n assert(n >= 0);\\n if (x == 1 or n == 0) ret = 1;\\n else if (x == -1 && n % 2 == 0) ret = 1; \\n else if (x == -1) ret = -1; \\n else if (n % 2 == 0) {\\n assert(x < INFL);\\n ret = POW(x * x, n / 2);\\n } else {\\n assert(x < INFL);\\n ret = x * POW(x, n - 1);\\n }\\n return ret;\\n}\\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\\n assert(y != 0);\\n if (x >= 0 && y > 0) return x / y;\\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\\n if (x < 0 && y < 0) return x / y + (x % y < 0);\\n return x / y - (x % y < 0); // (x < 0 && y > 0) \\n}\\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\\n assert(y != 0);\\n if (x >= 0) return x % y;\\n __int128_t ret = x % y; // (x < 0)\\n ret += (__int128_t)abs(y) * INFL;\\n ret %= abs(y);\\n return ret;\\n}\\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\\n assert(y != 0);\\n if (y < 0) x = -x, y = -y;\\n return x >= 0 ? x / y : (x + 1) / y - 1;\\n}\\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\\n assert(y != 0);\\n if (y < 0) x = -x, y = -y;\\n return x > 0 ? (x - 1) / y + 1 : x / y;\\n}\\nint round(int x, int y) {\\n assert(y != 0);\\n return (x * 2 + y) / (y * 2);\\n}\\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\\n assert(y != 0); // TODO\\n return INF;\\n}\\nint round2(int x, int y) { // 五捨五超入 // 未verify\\n assert(y != 0);\\n if (y < 0) y = -y, x = -x;\\n int z = x / y;\\n if ((z * 2 + 1) * y <= y * 2) z++;\\n return z;\\n}\\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\\n// }\\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\\n// }\\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\\n// }\\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\\n// }\\nint floor(ld x, ld y) { // 誤差対策TODO\\n assert(!equals(y, 0));\\n return floor(x / y);\\n // floor(x) = ceil(x - 1) という話も\\n}\\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\\n assert(!equals(y, 0));\\n return ceil(x / y);\\n // ceil(x) = floor(x + 1)\\n}\\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\\n assert(!equals(y, 0));\\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \\n}\\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\\n // 未verify. 誤差対策TODO. -0.0が返りうる。\\n assert(!equals(y, 0));\\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\\n return x - fabs(y)*floor(x, fabs(y));\\n}\\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\\nint modf(ld x) {\\n\\tif (x < 0) return ceill(x);\\n\\telse return floorl(x);\\n}\\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\\nint seisuu(int x, int y) {\\n assert(y != 0);\\n return x / y;\\n}\\nint seisuu(ld x, ld y) { // 誤差対策TODO\\n assert(!equals(y, 0));\\n return (int)(x / y);\\n}\\n \\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\\n return b;\\n}\\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\\n return b;\\n}\\n \\ntemplate <class T> bool chmax(T &a, const T& b) {\\n if (a < b) { a = b; return true; } return false;\\n}\\ntemplate <class T> bool chmin(T &a, const T& b) {\\n if (a > b) { a = b; return true; } return false;\\n}\\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\\n return a + b + c - max({a, b, c}) - min({a, b, c});\\n}\\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \\n if (rev == false) { // TODO テンプレート引数\\n if (a > b) swap(a, b);\\n } else {\\n if (b > a) swap(b, a);\\n }\\n}\\ntemplate <class T> void Sort(T &a, T &b, T &c, bool rev = false) {\\n if (rev == false) { \\n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\\n } else {\\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\\n }\\n}\\ntemplate <class T> void Sort(T &a, T &b, T &c, T &d, bool rev = false) {\\n if (rev == false) { \\n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\\n } else {\\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\\n }\\n}\\n \\nstruct custom_hash {\\n static uint64_t splitmix64(uint64_t x) {\\n x += 0x9e3779b97f4a7c15;\\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\\n return x ^ (x >> 31);\\n }\\n \\n size_t operator()(uint64_t x) const {\\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\\n return splitmix64(x + FIXED_RANDOM);\\n }\\n};\\n \\nclass Compress {\\npublic:\\n int sz = 0;\\n // gp_hash_table<int, int, custom_hash> Z, UZ;\\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\\n \\n Compress(const vector<int> &V, int base = 0) {\\n this->sz = base;\\n set<int> s(V.begin(), V.end());\\n \\n for (int x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\\n this->sz = base;\\n vector<int> V3 = V2;\\n V3.insert(V3.end(), V1.begin(), V1.end());\\n set<int> s(V3.begin(), V3.end());\\n \\n for (int x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\\n this->sz = base;\\n vector<int> V4 = V1;\\n V4.insert(V4.end(), V2.begin(), V2.end());\\n V4.insert(V4.end(), V3.begin(), V3.end());\\n set<int> s(V4.begin(), V4.end());\\n \\n for (int x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n Compress(const vector<int> &V1, const vector<int> &V2,\\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\\n this->sz = base;\\n vector<int> V5 = V1;\\n V5.insert(V5.end(), V2.begin(), V2.end());\\n V5.insert(V5.end(), V3.begin(), V3.end());\\n V5.insert(V5.end(), V4.begin(), V4.end());\\n set<int> s(V5.begin(), V5.end());\\n \\n for (int x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n vector<int> zip(const vector<int> &V) {\\n vector<int> ret = V;\\n for (int i = 0; i < (int)V.size(); i++) {\\n ret[i] = Z[ret[i]];\\n }\\n return ret;\\n }\\n \\n vector<int> unzip(const vector<int> &V) {\\n vector<int> ret = V;\\n for (int i = 0; i < (int)V.size(); i++) {\\n ret[i] = UZ[ret[i]];\\n }\\n return ret;\\n }\\n \\n int size() { return sz; }\\n \\n int encode(int x) { return Z[x]; }\\n int decode(int x) {\\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\\n return UZ[x];\\n }\\n};\\n \\nclass UnionFind {\\npublic:\\n\\tUnionFind() = default;\\n UnionFind(int N) : par(N), sz(N, 1) {\\n iota(par.begin(), par.end(), 0);\\n }\\n\\tint root(int x) {\\n\\t\\tif (par[x] == x) return x;\\n\\t\\treturn (par[x] = root(par[x]));\\n\\t}\\n\\tbool unite(int x, int y) {\\n\\t\\tint rx = root(x);\\n\\t\\tint ry = root(y);\\n if (rx == ry) return false;\\n\\t\\tif (sz[rx] < sz[ry]) swap(rx, ry);\\n\\t\\tsz[rx] += sz[ry];\\n\\t\\tpar[ry] = rx;\\n return true;\\n\\t}\\n\\tbool issame(int x, int y) { return (root(x) == root(y)); }\\n\\tint size(int x) { return sz[root(x)]; }\\n vector<vector<int>> groups(int N) {\\n vector<vector<int>> G(N);\\n for (int x = 0; x < N; x++) {\\n G[root(x)].push_back(x);\\n }\\n\\t\\tG.erase( remove_if(G.begin(), G.end(),\\n [&](const vector<int>& V) { return V.empty(); }), G.end());\\n return G;\\n }\\nprivate:\\n\\tvector<int> par, sz;\\n};\\n \\ntemplate<typename T>\\nstruct BIT {\\n int N; // 要素数\\n vector<T> bit[2]; // データの格納先\\n BIT(int N_, int x = 0) {\\n N = N_ + 1;\\n bit[0].assign(N, 0); bit[1].assign(N, 0);\\n if (x != 0) {\\n for (int i = 0; i < N; i++) add(i, x);\\n }\\n }\\n BIT(const vector<T> &A) {\\n N = A.size() + 1;\\n bit[0].assign(N, 0); bit[1].assign(N, 0);\\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\\n }\\n void add_sub(int p, int i, T x) {\\n while (i < N) { bit[p][i] += x; i += (i & -i); }\\n }\\n void add(int l, int r, T x) {\\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\\n }\\n void add(int i, T x) { add(i, i + 1, x); }\\n T sum_sub(int p, int i) {\\n T ret = 0;\\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\\n return ret;\\n }\\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\\n T sum(int l, int r) { return sum(r) - sum(l); }\\n T get(int i) { return sum(i, i + 1); }\\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\\n};\\n \\ntemplate<int mod> class Modint {\\npublic:\\n int val = 0;\\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\\n Modint(const Modint &r) { val = r.val; }\\n \\n Modint operator -() { return Modint(-val); } // 単項\\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\\n \\n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\\n Modint operator ++(signed) { ++*this; return *this; } // 後置\\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\\n Modint operator --(signed) { --*this; return *this; }\\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\\n Modint &operator /=(const Modint &r) {\\n int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n Modint &operator /=(const int &q) {\\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n bool operator ==(const Modint& r) { return this -> val == r.val; }\\n bool operator <(const Modint& r) { return this -> val < r.val; }\\n bool operator >(const Modint& r) { return this -> val > r.val; }\\n bool operator !=(const Modint& r) { return this -> val != r.val; }\\n};\\n \\nusing mint = Modint<MOD>;\\n \\nistream &operator >>(istream &is, mint& x) {\\n int t; is >> t; x = t; return (is);\\n}\\nostream &operator <<(ostream &os, const mint& x) {\\n return os << x.val;\\n}\\nmint modpow(const mint &x, int n) {\\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\\n assert(n >= 0);\\n if (n == 0) return 1;\\n mint t = modpow(x, n / 2);\\n t = t * t;\\n if (n & 1) t = t * x;\\n return t;\\n}\\n \\nint modpow(__int128_t x, int n, int mod) {\\n assert(n >= 0 && mod > 0); // TODO: n <= -1\\n __int128_t ret = 1;\\n while (n > 0) {\\n if (n % 2 == 1) ret = ret * x % mod;\\n x = x * x % mod;\\n n /= 2;\\n }\\n return ret;\\n}\\nint modinv(__int128_t x, int mod) {\\n assert(mod > 0);\\n // assert(x > 0);\\n if (x == 1 or x == 0) return 1;\\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\\n}\\n \\nistream &operator >>(istream &is, __int128_t& x) {\\n string S; is >> S;\\n __int128_t ret = 0;\\n int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9')\\n ret = ret * 10 + S[i] - '0';\\n x = ret * f;\\n return (is);\\n}\\nostream &operator <<(ostream &os, __int128_t x) {\\n ostream::sentry s(os);\\n if (s) {\\n __uint128_t tmp = x < 0 ? -x : x;\\n char buffer[128]; char *d = end(buffer);\\n do {\\n --d; *d = \\\"0123456789\\\"[tmp % 10]; tmp /= 10;\\n } while (tmp != 0);\\n if (x < 0) { --d; *d = '-'; }\\n int len = end(buffer) - d;\\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\\n }\\n return os;\\n}\\n \\n__int128_t stoll(string &S) {\\n __int128_t ret = 0; int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\\n return ret * f;\\n}\\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\\n__int128_t lcm(__int128_t a, __int128_t b) {\\n return a / gcd(a, b) * b;\\n // lcmが__int128_tに収まる必要あり\\n}\\n \\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\\n assert(k >= 0);\\n stringstream ss;\\n ss << setprecision(k + 2) << x;\\n string s = ss.str();\\n if (s.find('.') == string::npos) s += '.';\\n int pos = s.find('.');\\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\\n s.pop_back();\\n if (s.back() == '.') s.pop_back();\\n return s;\\n \\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\\n // ss << setprecision(k + 1) << x;\\n // string s = ss.str();\\n // if (s.find('.') == string::npos) s += '.';\\n // int pos = s.find('.');\\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\\n // if (s.back() == '.') s.pop_back();\\n // return s;\\n}\\nstring to_string(__int128_t x) {\\n string ret = \\\"\\\";\\n if (x < 0) { ret += \\\"-\\\"; x *= -1; }\\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\\n reverse(ret.begin(), ret.end());\\n return ret;\\n}\\nstring to_string(char c) { string s = \\\"\\\"; s += c; return s; }\\n \\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\\n}\\ntemplate<class T,class S> struct hash<pair<T,S>>{\\n size_t operator()(const pair<T,S> &keyval) const noexcept {\\n return HashCombine(hash<T>()(keyval.first), keyval.second);\\n }\\n};\\ntemplate<class T> struct hash<vector<T>>{\\n size_t operator()(const vector<T> &keyval) const noexcept {\\n size_t s=0;\\n for (auto&& v: keyval) s=HashCombine(s,v);\\n return s;\\n }\\n};\\ntemplate<int N> struct HashTupleCore{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\\n size_t s=HashTupleCore<N-1>()(keyval);\\n return HashCombine(s,get<N-1>(keyval));\\n }\\n};\\ntemplate <> struct HashTupleCore<0>{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\\n};\\ntemplate<class... Args> struct hash<tuple<Args...>>{\\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\\n }\\n};\\n \\nvector<mint> _fac, _finv, _inv;\\nvoid COMinit(int N) {\\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\\n for (int i = 2; i <= N; i++) {\\n _fac[i] = _fac[i-1] * mint(i);\\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\\n _finv[i] = _finv[i - 1] * _inv[i];\\n }\\n}\\n \\nmint FAC(int N) {\\n if (N < 0) return 0; return _fac[N];\\n}\\nmint COM(int N, int K) {\\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\\n return _fac[N] * _finv[K] * _finv[N - K];\\n}\\nmint PERM(int N, int K) {\\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\\n return _fac[N] * _finv[N - K];\\n}\\nmint NHK(int N, int K) { // initのサイズに注意\\n if (N == 0 && K == 0) return 1;\\n return COM(N + K - 1, K);\\n}\\n \\n#pragma endregion\\n\\n// https://hashiryo.github.io/Library/src/DataStructure/SortedPerBucket.hpp\\ntemplate <class T, int B= 700> class SortedPerBucket {\\n static constexpr T INF= numeric_limits<T>::max() / 2;\\n struct Dat {\\n const int n;\\n T a[B], sorted[B], acc[B + 1];\\n T add, lb, ub;\\n Dat(int b): n(b), a{0}, sorted{0}, acc{0}, add(0), lb(-INF), ub(INF) {}\\n Dat(const T *bg, int b): n(b), a{0}, acc{0}, add(0), lb(-INF), ub(INF) {\\n for (int i= n; i--;) a[i]= *(bg + i);\\n build();\\n }\\n inline bool eval() {\\n if (add == 0 && lb == -INF && ub == INF) return false;\\n for (auto &x: a) x= clamp(x, lb, ub) + add;\\n return add= 0, lb= -INF, ub= INF, true;\\n }\\n inline void build() { copy_n(a, B, sorted), sort(sorted, sorted + n), partial_sum(sorted, sorted + n, acc + 1); }\\n inline int idx(T x) const { return lower_bound(sorted, sorted + n, x) - sorted; }\\n inline int count(T x) const { return x-= add, (x <= lb ? 0 : ub < x ? n : idx(x)); }\\n inline T sum() const {\\n int l= idx(lb), u= idx(ub);\\n return acc[u] - acc[l] + lb * l + ub * (n - u) + add * n;\\n }\\n inline T sum(T x) const {\\n if (x-= add; x <= lb) return 0;\\n if (ub < x) return sum();\\n int l= idx(lb), u= idx(x);\\n return acc[u] - acc[l] + lb * l + add * u;\\n }\\n inline T get(int k) const { return clamp(a[k], lb, ub) + add; }\\n };\\n const int n;\\n vector<Dat> dat;\\n template <class U, class All, class One> inline U fold(int l, int r, const All &all, const One &one) const {\\n U ret= 0;\\n if (int i= l / B, j= r / B, k= l % B, m= r % B; i < j) {\\n if (k) {\\n for (; k < dat[i].n; ++k) ret+= one(dat[i].get(k));\\n ++i;\\n }\\n for (; i < j; ++i) ret+= all(dat[i]);\\n for (; m--;) ret+= one(dat[j].get(m));\\n } else\\n for (; k < m; ++k) ret+= one(dat[i].get(k));\\n return ret;\\n }\\n template <class All, class One> inline void update(int l, int r, const All &all, const One &one) {\\n if (int i= l / B, j= r / B, k= l % B, m= r % B; i < j) {\\n if (k) {\\n for (dat[i].eval(); k < dat[i].n; k++) one(dat[i].a[k]);\\n dat[i].build(), ++i;\\n }\\n for (; i < j; ++i) all(dat[i]);\\n if (m) {\\n for (dat[j].eval(); m--;) one(dat[j].a[m]);\\n dat[j].build();\\n }\\n } else {\\n for (dat[i].eval(); k < m; ++k) one(dat[i].a[k]);\\n dat[i].build();\\n }\\n }\\npublic:\\n SortedPerBucket(int n): n(n) {\\n for (int l= 0, r; l < n; l= r) r= min(l + B, n), dat.emplace_back(r - l);\\n }\\n SortedPerBucket(const vector<T> &a): n(a.size()) {\\n for (int l= 0, r; l < n; l= r) r= min(l + B, n), dat.emplace_back(a.data() + l, r - l);\\n }\\n // count i s.t. (l <= i < r) && (a[i] < ub)\\n int count(int l, int r, T ub) const {\\n return fold<int>(\\n l, r, [&](const Dat &d) { return d.count(ub); }, [&](T x) { return x < ub; });\\n }\\n // count i s.t. (l <= i < r) && (lb <= a[i] < ub)\\n int count(int l, int r, T lb, T ub) const { return count(l, r, ub) - count(l, r, lb); }\\n // sum a[i] s.t. (l <= i < r)\\n T sum(int l, int r) const {\\n return fold<T>(\\n l, r, [&](const Dat &d) { return d.sum(); }, [&](T x) { return x; });\\n }\\n // sum a[i] s.t. (l <= i < r) && (a[i] < ub)\\n T sum(int l, int r, T ub) const {\\n return fold<T>(\\n l, r, [&](const Dat &d) { return d.sum(ub); }, [&](T x) { return x < ub ? x : 0; });\\n }\\n // sum a[i] s.t. (l <= i < r) && (lb <= a[i] < ub)\\n T sum(int l, int r, T lb, T ub) const { return sum(l, r, ub) - sum(l, r, lb); }\\n void set(int k, T x) {\\n int i= k / B, j= k % B;\\n dat[i].eval(), dat[i].a[j]= x, dat[i].build();\\n }\\n T get(int k) const { return dat[k / B].get(k % B); }\\n T operator[](int k) const { return get(k); }\\n void add(int l, int r, T v) {\\n update(\\n l, r, [&](Dat &d) { d.add+= v; }, [&](T &x) { x+= v; });\\n }\\n void chmin(int l, int r, T ub) {\\n auto f= [&](Dat &d) {\\n T b= ub - d.add;\\n d.ub= min(d.ub, b), d.lb= min(d.lb, b);\\n };\\n update(l, r, f, [&](T &x) { x= min(x, ub); });\\n }\\n void chmax(int l, int r, T lb) {\\n auto f= [&](Dat &d) {\\n T a= lb - d.add;\\n d.lb= max(d.lb, a), d.ub= max(d.ub, a);\\n };\\n update(l, r, f, [&](T &x) { x= max(x, lb); });\\n }\\n void chclamp(int l, int r, T lb, T ub) {\\n auto f= [&](Dat &d) {\\n T a= lb - d.add, b= ub - d.add;\\n d.ub= clamp(d.ub, a, b), d.lb= clamp(d.lb, a, b);\\n };\\n update(l, r, f, [&](T &x) { x= clamp(x, lb, ub); });\\n }\\n};\\n\\nsigned main() {\\n int N, Q;\\n cin >> N >> Q;\\n vector<int> A(N);\\n for (int i = 0; i < N; i++) cin >> A[i];\\n\\n SortedPerBucket<long long, 100> seg(A);\\n for (int i = 0; i < Q; i++) {\\n int t;\\n cin >> t;\\n if (t == 1) {\\n int l, r, x;\\n cin >> l >> r >> x;\\n l--; r--; \\n seg.chmin(l, r + 1, x);\\n }\\n if (t == 2) {\\n int l, r, x;\\n cin >> l >> r >> x;\\n l--; r--; \\n seg.chmax(l, r + 1, x);\\n }\\n if (t == 3) {\\n int l, r, x;\\n cin >> l >> r >> x;\\n l--; r--; \\n seg.add(l, r + 1, x);\\n }\\n if (t == 4) {\\n int l, r, a, b;\\n cin >> l >> r >> a >> b;\\n l--; r--; \\n cout << seg.count(l, r + 1, a, b + 1) << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1060,\n \"memory_kb\": 7632,\n \"score_of_the_acc\": -1.0585,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3170_7517934\",\n \"code_snippet\": \"#line 1 \\\"library-cpp/other/template.hpp\\\"\\n// clang-format off\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing uint = unsigned int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pll = pair<long long, long long>;\\ntemplate <class T> using maxheap = priority_queue<T>;\\ntemplate <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T> using vec = vector<T>;\\ntemplate <class T> using vvec = vector<vector<T>>;\\n#define OVERLOAD_REP(_1, _2, _3, name, ...) name\\n#define REP0(n) for (auto minato = decay_t<decltype(n)>{}; minato < (n); ++minato)\\n#define REP1(i, n) for (auto i = decay_t<decltype(n)>{}; (i) < (n); (i)++)\\n#define REP2(i, l, r) for (auto i = (l); (i) < (r); (i)++)\\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\\n#define OVERLOAD_RREP(_1, _2, _3, name, ...) name\\n#define RREP1(i, n) for (auto i = (n) - 1; (i) >= decay_t<decltype(n)>{}; (i)--)\\n#define RREP2(i, l, r) for (auto i = (r) - 1; (i) >= (l); (i)--)\\n#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP2, RREP1)(__VA_ARGS__)\\n#define all(x) begin(x), end(x)\\ntemplate <class Container> int SZ(const Container& v) { return int(v.size()); }\\ntemplate <class T> void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }\\ntemplate <class T> T MAX(const vector<T>& v) { return *max_element(v.begin(), v.end()); }\\ntemplate <class T> T MIN(const vector<T>& v) { return *min_element(v.begin(), v.end()); }\\ntemplate <class T> T SUM(const vector<T>& v) { return accumulate(v.begin(), v.end(), T(0)); }\\ntemplate <class T> T ABS(T x) { return max(x, -x); }\\ntemplate <class T1, class T2> bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; }\\ntemplate <class T1, class T2> bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; }\\nint topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }\\nint botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }\\nint popcount(ull x) { return __builtin_popcountll(x); }\\nint kthbit(ull x, int k) { return (x >> k) & 1; }\\nconstexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; }\\ntemplate <typename S> void rearrange(const vector<S>& id) { (void)id; }\\ntemplate <typename S, typename T> void rearrange_exec(const vector<S>& id, vector<T>& v) { vector<T> w(v.size()); for (size_t i = 0; i < id.size(); i++) { w[i] = v[id[i]]; } v.swap(w); }\\ntemplate <typename S, typename Head, typename... Tail> void rearrange(const vector<S>& id, Head& a, Tail& ...tail) { rearrange_exec(id, a); rearrange(id, tail...); }\\nistream& operator>>(istream& is, __int128_t& x) {\\n x = 0;\\n string s;\\n is >> s;\\n int n = int(s.size()), it = 0;\\n if (s[0] == '-') it++;\\n for (; it < n; it++) x = (x * 10 + s[it] - '0');\\n if (s[0] == '-') x = -x;\\n return is;\\n}\\nostream& operator<<(ostream& os, __int128_t x) {\\n if (x == 0) return os << 0;\\n if (x < 0) os << '-', x = -x;\\n deque<int> deq;\\n while (x) deq.emplace_front(x % 10), x /= 10;\\n for (int e : deq) os << e;\\n return os;\\n}\\ntemplate <class T> vector<T> &operator++(vector<T>& v) { for (auto& e : v) { e++; } return v;} \\ntemplate <class T> vector<T> operator++(vector<T>& v, int) { auto res = v; for (auto& e : v) { e++; } return res; }\\ntemplate <class T> vector<T> &operator--(vector<T>& v) { for (auto& e : v) { e--; } return v; }\\ntemplate <class T> vector<T> operator--(vector<T>& v, int) { auto res = v; for (auto& e : v) { e--; } return res; }\\ntemplate <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x) { return pair<T1, T2>(-x.first, -x.second); }\\ntemplate <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first - y.first, x.second - y.second); }\\ntemplate <class T1, class T2> pair<T1, T2> operator+(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first + y.first, x.second + y.second); }\\ntemplate <class T1, class T2> pair<T1, T2> operator+=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l + r; }\\ntemplate <class T1, class T2> pair<T1, T2> operator-=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l - r; }\\nconstexpr char ln = '\\\\n';\\nconst string YESNO[2] = {\\\"NO\\\", \\\"YES\\\"};\\nconst string YesNo[2] = {\\\"No\\\", \\\"Yes\\\"};\\nvoid YES(bool t = true) { cout << YESNO[t] << \\\"\\\\n\\\"; }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = true) { cout << YesNo[t] << \\\"\\\\n\\\"; }\\nvoid No(bool t = 1) { Yes(!t); }\\ntemplate <class T> void drop(T x) { cout << x << \\\"\\\\n\\\"; exit(0); }\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LDB(...) \\\\\\n long double __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define VEC2(type, name1, name2, size) \\\\\\n vector<type> name1(size), name2(size); \\\\\\n for (int i = 0; i < size; i++) IN(name1[i], name2[i])\\n#define VEC3(type, name1, name2, name3, size) \\\\\\n vector<type> name1(size), name2(size), name3(size); \\\\\\n for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\\n#define VEC4(type, name1, name2, name3, name4, size) \\\\\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\\\\n for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\\n#define VV(type, name, N, M) \\\\\\n vector<vector<type>> name(N, vector<type>(M)); \\\\\\n IN(name)\\ntemplate <class T> void scan(T& a) { cin >> a; }\\ntemplate <class T> void scan(vector<T>& a) { for (auto& i : a) scan(i); }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head& head, Tail&... tail) { scan(head); IN(tail...); }\\nvoid print() { cout << \\\"\\\\n\\\"; }\\ntemplate <class T> void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << \\\" \\\"; } cout << *it; } print(); }\\ntemplate <class T, class... Args> void print(const T& x, const Args& ... args) { cout << x; if (sizeof...(Args)) cout << \\\" \\\"; print(args...); }\\n#ifdef MINATO_LOCAL\\ntemplate <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\ntemplate <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; }\\ntemplate <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? \\\"\\\" : \\\", \\\") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); }\\ntemplate <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << \\\"(\\\"; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << \\\")\\\"; }\\nstring debug_delim(int& i) { return i++ == 0 ? \\\"\\\" : \\\", \\\"; }\\n#define debug_embrace(x) { int i = 0; os << \\\"{\\\"; { x } return os << \\\"}\\\"; }\\ntemplate <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) }\\ntemplate <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }\\ntemplate <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }\\ntemplate <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }\\ntemplate <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) }\\ntemplate <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }\\ntemplate <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) }\\ntemplate <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) }\\ntemplate <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }\\ntemplate <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }\\nvoid debug_out() { cerr << endl; }\\ntemplate <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << \\\" \\\" << x; debug_out(args...); }\\n#define debug(...) cerr << __LINE__ << \\\" : [\\\" << #__VA_ARGS__ << \\\"] =\\\", debug_out(__VA_ARGS__)\\n#else\\n#define debug(...) (void(0))\\n#endif\\nstruct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); }; } fast_ios_;\\n///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n// clang-format on\\n#line 2 \\\"E.cpp\\\"\\n\\ntemplate <int W> struct SquareRootDecomposition {\\n struct Ranges {\\n optional<pair<int, int>> left_overflow_range;\\n optional<pair<int, int>> bucket_range;\\n optional<pair<int, int>> right_overflow_range;\\n Ranges()\\n : left_overflow_range(nullopt),\\n bucket_range(nullopt),\\n right_overflow_range(nullopt) {\\n }\\n };\\n\\n int n;\\n\\n SquareRootDecomposition() {\\n }\\n SquareRootDecomposition(int n) : n(n) {\\n }\\n\\n int bucket_size() const {\\n return (n + W - 1) / W;\\n }\\n\\n /**\\n * @brief クエリの範囲を分割する\\n * @param l 左端\\n * @param r 右端\\n * @return 分割された範囲\\n * @note [l, r) の範囲を分割する\\n */\\n Ranges query(int l, int r) const {\\n assert(0 <= l && l < r && r <= n);\\n Ranges ret;\\n int l_bucket_id = bucket_id(l);\\n int r_bucket_id = bucket_id(r - 1);\\n auto [l_bucket_l, l_bucket_r] = bucket_range(l_bucket_id);\\n auto [r_bucket_l, r_bucket_r] = bucket_range(r_bucket_id);\\n if (l_bucket_id == r_bucket_id) {\\n if (l == l_bucket_l && r == r_bucket_r) {\\n ret.bucket_range = {l_bucket_id, l_bucket_id + 1};\\n } else {\\n ret.left_overflow_range = {l, r};\\n }\\n } else {\\n if (l_bucket_id + 1 < r_bucket_id) {\\n ret.bucket_range = {l_bucket_id + 1, r_bucket_id};\\n }\\n if (l == l_bucket_l) {\\n if (ret.bucket_range) {\\n ret.bucket_range->first--;\\n } else {\\n ret.bucket_range = {l_bucket_id, l_bucket_id + 1};\\n }\\n } else {\\n ret.left_overflow_range = {l, l_bucket_r};\\n }\\n if (r == r_bucket_r) {\\n if (ret.bucket_range) {\\n ret.bucket_range->second++;\\n } else {\\n ret.bucket_range = {r_bucket_id, r_bucket_id + 1};\\n }\\n } else {\\n ret.right_overflow_range = {r_bucket_l, r};\\n }\\n }\\n return ret;\\n }\\n\\n int bucket_id(int i) const {\\n assert(0 <= i && i < n);\\n return i / W;\\n }\\n\\n pair<int, int> bucket_range(int i) const {\\n assert(0 <= i && i < bucket_size());\\n int l = i * W;\\n int r = min((i + 1) * W, n);\\n return {l, r};\\n }\\n};\\n\\nvoid solve() {\\n constexpr ll INF = TEN(18);\\n INT(N, Q);\\n VEC(ll, A, N);\\n\\n SquareRootDecomposition<128> decomp(N);\\n auto B = A;\\n vec<ll> add(decomp.bucket_size(), 0);\\n vec<ll> mn(decomp.bucket_size(), -INF);\\n vec<ll> mx(decomp.bucket_size(), INF);\\n // 足したあと切り詰める\\n auto upd = [&](int k) {\\n auto [l, r] = decomp.bucket_range(k);\\n rep(i, l, r) A[i] += add[k];\\n add[k] = 0;\\n rep(i, l, r) A[i] = clamp(A[i], mn[k], mx[k]);\\n rep(i, l, r) B[i] = A[i];\\n sort(B.begin() + l, B.begin() + r);\\n mn[k] = -INF;\\n mx[k] = INF;\\n };\\n auto lazy = [&](int k, int t, ll x) {\\n if (t == 1) {\\n chmin(mn[k], x);\\n chmin(mx[k], x);\\n } else if (t == 2) {\\n chmax(mn[k], x);\\n chmax(mx[k], x);\\n } else {\\n add[k] += x;\\n mn[k] += x;\\n mx[k] += x;\\n }\\n };\\n rep(i, decomp.bucket_size()) upd(i);\\n rep(Q) {\\n INT(t);\\n if (t == 1) {\\n LL(l, r, x);\\n l--;\\n auto ranges = decomp.query(l, r);\\n if (ranges.left_overflow_range) {\\n auto [p, q] = ranges.left_overflow_range.value();\\n upd(decomp.bucket_id(p));\\n rep(j, p, q) chmin(A[j], x);\\n upd(decomp.bucket_id(p));\\n }\\n if (ranges.bucket_range) {\\n auto [p, q] = ranges.bucket_range.value();\\n rep(j, p, q) {\\n lazy(j, t, x);\\n }\\n }\\n if (ranges.right_overflow_range) {\\n auto [p, q] = ranges.right_overflow_range.value();\\n debug(p, q);\\n upd(decomp.bucket_id(p));\\n rep(j, p, q) chmin(A[j], x);\\n upd(decomp.bucket_id(p));\\n }\\n } else if (t == 2) {\\n LL(l, r, x);\\n l--;\\n auto ranges = decomp.query(l, r);\\n if (ranges.left_overflow_range) {\\n auto [p, q] = ranges.left_overflow_range.value();\\n upd(decomp.bucket_id(p));\\n rep(j, p, q) chmax(A[j], x);\\n upd(decomp.bucket_id(p));\\n }\\n if (ranges.bucket_range) {\\n auto [p, q] = ranges.bucket_range.value();\\n rep(j, p, q) {\\n lazy(j, t, x);\\n }\\n }\\n if (ranges.right_overflow_range) {\\n auto [p, q] = ranges.right_overflow_range.value();\\n upd(decomp.bucket_id(p));\\n rep(j, p, q) chmax(A[j], x);\\n upd(decomp.bucket_id(p));\\n }\\n\\n } else if (t == 3) {\\n LL(l, r, x);\\n l--;\\n auto ranges = decomp.query(l, r);\\n if (ranges.left_overflow_range) {\\n auto [p, q] = ranges.left_overflow_range.value();\\n upd(decomp.bucket_id(p));\\n rep(j, p, q) A[j] += x;\\n upd(decomp.bucket_id(p));\\n }\\n if (ranges.bucket_range) {\\n auto [p, q] = ranges.bucket_range.value();\\n rep(j, p, q) {\\n lazy(j, t, x);\\n }\\n }\\n if (ranges.right_overflow_range) {\\n auto [p, q] = ranges.right_overflow_range.value();\\n upd(decomp.bucket_id(p));\\n rep(j, p, q) A[j] += x;\\n upd(decomp.bucket_id(p));\\n }\\n\\n } else {\\n LL(l, r, x, y);\\n l--;\\n auto ranges = decomp.query(l, r);\\n int ans = 0;\\n if (ranges.left_overflow_range) {\\n auto [p, q] = ranges.left_overflow_range.value();\\n upd(decomp.bucket_id(p));\\n rep(j, p, q) {\\n if (x <= A[j] && A[j] <= y) ans++;\\n }\\n }\\n if (ranges.bucket_range) {\\n auto [p, q] = ranges.bucket_range.value();\\n rep(j, p, q) {\\n if (mn[j] > y || mx[j] < x) continue;\\n auto [a, b] = decomp.bucket_range(j);\\n int lb =\\n lower_bound(B.begin() + a, B.begin() + b, x - add[j]) -\\n B.begin();\\n int ub =\\n upper_bound(B.begin() + a, B.begin() + b, y - add[j]) -\\n B.begin();\\n if (mn[j] >= x) lb = a;\\n if (mx[j] <= y) ub = b;\\n ans += ub - lb;\\n }\\n }\\n if (ranges.right_overflow_range) {\\n auto [p, q] = ranges.right_overflow_range.value();\\n upd(decomp.bucket_id(p));\\n rep(j, p, q) {\\n if (x <= A[j] && A[j] <= y) ans++;\\n }\\n }\\n print(ans);\\n }\\n }\\n}\\n\\nint main() {\\n int T = 1;\\n // cin >> T;\\n for (int i = 0; i < T; i++) {\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1320,\n \"memory_kb\": 4684,\n \"score_of_the_acc\": -0.8469,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3170_6377836\",\n \"code_snippet\": \"// #pragma GCC optimize (\\\"O3\\\")\\n// #pragma GCC target(\\\"avx512f\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n// #ifndef ONLINE_JUDGE\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include<bits/stdc++.h>\\n// #include <boost/multiprecision/cpp_dec_float.hpp>\\n// #include <boost/multiprecision/cpp_int.hpp>\\n// #include <boost/rational.hpp>\\n// namespace mp = boost::multiprecision;\\n// using Bint=mp::cpp_int;\\n// using Real = mp::number<mp::cpp_dec_float<64>>;\\n// #include<atcoder/all>\\nusing namespace std;\\n// using namespace atcoder;\\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\\n#define rep1(n) for(ll i = 0; i < (n); ++i)\\n#define rep2(i, n) for(ll i = 0; i < (n); ++i)\\n#define rep3(i, a, b) for(ll i = (a); i < (b); ++i)\\n#define rep4(i, a, b, c) for(ll i = (a); i < (b); i += (c))\\n#define rrep(i, a, b) for(ll i = (b); i --> (a); )\\nint scan(){ return getchar(); }\\nvoid scan(int& a){ scanf(\\\"%d\\\", &a); }\\nvoid scan(unsigned& a){ scanf(\\\"%u\\\", &a); }\\nvoid scan(long long& a){ scanf(\\\"%lld\\\", &a); }\\nvoid scan(unsigned long long& a){ scanf(\\\"%llu\\\", &a); }\\nvoid scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\\\\n'); }\\nvoid scan(float& a){ scanf(\\\"%f\\\", &a); }\\nvoid scan(double& a){ scanf(\\\"%lf\\\", &a); }\\nvoid scan(long double& a){ scanf(\\\"%Lf\\\", &a); }\\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++) { int b; scan(b); a[i] = b; } }\\nvoid scan(char a[]){ scanf(\\\"%s\\\", a); }\\nvoid scan(string& a){ cin >> a; }\\ntemplate<class T> void scan(vector<T>&);\\ntemplate<class T> void scan(deque<T>&);\\ntemplate<class T, size_t size> void scan(array<T, size>&);\\ntemplate<class T, class L> void scan(pair<T, L>&);\\ntemplate<class T, size_t size> void scan(T(&)[size]);\\ntemplate<class T> void scan(vector<T>& a){ for(auto& i : a) scan(i); }\\ntemplate<class T> void scan(deque<T>& a){ for(auto& i : a) scan(i); }\\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto& i : a) scan(i); }\\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto& i : a) scan(i); }\\ntemplate<class T> void scan(T& a){ cin >> a; }\\nvoid in(){}\\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\\nvoid print(){ putchar(' '); }\\nvoid print(bool a){ printf(\\\"%d\\\", a); }\\nvoid print(int a){ printf(\\\"%d\\\", a); }\\nvoid print(unsigned a){ printf(\\\"%u\\\", a); }\\nvoid print(long long a){ printf(\\\"%lld\\\", a); }\\nvoid print(unsigned long long a){ printf(\\\"%llu\\\", a); }\\nvoid print(char a){ printf(\\\"%c\\\", a); }\\nvoid print(char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(float a){ printf(\\\"%.15f\\\", a); }\\nvoid print(double a){ printf(\\\"%.15f\\\", a); }\\nvoid print(long double a){ printf(\\\"%.15Lf\\\", a); }\\nvoid print(const string& a){ for(auto&& i : a) print(i); }\\ntemplate<class T> void print(const vector<T>&);\\ntemplate<class T, size_t size> void print(const array<T, size>&);\\ntemplate<class T, class L> void print(const pair<T, L>& p);\\ntemplate<class T, size_t size> void print(const T (&)[size]);\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\\ntemplate<class T> void print(const T& a){ cout << a; }\\nint out(){ putchar('\\\\n'); return 0; }\\ntemplate<class T> int out(const T& t){ print(t); putchar('\\\\n'); return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\\n#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type> name(size); in(name)\\n#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)\\n#define bit(n,k) (((ll)n>>(ll)k)&1) /*nのk bit目*/\\n#define pb push_back\\n#define pf push_front\\n#define fi first\\n#define se second\\n#define eb emplace_back\\n#define endl '\\\\n'\\n#define SZ(x) ((int)(x).size())\\n#define all(x) (x).begin(),(x).end()\\n#define rall(x) (x).rbegin(),(x).rend()\\n#define debug(v) cout<<#v<<\\\":\\\";for(auto x:v){cout<<x<<' ';}cout<<endl;\\n#define pi 3.14159265359\\nconst double eps = 1e-12;\\nconst long long INF= (long long)1e18+20;\\nconst int inf= 1010101010;\\ntypedef long double D; // 座標値の型。doubleかlong doubleを想定\\ntypedef complex<D> Point; // Point\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl>vvl;\\ntypedef vector<vvl>vvvl;\\ntypedef vector<vvvl>vvvvl;\\ntypedef vector<vvvvl>vvvvvl;\\ntypedef vector<int>vi;\\ntypedef vector<vi>vvi;\\ntypedef vector<vvi>vvvi;\\ntypedef vector<vvvi>vvvvi;\\ntypedef vector<vvvvi>vvvvvi;\\ntypedef pair<ll,ll> P;\\n#define __builtin_popcount __builtin_popcountll\\n// typedef double D; \\ntemplate<class T> using minpq=priority_queue<T,vector<T>,greater<T>>;\\n// const ll MOD=1000000007LL;\\nconst ll MOD=998244353LL;\\n// using mint=modint998244353;\\n// using mint=modint1000000007;\\n// using mint=modint;\\n// typedef vector<mint> vm;\\n// typedef vector<vector<mint> >vvm;\\n// typedef vector<vector<vector<mint> > >vvvm;\\n//上下右左\\nvl dx={-1,1,0,0,1,1,-1,-1};\\nvl dy={0,-0,1,-1,-1,1,-1,1};\\n\\n\\ntemplate<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }\\ntemplate<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {\\n return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\\n}\\n\\ntemplate<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\\ntemplate<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}\\ntemplate<class T> ll sum(const T& a){ return accumulate(all(a), 0LL); }\\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\\n\\n//素因数分解O(√n)\\nmap<ll,ll>prime_factor(ll n){\\n map<ll,ll>res;\\n for(ll i=2;i*i<=n;i++){\\n while(n%i==0){\\n res[i]++;\\n n/=i;\\n }\\n }\\n if(n!=1)res[n]=1;\\n return res;\\n}\\n\\nconst ll MAX = 5000010;//5*10^6\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n//finvが階乗の逆元\\n\\n// テーブルを作る前処理\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (ll i = 2; i < MAX; i++){\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n\\n// 二項係数計算\\nlong long COM(ll n, ll k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\\n}\\n\\n\\n//素数判定O(√n)\\nbool is_prime(ll n){\\n for(ll i=2;i*i<=n;i++){\\n if(n%i==0)return false;\\n }\\n return n!=1;\\n}\\n\\n//約数の列挙O(√n)\\nvector<ll>divisor(ll n){\\n vector<ll>res;\\n for(ll i=1;i*i<=n;i++){\\n if(n%i==0){\\n res.push_back(i);\\n if(i != n/i) res.push_back(n/i);\\n }\\n }\\n return res;\\n}\\n\\n\\nll exp(ll n,ll r){\\n if(r==0)return 1;\\n return n*exp(n,r-1);\\n}\\n\\nll factorial(int n){\\n if(n==0)return 1;\\n return n*factorial(n-1);\\n}\\n\\n\\npair<long long,long long>roop_search(vl next_index,ll first_point){\\n\\tll idx=first_point;\\n\\tmap<ll,ll>mp;\\n\\tmp[idx]=0;\\n\\tll cur=1;\\n\\tll roop_begin=-1;\\n\\tll roop_size=-1;\\n\\twhile(true){\\n\\t\\tidx=next_index[idx];\\n\\t\\tif(mp.count(idx)){\\n\\t\\t\\troop_begin=mp[idx];\\n\\t\\t\\troop_size=cur-roop_begin;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tmp[idx]=cur++;\\n\\t}\\n\\treturn {roop_begin,roop_size};\\n}\\n\\n\\ntemplate< typename T >\\nstruct Compress {\\n vector< T > xs;\\n\\n Compress() = default;\\n\\n Compress(const vector< T > &vs) {\\n add(vs);\\n }\\n\\n Compress(const initializer_list< vector< T > > &vs) {\\n for(auto &p : vs) add(p);\\n }\\n\\n void add(const vector< T > &vs) {\\n copy(begin(vs), end(vs), back_inserter(xs));\\n }\\n\\n void add(const T &x) {\\n xs.emplace_back(x);\\n }\\n\\n void build() {\\n sort(begin(xs), end(xs));\\n xs.erase(unique(begin(xs), end(xs)), end(xs));\\n }\\n\\n vector< int > get(const vector< T > &vs) const {\\n vector< int > ret;\\n transform(begin(vs), end(vs), back_inserter(ret), [&](const T &x) {\\n return lower_bound(begin(xs), end(xs), x) - begin(xs);\\n });\\n return ret;\\n }\\n\\n int get(const T &x) const {\\n return lower_bound(begin(xs), end(xs), x) - begin(xs);\\n }\\n\\n const T &operator[](int k) const {\\n return xs[k];\\n }\\n};\\n\\n\\ntemplate<class T>\\nvoid rotate90(ll &h,ll &w,vector<vector<T>>&vec){\\n vector<vector<T>>vec2(w,vector<T>(h));\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n vec2[j][h-1-i]=vec[i][j];\\n }\\n }\\n vec=vec2;\\n swap(h,w);\\n}\\n\\nstruct RandomNumberGenerator {\\n mt19937 mt;\\n\\n RandomNumberGenerator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}\\n\\n int operator()(int a, int b) { // [a, b)\\n uniform_int_distribution< int > dist(a, b - 1);\\n return dist(mt);\\n }\\n\\n int operator()(int b) { // [0, b)\\n return (*this)(0, b);\\n }\\n};\\n\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(12);\\n //主客転倒！二重和のときは一番内側の物が何回使われるか\\n //√Nで分けるテク\\n //絶対値は外して2通りの式にした後、変数ごとにまとめる\\n //組み合わせが少ないそうなものはdfsで実行してみる（典型25）\\n //DはDPのD\\n //pow_mod,prime_factor,divisor,is_prime\\n // g++ -fsanitize=undefined code.cpp -I.\\n // valgrind ./a.out\\n /*--------------------------------*/\\n\\n ll n,q;cin>>n>>q;\\n vl a(n);\\n rep(i,n)cin>>a[i];\\n \\n ll b=ceil(sqrt(n));//パケットのサイズ\\n ll cnt=(n+b-1)/b;//パケットの個数\\n \\n vector<tuple<ll,ll,ll>>vec(cnt,{INF,-INF,0});//遅延評価するminmaxadd\\n vvl sort_vec(cnt);//パケットごとにソート\\n rep(i,n){\\n sort_vec[i/b].pb(a[i]);\\n }\\n rep(i,b)sort(all(sort_vec));\\n \\n //両端の愚直更新\\n auto f=[&](ll l,ll r,ll c1,ll b1,ll a1)->void{\\n //l,rの属するパケットを遅延評価\\n ll num=r/b;//numがパケットの番号\\n ll dmin,dmax,dadd;\\n tie(dmin,dmax,dadd)=vec[num];\\n for(ll i=num*b;i<(num+1)*b;i++){\\n a[i]+=dadd;\\n chmax(a[i],dmax); \\n chmin(a[i],dmin); \\n }\\n vec[num]={INF,-INF,0};\\n for(ll i=l;i<=r;i++){\\n a[i]+=a1;\\n chmax(a[i],b1);\\n chmin(a[i],c1);\\n }\\n vl new_sort_vec;\\n for(ll i=num*b;i<(num+1)*b;i++){\\n new_sort_vec.pb(a[i]);\\n }\\n sort(all(new_sort_vec));\\n sort_vec[num]=new_sort_vec;\\n };\\n\\n //パケット更新\\n auto f2=[&](ll num,ll c2,ll b2,ll a2)->void{\\n //numはパケット番号\\n ll c1,b1,a1;\\n tie(c1,b1,a1)=vec[num];\\n ll na=a1+a2;\\n ll nb=max(b2,min(c1+a2,b1+a2));\\n ll nc=min(c2,max(b2,c1+a2));\\n vec[num]={nc,nb,na};\\n };\\n\\n //両端の愚直取得\\n auto f3=[&](ll l,ll r,ll x)->ll {\\n //l,rの属するパケットを遅延評価\\n ll num=r/b;//numがパケットの番号\\n ll dmin,dmax,dadd;\\n tie(dmin,dmax,dadd)=vec[num];\\n for(ll i=num*b;i<(num+1)*b;i++){\\n a[i]+=dadd;\\n chmax(a[i],dmax); \\n chmin(a[i],dmin); \\n }\\n // if(l==8 and r==9 and (x==-10||x==1)){\\n // cout<<\\\"OK\\\"<<endl;\\n // cout<<a[8]<<\\\" \\\"<<a[9]<<endl;\\n // }\\n\\n vec[num]={INF,-INF,0};\\n vl new_sort_vec;\\n for(ll i=num*b;i<(num+1)*b;i++){\\n new_sort_vec.pb(a[i]);\\n }\\n sort(all(new_sort_vec));\\n sort_vec[num]=new_sort_vec;\\n \\n //x以上の個数を取得\\n \\n ll res=0;\\n for(ll i=l;i<=r;i++){\\n if(a[i]>=x)res++;\\n }\\n return res;\\n };\\n \\n //パケット取得\\n auto f4=[&](ll num,ll x)->ll{\\n //パケット番号numにおいて、x以上の個数\\n ll c1,b1,a1;\\n tie(c1,b1,a1)=vec[num];\\n if(x>c1)return 0;\\n if(x<=b1)return sort_vec[num].size();\\n ll nx=x-a1;\\n //sort_vecの中でnx以上の個数を求めればよい\\n ll res=sort_vec[num].size();\\n res-=lower_bound(all(sort_vec[num]),nx)-sort_vec[num].begin();\\n return res;\\n };\\n\\n while(q--){\\n ll t;cin>>t;\\n // debug(a);\\n if(t==1){\\n //chminクエリ\\n ll l,r,x;cin>>l>>r>>x;\\n l--;r--;\\n if(l%b!=0){\\n //左端愚直更新発生\\n if((l+b-1)/b*b-1<=r){\\n f(l,(l+b-1)/b*b-1,x,-INF,0);\\n l=(l+b-1)/b*b;\\n }\\n else {\\n f(l,r,x,-INF,0);\\n l=r+1;\\n }\\n }\\n if(r%b!=b-1){\\n //右端愚直更新発生\\n if(l<=r/b*b)f(r/b*b,r,x,-INF,0);\\n r=r/b*b-1;\\n }\\n if(l<=r){\\n for(ll i=l/b;i<=r/b;i++){\\n //パケット更新\\n f2(i,x,-INF,0);\\n }\\n }\\n }\\n if(t==2){\\n //chmaxクエリ\\n ll l,r,x;cin>>l>>r>>x;\\n l--;r--;\\n \\n if(l%b!=0){\\n //左端愚直更新発生\\n if((l+b-1)/b*b-1<=r){\\n f(l,(l+b-1)/b*b-1,INF,x,0);\\n l=(l+b-1)/b*b;\\n }\\n else {\\n f(l,r,INF,x,0);\\n l=r+1;\\n }\\n }\\n // if(check)cout<<l<<\\\" \\\"<<r<<endl;\\n if(r%b!=b-1){\\n //右端愚直更新発生\\n if(l<=r/b*b)f(r/b*b,r,INF,x,0);\\n r=r/b*b-1;\\n }\\n // if(check)cout<<l<<\\\" \\\"<<r<<endl;\\n if(l<=r){\\n for(ll i=l/b;i<=r/b;i++){\\n //パケット更新\\n f2(i,INF,x,0);\\n }\\n }\\n // if(check)cout<<l<<\\\" \\\"<<r<<endl;\\n }\\n if(t==3){\\n //addクエリ\\n ll l,r,x;cin>>l>>r>>x;\\n l--;r--;\\n if(l%b!=0){\\n //左端愚直更新発生\\n if((l+b-1)/b*b-1<=r){\\n f(l,(l+b-1)/b*b-1,INF,-INF,x);\\n l=(l+b-1)/b*b;\\n }\\n else {\\n f(l,r,INF,-INF,x);\\n l=r+1;\\n }\\n }\\n if(r%b!=b-1){\\n //右端愚直更新発生\\n if(l<=r/b*b)f(r/b*b,r,INF,-INF,x);\\n r=r/b*b-1;\\n }\\n if(l<=r){\\n for(ll i=l/b;i<=r/b;i++){\\n //パケット更新\\n f2(i,INF,-INF,x);\\n }\\n }\\n }\\n if(t==4){\\n //取得クエリ\\n ll l,r,x,y;cin>>l>>r>>x>>y;\\n l--;r--;\\n bool check=false;\\n if(r==8){\\n check=true;\\n // debug(a);\\n }\\n // cout<<b<<endl;\\n ll ans=0;\\n if(l%b!=0){\\n //左端愚直更新発生\\n //x以上からy+1以上を引けばよい\\n if((l+b-1)/b*b-1<=r){\\n ans+=f3(l,(l+b-1)/b*b-1,x);\\n ans-=f3(l,(l+b-1)/b*b-1,y+1);\\n l=(l+b-1)/b*b;\\n }\\n else {\\n ans+=f3(l,r,x);\\n ans-=f3(l,r,y+1);\\n l=r+1;\\n }\\n }\\n // if(check)cout<<ans<<\\\" \\\"<<l<<\\\" \\\"<<r<<endl;\\n if(r%b!=b-1){\\n //右端愚直更新発生\\n if(l<=r/b*b){\\n ans+=f3(r/b*b,r,x);\\n //引く方がホントは1になるはず\\n // cout<<f3(r/b*b,r,x)<<\\\" \\\"<<f3(r/b*b,r,y+1)<<endl;\\n ans-=f3(r/b*b,r,y+1);\\n }\\n r=r/b*b-1;\\n }\\n // if(check)cout<<ans<<\\\" \\\"<<l<<\\\" \\\"<<r<<endl;\\n \\n // if(l>r){\\n // cout<<ans<<endl;\\n // continue;\\n // }\\n // cout<<ans<<\\\" \\\"<<l<<\\\" \\\"<<r<<endl;\\n if(l<=r){\\n for(ll i=l/b;i<=r/b;i++){\\n //パケット更新\\n // if(l==0 and r==7){\\n // cout<<\\\"OK\\\"<<endl;\\n \\n // }\\n // if(check)cout<<i<<endl;\\n ans+=f4(i,x);\\n // cout<<ans<<endl;\\n ans-=f4(i,y+1);\\n // cout<<ans<<endl;\\n }\\n }\\n cout<<ans<<endl;\\n }\\n // debug(a);\\n // cout<<get<0>(vec[0])<<\\\" \\\"<<get<1>(vec[0])<<\\\" \\\"<<get<2>(vec[0])<<endl;\\n // debug(a);\\n }\\n\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 140,\n \"memory_kb\": 5152,\n \"score_of_the_acc\": -0.141,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3170_5454384\",\n \"code_snippet\": \"#line 1 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3170\\\"\\n\\n#include <algorithm>\\n#include <cstdio>\\n\\n#line 2 \\\"src/data_structure/buckets.hpp\\\"\\n\\n/**\\n * @file buckets.hpp\\n * @brief Buckets\\n */\\n\\n#include <cmath>\\n#include <vector>\\n\\nnamespace workspace {\\n\\n/**\\n * @brief Buckets on a sequence.\\n */\\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\\n // Require random access.\\n static_assert(\\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\\n std::random_access_iterator_tag>::value);\\n\\n using difference_type =\\n typename std::iterator_traits<_Iterator>::difference_type;\\n\\n _Iterator __begin, __end;\\n\\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\\n std::declval<_Iterator>()));\\n\\n struct bucket {\\n value_type __data;\\n _Iterator __begin;\\n _Iterator __end;\\n };\\n\\n _Pack __pack;\\n _Unpack __unpack;\\n difference_type __unit;\\n std::vector<bucket> __buckets;\\n\\n void prepare() {\\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\\n\\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\\n __buckets.push_back({__pack(__l, __r), __l, __r});\\n }\\n }\\n\\n public:\\n /**\\n * @brief Constuct a new buckets object.\\n */\\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\\n difference_type __unit = 0)\\n : __begin(__first),\\n __end(__last),\\n __pack(__pack),\\n __unpack(__unpack),\\n __unit(__unit) {\\n prepare();\\n }\\n\\n /**\\n * @brief Number of buckets.\\n */\\n auto size() const { return __buckets.size(); }\\n\\n bool empty() const { return __begin == __end; }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __first\\n * @param __last\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\\n if (__first == __last) return;\\n\\n auto __index = std::distance(__begin, __first);\\n auto __b = std::next(__buckets.begin(), __index / __unit);\\n\\n if (__index % __unit) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\\n\\n auto __tmp = __pack(__first, __mid);\\n __oper(__tmp);\\n __unpack(__tmp, __first, __mid);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n ++__b;\\n }\\n\\n while (true) {\\n if (__b == __buckets.end()) return;\\n if (std::distance(__b->__end, __last) < 0) break;\\n\\n __oper(__b->__data);\\n ++__b;\\n }\\n\\n if (std::distance(__b->__begin, __last) > 0) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __tmp = __pack(__b->__begin, __last);\\n __oper(__tmp);\\n __unpack(__tmp, __b->__begin, __last);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n }\\n }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __i\\n * @param __j\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\\n }\\n};\\n\\n} // namespace workspace\\n#line 7 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n\\nint main() {\\n using namespace workspace;\\n using i64 = int64_t;\\n\\n int n, q;\\n scanf(\\\"%d%d\\\", &n, &q);\\n std::vector<i64> a(n);\\n for (auto&& x : a) {\\n scanf(\\\"%lld\\\", &x);\\n }\\n\\n struct data {\\n i64 min, max, add;\\n std::vector<i64> v;\\n };\\n\\n constexpr auto inf = __INT64_MAX__;\\n\\n buckets b(\\n begin(a), end(a),\\n [](auto l, auto r) {\\n data d;\\n d.add = 0;\\n d.min = inf;\\n d.max = -inf;\\n d.v = std::vector(l, r);\\n sort(d.v.begin(), d.v.end());\\n return d;\\n },\\n [](const auto& d, auto l, auto r) {\\n while (l != r) {\\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\\n ++l;\\n }\\n },\\n 128);\\n\\n for (int t, l, r; q--;) {\\n i64 x, y;\\n scanf(\\\"%d%d%d%lld\\\", &t, &l, &r, &x);\\n --l;\\n\\n switch (--t) {\\n case 0:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.min < c) return;\\n d.min = c;\\n if (d.max > c) d.max = c;\\n });\\n break;\\n\\n case 1:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.max > c) return;\\n d.max = c;\\n if (d.min < c) d.min = c;\\n });\\n break;\\n\\n case 2:\\n b(l, r, [&](auto& d) { d.add += x; });\\n break;\\n\\n case 3:\\n scanf(\\\"%lld\\\", &y);\\n int num = 0;\\n b(l, r, [&](const auto& d) {\\n int sign = 1;\\n for (auto z : {x - 1 - d.add, y - d.add}) {\\n sign *= -1;\\n if (z < d.max) continue;\\n if (z < d.min)\\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\\n d.v.begin());\\n else\\n num += sign * (int)d.v.size();\\n }\\n });\\n printf(\\\"%d\\\\n\\\", num);\\n break;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1200,\n \"memory_kb\": 4160,\n \"score_of_the_acc\": -0.7013,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3170_5454380\",\n \"code_snippet\": \"#line 1 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3170\\\"\\n\\n#include <algorithm>\\n#include <cstdio>\\n\\n#line 2 \\\"src/data_structure/buckets.hpp\\\"\\n\\n/**\\n * @file buckets.hpp\\n * @brief Buckets\\n */\\n\\n#include <cmath>\\n#include <vector>\\n\\nnamespace workspace {\\n\\n/**\\n * @brief Buckets on a sequence.\\n */\\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\\n // Require random access.\\n static_assert(\\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\\n std::random_access_iterator_tag>::value);\\n\\n using difference_type =\\n typename std::iterator_traits<_Iterator>::difference_type;\\n\\n _Iterator __begin, __end;\\n\\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\\n std::declval<_Iterator>()));\\n\\n struct bucket {\\n value_type __data;\\n _Iterator __begin;\\n _Iterator __end;\\n };\\n\\n _Pack __pack;\\n _Unpack __unpack;\\n difference_type __unit;\\n std::vector<bucket> __buckets;\\n\\n void prepare() {\\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\\n\\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\\n __buckets.push_back({__pack(__l, __r), __l, __r});\\n }\\n }\\n\\n public:\\n /**\\n * @brief Constuct a new buckets object.\\n */\\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\\n difference_type __unit = 0)\\n : __begin(__first),\\n __end(__last),\\n __pack(__pack),\\n __unpack(__unpack),\\n __unit(__unit) {\\n prepare();\\n }\\n\\n /**\\n * @brief Number of buckets.\\n */\\n auto size() const { return __buckets.size(); }\\n\\n bool empty() const { return __begin == __end; }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __first\\n * @param __last\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\\n if (__first == __last) return;\\n\\n auto __index = std::distance(__begin, __first);\\n auto __b = std::next(__buckets.begin(), __index / __unit);\\n\\n if (__index % __unit) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\\n\\n auto __tmp = __pack(__first, __mid);\\n __oper(__tmp);\\n __unpack(__tmp, __first, __mid);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n ++__b;\\n }\\n\\n while (true) {\\n if (__b == __buckets.end()) return;\\n if (std::distance(__b->__end, __last) < 0) break;\\n\\n __oper(__b->__data);\\n ++__b;\\n }\\n\\n if (std::distance(__b->__begin, __last) > 0) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __tmp = __pack(__b->__begin, __last);\\n __oper(__tmp);\\n __unpack(__tmp, __b->__begin, __last);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n }\\n }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __i\\n * @param __j\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\\n }\\n};\\n\\n} // namespace workspace\\n#line 7 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n\\nint main() {\\n using namespace workspace;\\n using i64 = int64_t;\\n\\n int n, q;\\n scanf(\\\"%d%d\\\", &n, &q);\\n std::vector<i64> a(n);\\n for (auto&& x : a) {\\n scanf(\\\"%lld\\\", &x);\\n }\\n\\n struct data {\\n i64 min, max, add;\\n std::vector<i64> v;\\n };\\n\\n constexpr auto inf = __INT64_MAX__;\\n\\n buckets b(\\n begin(a), end(a),\\n [](auto l, auto r) {\\n data d;\\n d.add = 0;\\n d.min = inf;\\n d.max = -inf;\\n d.v = std::vector(l, r);\\n sort(d.v.begin(), d.v.end());\\n return d;\\n },\\n [](const auto& d, auto l, auto r) {\\n while (l != r) {\\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\\n ++l;\\n }\\n },\\n 100);\\n\\n for (int t, l, r; q--;) {\\n i64 x, y;\\n scanf(\\\"%d%d%d%lld\\\", &t, &l, &r, &x);\\n --l;\\n\\n switch (--t) {\\n case 0:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.min < c) return;\\n d.min = c;\\n if (d.max > c) d.max = c;\\n });\\n break;\\n\\n case 1:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.max > c) return;\\n d.max = c;\\n if (d.min < c) d.min = c;\\n });\\n break;\\n\\n case 2:\\n b(l, r, [&](auto& d) { d.add += x; });\\n break;\\n\\n case 3:\\n scanf(\\\"%lld\\\", &y);\\n int num = 0;\\n b(l, r, [&](const auto& d) {\\n int sign = 1;\\n for (auto z : {x - 1 - d.add, y - d.add}) {\\n sign *= -1;\\n if (z < d.max) continue;\\n if (z < d.min)\\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\\n d.v.begin());\\n else\\n num += sign * (int)d.v.size();\\n }\\n });\\n printf(\\\"%d\\\\n\\\", num);\\n break;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1090,\n \"memory_kb\": 4196,\n \"score_of_the_acc\": -0.6345,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3170_5454377\",\n \"code_snippet\": \"#line 1 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3170\\\"\\n\\n#include <algorithm>\\n#include <cstdio>\\n\\n#line 2 \\\"src/data_structure/buckets.hpp\\\"\\n\\n/**\\n * @file buckets.hpp\\n * @brief Buckets\\n */\\n\\n#include <cmath>\\n#include <vector>\\n\\nnamespace workspace {\\n\\n/**\\n * @brief Buckets on a sequence.\\n */\\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\\n // Require random access.\\n static_assert(\\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\\n std::random_access_iterator_tag>::value);\\n\\n using difference_type =\\n typename std::iterator_traits<_Iterator>::difference_type;\\n\\n _Iterator __begin, __end;\\n\\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\\n std::declval<_Iterator>()));\\n\\n struct bucket {\\n value_type __data;\\n _Iterator __begin;\\n _Iterator __end;\\n };\\n\\n _Pack __pack;\\n _Unpack __unpack;\\n difference_type __unit;\\n std::vector<bucket> __buckets;\\n\\n void prepare() {\\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\\n\\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\\n __buckets.push_back({__pack(__l, __r), __l, __r});\\n }\\n }\\n\\n public:\\n /**\\n * @brief Constuct a new buckets object.\\n */\\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\\n difference_type __unit = 0)\\n : __begin(__first),\\n __end(__last),\\n __pack(__pack),\\n __unpack(__unpack),\\n __unit(__unit) {\\n prepare();\\n }\\n\\n /**\\n * @brief Number of buckets.\\n */\\n auto size() const { return __buckets.size(); }\\n\\n bool empty() const { return __begin == __end; }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __first\\n * @param __last\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\\n if (__first == __last) return;\\n\\n auto __index = std::distance(__begin, __first);\\n auto __b = std::next(__buckets.begin(), __index / __unit);\\n\\n if (__index % __unit) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\\n\\n auto __tmp = __pack(__first, __mid);\\n __oper(__tmp);\\n __unpack(__tmp, __first, __mid);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n ++__b;\\n }\\n\\n while (true) {\\n if (__b == __buckets.end()) return;\\n if (std::distance(__b->__end, __last) < 0) break;\\n\\n __oper(__b->__data);\\n ++__b;\\n }\\n\\n if (std::distance(__b->__begin, __last) > 0) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __tmp = __pack(__b->__begin, __last);\\n __oper(__tmp);\\n __unpack(__tmp, __b->__begin, __last);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n }\\n }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __i\\n * @param __j\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\\n }\\n};\\n\\n} // namespace workspace\\n#line 7 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n\\nint main() {\\n using namespace workspace;\\n using i64 = int64_t;\\n\\n int n, q;\\n scanf(\\\"%d%d\\\", &n, &q);\\n std::vector<i64> a(n);\\n for (auto&& x : a) {\\n scanf(\\\"%lld\\\", &x);\\n }\\n\\n struct data {\\n i64 min, max, add;\\n std::vector<i64> v;\\n };\\n\\n constexpr auto inf = __INT64_MAX__;\\n\\n buckets b(\\n begin(a), end(a),\\n [](auto l, auto r) {\\n data d;\\n d.add = 0;\\n d.min = inf;\\n d.max = -inf;\\n d.v = std::vector(l, r);\\n sort(d.v.begin(), d.v.end());\\n return d;\\n },\\n [](const auto& d, auto l, auto r) {\\n while (l != r) {\\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\\n ++l;\\n }\\n },\\n 30);\\n\\n for (int t, l, r; q--;) {\\n i64 x, y;\\n scanf(\\\"%d%d%d%lld\\\", &t, &l, &r, &x);\\n --l;\\n\\n switch (--t) {\\n case 0:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.min < c) return;\\n d.min = c;\\n if (d.max > c) d.max = c;\\n });\\n break;\\n\\n case 1:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.max > c) return;\\n d.max = c;\\n if (d.min < c) d.min = c;\\n });\\n break;\\n\\n case 2:\\n b(l, r, [&](auto& d) { d.add += x; });\\n break;\\n\\n case 3:\\n scanf(\\\"%lld\\\", &y);\\n int num = 0;\\n b(l, r, [&](const auto& d) {\\n int sign = 1;\\n for (auto z : {x - 1 - d.add, y - d.add}) {\\n sign *= -1;\\n if (z < d.max) continue;\\n if (z < d.min)\\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\\n d.v.begin());\\n else\\n num += sign * (int)d.v.size();\\n }\\n });\\n printf(\\\"%d\\\\n\\\", num);\\n break;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1210,\n \"memory_kb\": 4404,\n \"score_of_the_acc\": -0.7393,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3170_5454376\",\n \"code_snippet\": \"#line 1 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3170\\\"\\n\\n#include <algorithm>\\n#include <cstdio>\\n\\n#line 2 \\\"src/data_structure/buckets.hpp\\\"\\n\\n/**\\n * @file buckets.hpp\\n * @brief Buckets\\n */\\n\\n#include <cmath>\\n#include <vector>\\n\\nnamespace workspace {\\n\\n/**\\n * @brief Buckets on a sequence.\\n */\\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\\n // Require random access.\\n static_assert(\\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\\n std::random_access_iterator_tag>::value);\\n\\n using difference_type =\\n typename std::iterator_traits<_Iterator>::difference_type;\\n\\n _Iterator __begin, __end;\\n\\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\\n std::declval<_Iterator>()));\\n\\n struct bucket {\\n value_type __data;\\n _Iterator __begin;\\n _Iterator __end;\\n };\\n\\n _Pack __pack;\\n _Unpack __unpack;\\n difference_type __unit;\\n std::vector<bucket> __buckets;\\n\\n void prepare() {\\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\\n\\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\\n __buckets.push_back({__pack(__l, __r), __l, __r});\\n }\\n }\\n\\n public:\\n /**\\n * @brief Constuct a new buckets object.\\n */\\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\\n difference_type __unit = 0)\\n : __begin(__first),\\n __end(__last),\\n __pack(__pack),\\n __unpack(__unpack),\\n __unit(__unit) {\\n prepare();\\n }\\n\\n /**\\n * @brief Number of buckets.\\n */\\n auto size() const { return __buckets.size(); }\\n\\n bool empty() const { return __begin == __end; }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __first\\n * @param __last\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\\n if (__first == __last) return;\\n\\n auto __index = std::distance(__begin, __first);\\n auto __b = std::next(__buckets.begin(), __index / __unit);\\n\\n if (__index % __unit) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\\n\\n auto __tmp = __pack(__first, __mid);\\n __oper(__tmp);\\n __unpack(__tmp, __first, __mid);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n ++__b;\\n }\\n\\n while (true) {\\n if (__b == __buckets.end()) return;\\n if (std::distance(__b->__end, __last) < 0) break;\\n\\n __oper(__b->__data);\\n ++__b;\\n }\\n\\n if (std::distance(__b->__begin, __last) > 0) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __tmp = __pack(__b->__begin, __last);\\n __oper(__tmp);\\n __unpack(__tmp, __b->__begin, __last);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n }\\n }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __i\\n * @param __j\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\\n }\\n};\\n\\n} // namespace workspace\\n#line 7 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n\\nint main() {\\n using namespace workspace;\\n using i64 = int64_t;\\n\\n int n, q;\\n scanf(\\\"%d%d\\\", &n, &q);\\n std::vector<i64> a(n);\\n for (auto&& x : a) {\\n scanf(\\\"%lld\\\", &x);\\n }\\n\\n struct data {\\n i64 min, max, add;\\n std::vector<i64> v;\\n };\\n\\n constexpr auto inf = __INT64_MAX__;\\n\\n buckets b(\\n begin(a), end(a),\\n [](auto l, auto r) {\\n data d;\\n d.add = 0;\\n d.min = inf;\\n d.max = -inf;\\n d.v = std::vector(l, r);\\n sort(d.v.begin(), d.v.end());\\n return d;\\n },\\n [](const auto& d, auto l, auto r) {\\n while (l != r) {\\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\\n ++l;\\n }\\n },\\n 50);\\n\\n for (int t, l, r; q--;) {\\n i64 x, y;\\n scanf(\\\"%d%d%d%lld\\\", &t, &l, &r, &x);\\n --l;\\n\\n switch (--t) {\\n case 0:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.min < c) return;\\n d.min = c;\\n if (d.max > c) d.max = c;\\n });\\n break;\\n\\n case 1:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.max > c) return;\\n d.max = c;\\n if (d.min < c) d.min = c;\\n });\\n break;\\n\\n case 2:\\n b(l, r, [&](auto& d) { d.add += x; });\\n break;\\n\\n case 3:\\n scanf(\\\"%lld\\\", &y);\\n int num = 0;\\n b(l, r, [&](const auto& d) {\\n int sign = 1;\\n for (auto z : {x - 1 - d.add, y - d.add}) {\\n sign *= -1;\\n if (z < d.max) continue;\\n if (z < d.min)\\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\\n d.v.begin());\\n else\\n num += sign * (int)d.v.size();\\n }\\n });\\n printf(\\\"%d\\\\n\\\", num);\\n break;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 990,\n \"memory_kb\": 4384,\n \"score_of_the_acc\": -0.5938,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3170_5454371\",\n \"code_snippet\": \"#line 1 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3170\\\"\\n\\n#include <algorithm>\\n#include <cstdio>\\n\\n#line 2 \\\"src/data_structure/buckets.hpp\\\"\\n\\n/**\\n * @file buckets.hpp\\n * @brief Buckets\\n */\\n\\n#include <cmath>\\n#include <vector>\\n\\nnamespace workspace {\\n\\n/**\\n * @brief Buckets on a sequence.\\n */\\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\\n // Require random access.\\n static_assert(\\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\\n std::random_access_iterator_tag>::value);\\n\\n using difference_type =\\n typename std::iterator_traits<_Iterator>::difference_type;\\n\\n _Iterator __begin, __end;\\n\\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\\n std::declval<_Iterator>()));\\n\\n struct bucket {\\n value_type __data;\\n _Iterator __begin;\\n _Iterator __end;\\n };\\n\\n _Pack __pack;\\n _Unpack __unpack;\\n difference_type __unit;\\n std::vector<bucket> __buckets;\\n\\n void prepare() {\\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\\n\\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\\n __buckets.push_back({__pack(__l, __r), __l, __r});\\n }\\n }\\n\\n public:\\n /**\\n * @brief Constuct a new buckets object.\\n */\\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\\n difference_type __unit = 0)\\n : __begin(__first),\\n __end(__last),\\n __pack(__pack),\\n __unpack(__unpack),\\n __unit(__unit) {\\n prepare();\\n }\\n\\n /**\\n * @brief Number of buckets.\\n */\\n auto size() const { return __buckets.size(); }\\n\\n bool empty() const { return __begin == __end; }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __first\\n * @param __last\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\\n if (__first == __last) return;\\n\\n auto __index = std::distance(__begin, __first);\\n auto __b = std::next(__buckets.begin(), __index / __unit);\\n\\n if (__index % __unit) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\\n\\n auto __tmp = __pack(__first, __mid);\\n __oper(__tmp);\\n __unpack(__tmp, __first, __mid);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n ++__b;\\n }\\n\\n while (true) {\\n if (__b == __buckets.end()) return;\\n if (std::distance(__b->__end, __last) < 0) break;\\n\\n __oper(__b->__data);\\n ++__b;\\n }\\n\\n if (std::distance(__b->__begin, __last) > 0) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __tmp = __pack(__b->__begin, __last);\\n __oper(__tmp);\\n __unpack(__tmp, __b->__begin, __last);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n }\\n }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __i\\n * @param __j\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\\n }\\n};\\n\\n} // namespace workspace\\n#line 7 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n\\nint main() {\\n using namespace workspace;\\n using i64 = int64_t;\\n\\n int n, q;\\n scanf(\\\"%d%d\\\", &n, &q);\\n std::vector<i64> a(n);\\n for (auto&& x : a) {\\n scanf(\\\"%lld\\\", &x);\\n }\\n\\n struct data {\\n i64 min, max, add;\\n std::vector<i64> v;\\n };\\n\\n constexpr auto inf = __INT64_MAX__;\\n\\n buckets b(\\n begin(a), end(a),\\n [](auto l, auto r) {\\n data d;\\n d.add = 0;\\n d.min = inf;\\n d.max = -inf;\\n d.v = std::vector(l, r);\\n sort(d.v.begin(), d.v.end());\\n return d;\\n },\\n [](const auto& d, auto l, auto r) {\\n while (l != r) {\\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\\n ++l;\\n }\\n },\\n 150);\\n\\n for (int t, l, r; q--;) {\\n i64 x, y;\\n scanf(\\\"%d%d%d%lld\\\", &t, &l, &r, &x);\\n --l;\\n\\n switch (--t) {\\n case 0:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.min < c) return;\\n d.min = c;\\n if (d.max > c) d.max = c;\\n });\\n break;\\n\\n case 1:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.max > c) return;\\n d.max = c;\\n if (d.min < c) d.min = c;\\n });\\n break;\\n\\n case 2:\\n b(l, r, [&](auto& d) { d.add += x; });\\n break;\\n\\n case 3:\\n scanf(\\\"%lld\\\", &y);\\n int num = 0;\\n b(l, r, [&](const auto& d) {\\n int sign = 1;\\n for (auto z : {x - 1 - d.add, y - d.add}) {\\n sign *= -1;\\n if (z < d.max) continue;\\n if (z < d.min)\\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\\n d.v.begin());\\n else\\n num += sign * (int)d.v.size();\\n }\\n });\\n printf(\\\"%d\\\\n\\\", num);\\n break;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1350,\n \"memory_kb\": 4196,\n \"score_of_the_acc\": -0.8033,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3170_5454366\",\n \"code_snippet\": \"#line 1 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3170\\\"\\n\\n#include <algorithm>\\n#include <cstdio>\\n\\n#line 2 \\\"src/data_structure/buckets.hpp\\\"\\n\\n/**\\n * @file buckets.hpp\\n * @brief Buckets\\n */\\n\\n#include <cmath>\\n#include <vector>\\n\\nnamespace workspace {\\n\\n/**\\n * @brief Buckets on a sequence.\\n */\\ntemplate <class _Iterator, class _Pack, class _Unpack> struct buckets {\\n // Require random access.\\n static_assert(\\n std::is_same<typename std::iterator_traits<_Iterator>::iterator_category,\\n std::random_access_iterator_tag>::value);\\n\\n using difference_type =\\n typename std::iterator_traits<_Iterator>::difference_type;\\n\\n _Iterator __begin, __end;\\n\\n using value_type = decltype(std::declval<_Pack>()(std::declval<_Iterator>(),\\n std::declval<_Iterator>()));\\n\\n struct bucket {\\n value_type __data;\\n _Iterator __begin;\\n _Iterator __end;\\n };\\n\\n _Pack __pack;\\n _Unpack __unpack;\\n difference_type __unit;\\n std::vector<bucket> __buckets;\\n\\n void prepare() {\\n if (!__unit) __unit = round(sqrt(std::distance(__begin, __end)));\\n\\n for (auto __l = __begin, __r = __l; __r != __end; __l = __r) {\\n for (auto __n = __unit; __r != __end && __n; --__n) ++__r;\\n __buckets.push_back({__pack(__l, __r), __l, __r});\\n }\\n }\\n\\n public:\\n /**\\n * @brief Constuct a new buckets object.\\n */\\n buckets(_Iterator __first, _Iterator __last, _Pack __pack, _Unpack __unpack,\\n difference_type __unit = 0)\\n : __begin(__first),\\n __end(__last),\\n __pack(__pack),\\n __unpack(__unpack),\\n __unit(__unit) {\\n prepare();\\n }\\n\\n /**\\n * @brief Number of buckets.\\n */\\n auto size() const { return __buckets.size(); }\\n\\n bool empty() const { return __begin == __end; }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __first\\n * @param __last\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(_Iterator __first, _Iterator __last, _Operator __oper) {\\n if (__first == __last) return;\\n\\n auto __index = std::distance(__begin, __first);\\n auto __b = std::next(__buckets.begin(), __index / __unit);\\n\\n if (__index % __unit) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __mid = std::distance(__last, __b->__end) > 0 ? __last : __b->__end;\\n\\n auto __tmp = __pack(__first, __mid);\\n __oper(__tmp);\\n __unpack(__tmp, __first, __mid);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n ++__b;\\n }\\n\\n while (true) {\\n if (__b == __buckets.end()) return;\\n if (std::distance(__b->__end, __last) < 0) break;\\n\\n __oper(__b->__data);\\n ++__b;\\n }\\n\\n if (std::distance(__b->__begin, __last) > 0) {\\n __unpack(__b->__data, __b->__begin, __b->__end);\\n\\n auto __tmp = __pack(__b->__begin, __last);\\n __oper(__tmp);\\n __unpack(__tmp, __b->__begin, __last);\\n\\n __b->__data = __pack(__b->__begin, __b->__end);\\n }\\n }\\n\\n /**\\n * @brief Operate on a subsegment.\\n *\\n * @param __i\\n * @param __j\\n * @param __oper\\n */\\n template <class _Operator>\\n void operator()(difference_type __i, difference_type __j, _Operator __oper) {\\n operator()(std::next(__begin, __i), std::next(__begin, __j), __oper);\\n }\\n};\\n\\n} // namespace workspace\\n#line 7 \\\"test/aizu-online-judge/3170.test.cpp\\\"\\n\\nint main() {\\n using namespace workspace;\\n using i64 = int64_t;\\n\\n int n, q;\\n scanf(\\\"%d%d\\\", &n, &q);\\n std::vector<i64> a(n);\\n for (auto&& x : a) {\\n scanf(\\\"%lld\\\", &x);\\n }\\n\\n struct data {\\n i64 min, max, add;\\n std::vector<i64> v;\\n };\\n\\n constexpr auto inf = __INT64_MAX__;\\n\\n buckets b(\\n begin(a), end(a),\\n [](auto l, auto r) {\\n data d;\\n d.add = 0;\\n d.min = inf;\\n d.max = -inf;\\n d.v = std::vector(l, r);\\n sort(d.v.begin(), d.v.end());\\n return d;\\n },\\n [](const auto& d, auto l, auto r) {\\n while (l != r) {\\n *l = std::min(d.min, std::max(d.max, *l)) + d.add;\\n ++l;\\n }\\n },\\n 200);\\n\\n for (int t, l, r; q--;) {\\n i64 x, y;\\n scanf(\\\"%d%d%d%lld\\\", &t, &l, &r, &x);\\n --l;\\n\\n switch (--t) {\\n case 0:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.min < c) return;\\n d.min = c;\\n if (d.max > c) d.max = c;\\n });\\n break;\\n\\n case 1:\\n b(l, r, [&](auto& d) {\\n auto c = x - d.add;\\n if (d.max > c) return;\\n d.max = c;\\n if (d.min < c) d.min = c;\\n });\\n break;\\n\\n case 2:\\n b(l, r, [&](auto& d) { d.add += x; });\\n break;\\n\\n case 3:\\n scanf(\\\"%lld\\\", &y);\\n int num = 0;\\n b(l, r, [&](const auto& d) {\\n int sign = 1;\\n for (auto z : {x - 1 - d.add, y - d.add}) {\\n sign *= -1;\\n if (z < d.max) continue;\\n if (z < d.min)\\n num += sign * (std::upper_bound(d.v.begin(), d.v.end(), z) -\\n d.v.begin());\\n else\\n num += sign * (int)d.v.size();\\n }\\n });\\n printf(\\\"%d\\\\n\\\", num);\\n break;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1660,\n \"memory_kb\": 4432,\n \"score_of_the_acc\": -1.0351,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3170_5383506\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <iostream>\\n#include <iomanip>\\n#include <fstream>\\n#include <algorithm>\\n#include <set>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <stack>\\n#include <climits>\\n#include <array>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <memory>\\n#include <functional>\\n#include <cfloat>\\n#include <numeric>\\n#include <random>\\n#include <sstream>\\n#include <bitset>\\n#include <complex>\\n#include <chrono>\\n#include <cassert>\\nclass SqrtSegment {\\n\\tint sqrt;\\n\\tstd::vector<std::vector<std::pair<long long int, int>>> segments;\\n\\tstd::vector<long long int> min, max, add;\\n\\tvoid change_min_partial(const int from, const int until, const long long int x) {\\n\\t\\tconst auto added = add[from / sqrt];\\n\\t\\tconst auto upper_limit = min[from / sqrt];\\n\\t\\tconst auto lower_limit = max[from / sqrt];\\n\\t\\tfor (auto& [value, pos] : segments[from / sqrt]) {\\n\\t\\t\\tvalue = std::min(upper_limit, std::max(lower_limit, value));\\n\\t\\t\\tvalue += added;\\n\\t\\t\\tif (pos < from || until <= pos) continue;\\n\\t\\t\\tvalue = std::min(value, x);\\n\\t\\t}\\n\\t\\tstd::sort(segments[from / sqrt].begin(), segments[from / sqrt].end());\\n\\t\\tadd[from / sqrt] = 0;\\n\\t\\tmin[from / sqrt] = LLONG_MAX;\\n\\t\\tmax[from / sqrt] = LLONG_MIN;\\n\\t}\\n\\tvoid change_max_partial(const int from, const int until, const long long int x) {\\n\\t\\tconst auto added = add[from / sqrt];\\n\\t\\tconst auto upper_limit = min[from / sqrt];\\n\\t\\tconst auto lower_limit = max[from / sqrt];\\n\\t\\tfor (auto& [value, pos] : segments[from / sqrt]) {\\n\\t\\t\\tvalue = std::min(upper_limit, std::max(lower_limit, value));\\n\\t\\t\\tvalue += added;\\n\\t\\t\\tif (pos < from || until <= pos) continue;\\n\\t\\t\\tvalue = std::max(value, x);\\n\\t\\t}\\n\\t\\tstd::sort(segments[from / sqrt].begin(), segments[from / sqrt].end());\\n\\t\\tadd[from / sqrt] = 0;\\n\\t\\tmin[from / sqrt] = LLONG_MAX;\\n\\t\\tmax[from / sqrt] = LLONG_MIN;\\n\\t}\\n\\tvoid change_add_partial(const int from, const int until, const long long int x) {\\n\\t\\tconst auto added = add[from / sqrt];\\n\\t\\tconst auto upper_limit = min[from / sqrt];\\n\\t\\tconst auto lower_limit = max[from / sqrt];\\n\\t\\tfor (auto& [value, pos] : segments[from / sqrt]) {\\n\\t\\t\\tvalue = std::min(upper_limit, std::max(lower_limit, value));\\n\\t\\t\\tvalue += added;\\n\\t\\t\\tif (pos < from || until <= pos) continue;\\n\\t\\t\\tvalue += x;\\n\\t\\t}\\n\\t\\tstd::sort(segments[from / sqrt].begin(), segments[from / sqrt].end());\\n\\t\\tadd[from / sqrt] = 0;\\n\\t\\tmin[from / sqrt] = LLONG_MAX;\\n\\t\\tmax[from / sqrt] = LLONG_MIN;\\n\\t}\\n\\tvoid change_min_segment(const int segment, const long long int x) {\\n\\t\\tmin[segment] = std::min(min[segment], x - add[segment]);\\n\\t}\\n\\tvoid change_max_segment(const int segment, const long long int x) {\\n\\t\\tmax[segment] = std::max(max[segment], x - add[segment]);\\n\\t}\\n\\tvoid change_add_segment(const int segment, const long long int x) {\\n\\t\\tadd[segment] += x;\\n\\t}\\n\\tint count_partial(const int from, const int until, const long long int lower, const long long int upper) {\\n\\t\\tint result{ 0 };\\n\\t\\tconst auto added = add[from / sqrt];\\n\\t\\tconst auto upper_limit = min[from / sqrt];\\n\\t\\tconst auto lower_limit = max[from / sqrt];\\n\\t\\tfor (auto& [value, pos] : segments[from / sqrt]) {\\n\\t\\t\\tvalue = std::min(upper_limit, std::max(lower_limit, value));\\n\\t\\t\\tvalue += added;\\n\\t\\t\\tif (pos < from || until <= pos) continue;\\n\\t\\t\\tif (lower <= value && value <= upper) ++result;\\n\\t\\t}\\n\\t\\tadd[from / sqrt] = 0;\\n\\t\\tmin[from / sqrt] = LLONG_MAX;\\n\\t\\tmax[from / sqrt] = LLONG_MIN;\\n\\t\\treturn result;\\n\\t}\\n\\tint count_segment(const int segment, const long long int lower, const long long int upper) {\\n\\t\\tconst auto upper_limit = std::min(upper - add[segment], min[segment]);\\n\\t\\tconst auto lower_limit = std::max(lower - add[segment], max[segment]);\\n\\t\\treturn std::distance(std::lower_bound(segments[segment].begin(), segments[segment].end(), std::make_pair(lower_limit, -1)), std::upper_bound(segments[segment].begin(), segments[segment].end(), std::make_pair(upper_limit, INT_MAX)));\\n\\t}\\n\\npublic:\\n\\tSqrtSegment(const std::vector<int>& initial) : sqrt{ (int)std::ceil(std::sqrt(initial.size() * std::log2(initial.size()))) }, segments((initial.size() + sqrt - 1) / sqrt), min(segments.size(), LLONG_MAX), max(segments.size(), LLONG_MIN), add(segments.size(), 0) {\\n\\t\\tfor (auto i = 0; i < segments.size(); ++i) {\\n\\t\\t\\tconst auto offset = i * sqrt;\\n\\t\\t\\tfor (auto j = 0; j < sqrt; ++j) {\\n\\t\\t\\t\\tif (offset + j >= initial.size()) break;\\n\\t\\t\\t\\tsegments[i].emplace_back(initial[offset + j], offset + j);\\n\\t\\t\\t}\\n\\t\\t\\tstd::sort(segments[i].begin(), segments[i].end());\\n\\t\\t}\\n\\t}\\n\\tstd::vector<long long int> show_value() const {\\n\\t\\tstd::vector<std::pair<long long int, int>> values;\\n\\t\\tfor (auto i = 0; i < segments.size(); ++i) {\\n\\t\\t\\tconst auto added = add[i];\\n\\t\\t\\tconst auto upper_limit = min[i];\\n\\t\\t\\tconst auto lower_limit = max[i];\\n\\t\\t\\tfor (const auto [value, pos]: segments[i]) {\\n\\t\\t\\t\\tvalues.emplace_back(std::max(lower_limit, std::min(upper_limit, value)) + added, pos);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstd::vector<long long int >result(values.size());\\n\\t\\tfor (const auto [value, pos] : values) {\\n\\t\\t\\tresult[pos] = value;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\tvoid change_min(const int left, const int right, const int x) {\\n\\t\\tconst auto from = (left + sqrt - 1) / sqrt;\\n\\t\\tconst auto until = right / sqrt;\\n\\t\\tif (from > until) {\\n\\t\\t\\treturn change_min_partial(left, right + 1, x);\\n\\t\\t}\\n\\t\\tchange_min_partial(left, from * sqrt, x);\\n\\t\\tfor (auto i = from; i < until; ++i) {\\n\\t\\t\\tchange_min_segment(i, x);\\n\\t\\t}\\n\\t\\tchange_min_partial(until * sqrt, right + 1, x);\\n\\t}\\n\\tvoid change_max(const int left, const int right, const int x) {\\n\\t\\tconst auto from = (left + sqrt - 1) / sqrt;\\n\\t\\tconst auto until = right / sqrt;\\n\\t\\tif (from > until) {\\n\\t\\t\\treturn change_max_partial(left, right + 1, x);\\n\\t\\t}\\n\\t\\tchange_max_partial(left, from * sqrt, x);\\n\\t\\tfor (auto i = from; i < until; ++i) {\\n\\t\\t\\tchange_max_segment(i, x);\\n\\t\\t}\\n\\t\\tchange_max_partial(until * sqrt, right + 1, x);\\n\\t}\\n\\tvoid change_add(const int left, const int right, const int x) {\\n\\t\\tconst auto from = (left + sqrt - 1) / sqrt;\\n\\t\\tconst auto until = right / sqrt;\\n\\t\\tif (from > until) {\\n\\t\\t\\treturn change_add_partial(left, right + 1, x);\\n\\t\\t}\\n\\t\\tchange_add_partial(left, from * sqrt, x);\\n\\t\\tfor (auto i = from; i < until; ++i) {\\n\\t\\t\\tchange_add_segment(i, x);\\n\\t\\t}\\n\\t\\tchange_add_partial(until * sqrt, right + 1, x);\\n\\t}\\n\\tint count(const int left, const int right, const long long int x, const long long int y) {\\n\\t\\tconst auto from = (left + sqrt - 1) / sqrt;\\n\\t\\tconst auto until = right / sqrt;\\n\\t\\tif (from > until) {\\n\\t\\t\\treturn count_partial(left, right + 1, x, y);\\n\\t\\t}\\n\\t\\tlong long int result{ count_partial(left, from * sqrt, x, y) };\\n\\t\\tfor (auto i = from; i < until; ++i) {\\n\\t\\t\\tresult += count_segment(i, x, y);\\n\\t\\t}\\n\\t\\tresult += count_partial(until * sqrt, right + 1, x, y);\\n\\t\\treturn result;\\n\\t}\\n};\\n\\nint main() {\\n\\tstd::cin.tie(nullptr); std::cin.sync_with_stdio(false);\\n\\tint n, q; std::cin >> n >> q;\\n\\tstd::vector<int> initial(n);\\n\\tfor (auto& a : initial) std::cin >> a;\\n\\tSqrtSegment seg(initial);\\n\\tfor (auto i = 0; i < q; ++i) {\\n\\t\\tint type; std::cin >> type;\\n\\t\\tif (type == 1) {\\n\\t\\t\\tint l, r, x; std::cin >> l >> r >> x; --l; --r;\\n\\t\\t\\tseg.change_min(l, r, x);\\n\\t\\t}\\n\\t\\telse if (type == 2) {\\n\\t\\t\\tint l, r, x; std::cin >> l >> r >> x; --l; --r;\\n\\t\\t\\tseg.change_max(l, r, x);\\n\\t\\t}\\n\\t\\telse if (type == 3) {\\n\\t\\t\\tint l, r, x; std::cin >> l >> r >> x; --l; --r;\\n\\t\\t\\tseg.change_add(l, r, x);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint l, r; long long int x, y; std::cin >> l >> r >> x >> y; --l; --r;\\n\\t\\t\\tstd::cout << seg.count(l, r, x, y) << '\\\\n';\\n\\t\\t}\\n\\t}\\n}\\n\\n\\n/*\\nhttps://onlinejudge.u-aizu.ac.jp/challenges/sources/VPC/HUPC/3170\\n\\n\\n\\n\\n.*/\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 900,\n \"memory_kb\": 5164,\n \"score_of_the_acc\": -0.6361,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3170_5199970\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n__attribute__((constructor))\\nvoid fast_io() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n}\\n\\ntemplate<class S,\\n class F,\\n S (*mapping)(F, S),\\n F (*composition)(F, F),\\n F (*id)(),\\n class I,\\n I (*precalculate)(const vector<S>&),\\n class P,\\n P (*op)(P, P),\\n P (*e)()>\\nclass sqrt_decomposition {\\n using Calc_from_S = function<P(S)>;\\n using Calc_from_I = function<P(const I&, F, int, int)>;\\n \\n class bucket {\\n int l, r;\\n vector<S> vs;\\n F lazy_f;\\n I info;\\n\\n void reflect_apply() {\\n if (lazy_f == id()) return;\\n for_each(vs.begin(), vs.end(), [&](S& v) { v = mapping(lazy_f, v); });\\n lazy_f = id();\\n }\\n\\n void reflect_prod() {\\n info = precalculate(vs);\\n }\\n\\n void partial_apply(int l, int r, F f) {\\n reflect_apply();\\n for_each(vs.begin() + l, vs.begin() + r, [&](S& v) { v = mapping(f, v); });\\n reflect_prod();\\n }\\n\\n void all_apply(F f) {\\n lazy_f = composition(f, lazy_f);\\n }\\n\\n P partial_prod(int l, int r, const Calc_from_S& cs) {\\n reflect_apply();\\n reflect_prod();\\n P res = e();\\n for_each(vs.begin() + l, vs.begin() + r, [&](S& v) { res = op(res, cs(v)); });\\n return res;\\n }\\n\\n P all_prod(const Calc_from_I& ci) {\\n return ci(info, lazy_f, l, r);\\n }\\n \\n public:\\n bucket(const vector<S>& a, int l, int r)\\n : l(l), r(r), vs(a.begin() + l, a.begin() + r), lazy_f(id()) { reflect_prod(); }\\n\\n void apply(int s, int t, F f) {\\n if (t <= l || r <= s) return;\\n if (s <= l && r <= t) {\\n all_apply(f);\\n } else {\\n partial_apply(max(l, s) - l, min(r, t) - l, f);\\n }\\n }\\n\\n P prod(int s, int t, const Calc_from_S& cs, const Calc_from_I& ci) {\\n if (t <= l || r <= s) return e();\\n if (s <= l && r <= t) {\\n return all_prod(ci);\\n } else {\\n return partial_prod(max(l, s) - l, min(r, t) - l, cs);\\n }\\n }\\n };\\n\\n vector<bucket> bs;\\n\\npublic:\\n sqrt_decomposition(const vector<S>& a, int bucket_size) {\\n for (int i = 0; i < (int)a.size(); i += bucket_size) {\\n bs.emplace_back(a, i, min(i + bucket_size, (int)a.size()));\\n }\\n }\\n\\n void apply(int l, int r, F f) {\\n for_each(bs.begin(), bs.end(), [&](bucket& b) { b.apply(l, r, f); });\\n }\\n\\n P prod(int l, int r, const Calc_from_S& cs, const Calc_from_I& ci) {\\n P res = e();\\n for_each(bs.begin(), bs.end(), [&](bucket& b) { res = op(res, b.prod(l, r, cs, ci)); });\\n return res;\\n }\\n};\\n\\nusing S = long long;\\nusing F = tuple<long long, long long, long long>;\\nS mapping(F f, S x) {\\n auto [chmin, chmax, add] = f;\\n x = min(x, chmin);\\n x = max(x, chmax);\\n x += add;\\n return x;\\n}\\nF composition(F f, F g) {\\n auto [fchmin, fchmax, fadd] = f;\\n auto [gchmin, gchmax, gadd] = g;\\n long long chmin = min(gchmin, fchmin - gadd);\\n long long chmax = max(min(gchmax, fchmin - gadd), fchmax - gadd);\\n long long add = gadd + fadd;\\n return {chmin, chmax, add};\\n}\\nF id() { return {LLONG_MAX / 2, LLONG_MIN / 2, 0}; }\\nusing I = vector<long long>;\\nI precalculate(const vector<S>& vs) {\\n I res = vs;\\n sort(res.begin(), res.end());\\n return res;\\n}\\nusing P = int;\\nP op(P a, P b) { return a + b; }\\nP e() { return 0; }\\n\\nint main() {\\n int n, q;\\n cin >> n >> q;\\n vector<S> a(n);\\n for (auto& ai : a) cin >> ai;\\n sqrt_decomposition<S, F, mapping, composition, id, I, precalculate, P, op, e> sqd(a, 128);\\n\\n while (q--) {\\n int com, l, r;\\n long long x, y;\\n cin >> com >> l >> r >> x;\\n l--;\\n if (com == 4) {\\n cin >> y;\\n auto cs = [&](S s) { return x <= s && s <= y; };\\n auto ci = [&](const I& info, F f, int l, int r) {\\n auto [chmin, chmax, add] = f;\\n auto calc = [&](long long ub) {\\n if (chmax > ub - add) return 0;\\n if (chmin <= ub - add) return r - l;\\n return (int)distance(info.begin(), upper_bound(info.begin(), info.end(), ub - add));\\n };\\n return calc(y) - calc(x - 1);\\n };\\n cout << sqd.prod(l, r, cs, ci) << '\\\\n';\\n } else {\\n F f = id();\\n auto& [chmin, chmax, add] = f;\\n if (com == 1) chmin = x;\\n if (com == 2) chmax = x;\\n if (com == 3) add = x;\\n sqd.apply(l, r, f);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1140,\n \"memory_kb\": 5648,\n \"score_of_the_acc\": -0.8544,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3170_5199942\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n__attribute__((constructor))\\nvoid fast_io() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n}\\n\\ntemplate<class S,\\n class F,\\n S (*mapping)(F, S),\\n F (*composition)(F, F),\\n F (*id)(),\\n class I,\\n I (*precalculate)(const vector<S>&),\\n class P,\\n P (*op)(P, P),\\n P (*e)()>\\nclass sqrt_decomposition {\\n using Calc_from_S = function<P(S)>;\\n using Calc_from_I = function<P(const I&, const F&, int, int)>;\\n \\n class bucket {\\n int l, r;\\n vector<S> vs;\\n F lazy_f;\\n I info;\\n\\n void reflect_apply() {\\n if (lazy_f == id()) return;\\n for_each(vs.begin(), vs.end(), [&](S& v) { v = mapping(lazy_f, v); });\\n lazy_f = id();\\n }\\n\\n void reflect_prod() {\\n info = precalculate(vs);\\n }\\n\\n void partial_apply(int l, int r, const F& f) {\\n reflect_apply();\\n for_each(vs.begin() + l, vs.begin() + r, [&](S& v) { v = mapping(f, v); });\\n reflect_prod();\\n }\\n\\n void all_apply(const F& f) {\\n lazy_f = composition(f, lazy_f);\\n }\\n\\n P partial_prod(int l, int r, const Calc_from_S& cs) {\\n reflect_apply();\\n reflect_prod();\\n P res = e();\\n for_each(vs.begin() + l, vs.begin() + r, [&](S& v) { res = op(res, cs(v)); });\\n return res;\\n }\\n\\n P all_prod(const Calc_from_I& ci) {\\n return ci(info, lazy_f, l, r);\\n }\\n \\n public:\\n bucket(const vector<S>& a, int l, int r)\\n : l(l), r(r), vs(a.begin() + l, a.begin() + r), lazy_f(id()) { reflect_prod(); }\\n\\n void apply(int s, int t, const F& f) {\\n if (t <= l || r <= s) return;\\n if (s <= l && r <= t) {\\n all_apply(f);\\n } else {\\n partial_apply(max(l, s) - l, min(r, t) - l, f);\\n }\\n }\\n\\n P prod(int s, int t, const Calc_from_S& cs, const Calc_from_I& ci) {\\n if (t <= l || r <= s) return e();\\n if (s <= l && r <= t) {\\n return all_prod(ci);\\n } else {\\n return partial_prod(max(l, s) - l, min(r, t) - l, cs);\\n }\\n }\\n };\\n\\n vector<bucket> bs;\\n\\npublic:\\n sqrt_decomposition(const vector<S>& a, int bucket_size) {\\n for (int i = 0; i < (int)a.size(); i += bucket_size) {\\n bs.emplace_back(a, i, min(i + bucket_size, (int)a.size()));\\n }\\n }\\n\\n void apply(int l, int r, const F& f) {\\n for_each(bs.begin(), bs.end(), [&](bucket& b) { b.apply(l, r, f); });\\n }\\n\\n P prod(int l, int r, const Calc_from_S& cs, const Calc_from_I& ci) {\\n P res = e();\\n for_each(bs.begin(), bs.end(), [&](bucket& b) { res = op(res, b.prod(l, r, cs, ci)); });\\n return res;\\n }\\n};\\n\\nusing S = long long;\\nusing F = tuple<long long, long long, long long>;\\nS mapping(F f, S x) {\\n auto [chmin, chmax, add] = f;\\n x = min(x, chmin);\\n x = max(x, chmax);\\n x += add;\\n return x;\\n}\\nF composition(F f, F g) {\\n auto [fchmin, fchmax, fadd] = f;\\n auto [gchmin, gchmax, gadd] = g;\\n long long chmin = min(gchmin, fchmin - gadd);\\n long long chmax = max(min(gchmax, fchmin - gadd), fchmax - gadd);\\n long long add = gadd + fadd;\\n return {chmin, chmax, add};\\n}\\nF id() { return {LLONG_MAX / 10, LLONG_MIN / 10, 0}; }\\nusing I = vector<long long>;\\nI precalculate(const vector<S>& vs) {\\n I res = vs;\\n sort(res.begin(), res.end());\\n return res;\\n}\\nusing P = int;\\nP op(P a, P b) { return a + b; }\\nP e() { return 0; }\\n\\nint main() {\\n int n, q;\\n cin >> n >> q;\\n vector<S> a(n);\\n for (auto& ai : a) cin >> ai;\\n sqrt_decomposition<S, F, mapping, composition, id, I, precalculate, P, op, e> sqd(a, 256);\\n\\n while (q--) {\\n int com, l, r;\\n long long x, y;\\n cin >> com >> l >> r >> x;\\n l--;\\n if (com == 4) {\\n cin >> y;\\n auto cs = [&](S s) { return x <= s && s <= y; };\\n auto ci = [&](const I& info, const F& f, int l, int r) {\\n auto [chmin, chmax, add] = f;\\n auto calc = [&](long long border) {\\n if (chmax > border - add) return 0;\\n if (chmin <= border - add) return r - l;\\n return (int)distance(info.begin(), upper_bound(info.begin(), info.end(), border - add));\\n };\\n return calc(y) - calc(x - 1);\\n };\\n cout << sqd.prod(l, r, cs, ci) << '\\\\n';\\n } else {\\n F f = id();\\n auto& [chmin, chmax, add] = f;\\n if (com == 1) chmin = x;\\n if (com == 2) chmax = x;\\n if (com == 3) add = x;\\n sqd.apply(l, r, f);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1500,\n \"memory_kb\": 5492,\n \"score_of_the_acc\": -1.068,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3170_5141724\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream> // cout, endl, cin\\n#include <string> // string, to_string, stoi\\n#include <vector> // vector\\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\\n#include <utility> // pair, make_pair\\n#include <tuple> // tuple, make_tuple\\n#include <cstdint> // int64_t, int*_t\\n#include <cstdio> // printf\\n#include <map> // map\\n#include <queue> // queue, priority_queue\\n#include <set> // set\\n#include <stack> // stack\\n#include <deque> // deque\\n#include <unordered_map> // unordered_map\\n#include <unordered_set> // unordered_set\\n#include <bitset> // bitset\\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\\n#include <iomanip> // setprecision\\n#include <complex> // complex\\n#include <math.h> \\n#include <cmath>\\n#include <functional>\\n#include <cassert>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll,ll>;\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\n// constexpr ll mod = 1000000007;\\nconstexpr ll mod = 998244353;\\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\nconst char eol = '\\\\n';\\n// --------------------------------------------------------------------------\\n\\nstruct SqrtDecomposition{\\n const int sqrtN = 256;\\n int N,K;\\n vector<ll> data;\\n vector<ll> bucketMin;\\n vector<ll> bucketMax;\\n vector<ll> bucketAdd;\\n vector<vector<ll>> sortedBucket;\\n SqrtDecomposition(vector<ll> A): data(A){\\n N = data.size();\\n K = (N + sqrtN - 1)/sqrtN;\\n bucketMin.assign(K,INF);\\n bucketMax.assign(K,-INF);\\n bucketAdd.assign(K,0);\\n sortedBucket = vector<vector<ll>>(K);\\n for(int k=0; k<K; k++){\\n int l = k * sqrtN;\\n int r = (k+1) * sqrtN;\\n chmin(r,N);\\n for(int j=l; j<r; j++){\\n sortedBucket[k].emplace_back(data[j]);\\n }\\n sort(sortedBucket[k].begin(),sortedBucket[k].end());\\n }\\n }\\n void eval(int k){\\n int l = k * sqrtN;\\n int r = (k+1) * sqrtN;\\n chmin(r,N);\\n for(int i=l; i<r; i++){\\n chmin(data[i],bucketMin[k]);\\n chmax(data[i],bucketMax[k]);\\n data[i] += bucketAdd[k];\\n }\\n bucketAdd[k] = 0;\\n bucketMin[k] = INF;\\n bucketMax[k] = -INF;\\n }\\n // [s,t)\\n void update(int id,int s,int t,ll x){\\n for(int k=0; k<K; k++){\\n int l = k * sqrtN;\\n int r = (k+1) * sqrtN;\\n chmin(r,N);\\n if(r <= s || t <= l) continue;\\n if(s <= l && r <= t){\\n if(id == 1){ // min \\n x -= bucketAdd[k];\\n chmin(bucketMin[k],x);\\n if(bucketMin[k] < bucketMax[k]) bucketMax[k] = bucketMin[k];\\n x += bucketAdd[k];\\n }else if(id == 2){ // max\\n x -= bucketAdd[k];\\n chmax(bucketMax[k],x);\\n if(bucketMin[k] < bucketMax[k]) bucketMin[k] = bucketMax[k];\\n x += bucketAdd[k];\\n }else{ // add\\n bucketAdd[k] += x;\\n }\\n }else{\\n eval(k);\\n for(int i=max(l,s); i<min(r,t); i++){\\n if(id == 1) chmin(data[i],x);\\n else if(id == 2) chmax(data[i],x);\\n else data[i] += x;\\n }\\n vector<ll> temp;\\n for(int i=l; i<r; i++){\\n temp.emplace_back(data[i]);\\n }\\n sort(temp.begin(),temp.end());\\n sortedBucket[k] = temp;\\n }\\n }\\n }\\n\\n // [s,t) [x,y]\\n int query(int s,int t,ll x,ll y){\\n int res = 0;\\n for(int k=0; k<K; k++){\\n int l = k * sqrtN;\\n int r = (k+1) * sqrtN;\\n chmin(r,N);\\n if(r <= s || t <= l) continue;\\n if(s <= l && r <= t){\\n x -= bucketAdd[k];\\n y -= bucketAdd[k];\\n int sz = r - l;\\n // [0,y]\\n int posY = upper_bound(sortedBucket[k].begin(),sortedBucket[k].end(),y) - sortedBucket[k].begin();\\n // [0,x) \\n int posX = lower_bound(sortedBucket[k].begin(),sortedBucket[k].end(),x) - sortedBucket[k].begin();\\n if(x <= bucketMax[k] && bucketMin[k] <= y){\\n res += sz;\\n }else if(x <= bucketMax[k] && bucketMax[k] <= y){\\n res += posY;\\n }else if(x <= bucketMin[k] && bucketMin[k] <= y){\\n res += sz - posX;\\n }else{\\n res += posY - posX;\\n }\\n x += bucketAdd[k];\\n y += bucketAdd[k];\\n }else{\\n eval(k);\\n vector<ll> temp;\\n for(int i=l; i<r; i++){\\n temp.emplace_back(data[i]);\\n }\\n sort(temp.begin(),temp.end());\\n sortedBucket[k] = temp;\\n for(int i=max(l,s); i<min(r,t); i++){\\n if(x <= data[i] && data[i] <= y) res++;\\n }\\n }\\n } \\n return res;\\n }\\n};\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int N,Q;\\n cin >> N >> Q;\\n vector<ll> A(N);\\n for(int i=0; i<N; i++) cin >> A[i];\\n SqrtDecomposition SD(A);\\n vector<int> ans;\\n for(int i=0; i<Q; i++){\\n int id;\\n cin >> id;\\n if(id == 4){\\n int l,r;\\n ll x,y;\\n cin >> l >> r >> x >> y;\\n l--;\\n ans.emplace_back(SD.query(l,r,x,y));\\n }else{\\n int l,r;\\n ll x;\\n cin >> l >> r >> x;\\n l--;\\n SD.update(id,l,r,x);\\n }\\n }\\n for(auto x: ans){\\n cout << x << eol;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 120,\n \"memory_kb\": 6200,\n \"score_of_the_acc\": -0.2633,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1997,"cells":{"group_id":{"kind":"string","value":"aoj_3186_cpp"},"problem_description":{"kind":"string","value":"B: 累積差\n問題\nえびちゃんは最近「るいせきわ」のお勉強をして、数列 $(a_1, a_2, \\dots, a_N)$ およびある整数 $L$, $R$ に対して $a_L+a_{L+1}+\\dots+a_R$ を高速に求められるようになりました。\nここで、和ではなく差を求めることはできないか気になってきたえびちゃんのために、それを高速に処理するプログラムを書いてあげてください。より形式的には、数列 $(a_1, a_2, \\dots, a_N)$ と整数 $L$, $R$ に対して $a_L-a_{L+1}-\\dots-a_R$ を求めてください。\n入力形式\n$N$ $Q$\n$a_1$ $a_2$ ... $a_N$\n$L_1$ $R_1$\n...\n$L_Q$ $R_Q$\n数列の長さ $N$ とクエリの個数 $Q$ が一行目に与えられ、数列 $a_i$ が二行目に与えられる。\n続く $Q$ 行では一行あたり一組の $L$, $R$ が与えられる。\n制約\n$2 \\leq N \\leq 2\\times 10^5$\n$1 \\leq Q \\leq 2\\times 10^5$\n$1 \\leq L_i < R_i \\leq N$ ($1 \\leq i \\leq Q$)\n$1 \\leq a_i \\leq 10^9$ ($1 \\leq i \\leq N$)\n入力は全て整数である\n出力形式\n各クエリ $L$, $R$ に対して $a_L-a_{L+1}-\\dots-a_R$ を一行ずつ出力してください。\n入力例 1\n5 2\n1 4 3 5 2\n1 4\n2 3\n出力例 1\n-11\n1\n$1-4-3-5 = -11$ および $4-3 = 1$ です。\n入力例 2\n8 9\n1 9 2 3 7 3 6 5\n1 5\n5 6\n1 8\n2 5\n4 8\n1 6\n2 4\n3 4\n7 8\n出力例 2\n-20\n4\n-34\n-3\n-18\n-23\n4\n-1\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3186_9652237","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n\nvoid acc() {\n int n, q;\n cin >> n >> q;\n vector<long long > pref(n + 1),v(n+1);\n for (int i = 1; i <= n; i++) {\n cin >>v[i] ;\n }\n for (int i = 1 ; i<=n ; i++){\n pref[i]+=pref[i-1]+v[i] ;\n }\n while (q--) {\n int l, r;\n cin >> l >> r;\n cout <<v[l]-pref[r]+pref[l] <<'\\n';\n }\n\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n acc();\n}","accuracy":1,"time_ms":40,"memory_kb":6212,"score_of_the_acc":-0.5362,"final_rank":6},{"submission_id":"aoj_3186_9552399","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n//make -f ../makefile SRC=\n\n/*\n*/\n//------------------------------------------------------------------------------\nbool DEBUG = false;\n\nconst int MAX_N = 200000;\nstatic int64_t vect[MAX_N];\nstatic int64_t P[MAX_N];\n\n\n//------------------------------------------------------------------------------\nvoid init(int N)\n{ \n P[0] = vect[0];\n for (int i=1; i<N; i++) P[i] = vect[i] + P[i-1];\n if (DEBUG) {printf(\"vect: \"); for (int i=0; i<N; ++i) printf(\"%ld \",vect[i]); printf(\"\\n\");}\n if (DEBUG) {printf(\"P: \"); for (int i=0; i<N; ++i) printf(\"%ld \",P[i]); printf(\"\\n\");}\n}\n\n//------------------------------------------------------------------------------\nint64_t query(int N, int L, int R)\n{ \n if (L == R) return vect[L];\n return vect[L] - P[R] + P[L];\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //DEBUG = true;\n //--------------------------------------------------------------------------\n int N, K, L, R, num;\n num = scanf(\"%d %d \", &N, &K);\n for (int n=0; n<N; ++n) num = scanf(\"%ld \", &vect[n]);\n init(N);\n\n for (int k=0; k<K; ++k)\n {\n num = scanf(\"%d %d \", &L, &R);\n int64_t res = query(N, L-1, R-1);\n printf(\"%ld\\n\", res);\n }\n \n return 0;\n}\n\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":50,"memory_kb":6692,"score_of_the_acc":-0.6949,"final_rank":8},{"submission_id":"aoj_3186_7993016","code_snippet":"#include<iostream>\nusing namespace std;\n\ntypedef long long ll;\n\nll sa[200001];\nll a[200001];\n\nint main(){\n ll n,q,l,r;\n ll i,ans;\n\n cin >> n >> q;\n\n sa[0] = 0;\n\n for(i=1;i<=n;i++){\n cin >> a[i];\n sa[i] = a[i] + sa[i-1];\n }\n\n for(i=0;i<q;i++){\n cin >> l >> r;\n\n ans = a[l] - (sa[r] - sa[l]);\n\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":320,"memory_kb":6216,"score_of_the_acc":-1.4405,"final_rank":19},{"submission_id":"aoj_3186_7992927","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\nvoid func(){\n int n;\n int q;\n cin >> n >> q;\n using ll = long long;\n vector<ll> line(n);\n for(auto &i:line)cin >> i;\n vector<ll> sums(n+1,0);\n for(int i=0;i<n;++i){\n sums[i+1] = sums[i] + line[i];\n }\n for(int i=0;i<q;++i){\n int l;\n int r;\n cin >> l >> r;\n --l;\n --r;\n ll ans = line[l] - (sums[r+1] - sums[l+1]);\n cout << ans << endl;\n }\n}\n\nint main(){\n func();\n}","accuracy":1,"time_ms":250,"memory_kb":6280,"score_of_the_acc":-1.2315,"final_rank":16},{"submission_id":"aoj_3186_7992923","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nusing namespace std;\nusing ll = long long ;\nusing P = pair<int,int>;\nconst int mod = 998244353;\nconst int inf = (1<<30);\n\nconst int dy[4] = {-1,0,0,1};\nconst int dx[4] = {0,-1,1,0};\n\nint main(){\n int n,q;cin>>n>>q;\n vector<long long> A(n), B(n+1);\n for(int i = 0; n > i; i++){\n cin>>A[i]; \n }\n for(int i = 1; n >= i; i++){\n B[i] = B[i-1]+A[i-1]; \n }\n for(int i = 0; q > i; i++){\n int l,r;cin>>l>>r;l--;r--;\n cout << A[l] - (B[r+1]-B[l+1]) << endl;\n }\n}","accuracy":1,"time_ms":250,"memory_kb":6252,"score_of_the_acc":-1.2241,"final_rank":15},{"submission_id":"aoj_3186_7992910","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N, Q; cin >> N >> Q;\n vector<ll> A(N);\n for (auto& a : A) cin >> a;\n vector<ll> S(N + 1);\n for (int i = 0 ; i < N ; i++) {\n S[i + 1] = S[i] - A[i];\n }\n for (int i = 0 ; i < Q ; i++) {\n int l, r; cin >> l >> r;\n l--;\n ll ans = S[r] - S[l] + 2 * A[l];\n cout << ans << endl; \n }\n}","accuracy":1,"time_ms":250,"memory_kb":6280,"score_of_the_acc":-1.2315,"final_rank":16},{"submission_id":"aoj_3186_7011882","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3186.cc: Cumulative Difference\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 200000;\n\n/* typedef */\n\ntypedef long long ll;\n\n/* global variables */\n\nint as[MAX_N];\nll ass[MAX_N + 1];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, qn;\n scanf(\"%d%d\", &n, &qn);\n for (int i = 0; i < n; i++) scanf(\"%d\", as + i);\n\n for (int i = 0; i < n; i++) ass[i + 1] = ass[i] + as[i];\n\n while (qn--) {\n int l, r;\n scanf(\"%d%d\", &l, &r); l--;\n\n ll v = as[l] - (ass[r] - ass[l + 1]);\n printf(\"%lld\\n\", v);\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":5296,"score_of_the_acc":-0.2949,"final_rank":3},{"submission_id":"aoj_3186_6929929","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=9167167167167167167;\nconst int INF=100000000;\nconst ll mod=998244353;\n#define rep(i,a) for (int i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\n\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\t//cin>>t;\n\trep(i,t) solve();\n}\n\nvoid solve(){\n\tint N,Q;\n\tcin>>N>>Q;\n\tvector<ll> A(N+1);\n\trep(i,N) cin>>A[i+1];\n\trep(i,N) A[i+1]=A[i]+A[i+1];\n\trep(i,Q){\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tcout<<A[l]-A[l-1]-A[r]+A[l]<<\"\\n\";\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":4544,"score_of_the_acc":-0.0968,"final_rank":1},{"submission_id":"aoj_3186_5894995","code_snippet":"#pragma region header\n#include <bits/stdc++.h>\nusing namespace std;\n// #include <atcoder/all>\n// using namespace atcoder;\n\n/* alias */\nusing ull = unsigned long long;\nusing ll = long long;\nusing vi = vector<int>;\nusing vl = vector<long>;\nusing vll = vector<long long>;\nusing vf = vector<float>;\nusing vvf = vector<vf>;\nusing vvi = vector<vi>;\nusing vvl = vector<vl>;\nusing vvll = vector<vll>;\nusing vs = vector<string>;\nusing vvs = vector<vs>;\nusing vc = vector<char>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvc = vector<vc>;\nusing pll = pair<ll, ll>;\nusing vpll = vector<pll>;\nusing qll = queue<ll>;\n//仮想配列map<> https://code-database.com/knowledges/100\n//優先度付きque https://atcoder.jp/contests/apg4b/tasks/APG4b_aa\n\n/* define short */\n#define MOD 1000000007\n#define INF LLONG_MAX/32\n#define elif else if\n#define pb push_back\n#define pf push_front\n#define fi first\n#define se second\n#define mp make_pair\n#define all(obj) (obj).begin(), (obj).end()\n#define YESNO(bool) if(bool){cout<<\"YES\"<<endl;}else{cout<<\"NO\"<<endl;}\n#define yesno(bool) if(bool){cout<<\"yes\"<<endl;}else{cout<<\"no\"<<endl;}\n#define YesNo(bool) if(bool){cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\n\n/* REP macro */\n#define reps(i, a, n) for (ll i = (a); i < (ll)(n); ++i)\n#define rep(i, n) reps(i, 0, n)\n#define rrep(i, n) reps(i, 1, n + 1)\n#define repd(i,n) for(ll i=n-1;i>=0;i--)\n#define rrepd(i,n) for(ll i=n;i>=1;i--)\n\n//小数点以下出力の時にmainに書く\n// cout << fixed << setprecision(10);\n\n#pragma endregion header\n\nll N;\n\n\nvvll Graph;/*グラフ*/\n// struct edge{ll to, cost;};\n// vector<vector<edge>> Graph;\nll H, W; vs HW;/*HW .#*/\n\n\n\n#pragma region fanction\n#pragma region First Search\n/*幅優先探索 vll dist(N,-1); Graphは隣接リスト*/\nvoid bfs(vll &dist, ll fq, vvll Graph){\n dist[fq] = 0;\n deque<ll> que;que.pb(fq);\n ll v;\n while(!que.empty()){\n v = que.front();que.pop_front();\n\n for(ll nv:Graph[v]){\n if(dist[nv] != -1) continue;\n dist[nv] = dist[v] + 1;\n que.pb(nv);\n }\n }\n}\n\n\n/*distにsysxからの距離が入る 各重み1*/\n/*HW幅優先探索 https://pyteyon.hatenablog.com/entry/2019/03/01/211133#%E6%B7%B1%E3%81%95%E5%84%AA%E5%85%88%E6%8E%A2%E7%B4%A2*/\n/*vvll dist(H vll(W)); rep(h,H) rep(w,W) dist[h][w] = INF;*/\nvoid HW_bfs(vvll &dist, ll sy, ll sx, vs HW){\n dist[sy][sx] = 0;\n deque<vll> que;\n que.pb({sy,sx});\n\n vll v;\n ll nowy, nowx, nexty,nextx;\n vvll dydx = {{1,0},{0,1},{-1,0},{0,-1}};\n\n //重み1ならpbしてd++ 重み0ならpfしてそのままdiseにd入れれば01bfs\n //que.back();que.pop_back()で深さ優先探索\n\n while(!que.empty()){\n v = que.front();que.pop_front();\n nowy = v[0]; nowx = v[1];\n for(vll dyx:dydx){\n nexty = nowy+dyx[0]; nextx = nowx+dyx[1];\n if(!(0 <= nexty && nexty < H && 0 <= nextx && nextx < W)) continue;\n if(HW[nexty][nextx] == '.' && dist[nexty][nextx] == INF){\n que.pb({nexty,nextx});\n dist[nexty][nextx] = dist[nowy][nowx] + 1;\n }\n }\n }\n}\n\n/*深さ優先探索 vll dist(N,-1); Graphは隣接リスト スタートのdistを0にすること！*/\nvoid dfs(vll &dist, ll v, vvll &Graph){\n for(ll nv:Graph[v]){\n if(dist[nv] != -1) continue;\n dist[nv] = dist[v] + 1;\n dfs(dist,nv,Graph);\n }\n}\n\n//単一始点最短経路 ダイクストラ O(MlogN)\n//vector<vector<pll>> //Graph; fi:to se:cost\n// Graph.resize(N);\n// rep(i,M){\n// ll a,b,c; cin >> a >> b >> c;\n// a--;b--;\n// Graph[a].pb(pll(b,c));\n// Graph[b].pb(pll(a,c));\n// }\n\nvll dijkstra(ll start,vector<vector<pll>> &Graph){\n vll dist(N,INF);\n priority_queue<pll,vector<pll>,greater<pll>> que;\n dist[start] = 0;\n que.push(pll(dist[start],start));\n while (!que.empty()){\n pll p = que.top(); que.pop();\n ll v = p.second;\n if(dist[v] < p.first) continue;\n for(auto &e:Graph[v]){\n if(dist[e.first] > dist[v] + e.second){\n dist[e.first] = dist[v] + e.second;\n que.push(pll(dist[e.first],e.first));\n }\n }\n }\n\n return dist;\n}\n\n#pragma endregion First Search\n#pragma region MOD\nconst ll nCkMax = 1e6;\nvll fac(1,0),finv(1,0),inv(1,0);\n\nvoid COMinit(){\n fac.resize(nCkMax);\n finv.resize(nCkMax);\n inv.resize(nCkMax);\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(ll i=2;i<nCkMax;i++){\n fac[i] = fac[i-1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n/*a^n % mod p O(log N)*/\nll modpow(ll a, ll n) {\n ll res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % MOD;\n a = a * a % MOD;\n n >>= 1;\n }\n return res;\n}\n/*a! mod p O(N)*/\nll modfac(ll n){\n ll ret = 1;\n rrep(i,n){\n ret *= i;\n ret %= MOD;\n }\n return ret;\n}\n\n/*nCk % mod 前処理O(N) クエリ処理O(1)*/\nll nCk(ll n, ll k){\n if(fac[0] != 1) COMinit();//初期化 O(N)\n if(n<k) return 0;\n if(n<0 || k<0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\nll factorial(ll n){\n ll ans = 1;\n for (ll i = 1;i<=n;i++){\n ans = ans * i % MOD;\n }\n return ans;\n}\n\nll nHk(ll n, ll k){\n return nCk(n+k-1,k);\n}\n#pragma endregion MOD\n#pragma region enumeration\nvvll make_n(vll v){\n vvll ret;\n vll tmp;\n ll n = v.size();\n do{\n tmp = {};\n rep(i,n) tmp.pb(v[i]);\n ret.pb(tmp);\n }while(next_permutation(all(v)));\n return ret;\n}\n/*nCk列挙 vvllなのに注意！*/\nvvll make_C(ll n, ll r){\n vvll ret;\n vll tmp;\n vector<bool> v(n);\n fill(v.end() - r, v.end(), true);\n do {\n tmp = {};\n for (int i = 0; i < n; ++i) { \n if (v[i]) tmp.pb(i);\n }\n ret.pb(tmp);\n } while (next_permutation(v.begin(), v.end()));\n //reverse(all(ret));\n return ret;\n}\n/*nPk列挙 nPnでn!列挙 この時順番通りになってる*/\nvvll make_P(ll n, ll r){\n vvll C = make_C(n,r);\n vvll ret;\n vvll tmp;\n vll v;\n rep(i,C.size()){\n v = C[i];\n tmp = make_n(v);\n for(vll t:tmp) ret.pb(t);\n }\n return ret;\n}\n\n#pragma endregion enumeration\n#pragma region array\n\n/*一次元配列最大最小総和*/\nll vmax(vll array){\n ll Max = -INF;\n for(ll a:array) chmax(Max,a);\n return Max;\n}\n\nll vmin(vll array){\n ll Min = INF;\n for(ll a:array) chmin(Min,a);\n return Min;\n}\n\nll sum(vll &array){\n ll Sum = 0;\n for(ll a:array) Sum += a;\n return Sum;\n}\n\n/*累積和 先頭に0が追加されてる lからrまではret[r+1]-ret[l]*/\nvll cumulatice_sum(vll &array){\n vll ret(array.size()+1,0);\n rep(i,array.size()) ret[i+1] = ret[i] + array[i];\n return ret;\n}\n\n/*重複消し*/\nvoid list_set(vll &array){\n sort(all(array));\n array.erase(unique(all(array)),array.end());\n}\n\n/*vvllで格納されてる配列をkey番目の要素でソート*/\nvoid vvllsort(vvll &array, ll key){\n sort(all(array),[&key](vll a,vll b){return a[key] < b[key];});\n}\n\n/*string Sに何個string Kが含まれるか 一文字でもいいけどcharじゃなくてstringにしてね*/\nll stringinstring(string &S,string K){\n ll ret = 0;\n rep(i,S.size()-K.size()+1){\n bool f = true;\n rep(j,K.size()) if(S[i+j] != K[j]) f=false;\n if(f) ret++;\n }\n return ret;\n}\n#pragma endregion array\n#pragma region UnionFind\nclass UnionFind{\npublic:\n vector<ll> parent; //parent[i]はiの親\n vector<ll> siz; //素集合のサイズを表す配列(1で初期化)\n map<ll,vector<ll>> group; //集合ごとに管理する(key:集合の代表元、value:集合の要素の配列)\n ll n; //要素数\n \n //コンストラクタ\n UnionFind(ll n_):n(n_),parent(n_),siz(n_,1){ \n //全ての要素の根が自身であるとして初期化\n for(ll i=0;i<n;i++){parent[i]=i;}\n }\n \n //データxの属する木の根を取得(経路圧縮も行う)\n ll root(ll x){\n if(parent[x]==x) return x;\n return parent[x]=root(parent[x]);//代入式の値は代入した変数の値なので、経路圧縮できる\n }\n \n //xとyの木を併合\n void unite(ll x,ll y){\n ll rx=root(x);//xの根\n ll ry=root(y);//yの根\n if(rx==ry) return;//同じ木にある時\n //小さい集合を大きい集合へと併合(ry→rxへ併合)\n if(siz[rx]<siz[ry]) swap(rx,ry);\n siz[rx]+=siz[ry];\n parent[ry]=rx;//xとyが同じ木にない時はyの根ryをxの根rxにつける\n }\n \n //xとyが属する木が同じかを判定\n bool same(ll x,ll y){\n ll rx=root(x);\n ll ry=root(y);\n return rx==ry;\n }\n \n //xの素集合のサイズを取得\n ll size(ll x){\n return siz[root(x)];\n }\n \n //素集合をそれぞれグループ化\n void grouping(){\n //経路圧縮を先に行う\n rep(i,n)root(i);\n //mapで管理する(デフォルト構築を利用)\n rep(i,n)group[parent[i]].pb(i);\n }\n \n //素集合系を削除して初期化\n void clear(){\n rep(i,n){parent[i]=i;}\n siz=vector<ll>(n,1);\n group.clear();\n }\n};\n#pragma endregion UnionFind\n#pragma region bisect\n/*二分探索*/\nll bisect_left(vll &array, ll key){\n return lower_bound(all(array),key) - array.begin();\n}\n\nll bisect_right(vll &array, ll key){\n return upper_bound(all(array),key) - array.begin();\n}\n\n/*最長増加部分列*/\nll LIS(vll a){\n vll dp(a.size(),INF);\n rep(i,a.size()){\n dp[bisect_right(dp,a[i])] = a[i];\n }\n return bisect_left(dp,INF);\n}\n/*条件を満たす最大のokを返す 最小にしたいならokng逆にする solveを書き換えること!*/\nbool solve(ll n){\n return true;\n}\n\nll meguru_bisect(ll ok, ll ng){\n ll mid;\n while(abs(ok-ng) > 1){\n mid = (ok + ng) / 2;\n if(solve(mid)) ok = mid;\n else ng = mid;\n }\n return ok;\n}\n#pragma endregion bisect\n#pragma region others\n\n/* memo\n\n二次元配列の90度回転\n// i:j \n// j:N - i - 1\n\n\n*/\n\n\n\n/*普通のa^n*/\nll pow(ll a, ll n){\n ll res = 1;\n while (n > 0) {\n if (n & 1) res *= a;\n a *= a;\n n >>= 1;\n }\n return res;\n}\n/*最大公約数*/\nll gcd(ll x,ll y){\n if (x < y) swap(x,y);\n while (y > 0){\n ll r = x % y;\n x = y;\n y = r;\n }\n return x;\n}\n\n/*最小公倍数*/\nll lcm(ll x,ll y){\n return x * y / (gcd(x,y));\n}\n\n/*約数列挙*/\nvll divisor(ll n){\n vll ret;\n for (ll i = 1; i * i <= n; i++){\n if (n % i == 0){\n ret.pb(i);\n if (i * i != n) ret.pb(n / i);\n }\n }\n sort(all(ret));\n return ret;\n}\n\n/*素因数分解*/\nvll factorize(ll n){\n vll ret;\n while (n % 2 == 0){\n ret.pb(2);\n n /= 2;\n }\n ll f = 3;\n while (f * f <= n){\n if (n % f == 0){\n ret.pb(f);\n n /= f;\n }else f += 2;\n }\n if (n != 1) ret.pb(n);\n return ret;\n}\nconst ll Eramax = 1e6+1;\nvll Eratos(1,1);\nvoid Erainit(){\n Eratos.resize(Eramax+1);\n rep(i,Eramax+1) Eratos[i] = i;\n for(ll i=2;i<Eramax;i++){\n if(Eratos[i] != i) continue;\n for(ll j=2*i;j<Eramax;j+=i) Eratos[j] = i;\n }\n Eratos[1] = -1;\n}\n//前処理型素因数分解 1e6以下を複数回やるならこっち\nvll Era_factorize(ll n){\n if(Eratos[0] != 0) Erainit();\n vll ret = {};\n if(n==1) return ret;\n while(n!=1){\n ret.pb(Eratos[n]);\n n /= Eratos[n];\n }\n return ret;\n}\n\n#pragma endregion others\n#pragma endregion fanction\n\n\n\n\nint main() {\n ll Q; cin >> N >> Q;\n vll A(N); rep(i,N) cin >> A[i];\n vll Sum = cumulatice_sum(A);\n \n rep(i,Q){\n ll l,r; cin >> l >> r;\n r--;\n cout << A[l-1] - (Sum[r+1] - Sum[l]) << endl;\n }\n \n}","accuracy":1,"time_ms":250,"memory_kb":6300,"score_of_the_acc":-1.2368,"final_rank":18},{"submission_id":"aoj_3186_5263075","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\nint main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tint n; cin >> n;\n\tint q; cin >> q;\n\tvector<ll> a(n);\n\tvector<ll> sum(n+1);\n\tfor(int i=0;i<n;i++){\n\t\tcin >> a[i];\n\t\tsum[i+1]=sum[i]+a[i];\n\t}\n\twhile(q--){\n\t\tint l,r; cin >> l >> r;\n\t\tl--;\n\t\tprintf(\"%lld\\n\",a[l]-(sum[r]-sum[l+1]));\n\t}\n}","accuracy":1,"time_ms":60,"memory_kb":5984,"score_of_the_acc":-0.5406,"final_rank":7},{"submission_id":"aoj_3186_5150318","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n int n,q;\n cin >> n >> q;\n vector<int> a(n);\n for(int i=0; i<n; i++){\n cin >> a[i];\n }\n vector<long long int> csum(n+1, 0);\n for(int i=0; i<n; i++){\n csum[i+1] = csum[i]+a[i];\n }\n for(int i=0; i<q; i++){\n int l,r;\n cin >> l >> r;\n l--; r--;\n cout << a[l] -(csum[r+1]-csum[l+1]) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":5472,"score_of_the_acc":-1.0187,"final_rank":10},{"submission_id":"aoj_3186_5067504","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\nnamespace CharacterClass {\n\tconstexpr string_view\n\t digit = \"0123456789\",\n\t xdigit = \"0123456789ABCDEFabcdef\", lower = \"abcdefghijklmnopqrstuvwxyz\",\n\t upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n\t alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t alnum = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t word = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\",\n\t punct = R\"(!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~)\",\n\t graph =\n\t R\"(!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t print =\n\t R\"( !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t blank = \" \\t\", space = \" \\t\\n\\r\\f\\v\";\n} // namespace CharacterClass\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Printer {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid print(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(bool v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(vector<bool>::reference v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid print(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid print(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid print(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void print(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\n\t\tprint(v.first);\n\t\tprint(D.d);\n\t\tprint(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) print(D.d);\n\t\t\tprint(*i);\n\t\t}\n\t}\n\ttemplate <class T> void print(const vector<T>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void print(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) print(D.l);\n\t\t\tprint(v[i]);\n\t\t}\n\t}\n\n\tPrinter() = default;\n\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tPrinter& operator()() {\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Printer& operator()(H&& h) {\n\t\tprint(h);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\n\t\tprint(h);\n\t\tprint(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\n\t\tprint_range(begin, end);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Printer& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tPrinter& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tPrinter& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tPrinter& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tPrinter& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 7 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T = long long> constexpr T TEN(size_t n) {\n\tT result = 1;\n\tfor (size_t i = 0; i < n; ++i) result *= 10;\n\treturn result;\n}\ntemplate <class T, class U,\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr auto div_ceil(T n, U m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> constexpr T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> constexpr T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T, class U, class V>\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\n\treturn lower <= v && v < upper;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\nconstexpr bool is_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> constexpr T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T> constexpr int BIT(T x, int i) {\n\treturn (x & (1 << i)) ? 1 : 0;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Pow(T a, U n) {\n\tassert(n >= 0);\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Powmod(T a, U n, T mod) {\n\tassert(n >= 0);\n\tif (a > mod) a %= mod;\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 3 \"/home/yuruhiya/programming/library/Utility/CulSum.cpp\"\n#include <type_traits>\n#line 5 \"/home/yuruhiya/programming/library/Utility/CulSum.cpp\"\nusing namespace std;\n\ntemplate <class T> class CulSum {\npublic:\n\tusing value_type = T;\n\tusing data_type = vector<value_type>;\n\nprivate:\n\tsize_t n;\n\tdata_type data;\n\npublic:\n\tCulSum() = default;\n\tCulSum(const data_type& a) : n(a.size()), data(n + 1) {\n\t\tfor (size_t i = 0; i < n; ++i) {\n\t\t\tdata[i + 1] = data[i] + a[i];\n\t\t}\n\t}\n\ttemplate <class U, class F, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\n\tCulSum(const U& _n, F f) : n(_n), data(n + 1) {\n\t\tfor (size_t i = 0; i < n; ++i) {\n\t\t\tdata[i + 1] = data[i] + static_cast<value_type>(f(i));\n\t\t}\n\t}\n\ttemplate <class U, class F, enable_if_t<!is_integral_v<U>, nullptr_t> = nullptr>\n\tCulSum(const U& a, F f)\n\t : CulSum(a.size(), [a, f](size_t i) -> value_type { return f(a[i]); }) {}\n\tsize_t size() const {\n\t\treturn n;\n\t}\n\tvalue_type at(size_t i) const {\n\t\treturn operator()(i, i + 1);\n\t}\n\t// [l, r)\n\tvalue_type operator()(size_t l, size_t r) const {\n\t\tl = min(l, n);\n\t\tr = min(r, n);\n\t\treturn l > r ? 0 : data[r] - data[l];\n\t}\n\t// [0, r)\n\tvalue_type operator()(size_t r) const {\n\t\tr = min(r, n);\n\t\treturn data[r];\n\t}\n\tconst data_type& get_data() const {\n\t\treturn data;\n\t}\n};\n#line 3 \"a.cpp\"\n\nint main() {\n\tini(n, q);\n\tVL a = in[n];\n\tCulSum<ll> sum(a);\n\trep(i, q) {\n\t\tint l = in--, r = in;\n\t\tout(a[l] - sum(l + 1, r));\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":6148,"score_of_the_acc":-0.4226,"final_rank":4},{"submission_id":"aoj_3186_5043902","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)n;++i)\n#define irep(i,a,b) for(int i=int(a);i<(int)b;++i)\n#define rrep(i,a,b) for(int i=int(a);i>=(int)b;--i)\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define vvp vector<vector<pair<ll,ll>>>\n#define vpl vector<pair<ll,ll>>\n#define vpi vector<pair<int,int>>\n#define pb push_back\n#define se second\n#define fi first\n#define all(v) v.begin(),v.end()\n#define v(T) vector<T>\n#define vv(T) vector<vector<T>>\n\nusing namespace std;\n\ntemplate<typename T> istream& operator>>(istream&i,v(T)&v){rep(j,v.size())i>>v[j];return i;}\ntemplate<typename T> string join(const v(T)&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\ntemplate<typename T> ostream& operator<<(ostream&o,const v(T)&v){if(v.size())o<<join(v);return o;}\n\n\n\nusing ll = long long;\nconst ll INF = 1e18;\nconst double PI = acos(-1);\n\nconst ll mod = 1e9 + 7; //998244353;\n\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n\nll modpow(ll a,ll b){\n if(b == 0){\n return 1;\n }\n if(b%2 == 0){\n ll tmp = modpow(a,b/2);\n return tmp*tmp%mod;\n }else{\n return modpow(a,b-1)*a%mod;\n }\n\n}\n\n\n\nint main(void)\n{\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int n,q;\n cin >> n >> q;\n vl a(n),asum(n+1);\n rep(i,n){\n cin >> a[i];\n asum[i+1] = asum[i] + a[i];\n }\n\n vl ans;\n rep(i,q){\n int l,r;\n cin >> l >> r;\n ll s = -asum[r]+asum[l] + a[l-1];\n ans.pb(s);\n }\n\n rep(i,ans.size())cout << ans[i] << endl;\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":8340,"score_of_the_acc":-1.5484,"final_rank":20},{"submission_id":"aoj_3186_4985584","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#include <math.h>\n#include <iomanip>\n#include <cstdint>\n#include <string>\n#include <sstream>\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#define rep(i,n) for (int i = 0; i < (n); ++i)\ntypedef long long ll;\nusing P = pair<int,int>;\nconst int INF=1001001001;\nconst int mod =1e9+7;\n\nint main() {\n int N,Q;cin>>N>>Q;\n vector<int>a(N+1);\n for(int i=1;i<=N;i++){cin>>a[i];}\n vector<ll>sum(N+1);\n for(int i=1;i<=N;i++){sum[i]=sum[i-1]+a[i];}\n for(int i=0;i<Q;i++){\n int L,R;cin>>L>>R;\n cout<<a[L]-(sum[R]-sum[L])<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":5492,"score_of_the_acc":-1.0239,"final_rank":11},{"submission_id":"aoj_3186_4944013","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nint N,num_query;\nll A[SIZE];\n\nint main(){\n\n\tscanf(\"%d %d\",&N,&num_query);\n\n\tA[0] = 0;\n\tfor(int i = 1; i <= N; i++){\n\n\t\tscanf(\"%lld\",&A[i]);\n\t\tA[i] += A[i-1];\n\t}\n\n\tint left,right;\n\n\tfor(int loop = 0; loop < num_query; loop++){\n\n\t\tscanf(\"%d %d\",&left,&right);\n\n\t\tprintf(\"%lld\\n\",(A[left]-A[left-1])-(A[right]-A[left]));\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4776,"score_of_the_acc":-0.1901,"final_rank":2},{"submission_id":"aoj_3186_4874327","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, n) for(int i=0; i<(n); ++i)\n\nusing namespace std;\ntypedef long long ll;\n\nconst int INTINF = INT_MAX >> 1;\n\nint main(){\n\n\tint N, Q;\n\tcin >> N >> Q;\n\tvector<ll> v(N), H(N+1);\n\trep(i, N){\n\t\tcin >> v[i];\n\t\tH[i+1] = H[i] - v[i];\n\n\t}\n\trep(i, Q){\n\t\tint a, b; cin >> a >> b;\n\t\tcout << - H[a-1] + H[b] + v[a-1] * 2 << endl;\n\t}\n\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":6204,"score_of_the_acc":-1.1792,"final_rank":13},{"submission_id":"aoj_3186_4871195","code_snippet":"#include <bits/stdc++.h>\n#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)\n#define rep2(i, s, n) rep3(i, s, n, 1)\n#define rep(i, n) rep2(i, 0, n)\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing P = pair<int, int>;\n\nint main() { \n int n, q;\n cin >> n >> q;\n vector<ll> rui;\n ll total = 0;\n rui.push_back(0);\n rep(i, n){\n ll a;\n cin >> a;\n total += a;\n rui.push_back(total);\n }\n rep(i, q){\n ll l, r;\n cin >> l >> r;\n cout << rui[l] - rui[l-1] - (rui[r] - rui[l]) << endl;\n }\n return 0; \n}","accuracy":1,"time_ms":240,"memory_kb":5212,"score_of_the_acc":-0.9179,"final_rank":9},{"submission_id":"aoj_3186_4866123","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n\nusing namespace std;\n\n#define int long long\n#define endl \"\\n\"\n\nsigned main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int N, Q;\n vector<int> a, sum;\n\n cin>>N>>Q;\n\n a.resize(N);\n sum.resize(N+1);\n\n for(int i = 0; i < N; i++){\n cin>>a[i];\n\n sum[i+1] += sum[i] + a[i];\n }\n\n for(int i =0; i < Q; i++){\n int L, R;\n\n cin>>L>>R;\n\n L--, R--;\n\n int s = sum[R+1] - sum[L+1];\n\n cout<<a[L]-s<<endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":6000,"score_of_the_acc":-0.5126,"final_rank":5},{"submission_id":"aoj_3186_4862671","code_snippet":"#include <bits/stdc++.h>\n#ifdef _DEBUG\n#include \"_DEBUG.hpp\"\n#endif\n#define int long long\nusing namespace std;\nusing P = pair<int, int>;\nconst int inf = 1LL << 60;\nconst int mod = 1e9 + 7;\n\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (T &in : v) is >> in;\n return is;\n}\n\ntemplate <class T>\nvector<T> make_vec(size_t a) {\n return vector<T>(a);\n}\n\ntemplate <class T, class... Ts>\nauto make_vec(size_t a, Ts... ts) {\n return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\n}\n\ntemplate <class T, class V>\ntypename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {\n t = v;\n}\n\ntemplate <class T, class V>\ntypename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v) {\n for (auto &e : t) fill(e, v);\n}\n\nsigned main() {\n \n int n, q;\n cin >> n >> q;\n vector<int> a(n);\n cin >> a;\n\n vector<int> imos(n + 1, 0);\n for (int i = 1; i <= n; i++) {\n imos[i] = imos[i-1] + a[i-1];\n }\n\n for(int i = 0; i < q; i++){\n int l, r;\n cin >> l >> r;\n int ans = a[l-1] - (imos[r] - imos[l]);\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":6240,"score_of_the_acc":-1.221,"final_rank":14},{"submission_id":"aoj_3186_4861891","code_snippet":"/**\n * author: otera \n**/\n#include<iostream>\n#include<string> \n#include<cstdio>\n#include<cstring>\n#include<vector>\n#include<cmath>\n#include<algorithm> \n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<deque>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\n#define int long long\ntypedef long long ll;\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\ntypedef long double ld;\nconst int inf=1e9+7;\nconst ll INF=1LL<<60 ;\nconst ll mod=1e9+7 ;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef complex<ld> Point;\nconst ld eps = 1e-8;\nconst ld pi = acos(-1.0);\ntypedef pair<int, int> P;\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define debug(x) cerr << #x << \" = \" << (x) << endl;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nvoid solve() {\n\tint n, q; cin >> n >> q;\n vector<int> a(n);\n vector<int> sum(n + 1, 0);\n rep(i, n) {\n cin >> a[i];\n sum[i + 1] = sum[i] + a[i];\n }\n rep(_, q) {\n int l, r; cin >> l >> r;\n -- l;\n cout << a[l] - (sum[r] - sum[l + 1]) << endl;\n }\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//int t; cin >> t; rep(i, t)solve();\n\tsolve();\n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":6000,"score_of_the_acc":-1.0287,"final_rank":12}],"string":"[\n {\n \"submission_id\": \"aoj_3186_9652237\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n\\nvoid acc() {\\n int n, q;\\n cin >> n >> q;\\n vector<long long > pref(n + 1),v(n+1);\\n for (int i = 1; i <= n; i++) {\\n cin >>v[i] ;\\n }\\n for (int i = 1 ; i<=n ; i++){\\n pref[i]+=pref[i-1]+v[i] ;\\n }\\n while (q--) {\\n int l, r;\\n cin >> l >> r;\\n cout <<v[l]-pref[r]+pref[l] <<'\\\\n';\\n }\\n\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n acc();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 6212,\n \"score_of_the_acc\": -0.5362,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3186_9552399\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n\\n/*\\n*/\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\n\\nconst int MAX_N = 200000;\\nstatic int64_t vect[MAX_N];\\nstatic int64_t P[MAX_N];\\n\\n\\n//------------------------------------------------------------------------------\\nvoid init(int N)\\n{ \\n P[0] = vect[0];\\n for (int i=1; i<N; i++) P[i] = vect[i] + P[i-1];\\n if (DEBUG) {printf(\\\"vect: \\\"); for (int i=0; i<N; ++i) printf(\\\"%ld \\\",vect[i]); printf(\\\"\\\\n\\\");}\\n if (DEBUG) {printf(\\\"P: \\\"); for (int i=0; i<N; ++i) printf(\\\"%ld \\\",P[i]); printf(\\\"\\\\n\\\");}\\n}\\n\\n//------------------------------------------------------------------------------\\nint64_t query(int N, int L, int R)\\n{ \\n if (L == R) return vect[L];\\n return vect[L] - P[R] + P[L];\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //DEBUG = true;\\n //--------------------------------------------------------------------------\\n int N, K, L, R, num;\\n num = scanf(\\\"%d %d \\\", &N, &K);\\n for (int n=0; n<N; ++n) num = scanf(\\\"%ld \\\", &vect[n]);\\n init(N);\\n\\n for (int k=0; k<K; ++k)\\n {\\n num = scanf(\\\"%d %d \\\", &L, &R);\\n int64_t res = query(N, L-1, R-1);\\n printf(\\\"%ld\\\\n\\\", res);\\n }\\n \\n return 0;\\n}\\n\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 6692,\n \"score_of_the_acc\": -0.6949,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3186_7993016\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\nll sa[200001];\\nll a[200001];\\n\\nint main(){\\n ll n,q,l,r;\\n ll i,ans;\\n\\n cin >> n >> q;\\n\\n sa[0] = 0;\\n\\n for(i=1;i<=n;i++){\\n cin >> a[i];\\n sa[i] = a[i] + sa[i-1];\\n }\\n\\n for(i=0;i<q;i++){\\n cin >> l >> r;\\n\\n ans = a[l] - (sa[r] - sa[l]);\\n\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 6216,\n \"score_of_the_acc\": -1.4405,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3186_7992927\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\nvoid func(){\\n int n;\\n int q;\\n cin >> n >> q;\\n using ll = long long;\\n vector<ll> line(n);\\n for(auto &i:line)cin >> i;\\n vector<ll> sums(n+1,0);\\n for(int i=0;i<n;++i){\\n sums[i+1] = sums[i] + line[i];\\n }\\n for(int i=0;i<q;++i){\\n int l;\\n int r;\\n cin >> l >> r;\\n --l;\\n --r;\\n ll ans = line[l] - (sums[r+1] - sums[l+1]);\\n cout << ans << endl;\\n }\\n}\\n\\nint main(){\\n func();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 6280,\n \"score_of_the_acc\": -1.2315,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3186_7992923\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n\\nusing namespace std;\\nusing ll = long long ;\\nusing P = pair<int,int>;\\nconst int mod = 998244353;\\nconst int inf = (1<<30);\\n\\nconst int dy[4] = {-1,0,0,1};\\nconst int dx[4] = {0,-1,1,0};\\n\\nint main(){\\n int n,q;cin>>n>>q;\\n vector<long long> A(n), B(n+1);\\n for(int i = 0; n > i; i++){\\n cin>>A[i]; \\n }\\n for(int i = 1; n >= i; i++){\\n B[i] = B[i-1]+A[i-1]; \\n }\\n for(int i = 0; q > i; i++){\\n int l,r;cin>>l>>r;l--;r--;\\n cout << A[l] - (B[r+1]-B[l+1]) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 6252,\n \"score_of_the_acc\": -1.2241,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3186_7992910\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n int N, Q; cin >> N >> Q;\\n vector<ll> A(N);\\n for (auto& a : A) cin >> a;\\n vector<ll> S(N + 1);\\n for (int i = 0 ; i < N ; i++) {\\n S[i + 1] = S[i] - A[i];\\n }\\n for (int i = 0 ; i < Q ; i++) {\\n int l, r; cin >> l >> r;\\n l--;\\n ll ans = S[r] - S[l] + 2 * A[l];\\n cout << ans << endl; \\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 6280,\n \"score_of_the_acc\": -1.2315,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3186_7011882\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3186.cc: Cumulative Difference\\n */\\n\\n#include<cstdio>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 200000;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\n\\n/* global variables */\\n\\nint as[MAX_N];\\nll ass[MAX_N + 1];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, qn;\\n scanf(\\\"%d%d\\\", &n, &qn);\\n for (int i = 0; i < n; i++) scanf(\\\"%d\\\", as + i);\\n\\n for (int i = 0; i < n; i++) ass[i + 1] = ass[i] + as[i];\\n\\n while (qn--) {\\n int l, r;\\n scanf(\\\"%d%d\\\", &l, &r); l--;\\n\\n ll v = as[l] - (ass[r] - ass[l + 1]);\\n printf(\\\"%lld\\\\n\\\", v);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5296,\n \"score_of_the_acc\": -0.2949,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3186_6929929\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=9167167167167167167;\\nconst int INF=100000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (int i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\n\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tint t=1;\\n\\t//cin>>t;\\n\\trep(i,t) solve();\\n}\\n\\nvoid solve(){\\n\\tint N,Q;\\n\\tcin>>N>>Q;\\n\\tvector<ll> A(N+1);\\n\\trep(i,N) cin>>A[i+1];\\n\\trep(i,N) A[i+1]=A[i]+A[i+1];\\n\\trep(i,Q){\\n\\t\\tint l,r;\\n\\t\\tcin>>l>>r;\\n\\t\\tcout<<A[l]-A[l-1]-A[r]+A[l]<<\\\"\\\\n\\\";\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4544,\n \"score_of_the_acc\": -0.0968,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3186_5894995\",\n \"code_snippet\": \"#pragma region header\\n#include <bits/stdc++.h>\\nusing namespace std;\\n// #include <atcoder/all>\\n// using namespace atcoder;\\n\\n/* alias */\\nusing ull = unsigned long long;\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vl = vector<long>;\\nusing vll = vector<long long>;\\nusing vf = vector<float>;\\nusing vvf = vector<vf>;\\nusing vvi = vector<vi>;\\nusing vvl = vector<vl>;\\nusing vvll = vector<vll>;\\nusing vs = vector<string>;\\nusing vvs = vector<vs>;\\nusing vc = vector<char>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvc = vector<vc>;\\nusing pll = pair<ll, ll>;\\nusing vpll = vector<pll>;\\nusing qll = queue<ll>;\\n//仮想配列map<> https://code-database.com/knowledges/100\\n//優先度付きque https://atcoder.jp/contests/apg4b/tasks/APG4b_aa\\n\\n/* define short */\\n#define MOD 1000000007\\n#define INF LLONG_MAX/32\\n#define elif else if\\n#define pb push_back\\n#define pf push_front\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define all(obj) (obj).begin(), (obj).end()\\n#define YESNO(bool) if(bool){cout<<\\\"YES\\\"<<endl;}else{cout<<\\\"NO\\\"<<endl;}\\n#define yesno(bool) if(bool){cout<<\\\"yes\\\"<<endl;}else{cout<<\\\"no\\\"<<endl;}\\n#define YesNo(bool) if(bool){cout<<\\\"Yes\\\"<<endl;}else{cout<<\\\"No\\\"<<endl;}\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\\n\\n/* REP macro */\\n#define reps(i, a, n) for (ll i = (a); i < (ll)(n); ++i)\\n#define rep(i, n) reps(i, 0, n)\\n#define rrep(i, n) reps(i, 1, n + 1)\\n#define repd(i,n) for(ll i=n-1;i>=0;i--)\\n#define rrepd(i,n) for(ll i=n;i>=1;i--)\\n\\n//小数点以下出力の時にmainに書く\\n// cout << fixed << setprecision(10);\\n\\n#pragma endregion header\\n\\nll N;\\n\\n\\nvvll Graph;/*グラフ*/\\n// struct edge{ll to, cost;};\\n// vector<vector<edge>> Graph;\\nll H, W; vs HW;/*HW .#*/\\n\\n\\n\\n#pragma region fanction\\n#pragma region First Search\\n/*幅優先探索 vll dist(N,-1); Graphは隣接リスト*/\\nvoid bfs(vll &dist, ll fq, vvll Graph){\\n dist[fq] = 0;\\n deque<ll> que;que.pb(fq);\\n ll v;\\n while(!que.empty()){\\n v = que.front();que.pop_front();\\n\\n for(ll nv:Graph[v]){\\n if(dist[nv] != -1) continue;\\n dist[nv] = dist[v] + 1;\\n que.pb(nv);\\n }\\n }\\n}\\n\\n\\n/*distにsysxからの距離が入る 各重み1*/\\n/*HW幅優先探索 https://pyteyon.hatenablog.com/entry/2019/03/01/211133#%E6%B7%B1%E3%81%95%E5%84%AA%E5%85%88%E6%8E%A2%E7%B4%A2*/\\n/*vvll dist(H vll(W)); rep(h,H) rep(w,W) dist[h][w] = INF;*/\\nvoid HW_bfs(vvll &dist, ll sy, ll sx, vs HW){\\n dist[sy][sx] = 0;\\n deque<vll> que;\\n que.pb({sy,sx});\\n\\n vll v;\\n ll nowy, nowx, nexty,nextx;\\n vvll dydx = {{1,0},{0,1},{-1,0},{0,-1}};\\n\\n //重み1ならpbしてd++ 重み0ならpfしてそのままdiseにd入れれば01bfs\\n //que.back();que.pop_back()で深さ優先探索\\n\\n while(!que.empty()){\\n v = que.front();que.pop_front();\\n nowy = v[0]; nowx = v[1];\\n for(vll dyx:dydx){\\n nexty = nowy+dyx[0]; nextx = nowx+dyx[1];\\n if(!(0 <= nexty && nexty < H && 0 <= nextx && nextx < W)) continue;\\n if(HW[nexty][nextx] == '.' && dist[nexty][nextx] == INF){\\n que.pb({nexty,nextx});\\n dist[nexty][nextx] = dist[nowy][nowx] + 1;\\n }\\n }\\n }\\n}\\n\\n/*深さ優先探索 vll dist(N,-1); Graphは隣接リスト スタートのdistを0にすること！*/\\nvoid dfs(vll &dist, ll v, vvll &Graph){\\n for(ll nv:Graph[v]){\\n if(dist[nv] != -1) continue;\\n dist[nv] = dist[v] + 1;\\n dfs(dist,nv,Graph);\\n }\\n}\\n\\n//単一始点最短経路 ダイクストラ O(MlogN)\\n//vector<vector<pll>> //Graph; fi:to se:cost\\n// Graph.resize(N);\\n// rep(i,M){\\n// ll a,b,c; cin >> a >> b >> c;\\n// a--;b--;\\n// Graph[a].pb(pll(b,c));\\n// Graph[b].pb(pll(a,c));\\n// }\\n\\nvll dijkstra(ll start,vector<vector<pll>> &Graph){\\n vll dist(N,INF);\\n priority_queue<pll,vector<pll>,greater<pll>> que;\\n dist[start] = 0;\\n que.push(pll(dist[start],start));\\n while (!que.empty()){\\n pll p = que.top(); que.pop();\\n ll v = p.second;\\n if(dist[v] < p.first) continue;\\n for(auto &e:Graph[v]){\\n if(dist[e.first] > dist[v] + e.second){\\n dist[e.first] = dist[v] + e.second;\\n que.push(pll(dist[e.first],e.first));\\n }\\n }\\n }\\n\\n return dist;\\n}\\n\\n#pragma endregion First Search\\n#pragma region MOD\\nconst ll nCkMax = 1e6;\\nvll fac(1,0),finv(1,0),inv(1,0);\\n\\nvoid COMinit(){\\n fac.resize(nCkMax);\\n finv.resize(nCkMax);\\n inv.resize(nCkMax);\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for(ll i=2;i<nCkMax;i++){\\n fac[i] = fac[i-1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n/*a^n % mod p O(log N)*/\\nll modpow(ll a, ll n) {\\n ll res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a % MOD;\\n a = a * a % MOD;\\n n >>= 1;\\n }\\n return res;\\n}\\n/*a! mod p O(N)*/\\nll modfac(ll n){\\n ll ret = 1;\\n rrep(i,n){\\n ret *= i;\\n ret %= MOD;\\n }\\n return ret;\\n}\\n\\n/*nCk % mod 前処理O(N) クエリ処理O(1)*/\\nll nCk(ll n, ll k){\\n if(fac[0] != 1) COMinit();//初期化 O(N)\\n if(n<k) return 0;\\n if(n<0 || k<0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\\n}\\n\\nll factorial(ll n){\\n ll ans = 1;\\n for (ll i = 1;i<=n;i++){\\n ans = ans * i % MOD;\\n }\\n return ans;\\n}\\n\\nll nHk(ll n, ll k){\\n return nCk(n+k-1,k);\\n}\\n#pragma endregion MOD\\n#pragma region enumeration\\nvvll make_n(vll v){\\n vvll ret;\\n vll tmp;\\n ll n = v.size();\\n do{\\n tmp = {};\\n rep(i,n) tmp.pb(v[i]);\\n ret.pb(tmp);\\n }while(next_permutation(all(v)));\\n return ret;\\n}\\n/*nCk列挙 vvllなのに注意！*/\\nvvll make_C(ll n, ll r){\\n vvll ret;\\n vll tmp;\\n vector<bool> v(n);\\n fill(v.end() - r, v.end(), true);\\n do {\\n tmp = {};\\n for (int i = 0; i < n; ++i) { \\n if (v[i]) tmp.pb(i);\\n }\\n ret.pb(tmp);\\n } while (next_permutation(v.begin(), v.end()));\\n //reverse(all(ret));\\n return ret;\\n}\\n/*nPk列挙 nPnでn!列挙 この時順番通りになってる*/\\nvvll make_P(ll n, ll r){\\n vvll C = make_C(n,r);\\n vvll ret;\\n vvll tmp;\\n vll v;\\n rep(i,C.size()){\\n v = C[i];\\n tmp = make_n(v);\\n for(vll t:tmp) ret.pb(t);\\n }\\n return ret;\\n}\\n\\n#pragma endregion enumeration\\n#pragma region array\\n\\n/*一次元配列最大最小総和*/\\nll vmax(vll array){\\n ll Max = -INF;\\n for(ll a:array) chmax(Max,a);\\n return Max;\\n}\\n\\nll vmin(vll array){\\n ll Min = INF;\\n for(ll a:array) chmin(Min,a);\\n return Min;\\n}\\n\\nll sum(vll &array){\\n ll Sum = 0;\\n for(ll a:array) Sum += a;\\n return Sum;\\n}\\n\\n/*累積和 先頭に0が追加されてる lからrまではret[r+1]-ret[l]*/\\nvll cumulatice_sum(vll &array){\\n vll ret(array.size()+1,0);\\n rep(i,array.size()) ret[i+1] = ret[i] + array[i];\\n return ret;\\n}\\n\\n/*重複消し*/\\nvoid list_set(vll &array){\\n sort(all(array));\\n array.erase(unique(all(array)),array.end());\\n}\\n\\n/*vvllで格納されてる配列をkey番目の要素でソート*/\\nvoid vvllsort(vvll &array, ll key){\\n sort(all(array),[&key](vll a,vll b){return a[key] < b[key];});\\n}\\n\\n/*string Sに何個string Kが含まれるか 一文字でもいいけどcharじゃなくてstringにしてね*/\\nll stringinstring(string &S,string K){\\n ll ret = 0;\\n rep(i,S.size()-K.size()+1){\\n bool f = true;\\n rep(j,K.size()) if(S[i+j] != K[j]) f=false;\\n if(f) ret++;\\n }\\n return ret;\\n}\\n#pragma endregion array\\n#pragma region UnionFind\\nclass UnionFind{\\npublic:\\n vector<ll> parent; //parent[i]はiの親\\n vector<ll> siz; //素集合のサイズを表す配列(1で初期化)\\n map<ll,vector<ll>> group; //集合ごとに管理する(key:集合の代表元、value:集合の要素の配列)\\n ll n; //要素数\\n \\n //コンストラクタ\\n UnionFind(ll n_):n(n_),parent(n_),siz(n_,1){ \\n //全ての要素の根が自身であるとして初期化\\n for(ll i=0;i<n;i++){parent[i]=i;}\\n }\\n \\n //データxの属する木の根を取得(経路圧縮も行う)\\n ll root(ll x){\\n if(parent[x]==x) return x;\\n return parent[x]=root(parent[x]);//代入式の値は代入した変数の値なので、経路圧縮できる\\n }\\n \\n //xとyの木を併合\\n void unite(ll x,ll y){\\n ll rx=root(x);//xの根\\n ll ry=root(y);//yの根\\n if(rx==ry) return;//同じ木にある時\\n //小さい集合を大きい集合へと併合(ry→rxへ併合)\\n if(siz[rx]<siz[ry]) swap(rx,ry);\\n siz[rx]+=siz[ry];\\n parent[ry]=rx;//xとyが同じ木にない時はyの根ryをxの根rxにつける\\n }\\n \\n //xとyが属する木が同じかを判定\\n bool same(ll x,ll y){\\n ll rx=root(x);\\n ll ry=root(y);\\n return rx==ry;\\n }\\n \\n //xの素集合のサイズを取得\\n ll size(ll x){\\n return siz[root(x)];\\n }\\n \\n //素集合をそれぞれグループ化\\n void grouping(){\\n //経路圧縮を先に行う\\n rep(i,n)root(i);\\n //mapで管理する(デフォルト構築を利用)\\n rep(i,n)group[parent[i]].pb(i);\\n }\\n \\n //素集合系を削除して初期化\\n void clear(){\\n rep(i,n){parent[i]=i;}\\n siz=vector<ll>(n,1);\\n group.clear();\\n }\\n};\\n#pragma endregion UnionFind\\n#pragma region bisect\\n/*二分探索*/\\nll bisect_left(vll &array, ll key){\\n return lower_bound(all(array),key) - array.begin();\\n}\\n\\nll bisect_right(vll &array, ll key){\\n return upper_bound(all(array),key) - array.begin();\\n}\\n\\n/*最長増加部分列*/\\nll LIS(vll a){\\n vll dp(a.size(),INF);\\n rep(i,a.size()){\\n dp[bisect_right(dp,a[i])] = a[i];\\n }\\n return bisect_left(dp,INF);\\n}\\n/*条件を満たす最大のokを返す 最小にしたいならokng逆にする solveを書き換えること!*/\\nbool solve(ll n){\\n return true;\\n}\\n\\nll meguru_bisect(ll ok, ll ng){\\n ll mid;\\n while(abs(ok-ng) > 1){\\n mid = (ok + ng) / 2;\\n if(solve(mid)) ok = mid;\\n else ng = mid;\\n }\\n return ok;\\n}\\n#pragma endregion bisect\\n#pragma region others\\n\\n/* memo\\n\\n二次元配列の90度回転\\n// i:j \\n// j:N - i - 1\\n\\n\\n*/\\n\\n\\n\\n/*普通のa^n*/\\nll pow(ll a, ll n){\\n ll res = 1;\\n while (n > 0) {\\n if (n & 1) res *= a;\\n a *= a;\\n n >>= 1;\\n }\\n return res;\\n}\\n/*最大公約数*/\\nll gcd(ll x,ll y){\\n if (x < y) swap(x,y);\\n while (y > 0){\\n ll r = x % y;\\n x = y;\\n y = r;\\n }\\n return x;\\n}\\n\\n/*最小公倍数*/\\nll lcm(ll x,ll y){\\n return x * y / (gcd(x,y));\\n}\\n\\n/*約数列挙*/\\nvll divisor(ll n){\\n vll ret;\\n for (ll i = 1; i * i <= n; i++){\\n if (n % i == 0){\\n ret.pb(i);\\n if (i * i != n) ret.pb(n / i);\\n }\\n }\\n sort(all(ret));\\n return ret;\\n}\\n\\n/*素因数分解*/\\nvll factorize(ll n){\\n vll ret;\\n while (n % 2 == 0){\\n ret.pb(2);\\n n /= 2;\\n }\\n ll f = 3;\\n while (f * f <= n){\\n if (n % f == 0){\\n ret.pb(f);\\n n /= f;\\n }else f += 2;\\n }\\n if (n != 1) ret.pb(n);\\n return ret;\\n}\\nconst ll Eramax = 1e6+1;\\nvll Eratos(1,1);\\nvoid Erainit(){\\n Eratos.resize(Eramax+1);\\n rep(i,Eramax+1) Eratos[i] = i;\\n for(ll i=2;i<Eramax;i++){\\n if(Eratos[i] != i) continue;\\n for(ll j=2*i;j<Eramax;j+=i) Eratos[j] = i;\\n }\\n Eratos[1] = -1;\\n}\\n//前処理型素因数分解 1e6以下を複数回やるならこっち\\nvll Era_factorize(ll n){\\n if(Eratos[0] != 0) Erainit();\\n vll ret = {};\\n if(n==1) return ret;\\n while(n!=1){\\n ret.pb(Eratos[n]);\\n n /= Eratos[n];\\n }\\n return ret;\\n}\\n\\n#pragma endregion others\\n#pragma endregion fanction\\n\\n\\n\\n\\nint main() {\\n ll Q; cin >> N >> Q;\\n vll A(N); rep(i,N) cin >> A[i];\\n vll Sum = cumulatice_sum(A);\\n \\n rep(i,Q){\\n ll l,r; cin >> l >> r;\\n r--;\\n cout << A[l-1] - (Sum[r+1] - Sum[l]) << endl;\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 6300,\n \"score_of_the_acc\": -1.2368,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3186_5263075\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\nint main(){\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\tint n; cin >> n;\\n\\tint q; cin >> q;\\n\\tvector<ll> a(n);\\n\\tvector<ll> sum(n+1);\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tcin >> a[i];\\n\\t\\tsum[i+1]=sum[i]+a[i];\\n\\t}\\n\\twhile(q--){\\n\\t\\tint l,r; cin >> l >> r;\\n\\t\\tl--;\\n\\t\\tprintf(\\\"%lld\\\\n\\\",a[l]-(sum[r]-sum[l+1]));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5984,\n \"score_of_the_acc\": -0.5406,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3186_5150318\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nint main(){\\n int n,q;\\n cin >> n >> q;\\n vector<int> a(n);\\n for(int i=0; i<n; i++){\\n cin >> a[i];\\n }\\n vector<long long int> csum(n+1, 0);\\n for(int i=0; i<n; i++){\\n csum[i+1] = csum[i]+a[i];\\n }\\n for(int i=0; i<q; i++){\\n int l,r;\\n cin >> l >> r;\\n l--; r--;\\n cout << a[l] -(csum[r+1]-csum[l+1]) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 5472,\n \"score_of_the_acc\": -1.0187,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3186_5067504\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\nnamespace CharacterClass {\\n\\tconstexpr string_view\\n\\t digit = \\\"0123456789\\\",\\n\\t xdigit = \\\"0123456789ABCDEFabcdef\\\", lower = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n\\t upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n\\t alpha = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t alnum = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t word = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\\\",\\n\\t punct = R\\\"(!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~)\\\",\\n\\t graph =\\n\\t R\\\"(!\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t print =\\n\\t R\\\"( !\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t blank = \\\" \\\\t\\\", space = \\\" \\\\t\\\\n\\\\r\\\\f\\\\v\\\";\\n} // namespace CharacterClass\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Printer {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid print(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(bool v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(vector<bool>::reference v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid print(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid print(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid print(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void print(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\\n\\t\\tprint(v.first);\\n\\t\\tprint(D.d);\\n\\t\\tprint(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) print(D.d);\\n\\t\\t\\tprint(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void print(const vector<T>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void print(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) print(D.l);\\n\\t\\t\\tprint(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tPrinter() = default;\\n\\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tPrinter& operator()() {\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Printer& operator()(H&& h) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tprint_range(begin, end);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Printer& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tPrinter& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 7 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T = long long> constexpr T TEN(size_t n) {\\n\\tT result = 1;\\n\\tfor (size_t i = 0; i < n; ++i) result *= 10;\\n\\treturn result;\\n}\\ntemplate <class T, class U,\\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr auto div_ceil(T n, U m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> constexpr T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> constexpr T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T, class U, class V>\\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\\n\\treturn lower <= v && v < upper;\\n}\\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\\nconstexpr bool is_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> constexpr T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T> constexpr int BIT(T x, int i) {\\n\\treturn (x & (1 << i)) ? 1 : 0;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Pow(T a, U n) {\\n\\tassert(n >= 0);\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Powmod(T a, U n, T mod) {\\n\\tassert(n >= 0);\\n\\tif (a > mod) a %= mod;\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 3 \\\"/home/yuruhiya/programming/library/Utility/CulSum.cpp\\\"\\n#include <type_traits>\\n#line 5 \\\"/home/yuruhiya/programming/library/Utility/CulSum.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> class CulSum {\\npublic:\\n\\tusing value_type = T;\\n\\tusing data_type = vector<value_type>;\\n\\nprivate:\\n\\tsize_t n;\\n\\tdata_type data;\\n\\npublic:\\n\\tCulSum() = default;\\n\\tCulSum(const data_type& a) : n(a.size()), data(n + 1) {\\n\\t\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\t\\tdata[i + 1] = data[i] + a[i];\\n\\t\\t}\\n\\t}\\n\\ttemplate <class U, class F, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\n\\tCulSum(const U& _n, F f) : n(_n), data(n + 1) {\\n\\t\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\t\\tdata[i + 1] = data[i] + static_cast<value_type>(f(i));\\n\\t\\t}\\n\\t}\\n\\ttemplate <class U, class F, enable_if_t<!is_integral_v<U>, nullptr_t> = nullptr>\\n\\tCulSum(const U& a, F f)\\n\\t : CulSum(a.size(), [a, f](size_t i) -> value_type { return f(a[i]); }) {}\\n\\tsize_t size() const {\\n\\t\\treturn n;\\n\\t}\\n\\tvalue_type at(size_t i) const {\\n\\t\\treturn operator()(i, i + 1);\\n\\t}\\n\\t// [l, r)\\n\\tvalue_type operator()(size_t l, size_t r) const {\\n\\t\\tl = min(l, n);\\n\\t\\tr = min(r, n);\\n\\t\\treturn l > r ? 0 : data[r] - data[l];\\n\\t}\\n\\t// [0, r)\\n\\tvalue_type operator()(size_t r) const {\\n\\t\\tr = min(r, n);\\n\\t\\treturn data[r];\\n\\t}\\n\\tconst data_type& get_data() const {\\n\\t\\treturn data;\\n\\t}\\n};\\n#line 3 \\\"a.cpp\\\"\\n\\nint main() {\\n\\tini(n, q);\\n\\tVL a = in[n];\\n\\tCulSum<ll> sum(a);\\n\\trep(i, q) {\\n\\t\\tint l = in--, r = in;\\n\\t\\tout(a[l] - sum(l + 1, r));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6148,\n \"score_of_the_acc\": -0.4226,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3186_5043902\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(int)n;++i)\\n#define irep(i,a,b) for(int i=int(a);i<(int)b;++i)\\n#define rrep(i,a,b) for(int i=int(a);i>=(int)b;--i)\\n#define vi vector<int>\\n#define vvi vector<vector<int>>\\n#define vl vector<ll>\\n#define vvl vector<vector<ll>>\\n#define vvp vector<vector<pair<ll,ll>>>\\n#define vpl vector<pair<ll,ll>>\\n#define vpi vector<pair<int,int>>\\n#define pb push_back\\n#define se second\\n#define fi first\\n#define all(v) v.begin(),v.end()\\n#define v(T) vector<T>\\n#define vv(T) vector<vector<T>>\\n\\nusing namespace std;\\n\\ntemplate<typename T> istream& operator>>(istream&i,v(T)&v){rep(j,v.size())i>>v[j];return i;}\\ntemplate<typename T> string join(const v(T)&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\\ntemplate<typename T> ostream& operator<<(ostream&o,const v(T)&v){if(v.size())o<<join(v);return o;}\\n\\n\\n\\nusing ll = long long;\\nconst ll INF = 1e18;\\nconst double PI = acos(-1);\\n\\nconst ll mod = 1e9 + 7; //998244353;\\n\\ntemplate<class T> inline bool chmin(T& a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<class T> inline bool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n\\nll modpow(ll a,ll b){\\n if(b == 0){\\n return 1;\\n }\\n if(b%2 == 0){\\n ll tmp = modpow(a,b/2);\\n return tmp*tmp%mod;\\n }else{\\n return modpow(a,b-1)*a%mod;\\n }\\n\\n}\\n\\n\\n\\nint main(void)\\n{\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int n,q;\\n cin >> n >> q;\\n vl a(n),asum(n+1);\\n rep(i,n){\\n cin >> a[i];\\n asum[i+1] = asum[i] + a[i];\\n }\\n\\n vl ans;\\n rep(i,q){\\n int l,r;\\n cin >> l >> r;\\n ll s = -asum[r]+asum[l] + a[l-1];\\n ans.pb(s);\\n }\\n\\n rep(i,ans.size())cout << ans[i] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 8340,\n \"score_of_the_acc\": -1.5484,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3186_4985584\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#include <math.h>\\n#include <iomanip>\\n#include <cstdint>\\n#include <string>\\n#include <sstream>\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\ntypedef long long ll;\\nusing P = pair<int,int>;\\nconst int INF=1001001001;\\nconst int mod =1e9+7;\\n\\nint main() {\\n int N,Q;cin>>N>>Q;\\n vector<int>a(N+1);\\n for(int i=1;i<=N;i++){cin>>a[i];}\\n vector<ll>sum(N+1);\\n for(int i=1;i<=N;i++){sum[i]=sum[i-1]+a[i];}\\n for(int i=0;i<Q;i++){\\n int L,R;cin>>L>>R;\\n cout<<a[L]-(sum[R]-sum[L])<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 5492,\n \"score_of_the_acc\": -1.0239,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3186_4944013\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 200005\\n\\nint N,num_query;\\nll A[SIZE];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&N,&num_query);\\n\\n\\tA[0] = 0;\\n\\tfor(int i = 1; i <= N; i++){\\n\\n\\t\\tscanf(\\\"%lld\\\",&A[i]);\\n\\t\\tA[i] += A[i-1];\\n\\t}\\n\\n\\tint left,right;\\n\\n\\tfor(int loop = 0; loop < num_query; loop++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&left,&right);\\n\\n\\t\\tprintf(\\\"%lld\\\\n\\\",(A[left]-A[left-1])-(A[right]-A[left]));\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4776,\n \"score_of_the_acc\": -0.1901,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3186_4874327\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for(int i=0; i<(n); ++i)\\n\\nusing namespace std;\\ntypedef long long ll;\\n\\nconst int INTINF = INT_MAX >> 1;\\n\\nint main(){\\n\\n\\tint N, Q;\\n\\tcin >> N >> Q;\\n\\tvector<ll> v(N), H(N+1);\\n\\trep(i, N){\\n\\t\\tcin >> v[i];\\n\\t\\tH[i+1] = H[i] - v[i];\\n\\n\\t}\\n\\trep(i, Q){\\n\\t\\tint a, b; cin >> a >> b;\\n\\t\\tcout << - H[a-1] + H[b] + v[a-1] * 2 << endl;\\n\\t}\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 6204,\n \"score_of_the_acc\": -1.1792,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3186_4871195\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)\\n#define rep2(i, s, n) rep3(i, s, n, 1)\\n#define rep(i, n) rep2(i, 0, n)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing P = pair<int, int>;\\n\\nint main() { \\n int n, q;\\n cin >> n >> q;\\n vector<ll> rui;\\n ll total = 0;\\n rui.push_back(0);\\n rep(i, n){\\n ll a;\\n cin >> a;\\n total += a;\\n rui.push_back(total);\\n }\\n rep(i, q){\\n ll l, r;\\n cin >> l >> r;\\n cout << rui[l] - rui[l-1] - (rui[r] - rui[l]) << endl;\\n }\\n return 0; \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 5212,\n \"score_of_the_acc\": -0.9179,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3186_4866123\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define endl \\\"\\\\n\\\"\\n\\nsigned main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int N, Q;\\n vector<int> a, sum;\\n\\n cin>>N>>Q;\\n\\n a.resize(N);\\n sum.resize(N+1);\\n\\n for(int i = 0; i < N; i++){\\n cin>>a[i];\\n\\n sum[i+1] += sum[i] + a[i];\\n }\\n\\n for(int i =0; i < Q; i++){\\n int L, R;\\n\\n cin>>L>>R;\\n\\n L--, R--;\\n\\n int s = sum[R+1] - sum[L+1];\\n\\n cout<<a[L]-s<<endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 6000,\n \"score_of_the_acc\": -0.5126,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3186_4862671\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#ifdef _DEBUG\\n#include \\\"_DEBUG.hpp\\\"\\n#endif\\n#define int long long\\nusing namespace std;\\nusing P = pair<int, int>;\\nconst int inf = 1LL << 60;\\nconst int mod = 1e9 + 7;\\n\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v) {\\n for (T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate <class T>\\nvector<T> make_vec(size_t a) {\\n return vector<T>(a);\\n}\\n\\ntemplate <class T, class... Ts>\\nauto make_vec(size_t a, Ts... ts) {\\n return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\\n}\\n\\ntemplate <class T, class V>\\ntypename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate <class T, class V>\\ntypename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v) {\\n for (auto &e : t) fill(e, v);\\n}\\n\\nsigned main() {\\n \\n int n, q;\\n cin >> n >> q;\\n vector<int> a(n);\\n cin >> a;\\n\\n vector<int> imos(n + 1, 0);\\n for (int i = 1; i <= n; i++) {\\n imos[i] = imos[i-1] + a[i-1];\\n }\\n\\n for(int i = 0; i < q; i++){\\n int l, r;\\n cin >> l >> r;\\n int ans = a[l-1] - (imos[r] - imos[l]);\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 6240,\n \"score_of_the_acc\": -1.221,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3186_4861891\",\n \"code_snippet\": \"/**\\n * author: otera \\n**/\\n#include<iostream>\\n#include<string> \\n#include<cstdio>\\n#include<cstring>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm> \\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<deque>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\n#define int long long\\ntypedef long long ll;\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\ntypedef long double ld;\\nconst int inf=1e9+7;\\nconst ll INF=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-8;\\nconst ld pi = acos(-1.0);\\ntypedef pair<int, int> P;\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define pb push_back\\n#define debug(x) cerr << #x << \\\" = \\\" << (x) << endl;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nvoid solve() {\\n\\tint n, q; cin >> n >> q;\\n vector<int> a(n);\\n vector<int> sum(n + 1, 0);\\n rep(i, n) {\\n cin >> a[i];\\n sum[i + 1] = sum[i] + a[i];\\n }\\n rep(_, q) {\\n int l, r; cin >> l >> r;\\n -- l;\\n cout << a[l] - (sum[r] - sum[l + 1]) << endl;\\n }\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//int t; cin >> t; rep(i, t)solve();\\n\\tsolve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 6000,\n \"score_of_the_acc\": -1.0287,\n \"final_rank\": 12\n }\n]","isConversational":false}}},{"rowIdx":1998,"cells":{"group_id":{"kind":"string","value":"aoj_3184_cpp"},"problem_description":{"kind":"string","value":"M Hokkaido High School\n問題文\n北海道高校には $M$ 個の科目があり、それぞれ $1, 2, 3$ の $3$ 段階で成績がつけられます。\n各生徒の成績は長さ $M$ の文字列で表され、$i$ 文字目が科目 $i$ の成績を表します。\n生徒 $X$ が生徒 $Y$ の「上位互換」であるとは\nすべての科目 $i$ について ($X$ の科目 $i$ の成績) $\\geq$ ($Y$ の科目 $i$ の成績)\nある科目 $i$ が存在して。($X$ の科目 $i$ の成績) $>$ ($Y$ の科目 $i$ の成績)\nの両方がみたされることをいいます。\n今、教室には誰もいません。これから $Q$ 人の生徒が順に教室に入ってきます。$i$ 番目の生徒の成績は文字列 $S_i$ で表されます。各生徒は、自分が教室に入ったときに教室に自分の上位互換が存在していると悲しくなります。\n$Q$ 人それぞれの生徒について、悲しくなるかどうかを判定してください。\n入力\n入力は以下の形式で標準入力から与えられる。\n$Q$ $M$\n$S_1$\n$S_2$\n$\\vdots$\n$S_Q$\n制約\n$1 \\leq Q \\leq 5\\times 10^5$\n$1 \\leq M \\leq 15$\n$|S_i| = M$\n$S_i$ は\n1\n、\n2\n、\n3\nからなる文字列\n出力\n長さ $Q$ の文字列 $T$ を $1$ 行に出力せよ。\n$T$ の $i$ 文字目は生徒 $i$ が悲しくなるなら\n1\n、そうでないなら\n0\nとせよ。\n入力例1\n5 3\n123\n321\n112\n221\n333\n出力例1\n00110\n生徒 $1$ が生徒 $3$ の上位互換であるため生徒 $3$ は悲しいです。\n生徒 $2$ が生徒 $4$ の上位互換であるため生徒 $4$ は悲しいです。\n生徒 $5$ は生徒 $1$ の上位互換ですが、生徒 $1$ が教室に入ったときには生徒 $5$ はいないので生徒 $1$ は悲しくなりません。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3184_10422733","code_snippet":"#define INF 4'000'000'000'000'000'037LL\n#include <bits/stdc++.h>\nusing namespace std;\nnamespace {\nusing ll = long long;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pll = pair<ll, ll>;\n#define vc vector\ntemplate <class T>\nusing vvc = vc<vc<T>>;\nusing vl = vc<ll>;\nusing vpll = vc<pll>;\n#ifdef __SIZEOF_INT128__\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\n#endif\n#define cauto const auto\n#define overload4(_1, _2, _3, _4, name, ...) name\n#define rep1(i, n) for (ll i = 0, nnnnn = ll(n); i < nnnnn; i++)\n#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)\n#define repi1(i, n) for (int i = 0, nnnnn = int(n); i < nnnnn; i++)\n#define repi2(i, l, r) for (int i = int(l), rrrrr = int(r); i < rrrrr; i++)\n#define repi3(i, l, r, d) for (int i = int(l), rrrrr = int(r), ddddd = int(d); ddddd > 0 ? i < rrrrr : i > rrrrr; i += d)\n#define repi(...) overload4(__VA_ARGS__, repi3, repi2, repi1)(__VA_ARGS__)\n#define fem(...) for (auto &__VA_ARGS__)\ntemplate <class T, class U>\ninline bool chmin(T &a, U b) { return a > b ? a = b, true : false; }\ntemplate <class T = ll, class U, class V>\ninline constexpr T divfloor(U a, V b) { return T(a) / T(b) - (T(a) % T(b) && (T(a) ^ T(b)) < 0); }\ntemplate <class T = ll, class U, class V>\ninline constexpr T safemod(U a, V b) { return T(a) - T(b) * divfloor<T>(a, b); }\ntemplate <class T = ll, class U, class V>\nconstexpr T ipow(U a, V b)\n{\n assert(b >= 0);\n if (b == 0)\n return 1;\n if (a == 0 || a == 1)\n return a;\n if (a < 0 && a == -1)\n return b & 1 ? -1 : 1;\n T res = 1, tmp = a;\n while (true)\n {\n if (b & 1)\n res *= tmp;\n b >>= 1;\n if (b == 0)\n break;\n tmp *= tmp;\n }\n return res;\n}\ntemplate <class T = ll, class A, class B, class M>\nT mul_limited(A a, B b, M m)\n{\n assert(a >= 0 && b >= 0 && m >= 0);\n if (b == 0)\n return 0;\n return T(a) > T(m) / T(b) ? T(m) : T(a) * T(b);\n}\ntemplate <class T = ll, class A, class B>\nT mul_limited(A a, B b) { return mul_limited<T>(a, b, INF); }\ntemplate <class T = ll, class A, class B, class M>\nT pow_limited(A a, B b, M m)\n{\n assert(a >= 0 && b >= 0 && m >= 0);\n if (a <= 1 || b == 0)\n return min(ipow<T>(a, b), T(m));\n T res = 1, tmp = a;\n while (true)\n {\n if (b & 1)\n {\n if (res > T(m) / tmp)\n return m;\n res *= tmp;\n }\n b >>= 1;\n if (b == 0)\n break;\n if (tmp > T(m) / tmp)\n return m;\n tmp *= tmp;\n }\n return res;\n}\ntemplate <class T = ll, class A, class B>\nT pow_limited(A a, B b) { return pow_limited<T>(a, b, INF); }\ntemplate <class T = ll, class U, class V>\nvc<T> base_repr(U val, V base)\n{\n assert(val >= 0);\n assert(base >= 2);\n if (val == 0)\n return {0};\n vc<T> a;\n while (val > 0)\n {\n a.emplace_back(val % base);\n val /= base;\n }\n reverse(a.begin(), a.end());\n return a;\n}\ntemplate <class T = ll, class U, class V>\nvc<T> base_repr(U val, V base, int n)\n{\n assert(val >= 0);\n assert(base >= 2);\n assert(n >= 0);\n vc<T> a(n);\n repi(i, n)\n {\n a[i] = val % base;\n val /= base;\n }\n reverse(a.begin(), a.end());\n return a;\n}\n#define ALL(a) (a).begin(), (a).end()\ntemplate <class T, size_t d, size_t i = 0, class V>\nauto dvec(const V (&sz)[d], const T &init)\n{\n if constexpr (i < d)\n return vc(sz[i], dvec<T, d, i + 1>(sz, init));\n else\n return init;\n}\ntemplate <class V>\nV reversed(const V &v) { return V(v.rbegin(), v.rend()); }\n#if __cplusplus < 202002L\n#else\n#endif\ntemplate <class V>\nvoid unique(V &v) { v.erase(std::unique(ALL(v)), v.end()); }\ntemplate <class V, class U>\nvoid rotate(V &v, U k)\n{ \n const U n = v.size();\n k = (k % n + n) % n;\n std::rotate(v.begin(), v.begin() + k, v.end());\n}\ntemplate <class T, const T infty = INF>\nstruct MonoidMin\n{\n using S = T;\n static constexpr S op(S a, S b) { return min(a, b); }\n};\nconst vpll DRULgrid = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\nconst vpll DRULplane = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}};\ntemplate <class T>\nstruct is_random_access_iterator\n{\n static constexpr bool value = is_same_v<\n typename iterator_traits<T>::iterator_category,\n random_access_iterator_tag\n >;\n};\ntemplate <class T>\nconstexpr bool is_random_access_iterator_v = is_random_access_iterator<T>::value;\n#if __cplusplus < 202002L\nnamespace internal\n{\n};\n#else\n#endif\n#if __cplusplus < 202002L\n#else\ninline constexpr ll bit_width(ll x) { return std::bit_width((ull)x); }\ninline constexpr ll bit_floor(ll x) { return std::bit_floor((ull)x); }\ninline constexpr ll bit_ceil(ll x) { return std::bit_ceil((ull)x); }\ninline constexpr ll countr_zero(ll x) { assert(x != 0); return std::countr_zero((ull)x); }\ninline constexpr ll popcount(ll x) { return std::popcount((ull)x); }\ninline constexpr bool has_single_bit(ll x) { return std::has_single_bit((ull)x); }\n#endif\n#define dump(...)\n#define oj(...) __VA_ARGS__\nnamespace fastio {\nstatic constexpr uint32_t SIZ = 1 << 17;\nchar ibuf[SIZ];\nchar obuf[SIZ];\nchar out[100];\nuint32_t pil = 0, pir = 0, por = 0;\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\ninline void load() {\n memcpy(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SIZ - pir + pil, stdin);\n pil = 0;\n if (pir < SIZ) ibuf[pir++] = '\\n';\n}\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\nvoid rd1(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir) load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir) load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\ntemplate <typename T>\nvoid rd1_integer(T &x) {\n if (pil + 100 > pir) load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') { minus = 1, c = ibuf[pil++]; }\n }\n x = 0;\n while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus) x = -x;\n }\n}\nvoid rd1(ll &x) { rd1_integer(x); }\ntemplate <class T, class U>\nvoid rd1(pair<T, U> &p) {\n return rd1(p.first), rd1(p.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid rd1_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd1(x);\n rd1_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid rd1(tuple<T...> &tpl) {\n rd1_tuple(tpl);\n}\ntemplate <size_t N = 0, typename T>\nvoid rd1(array<T, N> &x) {\n for (auto &d: x) rd1(d);\n}\ntemplate <class T>\nvoid rd1(vc<T> &x) {\n for (auto &d: x) rd1(d);\n}\nvoid read() {}\ntemplate <class H, class... T>\nvoid read(H &h, T &... t) {\n rd1(h), read(t...);\n}\nvoid wt1(const char c) {\n if (por == SIZ) flush();\n obuf[por++] = c;\n}\nvoid wt1(const string s) {\n for (char c: s) wt1(c);\n}\ntemplate <typename T>\nvoid wt1_integer(T x) {\n if (por > SIZ - 100) flush();\n if (x < 0) { obuf[por++] = '-', x = -x; }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, int> = 0>\nvoid wt1(T x) { wt1_integer(x); }\ntemplate <class T, class U>\nvoid wt1(const pair<T, U> &val) {\n wt1(val.first);\n wt1(' ');\n wt1(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt1_tuple(const T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt1(' '); }\n const auto x = std::get<N>(t);\n wt1(x);\n wt1_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt1(const tuple<T...> &tpl) {\n wt1_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt1(const array<T, S> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt1(' ');\n wt1(val[i]);\n }\n}\ntemplate <class T>\nvoid wt1(const vector<T> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt1(' ');\n wt1(val[i]);\n }\n}\nvoid print() { wt1('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt1(head);\n if (sizeof...(Tail)) wt1(' ');\n print(forward<Tail>(tail)...);\n}\n} // namespace fastio\nstruct Dummy {\n Dummy() { atexit(fastio::flush); }\n} dummy;\nnamespace internal\n{\ntemplate <class... Ts>\nvoid READnodump(Ts &...a) { fastio::read(a...); }\ntemplate <class T>\nvoid READVECnodump(int n, vc<T> &v)\n{\n v.resize(n);\n READnodump(v);\n}\ntemplate <class T, class... Ts>\nvoid READVECnodump(int n, vc<T> &v, vc<Ts> &...vs)\n{ READVECnodump(n, v), READVECnodump(n, vs...); }\ntemplate <class T>\nvoid READVEC2nodump(int n, int m, vvc<T> &v)\n{\n v.assign(n, vc<T>(m));\n READnodump(v);\n}\ntemplate <class T, class... Ts>\nvoid READVEC2nodump(int n, int m, vvc<T> &v, vvc<Ts> &...vs)\n{ READVEC2nodump(n, m, v), READVEC2nodump(n, m, vs...); }\ntemplate <class T>\nvoid READJAGnodump(int n, vvc<T> &v)\n{\n v.resize(n);\n repi(i, n)\n {\n int k;\n READnodump(k);\n READVECnodump(k, v[i]);\n }\n}\ntemplate <class T, class... Ts>\nvoid READJAGnodump(int n, vvc<T> &v, vvc<Ts> &...vs)\n{ READJAGnodump(n, v), READJAGnodump(n, vs...); }\n}; // namespace internal\n#define READ(...) internal::READnodump(__VA_ARGS__); dump(__VA_ARGS__)\n#define IN(T, ...) T __VA_ARGS__; READ(__VA_ARGS__)\n#define LL(...) IN(ll, __VA_ARGS__)\n#define READVEC(...) internal::READVECnodump(__VA_ARGS__); dump(__VA_ARGS__)\n#define VEC(T, n, ...) vc<T> __VA_ARGS__; READVEC(n, __VA_ARGS__)\n#define PRINT fastio::print\ntemplate <class T, class U, class P>\npair<T, U> operator+=(pair<T, U> &a, const P &b)\n{\n a.first += b.first;\n a.second += b.second;\n return a;\n}\ntemplate <class T, class U, class P>\npair<T, U> operator+(pair<T, U> &a, const P &b) { return a += b; }\ntemplate <class T, size_t n, class A>\narray<T, n> operator+=(array<T, n> &a, const A &b)\n{\n for (size_t i = 0; i < n; i++)\n a[i] += b[i];\n return a;\n}\ntemplate <class T, size_t n, class A>\narray<T, n> operator+(array<T, n> &a, const A &b) { return a += b; }\nnamespace internal\n{\ntemplate <size_t... I, class A, class B>\nauto tuple_add_impl(A &a, const B &b, const index_sequence<I...>)\n{\n ((get<I>(a) += get<I>(b)), ...);\n return a;\n}\n}; // namespace internal\ntemplate <class... Ts, class Tp>\ntuple<Ts...> operator+=(tuple<Ts...> &a, const Tp &b)\n{ return internal::tuple_add_impl(a, b, make_index_sequence<tuple_size_v<tuple<Ts...>>>{}); }\ntemplate <class... Ts, class Tp>\ntuple<Ts...> operator+(tuple<Ts...> &a, const Tp &b) { return a += b; }\nnamespace internal\n{\n};\nmt19937_64 mt;\nnamespace internal\n{\nconstexpr ll powmod32_constexpr(ll x, ll n, int m)\n{\n if (m == 1)\n return 0;\n uint _m = (uint)m;\n ull r = 1;\n ull y = safemod(x, m);\n while (n)\n {\n if (n & 1)\n r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\nconstexpr bool isprime32_constexpr(int n)\n{\n if (n <= 1)\n return false;\n if (n == 2 || n == 7 || n == 61)\n return true;\n if (n % 2 == 0)\n return false;\n ll d = n - 1;\n while (d % 2 == 0)\n d /= 2;\n constexpr ll bases[3] = {2, 7, 61};\n for (ll a : bases)\n {\n ll t = d;\n ll y = powmod32_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1)\n {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0)\n return false;\n }\n return true;\n}\ntemplate <int n>\nconstexpr bool isprime32 = isprime32_constexpr(n);\nstruct barrett32\n{\n uint m;\n ull im;\n explicit barrett32(uint m) : m(m), im((ull)(-1) / m + 1) {}\n uint umod() const { return m; }\n uint mul(uint a, uint b) const\n {\n ull z = a;\n z *= b;\n ull x = (ull)((u128(z)*im) >> 64);\n ull y = x * m;\n return (uint)(z - y + (z < y ? m : 0));\n }\n};\n}\nnamespace internal\n{\n#define REF static_cast<mint &>(*this)\n#define CREF static_cast<const mint &>(*this)\n#define VAL *static_cast<const mint *>(this)\ntemplate <class mint>\nstruct modint_base\n{\n mint &operator+=(const mint &rhs)\n {\n mint &self = REF;\n self._v += rhs._v;\n if (self._v >= self.umod())\n self._v -= self.umod();\n return self;\n }\n mint &operator-=(const mint &rhs)\n {\n mint &self = REF;\n self._v -= rhs._v;\n if (self._v >= self.umod())\n self._v += self.umod();\n return self;\n }\n mint &operator/=(const mint &rhs)\n {\n mint &self = REF;\n return self = self * rhs.inv();\n }\n mint &operator++()\n {\n mint &self = REF;\n self._v++;\n if (self._v == self.umod())\n self._v = 0;\n return self;\n }\n mint &operator--()\n {\n mint &self = REF;\n if (self._v == 0)\n self._v = self.umod();\n self._v--;\n return self;\n }\n mint operator++(int)\n {\n mint res = VAL;\n ++REF;\n return res;\n }\n mint operator--(int)\n {\n mint res = VAL;\n --REF;\n return res;\n }\n mint operator+() const { return VAL; }\n mint operator-() const { return mint() - VAL; }\n mint pow(ll n) const\n {\n assert(n >= 0);\n mint x = VAL, r = 1;\n while (n)\n {\n if (n & 1)\n r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n friend mint operator+(const mint &lhs, const mint &rhs)\n { return mint(lhs) += rhs; }\n friend mint operator-(const mint &lhs, const mint &rhs)\n { return mint(lhs) -= rhs; }\n friend mint operator*(const mint &lhs, const mint &rhs)\n { return mint(lhs) *= rhs; }\n friend mint operator/(const mint &lhs, const mint &rhs)\n { return mint(lhs) /= rhs; }\n friend bool operator==(const mint &lhs, const mint &rhs)\n { return mint(lhs).eq(rhs); }\n friend bool operator!=(const mint &lhs, const mint &rhs)\n { return mint(lhs).neq(rhs); }\nprivate:\n bool eq(const mint &rhs) { return REF._v == rhs._v; }\n bool neq(const mint &rhs) { return REF._v != rhs._v; }\n};\n}\ntemplate <typename T, std::enable_if_t<std::is_base_of_v<internal::modint_base<T>, T>, int> = 0>\nvoid rd1(T &x)\n{\n ll a;\n fastio::rd1(a);\n x = a;\n}\ntemplate <typename T, std::enable_if_t<std::is_base_of_v<internal::modint_base<T>, T>, int> = 0>\nvoid wt1(const T &x) { fastio::wt1(x.val()); }\ntemplate <class T = ll>\nconstexpr tuple<T, T, T> extgcd(const T &a, const T &b)\n{\n if (a == 0 && b == 0)\n return {0, 0, 0};\n T x1 = 1, y1 = 0, z1 = a;\n T x2 = 0, y2 = 1, z2 = b;\n while (z2 != 0)\n {\n T q = z1 / z2;\n tie(x1, x2) = make_pair(x2, x1 - q * x2);\n tie(y1, y2) = make_pair(y2, y1 - q * y2);\n tie(z1, z2) = make_pair(z2, z1 - q * z2);\n }\n if (z1 < 0)\n x1 = -x1, y1 = -y1, z1 = -z1;\n return {z1, x1, y1};\n}\ntemplate <int m>\nstruct static_modint : internal::modint_base<static_modint<m>>\n{\n using mint = static_modint;\nprivate:\n friend struct internal::modint_base<static_modint<m>>;\n uint _v;\n static constexpr uint umod() { return m; }\n static constexpr bool prime = internal::isprime32<m>;\npublic:\n static constexpr int mod() { return m; }\n static mint raw(int v)\n {\n mint x;\n x._v = v;\n return x;\n }\n static_modint() : _v(0) {}\n template <class T>\n static_modint(T v)\n {\n if constexpr (is_signed_v<T>)\n {\n ll x = (ll)(v % (ll)(umod()));\n if (x < 0)\n x += umod();\n _v = (uint)x;\n }\n else if constexpr (is_unsigned_v<T>)\n {\n _v = (uint)(v % umod());\n }\n else\n {\n static_assert(is_signed_v<T> || is_unsigned_v<T>, \"Unsupported Type\");\n }\n }\n int val() const { return (int)_v; }\n mint& operator*=(const mint &rhs)\n {\n ull z = _v;\n z *= rhs._v;\n _v = (uint)(z % umod());\n return *this;\n }\n mint inv() const\n {\n if (prime)\n {\n assert(_v != 0);\n return CREF.pow(umod() - 2);\n }\n else\n {\n auto [g, x, y] = extgcd<int>(_v, m);\n assert(g == 1);\n return x;\n }\n }\n};\ntemplate <int id>\nstruct dynamic_modint : internal::modint_base<dynamic_modint<id>>\n{\n using mint = dynamic_modint;\nprivate:\n friend struct internal::modint_base<dynamic_modint<id>>;\n uint _v;\n static internal::barrett32 bt;\n static uint umod() { return bt.umod(); }\npublic:\n static int mod() { return (int)(bt.umod()); }\n static mint raw(int v)\n {\n mint x;\n x._v = v;\n return x;\n }\n dynamic_modint() : _v(0) {}\n template <class T>\n dynamic_modint(T v)\n {\n if constexpr (is_signed_v<T>)\n {\n ll x = (ll)(v % (ll)(umod()));\n if (x < 0)\n x += umod();\n _v = (uint)x;\n }\n else if constexpr (is_unsigned_v<T>)\n {\n _v = (uint)(v % umod());\n }\n else\n {\n static_assert(is_signed_v<T> || is_unsigned_v<T>, \"Unsupported Type\");\n }\n }\n int val() const { return (int)_v; }\n mint& operator*=(const mint &rhs)\n {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint inv() const\n {\n auto [g, x, y] = extgcd<int>(_v, mod());\n assert(g == 1);\n return x;\n }\n};\ntemplate <int id>\ninternal::barrett32 dynamic_modint<id>::bt(998244353);\nusing modint = dynamic_modint<-1>;\ntemplate <class T>\nstruct is_static_modint : false_type {};\ntemplate <int m>\nstruct is_static_modint<static_modint<m>> : true_type {};\ntemplate <class T>\ninline constexpr bool is_static_modint_v = is_static_modint<T>::value;\ntemplate <class T>\nstruct is_dynamic_modint : false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : true_type {};\ntemplate <class T>\ninline constexpr bool is_dynamic_modint_v = is_dynamic_modint<T>::value;\ntemplate <class T>\nstruct PowerTable\n{\nprivate:\n decltype(T::mod()) mod;\n T base;\n vc<T> pw;\npublic:\n PowerTable() {}\n PowerTable(T base) : mod(T::mod()), base(base), pw(1, 1) {}\n void reserve(int n)\n {\n if (mod != T::mod())\n {\n mod = T::mod();\n pw = {1};\n }\n int i = pw.size();\n if (n < i)\n return;\n pw.resize(n + 1);\n for (; i <= n; i++)\n pw[i] = pw[i - 1] * base;\n }\n T pow(int n)\n {\n reserve(n);\n return pw[n];\n }\n};\ntemplate <class T>\nstruct Binomial\n{\nprivate:\n static decltype(T::mod()) mod;\n static vc<T> fac_, finv_, inv_;\npublic:\n static void reserve(int n)\n {\n if (mod != T::mod())\n {\n mod = T::mod();\n fac_ = {1, 1}, finv_ = {1, 1}, inv_ = {0, 1};\n }\n int i = fac_.size();\n chmin(n, T::mod() - 1);\n if (n < i)\n return;\n fac_.resize(n + 1), finv_.resize(n + 1), inv_.resize(n + 1);\n for (; i <= n; i++)\n {\n fac_[i] = fac_[i - 1] * T::raw(i);\n inv_[i] = -inv_[T::mod() % i] * T::raw(T::mod() / i);\n finv_[i] = finv_[i - 1] * inv_[i];\n }\n }\n static T inv(T n)\n {\n assert(n != 0);\n reserve(n.val());\n return inv_[n.val()];\n }\n};\ntemplate <class T> decltype(T::mod()) Binomial<T>::mod{};\ntemplate <class T> vc<T> Binomial<T>::fac_{};\ntemplate <class T> vc<T> Binomial<T>::finv_{};\ntemplate <class T> vc<T> Binomial<T>::inv_{};\nusing mint = modint;\ntemplate <int k, class F, class T>\nvoid tensor_power_array_destructive(const F &linear_map, vc<T> &v)\n{\n const int len = v.size();\n if (len == 0)\n return;\n {\n int len_ = len;\n while (len_ % k == 0)\n len_ /= k;\n assert(len_ == 1 && \"v.size() must be a power of k\");\n }\n for (int d = 1; d < len; d *= k)\n {\n repi(iu, 0, len, d * k) repi(i, iu, iu + d)\n {\n array<T, k> tmp;\n repi(j, k) tmp[j] = v[i + j * d];\n tmp = linear_map(tmp);\n repi(j, k) v[i + j * d] = tmp[j];\n }\n }\n}\ntemplate <class M, int k>\nvoid zeta_supset_general_destructive(vc<typename M::S> &a)\n{\n using S = typename M::S;\n auto linear_map = [&](array<S, k> &arr) -> array<S, k>\n {\n repi(i, k - 2, -1, -1) arr[i] = M::op(arr[i], arr[i + 1]);\n return arr;\n };\n tensor_power_array_destructive<k>(linear_map, a);\n}\ntemplate <class M, int k>\nvc<typename M::S> zeta_supset_general(vc<typename M::S> a)\n{\n zeta_supset_general_destructive<M, k>(a);\n return a;\n}\nvoid init()\n{\n oj(mt.seed(random_device()()));\n}\nvoid main2()\n{\n LL(Q, M);\n VEC(string, Q, S);\n fem(s : S) rep(i, M) s.at(i)--;\n vl A(Q);\n rep(i, Q) A.at(i) = stol(S.at(i), nullptr, 3);\n dump(S, A);\n vl f(ipow(3, M), INF);\n rep(i, Q) chmin(f.at(A.at(i)), i);\n auto g = zeta_supset_general<MonoidMin<ll>, 3>(f);\n dump(g | cp::index());\n string ans(Q, '0');\n rep(i, Q)\n {\n vl s = reversed(base_repr(A.at(i), 3, M));\n rep(j, M)\n {\n if (s.at(j) == 2)\n continue;\n ll na = A.at(i) + ipow(3, j);\n dump(s, A.at(i), na);\n if (g.at(na) < i)\n ans.at(i) = '1';\n }\n }\n PRINT(ans);\n}\nvoid test()\n{\n}\ntemplate <auto init, auto main2, auto test>\nstruct Main\n{\n Main()\n {\n cauto CERR = [](string val, string color)\n {\n string s = \"\\033[\" + color + \"m\" + val + \"\\033[m\";\n /* コードテストで確認する際にコメントアウトを外す\n cerr << val;\n //*/\n };\n CERR(\"\\n[FAST_IO]\\n\\n\", \"32\");\n cout << fixed << setprecision(20);\n test();\n init();\n CERR(\"\\n[SINGLE_TESTCASE]\\n\\n\", \"36\");\n main2();\n }\n};\nMain<init, main2, test> main_dummy;\n}\nint main() {}","accuracy":1,"time_ms":460,"memory_kb":248120,"score_of_the_acc":-1.0717,"final_rank":16},{"submission_id":"aoj_3184_10270988","code_snippet":"// AOJ #3184 Hokkaido High School\n// 2025.3.6\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nint M;\n\nstruct Node {\n int c[3];\n int sub;\n bool end;\n};\n\nvector<Node> tr;\n\nint newNode(){\n Node nd;\n for(int i = 0; i < 3; i++) nd.c[i] = -1;\n nd.sub = 0;\n nd.end = false;\n tr.push_back(nd);\n return (int)tr.size() - 1;\n}\n\nbool queryDom(int idx, int d, bool str, const int *v){\n if(d == M) return (str && tr[idx].end);\n for(int i = v[d]; i < 3; i++){\n int nxt = tr[idx].c[i];\n if(nxt == -1) continue;\n bool nstr = str || (i > v[d]);\n if(queryDom(nxt, d+1, nstr, v)) return true;\n }\n return false;\n}\n\nvoid insertTrie(const int *v){\n int idx = 0;\n tr[idx].sub++;\n for (int d = 0; d < M; d++){\n int s = v[d];\n if(tr[idx].c[s] == -1){\n int nxt = newNode();\n tr[idx].c[s] = nxt;\n }\n idx = tr[idx].c[s];\n tr[idx].sub++;\n }\n if(!tr[idx].end) tr[idx].end = true;\n}\n\nint removeDom(int idx, int d, bool str, const int *v){\n int rem = 0;\n if(d == M){\n if(str && tr[idx].end){\n tr[idx].end = false;\n rem = 1;\n }\n tr[idx].sub = (tr[idx].end ? 1 : 0);\n return rem;\n }\n for(int i = 0; i <= v[d] && i < 3; i++){\n int nxt = tr[idx].c[i];\n if(nxt == -1) continue;\n bool nstr = str || (i < v[d]);\n rem += removeDom(nxt, d+1, nstr, v);\n if(tr[nxt].sub == 0) tr[idx].c[i] = -1;\n }\n int sum = (tr[idx].end ? 1 : 0);\n for(int i = 0; i < 3; i++){\n int nxt = tr[idx].c[i];\n if(nxt != -1) sum += tr[nxt].sub;\n }\n tr[idx].sub = sum;\n return rem;\n}\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int Q;\n cin >> Q >> M;\n tr.reserve(1000000);\n newNode();\n\n string ans; ans.resize(Q);\n int v[20];\n\n for (int qi = 0; qi < Q; qi++){\n string s;\n cin >> s;\n for (int i = 0; i < M; i++) v[i] = s[i] - '1';\n bool sad = false;\n if(tr[0].sub > 0 && queryDom(0, 0, false, v)) sad = true;\n ans[qi] = sad ? '1' : '0';\n\n if(!sad){\n removeDom(0, 0, false, v);\n int idx = 0; bool found = true;\n for (int i = 0; i < M; i++){\n int d = v[i];\n if(tr[idx].c[d] == -1){ found = false; break; }\n idx = tr[idx].c[d];\n }\n if(found && tr[idx].end);\n else insertTrie(v);\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":300,"memory_kb":7624,"score_of_the_acc":-0.0111,"final_rank":1},{"submission_id":"aoj_3184_10116573","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nbool mark[14348908];\nint st[15];\n\nvoid less_mark(int num) {\n if (mark[num]) return;\n mark[num] = true;\n int c = num;\n int i = 0;\n while (c) {\n if (c % 3) less_mark(num - st[i]);\n i++;\n c /= 3;\n }\n}\n\nint main() {\n int q, m;\n cin >> q >> m;\n st[0] = 1;\n for (int i = 1; i < 15; i++) st[i] = st[i - 1] * 3;\n while (q--) {\n string s;\n cin >> s;\n int num = 0;\n for (int i = 0; i < m; i++) {\n num *= 3;\n num += s[i] - '1';\n }\n if (mark[num]) cout << 1;\n else {\n less_mark(num);\n mark[num] = false;\n cout << 0;\n }\n }\n cout << endl;\n}","accuracy":1,"time_ms":1210,"memory_kb":17432,"score_of_the_acc":-0.4595,"final_rank":2},{"submission_id":"aoj_3184_6452181","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline ll time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nconst int N = 14348907; // 3^15\nconst int inf = (1<<30);\nint a[N],dp[N];\n\nint s3toi(string s){\n int res = 0;\n for(char c:s){\n res = res*3 + (c-'1');\n }\n return res;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,m; cin >> n >> m;\n for(int i=0;i<N;i++){\n a[i] = dp[i] = inf;\n }\n vector<string> s(n);\n for(int i=0;i<n;i++){\n cin >> s[i];\n int u = s3toi(s[i]);\n a[u] = min(a[u],i);\n }\n for(int i=N-1;i>=0;i--){\n int base = 1;\n int k = i;\n int p = 0;\n for(int j=0;j<m;j++){\n int bit = k%3;\n if(bit != 2){\n int c = (k+1)*base + p;\n if(c<N)dp[i] = min(dp[i], a[c]);\n if(c<N)dp[i] = min(dp[i], dp[c]);\n }\n p += base*bit;\n base *= 3;\n k /= 3;\n }\n }\n for(int i=0;i<n;i++){\n int u = s3toi(s[i]);\n if(dp[u] < i){\n cout << \"1\";\n }\n else{\n cout << \"0\";\n }\n }\n cout << \"\\n\";\n}","accuracy":1,"time_ms":610,"memory_kb":130804,"score_of_the_acc":-0.6566,"final_rank":4},{"submission_id":"aoj_3184_5306157","code_snippet":"#include <bits/stdc++.h>\n\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\n#define rep(i, n) For((i), 0, (n))\n#define rrep(i, n) rFor((i), (n), 0)\n#define fi first\n#define se second\n\nusing namespace std;\n\ntypedef long long lint;\ntypedef unsigned long long ulint;\ntypedef pair<int, int> pii;\ntypedef pair<lint, lint> pll;\n\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\nT div_floor(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a >= 0 ? a / b : (a + 1) / b - 1;\n}\ntemplate <class T>\nT div_ceil(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a > 0 ? (a - 1) / b + 1 : a / b;\n}\n\ntemplate <typename T>\nstruct coord_comp {\n vector<T> v;\n bool sorted = false;\n\n coord_comp() {}\n\n int size() { return v.size(); }\n\n void add(T x) { v.push_back(x); }\n\n void build() {\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n sorted = true;\n }\n\n int get_idx(T x) {\n assert(sorted);\n return lower_bound(v.begin(), v.end(), x) - v.begin();\n }\n};\n\nconstexpr lint mod = 1000000007;\nconstexpr lint INF = mod * mod;\nconstexpr int MAX = 200010;\n\nint high[15000000], same[15000000], pow3[16];\n\nint get_bit(int S, int i) { return S / pow3[i] % 3; }\n\nint main() {\n pow3[0] = 1;\n For(i, 1, 16) pow3[i] = pow3[i - 1] * 3;\n\n int q, m;\n scanf(\"%d%d\", &q, &m);\n rep(S, pow3[m]) high[S] = same[S] = mod;\n int s[q];\n rep(i, q) {\n string t;\n cin >> t;\n s[i] = 0;\n rep(j, m) s[i] += pow3[j] * (t[j] - '1');\n chmin(same[s[i]], i);\n }\n\n rrep(S, pow3[m]) {\n chmin(same[S], high[S]);\n if (same[S] < mod) {\n rep(i, m) if (get_bit(S, i)) {\n int T = S - pow3[i];\n chmin(high[T], same[S]);\n }\n }\n }\n\n rep(i, q) printf(\"%d\", high[s[i]] < i);\n printf(\"\\n\");\n}","accuracy":1,"time_ms":1050,"memory_kb":120168,"score_of_the_acc":-0.8102,"final_rank":11},{"submission_id":"aoj_3184_4964791","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 500005\n\nint Q,M;\nint dp[14348907];\nint POW[16];\nint CODE[SIZE];\nstring input_str[SIZE];\n\n\nint makeCode(string tmp_str){\n\n\tint ret = 0;\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tret = 3*ret+(tmp_str[i]-'1');\n\t}\n\n\treturn ret;\n}\n\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i <= 15; i++){\n\n\t\tPOW[i] = POW[i-1]*3;\n\t}\n\n\tscanf(\"%d %d\",&Q,&M);\n\n\tfor(int i = 0; i < POW[M]; i++){\n\n\t\tdp[i] = BIG_NUM;\n\t}\n\n\tfor(int i = 0; i < Q; i++){\n\n\t\tcin >> input_str[i];\n\t\tCODE[i] = makeCode(input_str[i]);\n\n\t\tdp[CODE[i]] = min(dp[CODE[i]],i);\n\t}\n\n\tfor(int state = POW[M]-1; state >= 0; state--){\n\t\tfor(int loop = M-1; loop >= 0; loop--){\n\t\t\tif((state/POW[loop])%3 == 2)continue;\n\n\t\t\tdp[state] = min(dp[state],dp[state+POW[loop]]);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < Q; i++){\n\t\tint tmp = BIG_NUM;\n\t\tfor(int loop = M-1; loop >= 0; loop--){\n\t\t\tif((CODE[i]/POW[loop])%3 == 2)continue;\n\n\t\t\ttmp = min(tmp,dp[CODE[i]+POW[loop]]);\n\t\t}\n\t\tif(tmp < i){\n\n\t\t\tprintf(\"1\");\n\t\t}else{\n\n\t\t\tprintf(\"0\");\n\t\t}\n\t}\n\tprintf(\"\\n\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":1270,"memory_kb":96444,"score_of_the_acc":-0.8113,"final_rank":12},{"submission_id":"aoj_3184_4883826","code_snippet":"// #pragma GCC optimize(\"unroll-loops\", \"omit-frame-pointer\", \"inline\")\n// #pragma GCC option(\"arch=native\", \"tune=native\", \"no-zero-upper\")\n// #pragma GCC\n// target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native\")\n// #pragma GCC optimize(\"Ofast\")\n// #pragma GCC optimize(\"tree-vectorize\",\"openmp\",\"predictive-commoning\")\n// #pragma GCC option(\"D_GLIBCXX_PARALLEL\",\"openmp\")\n\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC target(\"avx2\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\n// #define int long long\n#define pb push_back\n#define mp make_pair\n#define eps 1e-9\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define fi first\n#define sec second\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n#define dmp(x) cerr << #x << \": \" << x << endl;\n\ntemplate <class T>\nvoid chmin(T &a, const T &b) {\n if (a > b) a = b;\n}\ntemplate <class T>\nvoid chmax(T &a, const T &b) {\n if (a < b) a = b;\n}\n\ntemplate <class T>\nusing MaxHeap = priority_queue<T>;\ntemplate <class T>\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T>\nvector<T> vect(int len, T elem) {\n return vector<T>(len, elem);\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << p.fi << ',' << p.sec;\n return os;\n}\ntemplate <class T, class U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n is >> p.fi >> p.sec;\n return is;\n}\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i];\n if (i + 1 < vec.size()) os << ' ';\n }\n return os;\n}\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\n return is;\n}\nvoid fastio() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(20);\n}\n\n#define endl \"\\n\"\n\ntemplate <int MOD> // if inv is needed, this shold be prime.\nstruct ModInt {\n ll val;\n ModInt() : val(0ll) {}\n ModInt(const ll &v) : val(((v % MOD) + MOD) % MOD) {}\n bool operator==(const ModInt &x) const { return val == x.val; }\n bool operator!=(const ModInt &x) const { return !(*this == x); }\n bool operator<(const ModInt &x) const { return val < x.val; }\n bool operator>(const ModInt &x) const { return val > x.val; }\n bool operator>=(const ModInt &x) const { return !(*this < x); }\n bool operator<=(const ModInt &x) const { return !(*this > x); }\n ModInt operator-() const { return ModInt(MOD - val); }\n ModInt inv() const { return this->pow(MOD - 2); }\n ModInt &operator+=(const ModInt &x) {\n if ((val += x.val) >= MOD) val -= MOD;\n return *this;\n }\n ModInt &operator-=(const ModInt &x) {\n if ((val += MOD - x.val) >= MOD) val -= MOD;\n return *this;\n }\n ModInt &operator*=(const ModInt &x) {\n (val *= x.val) %= MOD;\n return *this;\n }\n ModInt &operator/=(const ModInt &x) { return *this *= x.inv(); };\n ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }\n ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }\n ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }\n ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }\n friend istream &operator>>(istream &i, ModInt &x) {\n ll v;\n i >> v;\n x = v;\n return i;\n }\n friend ostream &operator<<(ostream &o, const ModInt &x) {\n o << x.val;\n return o;\n }\n ModInt pow(ll x) const {\n auto res = ModInt(1ll);\n auto b = *this;\n while (x) {\n if (x & 1) res *= b;\n x >>= 1;\n b *= b;\n }\n return res;\n }\n};\n\ntemplate <int MOD>\nModInt<MOD> pow(ModInt<MOD> a, ll x) {\n ModInt<MOD> res = ModInt<MOD>(1ll);\n while (x) {\n if (x & 1) res *= a;\n x >>= 1;\n a *= a;\n }\n return res;\n}\n\nconstexpr int MOD = 1e9 + 7;\n// constexpr int MOD = 998244353;\nusing mint = ModInt<MOD>;\n\nvoid solve() {\n int Q, M;\n cin >> Q >> M;\n vector<int> pow3(M + 1, 1);\n for (int i = 0; i < M; i++) pow3[i + 1] = pow3[i] * 3;\n vector<int> dp(pow3[M], INF);\n auto encode = [](const string &s) -> int {\n int ret = 0;\n for (int i = 0; i < s.size(); i++) { ret = ret * 3 + (s[i] - '1'); }\n return ret;\n };\n vector<int> grade(Q);\n for (int i = 0; i < Q; i++) {\n string s;\n cin >> s;\n int val = encode(s);\n grade[i] = val;\n chmin(dp[val], i);\n }\n // dmp(dp);\n for (int d = 0; d < M; d++) {\n for (int i = pow3[M] - 1; i >= 0; i--) {\n int dig = (i % pow3[d + 1] - i % pow3[d]) / pow3[d];\n if (dig == 2) continue;\n chmin(dp[i], dp[i + pow3[d]]);\n }\n }\n // dmp(dp);\n for (int i = 0; i < Q; i++) {\n int g = grade[i];\n int min_ind = INF;\n for (int d = 0; d < M; d++) {\n int dig = (g % pow3[d + 1] - g % pow3[d]) / pow3[d];\n if (dig == 2) continue;\n chmin(min_ind, dp[g + pow3[d]]);\n }\n if (min_ind < i)\n cout << 1;\n else\n cout << 0;\n }\n cout << endl;\n return;\n}\n\nsigned main() {\n fastio();\n solve();\n // int t;\n // cin >> t;\n // while (t--) solve();\n\n // int t; cin >> t;\n // for(int i=1;i<=t;i++){\n // cout << \"Case #\" << i << \": \";\n // solve();\n // }\n return 0;\n}","accuracy":1,"time_ms":1440,"memory_kb":61208,"score_of_the_acc":-0.7426,"final_rank":7},{"submission_id":"aoj_3184_4871744","code_snippet":"#include <bits/stdc++.h>\n#ifdef _DEBUG\n#include \"_DEBUG.hpp\"\n#endif\n#define int long long\nusing namespace std;\nusing P = pair<int, int>;\nconst int inf = 2e18;\nconst int mod = 1e9 + 7;\n\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (T &in : v) is >> in;\n return is;\n}\n\ntemplate <class T>\nvector<T> make_vec(size_t a) {\n return vector<T>(a);\n}\n\ntemplate <class T, class... Ts>\nauto make_vec(size_t a, Ts... ts) {\n return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\n}\n\ntemplate <class T, class V>\ntypename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {\n t = v;\n}\n\ntemplate <class T, class V>\ntypename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v) {\n for (auto &e : t) fill(e, v);\n}\n\nint enc(string s) {\n int res = 0;\n for (int i = 0; i < s.size(); i++) {\n res = res * 3 + (s[i] - '1');\n }\n return res;\n}\n\nsigned main() {\n int q, m;\n cin >> q >> m;\n vector<string> s(q);\n cin >> s;\n\n vector<bool> dp(pow(3, m), false);\n\n auto dfs = [&](auto &&dfs, string &s) -> void {\n if (dp[enc(s)]) return;\n dp[enc(s)] = true;\n for (int i = 0; i < m; i++) {\n if (s[i] == '1') continue;\n s[i]--;\n dfs(dfs, s);\n s[i]++;\n }\n };\n\n for (int i = 0; i < q; i++) {\n if (dp[enc(s[i])]) {\n cout << \"1\";\n } else {\n cout << \"0\";\n for (int j = 0; j < m; j++) {\n if (s[i][j] == '1') continue;\n s[i][j]--;\n dfs(dfs, s[i]);\n s[i][j]++;\n }\n }\n }\n cout << endl;\n\n return 0;\n}","accuracy":1,"time_ms":2530,"memory_kb":21036,"score_of_the_acc":-1.0663,"final_rank":15},{"submission_id":"aoj_3184_4866090","code_snippet":"#include<iostream>\n#include<string>\n#include<iomanip>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<utility>\n\nusing namespace std;\n\n#define int long long\n#define endl \"\\n\"\n\nconstexpr long long INF = (long long)1e18;\nconstexpr long long MOD = 1'000'000'007; \n\n// struct fast_io {\n\t// fast_io(){\n\t\t// std::cin.tie(nullptr);\n\t\t// std::ios::sync_with_stdio(false);\n\t// };\n// } fio;\n\nconstexpr int MAX = 15'000'000; // < 3^15 = 14348907\n\nint Q, M;\nvector<int> S;\nvector<int> used(MAX);\nint t[20];\n\nint to_num(string &s){\n\tint res = 0;\n\t\n\tfor(int i = 0; i < s.size(); i++){\n\t\tres = res * 3 + s[i] - '1';\n\t}\n\t\n\treturn res;\n}\n\nvoid check(string &s, int num){\n\t// int num = to_num(s);\n\t\n\t// cout<<\"s = \"<<s<<\" num = \"<<num<<\" <> \"<<to_num(s)<<endl;\n\t\n\tif(used[num]) return ;\n\tused[num] = true;\n\t\n\t\n\tfor(int i = 0, j = 1; i < s.size(); i++){\n\t\t\n\t\ts[i]--;\n\t\t// cout<<\"i \"<<i<<\" s = \"<<s[i]<<endl;\n\t\tif(s[i] <= '0') {\n\t\t\ts[i]++;\n\t\t\tcontinue;\n\t\t}\n\t\tnum -= t[M-i-1];\n\t\tcheck(s, num);\n\t\tnum += t[M-i-1];\n\t\ts[i]++;\n\t}\n}\n\nsigned main(){\n\tcout<<fixed<<setprecision(10);\n\t\n\t// string ans;\n\tvector<int> ans;\n\t\n\tt[0] = 1;\n\tfor(int i = 1; i < 17; i++){\n\t\tt[i] = t[i-1] * 3;\n\t}\n\t\n\tcin>>Q>>M;\n\t\n\tans.resize(Q);\n\t\n\tfor(int i = 0; i < Q; i++){\n\t\tint num = 0;\n\t\tstring s;\n\t\t\n\t\tcin>>s;\n\t\t\n\t\tnum = to_num(s);\n\t\t// cout<<\"s = \"<<s<<\" num = \"<<num<<endl;\n\t\tif(used[num]) {\n\t\t\t// ans += \"1\";\n\t\t\tans[i] = 1;\n\t\t\tcontinue;\n\t\t} else {\n\t\t\t// ans += \"0\";\n\t\t}\n\t\t\n\t\tcheck(s, num);\n\t\t\n\t\tused[num] = false;\n\t}\n\t\n\t// cout<<ans<<endl;\n\t\n\tfor(int i = 0; i < ans.size(); i++){\n\t\tcout<<ans[i];\n\t}\n\tcout<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":1600,"memory_kb":124028,"score_of_the_acc":-1.0727,"final_rank":17},{"submission_id":"aoj_3184_4849984","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n//----------------------- Print Function ----------------------//\n\ninline void print() {\n cout << '\\n';\n}\ntemplate <typename First, typename... Rest>\nvoid print(const First &first, const Rest &... rest) {\n cout << first << ' ';\n print(rest...);\n}\n\ntemplate <typename T>\nvoid print(const T &a) {\n for (auto e : a) cout << e << ' ';\n cout << '\\n';\n}\n\n//------------------------- Libraries -------------------------//\n\ntemplate<class T>\nbool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n \ntemplate<class T>\nbool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//--------------------------- Solve ---------------------------//\n\nint encode(string s) {\n int res = 0;\n for (int i = s.size()-1; i >= 0; i--) {\n res *= 3;\n res += (int)(s[i] - '1');\n }\n return res;\n}\n\nvoid solve() {\n int Q, M; cin >> Q >> M;\n vector<string> S(Q);\n vector<int> state(Q);\n for (int i = 0; i < Q; i++) {\n cin >> S[i];\n state[i] = encode(S[i]);\n }\n\n vector<int> three(M+1, 1);\n for (int i = 0; i < M; i++) three[i+1] = three[i]*3;\n\n vector<int> dp(three[M], Q);\n for (int q = 0; q < Q; q++) {\n chmin(dp[state[q]], q);\n }\n for (int bit = three[M]-1; bit >= 0; bit--) {\n for (int i = 0; i < M; i++) {\n if (bit / three[i] % 3 != 2) {\n chmin(dp[bit], dp[bit+three[i]]);\n }\n }\n }\n for (int q = 0; q < Q; q++) {\n int res = Q;\n for (int i = 0; i < M; i++) {\n if (S[q][i] == '3') continue;\n chmin(res, dp[state[q]+three[i]]);\n }\n cout << (res < q ? 1 : 0);\n }\n cout << '\\n';\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":1010,"memory_kb":76856,"score_of_the_acc":-0.6142,"final_rank":3},{"submission_id":"aoj_3184_4849643","code_snippet":"// #define _GLIBCXX_DEBUG // for STL debug (optional)\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\nusing namespace std;\nusing ll = long long int;\nusing int64 = long long int;\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst int INF = 1LL << 29;\nconst ll LONGINF = 1LL << 60;\nconst ll MOD = 1000000007LL;\n\nint bit_stoi(string s) {\n int res = 0;\n for(auto c : s) {\n assert('0' <= c and c <= '2');\n res = res*3 + (c - '0');\n }\n return res;\n}\n\nstring bit_tostring(int v, int len) {\n string res = \"\";\n for(int i=0; i<len; i++) {\n res += (char)('0' + (v % 3));\n v /= 3;\n }\n return string(res.rbegin(), res.rend());\n}\n\nint main() {\n int Q, M; scanf(\"%d%d\", &Q, &M);\n int N = 1;\n for(int i=0; i<M; i++) N *= 3;\n \n vector<string> vs(Q);\n vector<int> values(Q), rec(N, INF), mod(N);\n for(int i=0; i<Q; i++) {\n cin >> vs[i];\n for(auto &c : vs[i]) c--;\n int value = bit_stoi(vs[i]);\n values[i] = value;\n chmin(rec[value], i);\n }\n for(int i=0; i<N; i++) mod[i] = i % 3;\n\n for(int k=0, p=1; k<M; k++, p*=3) {\n for(int i=N-1; i>=0; i--) {\n int d = (i/p) % 3;\n if(d - 1 >= 0) {\n chmin(rec[i-p], rec[i]);\n }\n }\n }\n \n string ans = \"\";\n for(int i=0; i<Q; i++) {\n bool ng = false;\n int v = values[i];\n for(int k=0, p=1; k<M; k++, p*=3) {\n int d = mod[v/p];\n if(d == 3) d = 0;\n if(d + 1 < 3) {\n int nv = v + p;\n ng |= (rec[nv] < i);\n }\n }\n ans += (char)('0' + ng);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":840,"memory_kb":133892,"score_of_the_acc":-0.7725,"final_rank":10},{"submission_id":"aoj_3184_4849624","code_snippet":"// #define _GLIBCXX_DEBUG // for STL debug (optional)\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\nusing namespace std;\nusing ll = long long int;\nusing int64 = long long int;\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst int INF = 1LL << 29;\nconst ll LONGINF = 1LL << 60;\nconst ll MOD = 1000000007LL;\n\nint bit_stoi(string s) {\n int res = 0;\n for(auto c : s) {\n assert('0' <= c and c <= '2');\n res = res*3 + (c - '0');\n }\n return res;\n}\n\nstring bit_tostring(int v, int len) {\n string res = \"\";\n for(int i=0; i<len; i++) {\n res += (char)('0' + (v % 3));\n v /= 3;\n }\n return string(res.rbegin(), res.rend());\n}\n\nint main() {\n int Q, M; scanf(\"%d%d\", &Q, &M);\n int N = 1;\n for(int i=0; i<M; i++) N *= 3;\n \n vector<string> vs(Q);\n vector<int> values(Q), rec(N, INF), mod(N);\n for(int i=0; i<Q; i++) {\n cin >> vs[i];\n for(auto &c : vs[i]) c--;\n int value = bit_stoi(vs[i]);\n values[i] = value;\n chmin(rec[value], i);\n }\n for(int i=0; i<N; i++) mod[i] = i % 3;\n\n vector<bool> checked(N);\n auto dfs = [&](auto &&f, int v) -> void {\n checked[v] = true;\n for(int i=0, p=1; i<M; i++, p*=3) {\n int d = mod[v/p];\n if(d + 1 < 3) {\n int nv = v + p;\n if(!checked[nv]) f(f, nv);\n chmin(rec[v], rec[nv]);\n }\n }\n };\n dfs(dfs, 0);\n\n string ans = \"\";\n for(int i=0; i<Q; i++) {\n bool ng = false;\n int v = values[i];\n for(int k=0, p=1; k<M; k++, p*=3) {\n int d = mod[v/p];\n if(d == 3) d = 0;\n if(d + 1 < 3) {\n int nv = v + p;\n ng |= (rec[nv] < i);\n }\n }\n ans += (char)('0' + ng);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":2180,"memory_kb":135684,"score_of_the_acc":-1.3807,"final_rank":20},{"submission_id":"aoj_3184_4849307","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n\n// 文字列を3進数でエンコード\nint enc(const std::string& s) {\n int ret = 0;\n for (char c : s) {\n ret = ret * 3 + (c - '1');\n }\n return ret;\n}\n\nvoid solve() {\n int q, m;\n std::cin >> q >> m;\n\n // k = 3^m\n int k = 1;\n for (int i = 0; i < m; ++i) k *= 3;\n\n std::vector<bool> out(k, false); // 既に上位互換が存在するか\n\n // 下位互換を全てtrueに更新する\n auto propagate = [&](auto&& f, std::string& s) -> void {\n if (out[enc(s)]) return; // 枝刈り\n\n out[enc(s)] = true;\n for (int i = 0; i < m; ++i) {\n if (s[i] == '1') continue;\n --s[i];\n f(f, s);\n ++s[i];\n }\n };\n\n while (q--) {\n std::string s;\n std::cin >> s;\n\n if (out[enc(s)]) {\n std::cout << \"1\";\n continue;\n }\n\n std::cout << \"0\";\n\n // 下位互換を更新\n for (int i = 0; i < m; ++i) {\n if (s[i] == '1') continue;\n --s[i];\n propagate(propagate, s);\n ++s[i];\n }\n }\n\n std::cout << \"\\n\";\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":1860,"memory_kb":4924,"score_of_the_acc":-0.6996,"final_rank":5},{"submission_id":"aoj_3184_4849249","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n\nint enc(const std::string& s) {\n int ret = 0;\n for (char c : s) {\n ret = ret * 3 + (c - '1');\n }\n return ret;\n}\n\nvoid solve() {\n int n, m;\n std::cin >> n >> m;\n\n int k = 1;\n for (int i = 0; i < m; ++i) k *= 3;\n\n std::vector<bool> out(k, false);\n auto propagate = [&](auto&& f, std::string& s) -> void {\n if (out[enc(s)]) return;\n\n out[enc(s)] = true;\n for (int i = 0; i < m; ++i) {\n if (s[i] == '1') continue;\n --s[i];\n f(f, s);\n ++s[i];\n }\n };\n\n while (n--) {\n std::string s;\n std::cin >> s;\n\n if (out[enc(s)]) {\n std::cout << \"1\";\n continue;\n }\n\n std::cout << \"0\";\n\n for (int i = 0; i < m; ++i) {\n if (s[i] == '1') continue;\n --s[i];\n propagate(propagate, s);\n ++s[i];\n }\n }\n\n std::cout << \"\\n\";\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":1870,"memory_kb":4924,"score_of_the_acc":-0.704,"final_rank":6},{"submission_id":"aoj_3184_4848608","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = int;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e9;\nusing P = pair<ll, ll>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\nstring convert(ll n,ll bit){\n string ret(bit,'0');\n for(ll i=0;i<bit;i++)if(n&1LL<<bit-1-i)ret[i]='1';\n return ret;\n}\nstring convert(ll n){\n ll bit=0;\n while(n>=1<<bit)bit++;\n return convert(n,max(1,bit));\n}\nll convert(string s){\n ll ret=0;\n ll n=s.size();\n for(ll i=0;i<n;i++)if(s[i]=='1')ret|=1LL<<n-i-1;\n return ret;\n}\nvector<ll> convert_base(ll n,ll m,ll base){\n\tvector<ll>ret(m,0);\n\tfor(ll i=0;i<m;i++){\n\t\tret[i]=n%base;\n\t\tn/=base;\n\t}\n\treturn ret;\n}\nll convert_base(vector<ll>v,ll base){\n ll tmp=1,ret=0;\n for(ll i=0;i<v.size();i++){\n ret+=v[i]*tmp;\n tmp*=base;\n }\n return ret;\n}\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n ll q,m;cin>>q>>m;\n ll sz=1;\n rep(i,0,m)sz*=3;\n vector<bool>dp(sz,false);\n string ret;\n while(q--){\n string s;cin>>s;\n ll pos=0;\n rep(i,0,m){\n pos*=3;\n pos+=(s[i]-'1');\n }\n if(dp[pos])ret+='1';\n else{\n ret+='0';\n queue<ll>que;\n que.push(pos);\n while(!que.empty()){\n auto p=que.front();\n que.pop();\n auto sp=convert_base(p,m,3);\n ll to=p;\n ll add=1;\n rep(i,0,m){\n if(sp[i]==0){\n add*=3;\n continue;\n }\n to-=add;\n if(!dp[to]){\n dp[to]=true;\n que.push(to);\n }\n to+=add;\n add*=3;\n }\n }\n }\n //debug(dp,sz);\n }\n cout<<ret<<endl;\n return 0;\n}","accuracy":1,"time_ms":2270,"memory_kb":12424,"score_of_the_acc":-0.9142,"final_rank":13},{"submission_id":"aoj_3184_4848590","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n/*\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\n{ for(auto it : P) { s << \"<\" << it << \"> \"; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for(auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s << endl; }\n#include <sys/time.h>\ndouble getTime() {\n struct timeval s;\n gettimeofday(&s, NULL);\n return s.tv_sec + s.tv_usec * 1e-6;\n}\n*/\n\ninline int conv(const string &s) {\n int res = 0;\n for (int i = s.size()-1; i >= 0; --i) res *= 3, res += (int)(s[i] - '1');\n return res;\n}\n\ninline string decode(int bit, int M) {\n string res = \"\";\n while (bit) res += (char)('1' + (bit%3)), bit /= 3;\n while (res.size() < M) res += \"1\";\n return res;\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector<string> S(N);\n vector<int> bitS(N);\n for (int q = 0; q < N; ++q) cin >> S[q], bitS[q] = conv(S[q]);\n\n vector<int> three(M+1, 1);\n for (int i = 0; i < M; ++i) three[i+1] = three[i] * 3;\n vector<int> dp(three[M], N);\n for (int q = 0; q < N; ++q) chmin(dp[bitS[q]], q);\n for (int bit = three[M]-1; bit >= 0; --bit) {\n for (int i = 0; i < M; ++i) {\n if (bit / three[i] % 3 == 2) continue;\n chmin(dp[bit], dp[bit + three[i]]);\n }\n }\n for (int q = 0; q < N; ++q) {\n int res = N;\n for (int i = 0; i < M; ++i) {\n if (S[q][i] == '3') continue;\n chmin(res, dp[bitS[q] + three[i]]);\n }\n cout << (res < q ? 1 : 0);\n }\n cout << endl;\n}","accuracy":1,"time_ms":1750,"memory_kb":96160,"score_of_the_acc":-1.0254,"final_rank":14},{"submission_id":"aoj_3184_4848583","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\n{ for(auto it : P) { s << \"<\" << it << \"> \"; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for(auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s << endl; }\n#include <sys/time.h>\ndouble getTime() {\n struct timeval s;\n gettimeofday(&s, NULL);\n return s.tv_sec + s.tv_usec * 1e-6;\n}\n\n\ninline int conv(const string &s) {\n int res = 0;\n for (int i = s.size()-1; i >= 0; --i) res *= 3, res += (int)(s[i] - '1');\n return res;\n}\n\ninline string decode(int bit, int M) {\n string res = \"\";\n while (bit) res += (char)('1' + (bit%3)), bit /= 3;\n while (res.size() < M) res += \"1\";\n return res;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0); \n\n auto start = getTime();\n\n int N, M;\n cin >> N >> M;\n vector<string> S(N);\n vector<int> bitS(N);\n for (int q = 0; q < N; ++q) cin >> S[q], bitS[q] = conv(S[q]);\n\n //COUT(getTime() - start);\n\n vector<int> three(M+1, 1);\n for (int i = 0; i < M; ++i) three[i+1] = three[i] * 3;\n vector<int> dp(three[M], N);\n for (int q = 0; q < N; ++q) chmin(dp[bitS[q]], q);\n for (int bit = three[M]-1; bit >= 0; --bit) {\n for (int i = 0; i < M; ++i) {\n if (bit / three[i] % 3 == 2) continue;\n chmin(dp[bit], dp[bit + three[i]]);\n }\n }\n\n //COUT(getTime() - start);\n \n for (int q = 0; q < N; ++q) {\n int res = N;\n for (int i = 0; i < M; ++i) {\n if (S[q][i] == '3') continue;\n chmin(res, dp[bitS[q] + three[i]]);\n }\n cout << (res < q ? 1 : 0);\n }\n cout << endl;\n}","accuracy":1,"time_ms":1240,"memory_kb":88240,"score_of_the_acc":-0.7641,"final_rank":9},{"submission_id":"aoj_3184_4848498","code_snippet":"/**\n * author: otera \n**/\n#include<iostream>\n#include<string> \n#include<cstdio>\n#include<cstring>\n#include<vector>\n#include<cmath>\n#include<algorithm> \n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<deque>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\ntypedef long double ld;\nconst int inf=1e9+7;\nconst ll INF=1LL<<60 ;\nconst ll mod=1e9+7 ;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef complex<ld> Point;\nconst ld eps = 1e-8;\nconst ld pi = acos(-1.0);\ntypedef pair<int, int> P;\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define debug(x) cerr << #x << \" = \" << (x) << endl;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nint q, m;\nbitset<14348908> used;\nbitset<14348908> sad;\n\nint f(string x) {\n int pw = 1;\n int ret = 0;\n rep(i, m) {\n ret += (x[i] - '1') * pw;\n pw *= 3;\n }\n return ret;\n}\n\nvoid solve() {\n\tcin >> q >> m;\n vector<int> ans(q, 0);\n queue<int> que;\n rep(_, q) {\n string s; cin >> s;\n int cur = f(s);\n // cerr << cur << endl;\n if(sad[cur]) {\n ans[_] = 1;\n }\n if(!used[cur]) {\n used[cur] = 1;\n que.push(cur);\n while(!que.empty()) {\n int t = que.front(); que.pop();\n int pw = 1;\n rep(i, m) {\n int x = (t % (3 * pw)) / pw;\n if(x >= 1) {\n t -= pw;\n if(!used[t]) {\n que.push(t);\n used[t] = 1;\n sad[t] = 1;\n }\n if(!sad[t]) {\n sad[t] = 1;\n }\n t += pw;\n }\n pw *= 3;\n }\n }\n }\n }\n rep(i, q) {\n cout << ans[i];\n }\n cout << \"\\n\";\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//int t; cin >> t; rep(i, t)solve();\n\tsolve();\n return 0;\n}","accuracy":1,"time_ms":1860,"memory_kb":16032,"score_of_the_acc":-0.7452,"final_rank":8},{"submission_id":"aoj_3184_4848447","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 1020000;\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\nconst double pi = acos(-1);\nconst double eps = 1e-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << \"debug: \" << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << \"debug: \" << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\nint sad[20202020];\nint cnt[20202020];\nint num[505050];\n\nint main(){\n\tint q,m; cin >> q >> m;\n\tvs s(q); rep(i,q) cin >> s[i];\n\tint p = 1;\n\trep(i,m) p *= 3;\n\tp--;\n\trep(i,p+1){\n\t\tsad[i] = inf;\n\t\tcnt[i] = inf;\n\t}\n\trep(i,q){\n\t\tint tmp = 1;\n\t\trep(j,m){\n\t\t\tnum[i] += (s[i][j] - 1 - '0') * tmp;\n\t\t\ttmp *= 3;\n\t\t}\n\t\tchmin(cnt[num[i]],i);\n\t}\n\tint tmp = 1;\n\trep(i,m){\n\t\tfor(int trit = p; trit > 0; trit--){\n\t\t\tint a = (trit / tmp) % 3;\n\t\t\tfor(int j=1; j<=a; j++){\n\t\t\t\tchmin(sad[trit - tmp * j], min(sad[trit], cnt[trit]));\n\t\t\t}\n\t\t}\n\t\ttmp *= 3;\n\t}\n\tstring ans(q,'@');\n\trep(i,q){\n\t\tans[i] = (char)('0' + (sad[num[i]] < i));\n\t}\n\tcout << ans << \"\\n\";\n}","accuracy":1,"time_ms":1470,"memory_kb":152508,"score_of_the_acc":-1.1315,"final_rank":18},{"submission_id":"aoj_3184_4848338","code_snippet":"/**\n * author: otera \n**/\n#include<iostream>\n#include<string> \n#include<cstdio>\n#include<cstring>\n#include<vector>\n#include<cmath>\n#include<algorithm> \n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<deque>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\n#define int long long\ntypedef long long ll;\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\ntypedef long double ld;\nconst int inf=1e9+7;\nconst ll INF=1LL<<60 ;\nconst ll mod=1e9+7 ;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef complex<ld> Point;\nconst ld eps = 1e-8;\nconst ld pi = acos(-1.0);\ntypedef pair<int, int> P;\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define debug(x) cerr << #x << \" = \" << (x) << endl;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nvoid solve() {\n\tint q, m; cin >> q >> m;\n int s = 1;\n rep(_, m) s *= 3;\n vector<int> st(s, inf);\n vector<int> pos(q);\n rep(i, q) {\n string s; cin >> s;\n int w = 0;\n rep(_, m) {\n w *= 3;\n w += s[_] - '1';\n }\n chmin(st[w], i);\n pos[i] = w;\n }\n vector<int> dp(s, inf);\n vector<int> buf(m);\n per(i, s) {\n int now = i;\n per(j, m) {\n buf[j] = now % 3;\n now /= 3; \n }\n int z = 1;\n per(j, m) {\n if(buf[j] < 2) {\n chmin(dp[i], dp[i + z]);\n chmin(dp[i], st[i + z]);\n }\n z *= 3;\n }\n }\n rep(i, q) {\n if(dp[pos[i]] < i) cout << 1;\n else cout << 0;\n }\n cout << \"\\n\";\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//int t; cin >> t; rep(i, t)solve();\n\tsolve();\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":230988,"score_of_the_acc":-1.1403,"final_rank":19}],"string":"[\n {\n \"submission_id\": \"aoj_3184_10422733\",\n \"code_snippet\": \"#define INF 4'000'000'000'000'000'037LL\\n#include <bits/stdc++.h>\\nusing namespace std;\\nnamespace {\\nusing ll = long long;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pll = pair<ll, ll>;\\n#define vc vector\\ntemplate <class T>\\nusing vvc = vc<vc<T>>;\\nusing vl = vc<ll>;\\nusing vpll = vc<pll>;\\n#ifdef __SIZEOF_INT128__\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\n#endif\\n#define cauto const auto\\n#define overload4(_1, _2, _3, _4, name, ...) name\\n#define rep1(i, n) for (ll i = 0, nnnnn = ll(n); i < nnnnn; i++)\\n#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)\\n#define repi1(i, n) for (int i = 0, nnnnn = int(n); i < nnnnn; i++)\\n#define repi2(i, l, r) for (int i = int(l), rrrrr = int(r); i < rrrrr; i++)\\n#define repi3(i, l, r, d) for (int i = int(l), rrrrr = int(r), ddddd = int(d); ddddd > 0 ? i < rrrrr : i > rrrrr; i += d)\\n#define repi(...) overload4(__VA_ARGS__, repi3, repi2, repi1)(__VA_ARGS__)\\n#define fem(...) for (auto &__VA_ARGS__)\\ntemplate <class T, class U>\\ninline bool chmin(T &a, U b) { return a > b ? a = b, true : false; }\\ntemplate <class T = ll, class U, class V>\\ninline constexpr T divfloor(U a, V b) { return T(a) / T(b) - (T(a) % T(b) && (T(a) ^ T(b)) < 0); }\\ntemplate <class T = ll, class U, class V>\\ninline constexpr T safemod(U a, V b) { return T(a) - T(b) * divfloor<T>(a, b); }\\ntemplate <class T = ll, class U, class V>\\nconstexpr T ipow(U a, V b)\\n{\\n assert(b >= 0);\\n if (b == 0)\\n return 1;\\n if (a == 0 || a == 1)\\n return a;\\n if (a < 0 && a == -1)\\n return b & 1 ? -1 : 1;\\n T res = 1, tmp = a;\\n while (true)\\n {\\n if (b & 1)\\n res *= tmp;\\n b >>= 1;\\n if (b == 0)\\n break;\\n tmp *= tmp;\\n }\\n return res;\\n}\\ntemplate <class T = ll, class A, class B, class M>\\nT mul_limited(A a, B b, M m)\\n{\\n assert(a >= 0 && b >= 0 && m >= 0);\\n if (b == 0)\\n return 0;\\n return T(a) > T(m) / T(b) ? T(m) : T(a) * T(b);\\n}\\ntemplate <class T = ll, class A, class B>\\nT mul_limited(A a, B b) { return mul_limited<T>(a, b, INF); }\\ntemplate <class T = ll, class A, class B, class M>\\nT pow_limited(A a, B b, M m)\\n{\\n assert(a >= 0 && b >= 0 && m >= 0);\\n if (a <= 1 || b == 0)\\n return min(ipow<T>(a, b), T(m));\\n T res = 1, tmp = a;\\n while (true)\\n {\\n if (b & 1)\\n {\\n if (res > T(m) / tmp)\\n return m;\\n res *= tmp;\\n }\\n b >>= 1;\\n if (b == 0)\\n break;\\n if (tmp > T(m) / tmp)\\n return m;\\n tmp *= tmp;\\n }\\n return res;\\n}\\ntemplate <class T = ll, class A, class B>\\nT pow_limited(A a, B b) { return pow_limited<T>(a, b, INF); }\\ntemplate <class T = ll, class U, class V>\\nvc<T> base_repr(U val, V base)\\n{\\n assert(val >= 0);\\n assert(base >= 2);\\n if (val == 0)\\n return {0};\\n vc<T> a;\\n while (val > 0)\\n {\\n a.emplace_back(val % base);\\n val /= base;\\n }\\n reverse(a.begin(), a.end());\\n return a;\\n}\\ntemplate <class T = ll, class U, class V>\\nvc<T> base_repr(U val, V base, int n)\\n{\\n assert(val >= 0);\\n assert(base >= 2);\\n assert(n >= 0);\\n vc<T> a(n);\\n repi(i, n)\\n {\\n a[i] = val % base;\\n val /= base;\\n }\\n reverse(a.begin(), a.end());\\n return a;\\n}\\n#define ALL(a) (a).begin(), (a).end()\\ntemplate <class T, size_t d, size_t i = 0, class V>\\nauto dvec(const V (&sz)[d], const T &init)\\n{\\n if constexpr (i < d)\\n return vc(sz[i], dvec<T, d, i + 1>(sz, init));\\n else\\n return init;\\n}\\ntemplate <class V>\\nV reversed(const V &v) { return V(v.rbegin(), v.rend()); }\\n#if __cplusplus < 202002L\\n#else\\n#endif\\ntemplate <class V>\\nvoid unique(V &v) { v.erase(std::unique(ALL(v)), v.end()); }\\ntemplate <class V, class U>\\nvoid rotate(V &v, U k)\\n{ \\n const U n = v.size();\\n k = (k % n + n) % n;\\n std::rotate(v.begin(), v.begin() + k, v.end());\\n}\\ntemplate <class T, const T infty = INF>\\nstruct MonoidMin\\n{\\n using S = T;\\n static constexpr S op(S a, S b) { return min(a, b); }\\n};\\nconst vpll DRULgrid = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\\nconst vpll DRULplane = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}};\\ntemplate <class T>\\nstruct is_random_access_iterator\\n{\\n static constexpr bool value = is_same_v<\\n typename iterator_traits<T>::iterator_category,\\n random_access_iterator_tag\\n >;\\n};\\ntemplate <class T>\\nconstexpr bool is_random_access_iterator_v = is_random_access_iterator<T>::value;\\n#if __cplusplus < 202002L\\nnamespace internal\\n{\\n};\\n#else\\n#endif\\n#if __cplusplus < 202002L\\n#else\\ninline constexpr ll bit_width(ll x) { return std::bit_width((ull)x); }\\ninline constexpr ll bit_floor(ll x) { return std::bit_floor((ull)x); }\\ninline constexpr ll bit_ceil(ll x) { return std::bit_ceil((ull)x); }\\ninline constexpr ll countr_zero(ll x) { assert(x != 0); return std::countr_zero((ull)x); }\\ninline constexpr ll popcount(ll x) { return std::popcount((ull)x); }\\ninline constexpr bool has_single_bit(ll x) { return std::has_single_bit((ull)x); }\\n#endif\\n#define dump(...)\\n#define oj(...) __VA_ARGS__\\nnamespace fastio {\\nstatic constexpr uint32_t SIZ = 1 << 17;\\nchar ibuf[SIZ];\\nchar obuf[SIZ];\\nchar out[100];\\nuint32_t pil = 0, pir = 0, por = 0;\\nstruct Pre {\\n char num[10000][4];\\n constexpr Pre() : num() {\\n for (int i = 0; i < 10000; i++) {\\n int n = i;\\n for (int j = 3; j >= 0; j--) {\\n num[i][j] = n % 10 | '0';\\n n /= 10;\\n }\\n }\\n }\\n} constexpr pre;\\ninline void load() {\\n memcpy(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SIZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SIZ) ibuf[pir++] = '\\\\n';\\n}\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\nvoid rd1(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir) load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir) load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\ntemplate <typename T>\\nvoid rd1_integer(T &x) {\\n if (pil + 100 > pir) load();\\n char c;\\n do\\n c = ibuf[pil++];\\n while (c < '-');\\n bool minus = 0;\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (c == '-') { minus = 1, c = ibuf[pil++]; }\\n }\\n x = 0;\\n while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus) x = -x;\\n }\\n}\\nvoid rd1(ll &x) { rd1_integer(x); }\\ntemplate <class T, class U>\\nvoid rd1(pair<T, U> &p) {\\n return rd1(p.first), rd1(p.second);\\n}\\ntemplate <size_t N = 0, typename T>\\nvoid rd1_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd1(x);\\n rd1_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T>\\nvoid rd1(tuple<T...> &tpl) {\\n rd1_tuple(tpl);\\n}\\ntemplate <size_t N = 0, typename T>\\nvoid rd1(array<T, N> &x) {\\n for (auto &d: x) rd1(d);\\n}\\ntemplate <class T>\\nvoid rd1(vc<T> &x) {\\n for (auto &d: x) rd1(d);\\n}\\nvoid read() {}\\ntemplate <class H, class... T>\\nvoid read(H &h, T &... t) {\\n rd1(h), read(t...);\\n}\\nvoid wt1(const char c) {\\n if (por == SIZ) flush();\\n obuf[por++] = c;\\n}\\nvoid wt1(const string s) {\\n for (char c: s) wt1(c);\\n}\\ntemplate <typename T>\\nvoid wt1_integer(T x) {\\n if (por > SIZ - 100) flush();\\n if (x < 0) { obuf[por++] = '-', x = -x; }\\n int outi;\\n for (outi = 96; x >= 10000; outi -= 4) {\\n memcpy(out + outi, pre.num[x % 10000], 4);\\n x /= 10000;\\n }\\n if (x >= 1000) {\\n memcpy(obuf + por, pre.num[x], 4);\\n por += 4;\\n } else if (x >= 100) {\\n memcpy(obuf + por, pre.num[x] + 1, 3);\\n por += 3;\\n } else if (x >= 10) {\\n int q = (x * 103) >> 10;\\n obuf[por] = q | '0';\\n obuf[por + 1] = (x - q * 10) | '0';\\n por += 2;\\n } else\\n obuf[por++] = x | '0';\\n memcpy(obuf + por, out + outi + 4, 96 - outi);\\n por += 96 - outi;\\n}\\ntemplate <class T, enable_if_t<is_integral_v<T>, int> = 0>\\nvoid wt1(T x) { wt1_integer(x); }\\ntemplate <class T, class U>\\nvoid wt1(const pair<T, U> &val) {\\n wt1(val.first);\\n wt1(' ');\\n wt1(val.second);\\n}\\ntemplate <size_t N = 0, typename T>\\nvoid wt1_tuple(const T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) { wt1(' '); }\\n const auto x = std::get<N>(t);\\n wt1(x);\\n wt1_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T>\\nvoid wt1(const tuple<T...> &tpl) {\\n wt1_tuple(tpl);\\n}\\ntemplate <class T, size_t S>\\nvoid wt1(const array<T, S> &val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i) wt1(' ');\\n wt1(val[i]);\\n }\\n}\\ntemplate <class T>\\nvoid wt1(const vector<T> &val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i) wt1(' ');\\n wt1(val[i]);\\n }\\n}\\nvoid print() { wt1('\\\\n'); }\\ntemplate <class Head, class... Tail>\\nvoid print(Head &&head, Tail &&... tail) {\\n wt1(head);\\n if (sizeof...(Tail)) wt1(' ');\\n print(forward<Tail>(tail)...);\\n}\\n} // namespace fastio\\nstruct Dummy {\\n Dummy() { atexit(fastio::flush); }\\n} dummy;\\nnamespace internal\\n{\\ntemplate <class... Ts>\\nvoid READnodump(Ts &...a) { fastio::read(a...); }\\ntemplate <class T>\\nvoid READVECnodump(int n, vc<T> &v)\\n{\\n v.resize(n);\\n READnodump(v);\\n}\\ntemplate <class T, class... Ts>\\nvoid READVECnodump(int n, vc<T> &v, vc<Ts> &...vs)\\n{ READVECnodump(n, v), READVECnodump(n, vs...); }\\ntemplate <class T>\\nvoid READVEC2nodump(int n, int m, vvc<T> &v)\\n{\\n v.assign(n, vc<T>(m));\\n READnodump(v);\\n}\\ntemplate <class T, class... Ts>\\nvoid READVEC2nodump(int n, int m, vvc<T> &v, vvc<Ts> &...vs)\\n{ READVEC2nodump(n, m, v), READVEC2nodump(n, m, vs...); }\\ntemplate <class T>\\nvoid READJAGnodump(int n, vvc<T> &v)\\n{\\n v.resize(n);\\n repi(i, n)\\n {\\n int k;\\n READnodump(k);\\n READVECnodump(k, v[i]);\\n }\\n}\\ntemplate <class T, class... Ts>\\nvoid READJAGnodump(int n, vvc<T> &v, vvc<Ts> &...vs)\\n{ READJAGnodump(n, v), READJAGnodump(n, vs...); }\\n}; // namespace internal\\n#define READ(...) internal::READnodump(__VA_ARGS__); dump(__VA_ARGS__)\\n#define IN(T, ...) T __VA_ARGS__; READ(__VA_ARGS__)\\n#define LL(...) IN(ll, __VA_ARGS__)\\n#define READVEC(...) internal::READVECnodump(__VA_ARGS__); dump(__VA_ARGS__)\\n#define VEC(T, n, ...) vc<T> __VA_ARGS__; READVEC(n, __VA_ARGS__)\\n#define PRINT fastio::print\\ntemplate <class T, class U, class P>\\npair<T, U> operator+=(pair<T, U> &a, const P &b)\\n{\\n a.first += b.first;\\n a.second += b.second;\\n return a;\\n}\\ntemplate <class T, class U, class P>\\npair<T, U> operator+(pair<T, U> &a, const P &b) { return a += b; }\\ntemplate <class T, size_t n, class A>\\narray<T, n> operator+=(array<T, n> &a, const A &b)\\n{\\n for (size_t i = 0; i < n; i++)\\n a[i] += b[i];\\n return a;\\n}\\ntemplate <class T, size_t n, class A>\\narray<T, n> operator+(array<T, n> &a, const A &b) { return a += b; }\\nnamespace internal\\n{\\ntemplate <size_t... I, class A, class B>\\nauto tuple_add_impl(A &a, const B &b, const index_sequence<I...>)\\n{\\n ((get<I>(a) += get<I>(b)), ...);\\n return a;\\n}\\n}; // namespace internal\\ntemplate <class... Ts, class Tp>\\ntuple<Ts...> operator+=(tuple<Ts...> &a, const Tp &b)\\n{ return internal::tuple_add_impl(a, b, make_index_sequence<tuple_size_v<tuple<Ts...>>>{}); }\\ntemplate <class... Ts, class Tp>\\ntuple<Ts...> operator+(tuple<Ts...> &a, const Tp &b) { return a += b; }\\nnamespace internal\\n{\\n};\\nmt19937_64 mt;\\nnamespace internal\\n{\\nconstexpr ll powmod32_constexpr(ll x, ll n, int m)\\n{\\n if (m == 1)\\n return 0;\\n uint _m = (uint)m;\\n ull r = 1;\\n ull y = safemod(x, m);\\n while (n)\\n {\\n if (n & 1)\\n r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\nconstexpr bool isprime32_constexpr(int n)\\n{\\n if (n <= 1)\\n return false;\\n if (n == 2 || n == 7 || n == 61)\\n return true;\\n if (n % 2 == 0)\\n return false;\\n ll d = n - 1;\\n while (d % 2 == 0)\\n d /= 2;\\n constexpr ll bases[3] = {2, 7, 61};\\n for (ll a : bases)\\n {\\n ll t = d;\\n ll y = powmod32_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1)\\n {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0)\\n return false;\\n }\\n return true;\\n}\\ntemplate <int n>\\nconstexpr bool isprime32 = isprime32_constexpr(n);\\nstruct barrett32\\n{\\n uint m;\\n ull im;\\n explicit barrett32(uint m) : m(m), im((ull)(-1) / m + 1) {}\\n uint umod() const { return m; }\\n uint mul(uint a, uint b) const\\n {\\n ull z = a;\\n z *= b;\\n ull x = (ull)((u128(z)*im) >> 64);\\n ull y = x * m;\\n return (uint)(z - y + (z < y ? m : 0));\\n }\\n};\\n}\\nnamespace internal\\n{\\n#define REF static_cast<mint &>(*this)\\n#define CREF static_cast<const mint &>(*this)\\n#define VAL *static_cast<const mint *>(this)\\ntemplate <class mint>\\nstruct modint_base\\n{\\n mint &operator+=(const mint &rhs)\\n {\\n mint &self = REF;\\n self._v += rhs._v;\\n if (self._v >= self.umod())\\n self._v -= self.umod();\\n return self;\\n }\\n mint &operator-=(const mint &rhs)\\n {\\n mint &self = REF;\\n self._v -= rhs._v;\\n if (self._v >= self.umod())\\n self._v += self.umod();\\n return self;\\n }\\n mint &operator/=(const mint &rhs)\\n {\\n mint &self = REF;\\n return self = self * rhs.inv();\\n }\\n mint &operator++()\\n {\\n mint &self = REF;\\n self._v++;\\n if (self._v == self.umod())\\n self._v = 0;\\n return self;\\n }\\n mint &operator--()\\n {\\n mint &self = REF;\\n if (self._v == 0)\\n self._v = self.umod();\\n self._v--;\\n return self;\\n }\\n mint operator++(int)\\n {\\n mint res = VAL;\\n ++REF;\\n return res;\\n }\\n mint operator--(int)\\n {\\n mint res = VAL;\\n --REF;\\n return res;\\n }\\n mint operator+() const { return VAL; }\\n mint operator-() const { return mint() - VAL; }\\n mint pow(ll n) const\\n {\\n assert(n >= 0);\\n mint x = VAL, r = 1;\\n while (n)\\n {\\n if (n & 1)\\n r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n friend mint operator+(const mint &lhs, const mint &rhs)\\n { return mint(lhs) += rhs; }\\n friend mint operator-(const mint &lhs, const mint &rhs)\\n { return mint(lhs) -= rhs; }\\n friend mint operator*(const mint &lhs, const mint &rhs)\\n { return mint(lhs) *= rhs; }\\n friend mint operator/(const mint &lhs, const mint &rhs)\\n { return mint(lhs) /= rhs; }\\n friend bool operator==(const mint &lhs, const mint &rhs)\\n { return mint(lhs).eq(rhs); }\\n friend bool operator!=(const mint &lhs, const mint &rhs)\\n { return mint(lhs).neq(rhs); }\\nprivate:\\n bool eq(const mint &rhs) { return REF._v == rhs._v; }\\n bool neq(const mint &rhs) { return REF._v != rhs._v; }\\n};\\n}\\ntemplate <typename T, std::enable_if_t<std::is_base_of_v<internal::modint_base<T>, T>, int> = 0>\\nvoid rd1(T &x)\\n{\\n ll a;\\n fastio::rd1(a);\\n x = a;\\n}\\ntemplate <typename T, std::enable_if_t<std::is_base_of_v<internal::modint_base<T>, T>, int> = 0>\\nvoid wt1(const T &x) { fastio::wt1(x.val()); }\\ntemplate <class T = ll>\\nconstexpr tuple<T, T, T> extgcd(const T &a, const T &b)\\n{\\n if (a == 0 && b == 0)\\n return {0, 0, 0};\\n T x1 = 1, y1 = 0, z1 = a;\\n T x2 = 0, y2 = 1, z2 = b;\\n while (z2 != 0)\\n {\\n T q = z1 / z2;\\n tie(x1, x2) = make_pair(x2, x1 - q * x2);\\n tie(y1, y2) = make_pair(y2, y1 - q * y2);\\n tie(z1, z2) = make_pair(z2, z1 - q * z2);\\n }\\n if (z1 < 0)\\n x1 = -x1, y1 = -y1, z1 = -z1;\\n return {z1, x1, y1};\\n}\\ntemplate <int m>\\nstruct static_modint : internal::modint_base<static_modint<m>>\\n{\\n using mint = static_modint;\\nprivate:\\n friend struct internal::modint_base<static_modint<m>>;\\n uint _v;\\n static constexpr uint umod() { return m; }\\n static constexpr bool prime = internal::isprime32<m>;\\npublic:\\n static constexpr int mod() { return m; }\\n static mint raw(int v)\\n {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n static_modint() : _v(0) {}\\n template <class T>\\n static_modint(T v)\\n {\\n if constexpr (is_signed_v<T>)\\n {\\n ll x = (ll)(v % (ll)(umod()));\\n if (x < 0)\\n x += umod();\\n _v = (uint)x;\\n }\\n else if constexpr (is_unsigned_v<T>)\\n {\\n _v = (uint)(v % umod());\\n }\\n else\\n {\\n static_assert(is_signed_v<T> || is_unsigned_v<T>, \\\"Unsupported Type\\\");\\n }\\n }\\n int val() const { return (int)_v; }\\n mint& operator*=(const mint &rhs)\\n {\\n ull z = _v;\\n z *= rhs._v;\\n _v = (uint)(z % umod());\\n return *this;\\n }\\n mint inv() const\\n {\\n if (prime)\\n {\\n assert(_v != 0);\\n return CREF.pow(umod() - 2);\\n }\\n else\\n {\\n auto [g, x, y] = extgcd<int>(_v, m);\\n assert(g == 1);\\n return x;\\n }\\n }\\n};\\ntemplate <int id>\\nstruct dynamic_modint : internal::modint_base<dynamic_modint<id>>\\n{\\n using mint = dynamic_modint;\\nprivate:\\n friend struct internal::modint_base<dynamic_modint<id>>;\\n uint _v;\\n static internal::barrett32 bt;\\n static uint umod() { return bt.umod(); }\\npublic:\\n static int mod() { return (int)(bt.umod()); }\\n static mint raw(int v)\\n {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n dynamic_modint() : _v(0) {}\\n template <class T>\\n dynamic_modint(T v)\\n {\\n if constexpr (is_signed_v<T>)\\n {\\n ll x = (ll)(v % (ll)(umod()));\\n if (x < 0)\\n x += umod();\\n _v = (uint)x;\\n }\\n else if constexpr (is_unsigned_v<T>)\\n {\\n _v = (uint)(v % umod());\\n }\\n else\\n {\\n static_assert(is_signed_v<T> || is_unsigned_v<T>, \\\"Unsupported Type\\\");\\n }\\n }\\n int val() const { return (int)_v; }\\n mint& operator*=(const mint &rhs)\\n {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint inv() const\\n {\\n auto [g, x, y] = extgcd<int>(_v, mod());\\n assert(g == 1);\\n return x;\\n }\\n};\\ntemplate <int id>\\ninternal::barrett32 dynamic_modint<id>::bt(998244353);\\nusing modint = dynamic_modint<-1>;\\ntemplate <class T>\\nstruct is_static_modint : false_type {};\\ntemplate <int m>\\nstruct is_static_modint<static_modint<m>> : true_type {};\\ntemplate <class T>\\ninline constexpr bool is_static_modint_v = is_static_modint<T>::value;\\ntemplate <class T>\\nstruct is_dynamic_modint : false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : true_type {};\\ntemplate <class T>\\ninline constexpr bool is_dynamic_modint_v = is_dynamic_modint<T>::value;\\ntemplate <class T>\\nstruct PowerTable\\n{\\nprivate:\\n decltype(T::mod()) mod;\\n T base;\\n vc<T> pw;\\npublic:\\n PowerTable() {}\\n PowerTable(T base) : mod(T::mod()), base(base), pw(1, 1) {}\\n void reserve(int n)\\n {\\n if (mod != T::mod())\\n {\\n mod = T::mod();\\n pw = {1};\\n }\\n int i = pw.size();\\n if (n < i)\\n return;\\n pw.resize(n + 1);\\n for (; i <= n; i++)\\n pw[i] = pw[i - 1] * base;\\n }\\n T pow(int n)\\n {\\n reserve(n);\\n return pw[n];\\n }\\n};\\ntemplate <class T>\\nstruct Binomial\\n{\\nprivate:\\n static decltype(T::mod()) mod;\\n static vc<T> fac_, finv_, inv_;\\npublic:\\n static void reserve(int n)\\n {\\n if (mod != T::mod())\\n {\\n mod = T::mod();\\n fac_ = {1, 1}, finv_ = {1, 1}, inv_ = {0, 1};\\n }\\n int i = fac_.size();\\n chmin(n, T::mod() - 1);\\n if (n < i)\\n return;\\n fac_.resize(n + 1), finv_.resize(n + 1), inv_.resize(n + 1);\\n for (; i <= n; i++)\\n {\\n fac_[i] = fac_[i - 1] * T::raw(i);\\n inv_[i] = -inv_[T::mod() % i] * T::raw(T::mod() / i);\\n finv_[i] = finv_[i - 1] * inv_[i];\\n }\\n }\\n static T inv(T n)\\n {\\n assert(n != 0);\\n reserve(n.val());\\n return inv_[n.val()];\\n }\\n};\\ntemplate <class T> decltype(T::mod()) Binomial<T>::mod{};\\ntemplate <class T> vc<T> Binomial<T>::fac_{};\\ntemplate <class T> vc<T> Binomial<T>::finv_{};\\ntemplate <class T> vc<T> Binomial<T>::inv_{};\\nusing mint = modint;\\ntemplate <int k, class F, class T>\\nvoid tensor_power_array_destructive(const F &linear_map, vc<T> &v)\\n{\\n const int len = v.size();\\n if (len == 0)\\n return;\\n {\\n int len_ = len;\\n while (len_ % k == 0)\\n len_ /= k;\\n assert(len_ == 1 && \\\"v.size() must be a power of k\\\");\\n }\\n for (int d = 1; d < len; d *= k)\\n {\\n repi(iu, 0, len, d * k) repi(i, iu, iu + d)\\n {\\n array<T, k> tmp;\\n repi(j, k) tmp[j] = v[i + j * d];\\n tmp = linear_map(tmp);\\n repi(j, k) v[i + j * d] = tmp[j];\\n }\\n }\\n}\\ntemplate <class M, int k>\\nvoid zeta_supset_general_destructive(vc<typename M::S> &a)\\n{\\n using S = typename M::S;\\n auto linear_map = [&](array<S, k> &arr) -> array<S, k>\\n {\\n repi(i, k - 2, -1, -1) arr[i] = M::op(arr[i], arr[i + 1]);\\n return arr;\\n };\\n tensor_power_array_destructive<k>(linear_map, a);\\n}\\ntemplate <class M, int k>\\nvc<typename M::S> zeta_supset_general(vc<typename M::S> a)\\n{\\n zeta_supset_general_destructive<M, k>(a);\\n return a;\\n}\\nvoid init()\\n{\\n oj(mt.seed(random_device()()));\\n}\\nvoid main2()\\n{\\n LL(Q, M);\\n VEC(string, Q, S);\\n fem(s : S) rep(i, M) s.at(i)--;\\n vl A(Q);\\n rep(i, Q) A.at(i) = stol(S.at(i), nullptr, 3);\\n dump(S, A);\\n vl f(ipow(3, M), INF);\\n rep(i, Q) chmin(f.at(A.at(i)), i);\\n auto g = zeta_supset_general<MonoidMin<ll>, 3>(f);\\n dump(g | cp::index());\\n string ans(Q, '0');\\n rep(i, Q)\\n {\\n vl s = reversed(base_repr(A.at(i), 3, M));\\n rep(j, M)\\n {\\n if (s.at(j) == 2)\\n continue;\\n ll na = A.at(i) + ipow(3, j);\\n dump(s, A.at(i), na);\\n if (g.at(na) < i)\\n ans.at(i) = '1';\\n }\\n }\\n PRINT(ans);\\n}\\nvoid test()\\n{\\n}\\ntemplate <auto init, auto main2, auto test>\\nstruct Main\\n{\\n Main()\\n {\\n cauto CERR = [](string val, string color)\\n {\\n string s = \\\"\\\\033[\\\" + color + \\\"m\\\" + val + \\\"\\\\033[m\\\";\\n /* コードテストで確認する際にコメントアウトを外す\\n cerr << val;\\n //*/\\n };\\n CERR(\\\"\\\\n[FAST_IO]\\\\n\\\\n\\\", \\\"32\\\");\\n cout << fixed << setprecision(20);\\n test();\\n init();\\n CERR(\\\"\\\\n[SINGLE_TESTCASE]\\\\n\\\\n\\\", \\\"36\\\");\\n main2();\\n }\\n};\\nMain<init, main2, test> main_dummy;\\n}\\nint main() {}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 248120,\n \"score_of_the_acc\": -1.0717,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3184_10270988\",\n \"code_snippet\": \"// AOJ #3184 Hokkaido High School\\n// 2025.3.6\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint M;\\n\\nstruct Node {\\n int c[3];\\n int sub;\\n bool end;\\n};\\n\\nvector<Node> tr;\\n\\nint newNode(){\\n Node nd;\\n for(int i = 0; i < 3; i++) nd.c[i] = -1;\\n nd.sub = 0;\\n nd.end = false;\\n tr.push_back(nd);\\n return (int)tr.size() - 1;\\n}\\n\\nbool queryDom(int idx, int d, bool str, const int *v){\\n if(d == M) return (str && tr[idx].end);\\n for(int i = v[d]; i < 3; i++){\\n int nxt = tr[idx].c[i];\\n if(nxt == -1) continue;\\n bool nstr = str || (i > v[d]);\\n if(queryDom(nxt, d+1, nstr, v)) return true;\\n }\\n return false;\\n}\\n\\nvoid insertTrie(const int *v){\\n int idx = 0;\\n tr[idx].sub++;\\n for (int d = 0; d < M; d++){\\n int s = v[d];\\n if(tr[idx].c[s] == -1){\\n int nxt = newNode();\\n tr[idx].c[s] = nxt;\\n }\\n idx = tr[idx].c[s];\\n tr[idx].sub++;\\n }\\n if(!tr[idx].end) tr[idx].end = true;\\n}\\n\\nint removeDom(int idx, int d, bool str, const int *v){\\n int rem = 0;\\n if(d == M){\\n if(str && tr[idx].end){\\n tr[idx].end = false;\\n rem = 1;\\n }\\n tr[idx].sub = (tr[idx].end ? 1 : 0);\\n return rem;\\n }\\n for(int i = 0; i <= v[d] && i < 3; i++){\\n int nxt = tr[idx].c[i];\\n if(nxt == -1) continue;\\n bool nstr = str || (i < v[d]);\\n rem += removeDom(nxt, d+1, nstr, v);\\n if(tr[nxt].sub == 0) tr[idx].c[i] = -1;\\n }\\n int sum = (tr[idx].end ? 1 : 0);\\n for(int i = 0; i < 3; i++){\\n int nxt = tr[idx].c[i];\\n if(nxt != -1) sum += tr[nxt].sub;\\n }\\n tr[idx].sub = sum;\\n return rem;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n int Q;\\n cin >> Q >> M;\\n tr.reserve(1000000);\\n newNode();\\n\\n string ans; ans.resize(Q);\\n int v[20];\\n\\n for (int qi = 0; qi < Q; qi++){\\n string s;\\n cin >> s;\\n for (int i = 0; i < M; i++) v[i] = s[i] - '1';\\n bool sad = false;\\n if(tr[0].sub > 0 && queryDom(0, 0, false, v)) sad = true;\\n ans[qi] = sad ? '1' : '0';\\n\\n if(!sad){\\n removeDom(0, 0, false, v);\\n int idx = 0; bool found = true;\\n for (int i = 0; i < M; i++){\\n int d = v[i];\\n if(tr[idx].c[d] == -1){ found = false; break; }\\n idx = tr[idx].c[d];\\n }\\n if(found && tr[idx].end);\\n else insertTrie(v);\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 7624,\n \"score_of_the_acc\": -0.0111,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3184_10116573\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool mark[14348908];\\nint st[15];\\n\\nvoid less_mark(int num) {\\n if (mark[num]) return;\\n mark[num] = true;\\n int c = num;\\n int i = 0;\\n while (c) {\\n if (c % 3) less_mark(num - st[i]);\\n i++;\\n c /= 3;\\n }\\n}\\n\\nint main() {\\n int q, m;\\n cin >> q >> m;\\n st[0] = 1;\\n for (int i = 1; i < 15; i++) st[i] = st[i - 1] * 3;\\n while (q--) {\\n string s;\\n cin >> s;\\n int num = 0;\\n for (int i = 0; i < m; i++) {\\n num *= 3;\\n num += s[i] - '1';\\n }\\n if (mark[num]) cout << 1;\\n else {\\n less_mark(num);\\n mark[num] = false;\\n cout << 0;\\n }\\n }\\n cout << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1210,\n \"memory_kb\": 17432,\n \"score_of_the_acc\": -0.4595,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3184_6452181\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline ll time() {\\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nconst int N = 14348907; // 3^15\\nconst int inf = (1<<30);\\nint a[N],dp[N];\\n\\nint s3toi(string s){\\n int res = 0;\\n for(char c:s){\\n res = res*3 + (c-'1');\\n }\\n return res;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n,m; cin >> n >> m;\\n for(int i=0;i<N;i++){\\n a[i] = dp[i] = inf;\\n }\\n vector<string> s(n);\\n for(int i=0;i<n;i++){\\n cin >> s[i];\\n int u = s3toi(s[i]);\\n a[u] = min(a[u],i);\\n }\\n for(int i=N-1;i>=0;i--){\\n int base = 1;\\n int k = i;\\n int p = 0;\\n for(int j=0;j<m;j++){\\n int bit = k%3;\\n if(bit != 2){\\n int c = (k+1)*base + p;\\n if(c<N)dp[i] = min(dp[i], a[c]);\\n if(c<N)dp[i] = min(dp[i], dp[c]);\\n }\\n p += base*bit;\\n base *= 3;\\n k /= 3;\\n }\\n }\\n for(int i=0;i<n;i++){\\n int u = s3toi(s[i]);\\n if(dp[u] < i){\\n cout << \\\"1\\\";\\n }\\n else{\\n cout << \\\"0\\\";\\n }\\n }\\n cout << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 130804,\n \"score_of_the_acc\": -0.6566,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3184_5306157\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))\\n#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))\\n#define rep(i, n) For((i), 0, (n))\\n#define rrep(i, n) rFor((i), (n), 0)\\n#define fi first\\n#define se second\\n\\nusing namespace std;\\n\\ntypedef long long lint;\\ntypedef unsigned long long ulint;\\ntypedef pair<int, int> pii;\\ntypedef pair<lint, lint> pll;\\n\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T>\\nT div_floor(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a >= 0 ? a / b : (a + 1) / b - 1;\\n}\\ntemplate <class T>\\nT div_ceil(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a > 0 ? (a - 1) / b + 1 : a / b;\\n}\\n\\ntemplate <typename T>\\nstruct coord_comp {\\n vector<T> v;\\n bool sorted = false;\\n\\n coord_comp() {}\\n\\n int size() { return v.size(); }\\n\\n void add(T x) { v.push_back(x); }\\n\\n void build() {\\n sort(v.begin(), v.end());\\n v.erase(unique(v.begin(), v.end()), v.end());\\n sorted = true;\\n }\\n\\n int get_idx(T x) {\\n assert(sorted);\\n return lower_bound(v.begin(), v.end(), x) - v.begin();\\n }\\n};\\n\\nconstexpr lint mod = 1000000007;\\nconstexpr lint INF = mod * mod;\\nconstexpr int MAX = 200010;\\n\\nint high[15000000], same[15000000], pow3[16];\\n\\nint get_bit(int S, int i) { return S / pow3[i] % 3; }\\n\\nint main() {\\n pow3[0] = 1;\\n For(i, 1, 16) pow3[i] = pow3[i - 1] * 3;\\n\\n int q, m;\\n scanf(\\\"%d%d\\\", &q, &m);\\n rep(S, pow3[m]) high[S] = same[S] = mod;\\n int s[q];\\n rep(i, q) {\\n string t;\\n cin >> t;\\n s[i] = 0;\\n rep(j, m) s[i] += pow3[j] * (t[j] - '1');\\n chmin(same[s[i]], i);\\n }\\n\\n rrep(S, pow3[m]) {\\n chmin(same[S], high[S]);\\n if (same[S] < mod) {\\n rep(i, m) if (get_bit(S, i)) {\\n int T = S - pow3[i];\\n chmin(high[T], same[S]);\\n }\\n }\\n }\\n\\n rep(i, q) printf(\\\"%d\\\", high[s[i]] < i);\\n printf(\\\"\\\\n\\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1050,\n \"memory_kb\": 120168,\n \"score_of_the_acc\": -0.8102,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3184_4964791\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 500005\\n\\nint Q,M;\\nint dp[14348907];\\nint POW[16];\\nint CODE[SIZE];\\nstring input_str[SIZE];\\n\\n\\nint makeCode(string tmp_str){\\n\\n\\tint ret = 0;\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tret = 3*ret+(tmp_str[i]-'1');\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i <= 15; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*3;\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&Q,&M);\\n\\n\\tfor(int i = 0; i < POW[M]; i++){\\n\\n\\t\\tdp[i] = BIG_NUM;\\n\\t}\\n\\n\\tfor(int i = 0; i < Q; i++){\\n\\n\\t\\tcin >> input_str[i];\\n\\t\\tCODE[i] = makeCode(input_str[i]);\\n\\n\\t\\tdp[CODE[i]] = min(dp[CODE[i]],i);\\n\\t}\\n\\n\\tfor(int state = POW[M]-1; state >= 0; state--){\\n\\t\\tfor(int loop = M-1; loop >= 0; loop--){\\n\\t\\t\\tif((state/POW[loop])%3 == 2)continue;\\n\\n\\t\\t\\tdp[state] = min(dp[state],dp[state+POW[loop]]);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < Q; i++){\\n\\t\\tint tmp = BIG_NUM;\\n\\t\\tfor(int loop = M-1; loop >= 0; loop--){\\n\\t\\t\\tif((CODE[i]/POW[loop])%3 == 2)continue;\\n\\n\\t\\t\\ttmp = min(tmp,dp[CODE[i]+POW[loop]]);\\n\\t\\t}\\n\\t\\tif(tmp < i){\\n\\n\\t\\t\\tprintf(\\\"1\\\");\\n\\t\\t}else{\\n\\n\\t\\t\\tprintf(\\\"0\\\");\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1270,\n \"memory_kb\": 96444,\n \"score_of_the_acc\": -0.8113,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3184_4883826\",\n \"code_snippet\": \"// #pragma GCC optimize(\\\"unroll-loops\\\", \\\"omit-frame-pointer\\\", \\\"inline\\\")\\n// #pragma GCC option(\\\"arch=native\\\", \\\"tune=native\\\", \\\"no-zero-upper\\\")\\n// #pragma GCC\\n// target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native\\\")\\n// #pragma GCC optimize(\\\"Ofast\\\")\\n// #pragma GCC optimize(\\\"tree-vectorize\\\",\\\"openmp\\\",\\\"predictive-commoning\\\")\\n// #pragma GCC option(\\\"D_GLIBCXX_PARALLEL\\\",\\\"openmp\\\")\\n\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vll;\\n// #define int long long\\n#define pb push_back\\n#define mp make_pair\\n#define eps 1e-9\\n#define INF 2000000000 // 2e9\\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\\n#define fi first\\n#define sec second\\n#define all(x) (x).begin(), (x).end()\\n#define sq(x) ((x) * (x))\\n#define dmp(x) cerr << #x << \\\": \\\" << x << endl;\\n\\ntemplate <class T>\\nvoid chmin(T &a, const T &b) {\\n if (a > b) a = b;\\n}\\ntemplate <class T>\\nvoid chmax(T &a, const T &b) {\\n if (a < b) a = b;\\n}\\n\\ntemplate <class T>\\nusing MaxHeap = priority_queue<T>;\\ntemplate <class T>\\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T>\\nvector<T> vect(int len, T elem) {\\n return vector<T>(len, elem);\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << p.fi << ',' << p.sec;\\n return os;\\n}\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n is >> p.fi >> p.sec;\\n return is;\\n}\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i];\\n if (i + 1 < vec.size()) os << ' ';\\n }\\n return os;\\n}\\ntemplate <class T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\\n return is;\\n}\\nvoid fastio() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(20);\\n}\\n\\n#define endl \\\"\\\\n\\\"\\n\\ntemplate <int MOD> // if inv is needed, this shold be prime.\\nstruct ModInt {\\n ll val;\\n ModInt() : val(0ll) {}\\n ModInt(const ll &v) : val(((v % MOD) + MOD) % MOD) {}\\n bool operator==(const ModInt &x) const { return val == x.val; }\\n bool operator!=(const ModInt &x) const { return !(*this == x); }\\n bool operator<(const ModInt &x) const { return val < x.val; }\\n bool operator>(const ModInt &x) const { return val > x.val; }\\n bool operator>=(const ModInt &x) const { return !(*this < x); }\\n bool operator<=(const ModInt &x) const { return !(*this > x); }\\n ModInt operator-() const { return ModInt(MOD - val); }\\n ModInt inv() const { return this->pow(MOD - 2); }\\n ModInt &operator+=(const ModInt &x) {\\n if ((val += x.val) >= MOD) val -= MOD;\\n return *this;\\n }\\n ModInt &operator-=(const ModInt &x) {\\n if ((val += MOD - x.val) >= MOD) val -= MOD;\\n return *this;\\n }\\n ModInt &operator*=(const ModInt &x) {\\n (val *= x.val) %= MOD;\\n return *this;\\n }\\n ModInt &operator/=(const ModInt &x) { return *this *= x.inv(); };\\n ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }\\n ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }\\n ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }\\n ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }\\n friend istream &operator>>(istream &i, ModInt &x) {\\n ll v;\\n i >> v;\\n x = v;\\n return i;\\n }\\n friend ostream &operator<<(ostream &o, const ModInt &x) {\\n o << x.val;\\n return o;\\n }\\n ModInt pow(ll x) const {\\n auto res = ModInt(1ll);\\n auto b = *this;\\n while (x) {\\n if (x & 1) res *= b;\\n x >>= 1;\\n b *= b;\\n }\\n return res;\\n }\\n};\\n\\ntemplate <int MOD>\\nModInt<MOD> pow(ModInt<MOD> a, ll x) {\\n ModInt<MOD> res = ModInt<MOD>(1ll);\\n while (x) {\\n if (x & 1) res *= a;\\n x >>= 1;\\n a *= a;\\n }\\n return res;\\n}\\n\\nconstexpr int MOD = 1e9 + 7;\\n// constexpr int MOD = 998244353;\\nusing mint = ModInt<MOD>;\\n\\nvoid solve() {\\n int Q, M;\\n cin >> Q >> M;\\n vector<int> pow3(M + 1, 1);\\n for (int i = 0; i < M; i++) pow3[i + 1] = pow3[i] * 3;\\n vector<int> dp(pow3[M], INF);\\n auto encode = [](const string &s) -> int {\\n int ret = 0;\\n for (int i = 0; i < s.size(); i++) { ret = ret * 3 + (s[i] - '1'); }\\n return ret;\\n };\\n vector<int> grade(Q);\\n for (int i = 0; i < Q; i++) {\\n string s;\\n cin >> s;\\n int val = encode(s);\\n grade[i] = val;\\n chmin(dp[val], i);\\n }\\n // dmp(dp);\\n for (int d = 0; d < M; d++) {\\n for (int i = pow3[M] - 1; i >= 0; i--) {\\n int dig = (i % pow3[d + 1] - i % pow3[d]) / pow3[d];\\n if (dig == 2) continue;\\n chmin(dp[i], dp[i + pow3[d]]);\\n }\\n }\\n // dmp(dp);\\n for (int i = 0; i < Q; i++) {\\n int g = grade[i];\\n int min_ind = INF;\\n for (int d = 0; d < M; d++) {\\n int dig = (g % pow3[d + 1] - g % pow3[d]) / pow3[d];\\n if (dig == 2) continue;\\n chmin(min_ind, dp[g + pow3[d]]);\\n }\\n if (min_ind < i)\\n cout << 1;\\n else\\n cout << 0;\\n }\\n cout << endl;\\n return;\\n}\\n\\nsigned main() {\\n fastio();\\n solve();\\n // int t;\\n // cin >> t;\\n // while (t--) solve();\\n\\n // int t; cin >> t;\\n // for(int i=1;i<=t;i++){\\n // cout << \\\"Case #\\\" << i << \\\": \\\";\\n // solve();\\n // }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1440,\n \"memory_kb\": 61208,\n \"score_of_the_acc\": -0.7426,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3184_4871744\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#ifdef _DEBUG\\n#include \\\"_DEBUG.hpp\\\"\\n#endif\\n#define int long long\\nusing namespace std;\\nusing P = pair<int, int>;\\nconst int inf = 2e18;\\nconst int mod = 1e9 + 7;\\n\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v) {\\n for (T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate <class T>\\nvector<T> make_vec(size_t a) {\\n return vector<T>(a);\\n}\\n\\ntemplate <class T, class... Ts>\\nauto make_vec(size_t a, Ts... ts) {\\n return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\\n}\\n\\ntemplate <class T, class V>\\ntypename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate <class T, class V>\\ntypename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v) {\\n for (auto &e : t) fill(e, v);\\n}\\n\\nint enc(string s) {\\n int res = 0;\\n for (int i = 0; i < s.size(); i++) {\\n res = res * 3 + (s[i] - '1');\\n }\\n return res;\\n}\\n\\nsigned main() {\\n int q, m;\\n cin >> q >> m;\\n vector<string> s(q);\\n cin >> s;\\n\\n vector<bool> dp(pow(3, m), false);\\n\\n auto dfs = [&](auto &&dfs, string &s) -> void {\\n if (dp[enc(s)]) return;\\n dp[enc(s)] = true;\\n for (int i = 0; i < m; i++) {\\n if (s[i] == '1') continue;\\n s[i]--;\\n dfs(dfs, s);\\n s[i]++;\\n }\\n };\\n\\n for (int i = 0; i < q; i++) {\\n if (dp[enc(s[i])]) {\\n cout << \\\"1\\\";\\n } else {\\n cout << \\\"0\\\";\\n for (int j = 0; j < m; j++) {\\n if (s[i][j] == '1') continue;\\n s[i][j]--;\\n dfs(dfs, s[i]);\\n s[i][j]++;\\n }\\n }\\n }\\n cout << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2530,\n \"memory_kb\": 21036,\n \"score_of_the_acc\": -1.0663,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3184_4866090\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<iomanip>\\n#include<cmath>\\n#include<vector>\\n#include<algorithm>\\n#include<utility>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define endl \\\"\\\\n\\\"\\n\\nconstexpr long long INF = (long long)1e18;\\nconstexpr long long MOD = 1'000'000'007; \\n\\n// struct fast_io {\\n\\t// fast_io(){\\n\\t\\t// std::cin.tie(nullptr);\\n\\t\\t// std::ios::sync_with_stdio(false);\\n\\t// };\\n// } fio;\\n\\nconstexpr int MAX = 15'000'000; // < 3^15 = 14348907\\n\\nint Q, M;\\nvector<int> S;\\nvector<int> used(MAX);\\nint t[20];\\n\\nint to_num(string &s){\\n\\tint res = 0;\\n\\t\\n\\tfor(int i = 0; i < s.size(); i++){\\n\\t\\tres = res * 3 + s[i] - '1';\\n\\t}\\n\\t\\n\\treturn res;\\n}\\n\\nvoid check(string &s, int num){\\n\\t// int num = to_num(s);\\n\\t\\n\\t// cout<<\\\"s = \\\"<<s<<\\\" num = \\\"<<num<<\\\" <> \\\"<<to_num(s)<<endl;\\n\\t\\n\\tif(used[num]) return ;\\n\\tused[num] = true;\\n\\t\\n\\t\\n\\tfor(int i = 0, j = 1; i < s.size(); i++){\\n\\t\\t\\n\\t\\ts[i]--;\\n\\t\\t// cout<<\\\"i \\\"<<i<<\\\" s = \\\"<<s[i]<<endl;\\n\\t\\tif(s[i] <= '0') {\\n\\t\\t\\ts[i]++;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tnum -= t[M-i-1];\\n\\t\\tcheck(s, num);\\n\\t\\tnum += t[M-i-1];\\n\\t\\ts[i]++;\\n\\t}\\n}\\n\\nsigned main(){\\n\\tcout<<fixed<<setprecision(10);\\n\\t\\n\\t// string ans;\\n\\tvector<int> ans;\\n\\t\\n\\tt[0] = 1;\\n\\tfor(int i = 1; i < 17; i++){\\n\\t\\tt[i] = t[i-1] * 3;\\n\\t}\\n\\t\\n\\tcin>>Q>>M;\\n\\t\\n\\tans.resize(Q);\\n\\t\\n\\tfor(int i = 0; i < Q; i++){\\n\\t\\tint num = 0;\\n\\t\\tstring s;\\n\\t\\t\\n\\t\\tcin>>s;\\n\\t\\t\\n\\t\\tnum = to_num(s);\\n\\t\\t// cout<<\\\"s = \\\"<<s<<\\\" num = \\\"<<num<<endl;\\n\\t\\tif(used[num]) {\\n\\t\\t\\t// ans += \\\"1\\\";\\n\\t\\t\\tans[i] = 1;\\n\\t\\t\\tcontinue;\\n\\t\\t} else {\\n\\t\\t\\t// ans += \\\"0\\\";\\n\\t\\t}\\n\\t\\t\\n\\t\\tcheck(s, num);\\n\\t\\t\\n\\t\\tused[num] = false;\\n\\t}\\n\\t\\n\\t// cout<<ans<<endl;\\n\\t\\n\\tfor(int i = 0; i < ans.size(); i++){\\n\\t\\tcout<<ans[i];\\n\\t}\\n\\tcout<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1600,\n \"memory_kb\": 124028,\n \"score_of_the_acc\": -1.0727,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3184_4849984\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n//----------------------- Print Function ----------------------//\\n\\ninline void print() {\\n cout << '\\\\n';\\n}\\ntemplate <typename First, typename... Rest>\\nvoid print(const First &first, const Rest &... rest) {\\n cout << first << ' ';\\n print(rest...);\\n}\\n\\ntemplate <typename T>\\nvoid print(const T &a) {\\n for (auto e : a) cout << e << ' ';\\n cout << '\\\\n';\\n}\\n\\n//------------------------- Libraries -------------------------//\\n\\ntemplate<class T>\\nbool chmin(T& a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n \\ntemplate<class T>\\nbool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n//--------------------------- Solve ---------------------------//\\n\\nint encode(string s) {\\n int res = 0;\\n for (int i = s.size()-1; i >= 0; i--) {\\n res *= 3;\\n res += (int)(s[i] - '1');\\n }\\n return res;\\n}\\n\\nvoid solve() {\\n int Q, M; cin >> Q >> M;\\n vector<string> S(Q);\\n vector<int> state(Q);\\n for (int i = 0; i < Q; i++) {\\n cin >> S[i];\\n state[i] = encode(S[i]);\\n }\\n\\n vector<int> three(M+1, 1);\\n for (int i = 0; i < M; i++) three[i+1] = three[i]*3;\\n\\n vector<int> dp(three[M], Q);\\n for (int q = 0; q < Q; q++) {\\n chmin(dp[state[q]], q);\\n }\\n for (int bit = three[M]-1; bit >= 0; bit--) {\\n for (int i = 0; i < M; i++) {\\n if (bit / three[i] % 3 != 2) {\\n chmin(dp[bit], dp[bit+three[i]]);\\n }\\n }\\n }\\n for (int q = 0; q < Q; q++) {\\n int res = Q;\\n for (int i = 0; i < M; i++) {\\n if (S[q][i] == '3') continue;\\n chmin(res, dp[state[q]+three[i]]);\\n }\\n cout << (res < q ? 1 : 0);\\n }\\n cout << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1010,\n \"memory_kb\": 76856,\n \"score_of_the_acc\": -0.6142,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3184_4849643\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG // for STL debug (optional)\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <cfloat>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <fstream>\\n#include <functional>\\n#include <bitset>\\nusing namespace std;\\nusing ll = long long int;\\nusing int64 = long long int;\\n \\ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\\n \\nint dx[] = {0, 0, 1, -1};\\nint dy[] = {1, -1, 0, 0};\\nconst int INF = 1LL << 29;\\nconst ll LONGINF = 1LL << 60;\\nconst ll MOD = 1000000007LL;\\n\\nint bit_stoi(string s) {\\n int res = 0;\\n for(auto c : s) {\\n assert('0' <= c and c <= '2');\\n res = res*3 + (c - '0');\\n }\\n return res;\\n}\\n\\nstring bit_tostring(int v, int len) {\\n string res = \\\"\\\";\\n for(int i=0; i<len; i++) {\\n res += (char)('0' + (v % 3));\\n v /= 3;\\n }\\n return string(res.rbegin(), res.rend());\\n}\\n\\nint main() {\\n int Q, M; scanf(\\\"%d%d\\\", &Q, &M);\\n int N = 1;\\n for(int i=0; i<M; i++) N *= 3;\\n \\n vector<string> vs(Q);\\n vector<int> values(Q), rec(N, INF), mod(N);\\n for(int i=0; i<Q; i++) {\\n cin >> vs[i];\\n for(auto &c : vs[i]) c--;\\n int value = bit_stoi(vs[i]);\\n values[i] = value;\\n chmin(rec[value], i);\\n }\\n for(int i=0; i<N; i++) mod[i] = i % 3;\\n\\n for(int k=0, p=1; k<M; k++, p*=3) {\\n for(int i=N-1; i>=0; i--) {\\n int d = (i/p) % 3;\\n if(d - 1 >= 0) {\\n chmin(rec[i-p], rec[i]);\\n }\\n }\\n }\\n \\n string ans = \\\"\\\";\\n for(int i=0; i<Q; i++) {\\n bool ng = false;\\n int v = values[i];\\n for(int k=0, p=1; k<M; k++, p*=3) {\\n int d = mod[v/p];\\n if(d == 3) d = 0;\\n if(d + 1 < 3) {\\n int nv = v + p;\\n ng |= (rec[nv] < i);\\n }\\n }\\n ans += (char)('0' + ng);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 840,\n \"memory_kb\": 133892,\n \"score_of_the_acc\": -0.7725,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3184_4849624\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG // for STL debug (optional)\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <cfloat>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <fstream>\\n#include <functional>\\n#include <bitset>\\nusing namespace std;\\nusing ll = long long int;\\nusing int64 = long long int;\\n \\ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\\n \\nint dx[] = {0, 0, 1, -1};\\nint dy[] = {1, -1, 0, 0};\\nconst int INF = 1LL << 29;\\nconst ll LONGINF = 1LL << 60;\\nconst ll MOD = 1000000007LL;\\n\\nint bit_stoi(string s) {\\n int res = 0;\\n for(auto c : s) {\\n assert('0' <= c and c <= '2');\\n res = res*3 + (c - '0');\\n }\\n return res;\\n}\\n\\nstring bit_tostring(int v, int len) {\\n string res = \\\"\\\";\\n for(int i=0; i<len; i++) {\\n res += (char)('0' + (v % 3));\\n v /= 3;\\n }\\n return string(res.rbegin(), res.rend());\\n}\\n\\nint main() {\\n int Q, M; scanf(\\\"%d%d\\\", &Q, &M);\\n int N = 1;\\n for(int i=0; i<M; i++) N *= 3;\\n \\n vector<string> vs(Q);\\n vector<int> values(Q), rec(N, INF), mod(N);\\n for(int i=0; i<Q; i++) {\\n cin >> vs[i];\\n for(auto &c : vs[i]) c--;\\n int value = bit_stoi(vs[i]);\\n values[i] = value;\\n chmin(rec[value], i);\\n }\\n for(int i=0; i<N; i++) mod[i] = i % 3;\\n\\n vector<bool> checked(N);\\n auto dfs = [&](auto &&f, int v) -> void {\\n checked[v] = true;\\n for(int i=0, p=1; i<M; i++, p*=3) {\\n int d = mod[v/p];\\n if(d + 1 < 3) {\\n int nv = v + p;\\n if(!checked[nv]) f(f, nv);\\n chmin(rec[v], rec[nv]);\\n }\\n }\\n };\\n dfs(dfs, 0);\\n\\n string ans = \\\"\\\";\\n for(int i=0; i<Q; i++) {\\n bool ng = false;\\n int v = values[i];\\n for(int k=0, p=1; k<M; k++, p*=3) {\\n int d = mod[v/p];\\n if(d == 3) d = 0;\\n if(d + 1 < 3) {\\n int nv = v + p;\\n ng |= (rec[nv] < i);\\n }\\n }\\n ans += (char)('0' + ng);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2180,\n \"memory_kb\": 135684,\n \"score_of_the_acc\": -1.3807,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3184_4849307\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n\\n// 文字列を3進数でエンコード\\nint enc(const std::string& s) {\\n int ret = 0;\\n for (char c : s) {\\n ret = ret * 3 + (c - '1');\\n }\\n return ret;\\n}\\n\\nvoid solve() {\\n int q, m;\\n std::cin >> q >> m;\\n\\n // k = 3^m\\n int k = 1;\\n for (int i = 0; i < m; ++i) k *= 3;\\n\\n std::vector<bool> out(k, false); // 既に上位互換が存在するか\\n\\n // 下位互換を全てtrueに更新する\\n auto propagate = [&](auto&& f, std::string& s) -> void {\\n if (out[enc(s)]) return; // 枝刈り\\n\\n out[enc(s)] = true;\\n for (int i = 0; i < m; ++i) {\\n if (s[i] == '1') continue;\\n --s[i];\\n f(f, s);\\n ++s[i];\\n }\\n };\\n\\n while (q--) {\\n std::string s;\\n std::cin >> s;\\n\\n if (out[enc(s)]) {\\n std::cout << \\\"1\\\";\\n continue;\\n }\\n\\n std::cout << \\\"0\\\";\\n\\n // 下位互換を更新\\n for (int i = 0; i < m; ++i) {\\n if (s[i] == '1') continue;\\n --s[i];\\n propagate(propagate, s);\\n ++s[i];\\n }\\n }\\n\\n std::cout << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1860,\n \"memory_kb\": 4924,\n \"score_of_the_acc\": -0.6996,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3184_4849249\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n\\nint enc(const std::string& s) {\\n int ret = 0;\\n for (char c : s) {\\n ret = ret * 3 + (c - '1');\\n }\\n return ret;\\n}\\n\\nvoid solve() {\\n int n, m;\\n std::cin >> n >> m;\\n\\n int k = 1;\\n for (int i = 0; i < m; ++i) k *= 3;\\n\\n std::vector<bool> out(k, false);\\n auto propagate = [&](auto&& f, std::string& s) -> void {\\n if (out[enc(s)]) return;\\n\\n out[enc(s)] = true;\\n for (int i = 0; i < m; ++i) {\\n if (s[i] == '1') continue;\\n --s[i];\\n f(f, s);\\n ++s[i];\\n }\\n };\\n\\n while (n--) {\\n std::string s;\\n std::cin >> s;\\n\\n if (out[enc(s)]) {\\n std::cout << \\\"1\\\";\\n continue;\\n }\\n\\n std::cout << \\\"0\\\";\\n\\n for (int i = 0; i < m; ++i) {\\n if (s[i] == '1') continue;\\n --s[i];\\n propagate(propagate, s);\\n ++s[i];\\n }\\n }\\n\\n std::cout << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1870,\n \"memory_kb\": 4924,\n \"score_of_the_acc\": -0.704,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3184_4848608\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = int;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e9;\\nusing P = pair<ll, ll>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};\\nvoid debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\nstring convert(ll n,ll bit){\\n string ret(bit,'0');\\n for(ll i=0;i<bit;i++)if(n&1LL<<bit-1-i)ret[i]='1';\\n return ret;\\n}\\nstring convert(ll n){\\n ll bit=0;\\n while(n>=1<<bit)bit++;\\n return convert(n,max(1,bit));\\n}\\nll convert(string s){\\n ll ret=0;\\n ll n=s.size();\\n for(ll i=0;i<n;i++)if(s[i]=='1')ret|=1LL<<n-i-1;\\n return ret;\\n}\\nvector<ll> convert_base(ll n,ll m,ll base){\\n\\tvector<ll>ret(m,0);\\n\\tfor(ll i=0;i<m;i++){\\n\\t\\tret[i]=n%base;\\n\\t\\tn/=base;\\n\\t}\\n\\treturn ret;\\n}\\nll convert_base(vector<ll>v,ll base){\\n ll tmp=1,ret=0;\\n for(ll i=0;i<v.size();i++){\\n ret+=v[i]*tmp;\\n tmp*=base;\\n }\\n return ret;\\n}\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n ll q,m;cin>>q>>m;\\n ll sz=1;\\n rep(i,0,m)sz*=3;\\n vector<bool>dp(sz,false);\\n string ret;\\n while(q--){\\n string s;cin>>s;\\n ll pos=0;\\n rep(i,0,m){\\n pos*=3;\\n pos+=(s[i]-'1');\\n }\\n if(dp[pos])ret+='1';\\n else{\\n ret+='0';\\n queue<ll>que;\\n que.push(pos);\\n while(!que.empty()){\\n auto p=que.front();\\n que.pop();\\n auto sp=convert_base(p,m,3);\\n ll to=p;\\n ll add=1;\\n rep(i,0,m){\\n if(sp[i]==0){\\n add*=3;\\n continue;\\n }\\n to-=add;\\n if(!dp[to]){\\n dp[to]=true;\\n que.push(to);\\n }\\n to+=add;\\n add*=3;\\n }\\n }\\n }\\n //debug(dp,sz);\\n }\\n cout<<ret<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2270,\n \"memory_kb\": 12424,\n \"score_of_the_acc\": -0.9142,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3184_4848590\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n/*\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it << \\\"> \\\"; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it.first << \\\"->\\\" << it.second << \\\"> \\\"; } return s << endl; }\\n#include <sys/time.h>\\ndouble getTime() {\\n struct timeval s;\\n gettimeofday(&s, NULL);\\n return s.tv_sec + s.tv_usec * 1e-6;\\n}\\n*/\\n\\ninline int conv(const string &s) {\\n int res = 0;\\n for (int i = s.size()-1; i >= 0; --i) res *= 3, res += (int)(s[i] - '1');\\n return res;\\n}\\n\\ninline string decode(int bit, int M) {\\n string res = \\\"\\\";\\n while (bit) res += (char)('1' + (bit%3)), bit /= 3;\\n while (res.size() < M) res += \\\"1\\\";\\n return res;\\n}\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n vector<string> S(N);\\n vector<int> bitS(N);\\n for (int q = 0; q < N; ++q) cin >> S[q], bitS[q] = conv(S[q]);\\n\\n vector<int> three(M+1, 1);\\n for (int i = 0; i < M; ++i) three[i+1] = three[i] * 3;\\n vector<int> dp(three[M], N);\\n for (int q = 0; q < N; ++q) chmin(dp[bitS[q]], q);\\n for (int bit = three[M]-1; bit >= 0; --bit) {\\n for (int i = 0; i < M; ++i) {\\n if (bit / three[i] % 3 == 2) continue;\\n chmin(dp[bit], dp[bit + three[i]]);\\n }\\n }\\n for (int q = 0; q < N; ++q) {\\n int res = N;\\n for (int i = 0; i < M; ++i) {\\n if (S[q][i] == '3') continue;\\n chmin(res, dp[bitS[q] + three[i]]);\\n }\\n cout << (res < q ? 1 : 0);\\n }\\n cout << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1750,\n \"memory_kb\": 96160,\n \"score_of_the_acc\": -1.0254,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3184_4848583\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it << \\\"> \\\"; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it.first << \\\"->\\\" << it.second << \\\"> \\\"; } return s << endl; }\\n#include <sys/time.h>\\ndouble getTime() {\\n struct timeval s;\\n gettimeofday(&s, NULL);\\n return s.tv_sec + s.tv_usec * 1e-6;\\n}\\n\\n\\ninline int conv(const string &s) {\\n int res = 0;\\n for (int i = s.size()-1; i >= 0; --i) res *= 3, res += (int)(s[i] - '1');\\n return res;\\n}\\n\\ninline string decode(int bit, int M) {\\n string res = \\\"\\\";\\n while (bit) res += (char)('1' + (bit%3)), bit /= 3;\\n while (res.size() < M) res += \\\"1\\\";\\n return res;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0); \\n\\n auto start = getTime();\\n\\n int N, M;\\n cin >> N >> M;\\n vector<string> S(N);\\n vector<int> bitS(N);\\n for (int q = 0; q < N; ++q) cin >> S[q], bitS[q] = conv(S[q]);\\n\\n //COUT(getTime() - start);\\n\\n vector<int> three(M+1, 1);\\n for (int i = 0; i < M; ++i) three[i+1] = three[i] * 3;\\n vector<int> dp(three[M], N);\\n for (int q = 0; q < N; ++q) chmin(dp[bitS[q]], q);\\n for (int bit = three[M]-1; bit >= 0; --bit) {\\n for (int i = 0; i < M; ++i) {\\n if (bit / three[i] % 3 == 2) continue;\\n chmin(dp[bit], dp[bit + three[i]]);\\n }\\n }\\n\\n //COUT(getTime() - start);\\n \\n for (int q = 0; q < N; ++q) {\\n int res = N;\\n for (int i = 0; i < M; ++i) {\\n if (S[q][i] == '3') continue;\\n chmin(res, dp[bitS[q] + three[i]]);\\n }\\n cout << (res < q ? 1 : 0);\\n }\\n cout << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1240,\n \"memory_kb\": 88240,\n \"score_of_the_acc\": -0.7641,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3184_4848498\",\n \"code_snippet\": \"/**\\n * author: otera \\n**/\\n#include<iostream>\\n#include<string> \\n#include<cstdio>\\n#include<cstring>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm> \\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<deque>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\ntypedef long double ld;\\nconst int inf=1e9+7;\\nconst ll INF=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-8;\\nconst ld pi = acos(-1.0);\\ntypedef pair<int, int> P;\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define pb push_back\\n#define debug(x) cerr << #x << \\\" = \\\" << (x) << endl;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nint q, m;\\nbitset<14348908> used;\\nbitset<14348908> sad;\\n\\nint f(string x) {\\n int pw = 1;\\n int ret = 0;\\n rep(i, m) {\\n ret += (x[i] - '1') * pw;\\n pw *= 3;\\n }\\n return ret;\\n}\\n\\nvoid solve() {\\n\\tcin >> q >> m;\\n vector<int> ans(q, 0);\\n queue<int> que;\\n rep(_, q) {\\n string s; cin >> s;\\n int cur = f(s);\\n // cerr << cur << endl;\\n if(sad[cur]) {\\n ans[_] = 1;\\n }\\n if(!used[cur]) {\\n used[cur] = 1;\\n que.push(cur);\\n while(!que.empty()) {\\n int t = que.front(); que.pop();\\n int pw = 1;\\n rep(i, m) {\\n int x = (t % (3 * pw)) / pw;\\n if(x >= 1) {\\n t -= pw;\\n if(!used[t]) {\\n que.push(t);\\n used[t] = 1;\\n sad[t] = 1;\\n }\\n if(!sad[t]) {\\n sad[t] = 1;\\n }\\n t += pw;\\n }\\n pw *= 3;\\n }\\n }\\n }\\n }\\n rep(i, q) {\\n cout << ans[i];\\n }\\n cout << \\\"\\\\n\\\";\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//int t; cin >> t; rep(i, t)solve();\\n\\tsolve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1860,\n \"memory_kb\": 16032,\n \"score_of_the_acc\": -0.7452,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3184_4848447\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 1020000;\\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\nint sad[20202020];\\nint cnt[20202020];\\nint num[505050];\\n\\nint main(){\\n\\tint q,m; cin >> q >> m;\\n\\tvs s(q); rep(i,q) cin >> s[i];\\n\\tint p = 1;\\n\\trep(i,m) p *= 3;\\n\\tp--;\\n\\trep(i,p+1){\\n\\t\\tsad[i] = inf;\\n\\t\\tcnt[i] = inf;\\n\\t}\\n\\trep(i,q){\\n\\t\\tint tmp = 1;\\n\\t\\trep(j,m){\\n\\t\\t\\tnum[i] += (s[i][j] - 1 - '0') * tmp;\\n\\t\\t\\ttmp *= 3;\\n\\t\\t}\\n\\t\\tchmin(cnt[num[i]],i);\\n\\t}\\n\\tint tmp = 1;\\n\\trep(i,m){\\n\\t\\tfor(int trit = p; trit > 0; trit--){\\n\\t\\t\\tint a = (trit / tmp) % 3;\\n\\t\\t\\tfor(int j=1; j<=a; j++){\\n\\t\\t\\t\\tchmin(sad[trit - tmp * j], min(sad[trit], cnt[trit]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ttmp *= 3;\\n\\t}\\n\\tstring ans(q,'@');\\n\\trep(i,q){\\n\\t\\tans[i] = (char)('0' + (sad[num[i]] < i));\\n\\t}\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1470,\n \"memory_kb\": 152508,\n \"score_of_the_acc\": -1.1315,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3184_4848338\",\n \"code_snippet\": \"/**\\n * author: otera \\n**/\\n#include<iostream>\\n#include<string> \\n#include<cstdio>\\n#include<cstring>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm> \\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<deque>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\n#define int long long\\ntypedef long long ll;\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\ntypedef long double ld;\\nconst int inf=1e9+7;\\nconst ll INF=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-8;\\nconst ld pi = acos(-1.0);\\ntypedef pair<int, int> P;\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define pb push_back\\n#define debug(x) cerr << #x << \\\" = \\\" << (x) << endl;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nvoid solve() {\\n\\tint q, m; cin >> q >> m;\\n int s = 1;\\n rep(_, m) s *= 3;\\n vector<int> st(s, inf);\\n vector<int> pos(q);\\n rep(i, q) {\\n string s; cin >> s;\\n int w = 0;\\n rep(_, m) {\\n w *= 3;\\n w += s[_] - '1';\\n }\\n chmin(st[w], i);\\n pos[i] = w;\\n }\\n vector<int> dp(s, inf);\\n vector<int> buf(m);\\n per(i, s) {\\n int now = i;\\n per(j, m) {\\n buf[j] = now % 3;\\n now /= 3; \\n }\\n int z = 1;\\n per(j, m) {\\n if(buf[j] < 2) {\\n chmin(dp[i], dp[i + z]);\\n chmin(dp[i], st[i + z]);\\n }\\n z *= 3;\\n }\\n }\\n rep(i, q) {\\n if(dp[pos[i]] < i) cout << 1;\\n else cout << 0;\\n }\\n cout << \\\"\\\\n\\\";\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//int t; cin >> t; rep(i, t)solve();\\n\\tsolve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 230988,\n \"score_of_the_acc\": -1.1403,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":1999,"cells":{"group_id":{"kind":"string","value":"aoj_3187_cpp"},"problem_description":{"kind":"string","value":"C: mod reap\n問題\nhara 君は、夏休みに農家でアルバイトをすることになりました。\nhara 君の仕事は、会津人参の収穫と、パック詰めです。\n畑には現在 $N$ 本の会津人参がなっていて、\n$i$ ($1 \\leq i \\leq N$) 番目の会津人参の重さは $A_i$ グラムです。\nhara 君は畑から何本かの会津人参を収穫し、 1 パックに\nちょうど\n$K$ グラムずつ入るように分けます。\nこのとき、会津人参をカットして複数のパックに分けてもかまいません。\nまた、全部収穫しても、あるいは\n1 本も収穫しなくてもよい\nものとします。\nhara 君は几帳面なので、以下の条件により hara 君の「満足度」が変化します。\n出来た $K$ グラム入りのパック 1 つにつき満足度が 1 増加します。\n最終的に余った (パックに入らなかった) 会津人参 1 グラムにつき満足度が 1 減少します。\nより形式的には、収穫した会津人参の合計量を $S$ グラムとしたとき、 hara 君の満足度 $f(S)$ は以下の式で計算されます。\n$$f(S) = \\lfloor S / K \\rfloor - (S \\bmod K)$$\nここで、$\\lfloor S / K \\rfloor$ とは $S \\div K$ の商、\n$S \\bmod K$ とは $S$ を $K$ で割った余りを意味します。\nこのとき、 hara 君の満足度の最大値を求めてください。\n入力形式\n$N$ $K$\n$A_1$ … $A_N$\n制約\n入力はすべて整数\n$1 \\leq N \\leq 50000$\n$1 \\leq K \\leq 100$\n$1 \\leq A_i \\leq K$\n出力形式\nhara 君の満足度の最大値を一行に出力してください。\n入力例 1\n3 5\n2 3 4\n出力例 1\n1\n1 番目と 2 番目の会津人参を収穫すると収穫量が 5 グラムとなり、 5 グラム入りのパックを 1 つ作ることができます。また、余りはないので満足度は 1 となり、これが最大です。\n入力例 2\n6 7\n1 2 3 4 5 6\n出力例 2\n3\nすべての会津人参を収穫すると合計で 21 グラムとなり、このとき満足度を 3 にできます。これが最大値となります。\n入力例 3\n5 100\n1 1 1 1 1\n出力例 3\n0\nこの場合、 1 本も収穫しないと満足度は 0 となり、これが最大です。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3187_8525842","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N,K;\n cin>>N>>K;\n vvll DP(N+1,vll(K,-1e18));\n DP[0][0]=0;\n rep(i,N){\n ll A;\n cin>>A;\n rep(k,K){\n chmax(DP[i+1][k],DP[i][k]);\n ll nk=k+A;\n chmax(DP[i+1][nk%K],DP[i][k]+nk/K);\n }\n }\n ll an=0;\n rep(i,K)chmax(an,DP[N][i]-i);\n cout<<an<<endl;\n\n}","accuracy":1,"time_ms":50,"memory_kb":44008,"score_of_the_acc":-0.6298,"final_rank":16},{"submission_id":"aoj_3187_7992963","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nusing namespace std;\nusing ll = long long ;\nusing P = pair<int,int>;\nconst int mod = 998244353;\nconst int inf = (1<<30);\n\nconst int dy[4] = {-1,0,0,1};\nconst int dx[4] = {0,-1,1,0};\n\nint main(){\n int n,k; cin>>n>>k;\n\n vector<int> a(n);\n rep(i,n) cin>>a[i];\n\n vector<vector<int>> dp(n+1,vector<int>(k,-inf));\n dp[0][0] = 0;\n rep(i,n){\n rep(j,k){\n if(dp[i][j] == -inf) continue;\n dp[i+1][(j+a[i])%k] = max(dp[i+1][(j+a[i])%k], dp[i][j]+a[i]);\n dp[i+1][j] = max(dp[i+1][j],dp[i][j]);\n }\n }\n\n int ans = 0;\n\n rep(i,k){\n ans = max(ans,(dp[n][i]/k) - i);\n }\n cout<<ans<<endl;\n\n\n}","accuracy":1,"time_ms":20,"memory_kb":24760,"score_of_the_acc":-0.3113,"final_rank":12},{"submission_id":"aoj_3187_7992942","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int inf = (int)1e9;\n\nint main() {\n int N, K; cin >> N >> K;\n vector dp(K, -inf);\n dp[0] = 0;\n for (int _ = 0 ; _ < N ; _++) {\n int A; cin >> A;\n vector nxt(K, -inf);\n for (int i = 0 ; i < K ; i++) {\n if (dp[i] == -inf) {\n continue;\n }\n int mod = (i + A) % K;\n bool add = ((i + A) >= K);\n nxt[mod] = max(nxt[mod], dp[i] + (int)add);\n nxt[i] = max(nxt[i], dp[i]);\n }\n dp = move(nxt);\n }\n\n int ans = -inf;\n for (int i = 0 ; i < K ; i++) {\n ans = max(ans, dp[i] - i);\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3444,"score_of_the_acc":-0.0237,"final_rank":3},{"submission_id":"aoj_3187_7992935","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint func(){\n int n;\n int k;\n cin >> n >> k;\n vector<int> dp1(k,-1e9);\n vector<int> dp2(k,-1e9);\n dp1[0] = 0;\n for(int i=0;i<n;++i){\n dp2.clear();\n dp2.assign(k,-1e9);\n int v;\n cin >> v;\n for(int j=0;j<k;++j){\n int j2 = (j + v) % k;\n dp2[j2] = max(dp2[j2], dp1[j] + v);\n dp2[j] = max(dp2[j], dp1[j]);\n }\n swap(dp1,dp2);\n }\n int res = -1e9;\n for(int i=0;i<k;++i){\n res = max(res, dp1[i] / k - dp1[i] % k);\n }\n return res;\n}\nint main(){\n cout << func() << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3452,"score_of_the_acc":-0.0238,"final_rank":4},{"submission_id":"aoj_3187_7011918","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3187.cc: Mod Reap\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 50000;\nconst int MAX_K = 100;\n\n/* typedef */\n\n/* global variables */\n\nint as[MAX_N], dp[2][MAX_K];\n\n/* subroutines */\n\ninline void setmax(int &a, int b) { if (a < b) a = b; }\n\n/* main */\n\nint main() {\n int n, k;\n scanf(\"%d%d\", &n, &k);\n for (int i = 0; i < n; i++) scanf(\"%d\", as + i);\n\n fill(dp[0], dp[0] + k, -1);\n dp[0][0] = 0;\n int cur = 0, nxt = 1;\n\n for (int i = 0; i < n; i++) {\n copy(dp[cur], dp[cur] + k, dp[nxt]);\n\n for (int j = 0; j < k; j++)\n if (dp[cur][j] >= 0) {\n\tint d0 = dp[cur][j], j1 = j + as[i];\n\tif (j1 >= k) j1 -= k, d0++;\n\tsetmax(dp[nxt][j1], d0);\n }\n\n swap(cur, nxt);\n }\n\n int maxd = 0;\n for (int j = 0; j < k; j++) setmax(maxd, dp[cur][j] - j);\n\n printf(\"%d\\n\", maxd);\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3140,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_3187_5895098","code_snippet":"#pragma region header\n#include <bits/stdc++.h>\nusing namespace std;\n// #include <atcoder/all>\n// using namespace atcoder;\n\n/* alias */\nusing ull = unsigned long long;\nusing ll = long long;\nusing vi = vector<int>;\nusing vl = vector<long>;\nusing vll = vector<long long>;\nusing vf = vector<float>;\nusing vvf = vector<vf>;\nusing vvi = vector<vi>;\nusing vvl = vector<vl>;\nusing vvll = vector<vll>;\nusing vs = vector<string>;\nusing vvs = vector<vs>;\nusing vc = vector<char>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvc = vector<vc>;\nusing pll = pair<ll, ll>;\nusing vpll = vector<pll>;\nusing qll = queue<ll>;\n//仮想配列map<> https://code-database.com/knowledges/100\n//優先度付きque https://atcoder.jp/contests/apg4b/tasks/APG4b_aa\n\n/* define short */\n#define MOD 1000000007\n#define INF LLONG_MAX/32\n#define elif else if\n#define pb push_back\n#define pf push_front\n#define fi first\n#define se second\n#define mp make_pair\n#define all(obj) (obj).begin(), (obj).end()\n#define YESNO(bool) if(bool){cout<<\"YES\"<<endl;}else{cout<<\"NO\"<<endl;}\n#define yesno(bool) if(bool){cout<<\"yes\"<<endl;}else{cout<<\"no\"<<endl;}\n#define YesNo(bool) if(bool){cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\n\n/* REP macro */\n#define reps(i, a, n) for (ll i = (a); i < (ll)(n); ++i)\n#define rep(i, n) reps(i, 0, n)\n#define rrep(i, n) reps(i, 1, n + 1)\n#define repd(i,n) for(ll i=n-1;i>=0;i--)\n#define rrepd(i,n) for(ll i=n;i>=1;i--)\n\n//小数点以下出力の時にmainに書く\n// cout << fixed << setprecision(10);\n\n#pragma endregion header\n\nll N;\n\n\nvvll Graph;/*グラフ*/\n// struct edge{ll to, cost;};\n// vector<vector<edge>> Graph;\nll H, W; vs HW;/*HW .#*/\n\n\n\n#pragma region fanction\n#pragma region First Search\n/*幅優先探索 vll dist(N,-1); Graphは隣接リスト*/\nvoid bfs(vll &dist, ll fq, vvll Graph){\n dist[fq] = 0;\n deque<ll> que;que.pb(fq);\n ll v;\n while(!que.empty()){\n v = que.front();que.pop_front();\n\n for(ll nv:Graph[v]){\n if(dist[nv] != -1) continue;\n dist[nv] = dist[v] + 1;\n que.pb(nv);\n }\n }\n}\n\n\n/*distにsysxからの距離が入る 各重み1*/\n/*HW幅優先探索 https://pyteyon.hatenablog.com/entry/2019/03/01/211133#%E6%B7%B1%E3%81%95%E5%84%AA%E5%85%88%E6%8E%A2%E7%B4%A2*/\n/*vvll dist(H vll(W)); rep(h,H) rep(w,W) dist[h][w] = INF;*/\nvoid HW_bfs(vvll &dist, ll sy, ll sx, vs HW){\n dist[sy][sx] = 0;\n deque<vll> que;\n que.pb({sy,sx});\n\n vll v;\n ll nowy, nowx, nexty,nextx;\n vvll dydx = {{1,0},{0,1},{-1,0},{0,-1}};\n\n //重み1ならpbしてd++ 重み0ならpfしてそのままdiseにd入れれば01bfs\n //que.back();que.pop_back()で深さ優先探索\n\n while(!que.empty()){\n v = que.front();que.pop_front();\n nowy = v[0]; nowx = v[1];\n for(vll dyx:dydx){\n nexty = nowy+dyx[0]; nextx = nowx+dyx[1];\n if(!(0 <= nexty && nexty < H && 0 <= nextx && nextx < W)) continue;\n if(HW[nexty][nextx] == '.' && dist[nexty][nextx] == INF){\n que.pb({nexty,nextx});\n dist[nexty][nextx] = dist[nowy][nowx] + 1;\n }\n }\n }\n}\n\n/*深さ優先探索 vll dist(N,-1); Graphは隣接リスト スタートのdistを0にすること！*/\nvoid dfs(vll &dist, ll v, vvll &Graph){\n for(ll nv:Graph[v]){\n if(dist[nv] != -1) continue;\n dist[nv] = dist[v] + 1;\n dfs(dist,nv,Graph);\n }\n}\n\n//単一始点最短経路 ダイクストラ O(MlogN)\n//vector<vector<pll>> //Graph; fi:to se:cost\n// Graph.resize(N);\n// rep(i,M){\n// ll a,b,c; cin >> a >> b >> c;\n// a--;b--;\n// Graph[a].pb(pll(b,c));\n// Graph[b].pb(pll(a,c));\n// }\n\nvll dijkstra(ll start,vector<vector<pll>> &Graph){\n vll dist(N,INF);\n priority_queue<pll,vector<pll>,greater<pll>> que;\n dist[start] = 0;\n que.push(pll(dist[start],start));\n while (!que.empty()){\n pll p = que.top(); que.pop();\n ll v = p.second;\n if(dist[v] < p.first) continue;\n for(auto &e:Graph[v]){\n if(dist[e.first] > dist[v] + e.second){\n dist[e.first] = dist[v] + e.second;\n que.push(pll(dist[e.first],e.first));\n }\n }\n }\n\n return dist;\n}\n\n#pragma endregion First Search\n#pragma region MOD\nconst ll nCkMax = 1e6;\nvll fac(1,0),finv(1,0),inv(1,0);\n\nvoid COMinit(){\n fac.resize(nCkMax);\n finv.resize(nCkMax);\n inv.resize(nCkMax);\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(ll i=2;i<nCkMax;i++){\n fac[i] = fac[i-1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n/*a^n % mod p O(log N)*/\nll modpow(ll a, ll n) {\n ll res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % MOD;\n a = a * a % MOD;\n n >>= 1;\n }\n return res;\n}\n/*a! mod p O(N)*/\nll modfac(ll n){\n ll ret = 1;\n rrep(i,n){\n ret *= i;\n ret %= MOD;\n }\n return ret;\n}\n\n/*nCk % mod 前処理O(N) クエリ処理O(1)*/\nll nCk(ll n, ll k){\n if(fac[0] != 1) COMinit();//初期化 O(N)\n if(n<k) return 0;\n if(n<0 || k<0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\nll factorial(ll n){\n ll ans = 1;\n for (ll i = 1;i<=n;i++){\n ans = ans * i % MOD;\n }\n return ans;\n}\n\nll nHk(ll n, ll k){\n return nCk(n+k-1,k);\n}\n#pragma endregion MOD\n#pragma region enumeration\nvvll make_n(vll v){\n vvll ret;\n vll tmp;\n ll n = v.size();\n do{\n tmp = {};\n rep(i,n) tmp.pb(v[i]);\n ret.pb(tmp);\n }while(next_permutation(all(v)));\n return ret;\n}\n/*nCk列挙 vvllなのに注意！*/\nvvll make_C(ll n, ll r){\n vvll ret;\n vll tmp;\n vector<bool> v(n);\n fill(v.end() - r, v.end(), true);\n do {\n tmp = {};\n for (int i = 0; i < n; ++i) { \n if (v[i]) tmp.pb(i);\n }\n ret.pb(tmp);\n } while (next_permutation(v.begin(), v.end()));\n //reverse(all(ret));\n return ret;\n}\n/*nPk列挙 nPnでn!列挙 この時順番通りになってる*/\nvvll make_P(ll n, ll r){\n vvll C = make_C(n,r);\n vvll ret;\n vvll tmp;\n vll v;\n rep(i,C.size()){\n v = C[i];\n tmp = make_n(v);\n for(vll t:tmp) ret.pb(t);\n }\n return ret;\n}\n\n#pragma endregion enumeration\n#pragma region array\n\n/*一次元配列最大最小総和*/\nll vmax(vll array){\n ll Max = -INF;\n for(ll a:array) chmax(Max,a);\n return Max;\n}\n\nll vmin(vll array){\n ll Min = INF;\n for(ll a:array) chmin(Min,a);\n return Min;\n}\n\nll sum(vll &array){\n ll Sum = 0;\n for(ll a:array) Sum += a;\n return Sum;\n}\n\n/*累積和 先頭に0が追加されてる lからrまではret[r+1]-ret[l]*/\nvll cumulatice_sum(vll &array){\n vll ret(array.size()+1,0);\n rep(i,array.size()) ret[i+1] = ret[i] + array[i];\n return ret;\n}\n\n/*重複消し*/\nvoid list_set(vll &array){\n sort(all(array));\n array.erase(unique(all(array)),array.end());\n}\n\n/*vvllで格納されてる配列をkey番目の要素でソート*/\nvoid vvllsort(vvll &array, ll key){\n sort(all(array),[&key](vll a,vll b){return a[key] < b[key];});\n}\n\n/*string Sに何個string Kが含まれるか 一文字でもいいけどcharじゃなくてstringにしてね*/\nll stringinstring(string &S,string K){\n ll ret = 0;\n rep(i,S.size()-K.size()+1){\n bool f = true;\n rep(j,K.size()) if(S[i+j] != K[j]) f=false;\n if(f) ret++;\n }\n return ret;\n}\n#pragma endregion array\n#pragma region UnionFind\nclass UnionFind{\npublic:\n vector<ll> parent; //parent[i]はiの親\n vector<ll> siz; //素集合のサイズを表す配列(1で初期化)\n map<ll,vector<ll>> group; //集合ごとに管理する(key:集合の代表元、value:集合の要素の配列)\n ll n; //要素数\n \n //コンストラクタ\n UnionFind(ll n_):n(n_),parent(n_),siz(n_,1){ \n //全ての要素の根が自身であるとして初期化\n for(ll i=0;i<n;i++){parent[i]=i;}\n }\n \n //データxの属する木の根を取得(経路圧縮も行う)\n ll root(ll x){\n if(parent[x]==x) return x;\n return parent[x]=root(parent[x]);//代入式の値は代入した変数の値なので、経路圧縮できる\n }\n \n //xとyの木を併合\n void unite(ll x,ll y){\n ll rx=root(x);//xの根\n ll ry=root(y);//yの根\n if(rx==ry) return;//同じ木にある時\n //小さい集合を大きい集合へと併合(ry→rxへ併合)\n if(siz[rx]<siz[ry]) swap(rx,ry);\n siz[rx]+=siz[ry];\n parent[ry]=rx;//xとyが同じ木にない時はyの根ryをxの根rxにつける\n }\n \n //xとyが属する木が同じかを判定\n bool same(ll x,ll y){\n ll rx=root(x);\n ll ry=root(y);\n return rx==ry;\n }\n \n //xの素集合のサイズを取得\n ll size(ll x){\n return siz[root(x)];\n }\n \n //素集合をそれぞれグループ化\n void grouping(){\n //経路圧縮を先に行う\n rep(i,n)root(i);\n //mapで管理する(デフォルト構築を利用)\n rep(i,n)group[parent[i]].pb(i);\n }\n \n //素集合系を削除して初期化\n void clear(){\n rep(i,n){parent[i]=i;}\n siz=vector<ll>(n,1);\n group.clear();\n }\n};\n#pragma endregion UnionFind\n#pragma region bisect\n/*二分探索*/\nll bisect_left(vll &array, ll key){\n return lower_bound(all(array),key) - array.begin();\n}\n\nll bisect_right(vll &array, ll key){\n return upper_bound(all(array),key) - array.begin();\n}\n\n/*最長増加部分列*/\nll LIS(vll a){\n vll dp(a.size(),INF);\n rep(i,a.size()){\n dp[bisect_right(dp,a[i])] = a[i];\n }\n return bisect_left(dp,INF);\n}\n/*条件を満たす最大のokを返す 最小にしたいならokng逆にする solveを書き換えること!*/\nbool solve(ll n){\n return true;\n}\n\nll meguru_bisect(ll ok, ll ng){\n ll mid;\n while(abs(ok-ng) > 1){\n mid = (ok + ng) / 2;\n if(solve(mid)) ok = mid;\n else ng = mid;\n }\n return ok;\n}\n#pragma endregion bisect\n#pragma region others\n\n/* memo\n\n二次元配列の90度回転\n// i:j \n// j:N - i - 1\n\n\n*/\n\n\n\n/*普通のa^n*/\nll pow(ll a, ll n){\n ll res = 1;\n while (n > 0) {\n if (n & 1) res *= a;\n a *= a;\n n >>= 1;\n }\n return res;\n}\n/*最大公約数*/\nll gcd(ll x,ll y){\n if (x < y) swap(x,y);\n while (y > 0){\n ll r = x % y;\n x = y;\n y = r;\n }\n return x;\n}\n\n/*最小公倍数*/\nll lcm(ll x,ll y){\n return x * y / (gcd(x,y));\n}\n\n/*約数列挙*/\nvll divisor(ll n){\n vll ret;\n for (ll i = 1; i * i <= n; i++){\n if (n % i == 0){\n ret.pb(i);\n if (i * i != n) ret.pb(n / i);\n }\n }\n sort(all(ret));\n return ret;\n}\n\n/*素因数分解*/\nvll factorize(ll n){\n vll ret;\n while (n % 2 == 0){\n ret.pb(2);\n n /= 2;\n }\n ll f = 3;\n while (f * f <= n){\n if (n % f == 0){\n ret.pb(f);\n n /= f;\n }else f += 2;\n }\n if (n != 1) ret.pb(n);\n return ret;\n}\nconst ll Eramax = 1e6+1;\nvll Eratos(1,1);\nvoid Erainit(){\n Eratos.resize(Eramax+1);\n rep(i,Eramax+1) Eratos[i] = i;\n for(ll i=2;i<Eramax;i++){\n if(Eratos[i] != i) continue;\n for(ll j=2*i;j<Eramax;j+=i) Eratos[j] = i;\n }\n Eratos[1] = -1;\n}\n//前処理型素因数分解 1e6以下を複数回やるならこっち\nvll Era_factorize(ll n){\n if(Eratos[0] != 0) Erainit();\n vll ret = {};\n if(n==1) return ret;\n while(n!=1){\n ret.pb(Eratos[n]);\n n /= Eratos[n];\n }\n return ret;\n}\n\n#pragma endregion others\n#pragma endregion fanction\n\n\n\n\nint main() {\n ll K; cin >> N >> K;\n vll cnt(K+1,0);\n rep(i,N){\n ll a; cin >> a;\n cnt[a]++;\n }\n\n // vvll dp(K+1,vll(N*K+1,-1));\n vll dp(N*K+1,-1);\n // vector<vector<bool>> dp(K+1,vector<bool>(N*K+1,false));\n dp[0] = 0;\n rep(i,K){\n \n rep(j,N*K+1){\n ll g = i + 1;\n ll cn = cnt[i+1];\n if(dp[j] >= 0) dp[j] = cn;\n elif(j-g < 0 || dp[j-g] <= 0) dp[j] = -1;\n else dp[j] = dp[j-g] - 1;\n }\n }\n\n vll List;\n rep(j,N*K+1){\n if(dp[j] != -1) List.pb(j);\n }\n\n ll Ans = -INF;\n for(ll S:List){\n ll get = S/K - S%K;\n chmax(Ans,get);\n }\n\n cout << Ans << endl;\n \n}","accuracy":1,"time_ms":520,"memory_kb":77264,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_3187_5263095","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint dp[50050][101];\n\nint main(){\n\tint n,k; cin >> n >> k;\n\tvector<int> a(n);\n\tfor(int i=0;i<n;i++){\n\t\tcin >> a[i];\n\t}\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<k;j++){\n\t\t\tdp[i][j]=-1;\n\t\t}\n\t}\n\tdp[0][0]=0;\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<k;j++){\n\t\t\tif(dp[i][j]<0)continue;\n\t\t\tdp[i+1][j]=max(dp[i+1][j],dp[i][j]);\n\t\t\tdp[i+1][(j+a[i])%k]=max(dp[i+1][(j+a[i])%k],dp[i][j]+(j+a[i])/k);\n\t\t}\n\t}\n\tint res=-1e9;\n\tfor(int i=0;i<k;i++){\n\t\tres=max(res,dp[n][i]-i);\n\t}\n\tcout << res << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":22820,"score_of_the_acc":-0.2851,"final_rank":10},{"submission_id":"aoj_3187_5069382","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\nnamespace CharacterClass {\n\tconstexpr string_view\n\t digit = \"0123456789\",\n\t xdigit = \"0123456789ABCDEFabcdef\", lower = \"abcdefghijklmnopqrstuvwxyz\",\n\t upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n\t alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t alnum = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t word = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\",\n\t punct = R\"(!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~)\",\n\t graph =\n\t R\"(!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t print =\n\t R\"( !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t blank = \" \\t\", space = \" \\t\\n\\r\\f\\v\";\n} // namespace CharacterClass\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Printer {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid print(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid print(bool v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(vector<bool>::reference v) const {\n\t\tprint(v ? B.t : B.f);\n\t}\n\tvoid print(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid print(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid print(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid print(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void print(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\n\t\tprint(v.first);\n\t\tprint(D.d);\n\t\tprint(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) print(D.d);\n\t\t\tprint(*i);\n\t\t}\n\t}\n\ttemplate <class T> void print(const vector<T>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\n\t\tprint_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void print(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) print(D.l);\n\t\t\tprint(v[i]);\n\t\t}\n\t}\n\n\tPrinter() = default;\n\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tPrinter& operator()() {\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Printer& operator()(H&& h) {\n\t\tprint(h);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\n\t\tprint(h);\n\t\tprint(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\n\t\tprint_range(begin, end);\n\t\tprint(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Printer& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tPrinter& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tPrinter& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tPrinter& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tPrinter& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 7 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T = long long> constexpr T TEN(size_t n) {\n\tT result = 1;\n\tfor (size_t i = 0; i < n; ++i) result *= 10;\n\treturn result;\n}\ntemplate <class T, class U,\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr auto div_ceil(T n, U m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> constexpr T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> constexpr T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T, class U, class V>\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\n\treturn lower <= v && v < upper;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\nconstexpr bool is_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> constexpr T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T> constexpr int BIT(T x, int i) {\n\treturn (x & (1 << i)) ? 1 : 0;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Pow(T a, U n) {\n\tassert(n >= 0);\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\nconstexpr T Powmod(T a, U n, T mod) {\n\tassert(n >= 0);\n\tif (a > mod) a %= mod;\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 2 \"a.cpp\"\n\nint main() {\n\tini(n, k);\n\tVI a = in[n];\n\n\tVI dp(k, -inf);\n\tdp[0] = 0;\n\trep(i, n) {\n\t\tVI dp2 = dp;\n\t\trep(j, k) {\n\t\t\tchmax(dp2[(j + a[i]) % k], dp[j] + (j + a[i] >= k));\n\t\t}\n\t\tdp = dp2;\n\t}\n\n\tint ans = 0;\n\trep(i, k) {\n\t\tchmax(ans, dp[i] - i);\n\t}\n\tout(ans);\n}","accuracy":1,"time_ms":10,"memory_kb":3448,"score_of_the_acc":-0.0042,"final_rank":2},{"submission_id":"aoj_3187_5044025","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)n;++i)\n#define irep(i,a,b) for(int i=int(a);i<(int)b;++i)\n#define rrep(i,a,b) for(int i=int(a);i>=(int)b;--i)\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define vvp vector<vector<pair<ll,ll>>>\n#define vpl vector<pair<ll,ll>>\n#define vpi vector<pair<int,int>>\n#define pb push_back\n#define se second\n#define fi first\n#define all(v) v.begin(),v.end()\n#define v(T) vector<T>\n#define vv(T) vector<vector<T>>\n\nusing namespace std;\n\ntemplate<typename T> istream& operator>>(istream&i,v(T)&v){rep(j,v.size())i>>v[j];return i;}\ntemplate<typename T> string join(const v(T)&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\ntemplate<typename T> ostream& operator<<(ostream&o,const v(T)&v){if(v.size())o<<join(v);return o;}\n\n\n\nusing ll = long long;\nconst ll INF = 1e18;\nconst double PI = acos(-1);\n\nconst ll mod = 1e9 + 7; //998244353;\n\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n\nll modpow(ll a,ll b){\n if(b == 0){\n return 1;\n }\n if(b%2 == 0){\n ll tmp = modpow(a,b/2);\n return tmp*tmp%mod;\n }else{\n return modpow(a,b-1)*a%mod;\n }\n\n}\n\n\nint main(void)\n{\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int n,k;\n cin >> n >> k;\n vl a(n),dp(k,-INF);\n dp[0] = 0;\n rep(i,n){\n cin >> a[i];\n auto sub = dp;\n rep(j,k){\n dp[(j+a[i])%k] = max(sub[(j+a[i])%k],sub[j] + a[i]);\n }\n }\n ll ans = 0;\n rep(i,k)ans = max(ans,dp[i]/k-i);\n\n cout << ans << endl;\n\n \n //cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3612,"score_of_the_acc":-0.0456,"final_rank":6},{"submission_id":"aoj_3187_4985697","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#include <math.h>\n#include <iomanip>\n#include <cstdint>\n#include <string>\n#include <sstream>\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#define rep(i,n) for (int i = 0; i < (n); ++i)\ntypedef long long ll;\nusing P = pair<int,int>;\nconst int INF=1001001001;\nconst int mod =1e9+7;\n\nint main() {\n int N,K;cin>>N>>K;\n vector<int>A(N);\n for(int i=0;i<N;i++){cin>>A[i];}\n vector<vector<ll>>dp(N+1,vector<ll>(K,-1));\n dp[0][0]=0;\n for(int i=0;i<N;i++){\n for(int j=K-1;j>=0;j--){\n if(dp[i][j]==-1){continue;}\n chmax(dp[i+1][(j+A[i])%K],dp[i][j]+A[i]);\n chmax(dp[i+1][j],dp[i][j]);\n }\n }\n ll ans=0;\n for(int i=0;i<K;i++){chmax(ans,dp[N][i]/K-i);}\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":44296,"score_of_the_acc":-0.5944,"final_rank":13},{"submission_id":"aoj_3187_4947147","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 50005\n\nint N,K;\nint A[SIZE];\nint dp[SIZE][105];\n\nint main(){\n\n\tscanf(\"%d %d\",&N,&K);\n\n\tfor(int i = 1; i <= N; i++){\n\n\t\tscanf(\"%d\",&A[i]);\n\t}\n\n\tfor(int i = 0; i <= N; i++){\n\t\tfor(int a = 0; a <= K-1; a++){\n\t\t\tdp[i][a] = -BIG_NUM;\n\t\t}\n\t}\n\n\tdp[0][0] = 0;\n\tfor(int i = 1; i <= N; i++){\n\t\tfor(int a = 0; a <= K-1; a++){\n\t\t\tif(dp[i-1][a] == -BIG_NUM)continue;\n\n\t\t\t//足さない\n\t\t\tdp[i][a] = max(dp[i][a],dp[i-1][a]);\n\n\t\t\t//足す\n\t\t\tint next = a+A[i];\n\t\t\tint add = 0;\n\n\t\t\tif(next >= K){\n\n\t\t\t\tnext -= K;\n\t\t\t\tadd++;\n\t\t\t}\n\t\t\tdp[i][next] = max(dp[i][next],dp[i-1][a]+add);\n\t\t}\n\t}\n\n\tint ans = -BIG_NUM;\n\tfor(int a = 0; a <= K-1; a++){\n\n\t\tans = max(ans,dp[N][a]-a);\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":23920,"score_of_the_acc":-0.2803,"final_rank":9},{"submission_id":"aoj_3187_4875823","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> l_l;\ntypedef pair<int, int> i_i;\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nconst long long INF = 1e18;\n//const ll mod = 1000000007;\nll dp[50100][105];\nll N, K;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cin >> N >> K;\n for(int i = 0; i <= K; i++) {\n dp[0][i] = -INF;\n }\n dp[0][0] = 0;\n for(int i = 0; i < N; i++) {\n ll A;\n cin >> A;\n for(int j = 0; j <= K; j++) {\n dp[i+1][j] = -INF;\n }\n for(int j = 0; j < K; j++) {\n chmax(dp[i+1][j], dp[i][j]);\n ll val = dp[i][j];\n ll nxt = (j + A) % K;\n if(j + A >= K) val++;\n chmax(dp[i+1][nxt], val);\n }\n }\n ll ans = 0;\n for(int i = 0; i <= K; i++) {\n chmax(ans, dp[N][i] - i);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":44460,"score_of_the_acc":-0.6163,"final_rank":15},{"submission_id":"aoj_3187_4874377","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, n) for(int i=0; i<(n); ++i)\n\nusing namespace std;\ntypedef long long ll;\n\nconst int INTINF = INT_MAX >> 1;\n\nll dp[50100][110];\n\nint main(){\n\n\trep(i, 50010){\n\t\trep(j, 110) dp[i][j] = -INTINF;\n\t}\n\n\tint N, K; cin >> N >> K;\n\tvector<ll> v(N);\n\trep(i, N) cin >> v[i];\n\n\tll ans = 0;\n\tdp[0][0] = 0;\n\trep(i, N){\n\t\trep(j, K){\n\t\t\tif(dp[i][j] == -INTINF) continue;\n\t\t\tdp[i+1][j] = max(dp[i+1][j], dp[i][j]);\n\t\t\tdp[i+1][(j+v[i])%K] = max(dp[i][(j+v[i])%K], dp[i][j] + (j + v[i]) / K);\n\t\t\t// cout << dp[i+1][j] << \" \" << dp[i+1][(j+v[i])%K] << endl;\n\t\t\tans = max(ans, dp[i+1][j] - j);\n\t\t\tans = max(ans, dp[i+1][(j+v[i])%K] - (j+v[i])%K);\n\t\t}\n\t}\n\tcout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":46148,"score_of_the_acc":-0.6783,"final_rank":19},{"submission_id":"aoj_3187_4864734","code_snippet":"#pragma GCC optimize (\"O3\")\n#include <iostream>\n#include <iomanip>\n#include <istream>\n#include <ostream>\n#include <sstream>\n#include <iterator>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <deque>\n#include <list>\n#include <stack>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <bitset>\n#include <utility>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <string>\n#include <ctime>\n#include <cctype>\n#include <cstdlib>\n#include <numeric>\n#define IINF 1000000000\n#define INF 3223372036854775807\n#define MOD 1000000007\n#define mod 1000000007\n#define INT_MAX_ 2147483647\n#define EPS (1e-10)\n#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)\n#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)\n//#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define Endl endl\n#define fi first\n#define se second\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n#define eb emplace_back\n#define mmax(x,y)(x>y?x:y)\n#define mmin(x,y)(x<y?x:y)\n#define chmax(x,y) x=mmax(x,y)\n#define chmin(x,y) x=mmin(x,y)\n#define all(x) (x).begin(),(x).end()\n#define siz(x) (ll)(x).size()\n#define PI acos(-1.0)\n#define me memset\n#define bit(n,k) ((n>>k)&1)\n#define lg length()\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\ntypedef long double ld;\ntypedef pair<int,int>Pin;\ntypedef pair<ll,ll>Pll;\ntemplate<class T> using V=vector<T>;\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;\nlong long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}\nlong long LCM(long long a, long long b) {return a/GCD(a,b)*b;}\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\n#define invp(a,p)pom(a,p-2,p)\nint dx[4]={-1,0,1,0};\nint dy[4]={0,-1,0,1};\nint ddx[8]={-1,0,1,0,1,1,-1,-1};\nint ddy[8]={0,-1,0,1,1,-1,1,-1};\nll cmp1(pair<Pll,ll> a,pair<Pll,ll> b){\n return a.fi.se>b.fi.se;\n}\nll cmp2(pair<ll,ll> a,pair<ll,ll> b){\n if(a.fi!=b.fi)\n return a.se<b.se;\n else\n return a.se>b.se;\n}\n//----------------------------------------------------------------------\nll dp[50001][101];;\n//----------------------------------------------------------------------\nint main(int argc, char * argv[]){\n cin.tie(0);\n ios::sync_with_stdio(false);\n //------------------------------- \n //ll begin_t=clock();\n //freopen(\"big.txt\", \"r\", stdin);\n //freopen(\"out3.txt\", \"w\", stdout);\n //------------------------------\n ll n,k;cin>>n>>k;\n V<ll>a(n);\n for(ll i=0;i<n;i++){\n cin>>a[i];\n }\n sort(all(a));\n reverse(all(a));\n\n ll ans=0;\n for(ll i=0;i<=n;i++){\n for(ll j=0;j<=100;j++){\n dp[i][j]=-INF;\n }\n }\n dp[0][0]=0;\n for(ll i=0;i<n;i++){\n for(ll j=0;j<k;j++){\n if(dp[i][j]==-INF)continue;\n chmax(dp[i+1][(j+a[i])%k], dp[i][j] + (j+a[i])/k);\n chmax(dp[i+1][j],dp[i][j]);\n }\n }\n for(ll j=0;j<k;j++){\n chmax(ans, dp[n][j]-j);\n }\n cout<<ans<<endl;\n //------------------------------\n //fclose(stdin);\n //fclose(stdout);\n //ll end_t=clock();cout<<\"time=\"<<end_t-begin_t<<\"ms\"<<endl;\n //------------------------------- \n return 0;\n}\n//----------------------------------------------------------------------","accuracy":1,"time_ms":50,"memory_kb":42696,"score_of_the_acc":-0.6121,"final_rank":14},{"submission_id":"aoj_3187_4863295","code_snippet":"#include <iostream>\n#include <string>\n#include <sstream>\n#include <stack>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <bitset>\n#include <iomanip>\n#include <limits>\n#include <chrono>\n#include <random>\n#include <array>\n#include <unordered_map>\n#include <functional>\n#include <complex>\n#include <numeric>\n#include <cctype>\n#include <map>\n#include <set>\n#include <cstdlib>\n#include <bitset>\n#include <tuple>\n#include <assert.h>\n#include <deque>\n#include <utility>\n#include <fstream>\n\nusing namespace std;\ntypedef long long ll;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }\n//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\n\nconstexpr long long INF = 1LL << 60;\nconstexpr int inf = 1000000007;\n//constexpr long long mod = 1000000007LL;\n//constexpr long long mod = 998244353;\nconstexpr long long mod = 10000019;\nconstexpr int MAX = 5000000;\n\n\nint main()\n{\n\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tll n, k; cin >> n >> k;\n\tvector<ll> a(n); for (int i = 0; i < n; i++) cin >> a[i];\n\tvector<vector<ll>> dp(2, vector<ll>(k + 1, -INF));\n\tint cur = 0;\n\tint nxt = 1;\n\tdp[0][0] = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tfill(dp[nxt].begin(), dp[nxt].end(), -INF);\n\t\tfor (int j = 0; j < k; j++) {\n\t\t\tif (dp[cur][j] == -INF) continue;\n\t\t\tchmax(dp[nxt][j], dp[cur][j]);\n\t\t\tchmax(dp[nxt][(j + a[i]) % k], dp[cur][j] + a[i]);\n\t\t}\n\t\tswap(cur, nxt);\n\t}\n\tll res = 0;\n\tfor (int i = 0; i < k; i++) {\n\t\tchmax(res, dp[cur][i] / k - i);\n\t}\n\tcout << res << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3604,"score_of_the_acc":-0.0651,"final_rank":8},{"submission_id":"aoj_3187_4863122","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n//----------------------- Print Function ----------------------//\n\ninline void print() {\n cout << '\\n';\n}\ntemplate <typename First, typename... Rest>\nvoid print(const First &first, const Rest &... rest) {\n cout << first << ' ';\n print(rest...);\n}\n\ntemplate <typename T>\nvoid print(const T &a) {\n for (auto e : a) cout << e << ' ';\n cout << '\\n';\n}\n\n//------------------------- Libraries -------------------------//\n\ntemplate<class T>\nbool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n \ntemplate<class T>\nbool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//--------------------------- Solve ---------------------------//\n\nvoid solve() {\n int N, K; cin >> N >> K;\n vector<int> A(N);\n for (int i = 0; i < N; i++) cin >> A[i];\n\n vector<vector<int> > dp(N+1, vector<int>(K, -1));\n dp[0][0] = 0;\n for (int i = 1; i <= N; i++) {\n for (int j = 0; j < K; j++) {\n if (dp[i-1][j] == -1) continue;\n chmax(dp[i][j], dp[i-1][j]);\n chmax(dp[i][(j+A[i-1])%K], dp[i-1][j] + (j+A[i-1])/K);\n }\n }\n\n int ans = 0;\n for (int i = 0; i < K; i++) {\n chmax(ans, dp[N][i] - i);\n }\n\n cout << ans << '\\n';\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":24724,"score_of_the_acc":-0.3108,"final_rank":11},{"submission_id":"aoj_3187_4862669","code_snippet":"#include <bits/stdc++.h>\n#ifdef _DEBUG\n#include \"_DEBUG.hpp\"\n#endif\n#define int long long\nusing namespace std;\nusing P = pair<int, int>;\nconst int inf = 2e18;\nconst int mod = 1e9 + 7;\n\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (T &in : v) is >> in;\n return is;\n}\n\ntemplate <class T>\nvector<T> make_vec(size_t a) {\n return vector<T>(a);\n}\n\ntemplate <class T, class... Ts>\nauto make_vec(size_t a, Ts... ts) {\n return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\n}\n\ntemplate <class T, class V>\ntypename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {\n t = v;\n}\n\ntemplate <class T, class V>\ntypename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v) {\n for (auto &e : t) fill(e, v);\n}\n\nsigned main() {\n \n int n, k;\n cin >> n >> k;\n vector<int> a(n);\n cin >> a;\n\n vector<int> dp(k, -1);\n dp[0] = 0;\n for (int i = 0; i < n; i++) {\n auto nxt = dp;\n for (int j = 0; j < k; j++) {\n if (dp[j] == -1) continue;\n nxt[(j + a[i]) % k] = max(nxt[(j + a[i]) % k], dp[j] + (j + a[i] >= k));\n }\n swap(dp, nxt);\n }\n int ans = 0;\n for(int i = 0; i < k; i++){\n ans = max(ans, dp[i] - i);\n }\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3604,"score_of_the_acc":-0.0455,"final_rank":5},{"submission_id":"aoj_3187_4862428","code_snippet":"#ifdef LOCAL\n #define _GLIBCXX_DEBUG\n #define __clock__\n#else\n #pragma GCC optimize(\"Ofast\")\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<ll>;\nusing VV = vector<VI>;\nusing VS = vector<string>;\nusing PII = pair<ll, ll>;\n\n// tourist set\ntemplate <typename A, typename B>\nstring to_string(pair<A, B> p);\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p);\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p);\n\nstring to_string(const string& s) {\n return '\"' + s + '\"';\n}\n\nstring to_string(const char* s) {\n return to_string((string) s);\n}\n\nstring to_string(bool b) {\n return (b ? \"true\" : \"false\");\n}\n\nstring to_string(vector<bool> v) {\n bool first = true;\n string res = \"{\";\n for (int i = 0; i < static_cast<int>(v.size()); i++) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(v[i]);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <size_t N>\nstring to_string(bitset<N> v) {\n string res = \"\";\n for (size_t i = 0; i < N; i++) {\n res += static_cast<char>('0' + v[i]);\n }\n return res;\n}\n\ntemplate <typename A>\nstring to_string(A v) {\n bool first = true;\n string res = \"{\";\n for (const auto &x : v) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(x);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <typename A, typename B>\nstring to_string(pair<A, B> p) {\n return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";\n}\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \")\";\n}\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \", \" + to_string(get<3>(p)) + \")\";\n}\n\nvoid debug_out() { cerr << '\\n'; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cerr << \" \" << to_string(H);\n debug_out(T...);\n}\n\n#ifdef LOCAL\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n// tourist set end\n\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\n\n#define FOR(i,a,b) for(ll i=(a);i<(b);++i)\n#define rep(i,b) FOR(i, 0, b)\n#define ALL(v) (v).begin(), (v).end()\n#define p(s) cout<<(s)<<'\\n'\n#define p2(s, t) cout << (s) << \" \" << (t) << '\\n'\n#define br() p(\"\")\n#define pn(s) cout << (#s) << \" \" << (s) << '\\n'\n#define SZ(x) ((int)(x).size())\n#define SORT(A) sort(ALL(A))\n#define RSORT(A) sort(ALL(A), greater<ll>())\n#define MP make_pair\n#define p_yes() p(\"YES\")\n#define p_no() p(\"NO\")\n#define possible() p(\"Possible\")\n#define impossible() p(\"Impossible\")\n\nll SUM(VI& V){\n return accumulate(ALL(V), 0LL);\n}\n\nll MIN(VI& V){return *min_element(ALL(V));}\nll MAX(VI& V){return *max_element(ALL(V));}\n\nvoid print_vector(VI& V){\n ll n = V.size();\n rep(i, n){\n if(i) cout << ' ';\n cout << V[i];\n }\n cout << endl;\n}\n\nll gcd(ll a,ll b){\n if(b == 0) return a;\n return gcd(b,a%b);\n}\n\nll lcm(ll a,ll b){\n ll g = gcd(a,b);\n return a / g * b;\n}\n\n// long double\nusing ld = long double;\n#define EPS (1e-14)\n#define equals(a,b) (fabs((a)-(b)) < EPS)\n\nvoid no(){p_no(); exit(0);}\nvoid yes(){p_yes(); exit(0);}\n\nconst ll mod = 1e9 + 7;\nconst ll inf = 1e18;\nconst double PI = acos(-1);\n\n// snuke's mint\n// auto mod int\n// https://youtu.be/L8grWxBlIZ4?t=9858\n// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize\n// https://youtu.be/8uowVvQ_-Mo?t=1329 : division\n// const int mod = 1000000007;\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) {\n (x *= a.x) %= mod;\n return *this;\n }\n mint operator+(const mint a) const {\n mint res(*this);\n return res+=a;\n }\n mint operator-(const mint a) const {\n mint res(*this);\n return res-=a;\n }\n mint operator*(const mint a) const {\n mint res(*this);\n return res*=a;\n }\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\n // for prime mod\n mint inv() const {\n return pow(mod-2);\n }\n mint& operator/=(const mint a) {\n return (*this) *= a.inv();\n }\n mint operator/(const mint a) const {\n mint res(*this);\n return res/=a;\n }\n};\n\nll dp[55000][200];\n// i個まで見て\n// 余りがjのときの最大箱数\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n // input\n ll N,K; \n cin>>N>>K;\n\n VI A(N);\n rep(i,N)cin>>A[i];\n\n VV dp(N+10, VI(K, -1));\n dp[0][0]=0;\n\n rep(i,N){\n ll a = A[i];\n rep(j,K){\n if(dp[i][j]==-1) continue;\n\n // とる\n ll sum = j+a;\n chmax(dp[i+1][sum%K], dp[i][j] + sum/K);\n\n // とらない\n chmax(dp[i+1][j], dp[i][j]);\n }\n }\n ll ans = 0;\n rep(i,K){\n chmax(ans, dp[N][i] - i);\n }\n p(ans);\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":44348,"score_of_the_acc":-0.6344,"final_rank":17},{"submission_id":"aoj_3187_4861893","code_snippet":"/**\n * author: otera \n**/\n#include<iostream>\n#include<string> \n#include<cstdio>\n#include<cstring>\n#include<vector>\n#include<cmath>\n#include<algorithm> \n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<deque>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\n#define int long long\ntypedef long long ll;\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\ntypedef long double ld;\nconst int inf=1e9+7;\nconst ll INF=1LL<<60 ;\nconst ll mod=1e9+7 ;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef complex<ld> Point;\nconst ld eps = 1e-8;\nconst ld pi = acos(-1.0);\ntypedef pair<int, int> P;\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define debug(x) cerr << #x << \" = \" << (x) << endl;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nvoid solve() {\n\tint n, k; cin >> n >> k;\n vector<int> a(n);\n rep(i, n) {\n cin >> a[i];\n }\n vector<int> dp(k, -INF);\n vector<int> ndp(k, -INF);\n dp[0] = 0;\n rep(i, n) {\n ndp.assign(k, -INF);\n rep(j, k) {\n if(dp[j] == -INF) continue;\n chmax(ndp[j], dp[j]);\n int now = k * dp[j] + j;\n now += a[i];\n int r = now % k, t = now / k;\n chmax(ndp[r], t);\n }\n swap(dp, ndp);\n }\n int ans = -INF;\n rep(j, k) {\n chmax(ans, dp[j] - j);\n }\n cout << ans << endl;\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//int t; cin >> t; rep(i, t)solve();\n\tsolve();\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3304,"score_of_the_acc":-0.061,"final_rank":7},{"submission_id":"aoj_3187_4861711","code_snippet":"#include <bits/stdc++.h>\nusing namespace std; \n#define rep(i, a, b) for(ll i = a; i < b; i++)\n#define Rep(i, a, b) for(ll i = a; i <= b; i++)\n#define repr(i, a, b) for(ll i = b-1; i >= a; i--)\n// #define _GLIBCXX_DEBUG\ntemplate <class T> using V = vector<T>;\nusing ll = long long;\n#define ALL(v) (v).begin(),(v).end()\n#define endl \"\\n\"\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\n#define co(x) cout << x << endl\n#define pb push_back\n#define sz(v) ((ll)(v).size())\nconst double pi = acos(-1.0);\nconst ll MOD = 1000000007LL;\nconst ll INF = 1LL << 60;\n#define pp pair<ll, pair<ll, ll>> \n// #define fi first\n// #define se second\nconst int dy[] = {1, 0, -1, 0};\nconst int dx[] = {0, 1, 0, -1};\n\n/*--------------------------------------------------------------------------------\n ・ω・\n--------------------------------------------------------------------------------*/\n\nvoid solve(){\n ll n, k;\n cin >> n >> k;\n V<ll> A(n);\n rep(i, 0, n) cin >> A[i];\n V<V<ll>> dp(n+5, V<ll>(k+5, -1));\n dp[0][0] = 0;\n rep(i, 0, n){\n rep(j, 0, k){\n if(dp[i][j]==-1) continue;\n chmax(dp[i+1][j], dp[i][j]);\n if(j+A[i] >= k) chmax(dp[i+1][(j+A[i])%k], dp[i][j]+1);\n else chmax(dp[i+1][j+A[i]], dp[i][j]);\n }\n }\n //debug\n // rep(i, 0, k){\n // Rep(j, 0, n) cout << dp[j][i] << \" \\n\"[j==n];\n // }\n //\n ll ans = -INF;\n rep(i, 0, k) chmax(ans, dp[n][i]-i);\n cout << ans << endl;\n\n return;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":46112,"score_of_the_acc":-0.6386,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_3187_8525842\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\n#define all(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\ntemplate<class T>\\nbool chmax(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\ntemplate<class T>\\nbool chmin(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p > q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n ll N,K;\\n cin>>N>>K;\\n vvll DP(N+1,vll(K,-1e18));\\n DP[0][0]=0;\\n rep(i,N){\\n ll A;\\n cin>>A;\\n rep(k,K){\\n chmax(DP[i+1][k],DP[i][k]);\\n ll nk=k+A;\\n chmax(DP[i+1][nk%K],DP[i][k]+nk/K);\\n }\\n }\\n ll an=0;\\n rep(i,K)chmax(an,DP[N][i]-i);\\n cout<<an<<endl;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 44008,\n \"score_of_the_acc\": -0.6298,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3187_7992963\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n\\nusing namespace std;\\nusing ll = long long ;\\nusing P = pair<int,int>;\\nconst int mod = 998244353;\\nconst int inf = (1<<30);\\n\\nconst int dy[4] = {-1,0,0,1};\\nconst int dx[4] = {0,-1,1,0};\\n\\nint main(){\\n int n,k; cin>>n>>k;\\n\\n vector<int> a(n);\\n rep(i,n) cin>>a[i];\\n\\n vector<vector<int>> dp(n+1,vector<int>(k,-inf));\\n dp[0][0] = 0;\\n rep(i,n){\\n rep(j,k){\\n if(dp[i][j] == -inf) continue;\\n dp[i+1][(j+a[i])%k] = max(dp[i+1][(j+a[i])%k], dp[i][j]+a[i]);\\n dp[i+1][j] = max(dp[i+1][j],dp[i][j]);\\n }\\n }\\n\\n int ans = 0;\\n\\n rep(i,k){\\n ans = max(ans,(dp[n][i]/k) - i);\\n }\\n cout<<ans<<endl;\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 24760,\n \"score_of_the_acc\": -0.3113,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3187_7992942\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int inf = (int)1e9;\\n\\nint main() {\\n int N, K; cin >> N >> K;\\n vector dp(K, -inf);\\n dp[0] = 0;\\n for (int _ = 0 ; _ < N ; _++) {\\n int A; cin >> A;\\n vector nxt(K, -inf);\\n for (int i = 0 ; i < K ; i++) {\\n if (dp[i] == -inf) {\\n continue;\\n }\\n int mod = (i + A) % K;\\n bool add = ((i + A) >= K);\\n nxt[mod] = max(nxt[mod], dp[i] + (int)add);\\n nxt[i] = max(nxt[i], dp[i]);\\n }\\n dp = move(nxt);\\n }\\n\\n int ans = -inf;\\n for (int i = 0 ; i < K ; i++) {\\n ans = max(ans, dp[i] - i);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.0237,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3187_7992935\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint func(){\\n int n;\\n int k;\\n cin >> n >> k;\\n vector<int> dp1(k,-1e9);\\n vector<int> dp2(k,-1e9);\\n dp1[0] = 0;\\n for(int i=0;i<n;++i){\\n dp2.clear();\\n dp2.assign(k,-1e9);\\n int v;\\n cin >> v;\\n for(int j=0;j<k;++j){\\n int j2 = (j + v) % k;\\n dp2[j2] = max(dp2[j2], dp1[j] + v);\\n dp2[j] = max(dp2[j], dp1[j]);\\n }\\n swap(dp1,dp2);\\n }\\n int res = -1e9;\\n for(int i=0;i<k;++i){\\n res = max(res, dp1[i] / k - dp1[i] % k);\\n }\\n return res;\\n}\\nint main(){\\n cout << func() << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3452,\n \"score_of_the_acc\": -0.0238,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3187_7011918\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3187.cc: Mod Reap\\n */\\n\\n#include<cstdio>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 50000;\\nconst int MAX_K = 100;\\n\\n/* typedef */\\n\\n/* global variables */\\n\\nint as[MAX_N], dp[2][MAX_K];\\n\\n/* subroutines */\\n\\ninline void setmax(int &a, int b) { if (a < b) a = b; }\\n\\n/* main */\\n\\nint main() {\\n int n, k;\\n scanf(\\\"%d%d\\\", &n, &k);\\n for (int i = 0; i < n; i++) scanf(\\\"%d\\\", as + i);\\n\\n fill(dp[0], dp[0] + k, -1);\\n dp[0][0] = 0;\\n int cur = 0, nxt = 1;\\n\\n for (int i = 0; i < n; i++) {\\n copy(dp[cur], dp[cur] + k, dp[nxt]);\\n\\n for (int j = 0; j < k; j++)\\n if (dp[cur][j] >= 0) {\\n\\tint d0 = dp[cur][j], j1 = j + as[i];\\n\\tif (j1 >= k) j1 -= k, d0++;\\n\\tsetmax(dp[nxt][j1], d0);\\n }\\n\\n swap(cur, nxt);\\n }\\n\\n int maxd = 0;\\n for (int j = 0; j < k; j++) setmax(maxd, dp[cur][j] - j);\\n\\n printf(\\\"%d\\\\n\\\", maxd);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3187_5895098\",\n \"code_snippet\": \"#pragma region header\\n#include <bits/stdc++.h>\\nusing namespace std;\\n// #include <atcoder/all>\\n// using namespace atcoder;\\n\\n/* alias */\\nusing ull = unsigned long long;\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vl = vector<long>;\\nusing vll = vector<long long>;\\nusing vf = vector<float>;\\nusing vvf = vector<vf>;\\nusing vvi = vector<vi>;\\nusing vvl = vector<vl>;\\nusing vvll = vector<vll>;\\nusing vs = vector<string>;\\nusing vvs = vector<vs>;\\nusing vc = vector<char>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvc = vector<vc>;\\nusing pll = pair<ll, ll>;\\nusing vpll = vector<pll>;\\nusing qll = queue<ll>;\\n//仮想配列map<> https://code-database.com/knowledges/100\\n//優先度付きque https://atcoder.jp/contests/apg4b/tasks/APG4b_aa\\n\\n/* define short */\\n#define MOD 1000000007\\n#define INF LLONG_MAX/32\\n#define elif else if\\n#define pb push_back\\n#define pf push_front\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define all(obj) (obj).begin(), (obj).end()\\n#define YESNO(bool) if(bool){cout<<\\\"YES\\\"<<endl;}else{cout<<\\\"NO\\\"<<endl;}\\n#define yesno(bool) if(bool){cout<<\\\"yes\\\"<<endl;}else{cout<<\\\"no\\\"<<endl;}\\n#define YesNo(bool) if(bool){cout<<\\\"Yes\\\"<<endl;}else{cout<<\\\"No\\\"<<endl;}\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\\n\\n/* REP macro */\\n#define reps(i, a, n) for (ll i = (a); i < (ll)(n); ++i)\\n#define rep(i, n) reps(i, 0, n)\\n#define rrep(i, n) reps(i, 1, n + 1)\\n#define repd(i,n) for(ll i=n-1;i>=0;i--)\\n#define rrepd(i,n) for(ll i=n;i>=1;i--)\\n\\n//小数点以下出力の時にmainに書く\\n// cout << fixed << setprecision(10);\\n\\n#pragma endregion header\\n\\nll N;\\n\\n\\nvvll Graph;/*グラフ*/\\n// struct edge{ll to, cost;};\\n// vector<vector<edge>> Graph;\\nll H, W; vs HW;/*HW .#*/\\n\\n\\n\\n#pragma region fanction\\n#pragma region First Search\\n/*幅優先探索 vll dist(N,-1); Graphは隣接リスト*/\\nvoid bfs(vll &dist, ll fq, vvll Graph){\\n dist[fq] = 0;\\n deque<ll> que;que.pb(fq);\\n ll v;\\n while(!que.empty()){\\n v = que.front();que.pop_front();\\n\\n for(ll nv:Graph[v]){\\n if(dist[nv] != -1) continue;\\n dist[nv] = dist[v] + 1;\\n que.pb(nv);\\n }\\n }\\n}\\n\\n\\n/*distにsysxからの距離が入る 各重み1*/\\n/*HW幅優先探索 https://pyteyon.hatenablog.com/entry/2019/03/01/211133#%E6%B7%B1%E3%81%95%E5%84%AA%E5%85%88%E6%8E%A2%E7%B4%A2*/\\n/*vvll dist(H vll(W)); rep(h,H) rep(w,W) dist[h][w] = INF;*/\\nvoid HW_bfs(vvll &dist, ll sy, ll sx, vs HW){\\n dist[sy][sx] = 0;\\n deque<vll> que;\\n que.pb({sy,sx});\\n\\n vll v;\\n ll nowy, nowx, nexty,nextx;\\n vvll dydx = {{1,0},{0,1},{-1,0},{0,-1}};\\n\\n //重み1ならpbしてd++ 重み0ならpfしてそのままdiseにd入れれば01bfs\\n //que.back();que.pop_back()で深さ優先探索\\n\\n while(!que.empty()){\\n v = que.front();que.pop_front();\\n nowy = v[0]; nowx = v[1];\\n for(vll dyx:dydx){\\n nexty = nowy+dyx[0]; nextx = nowx+dyx[1];\\n if(!(0 <= nexty && nexty < H && 0 <= nextx && nextx < W)) continue;\\n if(HW[nexty][nextx] == '.' && dist[nexty][nextx] == INF){\\n que.pb({nexty,nextx});\\n dist[nexty][nextx] = dist[nowy][nowx] + 1;\\n }\\n }\\n }\\n}\\n\\n/*深さ優先探索 vll dist(N,-1); Graphは隣接リスト スタートのdistを0にすること！*/\\nvoid dfs(vll &dist, ll v, vvll &Graph){\\n for(ll nv:Graph[v]){\\n if(dist[nv] != -1) continue;\\n dist[nv] = dist[v] + 1;\\n dfs(dist,nv,Graph);\\n }\\n}\\n\\n//単一始点最短経路 ダイクストラ O(MlogN)\\n//vector<vector<pll>> //Graph; fi:to se:cost\\n// Graph.resize(N);\\n// rep(i,M){\\n// ll a,b,c; cin >> a >> b >> c;\\n// a--;b--;\\n// Graph[a].pb(pll(b,c));\\n// Graph[b].pb(pll(a,c));\\n// }\\n\\nvll dijkstra(ll start,vector<vector<pll>> &Graph){\\n vll dist(N,INF);\\n priority_queue<pll,vector<pll>,greater<pll>> que;\\n dist[start] = 0;\\n que.push(pll(dist[start],start));\\n while (!que.empty()){\\n pll p = que.top(); que.pop();\\n ll v = p.second;\\n if(dist[v] < p.first) continue;\\n for(auto &e:Graph[v]){\\n if(dist[e.first] > dist[v] + e.second){\\n dist[e.first] = dist[v] + e.second;\\n que.push(pll(dist[e.first],e.first));\\n }\\n }\\n }\\n\\n return dist;\\n}\\n\\n#pragma endregion First Search\\n#pragma region MOD\\nconst ll nCkMax = 1e6;\\nvll fac(1,0),finv(1,0),inv(1,0);\\n\\nvoid COMinit(){\\n fac.resize(nCkMax);\\n finv.resize(nCkMax);\\n inv.resize(nCkMax);\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for(ll i=2;i<nCkMax;i++){\\n fac[i] = fac[i-1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n/*a^n % mod p O(log N)*/\\nll modpow(ll a, ll n) {\\n ll res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a % MOD;\\n a = a * a % MOD;\\n n >>= 1;\\n }\\n return res;\\n}\\n/*a! mod p O(N)*/\\nll modfac(ll n){\\n ll ret = 1;\\n rrep(i,n){\\n ret *= i;\\n ret %= MOD;\\n }\\n return ret;\\n}\\n\\n/*nCk % mod 前処理O(N) クエリ処理O(1)*/\\nll nCk(ll n, ll k){\\n if(fac[0] != 1) COMinit();//初期化 O(N)\\n if(n<k) return 0;\\n if(n<0 || k<0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\\n}\\n\\nll factorial(ll n){\\n ll ans = 1;\\n for (ll i = 1;i<=n;i++){\\n ans = ans * i % MOD;\\n }\\n return ans;\\n}\\n\\nll nHk(ll n, ll k){\\n return nCk(n+k-1,k);\\n}\\n#pragma endregion MOD\\n#pragma region enumeration\\nvvll make_n(vll v){\\n vvll ret;\\n vll tmp;\\n ll n = v.size();\\n do{\\n tmp = {};\\n rep(i,n) tmp.pb(v[i]);\\n ret.pb(tmp);\\n }while(next_permutation(all(v)));\\n return ret;\\n}\\n/*nCk列挙 vvllなのに注意！*/\\nvvll make_C(ll n, ll r){\\n vvll ret;\\n vll tmp;\\n vector<bool> v(n);\\n fill(v.end() - r, v.end(), true);\\n do {\\n tmp = {};\\n for (int i = 0; i < n; ++i) { \\n if (v[i]) tmp.pb(i);\\n }\\n ret.pb(tmp);\\n } while (next_permutation(v.begin(), v.end()));\\n //reverse(all(ret));\\n return ret;\\n}\\n/*nPk列挙 nPnでn!列挙 この時順番通りになってる*/\\nvvll make_P(ll n, ll r){\\n vvll C = make_C(n,r);\\n vvll ret;\\n vvll tmp;\\n vll v;\\n rep(i,C.size()){\\n v = C[i];\\n tmp = make_n(v);\\n for(vll t:tmp) ret.pb(t);\\n }\\n return ret;\\n}\\n\\n#pragma endregion enumeration\\n#pragma region array\\n\\n/*一次元配列最大最小総和*/\\nll vmax(vll array){\\n ll Max = -INF;\\n for(ll a:array) chmax(Max,a);\\n return Max;\\n}\\n\\nll vmin(vll array){\\n ll Min = INF;\\n for(ll a:array) chmin(Min,a);\\n return Min;\\n}\\n\\nll sum(vll &array){\\n ll Sum = 0;\\n for(ll a:array) Sum += a;\\n return Sum;\\n}\\n\\n/*累積和 先頭に0が追加されてる lからrまではret[r+1]-ret[l]*/\\nvll cumulatice_sum(vll &array){\\n vll ret(array.size()+1,0);\\n rep(i,array.size()) ret[i+1] = ret[i] + array[i];\\n return ret;\\n}\\n\\n/*重複消し*/\\nvoid list_set(vll &array){\\n sort(all(array));\\n array.erase(unique(all(array)),array.end());\\n}\\n\\n/*vvllで格納されてる配列をkey番目の要素でソート*/\\nvoid vvllsort(vvll &array, ll key){\\n sort(all(array),[&key](vll a,vll b){return a[key] < b[key];});\\n}\\n\\n/*string Sに何個string Kが含まれるか 一文字でもいいけどcharじゃなくてstringにしてね*/\\nll stringinstring(string &S,string K){\\n ll ret = 0;\\n rep(i,S.size()-K.size()+1){\\n bool f = true;\\n rep(j,K.size()) if(S[i+j] != K[j]) f=false;\\n if(f) ret++;\\n }\\n return ret;\\n}\\n#pragma endregion array\\n#pragma region UnionFind\\nclass UnionFind{\\npublic:\\n vector<ll> parent; //parent[i]はiの親\\n vector<ll> siz; //素集合のサイズを表す配列(1で初期化)\\n map<ll,vector<ll>> group; //集合ごとに管理する(key:集合の代表元、value:集合の要素の配列)\\n ll n; //要素数\\n \\n //コンストラクタ\\n UnionFind(ll n_):n(n_),parent(n_),siz(n_,1){ \\n //全ての要素の根が自身であるとして初期化\\n for(ll i=0;i<n;i++){parent[i]=i;}\\n }\\n \\n //データxの属する木の根を取得(経路圧縮も行う)\\n ll root(ll x){\\n if(parent[x]==x) return x;\\n return parent[x]=root(parent[x]);//代入式の値は代入した変数の値なので、経路圧縮できる\\n }\\n \\n //xとyの木を併合\\n void unite(ll x,ll y){\\n ll rx=root(x);//xの根\\n ll ry=root(y);//yの根\\n if(rx==ry) return;//同じ木にある時\\n //小さい集合を大きい集合へと併合(ry→rxへ併合)\\n if(siz[rx]<siz[ry]) swap(rx,ry);\\n siz[rx]+=siz[ry];\\n parent[ry]=rx;//xとyが同じ木にない時はyの根ryをxの根rxにつける\\n }\\n \\n //xとyが属する木が同じかを判定\\n bool same(ll x,ll y){\\n ll rx=root(x);\\n ll ry=root(y);\\n return rx==ry;\\n }\\n \\n //xの素集合のサイズを取得\\n ll size(ll x){\\n return siz[root(x)];\\n }\\n \\n //素集合をそれぞれグループ化\\n void grouping(){\\n //経路圧縮を先に行う\\n rep(i,n)root(i);\\n //mapで管理する(デフォルト構築を利用)\\n rep(i,n)group[parent[i]].pb(i);\\n }\\n \\n //素集合系を削除して初期化\\n void clear(){\\n rep(i,n){parent[i]=i;}\\n siz=vector<ll>(n,1);\\n group.clear();\\n }\\n};\\n#pragma endregion UnionFind\\n#pragma region bisect\\n/*二分探索*/\\nll bisect_left(vll &array, ll key){\\n return lower_bound(all(array),key) - array.begin();\\n}\\n\\nll bisect_right(vll &array, ll key){\\n return upper_bound(all(array),key) - array.begin();\\n}\\n\\n/*最長増加部分列*/\\nll LIS(vll a){\\n vll dp(a.size(),INF);\\n rep(i,a.size()){\\n dp[bisect_right(dp,a[i])] = a[i];\\n }\\n return bisect_left(dp,INF);\\n}\\n/*条件を満たす最大のokを返す 最小にしたいならokng逆にする solveを書き換えること!*/\\nbool solve(ll n){\\n return true;\\n}\\n\\nll meguru_bisect(ll ok, ll ng){\\n ll mid;\\n while(abs(ok-ng) > 1){\\n mid = (ok + ng) / 2;\\n if(solve(mid)) ok = mid;\\n else ng = mid;\\n }\\n return ok;\\n}\\n#pragma endregion bisect\\n#pragma region others\\n\\n/* memo\\n\\n二次元配列の90度回転\\n// i:j \\n// j:N - i - 1\\n\\n\\n*/\\n\\n\\n\\n/*普通のa^n*/\\nll pow(ll a, ll n){\\n ll res = 1;\\n while (n > 0) {\\n if (n & 1) res *= a;\\n a *= a;\\n n >>= 1;\\n }\\n return res;\\n}\\n/*最大公約数*/\\nll gcd(ll x,ll y){\\n if (x < y) swap(x,y);\\n while (y > 0){\\n ll r = x % y;\\n x = y;\\n y = r;\\n }\\n return x;\\n}\\n\\n/*最小公倍数*/\\nll lcm(ll x,ll y){\\n return x * y / (gcd(x,y));\\n}\\n\\n/*約数列挙*/\\nvll divisor(ll n){\\n vll ret;\\n for (ll i = 1; i * i <= n; i++){\\n if (n % i == 0){\\n ret.pb(i);\\n if (i * i != n) ret.pb(n / i);\\n }\\n }\\n sort(all(ret));\\n return ret;\\n}\\n\\n/*素因数分解*/\\nvll factorize(ll n){\\n vll ret;\\n while (n % 2 == 0){\\n ret.pb(2);\\n n /= 2;\\n }\\n ll f = 3;\\n while (f * f <= n){\\n if (n % f == 0){\\n ret.pb(f);\\n n /= f;\\n }else f += 2;\\n }\\n if (n != 1) ret.pb(n);\\n return ret;\\n}\\nconst ll Eramax = 1e6+1;\\nvll Eratos(1,1);\\nvoid Erainit(){\\n Eratos.resize(Eramax+1);\\n rep(i,Eramax+1) Eratos[i] = i;\\n for(ll i=2;i<Eramax;i++){\\n if(Eratos[i] != i) continue;\\n for(ll j=2*i;j<Eramax;j+=i) Eratos[j] = i;\\n }\\n Eratos[1] = -1;\\n}\\n//前処理型素因数分解 1e6以下を複数回やるならこっち\\nvll Era_factorize(ll n){\\n if(Eratos[0] != 0) Erainit();\\n vll ret = {};\\n if(n==1) return ret;\\n while(n!=1){\\n ret.pb(Eratos[n]);\\n n /= Eratos[n];\\n }\\n return ret;\\n}\\n\\n#pragma endregion others\\n#pragma endregion fanction\\n\\n\\n\\n\\nint main() {\\n ll K; cin >> N >> K;\\n vll cnt(K+1,0);\\n rep(i,N){\\n ll a; cin >> a;\\n cnt[a]++;\\n }\\n\\n // vvll dp(K+1,vll(N*K+1,-1));\\n vll dp(N*K+1,-1);\\n // vector<vector<bool>> dp(K+1,vector<bool>(N*K+1,false));\\n dp[0] = 0;\\n rep(i,K){\\n \\n rep(j,N*K+1){\\n ll g = i + 1;\\n ll cn = cnt[i+1];\\n if(dp[j] >= 0) dp[j] = cn;\\n elif(j-g < 0 || dp[j-g] <= 0) dp[j] = -1;\\n else dp[j] = dp[j-g] - 1;\\n }\\n }\\n\\n vll List;\\n rep(j,N*K+1){\\n if(dp[j] != -1) List.pb(j);\\n }\\n\\n ll Ans = -INF;\\n for(ll S:List){\\n ll get = S/K - S%K;\\n chmax(Ans,get);\\n }\\n\\n cout << Ans << endl;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 77264,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3187_5263095\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\nint dp[50050][101];\\n\\nint main(){\\n\\tint n,k; cin >> n >> k;\\n\\tvector<int> a(n);\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tcin >> a[i];\\n\\t}\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<k;j++){\\n\\t\\t\\tdp[i][j]=-1;\\n\\t\\t}\\n\\t}\\n\\tdp[0][0]=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<k;j++){\\n\\t\\t\\tif(dp[i][j]<0)continue;\\n\\t\\t\\tdp[i+1][j]=max(dp[i+1][j],dp[i][j]);\\n\\t\\t\\tdp[i+1][(j+a[i])%k]=max(dp[i+1][(j+a[i])%k],dp[i][j]+(j+a[i])/k);\\n\\t\\t}\\n\\t}\\n\\tint res=-1e9;\\n\\tfor(int i=0;i<k;i++){\\n\\t\\tres=max(res,dp[n][i]-i);\\n\\t}\\n\\tcout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 22820,\n \"score_of_the_acc\": -0.2851,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3187_5069382\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\nnamespace CharacterClass {\\n\\tconstexpr string_view\\n\\t digit = \\\"0123456789\\\",\\n\\t xdigit = \\\"0123456789ABCDEFabcdef\\\", lower = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n\\t upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n\\t alpha = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t alnum = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t word = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\\\",\\n\\t punct = R\\\"(!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~)\\\",\\n\\t graph =\\n\\t R\\\"(!\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t print =\\n\\t R\\\"( !\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t blank = \\\" \\\\t\\\", space = \\\" \\\\t\\\\n\\\\r\\\\f\\\\v\\\";\\n} // namespace CharacterClass\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Printer {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid print(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid print(bool v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(vector<bool>::reference v) const {\\n\\t\\tprint(v ? B.t : B.f);\\n\\t}\\n\\tvoid print(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid print(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid print(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid print(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void print(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void print(const pair<T, U>& v) const {\\n\\t\\tprint(v.first);\\n\\t\\tprint(D.d);\\n\\t\\tprint(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid print_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) print(D.d);\\n\\t\\t\\tprint(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void print(const vector<T>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void print(const array<T, N>& v) const {\\n\\t\\tprint_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void print(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) print(D.l);\\n\\t\\t\\tprint(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tPrinter() = default;\\n\\tPrinter(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tPrinter& operator()() {\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Printer& operator()(H&& h) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Printer& operator()(H&& h, T&&... t) {\\n\\t\\tprint(h);\\n\\t\\tprint(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tPrinter& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tprint_range(begin, end);\\n\\t\\tprint(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Printer& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tPrinter& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tPrinter& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 7 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T = long long> constexpr T TEN(size_t n) {\\n\\tT result = 1;\\n\\tfor (size_t i = 0; i < n; ++i) result *= 10;\\n\\treturn result;\\n}\\ntemplate <class T, class U,\\n enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr auto div_ceil(T n, U m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T, class U> constexpr auto div_ceil2(T n, U m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> constexpr T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> constexpr T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T, class U> constexpr auto middle(const T& l, const U& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T, class U, class V>\\nconstexpr bool in_range(const T& v, const U& lower, const V& upper) {\\n\\treturn lower <= v && v < upper;\\n}\\ntemplate <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>\\nconstexpr bool is_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> constexpr T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T> constexpr int BIT(T x, int i) {\\n\\treturn (x & (1 << i)) ? 1 : 0;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Pow(T a, U n) {\\n\\tassert(n >= 0);\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>\\nconstexpr T Powmod(T a, U n, T mod) {\\n\\tassert(n >= 0);\\n\\tif (a > mod) a %= mod;\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 2 \\\"a.cpp\\\"\\n\\nint main() {\\n\\tini(n, k);\\n\\tVI a = in[n];\\n\\n\\tVI dp(k, -inf);\\n\\tdp[0] = 0;\\n\\trep(i, n) {\\n\\t\\tVI dp2 = dp;\\n\\t\\trep(j, k) {\\n\\t\\t\\tchmax(dp2[(j + a[i]) % k], dp[j] + (j + a[i] >= k));\\n\\t\\t}\\n\\t\\tdp = dp2;\\n\\t}\\n\\n\\tint ans = 0;\\n\\trep(i, k) {\\n\\t\\tchmax(ans, dp[i] - i);\\n\\t}\\n\\tout(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.0042,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3187_5044025\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(int)n;++i)\\n#define irep(i,a,b) for(int i=int(a);i<(int)b;++i)\\n#define rrep(i,a,b) for(int i=int(a);i>=(int)b;--i)\\n#define vi vector<int>\\n#define vvi vector<vector<int>>\\n#define vl vector<ll>\\n#define vvl vector<vector<ll>>\\n#define vvp vector<vector<pair<ll,ll>>>\\n#define vpl vector<pair<ll,ll>>\\n#define vpi vector<pair<int,int>>\\n#define pb push_back\\n#define se second\\n#define fi first\\n#define all(v) v.begin(),v.end()\\n#define v(T) vector<T>\\n#define vv(T) vector<vector<T>>\\n\\nusing namespace std;\\n\\ntemplate<typename T> istream& operator>>(istream&i,v(T)&v){rep(j,v.size())i>>v[j];return i;}\\ntemplate<typename T> string join(const v(T)&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\\ntemplate<typename T> ostream& operator<<(ostream&o,const v(T)&v){if(v.size())o<<join(v);return o;}\\n\\n\\n\\nusing ll = long long;\\nconst ll INF = 1e18;\\nconst double PI = acos(-1);\\n\\nconst ll mod = 1e9 + 7; //998244353;\\n\\ntemplate<class T> inline bool chmin(T& a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<class T> inline bool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n\\nll modpow(ll a,ll b){\\n if(b == 0){\\n return 1;\\n }\\n if(b%2 == 0){\\n ll tmp = modpow(a,b/2);\\n return tmp*tmp%mod;\\n }else{\\n return modpow(a,b-1)*a%mod;\\n }\\n\\n}\\n\\n\\nint main(void)\\n{\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int n,k;\\n cin >> n >> k;\\n vl a(n),dp(k,-INF);\\n dp[0] = 0;\\n rep(i,n){\\n cin >> a[i];\\n auto sub = dp;\\n rep(j,k){\\n dp[(j+a[i])%k] = max(sub[(j+a[i])%k],sub[j] + a[i]);\\n }\\n }\\n ll ans = 0;\\n rep(i,k)ans = max(ans,dp[i]/k-i);\\n\\n cout << ans << endl;\\n\\n \\n //cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3612,\n \"score_of_the_acc\": -0.0456,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3187_4985697\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#include <math.h>\\n#include <iomanip>\\n#include <cstdint>\\n#include <string>\\n#include <sstream>\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\ntypedef long long ll;\\nusing P = pair<int,int>;\\nconst int INF=1001001001;\\nconst int mod =1e9+7;\\n\\nint main() {\\n int N,K;cin>>N>>K;\\n vector<int>A(N);\\n for(int i=0;i<N;i++){cin>>A[i];}\\n vector<vector<ll>>dp(N+1,vector<ll>(K,-1));\\n dp[0][0]=0;\\n for(int i=0;i<N;i++){\\n for(int j=K-1;j>=0;j--){\\n if(dp[i][j]==-1){continue;}\\n chmax(dp[i+1][(j+A[i])%K],dp[i][j]+A[i]);\\n chmax(dp[i+1][j],dp[i][j]);\\n }\\n }\\n ll ans=0;\\n for(int i=0;i<K;i++){chmax(ans,dp[N][i]/K-i);}\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 44296,\n \"score_of_the_acc\": -0.5944,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3187_4947147\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 9223372036854775807\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 50005\\n\\nint N,K;\\nint A[SIZE];\\nint dp[SIZE][105];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&N,&K);\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&A[i]);\\n\\t}\\n\\n\\tfor(int i = 0; i <= N; i++){\\n\\t\\tfor(int a = 0; a <= K-1; a++){\\n\\t\\t\\tdp[i][a] = -BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tdp[0][0] = 0;\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tfor(int a = 0; a <= K-1; a++){\\n\\t\\t\\tif(dp[i-1][a] == -BIG_NUM)continue;\\n\\n\\t\\t\\t//足さない\\n\\t\\t\\tdp[i][a] = max(dp[i][a],dp[i-1][a]);\\n\\n\\t\\t\\t//足す\\n\\t\\t\\tint next = a+A[i];\\n\\t\\t\\tint add = 0;\\n\\n\\t\\t\\tif(next >= K){\\n\\n\\t\\t\\t\\tnext -= K;\\n\\t\\t\\t\\tadd++;\\n\\t\\t\\t}\\n\\t\\t\\tdp[i][next] = max(dp[i][next],dp[i-1][a]+add);\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = -BIG_NUM;\\n\\tfor(int a = 0; a <= K-1; a++){\\n\\n\\t\\tans = max(ans,dp[N][a]-a);\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 23920,\n \"score_of_the_acc\": -0.2803,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3187_4875823\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> l_l;\\ntypedef pair<int, int> i_i;\\ntemplate<class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nconst long long INF = 1e18;\\n//const ll mod = 1000000007;\\nll dp[50100][105];\\nll N, K;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cin >> N >> K;\\n for(int i = 0; i <= K; i++) {\\n dp[0][i] = -INF;\\n }\\n dp[0][0] = 0;\\n for(int i = 0; i < N; i++) {\\n ll A;\\n cin >> A;\\n for(int j = 0; j <= K; j++) {\\n dp[i+1][j] = -INF;\\n }\\n for(int j = 0; j < K; j++) {\\n chmax(dp[i+1][j], dp[i][j]);\\n ll val = dp[i][j];\\n ll nxt = (j + A) % K;\\n if(j + A >= K) val++;\\n chmax(dp[i+1][nxt], val);\\n }\\n }\\n ll ans = 0;\\n for(int i = 0; i <= K; i++) {\\n chmax(ans, dp[N][i] - i);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 44460,\n \"score_of_the_acc\": -0.6163,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3187_4874377\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for(int i=0; i<(n); ++i)\\n\\nusing namespace std;\\ntypedef long long ll;\\n\\nconst int INTINF = INT_MAX >> 1;\\n\\nll dp[50100][110];\\n\\nint main(){\\n\\n\\trep(i, 50010){\\n\\t\\trep(j, 110) dp[i][j] = -INTINF;\\n\\t}\\n\\n\\tint N, K; cin >> N >> K;\\n\\tvector<ll> v(N);\\n\\trep(i, N) cin >> v[i];\\n\\n\\tll ans = 0;\\n\\tdp[0][0] = 0;\\n\\trep(i, N){\\n\\t\\trep(j, K){\\n\\t\\t\\tif(dp[i][j] == -INTINF) continue;\\n\\t\\t\\tdp[i+1][j] = max(dp[i+1][j], dp[i][j]);\\n\\t\\t\\tdp[i+1][(j+v[i])%K] = max(dp[i][(j+v[i])%K], dp[i][j] + (j + v[i]) / K);\\n\\t\\t\\t// cout << dp[i+1][j] << \\\" \\\" << dp[i+1][(j+v[i])%K] << endl;\\n\\t\\t\\tans = max(ans, dp[i+1][j] - j);\\n\\t\\t\\tans = max(ans, dp[i+1][(j+v[i])%K] - (j+v[i])%K);\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 46148,\n \"score_of_the_acc\": -0.6783,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3187_4864734\",\n \"code_snippet\": \"#pragma GCC optimize (\\\"O3\\\")\\n#include <iostream>\\n#include <iomanip>\\n#include <istream>\\n#include <ostream>\\n#include <sstream>\\n#include <iterator>\\n#include <vector>\\n#include <algorithm>\\n#include <queue>\\n#include <deque>\\n#include <list>\\n#include <stack>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <bitset>\\n#include <utility>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <string>\\n#include <ctime>\\n#include <cctype>\\n#include <cstdlib>\\n#include <numeric>\\n#define IINF 1000000000\\n#define INF 3223372036854775807\\n#define MOD 1000000007\\n#define mod 1000000007\\n#define INT_MAX_ 2147483647\\n#define EPS (1e-10)\\n#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)\\n#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)\\n//#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)\\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\\n#define Endl endl\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define eb emplace_back\\n#define mmax(x,y)(x>y?x:y)\\n#define mmin(x,y)(x<y?x:y)\\n#define chmax(x,y) x=mmax(x,y)\\n#define chmin(x,y) x=mmin(x,y)\\n#define all(x) (x).begin(),(x).end()\\n#define siz(x) (ll)(x).size()\\n#define PI acos(-1.0)\\n#define me memset\\n#define bit(n,k) ((n>>k)&1)\\n#define lg length()\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\ntypedef long double ld;\\ntypedef pair<int,int>Pin;\\ntypedef pair<ll,ll>Pll;\\ntemplate<class T> using V=vector<T>;\\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;\\nlong long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}\\nlong long LCM(long long a, long long b) {return a/GCD(a,b)*b;}\\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\\n#define invp(a,p)pom(a,p-2,p)\\nint dx[4]={-1,0,1,0};\\nint dy[4]={0,-1,0,1};\\nint ddx[8]={-1,0,1,0,1,1,-1,-1};\\nint ddy[8]={0,-1,0,1,1,-1,1,-1};\\nll cmp1(pair<Pll,ll> a,pair<Pll,ll> b){\\n return a.fi.se>b.fi.se;\\n}\\nll cmp2(pair<ll,ll> a,pair<ll,ll> b){\\n if(a.fi!=b.fi)\\n return a.se<b.se;\\n else\\n return a.se>b.se;\\n}\\n//----------------------------------------------------------------------\\nll dp[50001][101];;\\n//----------------------------------------------------------------------\\nint main(int argc, char * argv[]){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n //------------------------------- \\n //ll begin_t=clock();\\n //freopen(\\\"big.txt\\\", \\\"r\\\", stdin);\\n //freopen(\\\"out3.txt\\\", \\\"w\\\", stdout);\\n //------------------------------\\n ll n,k;cin>>n>>k;\\n V<ll>a(n);\\n for(ll i=0;i<n;i++){\\n cin>>a[i];\\n }\\n sort(all(a));\\n reverse(all(a));\\n\\n ll ans=0;\\n for(ll i=0;i<=n;i++){\\n for(ll j=0;j<=100;j++){\\n dp[i][j]=-INF;\\n }\\n }\\n dp[0][0]=0;\\n for(ll i=0;i<n;i++){\\n for(ll j=0;j<k;j++){\\n if(dp[i][j]==-INF)continue;\\n chmax(dp[i+1][(j+a[i])%k], dp[i][j] + (j+a[i])/k);\\n chmax(dp[i+1][j],dp[i][j]);\\n }\\n }\\n for(ll j=0;j<k;j++){\\n chmax(ans, dp[n][j]-j);\\n }\\n cout<<ans<<endl;\\n //------------------------------\\n //fclose(stdin);\\n //fclose(stdout);\\n //ll end_t=clock();cout<<\\\"time=\\\"<<end_t-begin_t<<\\\"ms\\\"<<endl;\\n //------------------------------- \\n return 0;\\n}\\n//----------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 42696,\n \"score_of_the_acc\": -0.6121,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3187_4863295\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <sstream>\\n#include <stack>\\n#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <bitset>\\n#include <iomanip>\\n#include <limits>\\n#include <chrono>\\n#include <random>\\n#include <array>\\n#include <unordered_map>\\n#include <functional>\\n#include <complex>\\n#include <numeric>\\n#include <cctype>\\n#include <map>\\n#include <set>\\n#include <cstdlib>\\n#include <bitset>\\n#include <tuple>\\n#include <assert.h>\\n#include <deque>\\n#include <utility>\\n#include <fstream>\\n\\nusing namespace std;\\ntypedef long long ll;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }\\n//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\\n\\nconstexpr long long INF = 1LL << 60;\\nconstexpr int inf = 1000000007;\\n//constexpr long long mod = 1000000007LL;\\n//constexpr long long mod = 998244353;\\nconstexpr long long mod = 10000019;\\nconstexpr int MAX = 5000000;\\n\\n\\nint main()\\n{\\n\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\n\\tll n, k; cin >> n >> k;\\n\\tvector<ll> a(n); for (int i = 0; i < n; i++) cin >> a[i];\\n\\tvector<vector<ll>> dp(2, vector<ll>(k + 1, -INF));\\n\\tint cur = 0;\\n\\tint nxt = 1;\\n\\tdp[0][0] = 0;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tfill(dp[nxt].begin(), dp[nxt].end(), -INF);\\n\\t\\tfor (int j = 0; j < k; j++) {\\n\\t\\t\\tif (dp[cur][j] == -INF) continue;\\n\\t\\t\\tchmax(dp[nxt][j], dp[cur][j]);\\n\\t\\t\\tchmax(dp[nxt][(j + a[i]) % k], dp[cur][j] + a[i]);\\n\\t\\t}\\n\\t\\tswap(cur, nxt);\\n\\t}\\n\\tll res = 0;\\n\\tfor (int i = 0; i < k; i++) {\\n\\t\\tchmax(res, dp[cur][i] / k - i);\\n\\t}\\n\\tcout << res << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3604,\n \"score_of_the_acc\": -0.0651,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3187_4863122\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n//----------------------- Print Function ----------------------//\\n\\ninline void print() {\\n cout << '\\\\n';\\n}\\ntemplate <typename First, typename... Rest>\\nvoid print(const First &first, const Rest &... rest) {\\n cout << first << ' ';\\n print(rest...);\\n}\\n\\ntemplate <typename T>\\nvoid print(const T &a) {\\n for (auto e : a) cout << e << ' ';\\n cout << '\\\\n';\\n}\\n\\n//------------------------- Libraries -------------------------//\\n\\ntemplate<class T>\\nbool chmin(T& a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n \\ntemplate<class T>\\nbool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n//--------------------------- Solve ---------------------------//\\n\\nvoid solve() {\\n int N, K; cin >> N >> K;\\n vector<int> A(N);\\n for (int i = 0; i < N; i++) cin >> A[i];\\n\\n vector<vector<int> > dp(N+1, vector<int>(K, -1));\\n dp[0][0] = 0;\\n for (int i = 1; i <= N; i++) {\\n for (int j = 0; j < K; j++) {\\n if (dp[i-1][j] == -1) continue;\\n chmax(dp[i][j], dp[i-1][j]);\\n chmax(dp[i][(j+A[i-1])%K], dp[i-1][j] + (j+A[i-1])/K);\\n }\\n }\\n\\n int ans = 0;\\n for (int i = 0; i < K; i++) {\\n chmax(ans, dp[N][i] - i);\\n }\\n\\n cout << ans << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 24724,\n \"score_of_the_acc\": -0.3108,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3187_4862669\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#ifdef _DEBUG\\n#include \\\"_DEBUG.hpp\\\"\\n#endif\\n#define int long long\\nusing namespace std;\\nusing P = pair<int, int>;\\nconst int inf = 2e18;\\nconst int mod = 1e9 + 7;\\n\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v) {\\n for (T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate <class T>\\nvector<T> make_vec(size_t a) {\\n return vector<T>(a);\\n}\\n\\ntemplate <class T, class... Ts>\\nauto make_vec(size_t a, Ts... ts) {\\n return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\\n}\\n\\ntemplate <class T, class V>\\ntypename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate <class T, class V>\\ntypename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v) {\\n for (auto &e : t) fill(e, v);\\n}\\n\\nsigned main() {\\n \\n int n, k;\\n cin >> n >> k;\\n vector<int> a(n);\\n cin >> a;\\n\\n vector<int> dp(k, -1);\\n dp[0] = 0;\\n for (int i = 0; i < n; i++) {\\n auto nxt = dp;\\n for (int j = 0; j < k; j++) {\\n if (dp[j] == -1) continue;\\n nxt[(j + a[i]) % k] = max(nxt[(j + a[i]) % k], dp[j] + (j + a[i] >= k));\\n }\\n swap(dp, nxt);\\n }\\n int ans = 0;\\n for(int i = 0; i < k; i++){\\n ans = max(ans, dp[i] - i);\\n }\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3604,\n \"score_of_the_acc\": -0.0455,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3187_4862428\",\n \"code_snippet\": \"#ifdef LOCAL\\n #define _GLIBCXX_DEBUG\\n #define __clock__\\n#else\\n #pragma GCC optimize(\\\"Ofast\\\")\\n#endif\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing VI = vector<ll>;\\nusing VV = vector<VI>;\\nusing VS = vector<string>;\\nusing PII = pair<ll, ll>;\\n\\n// tourist set\\ntemplate <typename A, typename B>\\nstring to_string(pair<A, B> p);\\n\\ntemplate <typename A, typename B, typename C>\\nstring to_string(tuple<A, B, C> p);\\n\\ntemplate <typename A, typename B, typename C, typename D>\\nstring to_string(tuple<A, B, C, D> p);\\n\\nstring to_string(const string& s) {\\n return '\\\"' + s + '\\\"';\\n}\\n\\nstring to_string(const char* s) {\\n return to_string((string) s);\\n}\\n\\nstring to_string(bool b) {\\n return (b ? \\\"true\\\" : \\\"false\\\");\\n}\\n\\nstring to_string(vector<bool> v) {\\n bool first = true;\\n string res = \\\"{\\\";\\n for (int i = 0; i < static_cast<int>(v.size()); i++) {\\n if (!first) {\\n res += \\\", \\\";\\n }\\n first = false;\\n res += to_string(v[i]);\\n }\\n res += \\\"}\\\";\\n return res;\\n}\\n\\ntemplate <size_t N>\\nstring to_string(bitset<N> v) {\\n string res = \\\"\\\";\\n for (size_t i = 0; i < N; i++) {\\n res += static_cast<char>('0' + v[i]);\\n }\\n return res;\\n}\\n\\ntemplate <typename A>\\nstring to_string(A v) {\\n bool first = true;\\n string res = \\\"{\\\";\\n for (const auto &x : v) {\\n if (!first) {\\n res += \\\", \\\";\\n }\\n first = false;\\n res += to_string(x);\\n }\\n res += \\\"}\\\";\\n return res;\\n}\\n\\ntemplate <typename A, typename B>\\nstring to_string(pair<A, B> p) {\\n return \\\"(\\\" + to_string(p.first) + \\\", \\\" + to_string(p.second) + \\\")\\\";\\n}\\n\\ntemplate <typename A, typename B, typename C>\\nstring to_string(tuple<A, B, C> p) {\\n return \\\"(\\\" + to_string(get<0>(p)) + \\\", \\\" + to_string(get<1>(p)) + \\\", \\\" + to_string(get<2>(p)) + \\\")\\\";\\n}\\n\\ntemplate <typename A, typename B, typename C, typename D>\\nstring to_string(tuple<A, B, C, D> p) {\\n return \\\"(\\\" + to_string(get<0>(p)) + \\\", \\\" + to_string(get<1>(p)) + \\\", \\\" + to_string(get<2>(p)) + \\\", \\\" + to_string(get<3>(p)) + \\\")\\\";\\n}\\n\\nvoid debug_out() { cerr << '\\\\n'; }\\n\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n cerr << \\\" \\\" << to_string(H);\\n debug_out(T...);\\n}\\n\\n#ifdef LOCAL\\n#define debug(...) cerr << \\\"[\\\" << #__VA_ARGS__ << \\\"]:\\\", debug_out(__VA_ARGS__)\\n#else\\n#define debug(...) 42\\n#endif\\n// tourist set end\\n\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\\n\\n#define FOR(i,a,b) for(ll i=(a);i<(b);++i)\\n#define rep(i,b) FOR(i, 0, b)\\n#define ALL(v) (v).begin(), (v).end()\\n#define p(s) cout<<(s)<<'\\\\n'\\n#define p2(s, t) cout << (s) << \\\" \\\" << (t) << '\\\\n'\\n#define br() p(\\\"\\\")\\n#define pn(s) cout << (#s) << \\\" \\\" << (s) << '\\\\n'\\n#define SZ(x) ((int)(x).size())\\n#define SORT(A) sort(ALL(A))\\n#define RSORT(A) sort(ALL(A), greater<ll>())\\n#define MP make_pair\\n#define p_yes() p(\\\"YES\\\")\\n#define p_no() p(\\\"NO\\\")\\n#define possible() p(\\\"Possible\\\")\\n#define impossible() p(\\\"Impossible\\\")\\n\\nll SUM(VI& V){\\n return accumulate(ALL(V), 0LL);\\n}\\n\\nll MIN(VI& V){return *min_element(ALL(V));}\\nll MAX(VI& V){return *max_element(ALL(V));}\\n\\nvoid print_vector(VI& V){\\n ll n = V.size();\\n rep(i, n){\\n if(i) cout << ' ';\\n cout << V[i];\\n }\\n cout << endl;\\n}\\n\\nll gcd(ll a,ll b){\\n if(b == 0) return a;\\n return gcd(b,a%b);\\n}\\n\\nll lcm(ll a,ll b){\\n ll g = gcd(a,b);\\n return a / g * b;\\n}\\n\\n// long double\\nusing ld = long double;\\n#define EPS (1e-14)\\n#define equals(a,b) (fabs((a)-(b)) < EPS)\\n\\nvoid no(){p_no(); exit(0);}\\nvoid yes(){p_yes(); exit(0);}\\n\\nconst ll mod = 1e9 + 7;\\nconst ll inf = 1e18;\\nconst double PI = acos(-1);\\n\\n// snuke's mint\\n// auto mod int\\n// https://youtu.be/L8grWxBlIZ4?t=9858\\n// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize\\n// https://youtu.be/8uowVvQ_-Mo?t=1329 : division\\n// const int mod = 1000000007;\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) {\\n (x *= a.x) %= mod;\\n return *this;\\n }\\n mint operator+(const mint a) const {\\n mint res(*this);\\n return res+=a;\\n }\\n mint operator-(const mint a) const {\\n mint res(*this);\\n return res-=a;\\n }\\n mint operator*(const mint a) const {\\n mint res(*this);\\n return res*=a;\\n }\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\n // for prime mod\\n mint inv() const {\\n return pow(mod-2);\\n }\\n mint& operator/=(const mint a) {\\n return (*this) *= a.inv();\\n }\\n mint operator/(const mint a) const {\\n mint res(*this);\\n return res/=a;\\n }\\n};\\n\\nll dp[55000][200];\\n// i個まで見て\\n// 余りがjのときの最大箱数\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n // input\\n ll N,K; \\n cin>>N>>K;\\n\\n VI A(N);\\n rep(i,N)cin>>A[i];\\n\\n VV dp(N+10, VI(K, -1));\\n dp[0][0]=0;\\n\\n rep(i,N){\\n ll a = A[i];\\n rep(j,K){\\n if(dp[i][j]==-1) continue;\\n\\n // とる\\n ll sum = j+a;\\n chmax(dp[i+1][sum%K], dp[i][j] + sum/K);\\n\\n // とらない\\n chmax(dp[i+1][j], dp[i][j]);\\n }\\n }\\n ll ans = 0;\\n rep(i,K){\\n chmax(ans, dp[N][i] - i);\\n }\\n p(ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 44348,\n \"score_of_the_acc\": -0.6344,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3187_4861893\",\n \"code_snippet\": \"/**\\n * author: otera \\n**/\\n#include<iostream>\\n#include<string> \\n#include<cstdio>\\n#include<cstring>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm> \\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<deque>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\n#define int long long\\ntypedef long long ll;\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\ntypedef long double ld;\\nconst int inf=1e9+7;\\nconst ll INF=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-8;\\nconst ld pi = acos(-1.0);\\ntypedef pair<int, int> P;\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define pb push_back\\n#define debug(x) cerr << #x << \\\" = \\\" << (x) << endl;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nvoid solve() {\\n\\tint n, k; cin >> n >> k;\\n vector<int> a(n);\\n rep(i, n) {\\n cin >> a[i];\\n }\\n vector<int> dp(k, -INF);\\n vector<int> ndp(k, -INF);\\n dp[0] = 0;\\n rep(i, n) {\\n ndp.assign(k, -INF);\\n rep(j, k) {\\n if(dp[j] == -INF) continue;\\n chmax(ndp[j], dp[j]);\\n int now = k * dp[j] + j;\\n now += a[i];\\n int r = now % k, t = now / k;\\n chmax(ndp[r], t);\\n }\\n swap(dp, ndp);\\n }\\n int ans = -INF;\\n rep(j, k) {\\n chmax(ans, dp[j] - j);\\n }\\n cout << ans << endl;\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//int t; cin >> t; rep(i, t)solve();\\n\\tsolve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -0.061,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3187_4861711\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std; \\n#define rep(i, a, b) for(ll i = a; i < b; i++)\\n#define Rep(i, a, b) for(ll i = a; i <= b; i++)\\n#define repr(i, a, b) for(ll i = b-1; i >= a; i--)\\n// #define _GLIBCXX_DEBUG\\ntemplate <class T> using V = vector<T>;\\nusing ll = long long;\\n#define ALL(v) (v).begin(),(v).end()\\n#define endl \\\"\\\\n\\\"\\n#define chmin(x, y) x = min(x, y)\\n#define chmax(x, y) x = max(x, y)\\n#define co(x) cout << x << endl\\n#define pb push_back\\n#define sz(v) ((ll)(v).size())\\nconst double pi = acos(-1.0);\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\n#define pp pair<ll, pair<ll, ll>> \\n// #define fi first\\n// #define se second\\nconst int dy[] = {1, 0, -1, 0};\\nconst int dx[] = {0, 1, 0, -1};\\n\\n/*--------------------------------------------------------------------------------\\n ・ω・\\n--------------------------------------------------------------------------------*/\\n\\nvoid solve(){\\n ll n, k;\\n cin >> n >> k;\\n V<ll> A(n);\\n rep(i, 0, n) cin >> A[i];\\n V<V<ll>> dp(n+5, V<ll>(k+5, -1));\\n dp[0][0] = 0;\\n rep(i, 0, n){\\n rep(j, 0, k){\\n if(dp[i][j]==-1) continue;\\n chmax(dp[i+1][j], dp[i][j]);\\n if(j+A[i] >= k) chmax(dp[i+1][(j+A[i])%k], dp[i][j]+1);\\n else chmax(dp[i+1][j+A[i]], dp[i][j]);\\n }\\n }\\n //debug\\n // rep(i, 0, k){\\n // Rep(j, 0, n) cout << dp[j][i] << \\\" \\\\n\\\"[j==n];\\n // }\\n //\\n ll ans = -INF;\\n rep(i, 0, k) chmax(ans, dp[n][i]-i);\\n cout << ans << endl;\\n\\n return;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 46112,\n \"score_of_the_acc\": -0.6386,\n \"final_rank\": 18\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":19,"numItemsPerPage":100,"numTotalItems":2103,"offset":1900,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTkxNjcwNCwic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzc5OTIwMzA0LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.D1RN2oAyYa2et-DVysn4w7nQkJItocSFPAJtD2ccPmG03_1hMSQ6ji3VZjxhu9sLg8YFFiOrnj3WqJvJhJFkCA","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":2103,"numBytesParquet":46097533}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
group_id stringlengths 12 18 | problem_description stringlengths 85 3.02k | candidates listlengths 3 20 |
|---|---|---|
aoj_3061_cpp | Problem K: Encampment Game
Problem
$N$頂点の木がある。各頂点はそれぞれ1から$N$の番号が割り振られている。
Gacho君と川林君はこの木を使って陣取りゲームをすることにした。
ゲームはGacho君と川林君が異なる頂点にいる状態からスタートする。
Gacho君から交互に頂点を移動することを繰り返し、最初に移動できなくなった方が負けである。
移動方法:
頂点$x$にいる時、頂点$x$と辺で直接結ばれているまだ誰も訪れたことがない頂点のいずれかに移動する。
そのような頂点が存在しない場合、移動することはできない。
Gacho君が最初にいる頂点を頂点$A$、川林君が最初にいる頂点を頂点$B$とする。
... | [
{
"submission_id": "aoj_3061_10892195",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll ILL=2167167167167167167;\nconst int INF=2100000000;\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = ... |
aoj_3067_cpp | Problem D: Blaster
Problem
なんと、あなたは洞窟の中に閉じ込められてしまいました！
壁が崩れたりでもしたのでしょうか、1つしかない出口にたどり着くまでには沢山の岩が邪魔をしています。
しかしなんと、あなたのすぐ隣に爆弾の自動販売機があることに気がつきました。
さらに、洞窟にはいくつかの「ブラスター」も落ちているようです。
この2つの道具を活用すれば、出口まで脱出できそうです。
アイテムの説明
洞窟内で使用できるアイテムとして、「爆弾」「ブラスター」の2種類があります。
爆弾は、使用することで1マス分の岩を破壊できるアイテムです。
ブラスターは、使用することで自身の正面一直線にある岩を全て破壊することのできる... | [
{
"submission_id": "aoj_3067_3891733",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\nstruct FastIO{\n Fas... |
aoj_3060_cpp | Problem J: Rings
Problem
とある水族館に住むイルカ君は、ジャンプをして$N$個のリングをくぐり抜けるとご褒美がもらえます。
イルカ君は座標$(0,0)$から飛び、$(T,0)$で着水する。
ジャンプの軌道は放物線である。
$i$番目のリングは、ジャンプの軌道が$(X_i,L_i)$と$(X_i,H_i)$を結ぶ線分と交わると、くぐり抜けたと判定される。
$1$回のジャンプには初速と同じだけの体力が必要である。
イルカ君は、必要であれば何度でもジャンプをすることができます。重力加速度ベクトルを$(0,-1)$として、イルカ君が全てのリングを通り抜けるために必要な体力の合計の最小値を求めてください。ただし、摩擦や... | [
{
"submission_id": "aoj_3060_10892900",
"code_snippet": "#line 2 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\nusing namespace std;\n\n#include<bits/stdc++.h>\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp\"\nnamespace noya2 {\n\ntemplate <typename T, typename U>\nostre... |
aoj_3062_cpp | Problem L: Product
Problem
会津君は、素数$P$、自然数からなる集合$G$、自然数$A$を使ってゲームをすることにしました。
まず、会津君は手元の紙に$1$を書きます。その後、以下の一連の操作を任意の回数行います。
$G$から要素を一つ選ぶ。これを$g$とする。
手元の紙に書かれた数と$g$との積を新しく紙に書く。
元々紙に書かれていた数を消す。
手元の紙に書かれた数を$P$で割ったあまりと$A$が等しければ会津君の勝ちで、そうでなければ負けです。$P$、$G$、$A$が与えられたときに会津君が勝つことができるか判定してください。
Input
入力は以下の形式で与えられる。
$P$ $T$
$Test_1$... | [
{
"submission_id": "aoj_3062_10892806",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n\n#define rep(i,n) for(ll i=0;i<n;++i)\n#define all(a) (a).begin(),(a).end()\nll intpow(ll a, ll b){ ll ans = 1; while(b){... |
aoj_3066_cpp | Problem C: Satake likes straight
Problem
Satake君は曲がったことが嫌いです。
例えば、鉛筆や箸、家が曲がった形をしているのは嫌いですし、右折や左折などの行動をとることも嫌いです。
さて、XY 平面上で暮らすSatake君は $N$ 個のお店 $(X_{1},Y_{1}),(X_{2},Y_{2}), \ldots , (X_{N},Y_{N})$ で買い物をするようお使いを頼まれました。座標 $(0, 0)$ にある家から $(1, 0)$ の方向を向いた状態で出発し、すべてのお店で買い物をしたあと、家に帰ります。お店を回る順番は自由です。Satake君はお使いとして次に示す任意の行動を... | [
{
"submission_id": "aoj_3066_10179389",
"code_snippet": "// AOJ #3066\n// Satake likes straight 2025.2.3\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nconst double PI = acos(-1);\n\n// 2つのベクトル (ax,ay) と (bx,by) のなす角（度）を返す\ndouble angleBetween(double ax, double ay, double bx, double by) {\n double ... |
aoj_3068_cpp | Problem E: Cyclic Shift Sort
Problem
長さ $N$ の順列 $P = \{ P_1, P_2, \ldots, P_N \} $ と整数 $K$ が与えられる。
以下の操作を $0$ 回以上任意の回数繰り返すことで、順列 $P$ を単調増加にすることができるかどうか判定せよ。
整数 $x \ (0 \le x \le N-K)$ を選ぶ。 $ P_{x+1}, \ldots, P_{x+K} $ を巡回右シフトする
ただし、部分列 $U=U_1, \ldots, U_M$ の巡回右シフトとは、 $U=U_1, \ldots, U_M$ を $U=U_M, U_1, \ldots, U_{M-1}$... | [
{
"submission_id": "aoj_3068_3951976",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <tuple>\n#include <bitset>\n... |
aoj_3063_cpp | Problem M: 1333
Problem
長さ$N$の文字列$S$が与えられる。
以下のクエリを$Q$回処理せよ。
クエリ
$S[L: R]$を$S$の$L$文字目から$R$文字目まで（両端を含む）からなる文字列とする。
$ S[L: R] $を適当な文字列$A,B,C,X$を用いて$AXBXCX(1 \leq |A|,|B|,|C|,|X|)$ と表すことを考え、そのような$X$の中で最長のものの長さを出力する。
ただし、そのような$X$が存在しない場合は代わりに0を出力する。
Input
入力は以下の形式で与えられる。
$N$ $Q$
$S$
$L_1$ $R_1$
$L_2$ $R_2$
$\vdots$
$L_Q$... | [
{
"submission_id": "aoj_3063_10893053",
"code_snippet": "#line 2 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\nusing namespace std;\n\n#include<bits/stdc++.h>\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp\"\nnamespace noya2 {\n\ntemplate <typename T, typename U>\nostre... |
aoj_3069_cpp | Problem F: Bus
Problem
円環状に $1$ から $N$ までの番号がつけられた $N$ 個のバス停が右回りに並んでいる。
隣接するバス停どうしは道で結ばれている。
各 $i \ (1 \le i \le N)$ について、バス停 $i$ とバス停 $i+1$ の間を直接結ぶ道の長さは $d_i$ メートルである。
ただし、バス停 $N+1$ はバス停 $1$ のことを表す。
$M$ 台のバスがある。
$j \ (1 \le j \le M)$ 番目のバスは $c_j='R'$ のとき右回り、$c_j='L'$ のとき左回りに走行する。
また、時刻 $0$ にバス停 $b_j$ を出発し、$1... | [
{
"submission_id": "aoj_3069_4886454",
"code_snippet": "// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3069\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n... |
aoj_3074_cpp | Problem K: Gold Rush
Problem
moritaoy君とは、コンピュータのなかで暮らしている謎の大学生です。
moritaoy君が暮らしている区画は、縦に $2^H$ 、横に $2^W$ 、の大きさのある二次元空間 $S= \{ (p,q) \in \mathbb{Z}^2 | 0 \leq p \lt 2^H, 0 \leq q \lt 2^W \} $ として表されます。
moritaoy君はいくつかの非負整数を要素とする二次元ベクトルを持っていて、この空間上を足し算を用いて移動します。
moritaoy君が $(a,b)$ にいて、ベクトル $(i,j)$ によって移動するとは、具体的には以下のような行... | [
{
"submission_id": "aoj_3074_3891712",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n\ntemplate<typename T... |
aoj_3070_cpp | Problem G: Double or Increment
Problem
ある日、mo3tthi君とtubuann君は、魔法のポケットとビスケットを使ってゲームをすることにしました。
今ここに $K$ 個のポケットがあり、$1,2, \ldots ,K$ の番号がついています。
$i$ 番目のポケットの容量は $M_i$ で、最初 $N_i$ 枚のビスケットが入っています。
mo3tthi君とtubuann君は、mo3tthi君から始めて、以下の一連の操作を交互に行います。
ポケットを一つ選ぶ。
以下のいずれか一方の操作を一度だけ行う。ただし、操作の結果選んだポケットに入っているビスケットの枚数がポケットの容量を超える場合、操作... | [
{
"submission_id": "aoj_3070_10142217",
"code_snippet": "// AOJ #3070\n// Double or Increment 2025.1.25\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint mex2(int a, int b) {\n bool used[3] = {false, false, false};\n used[a] = true;\n used[b] = true;\n for(int g = 0... |
aoj_3073_cpp | Problem J: Ukunichia Query
Problem
$N$ 人の人が左から右へ一列に並んでいる。彼らの間では文字列 $S$ が流行している。
各人は、以下の条件を満たすとき
幸せ
であり、そうでないとき
幸せ
ではない。
今までに $|S|$ 文字以上の文字を伝えられていて、かつ直近の $|S|$ 文字を古い順から新しい順に並べると $S$ と一致する
以下の $2$ 種類のクエリを合計 $Q$ 回処理せよ。
クエリ1
$1$ $l$ $r$ $c$
区間 $[l, r]$ に含まれる人に文字列 $c$ を左から一文字ずつ伝える。
クエリ2
$2$ $l$ $r$
区間 $[l, r]$ に含まれる
幸せ
な人の数... | [
{
"submission_id": "aoj_3073_4797562",
"code_snippet": "#include<bits/stdc++.h>\n#include<array>\nusing namespace std;\nusing UL = unsigned int;\nusing ULL = unsigned long long;\nusing LL = long long;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nstruct VRSQ{\n int M[21];\n int V[21];\n bool z;\n VRSQ(){\n ... |
aoj_3071_cpp | Problem H: Count Words
Problem
$M$ 種類の文字がある。それらを使って長さ $N$ の文字列を作る。使われている文字の種類数が $K$ 以上であるような文字列は何通りあるか。$998244353$ で割ったあまりを求めよ。
ここで長さ $N$ の2つの文字列が異なるとは以下のように定義される。
2つの文字列を $S = S_1S_2 \ldots S_N$, $T = T_1T_2 \ldots T_N$ とした場合に、$S_i \neq T_i$ となるような $i$ $(1 \leq i \leq N)$ が存在する。
Input
入力は以下の形式で与えられる。
$M$ $N$ $K$
1行に $... | [
{
"submission_id": "aoj_3071_10946002",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long mod = 998244353;\n\nlong long binpow(long long aa, long long nn, long long mod) {\n\tif (nn == 0) return 1ll;\n\tif (nn % 2 == 1)\n\t\treturn (binpow(aa, nn - 1, mod) * (aa % mod)) % mod;\n\t... |
aoj_3075_cpp | Problem L: Space Travel
Story
遠い昔、はるかかなたの銀河系で。
時は内乱の嵐が吹き荒れるさなか、凶悪な銀河帝国の軍勢が反乱軍の秘密基地を襲った。
恐るべき帝国宇宙艦隊の追撃から逃れた、ウーク・スターウォーカーによって率いられる自由の戦士たちは、銀河の辺境に新たな秘密基地を築くことにした。
反乱軍の一員であり、凄腕のプログラマーであるあなたにあたえられたミッションは、銀河系のそれぞれの惑星から最も離れた惑星を見つけることである。
Problem
銀河系には $N$ 個の惑星があり、$M$ 個の「橋」と呼ばれる秘密のルートがある。
惑星にはそれぞれ $1,2, \ldots N$ の番号が、橋にはそれぞれ ... | [
{
"submission_id": "aoj_3075_10389291",
"code_snippet": "// AOJ #3075 Space Travel\n// 2025.4.17\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();... |
aoj_3076_cpp | Problem M: Power Subsequences
Problem
添字が $1$ から始まり、長さが有限の数列を引数とする関数 $f$ を以下のように定義する。
$\displaystyle f(\{a_1, a_2, \ldots, a_n\}) = \sum_{i=1}^n {a_i}^i$
長さ $N$ の数列 $X = \{ x_1, x_2, \ldots, x_N \}$ が与えられるので、空の列を除く全ての部分列 $X'$ に対して $f(X')$ を求め、その総和を $998244353$ で割ったあまりを出力せよ。ただし、部分列の添字は、元の数列における相対的な序列を保ったまま $1$ から順に番号を振り... | [
{
"submission_id": "aoj_3076_10179365",
"code_snippet": "// AOJ #3076\n// Power Subsequences 2025.2.3\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-... |
aoj_3078_cpp | Problem
りりあちゃんは夢の国にて繁盛している、とある服屋さんのエンジニアです。
ある日、$n$ 人のお得意さまが着る服のサイズを纏めたリストがHDDの故障によって消失してしまいました。りりあちゃんはお偉いさんにデータの保全責任を問われ、早急にリストを復旧しなければなりません。
えらく怒られたりりあちゃんは職を失い路頭に迷う危機の中、残っているファイルを血眼になって調べたところ、なんとお得意さま一人一人の身長と体重が纏められたファイルを発見しました。
$k$ 番目のお得意さまの名前は $s_k$ で表され、$s_k$ さんの身長と体重は $a_k,b_k$ で表されます。
そして、りりあちゃんが勤める服屋さんでは身長の区分を表... | [
{
"submission_id": "aoj_3078_10238568",
"code_snippet": "// AOJ #3078 Classification of Clothing\n// 2025.2.22\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc()... |
aoj_3072_cpp | Problem I: Coin and Die
Problem
表と裏のあるコインと $1$ から $N$ までの目があるサイコロがある。Gachoくんはこれらを用いて以下のゲームをして遊ぶことにした。
ゲームは最初に得点が $0$ の状態から始まり、以下の手順で進められる。
サイコロを $1$ 回振り、そのとき出た目の数を得点に加算する
現在の得点が $K$ 以上ならゲームクリアとなりゲームを終了する
現在の得点が $K$ 未満ならコインを投げ表が出れば1.に戻り、裏が出ればゲームオーバーとなりゲームを終了する
コインは投げると $A\%$の確率で表になり、 $(100-A)\%$の確率で裏になる。また、サイコロは振ると、それぞれ... | [
{
"submission_id": "aoj_3072_3894086",
"code_snippet": "#include <bits/stdc++.h>\n#define N (long long)(998244353)\n#define MAX 500000\nusing namespace std;\n\nlong long factorial[MAX] = {0}, finverse[MAX] = {0},\n inverse[MAX] = {0};\n\nvoid smodfact() {\n factorial[0] = factorial[1] = 1;\n finv... |
aoj_3081_cpp | Problem
長さ $N$ の数列 $S$ があります。ここで数列 $S$ の各要素を整数 $i$ を用いて $S_i \ (0 \le i \lt N)$ と表します。
以下の条件を全て満たす整数の組 $(a, b, c)$ の個数を数えてください。
$0 \le a \le b \lt N$
$0 \le c \le b - a$
長さ $N$ の数列 $T$ の各要素 $T_i \ (0 \le i \lt N)$ を以下のように定めたとき、数列 $S$ が数列 $T$ と等しい。
\begin{equation*}
T_i = \left \{
\begin{array}{ll}
S_{a + ((i -... | [
{
"submission_id": "aoj_3081_4878808",
"code_snippet": "// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3081\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//B... |
aoj_3080_cpp | Problem
無限に広がる二次元格子があります。 Aくんは、変わったマラソンをする予定です。
二次元格子には $N$ 個のコーナーがあり、$1$ から $N$ の番号がついています。
コーナー $i$ の初期位置は 座標 $(X_i, Y_i)$ です。
Aくんはあらかじめ、以下の操作を $K$ 回まで行うことが出来ます。
コーナーを一つ選択する。選んだコーナーの現在の座標を $(p, q)$ とする。
選んだコーナーを座標 $(p, q)$ から座標 $(p+1, q),(p, q+1), (p-1, q), (p, q-1)$ のいずれかへ移動する。
操作を行う回数が、操作に消費するコストです。
操作によって $2$ つ以上の... | [
{
"submission_id": "aoj_3080_5499018",
"code_snippet": "#include <iostream>\n#include <set>\n#include <climits>\n#include <vector>\n#include <algorithm>\n#include <cassert>\n#include <memory>\n\nusing namespace std;\nusing ll = long long;\n\nnamespace {\n /* input operator for vectors */\n template<ty... |
aoj_3082_cpp | Problem
順序木とは、各ノードに一つの整数の書かれた根付き木であって、以下の条件をみたすもののことです。
任意のノードに書かれた整数は $0$ より大きい
二つのノードが兄弟なら、書かれた整数は異なる
あるノードに書かれた整数 $k$ が $1$ より大きいなら、そのノードの兄弟であって $k-1$ が書かれたものが存在する
また、二つの順序木 $O,P$ が同型であるとは、以下の条件を満たすことをいいます。
$O$ と $P$ の根の次数が等しい
$O$ の根の子 $o$ と $P$ の根の子 $p$ に書かれた整数が等しいなら、$o$ を根とした部分木と $p$ を根とした部分木が順序木として同型である
順序木のノード $... | [
{
"submission_id": "aoj_3082_10401189",
"code_snippet": "// AOJ #3082 Points on Tree\n// 2025.4.20\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll MOD = 998244353;\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c =... |
aoj_3085_cpp | Problem
ある日、moritaoyさんは爆裂魔法を覚えました。
新しい魔法を覚えたmoritaoyさんは（傍迷惑なことに）試し撃ちをすることにしました。
試射場は $N$ 次元実ベクトル全体からなる空間であり、$N$ 次元超直方体 $E$ が浮かんでいます。
超直方体 $E$ は $N$ 個の互いに直交するベクトル $\vec{V_1},\vec{V_2},\ldots ,\vec{V_N}$ によって以下のように表される領域です。
$$E= \left \{ \sum_{i=1}^{N} x_i \vec{V_i} \mid x_i \in \mathbb{R},0 \leq x_i \leq 1 \right \} $$... | [
{
"submission_id": "aoj_3085_4878818",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ld=long double;\nint n,v[100][100],p[100];\nld x[100],now[100];\nld D(){\n ld res=0;\n for(int i=0;i<n;i++)res+=(now[i]-p[i])*(now[i]-p[i]);\n return res;\n}\nvoid change(int idx,ld diff){\n x... |
aoj_3083_cpp | Problem
今、あるシュミレーションゲームRUPC(Rich Ultra Power Challenge)をしています。
このゲームは $H$ 行 $W$ 列の盤面からなり、盤面上には $N$ 個の斥力石と $Q$ 体の敵が存在しています。
以降、上から $y$ 行目、左から $x$ 列目のマスを $(y, x)$ と表します。
ただし、番号は $0$ から始まります。例えば、左上のマスは $(0, 0)$、右下のマスは $(H-1, W-1)$ です。
$i$ 番目の斥力石は $(a_i, b_i)$ に位置し、斥力 $m_i$ を持っています。
$j$ 番目の敵は初め $(c_j, d_j)$ に位置しています。
RUPCは... | [
{
"submission_id": "aoj_3083_8504710",
"code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 3083.cc: Antigravity\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int BN = 60;\n\n/* typedef */\n\ntypedef long long ll;\... |
aoj_3084_cpp | Problem
頂点 $0$ を根とする $N$ 頂点の根付き木と、長さ $N$ の数列 $A$ が与えられます。
与えられる根付き木の $i$ 番目の辺は頂点 $u_i$ と $v_i$ を結んでいます。
$C(i)$ を、頂点 $i$ の子であるような頂点の番号の集合とします。
長さ $N$ の数列 $B_i$ を以下のように定義します。
$i=0$ なら $(B_i)_j=A_j$
$i>0$ なら $\displaystyle (B_i)_j=(B_{i-1})_j + \sum_{k \in C(j)} (B_i)_k$
数列 $B_M$ を求めてください。
ただし、$B_M$ の各項は非常に大きくなることがあるので、$9... | [
{
"submission_id": "aoj_3084_4908885",
"code_snippet": "// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3084\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n... |
aoj_3086_cpp | Problem
長さ $N$ の数列 $A = \{ a_0, a_1, \ldots, a_{N-1} \}$ が与えられる。
この数列をいくつかの「長さ $L$ 以上の連続する部分列」に分割することを考える。
より形式的には、以下の $3$ つの条件を全て満たすような整数列 $D = \{ d_0, d_1, \ldots, d_M \} $ を考える。
$d_0 = 0$
$d_M = N$
$L \leq d_{i+1}-d_i \ (0 \leq i \lt M)$
$f(D) = \displaystyle \sum_{i = 0}^{M - 1} \max_{d_i \leq j \lt d_{i+1}} a_j ... | [
{
"submission_id": "aoj_3086_10212209",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\n#endif\nusing ll=long long;\nusing ull=unsigned long long;\nusing P=pair<ll,ll>;\ntemplate<typename T>using minque=priority_queue<T,vector<T>,gre... |
aoj_3088_cpp | Problem
$N$ 枚のカードからなる山札がある。
カードは上下に並べられており、上から $i$ 番目のカードには整数 $p_i$ が書かれている。
カードが上下に $1$ 枚以上重ねられた様子を
場
と呼ぶ。
ただし、山札は場には含まないものとする。
場の一番上のカードに書かれた数を、場に書かれた数と呼ぶ。
以下の操作を終了するまで繰り返し行う。
山札が空なら、場をそれらに書かれた数の昇順に上から重ね、それを新しい山札とする
山札が上から $1$ から $N$ の順に並んでいれば終了する
山札の一番上のカードを取る(取ったカードをAとする)
Aより大きい数の書かれた場が存在しない場合、Aからなる新しい場を作り、1.... | [
{
"submission_id": "aoj_3088_10725518",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing pii = pair<int, int>;\n\nsigned main() {\n\n#ifdef DEBUG\n freopen(\"input.txt\", \"r\", stdin);\n#endif\n\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n;... |
aoj_3106_cpp | G: AOR-String
問題
$N$ 個の文字列 $S_i$ が与えられる.
$S_i$ を任意の順に繋げて得られる文字列に含まれる "AOR" の数の最大値を求めよ.
制約
$1 \leq N \leq 10^5$
$1 \leq |S_i| \leq 20$
$S_i$ は大文字アルファベットのみからなる
入力形式
入力は以下の形式で与えられる.
$N$
$S_1$
…
$S_N$
出力
$S_i$ を任意の順に繋げて得られる文字列に含まれる "AOR" の数の最大値を出力せよ. また, 末尾に改行も出力せよ.
サンプル
サンプル入力 1
2
AORA
OR
サンプル出力 1
2
サンプル入力 2
5
AB
CA
ORA
X... | [
{
"submission_id": "aoj_3106_5201125",
"code_snippet": "#pragma GCC optimize(\"O3\")\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define N 200100\n#define MOD 1000000007 //998244353\n#define ll long long\n#define rep(i, n) for(int i = 0; i < n; ++i)\n#define rep2(i, a, b) for(int i = a; i <= b; ++i)... |
aoj_3103_cpp | D: Walking
問題
$1$ から $N$ の番号がつけられている $N$ 個の島がある.
それぞれの島は $N-1$ 個の橋によって、どの $2$ つの島も何本かの橋を渡って互いに移動することができる.
それぞれの橋には耐久度があり、入力が与えられた時点での $i$ 番目の橋の耐久度は $w_i$ である.
それぞれの島にはお宝が $1$ つずつ置いており、島に滞在しているときにお宝を拾うことができる.
現在島 $S$ にいるyebiくんは、島 $E$ にある博物館に全てのお宝を運びたい.
yebiくんは✝魔力✝を持っているので、島 $v$ に訪問するたびに、 $v$ から出る全ての橋の耐久度が $T$ 減少する.
橋の耐久... | [
{
"submission_id": "aoj_3103_9664875",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int N = 1e5 + 5;\nint n, t, s, e;\nvector<pair<int, int>> adj[N];\nbool visited[N];\n\nbool dfs(int v, int p) {\n visited[v] = true;\n for (auto& edge : adj[v]) {\n int u = edge.first... |
aoj_3087_cpp | Problem
「大変！僕が大切にしていたサイコロが虫に食い荒らされてしまっている！」
「大変！サイコロの中に大切な指輪を落としてしまった！」
頑張って取り出そうとサイコロを回してみたけれど、かえって奥にいってしまったみたい . . .
そういえば昔Annazonで買った小型のロボットが押入れにあったような気がするな
--------- 一時間後 ---------
「あった！」
そこには、よく分からない粘菌が付着してネバネバしている正六面体のロボットCUBEくんの姿があった。
「なんかネバネバするけど . . . まぁいいか！ 」
僕はCUBEくんをサイコロの虫に食われた場所に設置した。
虫に食われた立方体のサイコロが $N \t... | [
{
"submission_id": "aoj_3087_4846666",
"code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> l_l;\ntypedef pair<int, int> i_i;\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return ... |
aoj_3089_cpp | Problem
$N$ 頂点の根付き木が与えられます。
各頂点には $0$ から $N-1$ の重複のない番号がついていて、頂点 $0$ が根です。
$j$ 番目の辺は頂点 $u_j$ と $v_j$ を結んでいます。
頂点 $i$ には $C_i$ 個のコマが置いてあります。
Aizu君とBeet君はゲームをします。
ゲームでは、Aizu君から始めて交互に以下の操作を行います。
子の存在する頂点 $w$ に置かれたコマを一個選ぶ。
$w$ の子孫であって、$w$ との距離が $1$ 以上 $K$ 以下であるような頂点のうち一つを選び、そこに選んだコマを移動する。
先に操作ができなくなった方が負けです。
両者が最適に行動したとき、ど... | [
{
"submission_id": "aoj_3089_10284941",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define ... |
aoj_3105_cpp | F: 友達探し
問題
$1$ から $N$ までの番号が付けられた $N$ 人の人に対して，ある部屋の入退室記録が $M$ 個与えられる．
$i$ 番目の入退室記録は $A_i\ B_i\ C_i$ の $3$ つの整数からなり，これは以下を示している．
$C_i = 1$ のとき，時刻 $A_i$ に $B_i$ さんが部屋に入室したことを表す.
$C_i = 0$ のとき，時刻 $A_i$ に $B_i$ さんが部屋から退室したことを表す.
$i$ 番目($1 \leq i \leq N$)の人について，時刻 $T$ までに部屋で一緒に過ごした時間が最も長い人を答えよ．
制約
入力値は全て整数である.
$2 \leq N,\ M... | [
{
"submission_id": "aoj_3105_10865779",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct PairTime {\n int i;\n int j;\n long long duration;\n};\n\n// Comparator to sort PairTime by i then by j\nbool cmp_pair(const PairTime &a, const PairTime &b) {\n if(a.i != b.i) return... |
aoj_3102_cpp | C: 同値命題
問題
$N$ 個の命題があり, それぞれ $1, 2, \cdots,N$ という名前がついている.
また, 命題に関する情報が $M$ 個与えられる. $i$ 番目の情報は「$a_i$ $b_i$」という形式で与えられ, これは $a_i$ ならば $b_i$ であることを表す.（「ならば」は論理包含であり、推移律が成り立つ）
各命題 $i$ に対して $i$ と同値な命題を全て昇順に出力せよ.
ただし命題 $i$ と命題 $i$ は常に同値である.
命題 $X$ と命題 $Y$ が同値とは,「$X$ ならば $Y$」かつ「$Y$ ならば $X$」のことである.
制約
入力値は全て整数である.
$ 2 \leq N... | [
{
"submission_id": "aoj_3102_7965344",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N, M; cin >> N >> M;\n vector<vector<int>> G(N); \n for (int _ = 0 ; _ < M ; _++) {\n int a, b; cin >> a >> b;\n a--; b--;\n G[a].push_back(b);\n }\n\... |
aoj_3104_cpp | E: モンスターバスター
問題
AORイカちゃんはモンスターバスターである.
ある日, 道を歩いていると寝ているモンスターに出会った.
闘争心が強いAORイカちゃんは,モンスターに寝起きの一撃をお見舞いすることに決めた.
しかし, 現在のAORイカちゃんの攻撃力は $0$ であり, このままではまともな攻撃ができない.
モンスターバスターの精進をしているAORイカちゃんは, 実は師匠から特殊な笛を託されていた.
この笛で特定の曲を吹くと一定時間攻撃力が上がるのである.
修行を積んだAORイカちゃんは $N$ 個の曲を吹くことができる.
$i$ 番目の曲は演奏に ... | [
{
"submission_id": "aoj_3104_10858191",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\nstruct song {\n int r, a, w, t;\n};\n\nbool cmp(song s1, song s2) {\n return min(s2.t, s1.t - s2.r) > min(s1.t, s2.t - s1.r);\n}\n\nint main() {\n int n;\n ... |
aoj_3107_cpp | A: 間違い探し
問題
縦に
N
マス、横に
M
マスある長方形の盤面
A
,
B
が与えられます。各盤面について、それぞれのマスは白または黒で塗られています。
盤面
X
の
i
行
j
列目のマスの色を
C(i, j, X)
と表記することにします。
以下の条件を満たす整数の組
(i, j)
がいくつあるか数えてください。
1 \leq i \leq N
1 \leq j \leq M
C(i, j, A) \neq C(i, j, B)
入力形式
N
M
A_1
...
A_N
B_1
...
B_N
A_i
(
1 \leq i \leq N
) の
j
文字目が
#
のときは
C(i, j, A)
が黒、
.
のときは
C(... | [
{
"submission_id": "aoj_3107_9543228",
"code_snippet": "#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 1000000000;\n\nconst int MAX_N = 10;\nsta... |
aoj_3108_cpp | B: テトリス
問題
縦 4 マス x 横 10 マスの長方形からなる盤面を考えます。
縦 1 マス x 横 1 マスぶんの正方形をブロックと呼びます。
ブロックを 4 つ繋げたものをテトロミノと呼び、以下の 7 種類（およびこれらに対して 90 度回転を任意回行ったもの）があります。
さて、盤面のうち 28 個のマスにブロックが置かれた状態を考えます。
左の図のように、各ブロック（赤色で表される）はマスに合うように置かれます。右の図のように半端な位置に置かれることはありません。
4 つのテトロミノ
t_1
,
t_2
,
t_3
,
t_4
が与えられるので、このうちちょうど 3 つを選んですきな位置に置くことで、盤面全体にブロッ... | [
{
"submission_id": "aoj_3108_10183526",
"code_snippet": "// AOJ #3108\n// Perfect 2025.2.3\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ull = unsigned long long;\n\nstatic inline ull cellBit(int row, int col) {\n return ull(1) << (row * 10 + col);\n}\n\nvector<pair<int,int>> readTetromino() {... |
aoj_3112_cpp | F: 部分文字列分解
問題
2 つの文字列
S
と
T
および整数
k
が与えられる。
T
の長さ
k
以上の連続する部分文字列を考えたとき、それらの連結で
S
を構成できるか判定せよ。
ここで文字列
s = s_1 s_2 ... s_n
の連続する部分文字列
s[l, r] = s_l s_{l+1} ... s_r
(1 \leq l \leq r \leq n)
とは、
s
の
l
文字目から
r
文字目までを切り出してできる文字列を指し、その長さは
r - l + 1
である。
入力形式
S
T
k
制約
S
と
T
は小文字アルファベットからなる
1 \leq |S|, |T| \leq 2\times 10^5
1 \... | [
{
"submission_id": "aoj_3112_10315010",
"code_snippet": "// AOJ #3112 Substring Decomposition\n// 2025.3.21\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct st {\n int l, link;\n int nx[26];\n st() : l(0), link(-1) {\n for(int i=0; i<26; i++) nx[i] = -1;\n ... |
aoj_3110_cpp | D: Many Decimal Integers
問題
数字 (
0
から
9
) のみからなる文字列
S
と、数字 と
?
のみからなる文字列
T
が与えられます。
S
と
T
は同じ長さです。
T
内に存在するそれぞれの
?
について、
0
から
9
までの数字のいずれか
1
つに変更し、数字のみからなる文字列
T'
を作ることを考えます。このとき、
f(T') \leq f(S)
である必要があります。ここで
f(t)
は、文字列
t
を
10
進数として読んだときの整数値を返す関数とします。
また、
T'
の最上位の桁にある数字は
0
であってもよいものとします。
あり得る文字列
T'
すべてについて、
f(T')
の値の総... | [
{
"submission_id": "aoj_3110_9805499",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <random>\n#include <cassert>\n#include <bitset>\n#include <numeric>\n#include <queue>\n#include <unordered_map>\n#include <climits>\n#include <array>\n#include <m... |
aoj_3111_cpp | E: 総和の切り取り
問題
えびちゃんは数列
(a_1, a_2, ..., a_n)
を持っています。
えびちゃんは（空でもよい）部分配列の総和の最大値が気になるので、それを求めてください。
ここで、部分配列とは連続する部分列を指します。なお、空列の総和は
0
とします。
さらに、えびちゃんがこの数列を
q
回書き換えるので、各書き換えの直後にこの値を求めてください。
入力形式
n
q
a_1
a_2
...
a_n
k_1
x_1
...
k_q
x_q
各
k_j
,
x_j
(
1 \leq j \leq q
) は、
a_{k_j}
を
x_j
に書き換えることを意味します。
各書き換えは独立ではなく、その後の処理において... | [
{
"submission_id": "aoj_3111_10908582",
"code_snippet": "#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3111\"\n\n\n#include <algorithm>\n#include <concepts>\n#include <optional>\n\nnamespace zawa {\n\ntemplate <std::totally_ordered T>\nclass SubarraySumMax {\npublic:\n\n SubarraySumMax() = ... |
aoj_3109_cpp | C: カニサル暗号
問題
えびちゃんは、ある非負整数
D
を「カニサル暗号」で暗号化して得られた文字列
C
を与えられました。この暗号は、非負整数を
10
進法で表したときの各数字をある（元と異なるとは限らない）決められた数字で置き換えるものです。異なる数字が同じ数字に置き換えられたり、同じ数字が出現位置によって異なる数字に書き換えられることはありません。
たとえば、この暗号化方式によって
2646
が
0545
になることはありますが、
3456
が
1333
になったり
1333
が
3456
になることはありません。
いま、えびちゃんは
D
を
10^9+7
で割った余りが
M
になることを教えてもらいました。このとき、
D
... | [
{
"submission_id": "aoj_3109_9697476",
"code_snippet": "#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cfloat>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <deque>\n#include <filesystem>\n#include <fstream>\n#include <functional>\n#include <iom... |
aoj_3113_cpp | G: Restricted DFS
問題
N
頂点
N-1
辺からなる、自己ループや多重辺が存在しない無向木
G
がある。頂点はそれぞれ
1
から
N
まで番号付けされており、辺もそれぞれ
1
から
N-1
まで番号付けされており、
i
番目の辺は
u_i
と
v_i
を結んでいる。また、
i
番目の頂点には非負整数
A_i
がそれぞれ割り当てられている。
この木に対して、根
r
から以下の擬似コードにしたがって DFS (深さ優先探索) を行うことを考える。
// [input]
// G: dfs の対象となるグラフ
// A: それぞれの頂点に割り当てられた非負整数
// v: dfs を開始する頂点
// step: ステッ... | [
{
"submission_id": "aoj_3113_9908080",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\n#include <algorithm>\n#include <string>\n#include <unordered_map>\n\nusing namespace std;\n\n#define int long long\n\nvector<vector<int>> graph;\nvector<bool> res;\nvector<int> cnt;\nvector<int>... |
aoj_3114_cpp | Min Element
数列
a_1,a_2,..,a_N
が与えられます。
この数列の最小値の番号を求めてください。
最小値が複数の場所にあるときは、番号の最も小さいものを答えてください。
入力
N
a_1 a_2...a_N
出力
a_i
が数列の最小値となるような
i
のうち、最も小さいものを出力せよ。
制約
1 \leq N \leq 10^5
1 \leq a_i \leq 10^9
入力例
6
8 6 9 1 2 1
出力例
4 | [
{
"submission_id": "aoj_3114_10588953",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main()\n{\n int N;\n const int MAX_NUM = 100000;\n int input_array[MAX_NUM] = {};\n int min_val = 100000000;\n int min_val_place = 0;\n cin >> N;\n \n for (int i = 1; i<= N;i++)\n... |
aoj_3122_cpp | 双子 (Twins)
square1001君とE869120君は双子です。
このうち先に生まれた方を出力して下さい。
入力
入力は与えられない。
出力
正解の文字列を一行に出力せよ。
ただし、最後には改行を入れること。
出力例1
square1001 | [
{
"submission_id": "aoj_3122_4066547",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int>P;\n\nvector<int>E[200000];\nint sz[200000];\nint vid[200000];\nint par[200000];\nint dep[200000];\n\nint belong[200000]... |
aoj_3115_cpp | Set
数列
a_1,a_2,..,a_N
が与えられます。
この数列に値は何種類ありますか。
入力
N
a_1 a_2...a_N
出力
数列の値の種類数を出力せよ。
制約
1 \leq N \leq 10^5
1 \leq a_i \leq 10^9
入力例
6
8 6 9 1 2 1
出力例
5 | [
{
"submission_id": "aoj_3115_9540653",
"code_snippet": "#include<bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 1000000000;\n\nconst int MAX_N = 10;\nstat... |
aoj_3123_cpp | アルミ缶の上にあるミカン (Oranges on Cans)
square1001 君は、テーブルにアルミ缶を $N$ 缶置きました。
E869120 君は、テーブル上のそれぞれのアルミ缶の上に $M$ 個ずつミカンを乗せました。
アルミ缶の上に乗っているミカンは全部で何個ありますか？
入力
入力は以下の形式で標準入力から与えられる。
$N$ $M$
出力
アルミ缶の上に乗っているミカンの数を 1 行で出力してください。
ただし、最後には改行を入れること。
制約
$1 \leq N \leq 9$
$1 \leq M \leq 9$
入力は全て整数である。
入力例1
3 4
出力例1
12
入力例2
7 7
出力例2
49 | [
{
"submission_id": "aoj_3123_4065990",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int>P;\n\nstruct st{\n\tint a,b,c,d;\n};\nst s[200000];\n\nint main(){\n\tint n,q;cin>>n>>q;\n\trep(i,n){\n\t\tscanf(\"%d%d%... |
aoj_3116_cpp | Range Count Query
数列
a_1,a_2,..,a_N
が与えられます。
クエリでは、値が
l
以上
r
以下の項の個数を答えてください。
入力
N Q
a_1 a_2...a_N
l_1 r_1
l_2 r_2
:
l_q r_q
出力
ans_1
ans_2
:
ans_q
i
行目には、
i
番目のクエリに対する答え、すなわち
l_i \leq a_j \leq r_i
なる
j
の個数を出力せよ。
制約
1 \leq N,Q \leq 10^5
1 \leq a_i \leq 10^9
1 \leq l_i \leq r_i \leq 10^9
入力例
6 3
8 6 9 1 2 1
2 8
1 7
3 5
... | [
{
"submission_id": "aoj_3116_9540614",
"code_snippet": "#include<bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 1000000000;\n\nconst int MAX_N = 100000;\n... |
aoj_3118_cpp | Range Min of Max Query
整数の組の列
(a_1,b_1), (a_2,b_2),..,(a_N,b_N)
が与えられます。
二種類のクエリを処理してください。
一種類目のクエリでは、
a_L,a_{L+1},..,a_R
に
X
を加算します。
二種類目のクエリでは、
max(a_L,b_L),max(a_{L+1},b_{L+1}),..,max(a_R,b_R)
の最小値を求めます。
入力
N Q
a_1 b_1
a_2 b_2
:
a_N b_N
query_1
query_2
:
query_Q
i
番目のクエリが一種類目のクエリの場合、
query_i
は
1 L_i R_i X_i
となります。
i... | [
{
"submission_id": "aoj_3118_10625867",
"code_snippet": "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;const int A = 1e5 + 5;\nstruct node{ll x,y;int id;}a[A];\nint read(){int x = 0,f = 1;char c = getchar();\n\twhile(!isdigit(c)){if(c == '-')f = -1;c = getchar();}\n\twhile(isdigit(c))x... |
aoj_3120_cpp | Bichrome Tree Connectivity
木が与えられます。
はじめ、すべての頂点は白いです。
白い頂点の色を反転すると黒になり、黒い頂点の色を反転すると白になります。
二種類のクエリを処理してください。
一種類目のクエリでは、頂点
v
の色を反転します。
二種類目のクエリでは、白い頂点
v
から白い頂点とそれらを結ぶ辺だけを使ってたどり着ける頂点の個数を答えます。
入力
N Q
a_1 b_1
a_2 b_2
:
a_{n-1} b_{n-1}
t_1 v_1
t_2 v_2
:
t_q v_q
t_i
が
1
のとき一種類目のクエリ、
2
のとき二種類目のクエリであることを表す。
出力
ans_1
ans_2
:
a... | [
{
"submission_id": "aoj_3120_10936055",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\n#define FOR(I, L, R) for(int I(L) ; I <= (int)R ; ++I)\n#define FOD(I, R, L) for(int I(R) ; I >= (int)L ; --I)\n#define FOA(I, A) for(auto &I : A)\n\n#define print(A,L,R) FOR... |
aoj_3117_cpp | K Average Ranges
数列
a_1,a_2,..,a_N
が与えられます。
この数列に値の平均が
K
以上の長さ
1
以上の区間はいくつありますか。
入力
N K
a_1 a_2...a_N
出力
答えを出力せよ。
制約
1 \leq N \leq 10^5
1 \leq K \leq 10^9
1 \leq a_i \leq 10^9
入力例
6 6
8 6 9 1 2 1
出力例
7 | [
{
"submission_id": "aoj_3117_10351776",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define ... |
aoj_3121_cpp | Queries with Six Inequeties
四つの整数の組
(a,b,c,d)
の集合が与えられます。
j
番目のクエリでは、
x_j < a_i < y_j < b_i
かつ
z_j < c_i < w_j < d_i
なる
i
が存在するか判定します。
入力
N Q
a_1 b_1 c_1 d_1
a_2 b_2 c_2 d_2
:
a_n b_n c_n d_n
x_1 y_1 z_1 w_1
x_2 y_2 z_2 w_2
:
x_q y_q z_q w_q
出力
ans_1
ans_2
:
ans_q
j
行目には、
j
番目のクエリに対する答えを出力せよ。
条件を満たす添字
i
が存在するなら
Yes
、存在... | [
{
"submission_id": "aoj_3121_5298642",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef tuple<ll,ll,ll> PP;\ntypedef vector<PP> vpp;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef... |
aoj_3130_cpp | たしざんひきざん (Calculation Training)
square1001 君は E869120 君に、誕生日プレゼントとして二つの数字 $A$ と $B$ をプレゼントしました。
E869120 君はこの二つの数字を使って、計算トレーニングをすることにしました。
具体的には、E869120君は次の操作をちょうど $N$ 回これらの数に行います。
奇数回目の操作のとき、$A$ を $A-B$ で置き換える
偶数回目の操作のとき、$B$ を $A+B$ で置き換える
E869120君が $N$ 回の操作をした後、$A$ と $B$ の値がそれぞれいくつになっているか求めてください。
入力
入力は以下の形式で標準入力から与えら... | [
{
"submission_id": "aoj_3130_4071512",
"code_snippet": "#include <iostream>\n/*\nN = num()\nA,B = nums()\ncurA,curB = A,B\nfor i in range(N):\n if i % 2 == 0:#kisuu\n curA = curA - curB\n else:#guusuu\n curB = curA + curB\nprint(curA,curB)\n*/\nint main()\n{\n long long N;\n int A,... |
aoj_3119_cpp | Zero AND Subsets
非負整数の多重集合
a_1,a_2,..,a_N
が与えられます。
この集合の空でない部分集合であって、値のbitwiseANDが
0
になるものはいくつありますか。
答えを
10^9+7
で割った余りを求めてください。
入力
N
a_1 a_2...a_N
出力
答えを
10^9+7
で割った余りを出力せよ。
制約
1 \leq N \leq 10^5
0 \leq a_i \leq 2^{20}-1
入力例
6
8 6 9 1 2 1
出力例
51 | [
{
"submission_id": "aoj_3119_10183987",
"code_snippet": "// AOJ #3119\n// Zero AND Subsets 2025.2.3\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-')... |
aoj_3125_cpp | 今日の乱数 (Today's Random Number)
E869120 君は、「今日の乱数」というキャンペーンをN日間行いました。これは、毎日 1 回乱数を生成し、その値をツイッターに投稿するという企画です。
$1, 2, 3, \dots, N$ 日目の「今日の乱数」は、それぞれ $A_1, A_2, A_3, \dots, A_N$ でした。
E869120 君は、今日の乱数の値が昨日の乱数の値よりも高ければ嬉しくなります。
$N$ 日間のなかで、E869120 君は何回「今日の乱数」によって嬉しくなったでしょうか？
入力
入力は以下の形式で標準入力から与えられる。
$N$
$A_1$ $A_2$ $A_3$ $\dots$... | [
{
"submission_id": "aoj_3125_7075721",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <limits>\n#include <string>\n#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <list>\n#include <set>\n#include <unordered_set>\... |
aoj_3128_cpp | 競り (Auction)
square1001君はとある競りを鑑賞していました。
競りとは、買い手が多数で品数に制限があるとき、高値を付けたものに買う権利を与える仕組みの取引です。
(新明解国語辞典第七版より)
ここでの競りのルールは以下の通りです。
1. 次の 2. ～ 6. を品物が尽きるまで繰り返す
2. 新たな品物を出し、客に見せる
3. 客のうちの 1 人が好きな値段を品物につける
4. 客のうちの 1 人が現在品物についている値段
よりも
高い値段をつける
5. 4. の行為を行う客がいなくなるまで 4. を繰り返す
6. 品物に一番高い値段を付けた客がそれを落札する
square1001君はこの競り中に品物につけられた... | [
{
"submission_id": "aoj_3128_7075741",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <limits>\n#include <string>\n#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <list>\n#include <set>\n#include <unordered_set>\... |
aoj_3127_cpp | ギャグ (Gag)
Segtree 君は $N$ 個の「ギャグ」を持っていて、それぞれに「できばえ」 $V_i$ という値が定まっています。
Segtree 君は自由な順番で全てのギャグを公開することにしました。
ここで、 $i$ 番目のギャグを $j$ 番目に公開した時に得られる「うれしさ」は $V_i - j$ と表されます。
Segtree 君が得られる「うれしさ」の和の最大値を求めてください。
入力
入力は以下の形式で標準入力から与えられる。
$N$
$V_1$ $V_2$ $\ldots$ $V_N$
出力
「うれしさ」の和の最大値を出力してください。ただし、値が 32bit 整数に収まるとは限りません。
最後には改行を入... | [
{
"submission_id": "aoj_3127_7075731",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <limits>\n#include <string>\n#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <list>\n#include <set>\n#include <unordered_set>\... |
aoj_3133_cpp | カツサンド (Cutlet Sandwich)
ある世界には、 $X$ 種類の「サンド」、 $Y$ 種類の「カツ」、 $Z$ 種類の「カレー」という食べ物があります。
この世界には $N$ 種類の「カツサンド」という食べ物があり、 $i$ 種類目のカツサンドは $A_i$ 種類目のサンドと $B_i$ 種類目のカツが原料です。
また、 $M$ 種類の「カツカレー」という食べ物があり、 $i$ 種類目のカツカレーは $C_i$ 種類目のカツと $D_i$ 種類目のカレーが原料です。
Segtree 君は、あるカツサンドまたはカツカレーを持っているとき、原料のうち少なくとも $1$ つが共通しているようなカツサンドまたはカツカレーと交換... | [
{
"submission_id": "aoj_3133_10315199",
"code_snippet": "// AOJ #3133 Cutlet Sandwich\n// 2025.3.21\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0; int c = gc();\n\tif (c == '-') {\tc = gc();\n\t\t... |
aoj_3129_cpp | コンテストTシャツ (Contest T-shirts)
Segtree 君は、 $M$ 枚のコンテストTシャツを持っています。
彼は今から $N$ 日間、コンテストTシャツだけで過ごそうと考え、$i = 1, 2, 3, \dots, N$ に対して「 $i$ 日目に $A_i$ 枚目のTシャツを着る」という $N$ 個の計画を立てました。
しかし、今の計画のままだと洗濯が間に合わない可能性があるので、必要に応じて計画を変更し、2日連続で同じ服を着ないようにしたいです。
変更する必要のある計画の個数の最小値を求めてください。なお、与えられた制約の元で、計画の変更によって必ず条件を満たすようにできることが証明できます。
入力
入力は... | [
{
"submission_id": "aoj_3129_7075748",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <limits>\n#include <string>\n#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <list>\n#include <set>\n#include <unordered_set>\... |
aoj_3134_cpp | カードはおやつに入りますか？(Are Cards Snacks?)
square1001君は $N$ 枚のカードを持っています。
これらのカードにはそれぞれ整数が書かれており、$i$ 枚目のカードに書かれている整数は $A_i$ です。
square1001君の今日の乱数は $K$ です。square1001君はこれらの $N$ 枚のカードの中から何枚かのカードを選び、合計が $K$ となるようにしたいです。
この様子を見ていたE869120君は、これを阻止したいと考えました。
具体的には、事前に何枚かのカードを食べることで、square1001 君がどのように残りのカードを選んでも合計が $K$ とならないようにしたいです。
しか... | [
{
"submission_id": "aoj_3134_10331716",
"code_snippet": "#include<bits/stdc++.h> \nusing namespace std;\nusing ll=long long;\n\n#include<atcoder/segtree>\nusing namespace atcoder;\ndouble op(double a,double b){return a*b;}\ndouble e(){return 1.0;}\n\nint main(){\n\t\n\tcin.tie(nullptr);\n\tios::sync_with_st... |
aoj_3135_cpp | 五等分のケーキ (Divide Cake into Five)
Segtree 君は五つ子の家庭教師をしています。今日はクリスマスイブなので、五つ子のために円形のケーキを五等分しようとしています。
ケーキは中心から扇形状に $N$ 個のピースに分けられており、 $i$ 番目と $i + 1$ 番目($1 \leq i \leq N - 1$) 、 $N$ 番目と $1$ 番目のピースは隣り合っています。
$i$ 番目のピースの大きさは $A_i$ です。全てのピースの大きさの和を $S$ とすると、全ての入力について $S$ が $5$ の倍数であることが保証されます。
ある非負整数 $Y$ が与えられます。以下の条件を満たすような... | [
{
"submission_id": "aoj_3135_10315468",
"code_snippet": "// AOJ #3135 Divide Cake into Five\n// 2025.3.21\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N; ll Y;\n cin >> N >> Y;\n vector<ll> A(N);\n ... |
aoj_3132_cpp | 地震 (Earthquakes)
E869120 君は地震が苦手です。
具体的には、ある作業をしている時に震度 $p$ の地震が発生した際、その作業のパフォーマンスが $10 \times p$ パーセント低下します。
昨日、$N$ 回地震が発生しました。より具体的に言うと、昨日の i 回目の地震は時刻 $T_i$ に発生し、その震度は $A_i$ でした。
ここで $Q$ 個の質問が与えられます。$i$ 個目の質問の内容は以下の通りです。
E869120 君が時刻 $L_i$ から時刻 $R_i$ まで作業をした時、最終的な作業のパフォーマンスの値はいくつになるでしょうか？
ただし、作業開始時のパフォーマンスは $10000000... | [
{
"submission_id": "aoj_3132_10331713",
"code_snippet": "#include<bits/stdc++.h> \nusing namespace std;\nusing ll=long long;\n\n#include<atcoder/segtree>\nusing namespace atcoder;\ndouble op(double a,double b){return a*b;}\ndouble e(){return 1.0;}\n\nint main(){\n\t\n\tcin.tie(nullptr);\n\tios::sync_with_st... |
aoj_3136_cpp | りんごだいぼうけん
square1001君とE869120君は縦 $H$ 行、横 $W$ 列のグリッドの世界に迷い込んでしまいました!
この世界の神は言いました。
「リンゴを $K$ 個集めて二人が出会ったとき、さすれば元の世界に帰れるであろう。」
この言葉を聞いたsquare1001君は、リンゴを $K$ 個以上集めてE869120君がいるマスへ向かうことにしました。
ここで、グリッドの各マスは次のように表されます。
's'：square1001君がいるマスです。
'e'：E869120君がいるマスです。
'a'：リンゴが1つ落ちているマスです。このマスを初めて訪れたときにリンゴを1つ得ることができます。
このグリッド上にこのマス... | [
{
"submission_id": "aoj_3136_10315530",
"code_snippet": "// AOJ #3136 Apple Adventure\n// 2025.3.21\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1e9;\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int h, w, k;\n cin >> h >> w >> k;\n v... |
aoj_3138_cpp | B: サイコロを転がさないで
問題文
$H$ 行 $W$ 列からなるグリッドがあります。以降、グリッド上の $i$ 行目 $j$ 列目のマスを $(i, j)$ のマスと書きます。
グリッドの各マスには、$1$ 以上 $6$ 以下の数字か、あるいは
#
の文字が $1$ つずつ書かれています。
ただし、$i$ と $j$ がともに偶数であるような $(i, j)$ のマスには必ず
#
が書かれています。
あなたは以下の図で表されるようなサイコロを $1$ つ持っています。
最初、あなたはこのサイコロを底面が $6$, 前面が $2$, 右面が $3$ となるように $(1, 1)$ のマスに置きます。
ここで、前面は $(i, j)... | [
{
"submission_id": "aoj_3138_4518542",
"code_snippet": "// https://onlinejudge.u-aizu.ac.jp/beta/room.html#KUPC2020Spring/problems/B\n#include <bits/stdc++.h>\nusing namespace std;\n// #define int long long\n#define REP(i, n) FOR(i, 0, n)\n#define REPR(i, n) for (int i = n - 1; i >= 0; i--)\n#define FOR(i, ... |
aoj_3143_cpp | G: 一番遠い町
問題文
$N$ 個の町と $N-1$ 個の道があります。
すべての町と道にはそれぞれ $1$ から $N$, $1$ から $N-1$ の番号がついています。
道 $i$ は町 $a_i$ と町 $b_i$ を距離 $d_i$ で双方向につないでいます。
最初はすべての道が通行可能な状態であり、どの町からもいくつかの道を通ることですべての町に行くことができます。
すいばかくんは最初、町 $1$ にいます。
$Q$ 個のクエリが与えられるので順番に処理してください。クエリは $3$ 種類あり、以下の形式で与えられます。
クエリ $1$ :
1 x
― すいばかくんが町 $x$ に移動する。ただし、このクエリ時点で、す... | [
{
"submission_id": "aoj_3143_5783307",
"code_snippet": "// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3143\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\ntemplate<typename Vertex, typename Cluster, size_t N>\nstruct TopTree{\n enum Typ... |
aoj_3141_cpp | E: 数列ゲーム
問題文
長さ $N$ の正整数列 $a_1, a_2, \ldots, a_N$ があります。
この数列を用いた、$2$ 人のプレイヤーが先手と後手に分かれて行う以下のゲームを考えます。
先手と後手は交互に、以下の操作のどちらかを選んで行う。
数列の正の項を $1$ つ選び、その値を $1$ 減らす。
数列の全ての項が正のとき、全ての項の値を $1$ ずつ減らす。
先に操作を行えなくなったほうが負けです。
$2$ 人のプレイヤーが最適に行動したとき、先手と後手どちらが勝つかを求めてください。
制約
$1 \leq N \leq 2 \times 10^5$
$1 \leq a_i \leq 10^9$
入力は全て整... | [
{
"submission_id": "aoj_3141_10489581",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)\n#define all(v) begin(v),end(v)\nusing namespace std;\nusing ll = long long;\n\n\nvoid solve(){\n int n; cin >> n;\n ll sum = 0, mi = 1e9+10;\n rep(i,0,n){\... |
aoj_3139_cpp | C: サボテンクエリ
問題文
単純無向グラフで、任意の辺が高々 $1$ つの単純閉路にしか含まれないようなものをサボテングラフと呼ぶことにします。
$N$ 頂点 $M$ 辺の連結なサボテングラフ $G$ が与えられます。
各頂点は $1$ から $N$ まで番号が付いています。
また、$i$ 個目の辺は頂点 $a_i$ と頂点 $b_i$ を結んでおり、コストは $c_i$ です。
グラフ $G$ 上の単純パスのコストを、そのパス上に含まれる全ての辺のコストの XOR と定めます。
以下のような形式の $Q$ 個のクエリに答えてください。
x_i y_i k_i
― 頂点 $x_i$ と頂点 $y_i$ を繋ぐすべての単純パスのコス... | [
{
"submission_id": "aoj_3139_7910899",
"code_snippet": "#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <numeric>\n#include <iostream>\n#include <iomanip>\n#include <unordered_map>\n#include <climits>\n#include <queue>\n#include <stack>\n#include <random>\n#include <set>\n#include <casse... |
aoj_3140_cpp | D: Xor Array
問題文
整数 $N$ と $X$ が与えられます。
以下の条件を満たす長さ $N$ の数列の個数を $998244353$ で割った余りを求めてください。
数列は広義単調増加である。
数列の各要素は $0$ 以上 $X$ 以下である。
全ての要素の排他的論理和(xor)が $X$ である。
制約
$1 \leq N \leq 500$
$0 \leq X \leq 500$
$N$ と $X$ は整数である。
入力
入力は以下の形式で標準入力から与えられる。
$N$ $X$
出力
答えを出力せよ。
入力例1
2 3
出力例1
2
数列 $\{0,3\}$ と $\{1,2\}$ が条件を満たします。
入力例... | [
{
"submission_id": "aoj_3140_10570466",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#include<atcoder/modint>\ntypedef atcoder::modint998244353 mint;\nint main() {\n\tint n,x; cin >> n >> x;\n\t// dp[i][j][k]:length i,now max j,all xor k.\n\t// dp[i][k] -> ndp[i+2x]... |
aoj_3146_cpp | J: 接頭辞分解
問題文
英小文字からなる文字列 $S$ が与えられます。
次の条件を満たす文字列 $T$ のうち、長さが最小のものを $1$ つ求めてください。
$S$ をいくつかの部分文字列に分割し、その部分文字列すべてが $T$ の接頭辞となるようにできる。
ただし、$K$ 個の文字列の組 $Y_1, Y_2, \ldots , Y_K$ が文字列 $X$ の分割であるとは、次の条件を満たすことを言います。
$Y_1, Y_2, \ldots , Y_K$ をこの順に連結すると、 $X$ と等しくなる。
また、文字列 $x$ の接頭辞とは、 $x$ の末尾から $0$ 文字以上の文字を取り除くことで得られる文字列のことを言いま... | [
{
"submission_id": "aoj_3146_4279453",
"code_snippet": "#include <bits/stdc++.h> // clang-format off\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se second\n#define each(x,v) for(auto& x : v)\n#define all(v) (v).begin(),(v).end()\n#define sz(v) ((int)(v).size())\n#define ini(..... |
aoj_3144_cpp | H: 魔法使いの塔
問題文
あなたが持っている魔導書には、 $N$ 個の魔法が載っています。
魔法には $1$ から $N$ までの番号がついていて、魔法 $i (1 \le i \le N)$ のコストははじめ整数 $A_i$ です。
あなたの目的は、魔導書に載っているすべての魔法を $1$ 回ずつ唱えることです。
魔法を唱えはじめる前に、あなたはクッキーを $K$ 枚食べることができます。クッキーを食べるのに時間はかかりません。
あなたはクッキーを $1$ 枚食べるたびに、コストが正の魔法を $1$ つ選び、そのコストを $1$ 下げることができます。
クッキーを食べたあと、あなたは魔法を唱え始めます。
あなたの MP ははじめ... | [
{
"submission_id": "aoj_3144_9198724",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=int64_t;\n\nint main(){\n int n;\n ll M,k;\n cin >> n >> M >> k;\n\n vector<ll> a(n+1);\n vector<ll> as(n+1,0);\n ll asum=0;\n \n for(int i=1;i<=n;i++){\n cin >> a[i];\n asum+=a[i];... |
aoj_3142_cpp | F: ボタンの木
問題文
$N$ 頂点 $N-1$ 辺からなる木があり、$i$ 番目の辺は $u_i$ 番目の頂点と $v_i$ 番目の頂点を接続しています。
各頂点にはボタンが咲いており、$i$ 番目の頂点に咲いているボタンをボタン $i$ と呼ぶことにします。
はじめ、ボタン $i$ の美しさは $a_i$ です。
ボタン $i$ を押すたびに、ボタン $i$ の美しさを隣接するボタンに $1$ ずつ分け与えます。
すなわち、$i$ 番目の頂点に $c_1, ..., c_k$ 番目の頂点が隣接している場合、ボタン $i$ の美しさが $k$ 減少し、ボタン $c_1, ..., c_k$ の美しさがそれぞれ $1$ ずつ増加し... | [
{
"submission_id": "aoj_3142_10412835",
"code_snippet": "// AOJ #3142 Tree of Peony\n// 2025.4.23\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf),... |
aoj_3150_cpp | N: 3人協力ゲーム
リアクティブ問題です。
問題文
$1000$ ビットの非負整数が $200$ 個あり、$a_1, \ldots, a_{100}, b_1, \ldots, b_{100}$ とします。
アリスは $a_1, \ldots, a_{100}$ を確認し、$3000$ ビットのメモ $X$ をチャーリーのために残します。
ボブは $b_1, \ldots, b_{100}$ を確認し、$3000$ ビットのメモ $Y$ をチャーリーのために残します。
チャーリーはメモ $X, Y$ の情報をもとに、$100$ 個の質問に答えます。
$i$ 番目の質問は $1000$ ビットの非負整数 $c_i$ で表され、チャー... | [
{
"submission_id": "aoj_3150_10466106",
"code_snippet": "/*\n * _|_|_|_|_| _|_|_|_| _|_|_| _|_|_|_|_| _|_|_| _|_|\n * _| _| _| _| _| _| _|\n * _| _|_|_| _|_| _| _|_| _|\n * _| _| _| _| ... |
aoj_3147_cpp | K: トーナメント
問題文
京都大学クスノキ前にて、$2$ 人用対戦ゲームのトーナメントが行われようとしています。
このトーナメントの参加者は $2^N$ 人いて、 $1$ から $2^N$ までの番号がついています。
参加者のうちの $2$ 人が戦った時の勝敗は、$0$ と $1$ からなる長さ $2^N-1$ の文字列 $S$ によって表されます。
人 $x$ と人 $y$ $(1 \le x < y \le 2^N)$ が戦ったとき、
$S_{y-x} = 0$ のとき、人 $x$ が勝ち、
$S_{y-x} = 1$ のとき、人 $y$ が勝つ
ことが分かっています。
トーナメントは参加者が一列に並ぶことで始まり、以下の通り... | [
{
"submission_id": "aoj_3147_10215807",
"code_snippet": "// AOJ #3147\n// Tournament 2025.2.13\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while ... |
aoj_3148_cpp | L: 木の彩色
問題文
モデューロさんは木の絵を描くのがとてもうまいです。
モデューロさんは長い年月をかけて頂点が $N$ 個である木の絵を書きました。
この木の頂点には $1$ から $N$ までの番号がついており、頂点 $a_i$ と $b_i$ $(1 \leq i \leq N-1)$ は直接辺でつながれています。
すべての頂点には色がまだ塗られていません。
モデューロさんが書いたこの木の絵はたくさんの人を感動させ、有名な美術館に飾られることが決まりました。
この美術館には順に $N$ 人の人が来場します。モデューロさんは来場者特典として、それぞれの人に $1$ 枚ずつ木の絵のコピーを配布することにしました。
さらに、来場者... | [
{
"submission_id": "aoj_3148_10155594",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n ios::sync_with_stdio(false); \n cin.tie(nullptr);\n int N; cin >> N;\n vector<vector<int>> g(N);\n for(int i=0;i<N-1;i++){\n int u,v; cin >> u >> v; \n u--; v--... |
aoj_3156_cpp | Problem F: Abyss and Coins
数直線上の座標 $0,1,2,\ldots,N$ に足場があり、座標 $i$ の足場には $i$ 枚のコインがあります。
ウサギのネムは、最初座標
$0$の足場にいて、好きな回数だけジャンプを繰り返すことによって、足場にあるコインを集めたいと思っています。
$1$ 回目のジャンプでは好きな距離だけ飛ぶことが出来ますが、 $2$ 回目以降は、今いる足場の座標と $1$ つ前にいた足場の座標の丁度真ん中の座標にしか飛ぶことが出来ません。
つまり、 $i$ 回ジャンプをした後到達する座標を $x_i$ とし、最初に飛ぶ座標を $X$ とすると、
$x_0=0$,
$x_1=X$,
$... | [
{
"submission_id": "aoj_3156_4837127",
"code_snippet": "#include <bits/stdc++.h>\n \nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pai... |
aoj_3152_cpp | Problem B: Canceling Sequence
Problem
1以上の整数からなる、長さ $N$ の数列 $A_1, \ldots , A_N$ が与えられます。
以下の条件を満たす数列 $B_1, \ldots , B_N$ を出力してください。
$B_i$は $0$ でない整数である。
$-10^9 ≤ B_i≤ 10^9$
$A_1\times B_1 + \ldots + A_N\times B_N = 0$
Constraints
入力は以下の条件を満たす。
$2 ≤ N ≤ 2 \times 10^5$
$1 ≤ A_i ≤ 1000$
入力は全て整数である。
Input
入力は以下の形式で標準入力から与え... | [
{
"submission_id": "aoj_3152_10371258",
"code_snippet": "#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\nsigned main(){\n int N;\n cin>>N;\n vector<int> A(N),B(N);\n for(int &i:A)cin>>i;\n if(N%2==0){\n for(int i=0;i<N;i+=2)B[i]=A[i+1],B[i+1]=-A[i];\n }else{\n ... |
aoj_3155_cpp | Problem E: LCM Count
Problem
1以上の整数 $N$ が与えられます。
1以上 $N$ 以下の整数からなる、重複のない有限個の要素を持つ整数列 $A_0,A_1,\ldots,A_{k-1}$ であって、 ${\rm lcm}(A_0,A_1,\ldots,A_{k-1})=N$
となる数列の数を求めなさい。
ここで、 ${\rm lcm}(A_0,A_1,\ldots,A_{k-1})$ は数列の全要素に対する最小公倍数を意味します。なお、答えは大きくなることがあるので、 $10^9+7$ で割った余りを求めてください。
Constraints
入力は以下の条件を満たす。
$1 \leq ... | [
{
"submission_id": "aoj_3155_10092029",
"code_snippet": "// competitive-verifier: PROBLEM\n#include <cstdint>\n#include <iostream>\n#include <type_traits>\n#include <utility>\nnamespace internal {\n// @param m `1 <= m`\n// @return x mod m\nconstexpr std::int64_t safe_mod(std::int64_t x, std::int64_t m) {\n ... |
aoj_3154_cpp | Problem D: Treasure Mountains
Problem
$N$ 個の山があり、 それぞれ $1 , 2 , \ldots ,N$ の番号が割り振られています。
ここには、たくさんのお宝が眠っていると噂されています。
また、この地域には長さ $M$ の数列が言い伝えられており、その数列の $i (1 ≤ i ≤ M)$ 番目の数字は $d_i$ です。
山田君は $Q$ 個の巻物を入手しました。 $i (1 ≤ i ≤ Q)$ 番目の巻物には、3つの数字 $x_i, y_i, z_i$ が書かれています。
巻物の3つの数字は、宝のある山の番号を探すヒントになるようです。
また、巻物には次のような情報... | [
{
"submission_id": "aoj_3154_9741089",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\ntypedef long long int ll;\n\nll mod_inv(ll a,ll p){\n\tll b=p,x=1LL,y=0LL;\n\twhile(b){\n\t\tll t=a/b;\n\t\ta-=t*b; swap(a,b);\n\t\tx-=t*y; swap(x,y);\n\t}\n\treturn (x... |
aoj_3153_cpp | Problem C: Flip Difference Sequence
Problem
ツバサさんは $N$ 個の整数からなる数列 $A=\{A_1,A_2,\ldots,A_N\}$ と、縦 $N$ 行、横 $N$ 列のマス目 $B, X$ を持っています。
また、 $B, X$ のすべてのマスにははじめ $0$ が書き込んであります。
以降、 $B, X$ の上から $i$ 行目、左から $j$ 列目に書き込んである数をそれぞれ $B_{i,j},\,X_{i,j}$ と表記します。
ツバサさんは最初、任意の $(i,j)(1\leq i,j\leq N)$ に対し、 $X_{i,j}=1$ または $X_{i,j}=-1$ と... | [
{
"submission_id": "aoj_3153_10086332",
"code_snippet": "// competitive-verifier: PROBLEM\n#include <cassert>\n#include <vector>\n#include <cstdint>\n#include <iostream>\n#include <type_traits>\n#include <utility>\nnamespace internal {\n// @param m `1 <= m`\n// @return x mod m\nconstexpr std::int64_t safe_m... |
aoj_3157_cpp | Problem G: Fitness
Problem
外出することが少ないツバサくんは、家で筋トレを毎日行うようにしている。
筋トレのレパートリーは $N$ 種類あり、 $i (1 \leqq i \leqq N)$ 種類目のトレーニングを1回行うと、 $t_i$ 分で $p_i$ だけ筋力アップする。
ただし、それぞれのトレーニングは筋力にとても負荷がかかるので、基本的に1回しか行うことができない。
負荷がかかる場所はバラバラなので、複数種類のトレーニングを行うことは可能だ。
また、ツバサくんは休憩も重要だと考えていて、 $K$ 分費やして休憩することができる。
十分に休憩をすることで筋力も回復し、以前既に行ったトレーニング全てを... | [
{
"submission_id": "aoj_3157_7073173",
"code_snippet": "#include <iostream>\n#include <string.h>\nusing namespace std;\nlong long int dp[2002][2002];\nlong long int ts[2001];\nlong long int ps[2001];\n\nint t;\nvoid f(int t2,int p2,long long int s2){\n\tif(t2>t)return ;\n\tif(dp[t2][p2]<s2)dp[t2][p2]=s2;\n}... |
aoj_3160_cpp | Problem J: Meet on the Island
Problem
やまだくんは、友達と会うために旅行をすることにしました。
やまだくんの住む国は $N$ 個の島からなる島国であり、島と島の間には $M$ 個の海流が流れています。
$i$ 番目の海流が島 $A_i$ から島 $B_i$ に流れている時、またその時のみ、やまだくんは海流に乗ることで島 $A_i$ から島 $B_i$ に移動することができます。
やまだくんは、はじめ島 $1$ にいるものとします。以下の $Q$ 個のクエリを処理してください。
$i$ 番目のクエリでは、クエリの種類を表す $X_i$ と、島の番号を表す $Y_i$ が与えられます。
クエリ 1：... | [
{
"submission_id": "aoj_3160_10497568",
"code_snippet": "#include <bits/extc++.h>\n\nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector<pair<int, int>> AB(M);\n \n vector<vector<int>> nanachi(N), rev(N);\n \n for (int i = 0 ; i < M; i++) {\n int a, b;\n cin >> a >> b;\n ... |
aoj_3158_cpp | Problem H: RGBtree
Problem
$N$ 頂点 $N-1$ 辺からなる木があり、頂点には $1,2,\ldots,N$ の番号が、辺には $1,2,\ldots,N-1$ の番号がついており、 $i$ 番目の辺は頂点 $a_i$ と 頂点 $b_i$
を繋ぎます。
カトー君は、赤、緑、青の三色を用いてこの木の全ての頂点に色をつけます。
以下、'R' で赤、'G' で緑、'B' で青を表します。
あるパスに含まれる赤色で塗られた頂点の個数を $r$ 、緑色で塗られた頂点の個数を $g$ 、青色で塗られた頂点の個数を $b$ としたとき、 $\max (r,g,b)$ をそのパスのペナルティと定義します。
木全体の... | [
{
"submission_id": "aoj_3158_4861050",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\nvector<vector<int>> g;\nstring res, col = \"RGB\";\n\nvector<int> search_diameter();\nvoid mod_coloring(int now, int par, int dist, int ad = 1);\nint calc_dist(int now, int par, int dist);\nint ... |
aoj_3163_cpp | Problem M: Star Gazer
Problem
suta君は夜空を見ていた際に、オリジナルの新しい星座を思いつきました。
思いついた星座は $N$ 個の星からなり、 $N-1$ 本の線で結ばれています。
具体的には、 $i(1 \leq i \leq N-1)$ 本目の線が、 $a_i$ 番目の星と $b_i$ 番目の星を結びます。どの星も、少なくとも1つの別の星と結ばれます。
suta君は、この星座における、 $p(1 \leq p \leq N)$ 番目の星の美しさを次のように定義しました。
$q(1 \leq q \leq N)$ 番目の星の明るさを $l_q$ 、 $p$ 番目の星と $q$ 番目の星の距離を $... | [
{
"submission_id": "aoj_3163_10092502",
"code_snippet": "// AOJ #3163\n// Star Gazer 2025.1.11\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 最大 10^5 頂点想定 (問題制約)\nstatic const int MAXN = 100005;\n\n// 各頂点の明るさ、部分木の明るさ合計、beauty(distSum) を格納\nlong long L[MAXN+1]; // brightness\nlong long subB[M... |
aoj_3162_cpp | Problem L: Count Pow Sum
Problem
$Q$ 個の3つの整数の組 $(a_i,l_i,r_i) (1 \leq i \leq Q)$ が与えられる。
それぞれの組に対し、
$\displaystyle \sum_{k=l_i}^{r_i}\left\lfloor{\left(a_i+\sqrt{a_i^2-1}\right)^k}\right\rfloor$ を $10^9+7$
で割った余りを求めよ。
但し、$\lfloor{x}\rfloor$ は $x$ 以下である最大の整数を表す。
Constraints
入力は以下の条件を満たす。
$1 \leq Q \leq 10000$
$1 \leq ... | [
{
"submission_id": "aoj_3162_9739986",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\ntypedef long long int ll;\nconstexpr ll mod=1e9+7;\n\nstruct mat{\n\tll x[3][3];\n\tfriend mat operator*(mat &a,mat &b){\n\t\tmat c;\n\t\tfor(int i=0;i<3;i++){\n\t\t\tfor(int j=0;j<3;j++)... |
aoj_3159_cpp | Problem I: Magical Matrix
Problem
魔女の紬さんは、$N × N$ のマス目を持っています。上から $i$ 行目、左から $j$ 行目のマスをマス $( i , j )$ と呼びます。
$ N^2$ 個のマスのうち、 $M$ 個のマスには既に整数が書き込まれており、そのうち $i$ 個目はマス $( A_i , B_i )$ で、書き込まれている数は $C_i$ です。
紬さんは、まだ数が書かれていないマス全てについて、それぞれ $0$ 以上 $2^K$ 未満の整数のうちいずれかを書き込むことが出来ます。
全てのマスに整数が書き込まれた後、紬さんはマス目が $1 × 1$ となるまで魔法を連続して使い... | [
{
"submission_id": "aoj_3159_10093281",
"code_snippet": "// competitive-verifier: PROBLEM\n#include <cassert>\n#include <vector>\n#include <cstdint>\n#include <iostream>\n#include <type_traits>\n#include <utility>\nnamespace internal {\n// @param m `1 <= m`\n// @return x mod m\nconstexpr std::int64_t safe_m... |
aoj_3165_cpp | B: 三角形足し算
問題
長さ $N$ の数列 $A = (a_1, ..., a_N)$ があり、値は最初全て $0$ である。
数列 $A$ に対して、以下で説明するクエリを $Q$ 回行う。
二つの正整数 $l$, $k$ が与えられる。$0 \leq i < k$ を満たす各整数 $i$ に対して $a_{l+i}$ に $i+1$ を加算する。
$Q$ 回のクエリを順に処理した後の数列 $A$ を出力せよ。
入力形式
入力は $Q + 1$ 行で与えられる。
$N$ $Q$
$l_1$ $k_1$
$l_2$ $k_2$
...
$l_Q$ $k_Q$
$1$ 行目には、数列の長さ $N$ とクエリの数 $Q$ が空白区切... | [
{
"submission_id": "aoj_3165_10637653",
"code_snippet": "#pragma region Macros\n#include <bits/stdc++.h>\n\nusing namespace std;\nusing lint = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing int128 = __int128_t;\n#define all(x) (x).begin(), (x).end()\n#define EPS 1e-8\n#define un... |
aoj_3166_cpp | C: Not Found
問題
文字
0
,
1
からなる長さ $n$ の相異なる文字列が $m$ 個与えられるので、以下の条件をすべて満たす文字列 $t$ を構築せよ。
$t$ は
0
,
1
,
*
のみからなる長さ $n$ の文字列である
$t$ に含まれる
0
と
1
の個数の合計は $20$ 以下である
$t$ 中の文字
*
を
0
または
1
にどのように置き換えても、全ての $1 \leq i \leq m$ に対して，与えられた $i$ 番目の文字列 $s_i$ と $t$ が一致することはない
入力形式
$n$ $m$
$s_1$
...
$s_m$
制約
$1 \leq n$
$1 \leq m < 2^n$
$... | [
{
"submission_id": "aoj_3166_10760316",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 9223372036854775807\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 2500005\... |
aoj_3167_cpp | D: Many Points
問題
二次元平面上に $N$ 個の点があります。それぞれには $1$ から $N$ までの番号がついており、$i$ 番目の点 $p_i$ の座標は $(x_i, y_i)$ です。異なる番号がつけられた二つの点が重なることはありません。
あなたはこれらの $N$ 個の点全てからのユークリッド距離が等しい直線 $L$ を引きたいです。より形式的には、点 $p_i$ と直線 $L$ との距離を $d(p_i, L)$ と表記するとき、$d(p_1, L) = d(p_2, L) = \ldots = d(p_N, L)$ となる直線 $L$ を求めたいです。
しかし、そのような直線が常に存在するわけではあり... | [
{
"submission_id": "aoj_3167_10760592",
"code_snippet": "// AOJ #3167 Many Points\n// 2025.4.7\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tif (c == '-') {\tc = gc(... |
aoj_3169_cpp | F: n 角錐グラフ
問題
$n$ 角錐グラフを以下のように定義する。
頂点数は $n + 1$ である。
頂点 $0$ と自身を除くすべての頂点との間に、重み付きの無向辺が張られている。
頂点 $1, 2, …, n$ はこの順にサイクルとなるように、重み付きの無向辺が張られている。
あなたは $n$ 角錐グラフ上の頂点 $0$ を出発し、異なる $k$ 個の辺を通って頂点 $0$ に戻ってくる必要がある。一度通った辺は，たとえ向きが異なっても二度と通ることはできない。
同じ頂点を何回通っても構わないし、途中で頂点 $0$ を通っても構わない。
これを満たす道順を良いサーキットと呼ぶ。より形式的には、以下のように定義される。
$n... | [
{
"submission_id": "aoj_3169_10697597",
"code_snippet": "#ifndef HIDDEN_IN_VS // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 =... |
aoj_3173_cpp | B Hokkaido_University2
問題文
ほむちゃんは春から北海道大学に入学しました。
今日は初めての授業。しかし大変、寝坊をしてしまいました。
ほむちゃんは初めての授業に間に合うことができるのでしょうか。
札幌は碁盤目状の町並みで知られています。
より正確には、札幌はxy平面で表されます。
ほむちゃんは各時刻 $t=0,1,2,\ldots$ で次のいずれかの行動をします。
ほむちゃんは時刻 $t$ に $(x,y)$ にいるとします。
$x$ が偶数または $t$ が偶数のとき時刻 $t+1$ に $(x+1,y)$ に移動する。
$x$ が奇数または $t$ が偶数のとき時刻 $t+1$ に $(x-1,y)$ に... | [
{
"submission_id": "aoj_3173_5075124",
"code_snippet": "#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constan... |
aoj_3174_cpp | C - No Palindromes
問題文
umg くんは長さ $N$ の英小文字からなる文字列 $S$ を持っています。
umg くんは回文が苦手なので、$S$ の文字を自由に並び替えて、次の条件を満たす文字列 $T$ を作ることにしました。
$T$ のどの長さ $2$ 以上の連続する部分文字列も回文ではない。
このような $T$ が存在するかどうか判定し、存在するならば $1$ つ求めてください。
入力
入力は以下の形式で標準入力から与えられる。
$N$
$S$
制約
$1 \leq N \leq 10^5$
$S$ は英小文字からなる長さ $N$ の文字列である。
出力
条件を満たす文字列 $T$ が存在しない場合は、
-1... | [
{
"submission_id": "aoj_3174_4875827",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b)... |
aoj_3168_cpp | E: えびちゃんを捕獲せよ
問題
あ やせいの えびちゃんが とびだしてきた！
頂点数 $N$、辺数 $M$ の無向グラフで表されるフィールドがある。頂点は $1$ から $N$ まで、辺は $1$ から $M$ までで、それぞれ番号付けされている。また、各頂点には
a
から
z
の英小文字のいずれかが $1$ つ書かれている。
えびちゃんは任意の頂点に出現する可能性がある。
えびちゃんは、ある頂点に出現した後、すぐに別の頂点へワープして逃げてしまう。
えびちゃんは、次の条件をすべて満たすとき、頂点 $u$ から頂点 $v$ へワープすることができる。
$u$ から $v$ へ、$K$ 本以下の辺を辿って移動できる。
$u$ に書か... | [
{
"submission_id": "aoj_3168_10848645",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define INF 1e8\nvoid warshall_floyd(vector<vector<int>> &M) {\n int n = M.size();\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n for (int k = 0; k < n; k++)\n ... |
aoj_3175_cpp | D - Parallel Sort
問題文
これはインタラクティブな問題です。
$1$ 以上 $2^N$ 以下の整数を並び替えた順列 $P$ が隠されています。
あなたは以下の操作を $60$ 回だけ行うことができます。
操作によって $P$ を特定してください。
操作
長さ $2^N$ の整数列 $A$ を宣言する。
$A$ の要素は $1$ 以上 $2^N$ 以下の整数でなければならない。
長さ $2^N$ の整数列 $C$ が用意される。
$C$ の要素ははじめすべて $0$ である。
各 $i$ $(1 \le i \le 2^N)$ について、次が行われる。
$P_{A_i} > P_i$ のとき、$C_{A_i}$ に ... | [
{
"submission_id": "aoj_3175_4850876",
"code_snippet": "#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset... |
aoj_3171_cpp | H: Traditional Company
問題
あなたは Z 社の労働環境委員会の一員である。この役職たるもの、社員の出退勤時間や人間関係のモニタリングは欠かせないものだ。
Z 社には $N$ 人の社員がいる。それぞれの社員は $1$ から $N$ までの整数で番号付けられており、整数が小さいほど社員として新しいことを表す。社員が違えば仕事効率は十人十色だ。長時間の勤務もものともしない人もいれば、残業が嫌いな人や、そもそも仕事が苦手な人だっているのだ。具体的には、$i$ 番目の社員がすでに $t$ 単位時間働いているとき、単位時間 $\left[ t, t+1 \right)$ の間の仕事効率 $c_{i, t}$ は以下のよう... | [
{
"submission_id": "aoj_3171_6169756",
"code_snippet": "//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define UNIQUE(a) (a).erase(uni... |
aoj_3177_cpp | F Painting
問題文
$N$ 個のマスが横一列に並んでいます。マスは左から順に $1, 2, \ldots N$ と番号がつけられています。
各マスは赤、青、黄、緑のいずれか $1$ 色で塗られています。
現在のマスの状態は長さ $N$ の文字列で表され、$S$ の $i$ 文字目がマス $i$ の色を表しています。(
R
、
B
、
Y
、
G
がそれぞれ赤、青、黄、緑に対応します。)
heno 君はこのマス目に対して以下の操作を何度でも行うことができます。
操作 : $1\leq i \leq N-1$ かつマス $i$ とマス $i+1$ の色が異なるような $i$ を選ぶ。マス $i$ とマス $i+1$ を、どちら... | [
{
"submission_id": "aoj_3177_6452179",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#includ... |
aoj_3178_cpp | G Katsusando
問題文
お腹がすいたhenoくんは、カツサンドを食べることにしました。
直線上にカツが $N$ 個あります。 $i$ 個目のカツは位置 $X_i$ にあり、その重さは $W_i$ です。henoくんは、次のようにしてカツサンドを作ります。
パンを $1$ 個ずつ持ったやむなくくんとてんぷらくんを、直線上の好きな位置に配置する。 $2$ 人を同じ位置に配置してもよい。この操作にかかる時間は $1$ 秒である。カツのある位置に配置した場合、彼らはその場にあるカツを拾い、パンの上に載せる。 $2$ 人が同じ位置にいる場合は、やむなくくんがカツを拾う。カツを拾うのにかかる時間は無視できる。
やむなくくんとてんぷらく... | [
{
"submission_id": "aoj_3178_10356303",
"code_snippet": "// AOJ #3178 Katsu Sando\n// 2025.4.7\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1LL << 60;\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc();... |
aoj_3179_cpp | H Tree Queries
問題文
umgくんは、 $N$ 頂点の木を持っています。頂点 $i \ (1\leq i \leq N)$ の重みは $v_i$ です。 $j \ (1 \leq j \leq N-1)$ 番目の辺は、頂点 $a_i$ と頂点 $b_i$ を結び、その重みは $w_i$ です。さらに、木全体の重みを「 $\sum_{1\leq a \lt b \leq N} \mathrm{dist}(a,b) v_a v_b$ を $998244353$ で割った余り」で定めます。 (15:05 更新)
ここで、 $\mathrm{dist}(a,b)$ というのは、頂点 $a$ から頂点 $b$ の最短経路上に存... | [
{
"submission_id": "aoj_3179_5786720",
"code_snippet": "// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3179\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\ntemplate<typename T, T MOD = 1000000007>\nstruct Mint{\n inline static constexpr... |
aoj_3181_cpp | J Proper Instructions
問題文
umgくんは $1$ 次元上の座標 $0$ にいます。今は時刻 $0$ です。時刻が $1$ 進むごとに、今いる座標より $1$ 大きい座標に移動するか、 $1$ 小さい座標に移動するか、その座標にとどまるかという行動ができます。
$N$ 個の指示が与えられます。 $i$ 個目の指示は、「時刻 $T_i$ には $L_i\leq x \leq R_i$ を満たす座標 $x$ にいなければならない」という指示です。
$N$個の指示の空でない部分集合 $S$ が「適切」であるとは、umgくんが上手く動くことで、 $S$ に含まれるすべての指示に従うことができることをいいます。
適切であ... | [
{
"submission_id": "aoj_3181_10355871",
"code_snippet": "// AOJ #3181 Proper Instructions\n// 2025.4.7\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll MOD = 998244353;\n\nstruct Instr { ll t, L, R; };\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int... |
aoj_3182_cpp | K Umg Kart
問題文
umgくんは車のレース大会を主催することにしました。このレースでは、距離が $L$ のコース上を走って競います。スタート位置を位置 $0$ とし、スタート位置からゴールに向かって $x$ だけ離れた位置を位置 $x$ と呼ぶことにします。
てんぷらくんはこのレース大会に参加することにしました。今回のレースではてんぷらくんを含め $N$ 人の選手が参加することになっており、 $N$ 人の選手には$1$から$N$までの番号がついています。てんぷらくんは選手$1$です。
さて、レースが始まると、各選手はスタート位置から一斉に走り出します。選手 $i$ の車は距離 $1$ 進むのに $t_i$ 秒かかります。u... | [
{
"submission_id": "aoj_3182_5823737",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <cassert>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <... |
aoj_3180_cpp | I GCDMST
問題文
$1,\ldots,N$ の番号を振られた $N$ 個の頂点があります。
最初、これらを繋ぐ辺はありません。
あなたはいくつかの辺を追加してこのグラフを連結にしたいと思いました。
頂点 $i$ と $j$ を繋ぐ辺を追加するには $A_{\gcd(i,j)}$ のコストがかかります。
このグラフを連結にするように辺を追加するとき、かかるコストの和の最小値を求めてください。
入力
入力は以下の形式で標準入力から与えられる。
$N$
$A_1$ $\cdots$ $A_N$
制約
入力はすべて整数である。
$2 \leq N \leq 2\times10^5$
$1 \leq A_i \leq 10^9$
出力... | [
{
"submission_id": "aoj_3180_9552743",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n//make -f ../makefile SRC=\n\n/*\nbrute force => RE or TLE\nfrom index or rather k(th) infers v and w\n*/\n//------------------------------------------------------------------------------\nbool DEBUG = ... |
aoj_3183_cpp | L - Flipping a Path
問題文
$N$ 頂点 $M$ 辺の単純有向グラフが与えられます。
このグラフの頂点には $1$ から $N$ までの番号がついていて、辺には $1$ から $M$ までの番号がついています。
辺 $i$ $(1 \le i \le M)$ は、頂点 $u_i$ から頂点 $v_i$ へ向かう辺です。
次の条件を満たす辺素パスが存在するか判定し、存在する場合はそのようなパスの長さの最小値を求めてください。
パスに含まれるすべての辺の向きを逆にすると、グラフ全体が強連結になる。
ここで長さ $K$ $(K \ge 0)$ の辺素パスとは、次の条件を満たす辺の番号の列 $(e_1, e_2... | [
{
"submission_id": "aoj_3183_8041018",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (u... |
aoj_3170_cpp | G: Freqs
問題
長さ $N$ の数列 $A = (a_1, a_2, ..., a_N)$ が与えられます。以下で説明されるクエリを $Q$ 回処理してください。クエリは $4$ 種類あります。
クエリ 1: $l, r, x$ が与えられるので、$a_i$ ($l \leq i \leq r$) を $\min(a_i, x)$ に更新する。
クエリ 2: $l, r, x$ が与えられるので、$a_i$ ($l \leq i \leq r$) を $\max(a_i, x)$ に更新する。
クエリ 3: $l, r, x$ が与えられるので、$a_i$ ($l \leq i \leq r$) を $a_i + x$ に更... | [
{
"submission_id": "aoj_3170_10536492",
"code_snippet": "// AOJ #3170 Freqs\n// 2025.5.28\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\td... |
aoj_3186_cpp | B: 累積差
問題
えびちゃんは最近「るいせきわ」のお勉強をして、数列 $(a_1, a_2, \dots, a_N)$ およびある整数 $L$, $R$ に対して $a_L+a_{L+1}+\dots+a_R$ を高速に求められるようになりました。
ここで、和ではなく差を求めることはできないか気になってきたえびちゃんのために、それを高速に処理するプログラムを書いてあげてください。より形式的には、数列 $(a_1, a_2, \dots, a_N)$ と整数 $L$, $R$ に対して $a_L-a_{L+1}-\dots-a_R$ を求めてください。
入力形式
$N$ $Q$
$a_1$ $a_2$ ... $a_N$
$L_1$... | [
{
"submission_id": "aoj_3186_9652237",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n\nvoid acc() {\n int n, q;\n cin >> n >> q;\n vector<long long > pref(n + 1),v(n+1);\n for (int i = 1; i <= n; i++) {\n cin >>v[i] ;\n }\n for (int i = 1 ; i<=n ; i++){\n ... |
aoj_3184_cpp | M Hokkaido High School
問題文
北海道高校には $M$ 個の科目があり、それぞれ $1, 2, 3$ の $3$ 段階で成績がつけられます。
各生徒の成績は長さ $M$ の文字列で表され、$i$ 文字目が科目 $i$ の成績を表します。
生徒 $X$ が生徒 $Y$ の「上位互換」であるとは
すべての科目 $i$ について ($X$ の科目 $i$ の成績) $\geq$ ($Y$ の科目 $i$ の成績)
ある科目 $i$ が存在して。($X$ の科目 $i$ の成績) $>$ ($Y$ の科目 $i$ の成績)
の両方がみたされることをいいます。
今、教室には誰もいません。これから $Q$ 人の生徒が順に教... | [
{
"submission_id": "aoj_3184_10422733",
"code_snippet": "#define INF 4'000'000'000'000'000'037LL\n#include <bits/stdc++.h>\nusing namespace std;\nnamespace {\nusing ll = long long;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pll = pair<ll, ll>;\n#define vc vector\ntemplate <class T>\... |
aoj_3187_cpp | C: mod reap
問題
hara 君は、夏休みに農家でアルバイトをすることになりました。
hara 君の仕事は、会津人参の収穫と、パック詰めです。
畑には現在 $N$ 本の会津人参がなっていて、
$i$ ($1 \leq i \leq N$) 番目の会津人参の重さは $A_i$ グラムです。
hara 君は畑から何本かの会津人参を収穫し、 1 パックに
ちょうど
$K$ グラムずつ入るように分けます。
このとき、会津人参をカットして複数のパックに分けてもかまいません。
また、全部収穫しても、あるいは
1 本も収穫しなくてもよい
ものとします。
hara 君は几帳面なので、以下の条件により hara 君の「満足度」が変化します。... | [
{
"submission_id": "aoj_3187_8525842",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, b... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.